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 #if defined(LIBC_SCCS) && !defined(lint)
38 static char sccsid[] = "@(#)strtoq.c 8.1 (Berkeley) 6/4/93";
39 #endif /* LIBC_SCCS and not lint */
40 #include <limits.h>
41 #include <errno.h>
42 #include <ctype.h>
43 #include <stdlib.h>
44 #include "xlocale_private.h"
45
46 /*
47 * Convert a string to a long long integer.
48 *
49 * Assumes that the upper and lower case
50 * alphabets and digits are each contiguous.
51 */
52 long long
strtoll_l(const char * __restrict nptr,char ** __restrict endptr,int base,locale_t locale)53 strtoll_l(const char * __restrict nptr, char ** __restrict endptr, int base,
54 locale_t locale)
55 {
56 const char *s;
57 unsigned long long acc;
58 char c;
59 unsigned long long cutoff;
60 int neg, any, cutlim;
61 FIX_LOCALE(locale);
62
63 /*
64 * Skip white space and pick up leading +/- sign if any.
65 * If base is 0, allow 0b for binary, 0x for hex, and 0 for
66 * octal, else assume decimal; if base is already 2, allow
67 * 0b; if base is already 16, allow 0x.
68 */
69 s = nptr;
70 do {
71 c = *s++;
72 } while (isspace_l((unsigned char)c, locale));
73 if (c == '-') {
74 neg = 1;
75 c = *s++;
76 } else {
77 neg = 0;
78 if (c == '+')
79 c = *s++;
80 }
81 if ((base == 0 || base == 16) &&
82 c == '0' && (*s == 'x' || *s == 'X') &&
83 ((s[1] >= '0' && s[1] <= '9') ||
84 (s[1] >= 'A' && s[1] <= 'F') ||
85 (s[1] >= 'a' && s[1] <= 'f'))) {
86 c = s[1];
87 s += 2;
88 base = 16;
89 }
90 if ((base == 0 || base == 2) &&
91 c == '0' && (*s == 'b' || *s == 'B') &&
92 (s[1] >= '0' && s[1] <= '1')) {
93 c = s[1];
94 s += 2;
95 base = 2;
96 }
97 if (base == 0)
98 base = c == '0' ? 8 : 10;
99 acc = any = 0;
100 if (base < 2 || base > 36)
101 goto noconv;
102
103 /*
104 * Compute the cutoff value between legal numbers and illegal
105 * numbers. That is the largest legal value, divided by the
106 * base. An input number that is greater than this value, if
107 * followed by a legal input character, is too big. One that
108 * is equal to this value may be valid or not; the limit
109 * between valid and invalid numbers is then based on the last
110 * digit. For instance, if the range for quads is
111 * [-9223372036854775808..9223372036854775807] and the input base
112 * is 10, cutoff will be set to 922337203685477580 and cutlim to
113 * either 7 (neg==0) or 8 (neg==1), meaning that if we have
114 * accumulated a value > 922337203685477580, or equal but the
115 * next digit is > 7 (or 8), the number is too big, and we will
116 * return a range error.
117 *
118 * Set 'any' if any `digits' consumed; make it negative to indicate
119 * overflow.
120 */
121 cutoff = neg ? (unsigned long long)-(LLONG_MIN + LLONG_MAX) + LLONG_MAX
122 : LLONG_MAX;
123 cutlim = cutoff % base;
124 cutoff /= base;
125 for ( ; ; c = *s++) {
126 if (c >= '0' && c <= '9')
127 c -= '0';
128 else if (c >= 'A' && c <= 'Z')
129 c -= 'A' - 10;
130 else if (c >= 'a' && c <= 'z')
131 c -= 'a' - 10;
132 else
133 break;
134 if (c >= base)
135 break;
136 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
137 any = -1;
138 else {
139 any = 1;
140 acc *= base;
141 acc += c;
142 }
143 }
144 if (any < 0) {
145 acc = neg ? LLONG_MIN : LLONG_MAX;
146 errno = ERANGE;
147 } else if (!any) {
148 noconv:
149 errno = EINVAL;
150 } else if (neg)
151 acc = -acc;
152 if (endptr != NULL)
153 *endptr = (char *)(any ? s - 1 : nptr);
154 return (acc);
155 }
156 long long
strtoll(const char * __restrict nptr,char ** __restrict endptr,int base)157 strtoll(const char * __restrict nptr, char ** __restrict endptr, int base)
158 {
159 return strtoll_l(nptr, endptr, base, __get_locale());
160 }
161