_strtol.h revision 1.2.8.1 1 1.2.8.1 snj /* $NetBSD: _strtol.h,v 1.2.8.1 2017/08/26 16:36:19 snj Exp $ */
2 1.1 joerg
3 1.1 joerg /*-
4 1.1 joerg * Copyright (c) 1990, 1993
5 1.1 joerg * The Regents of the University of California. All rights reserved.
6 1.1 joerg *
7 1.1 joerg * Redistribution and use in source and binary forms, with or without
8 1.1 joerg * modification, are permitted provided that the following conditions
9 1.1 joerg * are met:
10 1.1 joerg * 1. Redistributions of source code must retain the above copyright
11 1.1 joerg * notice, this list of conditions and the following disclaimer.
12 1.1 joerg * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 joerg * notice, this list of conditions and the following disclaimer in the
14 1.1 joerg * documentation and/or other materials provided with the distribution.
15 1.1 joerg * 3. Neither the name of the University nor the names of its contributors
16 1.1 joerg * may be used to endorse or promote products derived from this software
17 1.1 joerg * without specific prior written permission.
18 1.1 joerg *
19 1.1 joerg * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 joerg * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 joerg * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 joerg * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 joerg * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 joerg * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 joerg * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 joerg * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 joerg * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 joerg * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 joerg * SUCH DAMAGE.
30 1.1 joerg *
31 1.1 joerg * Original version ID:
32 1.1 joerg * NetBSD: src/lib/libc/locale/_wcstol.h,v 1.2 2003/08/07 16:43:03 agc Exp
33 1.1 joerg */
34 1.1 joerg
35 1.1 joerg /*
36 1.1 joerg * function template for strtol, strtoll and strtoimax.
37 1.1 joerg *
38 1.1 joerg * parameters:
39 1.1 joerg * _FUNCNAME : function name
40 1.1 joerg * __INT : return type
41 1.1 joerg * __INT_MIN : lower limit of the return type
42 1.1 joerg * __INT_MAX : upper limit of the return type
43 1.1 joerg */
44 1.1 joerg
45 1.1 joerg __INT
46 1.1 joerg _FUNCNAME(const char *nptr, char **endptr, int base)
47 1.1 joerg {
48 1.1 joerg const char *s;
49 1.1 joerg __INT acc, cutoff;
50 1.1 joerg unsigned char c;
51 1.1 joerg int i, neg, any, cutlim;
52 1.1 joerg
53 1.1 joerg _DIAGASSERT(nptr != NULL);
54 1.1 joerg /* endptr may be NULL */
55 1.1 joerg
56 1.1 joerg /* check base value */
57 1.1 joerg if (base && (base < 2 || base > 36)) {
58 1.1 joerg #if !defined(_KERNEL) && !defined(_STANDALONE)
59 1.1 joerg errno = EINVAL;
60 1.2 christos if (endptr != NULL)
61 1.2 christos /* LINTED interface specification */
62 1.2 christos *endptr = __UNCONST(nptr);
63 1.2 christos return 0;
64 1.1 joerg #else
65 1.1 joerg panic("%s: invalid base %d", __func__, base);
66 1.1 joerg #endif
67 1.1 joerg }
68 1.1 joerg
69 1.1 joerg /*
70 1.1 joerg * Skip white space and pick up leading +/- sign if any.
71 1.1 joerg * If base is 0, allow 0x for hex and 0 for octal, else
72 1.1 joerg * assume decimal; if base is already 16, allow 0x.
73 1.1 joerg */
74 1.1 joerg s = nptr;
75 1.1 joerg do {
76 1.1 joerg c = *s++;
77 1.1 joerg } while (isspace(c));
78 1.1 joerg if (c == '-') {
79 1.1 joerg neg = 1;
80 1.1 joerg c = *s++;
81 1.1 joerg } else {
82 1.1 joerg neg = 0;
83 1.1 joerg if (c == '+')
84 1.1 joerg c = *s++;
85 1.1 joerg }
86 1.1 joerg if ((base == 0 || base == 16) &&
87 1.2.8.1 snj c == '0' && (*s == 'x' || *s == 'X') &&
88 1.2.8.1 snj ((s[1] >= '0' && s[1] <= '9') ||
89 1.2.8.1 snj (s[1] >= 'a' && s[1] <= 'f') ||
90 1.2.8.1 snj (s[1] >= 'A' && s[1] <= 'F'))) {
91 1.1 joerg c = s[1];
92 1.1 joerg s += 2;
93 1.1 joerg base = 16;
94 1.1 joerg }
95 1.1 joerg if (base == 0)
96 1.1 joerg base = (c == '0' ? 8 : 10);
97 1.1 joerg
98 1.1 joerg /*
99 1.1 joerg * Compute the cutoff value between legal numbers and illegal
100 1.1 joerg * numbers. That is the largest legal value, divided by the
101 1.1 joerg * base. An input number that is greater than this value, if
102 1.1 joerg * followed by a legal input character, is too big. One that
103 1.1 joerg * is equal to this value may be valid or not; the limit
104 1.1 joerg * between valid and invalid numbers is then based on the last
105 1.1 joerg * digit. For instance, if the range for longs is
106 1.1 joerg * [-2147483648..2147483647] and the input base is 10,
107 1.1 joerg * cutoff will be set to 214748364 and cutlim to either
108 1.1 joerg * 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated
109 1.1 joerg * a value > 214748364, or equal but the next digit is > 7 (or 8),
110 1.1 joerg * the number is too big, and we will return a range error.
111 1.1 joerg *
112 1.1 joerg * Set any if any `digits' consumed; make it negative to indicate
113 1.1 joerg * overflow.
114 1.1 joerg */
115 1.1 joerg cutoff = (neg ? __INT_MIN : __INT_MAX);
116 1.1 joerg cutlim = (int)(cutoff % base);
117 1.1 joerg cutoff /= base;
118 1.1 joerg if (neg) {
119 1.1 joerg if (cutlim > 0) {
120 1.1 joerg cutlim -= base;
121 1.1 joerg cutoff += 1;
122 1.1 joerg }
123 1.1 joerg cutlim = -cutlim;
124 1.1 joerg }
125 1.1 joerg for (acc = 0, any = 0;; c = *s++) {
126 1.1 joerg if (isdigit(c))
127 1.1 joerg i = c - '0';
128 1.1 joerg else if (isalpha(c))
129 1.1 joerg i = c - (isupper(c) ? 'A' - 10 : 'a' - 10);
130 1.1 joerg else
131 1.1 joerg break;
132 1.1 joerg if (i >= base)
133 1.1 joerg break;
134 1.1 joerg if (any < 0)
135 1.1 joerg continue;
136 1.1 joerg if (neg) {
137 1.1 joerg if (acc < cutoff || (acc == cutoff && i > cutlim)) {
138 1.1 joerg acc = __INT_MIN;
139 1.1 joerg #if !defined(_KERNEL) && !defined(_STANDALONE)
140 1.1 joerg any = -1;
141 1.1 joerg errno = ERANGE;
142 1.1 joerg #else
143 1.1 joerg any = 0;
144 1.1 joerg break;
145 1.1 joerg #endif
146 1.1 joerg } else {
147 1.1 joerg any = 1;
148 1.1 joerg acc *= base;
149 1.1 joerg acc -= i;
150 1.1 joerg }
151 1.1 joerg } else {
152 1.1 joerg if (acc > cutoff || (acc == cutoff && i > cutlim)) {
153 1.1 joerg acc = __INT_MAX;
154 1.1 joerg #if !defined(_KERNEL) && !defined(_STANDALONE)
155 1.1 joerg any = -1;
156 1.1 joerg errno = ERANGE;
157 1.1 joerg #else
158 1.1 joerg any = 0;
159 1.1 joerg break;
160 1.1 joerg #endif
161 1.1 joerg } else {
162 1.1 joerg any = 1;
163 1.1 joerg acc *= base;
164 1.1 joerg acc += i;
165 1.1 joerg }
166 1.1 joerg }
167 1.1 joerg }
168 1.1 joerg if (endptr != NULL)
169 1.1 joerg /* LINTED interface specification */
170 1.1 joerg *endptr = __UNCONST(any ? s - 1 : nptr);
171 1.1 joerg return(acc);
172 1.1 joerg }
173