2 * Copyright (c) 1992, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
42 #define isspace(c) ((c) == ' ' || (c) == '\t' || (c) == '\r' || (c) == '\n')
45 /* Minimum and maximum values a `signed long long int' can hold. */
47 # define LLONG_MAX 9223372036854775807LL
51 # define LLONG_MIN (-LLONG_MAX - 1LL)
53 /* Maximum value an `unsigned long long int' can hold. (Minimum is 0.) */
55 # define ULLONG_MAX 18446744073709551615ULL
58 * Convert a string to a long long integer.
60 * Assumes that the upper and lower case
61 * alphabets and digits are each contiguous.
63 long long strtoll (const char*, char **, int);
66 strtoll(const char * nptr, char ** endptr, int base)
69 unsigned long long acc;
71 unsigned long long cutoff;
75 * Skip white space and pick up leading +/- sign if any.
76 * If base is 0, allow 0x for hex and 0 for octal, else
77 * assume decimal; if base is already 16, allow 0x.
82 } while (isspace((unsigned char)c));
91 if ((base == 0 || base == 16) &&
92 c == '0' && (*s == 'x' || *s == 'X') &&
93 ((s[1] >= '0' && s[1] <= '9') ||
94 (s[1] >= 'A' && s[1] <= 'F') ||
95 (s[1] >= 'a' && s[1] <= 'f'))) {
101 base = c == '0' ? 8 : 10;
103 if (base < 2 || base > 36)
107 * Compute the cutoff value between legal numbers and illegal
108 * numbers. That is the largest legal value, divided by the
109 * base. An input number that is greater than this value, if
110 * followed by a legal input character, is too big. One that
111 * is equal to this value may be valid or not; the limit
112 * between valid and invalid numbers is then based on the last
113 * digit. For instance, if the range for quads is
114 * [-9223372036854775808..9223372036854775807] and the input base
115 * is 10, cutoff will be set to 922337203685477580 and cutlim to
116 * either 7 (neg==0) or 8 (neg==1), meaning that if we have
117 * accumulated a value > 922337203685477580, or equal but the
118 * next digit is > 7 (or 8), the number is too big, and we will
119 * return a range error.
121 * Set 'any' if any `digits' consumed; make it negative to indicate
124 cutoff = neg ? (unsigned long long)-(LLONG_MIN + LLONG_MAX) + LLONG_MAX
126 cutlim = cutoff % base;
128 for ( ; ; c = *s++) {
129 if (c >= '0' && c <= '9')
131 else if (c >= 'A' && c <= 'Z')
133 else if (c >= 'a' && c <= 'z')
139 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
148 acc = neg ? LLONG_MIN : LLONG_MAX;
150 SetLastError (ERROR_ARITHMETIC_OVERFLOW);
157 SetLastError (ERROR_INVALID_PARAMETER);
164 *endptr = (char *)(any ? s - 1 : nptr);