]>
Commit | Line | Data |
---|---|---|
4a8c6acc | 1 | /*- |
2 | * Copyright (c) 1990 The Regents of the University of California. | |
3 | * All rights reserved. | |
4 | * | |
5 | * Redistribution and use in source and binary forms, with or without | |
6 | * modification, are permitted provided that the following conditions | |
7 | * are met: | |
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. All advertising materials mentioning features or use of this software | |
14 | * must display the following acknowledgement: | |
15 | * This product includes software developed by the University of | |
16 | * California, Berkeley and its contributors. | |
17 | * 4. Neither the name of the University nor the names of its contributors | |
18 | * may be used to endorse or promote products derived from this software | |
19 | * without specific prior written permission. | |
20 | * | |
21 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
22 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
25 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
26 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
27 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
28 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
29 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
30 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
31 | * SUCH DAMAGE. | |
32 | */ | |
33 | ||
34 | /* modified for long long <mgd@swarm.org> 1999-08-12 */ | |
35 | ||
f7f3304a | 36 | #include "squid.h" |
27bc2077 AJ |
37 | #include "compat/strtoll.h" |
38 | ||
4a8c6acc | 39 | #if HAVE_CTYPE_H |
40 | #include <ctype.h> | |
41 | #endif | |
42 | #if HAVE_ERRNO_H | |
43 | #include <errno.h> | |
44 | #endif | |
45 | ||
4a8c6acc | 46 | #ifndef INT64_MIN |
47 | /* Native 64 bit system without strtoll() */ | |
48 | #if defined(LONG_MIN) && (SIZEOF_LONG == 8) | |
49 | #define INT64_MIN LONG_MIN | |
50 | #else | |
51 | /* 32 bit system */ | |
880d2ea6 | 52 | #define INT64_MIN (-9223372036854775807LL-1LL) |
4a8c6acc | 53 | #endif |
54 | #endif | |
55 | ||
56 | #ifndef INT64_MAX | |
57 | /* Native 64 bit system without strtoll() */ | |
58 | #if defined(LONG_MAX) && (SIZEOF_LONG == 8) | |
59 | #define INT64_MAX LONG_MAX | |
60 | #else | |
61 | /* 32 bit system */ | |
880d2ea6 | 62 | #define INT64_MAX 9223372036854775807LL |
4a8c6acc | 63 | #endif |
64 | #endif | |
65 | ||
4a8c6acc | 66 | /* |
67 | * Convert a string to a int64 integer. | |
68 | * | |
69 | * Ignores `locale' stuff. Assumes that the upper and lower case | |
70 | * alphabets and digits are each contiguous. | |
71 | */ | |
72 | int64_t | |
73 | strtoll (const char *nptr, char **endptr, int base) | |
74 | { | |
26ac0430 | 75 | register const char *s = nptr; |
09aabd84 | 76 | register uint64_t acc; |
26ac0430 | 77 | register int c; |
09aabd84 | 78 | register uint64_t cutoff; |
26ac0430 AJ |
79 | register int neg = 0, any, cutlim; |
80 | ||
81 | /* | |
82 | * Skip white space and pick up leading +/- sign if any. | |
83 | * If base is 0, allow 0x for hex and 0 for octal, else | |
84 | * assume decimal; if base is already 16, allow 0x. | |
85 | */ | |
86 | do { | |
87 | c = *s++; | |
4a8c6acc | 88 | } while (xisspace(c)); |
26ac0430 AJ |
89 | if (c == '-') { |
90 | neg = 1; | |
91 | c = *s++; | |
92 | } else if (c == '+') | |
93 | c = *s++; | |
94 | if ((base == 0 || base == 16) && c == '0' && (*s == 'x' || *s == 'X')) { | |
95 | c = s[1]; | |
96 | s += 2; | |
97 | base = 16; | |
4a8c6acc | 98 | } |
26ac0430 AJ |
99 | if (base == 0) |
100 | base = c == '0' ? 8 : 10; | |
101 | ||
102 | /* | |
103 | * Compute the cutoff value between legal numbers and illegal | |
104 | * numbers. That is the largest legal value, divided by the | |
105 | * base. An input number that is greater than this value, if | |
106 | * followed by a legal input character, is too big. One that | |
107 | * is equal to this value may be valid or not; the limit | |
108 | * between valid and invalid numbers is then based on the last | |
109 | * digit. For instance, if the range for longs is | |
110 | * [-2147483648..2147483647] and the input base is 10, | |
111 | * cutoff will be set to 214748364 and cutlim to either | |
112 | * 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated | |
113 | * a value > 214748364, or equal but the next digit is > 7 (or 8), | |
114 | * the number is too big, and we will return a range error. | |
115 | * | |
116 | * Set any if any `digits' consumed; make it negative to indicate | |
117 | * overflow. | |
118 | */ | |
09aabd84 FC |
119 | cutoff = neg ? -(uint64_t) INT64_MIN : INT64_MAX; |
120 | cutlim = cutoff % (uint64_t) base; | |
121 | cutoff /= (uint64_t) base; | |
26ac0430 AJ |
122 | for (acc = 0, any = 0;; c = *s++) { |
123 | if (xisdigit(c)) | |
124 | c -= '0'; | |
125 | else if (xisalpha(c)) | |
126 | c -= xisupper(c) ? 'A' - 10 : 'a' - 10; | |
127 | else | |
128 | break; | |
129 | if (c >= base) | |
130 | break; | |
131 | if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim)) | |
132 | any = -1; | |
133 | else { | |
134 | any = 1; | |
135 | acc *= base; | |
136 | acc += c; | |
4a8c6acc | 137 | } |
138 | } | |
26ac0430 AJ |
139 | if (any < 0) { |
140 | acc = neg ? INT64_MIN : INT64_MAX; | |
141 | errno = ERANGE; | |
142 | } else if (neg) | |
143 | acc = -acc; | |
144 | if (endptr != 0) | |
145 | *endptr = (char *) (any ? s - 1 : nptr); | |
146 | return acc; | |
4a8c6acc | 147 | } |
148 |