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