xref: /netbsd-src/external/gpl3/binutils/dist/libiberty/strtoll.c (revision 9573673d78c64ea1eac42d7f2e9521be89932ae5)
1*9573673dSchristos /*-
2*9573673dSchristos  * Copyright (c) 2014 The Regents of the University of California.
3*9573673dSchristos  * All rights reserved.
4*9573673dSchristos  *
5*9573673dSchristos  * Redistribution and use in source and binary forms, with or without
6*9573673dSchristos  * modification, are permitted provided that the following conditions
7*9573673dSchristos  * are met:
8*9573673dSchristos  * 1. Redistributions of source code must retain the above copyright
9*9573673dSchristos  *    notice, this list of conditions and the following disclaimer.
10*9573673dSchristos  * 2. Redistributions in binary form must reproduce the above copyright
11*9573673dSchristos  *    notice, this list of conditions and the following disclaimer in the
12*9573673dSchristos  *    documentation and/or other materials provided with the distribution.
13*9573673dSchristos  * 3. [rescinded 22 July 1999]
14*9573673dSchristos  * 4. Neither the name of the University nor the names of its contributors
15*9573673dSchristos  *    may be used to endorse or promote products derived from this software
16*9573673dSchristos  *    without specific prior written permission.
17*9573673dSchristos  *
18*9573673dSchristos  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
19*9573673dSchristos  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20*9573673dSchristos  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21*9573673dSchristos  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
22*9573673dSchristos  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23*9573673dSchristos  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24*9573673dSchristos  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25*9573673dSchristos  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26*9573673dSchristos  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27*9573673dSchristos  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28*9573673dSchristos  * SUCH DAMAGE.
29*9573673dSchristos  */
30*9573673dSchristos 
31*9573673dSchristos /*
32*9573673dSchristos 
33*9573673dSchristos @deftypefn Supplemental {long long int} strtoll (const char *@var{string}, @
34*9573673dSchristos   char **@var{endptr}, int @var{base})
35*9573673dSchristos @deftypefnx Supplemental {unsigned long long int} strtoul (@
36*9573673dSchristos   const char *@var{string}, char **@var{endptr}, int @var{base})
37*9573673dSchristos 
38*9573673dSchristos The @code{strtoll} function converts the string in @var{string} to a
39*9573673dSchristos long long integer value according to the given @var{base}, which must be
40*9573673dSchristos between 2 and 36 inclusive, or be the special value 0.  If @var{base}
41*9573673dSchristos is 0, @code{strtoll} will look for the prefixes @code{0} and @code{0x}
42*9573673dSchristos to indicate bases 8 and 16, respectively, else default to base 10.
43*9573673dSchristos When the base is 16 (either explicitly or implicitly), a prefix of
44*9573673dSchristos @code{0x} is allowed.  The handling of @var{endptr} is as that of
45*9573673dSchristos @code{strtod} above.  The @code{strtoull} function is the same, except
46*9573673dSchristos that the converted value is unsigned.
47*9573673dSchristos 
48*9573673dSchristos @end deftypefn
49*9573673dSchristos 
50*9573673dSchristos */
51*9573673dSchristos 
52*9573673dSchristos #ifdef HAVE_CONFIG_H
53*9573673dSchristos #include "config.h"
54*9573673dSchristos #endif
55*9573673dSchristos #ifdef HAVE_LIMITS_H
56*9573673dSchristos #include <limits.h>
57*9573673dSchristos #endif
58*9573673dSchristos #ifdef HAVE_SYS_PARAM_H
59*9573673dSchristos #include <sys/param.h>
60*9573673dSchristos #endif
61*9573673dSchristos #include <errno.h>
62*9573673dSchristos #ifdef NEED_DECLARATION_ERRNO
63*9573673dSchristos extern int errno;
64*9573673dSchristos #endif
65*9573673dSchristos #include "safe-ctype.h"
66*9573673dSchristos 
67*9573673dSchristos #ifdef HAVE_LONG_LONG
68*9573673dSchristos 
69*9573673dSchristos __extension__
70*9573673dSchristos typedef unsigned long long ullong_type;
71*9573673dSchristos 
72*9573673dSchristos __extension__
73*9573673dSchristos typedef long long llong_type;
74*9573673dSchristos 
75*9573673dSchristos /* FIXME: It'd be nice to configure around these, but the include files are too
76*9573673dSchristos    painful.  These macros should at least be more portable than hardwired hex
77*9573673dSchristos    constants. */
78*9573673dSchristos 
79*9573673dSchristos #ifndef ULLONG_MAX
80*9573673dSchristos #define ULLONG_MAX (~(ullong_type)0) /* 0xFFFFFFFFFFFFFFFF */
81*9573673dSchristos #endif
82*9573673dSchristos 
83*9573673dSchristos #ifndef LLONG_MAX
84*9573673dSchristos #define LLONG_MAX ((llong_type)(ULLONG_MAX >> 1)) /* 0x7FFFFFFFFFFFFFFF */
85*9573673dSchristos #endif
86*9573673dSchristos 
87*9573673dSchristos #ifndef LLONG_MIN
88*9573673dSchristos #define LLONG_MIN (~LLONG_MAX) /* 0x8000000000000000 */
89*9573673dSchristos #endif
90*9573673dSchristos 
91*9573673dSchristos /*
92*9573673dSchristos  * Convert a string to a long long integer.
93*9573673dSchristos  *
94*9573673dSchristos  * Ignores `locale' stuff.  Assumes that the upper and lower case
95*9573673dSchristos  * alphabets and digits are each contiguous.
96*9573673dSchristos  */
97*9573673dSchristos llong_type
strtoll(const char * nptr,char ** endptr,register int base)98*9573673dSchristos strtoll(const char *nptr, char **endptr, register int base)
99*9573673dSchristos {
100*9573673dSchristos 	register const char *s = nptr;
101*9573673dSchristos 	register ullong_type acc;
102*9573673dSchristos 	register int c;
103*9573673dSchristos 	register ullong_type cutoff;
104*9573673dSchristos 	register int neg = 0, any, cutlim;
105*9573673dSchristos 
106*9573673dSchristos 	/*
107*9573673dSchristos 	 * Skip white space and pick up leading +/- sign if any.
108*9573673dSchristos 	 * If base is 0, allow 0x for hex and 0 for octal, else
109*9573673dSchristos 	 * assume decimal; if base is already 16, allow 0x.
110*9573673dSchristos 	 */
111*9573673dSchristos 	do {
112*9573673dSchristos 		c = *s++;
113*9573673dSchristos 	} while (ISSPACE(c));
114*9573673dSchristos 	if (c == '-') {
115*9573673dSchristos 		neg = 1;
116*9573673dSchristos 		c = *s++;
117*9573673dSchristos 	} else if (c == '+')
118*9573673dSchristos 		c = *s++;
119*9573673dSchristos 	if ((base == 0 || base == 16) &&
120*9573673dSchristos 	    c == '0' && (*s == 'x' || *s == 'X')) {
121*9573673dSchristos 		c = s[1];
122*9573673dSchristos 		s += 2;
123*9573673dSchristos 		base = 16;
124*9573673dSchristos 	}
125*9573673dSchristos 	if (base == 0)
126*9573673dSchristos 		base = c == '0' ? 8 : 10;
127*9573673dSchristos 
128*9573673dSchristos 	/*
129*9573673dSchristos 	 * Compute the cutoff value between legal numbers and illegal
130*9573673dSchristos 	 * numbers.  That is the largest legal value, divided by the
131*9573673dSchristos 	 * base.  An input number that is greater than this value, if
132*9573673dSchristos 	 * followed by a legal input character, is too big.  One that
133*9573673dSchristos 	 * is equal to this value may be valid or not; the limit
134*9573673dSchristos 	 * between valid and invalid numbers is then based on the last
135*9573673dSchristos 	 * digit.  For instance, if the range for longs is
136*9573673dSchristos 	 * [-2147483648..2147483647] and the input base is 10,
137*9573673dSchristos 	 * cutoff will be set to 214748364 and cutlim to either
138*9573673dSchristos 	 * 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated
139*9573673dSchristos 	 * a value > 214748364, or equal but the next digit is > 7 (or 8),
140*9573673dSchristos 	 * the number is too big, and we will return a range error.
141*9573673dSchristos 	 *
142*9573673dSchristos 	 * Set any if any `digits' consumed; make it negative to indicate
143*9573673dSchristos 	 * overflow.
144*9573673dSchristos 	 */
145*9573673dSchristos 	cutoff = neg ? -(ullong_type)LLONG_MIN : LLONG_MAX;
146*9573673dSchristos 	cutlim = cutoff % (ullong_type)base;
147*9573673dSchristos 	cutoff /= (ullong_type)base;
148*9573673dSchristos 	for (acc = 0, any = 0;; c = *s++) {
149*9573673dSchristos 		if (ISDIGIT(c))
150*9573673dSchristos 			c -= '0';
151*9573673dSchristos 		else if (ISALPHA(c))
152*9573673dSchristos 			c -= ISUPPER(c) ? 'A' - 10 : 'a' - 10;
153*9573673dSchristos 		else
154*9573673dSchristos 			break;
155*9573673dSchristos 		if (c >= base)
156*9573673dSchristos 			break;
157*9573673dSchristos 		if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
158*9573673dSchristos 			any = -1;
159*9573673dSchristos 		else {
160*9573673dSchristos 			any = 1;
161*9573673dSchristos 			acc *= base;
162*9573673dSchristos 			acc += c;
163*9573673dSchristos 		}
164*9573673dSchristos 	}
165*9573673dSchristos 	if (any < 0) {
166*9573673dSchristos 		acc = neg ? LLONG_MIN : LLONG_MAX;
167*9573673dSchristos 		errno = ERANGE;
168*9573673dSchristos 	} else if (neg)
169*9573673dSchristos 		acc = -acc;
170*9573673dSchristos 	if (endptr != 0)
171*9573673dSchristos 		*endptr = (char *) (any ? s - 1 : nptr);
172*9573673dSchristos 	return (acc);
173*9573673dSchristos }
174*9573673dSchristos 
175*9573673dSchristos #endif /* ifdef HAVE_LONG_LONG */
176