1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 3 * 4 * Copyright (c) 1992, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Copyright (c) 2011 The FreeBSD Foundation 8 * 9 * Portions of this software were developed by David Chisnall 10 * under sponsorship from the FreeBSD Foundation. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 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. 23 * 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 34 * SUCH DAMAGE. 35 */ 36 37 #if defined(LIBC_SCCS) && !defined(lint) 38 static char sccsid[] = "@(#)strtoq.c 8.1 (Berkeley) 6/4/93"; 39 #endif /* LIBC_SCCS and not lint */ 40 #include <sys/cdefs.h> 41 #include <limits.h> 42 #include <errno.h> 43 #include <ctype.h> 44 #include <stdlib.h> 45 #include "xlocale_private.h" 46 47 /* 48 * Convert a string to a long long integer. 49 * 50 * Assumes that the upper and lower case 51 * alphabets and digits are each contiguous. 52 */ 53 long long 54 strtoll_l(const char * __restrict nptr, char ** __restrict endptr, int base, 55 locale_t locale) 56 { 57 const char *s; 58 unsigned long long acc; 59 char c; 60 unsigned long long cutoff; 61 int neg, any, cutlim; 62 FIX_LOCALE(locale); 63 64 /* 65 * Skip white space and pick up leading +/- sign if any. 66 * If base is 0, allow 0b for binary, 0x for hex, and 0 for 67 * octal, else assume decimal; if base is already 2, allow 68 * 0b; if base is already 16, allow 0x. 69 */ 70 s = nptr; 71 do { 72 c = *s++; 73 } while (isspace_l((unsigned char)c, locale)); 74 if (c == '-') { 75 neg = 1; 76 c = *s++; 77 } else { 78 neg = 0; 79 if (c == '+') 80 c = *s++; 81 } 82 if ((base == 0 || base == 16) && 83 c == '0' && (*s == 'x' || *s == 'X') && 84 ((s[1] >= '0' && s[1] <= '9') || 85 (s[1] >= 'A' && s[1] <= 'F') || 86 (s[1] >= 'a' && s[1] <= 'f'))) { 87 c = s[1]; 88 s += 2; 89 base = 16; 90 } 91 if ((base == 0 || base == 2) && 92 c == '0' && (*s == 'b' || *s == 'B') && 93 (s[1] >= '0' && s[1] <= '1')) { 94 c = s[1]; 95 s += 2; 96 base = 2; 97 } 98 if (base == 0) 99 base = c == '0' ? 8 : 10; 100 acc = any = 0; 101 if (base < 2 || base > 36) 102 goto noconv; 103 104 /* 105 * Compute the cutoff value between legal numbers and illegal 106 * numbers. That is the largest legal value, divided by the 107 * base. An input number that is greater than this value, if 108 * followed by a legal input character, is too big. One that 109 * is equal to this value may be valid or not; the limit 110 * between valid and invalid numbers is then based on the last 111 * digit. For instance, if the range for quads is 112 * [-9223372036854775808..9223372036854775807] and the input base 113 * is 10, cutoff will be set to 922337203685477580 and cutlim to 114 * either 7 (neg==0) or 8 (neg==1), meaning that if we have 115 * accumulated a value > 922337203685477580, or equal but the 116 * next digit is > 7 (or 8), the number is too big, and we will 117 * return a range error. 118 * 119 * Set 'any' if any `digits' consumed; make it negative to indicate 120 * overflow. 121 */ 122 cutoff = neg ? (unsigned long long)-(LLONG_MIN + LLONG_MAX) + LLONG_MAX 123 : LLONG_MAX; 124 cutlim = cutoff % base; 125 cutoff /= base; 126 for ( ; ; c = *s++) { 127 if (c >= '0' && c <= '9') 128 c -= '0'; 129 else if (c >= 'A' && c <= 'Z') 130 c -= 'A' - 10; 131 else if (c >= 'a' && c <= 'z') 132 c -= 'a' - 10; 133 else 134 break; 135 if (c >= base) 136 break; 137 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim)) 138 any = -1; 139 else { 140 any = 1; 141 acc *= base; 142 acc += c; 143 } 144 } 145 if (any < 0) { 146 acc = neg ? LLONG_MIN : LLONG_MAX; 147 errno = ERANGE; 148 } else if (!any) { 149 noconv: 150 errno = EINVAL; 151 } else if (neg) 152 acc = -acc; 153 if (endptr != NULL) 154 *endptr = (char *)(any ? s - 1 : nptr); 155 return (acc); 156 } 157 long long 158 strtoll(const char * __restrict nptr, char ** __restrict endptr, int base) 159 { 160 return strtoll_l(nptr, endptr, base, __get_locale()); 161 } 162