1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
|
/*
* Copyright (c) 1992 The Regents of the University of California.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include <errno.h>
#include <inttypes.h>
#include <limits.h>
#include <stdlib.h>
#include <private/bionic_ctype.h>
template <typename T, T Min, T Max> T StrToI(const char* nptr, char** endptr, int base) {
// Ensure that base is between 2 and 36 inclusive, or the special value of 0.
if (base < 0 || base == 1 || base > 36) {
if (endptr != nullptr) *endptr = const_cast<char*>(nptr);
errno = EINVAL;
return 0;
}
// Skip white space and pick up leading +/- sign if any.
// If base is 0, allow 0x for hex and 0 for octal, else
// assume decimal; if base is already 16, allow 0x.
const char* s = nptr;
int c;
do {
c = *s++;
} while (IsSpace(c));
int neg;
if (c == '-') {
neg = 1;
c = *s++;
} else {
neg = 0;
if (c == '+') c = *s++;
}
if ((base == 0 || base == 16) && c == '0' &&
(*s == 'x' || *s == 'X') && IsXDigit(s[1])) {
c = s[1];
s += 2;
base = 16;
}
if (base == 0) base = (c == '0') ? 8 : 10;
// We always work in the negative space because the most negative value has a
// larger magnitude than the most positive value.
T cutoff = Min / base;
int cutlim = -(Min % base);
// Non-zero if any digits consumed; negative to indicate overflow/underflow.
int any = 0;
T acc = 0;
for (; ; c = *s++) {
if (IsDigit(c)) {
c -= '0';
} else if (IsAlpha(c)) {
c -= IsUpper(c) ? 'A' - 10 : 'a' - 10;
} else {
break;
}
if (c >= base) break;
if (any < 0) continue;
if (acc < cutoff || (acc == cutoff && c > cutlim)) {
any = -1;
acc = Min;
errno = ERANGE;
} else {
any = 1;
acc *= base;
acc -= c;
}
}
if (endptr != nullptr) *endptr = const_cast<char*>(any ? s - 1 : nptr);
if (!neg) {
if (acc == Min) {
errno = ERANGE;
acc = Max;
} else {
acc = -acc;
}
}
return acc;
}
template <typename T, T Max> T StrToU(const char* nptr, char** endptr, int base) {
if (base < 0 || base == 1 || base > 36) {
if (endptr != nullptr) *endptr = const_cast<char*>(nptr);
errno = EINVAL;
return 0;
}
const char* s = nptr;
int c;
do {
c = *s++;
} while (IsSpace(c));
int neg;
if (c == '-') {
neg = 1;
c = *s++;
} else {
neg = 0;
if (c == '+') c = *s++;
}
if ((base == 0 || base == 16) && c == '0' &&
(*s == 'x' || *s == 'X') && IsXDigit(s[1])) {
c = s[1];
s += 2;
base = 16;
}
if (base == 0) base = (c == '0') ? 8 : 10;
T cutoff = Max / static_cast<T>(base);
int cutlim = Max % static_cast<T>(base);
T acc = 0;
int any = 0;
for (; ; c = *s++) {
if (IsDigit(c)) {
c -= '0';
} else if (IsAlpha(c)) {
c -= IsUpper(c) ? 'A' - 10 : 'a' - 10;
} else {
break;
}
if (c >= base) break;
if (any < 0) continue;
if (acc > cutoff || (acc == cutoff && c > cutlim)) {
any = -1;
acc = Max;
errno = ERANGE;
} else {
any = 1;
acc *= base;
acc += c;
}
}
if (neg && any > 0) acc = -acc;
if (endptr != nullptr) *endptr = const_cast<char*>(any ? s - 1 : nptr);
return acc;
}
int atoi(const char* s) {
return strtol(s, nullptr, 10);
}
long atol(const char* s) {
return strtol(s, nullptr, 10);
}
long long atoll(const char* s) {
return strtoll(s, nullptr, 10);
}
intmax_t strtoimax(const char* s, char** end, int base) {
return StrToI<intmax_t, INTMAX_MIN, INTMAX_MAX>(s, end, base);
}
long strtol(const char* s, char** end, int base) {
return StrToI<long, LONG_MIN, LONG_MAX>(s, end, base);
}
long long strtoll(const char* s, char** end, int base) {
return StrToI<long long, LLONG_MIN, LLONG_MAX>(s, end, base);
}
// Public API since L, but not in any header.
extern "C" long long strtoq(const char* s, char** end, int base) {
return strtoll(s, end, base);
}
unsigned long strtoul(const char* s, char** end, int base) {
return StrToU<unsigned long, ULONG_MAX>(s, end, base);
}
unsigned long long strtoull(const char* s, char** end, int base) {
return StrToU<unsigned long long, ULLONG_MAX>(s, end, base);
}
uintmax_t strtoumax(const char* s, char** end, int base) {
return StrToU<uintmax_t, UINTMAX_MAX>(s, end, base);
}
// Public API since L, but not in any header.
extern "C" unsigned long long strtouq(const char* s, char** end, int base) {
return strtoull(s, end, base);
}
|
