i386/libsa/strtol.c

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