1*7c478bd9Sstevel@tonic-gate /*
2*7c478bd9Sstevel@tonic-gate  * CDDL HEADER START
3*7c478bd9Sstevel@tonic-gate  *
4*7c478bd9Sstevel@tonic-gate  * The contents of this file are subject to the terms of the
5*7c478bd9Sstevel@tonic-gate  * Common Development and Distribution License, Version 1.0 only
6*7c478bd9Sstevel@tonic-gate  * (the "License").  You may not use this file except in compliance
7*7c478bd9Sstevel@tonic-gate  * with the License.
8*7c478bd9Sstevel@tonic-gate  *
9*7c478bd9Sstevel@tonic-gate  * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
10*7c478bd9Sstevel@tonic-gate  * or http://www.opensolaris.org/os/licensing.
11*7c478bd9Sstevel@tonic-gate  * See the License for the specific language governing permissions
12*7c478bd9Sstevel@tonic-gate  * and limitations under the License.
13*7c478bd9Sstevel@tonic-gate  *
14*7c478bd9Sstevel@tonic-gate  * When distributing Covered Code, include this CDDL HEADER in each
15*7c478bd9Sstevel@tonic-gate  * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
16*7c478bd9Sstevel@tonic-gate  * If applicable, add the following below this CDDL HEADER, with the
17*7c478bd9Sstevel@tonic-gate  * fields enclosed by brackets "[]" replaced with your own identifying
18*7c478bd9Sstevel@tonic-gate  * information: Portions Copyright [yyyy] [name of copyright owner]
19*7c478bd9Sstevel@tonic-gate  *
20*7c478bd9Sstevel@tonic-gate  * CDDL HEADER END
21*7c478bd9Sstevel@tonic-gate  */
22*7c478bd9Sstevel@tonic-gate /*
23*7c478bd9Sstevel@tonic-gate  * Copyright (c) 1991-1995, by Sun Microsystems, Inc.
24*7c478bd9Sstevel@tonic-gate  * All rights reserved.
25*7c478bd9Sstevel@tonic-gate  */
26*7c478bd9Sstevel@tonic-gate 
27*7c478bd9Sstevel@tonic-gate #pragma ident	"%Z%%M%	%I%	%E% SMI"
28*7c478bd9Sstevel@tonic-gate 
29*7c478bd9Sstevel@tonic-gate /*
30*7c478bd9Sstevel@tonic-gate  * The routines are NOT part of the interface, merely internal
31*7c478bd9Sstevel@tonic-gate  * utilities which assist in making the interface standalone.
32*7c478bd9Sstevel@tonic-gate  */
33*7c478bd9Sstevel@tonic-gate 
34*7c478bd9Sstevel@tonic-gate #include <sys/promif.h>
35*7c478bd9Sstevel@tonic-gate #include <sys/promimpl.h>
36*7c478bd9Sstevel@tonic-gate 
37*7c478bd9Sstevel@tonic-gate /*
38*7c478bd9Sstevel@tonic-gate  * a version of string copy that is bounded
39*7c478bd9Sstevel@tonic-gate  */
40*7c478bd9Sstevel@tonic-gate char *
prom_strncpy(register char * s1,register char * s2,size_t n)41*7c478bd9Sstevel@tonic-gate prom_strncpy(register char *s1, register char *s2, size_t n)
42*7c478bd9Sstevel@tonic-gate {
43*7c478bd9Sstevel@tonic-gate 	register char *os1 = s1;
44*7c478bd9Sstevel@tonic-gate 
45*7c478bd9Sstevel@tonic-gate 	n++;
46*7c478bd9Sstevel@tonic-gate 	while (--n != 0 && (*s1++ = *s2++) != '\0')
47*7c478bd9Sstevel@tonic-gate 		;
48*7c478bd9Sstevel@tonic-gate 	if (n != 0)
49*7c478bd9Sstevel@tonic-gate 		while (--n != 0)
50*7c478bd9Sstevel@tonic-gate 			*s1++ = '\0';
51*7c478bd9Sstevel@tonic-gate 	return (os1);
52*7c478bd9Sstevel@tonic-gate }
53*7c478bd9Sstevel@tonic-gate 
54*7c478bd9Sstevel@tonic-gate /*
55*7c478bd9Sstevel@tonic-gate  * and one that knows no bounds
56*7c478bd9Sstevel@tonic-gate  */
57*7c478bd9Sstevel@tonic-gate char *
prom_strcpy(register char * s1,register char * s2)58*7c478bd9Sstevel@tonic-gate prom_strcpy(register char *s1, register char *s2)
59*7c478bd9Sstevel@tonic-gate {
60*7c478bd9Sstevel@tonic-gate 	register char *os1;
61*7c478bd9Sstevel@tonic-gate 
62*7c478bd9Sstevel@tonic-gate 	os1 = s1;
63*7c478bd9Sstevel@tonic-gate 	while (*s1++ = *s2++)
64*7c478bd9Sstevel@tonic-gate 		;
65*7c478bd9Sstevel@tonic-gate 	return (os1);
66*7c478bd9Sstevel@tonic-gate }
67*7c478bd9Sstevel@tonic-gate 
68*7c478bd9Sstevel@tonic-gate /*
69*7c478bd9Sstevel@tonic-gate  * a copy of string compare that is bounded
70*7c478bd9Sstevel@tonic-gate  */
71*7c478bd9Sstevel@tonic-gate int
prom_strncmp(register char * s1,register char * s2,register size_t n)72*7c478bd9Sstevel@tonic-gate prom_strncmp(register char *s1, register char *s2, register size_t n)
73*7c478bd9Sstevel@tonic-gate {
74*7c478bd9Sstevel@tonic-gate 	n++;
75*7c478bd9Sstevel@tonic-gate 	if (s1 == s2)
76*7c478bd9Sstevel@tonic-gate 		return (0);
77*7c478bd9Sstevel@tonic-gate 	while (--n != 0 && *s1 == *s2++)
78*7c478bd9Sstevel@tonic-gate 		if (*s1++ == '\0')
79*7c478bd9Sstevel@tonic-gate 			return (0);
80*7c478bd9Sstevel@tonic-gate 	return ((n == 0) ? 0: (*s1 - s2[-1]));
81*7c478bd9Sstevel@tonic-gate }
82*7c478bd9Sstevel@tonic-gate 
83*7c478bd9Sstevel@tonic-gate /*
84*7c478bd9Sstevel@tonic-gate  * and one that knows no bounds
85*7c478bd9Sstevel@tonic-gate  */
86*7c478bd9Sstevel@tonic-gate int
prom_strcmp(register char * s1,register char * s2)87*7c478bd9Sstevel@tonic-gate prom_strcmp(register char *s1, register char *s2)
88*7c478bd9Sstevel@tonic-gate {
89*7c478bd9Sstevel@tonic-gate 	while (*s1 == *s2++)
90*7c478bd9Sstevel@tonic-gate 		if (*s1++ == '\0')
91*7c478bd9Sstevel@tonic-gate 			return (0);
92*7c478bd9Sstevel@tonic-gate 	return (*s1 - *--s2);
93*7c478bd9Sstevel@tonic-gate }
94*7c478bd9Sstevel@tonic-gate 
95*7c478bd9Sstevel@tonic-gate /*
96*7c478bd9Sstevel@tonic-gate  * finds the length of a succession of non-NULL chars
97*7c478bd9Sstevel@tonic-gate  */
98*7c478bd9Sstevel@tonic-gate int
prom_strlen(register char * s)99*7c478bd9Sstevel@tonic-gate prom_strlen(register char *s)
100*7c478bd9Sstevel@tonic-gate {
101*7c478bd9Sstevel@tonic-gate 	register int n = 0;
102*7c478bd9Sstevel@tonic-gate 
103*7c478bd9Sstevel@tonic-gate 	while (*s++)
104*7c478bd9Sstevel@tonic-gate 		n++;
105*7c478bd9Sstevel@tonic-gate 
106*7c478bd9Sstevel@tonic-gate 	return (n);
107*7c478bd9Sstevel@tonic-gate }
108*7c478bd9Sstevel@tonic-gate 
109*7c478bd9Sstevel@tonic-gate /*
110*7c478bd9Sstevel@tonic-gate  * return the ptr in sp at which the character c last
111*7c478bd9Sstevel@tonic-gate  * appears; 0 if not found
112*7c478bd9Sstevel@tonic-gate  */
113*7c478bd9Sstevel@tonic-gate char *
prom_strrchr(register char * sp,register char c)114*7c478bd9Sstevel@tonic-gate prom_strrchr(register char *sp, register char c)
115*7c478bd9Sstevel@tonic-gate {
116*7c478bd9Sstevel@tonic-gate 	register char *r;
117*7c478bd9Sstevel@tonic-gate 
118*7c478bd9Sstevel@tonic-gate 	for (r = (char *)0; *sp != (char)0; ++sp)
119*7c478bd9Sstevel@tonic-gate 		if (*sp == c)
120*7c478bd9Sstevel@tonic-gate 			r = sp;
121*7c478bd9Sstevel@tonic-gate 	return (r);
122*7c478bd9Sstevel@tonic-gate }
123*7c478bd9Sstevel@tonic-gate 
124*7c478bd9Sstevel@tonic-gate /*
125*7c478bd9Sstevel@tonic-gate  * Concatenate string s2 to string s1
126*7c478bd9Sstevel@tonic-gate  */
127*7c478bd9Sstevel@tonic-gate char *
prom_strcat(register char * s1,register char * s2)128*7c478bd9Sstevel@tonic-gate prom_strcat(register char *s1, register char *s2)
129*7c478bd9Sstevel@tonic-gate {
130*7c478bd9Sstevel@tonic-gate 	char *os1 = s1;
131*7c478bd9Sstevel@tonic-gate 
132*7c478bd9Sstevel@tonic-gate 	while ((*s1) != ((char)0))
133*7c478bd9Sstevel@tonic-gate 		s1++;		/* find the end of string s1 */
134*7c478bd9Sstevel@tonic-gate 
135*7c478bd9Sstevel@tonic-gate 	while (*s1++ = *s2++)	/* Concatenate s2 */
136*7c478bd9Sstevel@tonic-gate 		;
137*7c478bd9Sstevel@tonic-gate 	return (os1);
138*7c478bd9Sstevel@tonic-gate }
139*7c478bd9Sstevel@tonic-gate 
140*7c478bd9Sstevel@tonic-gate /*
141*7c478bd9Sstevel@tonic-gate  * Return the ptr in sp at which the character c first
142*7c478bd9Sstevel@tonic-gate  * appears; NULL if not found
143*7c478bd9Sstevel@tonic-gate  */
144*7c478bd9Sstevel@tonic-gate char *
prom_strchr(register const char * sp,register int c)145*7c478bd9Sstevel@tonic-gate prom_strchr(register const char *sp, register int c)
146*7c478bd9Sstevel@tonic-gate {
147*7c478bd9Sstevel@tonic-gate 
148*7c478bd9Sstevel@tonic-gate 	do {
149*7c478bd9Sstevel@tonic-gate 		if (*sp == (char)c)
150*7c478bd9Sstevel@tonic-gate 			return ((char *)sp);
151*7c478bd9Sstevel@tonic-gate 	} while (*sp++);
152*7c478bd9Sstevel@tonic-gate 	return (NULL);
153*7c478bd9Sstevel@tonic-gate }
154