]>
Commit | Line | Data |
---|---|---|
5b2abdfb | 1 | /*- |
e9ce8d39 A |
2 | * Copyright (c) 1992, 1993 |
3 | * The Regents of the University of California. 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. | |
e9ce8d39 A |
13 | * 4. 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. | |
16 | * | |
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 | |
27 | * SUCH DAMAGE. | |
28 | */ | |
29 | ||
5b2abdfb | 30 | #if defined(LIBC_SCCS) && !defined(lint) |
9385eb3d | 31 | static char sccsid[] = "from @(#)strtol.c 8.1 (Berkeley) 6/4/93"; |
5b2abdfb | 32 | #endif /* LIBC_SCCS and not lint */ |
9385eb3d | 33 | #include <sys/cdefs.h> |
1f2f436a | 34 | __FBSDID("$FreeBSD: src/lib/libc/stdlib/strtoimax.c,v 1.12 2007/01/09 00:28:10 imp Exp $"); |
5b2abdfb | 35 | |
ad3c9f2a A |
36 | #include "xlocale_private.h" |
37 | ||
e9ce8d39 | 38 | #include <ctype.h> |
9385eb3d | 39 | #include <errno.h> |
e9ce8d39 | 40 | #include <stdlib.h> |
9385eb3d | 41 | #include <inttypes.h> |
e9ce8d39 A |
42 | |
43 | /* | |
9385eb3d | 44 | * Convert a string to an intmax_t integer. |
e9ce8d39 | 45 | * |
9385eb3d | 46 | * Assumes that the upper and lower case |
e9ce8d39 A |
47 | * alphabets and digits are each contiguous. |
48 | */ | |
9385eb3d | 49 | intmax_t |
ad3c9f2a A |
50 | strtoimax_l(const char * __restrict nptr, char ** __restrict endptr, int base, |
51 | locale_t loc) | |
e9ce8d39 | 52 | { |
9385eb3d A |
53 | const char *s; |
54 | uintmax_t acc; | |
55 | char c; | |
56 | uintmax_t cutoff; | |
57 | int neg, any, cutlim; | |
e9ce8d39 | 58 | |
ad3c9f2a | 59 | NORMALIZE_LOCALE(loc); |
e9ce8d39 A |
60 | /* |
61 | * Skip white space and pick up leading +/- sign if any. | |
62 | * If base is 0, allow 0x for hex and 0 for octal, else | |
63 | * assume decimal; if base is already 16, allow 0x. | |
64 | */ | |
65 | s = nptr; | |
66 | do { | |
67 | c = *s++; | |
ad3c9f2a | 68 | } while (isspace_l((unsigned char)c, loc)); |
e9ce8d39 A |
69 | if (c == '-') { |
70 | neg = 1; | |
71 | c = *s++; | |
72 | } else { | |
73 | neg = 0; | |
74 | if (c == '+') | |
75 | c = *s++; | |
76 | } | |
77 | if ((base == 0 || base == 16) && | |
1f2f436a A |
78 | c == '0' && (*s == 'x' || *s == 'X') && |
79 | ((s[1] >= '0' && s[1] <= '9') || | |
80 | (s[1] >= 'A' && s[1] <= 'F') || | |
81 | (s[1] >= 'a' && s[1] <= 'f'))) { | |
e9ce8d39 A |
82 | c = s[1]; |
83 | s += 2; | |
84 | base = 16; | |
85 | } | |
86 | if (base == 0) | |
87 | base = c == '0' ? 8 : 10; | |
9385eb3d A |
88 | acc = any = 0; |
89 | if (base < 2 || base > 36) | |
90 | goto noconv; | |
e9ce8d39 A |
91 | |
92 | /* | |
93 | * Compute the cutoff value between legal numbers and illegal | |
94 | * numbers. That is the largest legal value, divided by the | |
95 | * base. An input number that is greater than this value, if | |
96 | * followed by a legal input character, is too big. One that | |
97 | * is equal to this value may be valid or not; the limit | |
98 | * between valid and invalid numbers is then based on the last | |
9385eb3d | 99 | * digit. For instance, if the range for intmax_t is |
e9ce8d39 A |
100 | * [-9223372036854775808..9223372036854775807] and the input base |
101 | * is 10, cutoff will be set to 922337203685477580 and cutlim to | |
102 | * either 7 (neg==0) or 8 (neg==1), meaning that if we have | |
103 | * accumulated a value > 922337203685477580, or equal but the | |
104 | * next digit is > 7 (or 8), the number is too big, and we will | |
105 | * return a range error. | |
106 | * | |
9385eb3d | 107 | * Set 'any' if any `digits' consumed; make it negative to indicate |
e9ce8d39 A |
108 | * overflow. |
109 | */ | |
9385eb3d A |
110 | cutoff = neg ? (uintmax_t)-(INTMAX_MIN + INTMAX_MAX) + INTMAX_MAX |
111 | : INTMAX_MAX; | |
112 | cutlim = cutoff % base; | |
113 | cutoff /= base; | |
114 | for ( ; ; c = *s++) { | |
115 | if (c >= '0' && c <= '9') | |
e9ce8d39 | 116 | c -= '0'; |
9385eb3d A |
117 | else if (c >= 'A' && c <= 'Z') |
118 | c -= 'A' - 10; | |
119 | else if (c >= 'a' && c <= 'z') | |
120 | c -= 'a' - 10; | |
e9ce8d39 A |
121 | else |
122 | break; | |
123 | if (c >= base) | |
124 | break; | |
5b2abdfb | 125 | if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim)) |
e9ce8d39 A |
126 | any = -1; |
127 | else { | |
128 | any = 1; | |
9385eb3d | 129 | acc *= base; |
e9ce8d39 A |
130 | acc += c; |
131 | } | |
132 | } | |
133 | if (any < 0) { | |
9385eb3d | 134 | acc = neg ? INTMAX_MIN : INTMAX_MAX; |
e9ce8d39 | 135 | errno = ERANGE; |
9385eb3d A |
136 | } else if (!any) { |
137 | noconv: | |
138 | errno = EINVAL; | |
e9ce8d39 A |
139 | } else if (neg) |
140 | acc = -acc; | |
9385eb3d | 141 | if (endptr != NULL) |
e9ce8d39 A |
142 | *endptr = (char *)(any ? s - 1 : nptr); |
143 | return (acc); | |
144 | } | |
ad3c9f2a A |
145 | |
146 | intmax_t | |
147 | strtoimax(const char * __restrict nptr, char ** __restrict endptr, int base) | |
148 | { | |
149 | return strtoimax_l(nptr, endptr, base, __current_locale()); | |
150 | } |