2 * Copyright (c) 1990 The Regents of the University of California.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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. [rescinded 22 July 1999]
14 * 4. Neither the name of the University nor the names of its contributors
15 * may be used to endorse or promote products derived from this software
16 * without specific prior written permission.
18 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
19 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
22 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 /* FIXME: It'd be nice to configure around these, but the include files are too
40 painful. These macros should at least be more portable than hardwired hex
44 #define ULONG_MAX ((unsigned long)(~0L)) /* 0xFFFFFFFF */
48 #define LONG_MAX ((long)(ULONG_MAX >> 1)) /* 0x7FFFFFFF */
52 #define LONG_MIN ((long)(~LONG_MAX)) /* 0x80000000 */
56 * Convert a string to a long integer.
58 * Ignores `locale' stuff. Assumes that the upper and lower case
59 * alphabets and digits are each contiguous.
62 strtol(nptr
, endptr
, base
)
67 register const char *s
= nptr
;
68 register unsigned long acc
;
70 register unsigned long cutoff
;
71 register int neg
= 0, any
, cutlim
;
74 * Skip white space and pick up leading +/- sign if any.
75 * If base is 0, allow 0x for hex and 0 for octal, else
76 * assume decimal; if base is already 16, allow 0x.
86 if ((base
== 0 || base
== 16) &&
87 c
== '0' && (*s
== 'x' || *s
== 'X')) {
93 base
= c
== '0' ? 8 : 10;
96 * Compute the cutoff value between legal numbers and illegal
97 * numbers. That is the largest legal value, divided by the
98 * base. An input number that is greater than this value, if
99 * followed by a legal input character, is too big. One that
100 * is equal to this value may be valid or not; the limit
101 * between valid and invalid numbers is then based on the last
102 * digit. For instance, if the range for longs is
103 * [-2147483648..2147483647] and the input base is 10,
104 * cutoff will be set to 214748364 and cutlim to either
105 * 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated
106 * a value > 214748364, or equal but the next digit is > 7 (or 8),
107 * the number is too big, and we will return a range error.
109 * Set any if any `digits' consumed; make it negative to indicate
112 cutoff
= neg
? -(unsigned long)LONG_MIN
: LONG_MAX
;
113 cutlim
= cutoff
% (unsigned long)base
;
114 cutoff
/= (unsigned long)base
;
115 for (acc
= 0, any
= 0;; c
= *s
++) {
119 c
-= isupper(c
) ? 'A' - 10 : 'a' - 10;
124 if (any
< 0 || acc
> cutoff
|| acc
== cutoff
&& c
> cutlim
)
133 acc
= neg
? LONG_MIN
: LONG_MAX
;
138 *endptr
= (char *) (any
? s
- 1 : nptr
);
This page took 0.03162 seconds and 4 git commands to generate.