2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1992, 1993
5 * The Regents of the University of California. All rights reserved.
7 * Copyright (c) 2011 The FreeBSD Foundation
9 * Portions of this software were developed by David Chisnall
10 * under sponsorship from the FreeBSD Foundation.
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 #if defined(LIBC_SCCS) && !defined(lint)
38 static char sccsid[] = "from @(#)strtol.c 8.1 (Berkeley) 6/4/93";
39 #endif /* LIBC_SCCS and not lint */
40 #include <sys/cdefs.h>
41 __FBSDID("$FreeBSD$");
47 #include "xlocale_private.h"
50 * Convert a string to an intmax_t integer.
52 * Assumes that the upper and lower case
53 * alphabets and digits are each contiguous.
56 strtoimax_l(const char * __restrict nptr, char ** __restrict endptr, int base,
67 * Skip white space and pick up leading +/- sign if any.
68 * If base is 0, allow 0x for hex and 0 for octal, else
69 * assume decimal; if base is already 16, allow 0x.
74 } while (isspace_l((unsigned char)c, locale));
83 if ((base == 0 || base == 16) &&
84 c == '0' && (*s == 'x' || *s == 'X') &&
85 ((s[1] >= '0' && s[1] <= '9') ||
86 (s[1] >= 'A' && s[1] <= 'F') ||
87 (s[1] >= 'a' && s[1] <= 'f'))) {
93 base = c == '0' ? 8 : 10;
95 if (base < 2 || base > 36)
99 * Compute the cutoff value between legal numbers and illegal
100 * numbers. That is the largest legal value, divided by the
101 * base. An input number that is greater than this value, if
102 * followed by a legal input character, is too big. One that
103 * is equal to this value may be valid or not; the limit
104 * between valid and invalid numbers is then based on the last
105 * digit. For instance, if the range for intmax_t is
106 * [-9223372036854775808..9223372036854775807] and the input base
107 * is 10, cutoff will be set to 922337203685477580 and cutlim to
108 * either 7 (neg==0) or 8 (neg==1), meaning that if we have
109 * accumulated a value > 922337203685477580, or equal but the
110 * next digit is > 7 (or 8), the number is too big, and we will
111 * return a range error.
113 * Set 'any' if any `digits' consumed; make it negative to indicate
116 cutoff = neg ? (uintmax_t)-(INTMAX_MIN + INTMAX_MAX) + INTMAX_MAX
118 cutlim = cutoff % base;
120 for ( ; ; c = *s++) {
121 if (c >= '0' && c <= '9')
123 else if (c >= 'A' && c <= 'Z')
125 else if (c >= 'a' && c <= 'z')
131 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
140 acc = neg ? INTMAX_MIN : INTMAX_MAX;
148 *endptr = (char *)(any ? s - 1 : nptr);
152 strtoimax(const char * __restrict nptr, char ** __restrict endptr, int base)
154 return strtoimax_l(nptr, endptr, base, __get_locale());