[apple/libc.git] / stdlib / strtoimax-fbsd.c

/*-
 * Copyright (c) 1992, 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.
 */

#if defined(LIBC_SCCS) && !defined(lint)
static char sccsid[] = "from @(#)strtol.c	8.1 (Berkeley) 6/4/93";
#endif /* LIBC_SCCS and not lint */
#include <sys/cdefs.h>
__FBSDID("$FreeBSD: src/lib/libc/stdlib/strtoimax.c,v 1.9 2003/01/01 18:48:43 schweikh Exp $");

#include "xlocale_private.h"

#include <ctype.h>
#include <errno.h>
#include <stdlib.h>
#include <inttypes.h>

/*
 * Convert a string to an intmax_t integer.
 *
 * Assumes that the upper and lower case
 * alphabets and digits are each contiguous.
 */
intmax_t
strtoimax_l(const char * __restrict nptr, char ** __restrict endptr, int base,
    locale_t loc)
{
	const char *s;
	uintmax_t acc;
	char c;
	uintmax_t cutoff;
	int neg, any, cutlim;

	NORMALIZE_LOCALE(loc);
	/*
	 * 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.
	 */
	s = nptr;
	do {
		c = *s++;
	} while (isspace_l((unsigned char)c, loc));
	if (c == '-') {
		neg = 1;
		c = *s++;
	} else {
		neg = 0;
		if (c == '+')
			c = *s++;
	}
	if ((base == 0 || base == 16) &&
	    c == '0' && (*s == 'x' || *s == 'X')) {
		c = s[1];
		s += 2;
		base = 16;
	}
	if (base == 0)
		base = c == '0' ? 8 : 10;
	acc = any = 0;
	if (base < 2 || base > 36)
		goto noconv;

	/*
	 * 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 intmax_t is
	 * [-9223372036854775808..9223372036854775807] and the input base
	 * is 10, cutoff will be set to 922337203685477580 and cutlim to
	 * either 7 (neg==0) or 8 (neg==1), meaning that if we have
	 * accumulated a value > 922337203685477580, 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 ? (uintmax_t)-(INTMAX_MIN + INTMAX_MAX) + INTMAX_MAX
	    : INTMAX_MAX;
	cutlim = cutoff % base;
	cutoff /= base;
	for ( ; ; c = *s++) {
		if (c >= '0' && c <= '9')
			c -= '0';
		else if (c >= 'A' && c <= 'Z')
			c -= 'A' - 10;
		else if (c >= 'a' && c <= 'z')
			c -= '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 ? INTMAX_MIN : INTMAX_MAX;
		errno = ERANGE;
	} else if (!any) {
noconv:
		errno = EINVAL;
	} else if (neg)
		acc = -acc;
	if (endptr != NULL)
		*endptr = (char *)(any ? s - 1 : nptr);
	return (acc);
}

intmax_t
strtoimax(const char * __restrict nptr, char ** __restrict endptr, int base)
{
	return strtoimax_l(nptr, endptr, base, __current_locale());
}
Commit	Line	Data
224c7076 A	1	/*-
	2	* Copyright (c) 1992, 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[] = "from @(#)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/strtoimax.c,v 1.9 2003/01/01 18:48:43 schweikh Exp $");
	39
	40	#include "xlocale_private.h"
	41
	42	#include <ctype.h>
	43	#include <errno.h>
	44	#include <stdlib.h>
	45	#include <inttypes.h>
	46
	47	/*
	48	* Convert a string to an intmax_t integer.
	49	*
	50	* Assumes that the upper and lower case
	51	* alphabets and digits are each contiguous.
	52	*/
	53	intmax_t
	54	strtoimax_l(const char * __restrict nptr, char ** __restrict endptr, int base,
	55	locale_t loc)
	56	{
	57	const char *s;
	58	uintmax_t acc;
	59	char c;
	60	uintmax_t cutoff;
	61	int neg, any, cutlim;
	62
	63	NORMALIZE_LOCALE(loc);
	64	/*
65	* Skip white space and pick up leading +/- sign if any.
66	* If base is 0, allow 0x for hex and 0 for octal, else
67	* assume decimal; if base is already 16, allow 0x.
68	*/
69	s = nptr;
70	do {
71	c = *s++;
72	} while (isspace_l((unsigned char)c, loc));
73	if (c == '-') {
74	neg = 1;
75	c = *s++;
76	} else {
77	neg = 0;
78	if (c == '+')
79	c = *s++;
80	}
81	if ((base == 0 \|\| base == 16) &&
82	c == '0' && (s == 'x' \|\| s == 'X')) {
83	c = s[1];
84	s += 2;
85	base = 16;
86	}
87	if (base == 0)
88	base = c == '0' ? 8 : 10;
89	acc = any = 0;
90	if (base < 2 \|\| base > 36)
91	goto noconv;
92
93	/*
94	* Compute the cutoff value between legal numbers and illegal
95	* numbers. That is the largest legal value, divided by the
96	* base. An input number that is greater than this value, if
97	* followed by a legal input character, is too big. One that
98	* is equal to this value may be valid or not; the limit
99	* between valid and invalid numbers is then based on the last
100	* digit. For instance, if the range for intmax_t is
101	* [-9223372036854775808..9223372036854775807] and the input base
102	* is 10, cutoff will be set to 922337203685477580 and cutlim to
103	* either 7 (neg==0) or 8 (neg==1), meaning that if we have
104	* accumulated a value > 922337203685477580, or equal but the
105	* next digit is > 7 (or 8), the number is too big, and we will
106	* return a range error.
107	*
108	* Set 'any' if any `digits' consumed; make it negative to indicate
109	* overflow.
110	*/
111	cutoff = neg ? (uintmax_t)-(INTMAX_MIN + INTMAX_MAX) + INTMAX_MAX
112	: INTMAX_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 ? INTMAX_MIN : INTMAX_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	intmax_t
148	strtoimax(const char * __restrict nptr, char ** __restrict endptr, int base)
149	{
150	return strtoimax_l(nptr, endptr, base, __current_locale());
151	}