iokit/Kernel/IOStringFuncs.c

   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 <sys/types.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  * Convert a string to a quad integer.
 262  *
 263  * Ignores `locale' stuff.  Assumes that the upper and lower case
 264  * alphabets and digits are each contiguous.
 265  */
 266 quad_t
 267 strtoq(nptr, endptr, base)
 268         const char *nptr;
 269         char **endptr;
 270         register int base;
 271 {
 272         register const char *s;
 273         register u_quad_t acc;
 274         register int c;
 275         register u_quad_t qbase, cutoff;
 276         register int neg, any, cutlim;
 277
 278         /*
 279          * Skip white space and pick up leading +/- sign if any.
 280          * If base is 0, allow 0x for hex and 0 for octal, else
 281          * assume decimal; if base is already 16, allow 0x.
 282          */
 283         s = nptr;
 284         do {
 285                 c = *s++;
 286         } while (isspace(c));
 287         if (c == '-') {
 288                 neg = 1;
 289                 c = *s++;
 290         } else {
 291                 neg = 0;
 292                 if (c == '+')
 293                         c = *s++;
 294         }
 295         if ((base == 0 || base == 16) &&
 296             c == '0' && (*s == 'x' || *s == 'X')) {
 297                 c = s[1];
 298                 s += 2;
 299                 base = 16;
 300         }
 301         if (base == 0)
 302                 base = c == '0' ? 8 : 10;
 303
 304         /*
 305          * Compute the cutoff value between legal numbers and illegal
 306          * numbers.  That is the largest legal value, divided by the
 307          * base.  An input number that is greater than this value, if
 308          * followed by a legal input character, is too big.  One that
 309          * is equal to this value may be valid or not; the limit
 310          * between valid and invalid numbers is then based on the last
 311          * digit.  For instance, if the range for quads is
 312          * [-9223372036854775808..9223372036854775807] and the input base
 313          * is 10, cutoff will be set to 922337203685477580 and cutlim to
 314          * either 7 (neg==0) or 8 (neg==1), meaning that if we have
 315          * accumulated a value > 922337203685477580, or equal but the
 316          * next digit is > 7 (or 8), the number is too big, and we will
 317          * return a range error.
 318          *
 319          * Set any if any `digits' consumed; make it negative to indicate
 320          * overflow.
 321          */
 322         qbase = (unsigned)base;
 323         cutoff = neg ? -(u_quad_t)QUAD_MIN : QUAD_MAX;
 324         cutlim = cutoff % qbase;
 325         cutoff /= qbase;
 326         for (acc = 0, any = 0;; c = *s++) {
 327                 if (isdigit(c))
 328                         c -= '0';
 329                 else if (isalpha(c))
 330                         c -= isupper(c) ? 'A' - 10 : 'a' - 10;
 331                 else
 332                         break;
 333                 if (c >= base)
 334                         break;
 335                 if (any < 0 || acc > cutoff || acc == cutoff && c > cutlim)
 336                         any = -1;
 337                 else {
 338                         any = 1;
 339                         acc *= qbase;
 340                         acc += c;
 341                 }
 342         }
 343         if (any < 0) {
 344                 acc = neg ? QUAD_MIN : QUAD_MAX;
 345 //              errno = ERANGE;
 346         } else if (neg)
 347                 acc = -acc;
 348         if (endptr != 0)
 349                 *endptr = (char *)(any ? s - 1 : nptr);
 350         return (acc);
 351 }
 352
 353
 354 /*
 355  * Convert a string to an unsigned quad integer.
 356  *
 357  * Ignores `locale' stuff.  Assumes that the upper and lower case
 358  * alphabets and digits are each contiguous.
 359  */
 360 u_quad_t
 361 strtouq(nptr, endptr, base)
 362         const char *nptr;
 363         char **endptr;
 364         register int base;
 365 {
 366         register const char *s = nptr;
 367         register u_quad_t acc;
 368         register int c;
 369         register u_quad_t qbase, cutoff;
 370         register int neg, any, cutlim;
 371
 372         /*
 373          * See strtoq for comments as to the logic used.
 374          */
 375         s = nptr;
 376         do {
 377                 c = *s++;
 378         } while (isspace(c));
 379         if (c == '-') {
 380                 neg = 1;
 381                 c = *s++;
 382         } else {
 383                 neg = 0;
 384                 if (c == '+')
 385                         c = *s++;
 386         }
 387         if ((base == 0 || base == 16) &&
 388             c == '0' && (*s == 'x' || *s == 'X')) {
 389                 c = s[1];
 390                 s += 2;
 391                 base = 16;
 392         }
 393         if (base == 0)
 394                 base = c == '0' ? 8 : 10;
 395         qbase = (unsigned)base;
 396         cutoff = (u_quad_t)UQUAD_MAX / qbase;
 397         cutlim = (u_quad_t)UQUAD_MAX % qbase;
 398         for (acc = 0, any = 0;; c = *s++) {
 399                 if (isdigit(c))
 400                         c -= '0';
 401                 else if (isalpha(c))
 402                         c -= isupper(c) ? 'A' - 10 : 'a' - 10;
 403                 else
 404                         break;
 405                 if (c >= base)
 406                         break;
 407                 if (any < 0 || acc > cutoff || acc == cutoff && c > cutlim)
 408                         any = -1;
 409                 else {
 410                         any = 1;
 411                         acc *= qbase;
 412                         acc += c;
 413                 }
 414         }
 415         if (any < 0) {
 416                 acc = UQUAD_MAX;
 417 //              errno = ERANGE;
 418         } else if (neg)
 419                 acc = -acc;
 420         if (endptr != 0)
 421                 *endptr = (char *)(any ? s - 1 : nptr);
 422         return (acc);
 423 }
 424
 425
 426 /*
 427  *
 428  */
 429
 430 char *strchr(const char *str, int ch)
 431 {
 432     do {
 433         if (*str == ch)
 434             return((char *)str);
 435     } while (*str++);
 436     return ((char *) 0);
 437 }
 438
 439 /*
 440  *
 441  */
 442
 443 char *
 444 strncat(char *s1, const char *s2, unsigned long n)
 445 {
 446         char *os1;
 447         int i = n;
 448
 449         os1 = s1;
 450         while (*s1++)
 451                 ;
 452         --s1;
 453         while ((*s1++ = *s2++))
 454                 if (--i < 0) {
 455                         *--s1 = '\0';
 456                         break;
 457                 }
 458         return(os1);
 459 }