1 /* $NetBSD: strtol.c,v 1.1 2006/04/07 14:21:29 cherry Exp $ */ 2 3 /*- 4 * Copyright (c) 1990, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. All advertising materials mentioning features or use of this software 16 * must display the following acknowledgement: 17 * This product includes software developed by the University of 18 * California, Berkeley and its contributors. 19 * 4. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 */ 35 36 #include <sys/cdefs.h> 37 38 #if defined(LIBC_SCCS) && !defined(lint) 39 static char sccsid[] = "@(#)strtol.c 8.1 (Berkeley) 6/4/93"; 40 #endif /* LIBC_SCCS and not lint */ 41 42 #include <lib/libsa/stand.h> 43 #include <lib/libkern/libkern.h> 44 45 #include <machine/limits.h> 46 47 #include "bootstrap.h" 48 49 /* 50 * Convert a string to a long integer. 51 * 52 * Ignores `locale' stuff. Assumes that the upper and lower case 53 * alphabets and digits are each contiguous. 54 */ 55 long 56 strtol(nptr, endptr, base) 57 const char *nptr; 58 char **endptr; 59 int base; 60 { 61 const char *s; 62 unsigned long acc; 63 unsigned char c; 64 unsigned long cutoff; 65 int neg = 0, any, cutlim; 66 67 /* Be sensible about NULL strings */ 68 if (nptr == NULL) 69 nptr = ""; 70 s = nptr; 71 72 /* 73 * Skip white space and pick up leading +/- sign if any. 74 * If base is 0, allow 0x for hex and 0 for octal, else 75 * assume decimal; if base is already 16, allow 0x. 76 */ 77 do { 78 c = *s++; 79 } while (isspace(c)); 80 if (c == '-') { 81 neg = 1; 82 c = *s++; 83 } else if (c == '+') 84 c = *s++; 85 if ((base == 0 || base == 16) && 86 c == '0' && (*s == 'x' || *s == 'X')) { 87 c = s[1]; 88 s += 2; 89 base = 16; 90 } 91 if (base == 0) 92 base = c == '0' ? 8 : 10; 93 94 /* 95 * Compute the cutoff value between legal numbers and illegal 96 * numbers. That is the largest legal value, divided by the 97 * base. An input number that is greater than this value, if 98 * followed by a legal input character, is too big. One that 99 * is equal to this value may be valid or not; the limit 100 * between valid and invalid numbers is then based on the last 101 * digit. For instance, if the range for longs is 102 * [-2147483648..2147483647] and the input base is 10, 103 * cutoff will be set to 214748364 and cutlim to either 104 * 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated 105 * a value > 214748364, or equal but the next digit is > 7 (or 8), 106 * the number is too big, and we will return a range error. 107 * 108 * Set any if any `digits' consumed; make it negative to indicate 109 * overflow. 110 */ 111 cutoff = neg ? -(unsigned long)LONG_MIN : LONG_MAX; 112 cutlim = cutoff % (unsigned long)base; 113 cutoff /= (unsigned long)base; 114 for (acc = 0, any = 0;; c = *s++) { 115 if (!isascii(c)) 116 break; 117 if (isdigit(c)) 118 c -= '0'; 119 else if (isalpha(c)) 120 c -= isupper(c) ? 'A' - 10 : 'a' - 10; 121 else 122 break; 123 if (c >= base) 124 break; 125 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim)) 126 any = -1; 127 else { 128 any = 1; 129 acc *= base; 130 acc += c; 131 } 132 } 133 if (any < 0) { 134 acc = neg ? LONG_MIN : LONG_MAX; 135 errno = ERANGE; 136 } else if (neg) 137 acc = -acc; 138 if (endptr != 0) 139 *endptr = (char *)(any ? s - 1 : nptr); 140 return (acc); 141 } 142