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