1 /* $NetBSD: _strtol.h,v 1.2 2009/05/20 22:03:29 christos Exp $ */ 2 3 /*- 4 * SPDX-License-Identifier: BSD-3-Clause 5 * 6 * Copyright (c) 1990, 1993 7 * The Regents of the University of California. All rights reserved. 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 12 * 1. Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * 2. Redistributions in binary form must reproduce the above copyright 15 * notice, this list of conditions and the following disclaimer in the 16 * documentation and/or other materials provided with the distribution. 17 * 3. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * Original version ID: 34 * NetBSD: src/lib/libc/locale/_wcstol.h,v 1.2 2003/08/07 16:43:03 agc Exp 35 */ 36 37 /* 38 * function template for strtol, strtoll and strtoimax. 39 * 40 * parameters: 41 * _FUNCNAME : function name 42 * __INT : return type 43 * __INT_MIN : lower limit of the return type 44 * __INT_MAX : upper limit of the return type 45 */ 46 47 __INT 48 _FUNCNAME(const char *nptr, char **endptr, int base) 49 { 50 const char *s; 51 __INT acc, cutoff; 52 unsigned char c; 53 int any, cutlim, i, neg; 54 55 /* check base value */ 56 if (base && (base < 2 || base > 36)) { 57 #if !defined(_KERNEL) && !defined(_STANDALONE) 58 errno = EINVAL; 59 if (endptr != NULL) 60 /* LINTED interface specification */ 61 *endptr = __DECONST(void *, nptr); 62 return (0); 63 #else 64 panic("%s: invalid base %d", __func__, base); 65 #endif 66 } 67 68 /* 69 * Skip white space and pick up leading +/- sign if any. 70 * If base is 0, allow 0x for hex and 0 for octal, else 71 * assume decimal; if base is already 16, allow 0x. 72 */ 73 s = nptr; 74 do { 75 c = *s++; 76 } while (isspace(c)); 77 if (c == '-') { 78 neg = 1; 79 c = *s++; 80 } else { 81 neg = 0; 82 if (c == '+') 83 c = *s++; 84 } 85 if ((base == 0 || base == 16) && 86 c == '0' && (*s == 'x' || *s == 'X') && 87 ((s[1] >= '0' && s[1] <= '9') || 88 (s[1] >= 'A' && s[1] <= 'F') || 89 (s[1] >= 'a' && s[1] <= 'f'))) { 90 c = s[1]; 91 s += 2; 92 base = 16; 93 } 94 if (base == 0) 95 base = (c == '0' ? 8 : 10); 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 ? __INT_MIN : __INT_MAX); 115 cutlim = (int)(cutoff % base); 116 cutoff /= base; 117 if (neg) { 118 if (cutlim > 0) { 119 cutlim -= base; 120 cutoff += 1; 121 } 122 cutlim = -cutlim; 123 } 124 for (acc = 0, any = 0;; c = *s++) { 125 if (isdigit(c)) 126 i = c - '0'; 127 else if (isalpha(c)) 128 i = c - (isupper(c) ? 'A' - 10 : 'a' - 10); 129 else 130 break; 131 if (i >= base) 132 break; 133 if (any < 0) 134 continue; 135 if (neg) { 136 if (acc < cutoff || (acc == cutoff && i > cutlim)) { 137 acc = __INT_MIN; 138 #if !defined(_KERNEL) && !defined(_STANDALONE) 139 any = -1; 140 errno = ERANGE; 141 #else 142 any = 0; 143 break; 144 #endif 145 } else { 146 any = 1; 147 acc *= base; 148 acc -= i; 149 } 150 } else { 151 if (acc > cutoff || (acc == cutoff && i > cutlim)) { 152 acc = __INT_MAX; 153 #if !defined(_KERNEL) && !defined(_STANDALONE) 154 any = -1; 155 errno = ERANGE; 156 #else 157 any = 0; 158 break; 159 #endif 160 } else { 161 any = 1; 162 acc *= base; 163 acc += i; 164 } 165 } 166 } 167 if (endptr != NULL) 168 /* LINTED interface specification */ 169 *endptr = __DECONST(void *, any ? s - 1 : nptr); 170 return(acc); 171 } 172