strtoq.c revision 1.14 1 1.14 lukem /* $NetBSD: strtoq.c,v 1.14 1999/09/20 04:39:42 lukem Exp $ */
2 1.7 christos
3 1.1 jtc /*-
4 1.8 perry * Copyright (c) 1992, 1993
5 1.8 perry * The Regents of the University of California. All rights reserved.
6 1.1 jtc *
7 1.1 jtc * Redistribution and use in source and binary forms, with or without
8 1.1 jtc * modification, are permitted provided that the following conditions
9 1.1 jtc * are met:
10 1.1 jtc * 1. Redistributions of source code must retain the above copyright
11 1.1 jtc * notice, this list of conditions and the following disclaimer.
12 1.1 jtc * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 jtc * notice, this list of conditions and the following disclaimer in the
14 1.1 jtc * documentation and/or other materials provided with the distribution.
15 1.1 jtc * 3. All advertising materials mentioning features or use of this software
16 1.1 jtc * must display the following acknowledgement:
17 1.1 jtc * This product includes software developed by the University of
18 1.1 jtc * California, Berkeley and its contributors.
19 1.1 jtc * 4. Neither the name of the University nor the names of its contributors
20 1.1 jtc * may be used to endorse or promote products derived from this software
21 1.1 jtc * without specific prior written permission.
22 1.1 jtc *
23 1.1 jtc * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 jtc * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 jtc * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 jtc * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 jtc * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 jtc * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 jtc * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 jtc * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 jtc * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 jtc * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 jtc * SUCH DAMAGE.
34 1.1 jtc */
35 1.1 jtc
36 1.7 christos #include <sys/cdefs.h>
37 1.1 jtc #if defined(LIBC_SCCS) && !defined(lint)
38 1.7 christos #if 0
39 1.8 perry static char sccsid[] = "@(#)strtoq.c 8.1 (Berkeley) 6/4/93";
40 1.7 christos #else
41 1.14 lukem __RCSID("$NetBSD: strtoq.c,v 1.14 1999/09/20 04:39:42 lukem Exp $");
42 1.7 christos #endif
43 1.1 jtc #endif /* LIBC_SCCS and not lint */
44 1.1 jtc
45 1.7 christos #include "namespace.h"
46 1.1 jtc #include <sys/types.h>
47 1.1 jtc
48 1.13 lukem #include <assert.h>
49 1.3 mycroft #include <ctype.h>
50 1.3 mycroft #include <errno.h>
51 1.1 jtc #include <limits.h>
52 1.1 jtc #include <stdlib.h>
53 1.12 mycroft
54 1.12 mycroft #ifdef __weak_alias
55 1.12 mycroft __weak_alias(strtoq, _strtoq)
56 1.12 mycroft #endif
57 1.1 jtc
58 1.1 jtc /*
59 1.1 jtc * Convert a string to a quad integer.
60 1.1 jtc *
61 1.1 jtc * Ignores `locale' stuff. Assumes that the upper and lower case
62 1.1 jtc * alphabets and digits are each contiguous.
63 1.1 jtc */
64 1.1 jtc quad_t
65 1.7 christos _strtoq(nptr, endptr, base)
66 1.1 jtc const char *nptr;
67 1.1 jtc char **endptr;
68 1.10 mycroft int base;
69 1.1 jtc {
70 1.10 mycroft const char *s;
71 1.10 mycroft quad_t acc, cutoff;
72 1.10 mycroft int c;
73 1.10 mycroft int neg, any, cutlim;
74 1.13 lukem
75 1.13 lukem _DIAGASSERT(nptr != NULL);
76 1.13 lukem /* endptr may be NULL */
77 1.9 mycroft
78 1.9 mycroft #ifdef __GNUC__
79 1.9 mycroft /* This outrageous construct just to shut up a GCC warning. */
80 1.9 mycroft (void) &acc; (void) &cutoff;
81 1.9 mycroft #endif
82 1.1 jtc
83 1.1 jtc /*
84 1.1 jtc * Skip white space and pick up leading +/- sign if any.
85 1.1 jtc * If base is 0, allow 0x for hex and 0 for octal, else
86 1.1 jtc * assume decimal; if base is already 16, allow 0x.
87 1.1 jtc */
88 1.1 jtc s = nptr;
89 1.1 jtc do {
90 1.6 jtc c = (unsigned char) *s++;
91 1.1 jtc } while (isspace(c));
92 1.1 jtc if (c == '-') {
93 1.1 jtc neg = 1;
94 1.1 jtc c = *s++;
95 1.1 jtc } else {
96 1.1 jtc neg = 0;
97 1.1 jtc if (c == '+')
98 1.1 jtc c = *s++;
99 1.1 jtc }
100 1.1 jtc if ((base == 0 || base == 16) &&
101 1.1 jtc c == '0' && (*s == 'x' || *s == 'X')) {
102 1.1 jtc c = s[1];
103 1.1 jtc s += 2;
104 1.1 jtc base = 16;
105 1.1 jtc }
106 1.1 jtc if (base == 0)
107 1.1 jtc base = c == '0' ? 8 : 10;
108 1.1 jtc
109 1.1 jtc /*
110 1.1 jtc * Compute the cutoff value between legal numbers and illegal
111 1.1 jtc * numbers. That is the largest legal value, divided by the
112 1.1 jtc * base. An input number that is greater than this value, if
113 1.1 jtc * followed by a legal input character, is too big. One that
114 1.1 jtc * is equal to this value may be valid or not; the limit
115 1.1 jtc * between valid and invalid numbers is then based on the last
116 1.1 jtc * digit. For instance, if the range for quads is
117 1.1 jtc * [-9223372036854775808..9223372036854775807] and the input base
118 1.1 jtc * is 10, cutoff will be set to 922337203685477580 and cutlim to
119 1.1 jtc * either 7 (neg==0) or 8 (neg==1), meaning that if we have
120 1.1 jtc * accumulated a value > 922337203685477580, or equal but the
121 1.1 jtc * next digit is > 7 (or 8), the number is too big, and we will
122 1.1 jtc * return a range error.
123 1.1 jtc *
124 1.1 jtc * Set any if any `digits' consumed; make it negative to indicate
125 1.1 jtc * overflow.
126 1.1 jtc */
127 1.4 mycroft cutoff = neg ? QUAD_MIN : QUAD_MAX;
128 1.11 christos cutlim = (int)(cutoff % base);
129 1.4 mycroft cutoff /= base;
130 1.4 mycroft if (neg) {
131 1.4 mycroft if (cutlim > 0) {
132 1.4 mycroft cutlim -= base;
133 1.4 mycroft cutoff += 1;
134 1.4 mycroft }
135 1.4 mycroft cutlim = -cutlim;
136 1.4 mycroft }
137 1.6 jtc for (acc = 0, any = 0;; c = (unsigned char) *s++) {
138 1.1 jtc if (isdigit(c))
139 1.1 jtc c -= '0';
140 1.1 jtc else if (isalpha(c))
141 1.1 jtc c -= isupper(c) ? 'A' - 10 : 'a' - 10;
142 1.1 jtc else
143 1.1 jtc break;
144 1.1 jtc if (c >= base)
145 1.1 jtc break;
146 1.4 mycroft if (any < 0)
147 1.4 mycroft continue;
148 1.4 mycroft if (neg) {
149 1.7 christos if (acc < cutoff || (acc == cutoff && c > cutlim)) {
150 1.4 mycroft any = -1;
151 1.4 mycroft acc = QUAD_MIN;
152 1.4 mycroft errno = ERANGE;
153 1.4 mycroft } else {
154 1.4 mycroft any = 1;
155 1.4 mycroft acc *= base;
156 1.4 mycroft acc -= c;
157 1.4 mycroft }
158 1.4 mycroft } else {
159 1.7 christos if (acc > cutoff || (acc == cutoff && c > cutlim)) {
160 1.4 mycroft any = -1;
161 1.4 mycroft acc = QUAD_MAX;
162 1.4 mycroft errno = ERANGE;
163 1.4 mycroft } else {
164 1.4 mycroft any = 1;
165 1.4 mycroft acc *= base;
166 1.4 mycroft acc += c;
167 1.4 mycroft }
168 1.1 jtc }
169 1.1 jtc }
170 1.1 jtc if (endptr != 0)
171 1.11 christos /* LINTED interface specification */
172 1.8 perry *endptr = (char *)(any ? s - 1 : nptr);
173 1.1 jtc return (acc);
174 1.1 jtc }
175