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 @(#)strtoul.c 8.1 (Berkeley) 6/4/93";
39 #endif /* LIBC_SCCS and not lint */
40 #include <sys/cdefs.h>
45 #include "xlocale_private.h"
48 * Convert a string to a uintmax_t integer.
50 * Assumes that the upper and lower case
51 * alphabets and digits are each contiguous.
54 strtoumax_l(const char * __restrict nptr, char ** __restrict endptr, int base,
65 * See strtoimax for comments as to the logic used.
70 } while (isspace_l((unsigned char)c, locale));
79 if ((base == 0 || base == 16) &&
80 c == '0' && (*s == 'x' || *s == 'X') &&
81 ((s[1] >= '0' && s[1] <= '9') ||
82 (s[1] >= 'A' && s[1] <= 'F') ||
83 (s[1] >= 'a' && s[1] <= 'f'))) {
88 if ((base == 0 || base == 2) &&
89 c == '0' && (*s == 'b' || *s == 'B') &&
90 (s[1] >= '0' && s[1] <= '1')) {
96 base = c == '0' ? 8 : 10;
98 if (base < 2 || base > 36)
101 cutoff = UINTMAX_MAX / base;
102 cutlim = UINTMAX_MAX % base;
103 for ( ; ; c = *s++) {
104 if (c >= '0' && c <= '9')
106 else if (c >= 'A' && c <= 'Z')
108 else if (c >= 'a' && c <= 'z')
114 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
131 *endptr = (char *)(any ? s - 1 : nptr);
135 strtoumax(const char * __restrict nptr, char ** __restrict endptr, int base)
137 return strtoumax_l(nptr, endptr, base, __get_locale());