1 /*-
2 * SPDX-License-Identifier: BSD-3-Clause
3 *
4 * Copyright (c) 1992, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * Copyright (c) 2011 The FreeBSD Foundation
8 *
9 * Portions of this software were developed by David Chisnall
10 * under sponsorship from the FreeBSD Foundation.
11 *
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
14 * are met:
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * SUCH DAMAGE.
35 */
36
37 #include <limits.h>
38 #include <errno.h>
39 #include <ctype.h>
40 #include <stdlib.h>
41 #include "xlocale_private.h"
42
43 /*
44 * Convert a string to a long long integer.
45 *
46 * Assumes that the upper and lower case
47 * alphabets and digits are each contiguous.
48 */
49 long long
strtoll_l(const char * __restrict nptr,char ** __restrict endptr,int base,locale_t locale)50 strtoll_l(const char * __restrict nptr, char ** __restrict endptr, int base,
51 locale_t locale)
52 {
53 const char *s;
54 unsigned long long acc;
55 char c;
56 unsigned long long cutoff;
57 int neg, any, cutlim;
58 FIX_LOCALE(locale);
59
60 /*
61 * Skip white space and pick up leading +/- sign if any.
62 * If base is 0, allow 0b for binary, 0x for hex, and 0 for
63 * octal, else assume decimal; if base is already 2, allow
64 * 0b; if base is already 16, allow 0x.
65 */
66 s = nptr;
67 do {
68 c = *s++;
69 } while (isspace_l((unsigned char)c, locale));
70 if (c == '-') {
71 neg = 1;
72 c = *s++;
73 } else {
74 neg = 0;
75 if (c == '+')
76 c = *s++;
77 }
78 if ((base == 0 || base == 16) &&
79 c == '0' && (*s == 'x' || *s == 'X') &&
80 ((s[1] >= '0' && s[1] <= '9') ||
81 (s[1] >= 'A' && s[1] <= 'F') ||
82 (s[1] >= 'a' && s[1] <= 'f'))) {
83 c = s[1];
84 s += 2;
85 base = 16;
86 }
87 if ((base == 0 || base == 2) &&
88 c == '0' && (*s == 'b' || *s == 'B') &&
89 (s[1] >= '0' && s[1] <= '1')) {
90 c = s[1];
91 s += 2;
92 base = 2;
93 }
94 if (base == 0)
95 base = c == '0' ? 8 : 10;
96 acc = any = 0;
97 if (base < 2 || base > 36)
98 goto noconv;
99
100 /*
101 * Compute the cutoff value between legal numbers and illegal
102 * numbers. That is the largest legal value, divided by the
103 * base. An input number that is greater than this value, if
104 * followed by a legal input character, is too big. One that
105 * is equal to this value may be valid or not; the limit
106 * between valid and invalid numbers is then based on the last
107 * digit. For instance, if the range for quads is
108 * [-9223372036854775808..9223372036854775807] and the input base
109 * is 10, cutoff will be set to 922337203685477580 and cutlim to
110 * either 7 (neg==0) or 8 (neg==1), meaning that if we have
111 * accumulated a value > 922337203685477580, or equal but the
112 * next digit is > 7 (or 8), the number is too big, and we will
113 * return a range error.
114 *
115 * Set 'any' if any `digits' consumed; make it negative to indicate
116 * overflow.
117 */
118 cutoff = neg ? (unsigned long long)-(LLONG_MIN + LLONG_MAX) + LLONG_MAX
119 : LLONG_MAX;
120 cutlim = cutoff % base;
121 cutoff /= base;
122 for ( ; ; c = *s++) {
123 if (c >= '0' && c <= '9')
124 c -= '0';
125 else if (c >= 'A' && c <= 'Z')
126 c -= 'A' - 10;
127 else if (c >= 'a' && c <= 'z')
128 c -= 'a' - 10;
129 else
130 break;
131 if (c >= base)
132 break;
133 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
134 any = -1;
135 else {
136 any = 1;
137 acc *= base;
138 acc += c;
139 }
140 }
141 if (any < 0) {
142 acc = neg ? LLONG_MIN : LLONG_MAX;
143 errno = ERANGE;
144 } else if (!any) {
145 noconv:
146 errno = EINVAL;
147 } else if (neg)
148 acc = -acc;
149 if (endptr != NULL)
150 *endptr = (char *)(any ? s - 1 : nptr);
151 return (acc);
152 }
153 long long
strtoll(const char * __restrict nptr,char ** __restrict endptr,int base)154 strtoll(const char * __restrict nptr, char ** __restrict endptr, int base)
155 {
156 return strtoll_l(nptr, endptr, base, __get_locale());
157 }
158