[apple/bootx.git] / bootx.tproj / libclite.subproj / strtol.c

/*
 * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
 *
 * @APPLE_LICENSE_HEADER_START@
 * 
 * Copyright (c) 1999-2003 Apple Computer, Inc.  All Rights Reserved.
 * 
 * This file contains Original Code and/or Modifications of Original Code
 * as defined in and that are subject to the Apple Public Source License
 * Version 2.0 (the 'License'). You may not use this file except in
 * compliance with the License. Please obtain a copy of the License at
 * http://www.opensource.apple.com/apsl/ and read it before using this
 * file.
 * 
 * The Original Code and all software distributed under the License are
 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
 * Please see the License for the specific language governing rights and
 * limitations under the License.
 * 
 * @APPLE_LICENSE_HEADER_END@
 */
/*-
 * Copyright (c) 1990, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *	This product includes software developed by the University of
 *	California, Berkeley and its contributors.
 * 4. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

/*      Copyright (c) 1995 NeXT Computer, Inc.  All rights reserved.
 *
 * HISTORY
 * 	Modified by Curtis Galloway at NeXT June 1993,
 * 	for use in the standalone library.
 *
 * 30-Nov-1995    Dean Reece at NeXT
 *      Created based on BSD4.4's strtol.c & strtoul.c.
 *      Removed dependency on _ctype_ by static versions of isupper()...
 *      Added support for "0b101..." binary constants.
 *      Commented out references to errno.
 */
/*
 *  strtol.c - string conversion utilities.
 *
 *  Copyright (c) 1998-2000 Apple Computer, Inc.
 *
 *  DRI: Josh de Cesare
 */
 
#if defined(LIBC_SCCS) && !defined(lint)
static char sccsid[] = "@(#)strtol.c	5.4 (Berkeley) 2/23/91";
#endif /* LIBC_SCCS and not lint */

#include <libclite.h>
#include <limits.h>

int isupper(char c)
{
    return (c >= 'A' && c <= 'Z');
}

