2001-11-28 03:37:06 +00:00
|
|
|
/*-
|
2017-11-20 19:49:47 +00:00
|
|
|
* SPDX-License-Identifier: BSD-3-Clause
|
|
|
|
*
|
2001-11-28 03:37:06 +00:00
|
|
|
* Copyright (c) 1992, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
2011-11-20 14:45:42 +00:00
|
|
|
* Copyright (c) 2011 The FreeBSD Foundation
|
2022-08-04 20:52:23 +00:00
|
|
|
*
|
2011-11-20 14:45:42 +00:00
|
|
|
* Portions of this software were developed by David Chisnall
|
|
|
|
* under sponsorship from the FreeBSD Foundation.
|
|
|
|
*
|
2001-11-28 03:37:06 +00:00
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
2013-06-13 00:19:30 +00:00
|
|
|
* 3. Neither the name of the University nor the names of its contributors
|
2001-11-28 03:37:06 +00:00
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#if defined(LIBC_SCCS) && !defined(lint)
|
|
|
|
static char sccsid[] = "from @(#)strtol.c 8.1 (Berkeley) 6/4/93";
|
|
|
|
#endif /* LIBC_SCCS and not lint */
|
2002-03-22 21:53:29 +00:00
|
|
|
#include <sys/cdefs.h>
|
|
|
|
__FBSDID("$FreeBSD$");
|
2001-11-28 03:37:06 +00:00
|
|
|
|
|
|
|
#include <ctype.h>
|
|
|
|
#include <errno.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <inttypes.h>
|
2011-11-20 14:45:42 +00:00
|
|
|
#include "xlocale_private.h"
|
2001-11-28 03:37:06 +00:00
|
|
|
|
|
|
|
/*
|
2003-01-01 18:49:04 +00:00
|
|
|
* Convert a string to an intmax_t integer.
|
2001-11-28 03:37:06 +00:00
|
|
|
*
|
|
|
|
* Assumes that the upper and lower case
|
|
|
|
* alphabets and digits are each contiguous.
|
|
|
|
*/
|
|
|
|
intmax_t
|
2011-11-20 14:45:42 +00:00
|
|
|
strtoimax_l(const char * __restrict nptr, char ** __restrict endptr, int base,
|
|
|
|
locale_t locale)
|
2001-11-28 03:37:06 +00:00
|
|
|
{
|
|
|
|
const char *s;
|
|
|
|
uintmax_t acc;
|
2001-12-07 16:33:47 +00:00
|
|
|
char c;
|
2001-11-28 03:37:06 +00:00
|
|
|
uintmax_t cutoff;
|
2001-12-07 16:33:47 +00:00
|
|
|
int neg, any, cutlim;
|
2011-11-20 14:45:42 +00:00
|
|
|
FIX_LOCALE(locale);
|
2001-11-28 03:37:06 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Skip white space and pick up leading +/- sign if any.
|
|
|
|
* If base is 0, allow 0x for hex and 0 for octal, else
|
|
|
|
* assume decimal; if base is already 16, allow 0x.
|
|
|
|
*/
|
|
|
|
s = nptr;
|
|
|
|
do {
|
|
|
|
c = *s++;
|
2011-11-20 14:45:42 +00:00
|
|
|
} while (isspace_l((unsigned char)c, locale));
|
2001-11-28 03:37:06 +00:00
|
|
|
if (c == '-') {
|
|
|
|
neg = 1;
|
|
|
|
c = *s++;
|
|
|
|
} else {
|
|
|
|
neg = 0;
|
|
|
|
if (c == '+')
|
|
|
|
c = *s++;
|
|
|
|
}
|
|
|
|
if ((base == 0 || base == 16) &&
|
2005-01-21 00:42:13 +00:00
|
|
|
c == '0' && (*s == 'x' || *s == 'X') &&
|
2005-01-21 13:31:02 +00:00
|
|
|
((s[1] >= '0' && s[1] <= '9') ||
|
|
|
|
(s[1] >= 'A' && s[1] <= 'F') ||
|
|
|
|
(s[1] >= 'a' && s[1] <= 'f'))) {
|
2001-11-28 03:37:06 +00:00
|
|
|
c = s[1];
|
|
|
|
s += 2;
|
|
|
|
base = 16;
|
|
|
|
}
|
|
|
|
if (base == 0)
|
|
|
|
base = c == '0' ? 8 : 10;
|
|
|
|
acc = any = 0;
|
|
|
|
if (base < 2 || base > 36)
|
|
|
|
goto noconv;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Compute the cutoff value between legal numbers and illegal
|
|
|
|
* numbers. That is the largest legal value, divided by the
|
|
|
|
* base. An input number that is greater than this value, if
|
|
|
|
* followed by a legal input character, is too big. One that
|
|
|
|
* is equal to this value may be valid or not; the limit
|
|
|
|
* between valid and invalid numbers is then based on the last
|
|
|
|
* digit. For instance, if the range for intmax_t is
|
|
|
|
* [-9223372036854775808..9223372036854775807] and the input base
|
|
|
|
* is 10, cutoff will be set to 922337203685477580 and cutlim to
|
|
|
|
* either 7 (neg==0) or 8 (neg==1), meaning that if we have
|
|
|
|
* accumulated a value > 922337203685477580, or equal but the
|
|
|
|
* next digit is > 7 (or 8), the number is too big, and we will
|
|
|
|
* return a range error.
|
|
|
|
*
|
|
|
|
* Set 'any' if any `digits' consumed; make it negative to indicate
|
|
|
|
* overflow.
|
|
|
|
*/
|
|
|
|
cutoff = neg ? (uintmax_t)-(INTMAX_MIN + INTMAX_MAX) + INTMAX_MAX
|
|
|
|
: INTMAX_MAX;
|
|
|
|
cutlim = cutoff % base;
|
|
|
|
cutoff /= base;
|
|
|
|
for ( ; ; c = *s++) {
|
2001-12-07 16:33:47 +00:00
|
|
|
if (c >= '0' && c <= '9')
|
|
|
|
c -= '0';
|
|
|
|
else if (c >= 'A' && c <= 'Z')
|
|
|
|
c -= 'A' - 10;
|
|
|
|
else if (c >= 'a' && c <= 'z')
|
|
|
|
c -= 'a' - 10;
|
2001-11-28 03:37:06 +00:00
|
|
|
else
|
|
|
|
break;
|
2001-12-07 16:33:47 +00:00
|
|
|
if (c >= base)
|
2001-11-28 03:37:06 +00:00
|
|
|
break;
|
2001-12-07 16:33:47 +00:00
|
|
|
if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
|
2001-11-28 03:37:06 +00:00
|
|
|
any = -1;
|
|
|
|
else {
|
|
|
|
any = 1;
|
|
|
|
acc *= base;
|
2001-12-07 16:33:47 +00:00
|
|
|
acc += c;
|
2001-11-28 03:37:06 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
if (any < 0) {
|
|
|
|
acc = neg ? INTMAX_MIN : INTMAX_MAX;
|
|
|
|
errno = ERANGE;
|
|
|
|
} else if (!any) {
|
|
|
|
noconv:
|
|
|
|
errno = EINVAL;
|
|
|
|
} else if (neg)
|
|
|
|
acc = -acc;
|
|
|
|
if (endptr != NULL)
|
|
|
|
*endptr = (char *)(any ? s - 1 : nptr);
|
|
|
|
return (acc);
|
|
|
|
}
|
2011-11-20 14:45:42 +00:00
|
|
|
intmax_t
|
|
|
|
strtoimax(const char * __restrict nptr, char ** __restrict endptr, int base)
|
|
|
|
{
|
|
|
|
return strtoimax_l(nptr, endptr, base, __get_locale());
|
|
|
|
}
|