strtoq.c revision 1.6.2.1 1 /*-
2 * Copyright (c) 1992 The Regents of the University of California.
3 * 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.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 */
33
34 #if defined(LIBC_SCCS) && !defined(lint)
35 static char sccsid[] = "@(#)strtoq.c 5.1 (Berkeley) 6/26/92";
36 #endif /* LIBC_SCCS and not lint */
37
38 #include "namespace.h"
39 #include <sys/types.h>
40
41 #include <ctype.h>
42 #include <errno.h>
43 #include <limits.h>
44 #include <stdlib.h>
45
46 #ifdef __weak_alias
47 __weak_alias(strtoq,_strtoq);
48 __weak_alias(strtoll,_strtoq);
49 #endif
50
51 /*
52 * Convert a string to a quad integer.
53 *
54 * Ignores `locale' stuff. Assumes that the upper and lower case
55 * alphabets and digits are each contiguous.
56 */
57 quad_t
58 strtoq(nptr, endptr, base)
59 const char *nptr;
60 char **endptr;
61 register int base;
62 {
63 register const char *s;
64 register quad_t acc, cutoff;
65 register int c;
66 register int neg, any, cutlim;
67
68 /*
69 * Skip white space and pick up leading +/- sign if any.
70 * If base is 0, allow 0x for hex and 0 for octal, else
71 * assume decimal; if base is already 16, allow 0x.
72 */
73 s = nptr;
74 do {
75 c = (unsigned char) *s++;
76 } while (isspace(c));
77 if (c == '-') {
78 neg = 1;
79 c = *s++;
80 } else {
81 neg = 0;
82 if (c == '+')
83 c = *s++;
84 }
85 if ((base == 0 || base == 16) &&
86 c == '0' && (*s == 'x' || *s == 'X')) {
87 c = s[1];
88 s += 2;
89 base = 16;
90 }
91 if (base == 0)
92 base = c == '0' ? 8 : 10;
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 quads 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 ? QUAD_MIN : QUAD_MAX;
113 cutlim = cutoff % base;
114 cutoff /= base;
115 if (neg) {
116 if (cutlim > 0) {
117 cutlim -= base;
118 cutoff += 1;
119 }
120 cutlim = -cutlim;
121 }
122 for (acc = 0, any = 0;; c = (unsigned char) *s++) {
123 if (isdigit(c))
124 c -= '0';
125 else if (isalpha(c))
126 c -= isupper(c) ? 'A' - 10 : 'a' - 10;
127 else
128 break;
129 if (c >= base)
130 break;
131 if (any < 0)
132 continue;
133 if (neg) {
134 if (acc < cutoff || acc == cutoff && c > cutlim) {
135 any = -1;
136 acc = QUAD_MIN;
137 errno = ERANGE;
138 } else {
139 any = 1;
140 acc *= base;
141 acc -= c;
142 }
143 } else {
144 if (acc > cutoff || acc == cutoff && c > cutlim) {
145 any = -1;
146 acc = QUAD_MAX;
147 errno = ERANGE;
148 } else {
149 any = 1;
150 acc *= base;
151 acc += c;
152 }
153 }
154 }
155 if (endptr != 0)
156 *endptr = (char *) (any ? s - 1 : nptr);
157 return (acc);
158 }
159