2 /* $NetBSD: _strtol.h,v 1.2 2009/05/20 22:03:29 christos Exp $ */
5 * SPDX-License-Identifier: BSD-3-Clause
7 * Copyright (c) 1990, 1993
8 * The Regents of the University of California. All rights reserved.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * Original version ID:
35 * NetBSD: src/lib/libc/locale/_wcstol.h,v 1.2 2003/08/07 16:43:03 agc Exp
39 * function template for strtol, strtoll and strtoimax.
42 * _FUNCNAME : function name
44 * __INT_MIN : lower limit of the return type
45 * __INT_MAX : upper limit of the return type
49 _FUNCNAME(const char *nptr, char **endptr, int base)
54 int any, cutlim, i, neg;
56 /* check base value */
57 if (base && (base < 2 || base > 36)) {
58 #if !defined(_KERNEL) && !defined(_STANDALONE)
61 /* LINTED interface specification */
62 *endptr = __DECONST(void *, nptr);
65 panic("%s: invalid base %d", __func__, base);
70 * Skip white space and pick up leading +/- sign if any.
71 * If base is 0, allow 0x for hex and 0 for octal, else
72 * 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 ? __INT_MIN : __INT_MAX);
113 cutlim = (int)(cutoff % base);
122 for (acc = 0, any = 0;; c = *s++) {
126 i = c - (isupper(c) ? 'A' - 10 : 'a' - 10);
134 if (acc < cutoff || (acc == cutoff && i > cutlim)) {
136 #if !defined(_KERNEL) && !defined(_STANDALONE)
149 if (acc > cutoff || (acc == cutoff && i > cutlim)) {
151 #if !defined(_KERNEL) && !defined(_STANDALONE)
166 /* LINTED interface specification */
167 *endptr = __DECONST(void *, any ? s - 1 : nptr);