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