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