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