| 1 | /* |
| 2 | * Copyright (c) 1999 Apple Computer, Inc. All rights reserved. |
| 3 | * |
| 4 | * @APPLE_LICENSE_HEADER_START@ |
| 5 | * |
| 6 | * Portions Copyright (c) 1999 Apple Computer, Inc. All Rights |
| 7 | * Reserved. This file contains Original Code and/or Modifications of |
| 8 | * Original Code as defined in and that are subject to the Apple Public |
| 9 | * Source License Version 1.1 (the "License"). You may not use this file |
| 10 | * except in compliance with the License. Please obtain a copy of the |
| 11 | * License at http://www.apple.com/publicsource and read it before using |
| 12 | * this file. |
| 13 | * |
| 14 | * The Original Code and all software distributed under the License are |
| 15 | * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER |
| 16 | * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, |
| 17 | * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, |
| 18 | * FITNESS FOR A PARTICULAR PURPOSE OR NON- INFRINGEMENT. Please see the |
| 19 | * License for the specific language governing rights and limitations |
| 20 | * under the License. |
| 21 | * |
| 22 | * @APPLE_LICENSE_HEADER_END@ |
| 23 | */ |
| 24 | /*- |
| 25 | * Copyright (c) 1990, 1993 |
| 26 | * The Regents of the University of California. All rights reserved. |
| 27 | * |
| 28 | * Redistribution and use in source and binary forms, with or without |
| 29 | * modification, are permitted provided that the following conditions |
| 30 | * are met: |
| 31 | * 1. Redistributions of source code must retain the above copyright |
| 32 | * notice, this list of conditions and the following disclaimer. |
| 33 | * 2. Redistributions in binary form must reproduce the above copyright |
| 34 | * notice, this list of conditions and the following disclaimer in the |
| 35 | * documentation and/or other materials provided with the distribution. |
| 36 | * 3. All advertising materials mentioning features or use of this software |
| 37 | * must display the following acknowledgement: |
| 38 | * This product includes software developed by the University of |
| 39 | * California, Berkeley and its contributors. |
| 40 | * 4. Neither the name of the University nor the names of its contributors |
| 41 | * may be used to endorse or promote products derived from this software |
| 42 | * without specific prior written permission. |
| 43 | * |
| 44 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
| 45 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 46 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 47 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
| 48 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 49 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 50 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 51 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 52 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 53 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 54 | * SUCH DAMAGE. |
| 55 | */ |
| 56 | |
| 57 | /* Copyright (c) 1995 NeXT Computer, Inc. All rights reserved. |
| 58 | * |
| 59 | * HISTORY |
| 60 | * Modified by Curtis Galloway at NeXT June 1993, |
| 61 | * for use in the standalone library. |
| 62 | * |
| 63 | * 30-Nov-1995 Dean Reece at NeXT |
| 64 | * Created based on BSD4.4's strtol.c & strtoul.c. |
| 65 | * Removed dependency on _ctype_ by static versions of isupper()... |
| 66 | * Added support for "0b101..." binary constants. |
| 67 | * Commented out references to errno. |
| 68 | */ |
| 69 | |
| 70 | #if defined(LIBC_SCCS) && !defined(lint) |
| 71 | static char sccsid[] = "@(#)strtol.c 5.4 (Berkeley) 2/23/91"; |
| 72 | #endif /* LIBC_SCCS and not lint */ |
| 73 | |
| 74 | #include "libsa.h" |
| 75 | #include <limits.h> |
| 76 | |
| 77 | static inline int |
| 78 | isupper(char c) |
| 79 | { |
| 80 | return (c >= 'A' && c <= 'Z'); |
| 81 | } |
| 82 | |
| 83 | static inline int |
| 84 | islower(char c) |
| 85 | { |
| 86 | return (c >= 'a' && c <= 'z'); |
| 87 | } |
| 88 | |
| 89 | static inline int |
| 90 | isalpha(char c) |
| 91 | { |
| 92 | return ((c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z')); |
| 93 | } |
| 94 | |
| 95 | static inline int |
| 96 | isspace(char c) |
| 97 | { |
| 98 | return (c == ' ' || c == '\t' || c == '\n' || c == '\12'); |
| 99 | } |
| 100 | |
| 101 | static inline int |
| 102 | isdigit(char c) |
| 103 | { |
| 104 | return (c >= '0' && c <= '9'); |
| 105 | } |
| 106 | |
| 107 | |
| 108 | /* |
| 109 | * Convert a string to a long integer. |
| 110 | * |
| 111 | * Ignores `locale' stuff. Assumes that the upper and lower case |
| 112 | * alphabets and digits are each contiguous. |
| 113 | */ |
| 114 | long |
| 115 | strtol(nptr, endptr, base) |
| 116 | const char *nptr; |
| 117 | char **endptr; |
| 118 | register int base; |
| 119 | { |
| 120 | register const char *s = nptr; |
| 121 | register unsigned long acc; |
| 122 | register int c; |
| 123 | register unsigned long cutoff; |
| 124 | register int neg = 0, any, cutlim; |
| 125 | |
| 126 | /* |
| 127 | * Skip white space and pick up leading +/- sign if any. |
| 128 | * If base is 0, allow 0x for hex and 0 for octal, else |
| 129 | * assume decimal; if base is already 16, allow 0x. |
| 130 | */ |
| 131 | do { |
| 132 | c = *s++; |
| 133 | } while (isspace(c)); |
| 134 | if (c == '-') { |
| 135 | neg = 1; |
| 136 | c = *s++; |
| 137 | } else if (c == '+') |
| 138 | c = *s++; |
| 139 | if ((base == 0 || base == 16) && |
| 140 | c == '0' && (*s == 'x' || *s == 'X')) { |
| 141 | c = s[1]; |
| 142 | s += 2; |
| 143 | base = 16; |
| 144 | } else if ((base == 0 || base == 2) && |
| 145 | c == '0' && (*s == 'b' || *s == 'B')) { |
| 146 | c = s[1]; |
| 147 | s += 2; |
| 148 | base = 2; |
| 149 | } |
| 150 | if (base == 0) |
| 151 | base = c == '0' ? 8 : 10; |
| 152 | |
| 153 | /* |
| 154 | * Compute the cutoff value between legal numbers and illegal |
| 155 | * numbers. That is the largest legal value, divided by the |
| 156 | * base. An input number that is greater than this value, if |
| 157 | * followed by a legal input character, is too big. One that |
| 158 | * is equal to this value may be valid or not; the limit |
| 159 | * between valid and invalid numbers is then based on the last |
| 160 | * digit. For instance, if the range for longs is |
| 161 | * [-2147483648..2147483647] and the input base is 10, |
| 162 | * cutoff will be set to 214748364 and cutlim to either |
| 163 | * 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated |
| 164 | * a value > 214748364, or equal but the next digit is > 7 (or 8), |
| 165 | * the number is too big, and we will return a range error. |
| 166 | * |
| 167 | * Set any if any `digits' consumed; make it negative to indicate |
| 168 | * overflow. |
| 169 | */ |
| 170 | cutoff = neg ? -(unsigned long)LONG_MIN : LONG_MAX; |
| 171 | cutlim = cutoff % (unsigned long)base; |
| 172 | cutoff /= (unsigned long)base; |
| 173 | for (acc = 0, any = 0;; c = *s++) { |
| 174 | if (isdigit(c)) |
| 175 | c -= '0'; |
| 176 | else if (isalpha(c)) |
| 177 | c -= isupper(c) ? 'A' - 10 : 'a' - 10; |
| 178 | else |
| 179 | break; |
| 180 | if (c >= base) |
| 181 | break; |
| 182 | if (any < 0 || acc > cutoff || acc == cutoff && c > cutlim) |
| 183 | any = -1; |
| 184 | else { |
| 185 | any = 1; |
| 186 | acc *= base; |
| 187 | acc += c; |
| 188 | } |
| 189 | } |
| 190 | if (any < 0) { |
| 191 | acc = neg ? LONG_MIN : LONG_MAX; |
| 192 | // errno = ERANGE; |
| 193 | } else if (neg) |
| 194 | acc = -acc; |
| 195 | if (endptr != 0) |
| 196 | *endptr = (char *)(any ? s - 1 : nptr); |
| 197 | return (acc); |
| 198 | } |
| 199 | |
| 200 | |
| 201 | /* |
| 202 | * Convert a string to an unsigned long integer. |
| 203 | * |
| 204 | * Ignores `locale' stuff. Assumes that the upper and lower case |
| 205 | * alphabets and digits are each contiguous. |
| 206 | */ |
| 207 | unsigned long |
| 208 | strtoul(nptr, endptr, base) |
| 209 | const char *nptr; |
| 210 | char **endptr; |
| 211 | register int base; |
| 212 | { |
| 213 | register const char *s = nptr; |
| 214 | register unsigned long acc; |
| 215 | register int c; |
| 216 | register unsigned long cutoff; |
| 217 | register int neg = 0, any, cutlim; |
| 218 | |
| 219 | /* |
| 220 | * See strtol for comments as to the logic used. |
| 221 | */ |
| 222 | do { |
| 223 | c = *s++; |
| 224 | } while (isspace(c)); |
| 225 | if (c == '-') { |
| 226 | neg = 1; |
| 227 | c = *s++; |
| 228 | } else if (c == '+') |
| 229 | c = *s++; |
| 230 | if ((base == 0 || base == 16) && |
| 231 | c == '0' && (*s == 'x' || *s == 'X')) { |
| 232 | c = s[1]; |
| 233 | s += 2; |
| 234 | base = 16; |
| 235 | } else if ((base == 0 || base == 2) && |
| 236 | c == '0' && (*s == 'b' || *s == 'B')) { |
| 237 | c = s[1]; |
| 238 | s += 2; |
| 239 | base = 2; |
| 240 | } |
| 241 | if (base == 0) |
| 242 | base = c == '0' ? 8 : 10; |
| 243 | cutoff = (unsigned long)ULONG_MAX / (unsigned long)base; |
| 244 | cutlim = (unsigned long)ULONG_MAX % (unsigned long)base; |
| 245 | for (acc = 0, any = 0;; c = *s++) { |
| 246 | if (isdigit(c)) |
| 247 | c -= '0'; |
| 248 | else if (isalpha(c)) |
| 249 | c -= isupper(c) ? 'A' - 10 : 'a' - 10; |
| 250 | else |
| 251 | break; |
| 252 | if (c >= base) |
| 253 | break; |
| 254 | if (any < 0 || acc > cutoff || acc == cutoff && c > cutlim) |
| 255 | any = -1; |
| 256 | else { |
| 257 | any = 1; |
| 258 | acc *= base; |
| 259 | acc += c; |
| 260 | } |
| 261 | } |
| 262 | if (any < 0) { |
| 263 | acc = ULONG_MAX; |
| 264 | // errno = ERANGE; |
| 265 | } else if (neg) |
| 266 | acc = -acc; |
| 267 | if (endptr != 0) |
| 268 | *endptr = (char *)(any ? s - 1 : nptr); |
| 269 | return (acc); |
| 270 | } |