int isalpha(char c)
{
    return ((c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z'));
}


int isspace(char c)
{
    return (c == ' ' || c == '\t' || c == '\n' || c == '\12');
}

int isdigit(char c)
{
    return (c >= '0' && c <= '9');
}

char tolower(char c)
{
  return isalpha(c) ? (c | 0x20) : c;
}

/*
 * Convert a string to a long integer.
 *
 * Ignores `locale' stuff.  Assumes that the upper and lower case
 * alphabets and digits are each contiguous.
 */
long
strtol(nptr, endptr, base)
	const char *nptr;
	char **endptr;
	register int base;
{
	register const char *s = nptr;
	register unsigned long acc;
	register int c;
	register unsigned long cutoff;
	register int neg = 0, any, cutlim;

	/*
	 * Skip white space and pick up leading +/- sign if any.
	 * If base is 0, allow 0x for hex and 0 for octal, else
	 * assume decimal; if base is already 16, allow 0x.
	 */
	do {
		c = *s++;
	} while (isspace(c));
	if (c == '-') {
		neg = 1;
		c = *s++;
	} else if (c == '+')
		c = *s++;
	if ((base == 0 || base == 16) &&
	    c == '0' && (*s == 'x' || *s == 'X')) {
		c = s[1];
		s += 2;
		base = 16;
	} else if ((base == 0 || base == 2) &&
	    c == '0' && (*s == 'b' || *s == 'B')) {
		c = s[1];
		s += 2;
		base = 2;
	}
	if (base == 0)
		base = c == '0' ? 8 : 10;

	/*
	 * Compute the cutoff value between legal numbers and illegal
	 * numbers.  That is the largest legal value, divided by the
	 * base.  An input number that is greater than this value, if
	 * followed by a legal input character, is too big.  One that
	 * is equal to this value may be valid or not; the limit
	 * between valid and invalid numbers is then based on the last
	 * digit.  For instance, if the range for longs is
	 * [-2147483648..2147483647] and the input base is 10,
	 * cutoff will be set to 214748364 and cutlim to either
	 * 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated
	 * a value > 214748364, or equal but the next digit is > 7 (or 8),
	 * the number is too big, and we will return a range error.
	 *
	 * Set any if any `digits' consumed; make it negative to indicate
	 * overflow.
	 */
	cutoff = neg ? -(unsigned long)LONG_MIN : LONG_MAX;
	cutlim = cutoff % (unsigned long)base;
	cutoff /= (unsigned long)base;
	for (acc = 0, any = 0;; c = *s++) {
		if (isdigit(c))
			c -= '0';
		else if (isalpha(c))
			c -= isupper(c) ? 'A' - 10 : 'a' - 10;
		else
			break;
		if (c >= base)
			break;
		if (any < 0 || acc > cutoff || acc == cutoff && c > cutlim)
			any = -1;
		else {
			any = 1;
			acc *= base;
			acc += c;
		}
	}
	if (any < 0) {
		acc = neg ? LONG_MIN : LONG_MAX;
//		errno = ERANGE;
	} else if (neg)
		acc = -acc;
	if (endptr != 0)
		*endptr = (char *)(any ? s - 1 : nptr);
	return (acc);
}


/*
 * Convert a string to an unsigned long integer.
 *
 * Ignores `locale' stuff.  Assumes that the upper and lower case
 * alphabets and digits are each contiguous.
 */
unsigned long
strtoul(nptr, endptr, base)
	const char *nptr;
	char **endptr;
	register int base;
{
	register const char *s = nptr;
	register unsigned long acc;
	register int c;
	register unsigned long cutoff;
	register int neg = 0, any, cutlim;

	/*
	 * See strtol for comments as to the logic used.
	 */
	do {
		c = *s++;
	} while (isspace(c));
	if (c == '-') {
		neg = 1;
		c = *s++;
	} else if (c == '+')
		c = *s++;
	if ((base == 0 || base == 16) &&
	    c == '0' && (*s == 'x' || *s == 'X')) {
		c = s[1];
		s += 2;
		base = 16;
	} else if ((base == 0 || base == 2) &&
	    c == '0' && (*s == 'b' || *s == 'B')) {
		c = s[1];
		s += 2;
		base = 2;
	}
	if (base == 0)
		base = c == '0' ? 8 : 10;
	cutoff = (unsigned long)ULONG_MAX / (unsigned long)base;
	cutlim = (unsigned long)ULONG_MAX % (unsigned long)base;
	for (acc = 0, any = 0;; c = *s++) {
		if (isdigit(c))
			c -= '0';
		else if (isalpha(c))
			c -= isupper(c) ? 'A' - 10 : 'a' - 10;
		else
			break;
		if (c >= base)
			break;
		if (any < 0 || acc > cutoff || acc == cutoff && c > cutlim)
			any = -1;
		else {
			any = 1;
			acc *= base;
			acc += c;
		}
	}
	if (any < 0) {
		acc = ULONG_MAX;
//		errno = ERANGE;
	} else if (neg)
		acc = -acc;
	if (endptr != 0)
		*endptr = (char *)(any ? s - 1 : nptr);
	return (acc);
}
Commit	Line	Data
04fee52e A	1	/*
	2	* Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
	3	*
	4	* @APPLE_LICENSE_HEADER_START@
	5	*
db839b1d	6	* Copyright (c) 1999-2003 Apple Computer, Inc. All Rights Reserved.
04fee52e	7	*
db839b1d A	8	* This file contains Original Code and/or Modifications of Original Code
	9	* as defined in and that are subject to the Apple Public Source License
	10	* Version 2.0 (the 'License'). You may not use this file except in
	11	* compliance with the License. Please obtain a copy of the License at
	12	* http://www.opensource.apple.com/apsl/ and read it before using this
	13	* file.
	14	*
	15	* The Original Code and all software distributed under the License are
	16	* distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
04fee52e A	17	* EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
04fee52e A	18	* INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
db839b1d A	19	* FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
	20	* Please see the License for the specific language governing rights and
	21	* limitations under the License.
04fee52e A	22	*
	23	* @APPLE_LICENSE_HEADER_END@
	24	*/
	25	/*-
	26	* Copyright (c) 1990, 1993
	27	* The Regents of the University of California. All rights reserved.
	28	*
	29	* Redistribution and use in source and binary forms, with or without
	30	* modification, are permitted provided that the following conditions
	31	* are met:
	32	* 1. Redistributions of source code must retain the above copyright
	33	* notice, this list of conditions and the following disclaimer.
	34	* 2. Redistributions in binary form must reproduce the above copyright
	35	* notice, this list of conditions and the following disclaimer in the
	36	* documentation and/or other materials provided with the distribution.
	37	* 3. All advertising materials mentioning features or use of this software
	38	* must display the following acknowledgement:
	39	* This product includes software developed by the University of
	40	* California, Berkeley and its contributors.
	41	* 4. Neither the name of the University nor the names of its contributors
	42	* may be used to endorse or promote products derived from this software
	43	* without specific prior written permission.
	44	*
	45	* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
	46	* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	47	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
	48	* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
	49	* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
	50	* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
	51	* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
	52	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
	53	* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
	54	* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
	55	* SUCH DAMAGE.
	56	*/
	57
	58	/* Copyright (c) 1995 NeXT Computer, Inc. All rights reserved.
	59	*
	60	* HISTORY
	61	* Modified by Curtis Galloway at NeXT June 1993,
	62	* for use in the standalone library.
	63	*
	64	* 30-Nov-1995 Dean Reece at NeXT
	65	* Created based on BSD4.4's strtol.c & strtoul.c.
	66	* Removed dependency on _ctype_ by static versions of isupper()...
	67	* Added support for "0b101..." binary constants.
	68	* Commented out references to errno.
	69	*/
	70	/*
	71	* strtol.c - string conversion utilities.
	72	*
	73	* Copyright (c) 1998-2000 Apple Computer, Inc.
	74	*
	75	* DRI: Josh de Cesare
	76	*/
	77
	78	#if defined(LIBC_SCCS) && !defined(lint)
	79	static char sccsid[] = "@(#)strtol.c 5.4 (Berkeley) 2/23/91";
	80	#endif /* LIBC_SCCS and not lint */
	81
	82	#include <libclite.h>
	83	#include <limits.h>
	84
	85	int isupper(char c)
86	{
87	return (c >= 'A' && c <= 'Z');
88	}
89
90	int isalpha(char c)
91	{
92	return ((c >= 'A' && c <= 'Z') \|\| (c >= 'a' && c <= 'z'));
93	}
94
95
96	int isspace(char c)
97	{
98	return (c == ' ' \|\| c == '\t' \|\| c == '\n' \|\| c == '\12');
99	}
100
101	int isdigit(char c)
102	{
103	return (c >= '0' && c <= '9');
104	}
105
106	char tolower(char c)
107	{
108	return isalpha(c) ? (c \| 0x20) : c;
109	}
110
111	/*
112	* Convert a string to a long integer.
113	*
114	* Ignores `locale' stuff. Assumes that the upper and lower case
115	* alphabets and digits are each contiguous.
116	*/
117	long
118	strtol(nptr, endptr, base)
119	const char *nptr;
120	char **endptr;
121	register int base;
122	{
123	register const char *s = nptr;
124	register unsigned long acc;
125	register int c;
126	register unsigned long cutoff;
127	register int neg = 0, any, cutlim;
128
129	/*
130	* Skip white space and pick up leading +/- sign if any.
131	* If base is 0, allow 0x for hex and 0 for octal, else
132	* assume decimal; if base is already 16, allow 0x.
133	*/
134	do {
135	c = *s++;
136	} while (isspace(c));
137	if (c == '-') {
138	neg = 1;
139	c = *s++;
140	} else if (c == '+')
141	c = *s++;
142	if ((base == 0 \|\| base == 16) &&
143	c == '0' && (s == 'x' \|\| s == 'X')) {
144	c = s[1];
145	s += 2;
146	base = 16;
147	} else if ((base == 0 \|\| base == 2) &&
148	c == '0' && (s == 'b' \|\| s == 'B')) {
149	c = s[1];
150	s += 2;
151	base = 2;
152	}
153	if (base == 0)
154	base = c == '0' ? 8 : 10;
155
156	/*
157	* Compute the cutoff value between legal numbers and illegal
158	* numbers. That is the largest legal value, divided by the
159	* base. An input number that is greater than this value, if
160	* followed by a legal input character, is too big. One that
161	* is equal to this value may be valid or not; the limit
162	* between valid and invalid numbers is then based on the last
163	* digit. For instance, if the range for longs is
164	* [-2147483648..2147483647] and the input base is 10,
165	* cutoff will be set to 214748364 and cutlim to either
166	* 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated
167	* a value > 214748364, or equal but the next digit is > 7 (or 8),
168	* the number is too big, and we will return a range error.
169	*
170	* Set any if any `digits' consumed; make it negative to indicate
171	* overflow.
172	*/
173	cutoff = neg ? -(unsigned long)LONG_MIN : LONG_MAX;
174	cutlim = cutoff % (unsigned long)base;
175	cutoff /= (unsigned long)base;
176	for (acc = 0, any = 0;; c = *s++) {
177	if (isdigit(c))
178	c -= '0';
179	else if (isalpha(c))
180	c -= isupper(c) ? 'A' - 10 : 'a' - 10;
181	else
182	break;
183	if (c >= base)
184	break;
185	if (any < 0 \|\| acc > cutoff \|\| acc == cutoff && c > cutlim)
186	any = -1;
187	else {
188	any = 1;
189	acc *= base;
190	acc += c;
191	}
192	}
193	if (any < 0) {
194	acc = neg ? LONG_MIN : LONG_MAX;
195	// errno = ERANGE;
196	} else if (neg)
197	acc = -acc;
198	if (endptr != 0)
199	endptr = (char )(any ? s - 1 : nptr);
200	return (acc);
201	}
202
203
204	/*
205	* Convert a string to an unsigned long integer.
206	*
207	* Ignores `locale' stuff. Assumes that the upper and lower case
208	* alphabets and digits are each contiguous.
209	*/
210	unsigned long
211	strtoul(nptr, endptr, base)
212	const char *nptr;
213	char **endptr;
214	register int base;
215	{
216	register const char *s = nptr;
217	register unsigned long acc;
218	register int c;
219	register unsigned long cutoff;
220	register int neg = 0, any, cutlim;
221
222	/*
223	* See strtol for comments as to the logic used.
224	*/
225	do {
226	c = *s++;
227	} while (isspace(c));
228	if (c == '-') {
229	neg = 1;
230	c = *s++;
231	} else if (c == '+')
232	c = *s++;
233	if ((base == 0 \|\| base == 16) &&
234	c == '0' && (s == 'x' \|\| s == 'X')) {
235	c = s[1];
236	s += 2;
237	base = 16;
238	} else if ((base == 0 \|\| base == 2) &&
239	c == '0' && (s == 'b' \|\| s == 'B')) {
240	c = s[1];
241	s += 2;
242	base = 2;
243	}
244	if (base == 0)
245	base = c == '0' ? 8 : 10;
246	cutoff = (unsigned long)ULONG_MAX / (unsigned long)base;
247	cutlim = (unsigned long)ULONG_MAX % (unsigned long)base;
248	for (acc = 0, any = 0;; c = *s++) {
249	if (isdigit(c))
250	c -= '0';
251	else if (isalpha(c))
252	c -= isupper(c) ? 'A' - 10 : 'a' - 10;
253	else
254	break;
255	if (c >= base)
256	break;
257	if (any < 0 \|\| acc > cutoff \|\| acc == cutoff && c > cutlim)
258	any = -1;
259	else {
260	any = 1;
261	acc *= base;
262	acc += c;
263	}
264	}
265	if (any < 0) {
266	acc = ULONG_MAX;
267	// errno = ERANGE;
268	} else if (neg)
269	acc = -acc;
270	if (endptr != 0)
271	endptr = (char )(any ? s - 1 : nptr);
272	return (acc);
273	}
274