2 * Copyright (c) 1992 The Regents of the University of California.
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 * 3. 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
30 /* OPENBSD ORIGINAL: lib/libc/stdlib/strtoll.c */
35 #include <sys/types.h>
43 * Convert a string to a long long.
45 * Ignores `locale' stuff. Assumes that the upper and lower case
46 * alphabets and digits are each contiguous.
49 strtoll(const char *nptr, char **endptr, int base)
52 long long acc, cutoff;
57 * Skip white space and pick up leading +/- sign if any.
58 * If base is 0, allow 0x for hex and 0 for octal, else
59 * assume decimal; if base is already 16, allow 0x.
63 c = (unsigned char) *s++;
73 if ((base == 0 || base == 16) &&
74 c == '0' && (*s == 'x' || *s == 'X')) {
80 base = c == '0' ? 8 : 10;
83 * Compute the cutoff value between legal numbers and illegal
84 * numbers. That is the largest legal value, divided by the
85 * base. An input number that is greater than this value, if
86 * followed by a legal input character, is too big. One that
87 * is equal to this value may be valid or not; the limit
88 * between valid and invalid numbers is then based on the last
89 * digit. For instance, if the range for long longs is
90 * [-9223372036854775808..9223372036854775807] and the input base
91 * is 10, cutoff will be set to 922337203685477580 and cutlim to
92 * either 7 (neg==0) or 8 (neg==1), meaning that if we have
93 * accumulated a value > 922337203685477580, or equal but the
94 * next digit is > 7 (or 8), the number is too big, and we will
95 * return a range error.
97 * Set any if any `digits' consumed; make it negative to indicate
100 cutoff = neg ? LLONG_MIN : LLONG_MAX;
101 cutlim = cutoff % base;
110 for (acc = 0, any = 0;; c = (unsigned char) *s++) {
114 c -= isupper(c) ? 'A' - 10 : 'a' - 10;
122 if (acc < cutoff || (acc == cutoff && c > cutlim)) {
132 if (acc > cutoff || (acc == cutoff && c > cutlim)) {
144 *endptr = (char *) (any ? s - 1 : nptr);
147 #endif /* HAVE_STRTOLL */