1 | /*- |
---|
2 | * Copyright (c) 1992, 1993 |
---|
3 | * The Regents of the University of California. All rights reserved. |
---|
4 | * |
---|
5 | * Copyright (c) 2011 The FreeBSD Foundation |
---|
6 | * All rights reserved. |
---|
7 | * Portions of this software were developed by David Chisnall |
---|
8 | * under sponsorship from the FreeBSD Foundation. |
---|
9 | * |
---|
10 | * Redistribution and use in source and binary forms, with or without |
---|
11 | * modification, are permitted provided that the following conditions |
---|
12 | * are met: |
---|
13 | * 1. Redistributions of source code must retain the above copyright |
---|
14 | * notice, this list of conditions and the following disclaimer. |
---|
15 | * 2. Redistributions in binary form must reproduce the above copyright |
---|
16 | * notice, this list of conditions and the following disclaimer in the |
---|
17 | * documentation and/or other materials provided with the distribution. |
---|
18 | * 3. Neither the name of the University nor the names of its contributors |
---|
19 | * may be used to endorse or promote products derived from this software |
---|
20 | * without specific prior written permission. |
---|
21 | * |
---|
22 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
---|
23 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
---|
24 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
---|
25 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
---|
26 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
---|
27 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
---|
28 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
---|
29 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
---|
30 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
---|
31 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
---|
32 | * SUCH DAMAGE. |
---|
33 | */ |
---|
34 | |
---|
35 | #if defined(LIBC_SCCS) && !defined(lint) |
---|
36 | static char sccsid[] = "from @(#)strtoul.c 8.1 (Berkeley) 6/4/93"; |
---|
37 | #endif /* LIBC_SCCS and not lint */ |
---|
38 | #include <sys/cdefs.h> |
---|
39 | __FBSDID("$FreeBSD: head/lib/libc/stdlib/strtoumax.c 251672 2013-06-13 00:19:30Z emaste $"); |
---|
40 | |
---|
41 | #include <ctype.h> |
---|
42 | #include <errno.h> |
---|
43 | #include <stdlib.h> |
---|
44 | #include <inttypes.h> |
---|
45 | #include <stdint.h> |
---|
46 | #include <reent.h> |
---|
47 | #include "../locale/setlocale.h" |
---|
48 | |
---|
49 | /* |
---|
50 | * Convert a string to a uintmax_t integer. |
---|
51 | * |
---|
52 | * Assumes that the upper and lower case |
---|
53 | * alphabets and digits are each contiguous. |
---|
54 | */ |
---|
55 | |
---|
56 | /* |
---|
57 | *Reentrant version of strtoumax. |
---|
58 | */ |
---|
59 | static uintmax_t |
---|
60 | _strtoumax_l(struct _reent *rptr, const char * __restrict nptr, |
---|
61 | char ** __restrict endptr, int base, locale_t loc) |
---|
62 | { |
---|
63 | const char *s = (const unsigned char *)nptr; |
---|
64 | uintmax_t acc; |
---|
65 | char c; |
---|
66 | uintmax_t cutoff; |
---|
67 | int neg = 0, any, cutlim; |
---|
68 | |
---|
69 | /* |
---|
70 | * See strtoimax for comments as to the logic used. |
---|
71 | */ |
---|
72 | do { |
---|
73 | c = *s++; |
---|
74 | } while (isspace_l(c, loc)); |
---|
75 | if (c == '-') { |
---|
76 | neg = 1; |
---|
77 | c = *s++; |
---|
78 | } else { |
---|
79 | neg = 0; |
---|
80 | if (c == '+') |
---|
81 | c = *s++; |
---|
82 | } |
---|
83 | if ((base == 0 || base == 16) && |
---|
84 | c == '0' && (*s == 'x' || *s == 'X')) { |
---|
85 | c = s[1]; |
---|
86 | s += 2; |
---|
87 | base = 16; |
---|
88 | } |
---|
89 | if (base == 0) |
---|
90 | base = c == '0' ? 8 : 10; |
---|
91 | acc = any = 0; |
---|
92 | if (base < 2 || base > 36) |
---|
93 | goto noconv; |
---|
94 | |
---|
95 | cutoff = UINTMAX_MAX / base; |
---|
96 | cutlim = UINTMAX_MAX % base; |
---|
97 | for ( ; ; c = *s++) { |
---|
98 | if (c >= '0' && c <= '9') |
---|
99 | c -= '0'; |
---|
100 | else if (c >= 'A' && c <= 'Z') |
---|
101 | c -= 'A' - 10; |
---|
102 | else if (c >= 'a' && c <= 'z') |
---|
103 | c -= 'a' - 10; |
---|
104 | else |
---|
105 | break; |
---|
106 | if (c >= base) |
---|
107 | break; |
---|
108 | if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim)) |
---|
109 | any = -1; |
---|
110 | else { |
---|
111 | any = 1; |
---|
112 | acc *= base; |
---|
113 | acc += c; |
---|
114 | } |
---|
115 | } |
---|
116 | if (any < 0) { |
---|
117 | acc = UINTMAX_MAX; |
---|
118 | rptr->_errno = ERANGE; |
---|
119 | } else if (!any) { |
---|
120 | noconv: |
---|
121 | rptr->_errno = EINVAL; |
---|
122 | } else if (neg) |
---|
123 | acc = -acc; |
---|
124 | if (endptr != NULL) |
---|
125 | *endptr = (char *)(any ? s - 1 : nptr); |
---|
126 | return (acc); |
---|
127 | } |
---|
128 | |
---|
129 | uintmax_t |
---|
130 | _strtoumax_r(struct _reent *rptr, const char *__restrict nptr, |
---|
131 | char **__restrict endptr, int base) |
---|
132 | { |
---|
133 | return _strtoumax_l(rptr, nptr, endptr, base, __get_current_locale()); |
---|
134 | } |
---|
135 | |
---|
136 | #ifndef _REENT_ONLY |
---|
137 | |
---|
138 | uintmax_t |
---|
139 | strtoumax_l(const char * __restrict nptr, char ** __restrict endptr, int base, |
---|
140 | locale_t loc) |
---|
141 | { |
---|
142 | return _strtoumax_l(_REENT, nptr, endptr, base, loc); |
---|
143 | } |
---|
144 | |
---|
145 | uintmax_t |
---|
146 | strtoumax(const char* __restrict nptr, char** __restrict endptr, int base) |
---|
147 | { |
---|
148 | return _strtoumax_l(_REENT, nptr, endptr, base, __get_current_locale()); |
---|
149 | } |
---|
150 | |
---|
151 | #endif |
---|