git.saurik.com Git - apple/libc.git/blame_incremental

... / ...

Commit	Line	Data
	1	/*-
	2	* Copyright (c) 1990, 1993
	3	* The Regents of the University of California. All rights reserved.
	4	*
	5	* Redistribution and use in source and binary forms, with or without
	6	* modification, are permitted provided that the following conditions
	7	* are met:
	8	* 1. Redistributions of source code must retain the above copyright
	9	* notice, this list of conditions and the following disclaimer.
	10	* 2. Redistributions in binary form must reproduce the above copyright
	11	* notice, this list of conditions and the following disclaimer in the
	12	* documentation and/or other materials provided with the distribution.
	13	* 3. All advertising materials mentioning features or use of this software
	14	* must display the following acknowledgement:
	15	* This product includes software developed by the University of
	16	* California, Berkeley and its contributors.
	17	* 4. Neither the name of the University nor the names of its contributors
	18	* may be used to endorse or promote products derived from this software
	19	* without specific prior written permission.
	20	*
	21	* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
	22	* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	23	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
	24	* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
	25	* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
	26	* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
	27	* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
	28	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
	29	* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
	30	* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
	31	* SUCH DAMAGE.
	32	*/
	33
	34	#if defined(LIBC_SCCS) && !defined(lint)
	35	static char sccsid[] = "@(#)strtol.c 8.1 (Berkeley) 6/4/93";
	36	#endif /* LIBC_SCCS and not lint */
	37	#include <sys/cdefs.h>
	38	__FBSDID("$FreeBSD: src/lib/libc/stdlib/strtol.c,v 1.17 2002/09/06 11:23:59 tjr Exp $");
	39
	40	#include "xlocale_private.h"
	41
	42	#include <limits.h>
	43	#include <ctype.h>
	44	#include <errno.h>
	45	#include <stdlib.h>
	46
	47
	48	/*
	49	* Convert a string to a long integer.
	50	*
	51	* Assumes that the upper and lower case
	52	* alphabets and digits are each contiguous.
	53	*/
	54	long
	55	strtol_l(const char * __restrict nptr, char ** __restrict endptr, int base,
	56	locale_t loc)
	57	{
	58	const char *s;
	59	unsigned long acc;
	60	char c;
	61	unsigned long cutoff;
	62	int neg, any, cutlim;
	63
	64	NORMALIZE_LOCALE(loc);
	65	/*
	66	* Skip white space and pick up leading +/- sign if any.
	67	* If base is 0, allow 0x for hex and 0 for octal, else
	68	* assume decimal; if base is already 16, allow 0x.
	69	*/
	70	s = nptr;
	71	do {
	72	c = *s++;
	73	} while (isspace_l((unsigned char)c, loc));
	74	if (c == '-') {
	75	neg = 1;
	76	c = *s++;
	77	} else {
	78	neg = 0;
	79	if (c == '+')
	80	c = *s++;
	81	}
	82	if ((base == 0 \|\| base == 16) &&
	83	c == '0' && (s == 'x' \|\| s == 'X')) {
	84	c = s[1];
	85	s += 2;
	86	base = 16;
	87	}
	88	if (base == 0)
	89	base = c == '0' ? 8 : 10;
	90	acc = any = 0;
	91	if (base < 2 \|\| base > 36)
	92	goto noconv;
	93
	94	/*
	95	* Compute the cutoff value between legal numbers and illegal
	96	* numbers. That is the largest legal value, divided by the
	97	* base. An input number that is greater than this value, if
	98	* followed by a legal input character, is too big. One that
	99	* is equal to this value may be valid or not; the limit
	100	* between valid and invalid numbers is then based on the last
	101	* digit. For instance, if the range for longs is
	102	* [-2147483648..2147483647] and the input base is 10,
	103	* cutoff will be set to 214748364 and cutlim to either
	104	* 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated
	105	* a value > 214748364, or equal but the next digit is > 7 (or 8),
	106	* the number is too big, and we will return a range error.
	107	*
	108	* Set 'any' if any `digits' consumed; make it negative to indicate
	109	* overflow.
	110	*/
	111	cutoff = neg ? (unsigned long)-(LONG_MIN + LONG_MAX) + LONG_MAX
	112	: LONG_MAX;
	113	cutlim = cutoff % base;
	114	cutoff /= base;
	115	for ( ; ; c = *s++) {
	116	if (c >= '0' && c <= '9')
	117	c -= '0';
	118	else if (c >= 'A' && c <= 'Z')
	119	c -= 'A' - 10;
	120	else if (c >= 'a' && c <= 'z')
	121	c -= 'a' - 10;
	122	else
	123	break;
	124	if (c >= base)
	125	break;
	126	if (any < 0 \|\| acc > cutoff \|\| (acc == cutoff && c > cutlim))
	127	any = -1;
	128	else {
	129	any = 1;
	130	acc *= base;
	131	acc += c;
	132	}
	133	}
	134	if (any < 0) {
	135	acc = neg ? LONG_MIN : LONG_MAX;
	136	errno = ERANGE;
	137	} else if (!any) {
	138	noconv:
	139	errno = EINVAL;
	140	} else if (neg)
	141	acc = -acc;
	142	if (endptr != NULL)
	143	endptr = (char )(any ? s - 1 : nptr);
	144	return (acc);
	145	}
	146
	147	long
	148	strtol(const char * __restrict nptr, char ** __restrict endptr, int base)
	149	{
	150	return strtol_l(nptr, endptr, base, __current_locale());
	151	}