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