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