2 * Copyright (c) 1992, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Copyright (c) 2011 The FreeBSD Foundation
7 * Portions of this software were developed by David Chisnall
8 * under sponsorship from the FreeBSD Foundation.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 4. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
41 /* #include <sys/cdefs.h> */
50 * Convert a string to a long long integer.
52 * Assumes that the upper and lower case
53 * alphabets and digits are each contiguous.
55 ROKEN_LIB_FUNCTION long long ROKEN_LIB_CALL
56 strtoll(const char * nptr, char ** endptr, int base)
59 unsigned long long acc;
62 unsigned long long cutoff;
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.
73 } while (isspace((unsigned char)c));
82 if ((base == 0 || base == 16) &&
83 c == '0' && (*s == 'x' || *s == 'X') &&
84 ((s[1] >= '0' && s[1] <= '9') ||
85 (s[1] >= 'A' && s[1] <= 'F') ||
86 (s[1] >= 'a' && s[1] <= 'f'))) {
92 base = c == '0' ? 8 : 10;
94 if (base < 2 || base > 36)
98 * Compute the cutoff value between legal numbers and illegal
99 * numbers. That is the largest legal value, divided by the
100 * base. An input number that is greater than this value, if
101 * followed by a legal input character, is too big. One that
102 * is equal to this value may be valid or not; the limit
103 * between valid and invalid numbers is then based on the last
104 * digit. For instance, if the range for quads is
105 * [-9223372036854775808..9223372036854775807] and the input base
106 * is 10, cutoff will be set to 922337203685477580 and cutlim to
107 * either 7 (neg==0) or 8 (neg==1), meaning that if we have
108 * accumulated a value > 922337203685477580, or equal but the
109 * next digit is > 7 (or 8), the number is too big, and we will
110 * return a range error.
112 * Set 'any' if any `digits' consumed; make it negative to indicate
115 cutoff = neg ? (unsigned long long)-(LLONG_MIN + LLONG_MAX) + LLONG_MAX
117 cutlim = cutoff % base;
119 for ( ; ; c = *s++) {
120 if (c >= '0' && c <= '9')
122 else if (c >= 'A' && c <= 'Z')
124 else if (c >= 'a' && c <= 'z')
130 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
139 ret = neg ? LLONG_MIN : LLONG_MAX;
145 ret = -(long long)acc;
150 *endptr = (char *)(any ? s - 1 : nptr);