iokit/Kernel/IOStringFuncs.c

   1 /*
   2  * Copyright (c) 1998-2000 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 /*      Copyright (c) 1995 NeXT Computer, Inc.  All rights reserved.
  26  *
  27  * strol.c - The functions strtol() & strtoul() are exported as public API
  28  *           via the header file ~driverkit/generalFuncs.h
  29  *
  30  * HISTORY
  31  * 25-Oct-1995    Dean Reece at NeXT
  32  *      Created based on BSD4.4's strtol.c & strtoul.c.
  33  *      Removed dependency on _ctype_ by static versions of isupper()...
  34  *      Added support for "0b101..." binary constants.
  35  *      Commented out references to errno.
  36  */
  37
  38 /*-
  39  * Copyright (c) 1990, 1993
  40  *      The Regents of the University of California.  All rights reserved.
  41  *
  42  * Redistribution and use in source and binary forms, with or without
  43  * modification, are permitted provided that the following conditions
  44  * are met:
  45  * 1. Redistributions of source code must retain the above copyright
  46  *    notice, this list of conditions and the following disclaimer.
  47  * 2. Redistributions in binary form must reproduce the above copyright
  48  *    notice, this list of conditions and the following disclaimer in the
  49  *    documentation and/or other materials provided with the distribution.
  50  * 3. All advertising materials mentioning features or use of this software
  51  *    must display the following acknowledgement:
  52  *      This product includes software developed by the University of
  53  *      California, Berkeley and its contributors.
  54  * 4. Neither the name of the University nor the names of its contributors
  55  *    may be used to endorse or promote products derived from this software
  56  *    without specific prior written permission.
  57  *
  58  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  59  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  60  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  61  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  62  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  63  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  64  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  65  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  66  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  67  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  68  * SUCH DAMAGE.
  69  */
  70
  71 /*
  72 #include <string.h>
  73 #include <stdlib.h>
  74 #include <limits.h>
  75 */
  76 #include <sys/types.h>
  77 #include <machine/limits.h>
  78
  79 typedef int BOOL;
  80
  81 static inline BOOL
  82 isupper(char c)
  83 {
  84     return (c >= 'A' && c <= 'Z');
  85 }
  86
  87 static inline BOOL
  88 isalpha(char c)
  89 {
  90     return ((c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z'));
  91 }
  92
  93
  94 static inline BOOL
  95 isspace(char c)
  96 {
  97     return (c == ' ' || c == '\t' || c == '\n' || c == '\12');
  98 }
  99
 100 static inline BOOL
 101 isdigit(char c)
 102 {
 103     return (c >= '0' && c <= '9');
 104 }
 105
 106 /*
 107  * Convert a string to a long integer.
 108  *
 109  * Ignores `locale' stuff.  Assumes that the upper and lower case
 110  * alphabets and digits are each contiguous.
 111  */
 112 long
 113 strtol(nptr, endptr, base)
 114         const char *nptr;
 115         char **endptr;
 116         register int base;
 117 {
 118         register const char *s = nptr;
 119         register unsigned long acc;
 120         register int c;
 121         register unsigned long cutoff;
 122         register int neg = 0, any, cutlim;
 123
 124         /*
 125          * Skip white space and pick up leading +/- sign if any.
 126          * If base is 0, allow 0x for hex and 0 for octal, else
 127          * assume decimal; if base is already 16, allow 0x.
 128          */
 129         do {
 130                 c = *s++;
 131         } while (isspace(c));
 132         if (c == '-') {
 133                 neg = 1;
 134                 c = *s++;
 135         } else if (c == '+')
 136                 c = *s++;
 137         if ((base == 0 || base == 16) &&
 138             c == '0' && (*s == 'x' || *s == 'X')) {
 139                 c = s[1];
 140                 s += 2;
 141                 base = 16;
 142         } else if ((base == 0 || base == 2) &&
 143             c == '0' && (*s == 'b' || *s == 'B')) {
 144                 c = s[1];
 145                 s += 2;
 146                 base = 2;
 147         }
 148         if (base == 0)
 149                 base = c == '0' ? 8 : 10;
 150
 151         /*
 152          * Compute the cutoff value between legal numbers and illegal
 153          * numbers.  That is the largest legal value, divided by the
 154          * base.  An input number that is greater than this value, if
 155          * followed by a legal input character, is too big.  One that
 156          * is equal to this value may be valid or not; the limit
 157          * between valid and invalid numbers is then based on the last
 158          * digit.  For instance, if the range for longs is
 159          * [-2147483648..2147483647] and the input base is 10,
 160          * cutoff will be set to 214748364 and cutlim to either
 161          * 7 (neg==0) or 8 (neg==1), meaning that if we have accumulated
 162          * a value > 214748364, or equal but the next digit is > 7 (or 8),
 163          * the number is too big, and we will return a range error.
 164          *
 165          * Set any if any `digits' consumed; make it negative to indicate
 166          * overflow.
 167          */
 168         cutoff = neg ? -(unsigned long)LONG_MIN : LONG_MAX;
 169         cutlim = cutoff % (unsigned long)base;
 170         cutoff /= (unsigned long)base;
 171         for (acc = 0, any = 0;; c = *s++) {
 172                 if (isdigit(c))
 173                         c -= '0';
 174                 else if (isalpha(c))
 175                         c -= isupper(c) ? 'A' - 10 : 'a' - 10;
 176                 else
 177                         break;
 178                 if (c >= base)
 179                         break;
 180                 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim) )
 181                         any = -1;
 182                 else {
 183                         any = 1;
 184                         acc *= base;
 185                         acc += c;
 186                 }
 187         }
 188         if (any < 0) {
 189                 acc = neg ? LONG_MIN : LONG_MAX;
 190 //              errno = ERANGE;
 191         } else if (neg)
 192                 acc = -acc;
 193         if (endptr != 0)
 194                 *endptr = (char *)(any ? s - 1 : nptr);
 195         return (acc);
 196 }
 197
 198 unsigned long
 199 strtoul(nptr, endptr, base)
 200         const char *nptr;
 201         char **endptr;
 202         register int base;
 203 {
 204         register const char *s = nptr;
 205         register unsigned long acc;
 206         register int c;
 207         register unsigned long cutoff;
 208         register int neg = 0, any, cutlim;
 209
 210         /*
 211          * See strtol for comments as to the logic used.
 212          */
 213         do {
 214                 c = *s++;
 215         } while (isspace(c));
 216         if (c == '-') {
 217                 neg = 1;
 218                 c = *s++;
 219         } else if (c == '+')
 220                 c = *s++;
 221         if ((base == 0 || base == 16) &&
 222             c == '0' && (*s == 'x' || *s == 'X')) {
 223                 c = s[1];
 224                 s += 2;
 225                 base = 16;
 226         } else if ((base == 0 || base == 2) &&
 227             c == '0' && (*s == 'b' || *s == 'B')) {
 228                 c = s[1];
 229                 s += 2;
 230                 base = 2;
 231         }
 232         if (base == 0)
 233                 base = c == '0' ? 8 : 10;
 234         cutoff = (unsigned long)ULONG_MAX / (unsigned long)base;
 235         cutlim = (unsigned long)ULONG_MAX % (unsigned long)base;
 236         for (acc = 0, any = 0;; c = *s++) {
 237                 if (isdigit(c))
 238                         c -= '0';
 239                 else if (isalpha(c))
 240                         c -= isupper(c) ? 'A' - 10 : 'a' - 10;
 241                 else
 242                         break;
 243                 if (c >= base)
 244                         break;
 245                 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim) )
 246                         any = -1;
 247                 else {
 248                         any = 1;
 249                         acc *= base;
 250                         acc += c;
 251                 }
 252         }
 253         if (any < 0) {
 254                 acc = ULONG_MAX;
 255 //              errno = ERANGE;
 256         } else if (neg)
 257                 acc = -acc;
 258         if (endptr != 0)
 259                 *endptr = (char *)(any ? s - 1 : nptr);
 260         return (acc);
 261 }
 262
 263 /*
 264  * Convert a string to a quad integer.
 265  *
 266  * Ignores `locale' stuff.  Assumes that the upper and lower case
 267  * alphabets and digits are each contiguous.
 268  */
 269 quad_t
 270 strtoq(nptr, endptr, base)
 271         const char *nptr;
 272         char **endptr;
 273         register int base;
 274 {
 275         register const char *s;
 276         register u_quad_t acc;
 277         register int c;
 278         register u_quad_t qbase, cutoff;
 279         register int neg, any, cutlim;
 280
 281         /*
 282          * Skip white space and pick up leading +/- sign if any.
 283          * If base is 0, allow 0x for hex and 0 for octal, else
 284          * assume decimal; if base is already 16, allow 0x.
 285          */
 286         s = nptr;
 287         do {
 288                 c = *s++;
 289         } while (isspace(c));
 290         if (c == '-') {
 291                 neg = 1;
 292                 c = *s++;
 293         } else {
 294                 neg = 0;
 295                 if (c == '+')
 296                         c = *s++;
 297         }
 298         if ((base == 0 || base == 16) &&
 299             c == '0' && (*s == 'x' || *s == 'X')) {
 300                 c = s[1];
 301                 s += 2;
 302                 base = 16;
 303         }
 304         if (base == 0)
 305                 base = c == '0' ? 8 : 10;
 306
 307         /*
 308          * Compute the cutoff value between legal numbers and illegal
 309          * numbers.  That is the largest legal value, divided by the
 310          * base.  An input number that is greater than this value, if
 311          * followed by a legal input character, is too big.  One that
 312          * is equal to this value may be valid or not; the limit
 313          * between valid and invalid numbers is then based on the last
 314          * digit.  For instance, if the range for quads is
 315          * [-9223372036854775808..9223372036854775807] and the input base
 316          * is 10, cutoff will be set to 922337203685477580 and cutlim to
 317          * either 7 (neg==0) or 8 (neg==1), meaning that if we have
 318          * accumulated a value > 922337203685477580, or equal but the
 319          * next digit is > 7 (or 8), the number is too big, and we will
 320          * return a range error.
 321          *
 322          * Set any if any `digits' consumed; make it negative to indicate
 323          * overflow.
 324          */
 325         qbase = (unsigned)base;
 326         cutoff = neg ? -(u_quad_t)QUAD_MIN : QUAD_MAX;
 327         cutlim = cutoff % qbase;
 328         cutoff /= qbase;
 329         for (acc = 0, any = 0;; c = *s++) {
 330                 if (isdigit(c))
 331                         c -= '0';
 332                 else if (isalpha(c))
 333                         c -= isupper(c) ? 'A' - 10 : 'a' - 10;
 334                 else
 335                         break;
 336                 if (c >= base)
 337                         break;
 338                 if (any < 0 || acc > cutoff || acc == cutoff && c > cutlim)
 339                         any = -1;
 340                 else {
 341                         any = 1;
 342                         acc *= qbase;
 343                         acc += c;
 344                 }
 345         }
 346         if (any < 0) {
 347                 acc = neg ? QUAD_MIN : QUAD_MAX;
 348 //              errno = ERANGE;
 349         } else if (neg)
 350                 acc = -acc;
 351         if (endptr != 0)
 352                 *endptr = (char *)(any ? s - 1 : nptr);
 353         return (acc);
 354 }
 355
 356
 357 /*
 358  * Convert a string to an unsigned quad integer.
 359  *
 360  * Ignores `locale' stuff.  Assumes that the upper and lower case
 361  * alphabets and digits are each contiguous.
 362  */
 363 u_quad_t
 364 strtouq(nptr, endptr, base)
 365         const char *nptr;
 366         char **endptr;
 367         register int base;
 368 {
 369         register const char *s = nptr;
 370         register u_quad_t acc;
 371         register int c;
 372         register u_quad_t qbase, cutoff;
 373         register int neg, any, cutlim;
 374
 375         /*
 376          * See strtoq for comments as to the logic used.
 377          */
 378         s = nptr;
 379         do {
 380                 c = *s++;
 381         } while (isspace(c));
 382         if (c == '-') {
 383                 neg = 1;
 384                 c = *s++;
 385         } else {
 386                 neg = 0;
 387                 if (c == '+')
 388                         c = *s++;
 389         }
 390         if ((base == 0 || base == 16) &&
 391             c == '0' && (*s == 'x' || *s == 'X')) {
 392                 c = s[1];
 393                 s += 2;
 394                 base = 16;
 395         }
 396         if (base == 0)
 397                 base = c == '0' ? 8 : 10;
 398         qbase = (unsigned)base;
 399         cutoff = (u_quad_t)UQUAD_MAX / qbase;
 400         cutlim = (u_quad_t)UQUAD_MAX % qbase;
 401         for (acc = 0, any = 0;; c = *s++) {
 402                 if (isdigit(c))
 403                         c -= '0';
 404                 else if (isalpha(c))
 405                         c -= isupper(c) ? 'A' - 10 : 'a' - 10;
 406                 else
 407                         break;
 408                 if (c >= base)
 409                         break;
 410                 if (any < 0 || acc > cutoff || acc == cutoff && c > cutlim)
 411                         any = -1;
 412                 else {
 413                         any = 1;
 414                         acc *= qbase;
 415                         acc += c;
 416                 }
 417         }
 418         if (any < 0) {
 419                 acc = UQUAD_MAX;
 420 //              errno = ERANGE;
 421         } else if (neg)
 422                 acc = -acc;
 423         if (endptr != 0)
 424                 *endptr = (char *)(any ? s - 1 : nptr);
 425         return (acc);
 426 }
 427
 428
 429 /*
 430  *
 431  */
 432
 433 char *strchr(const char *str, int ch)
 434 {
 435     do {
 436         if (*str == ch)
 437             return((char *)str);
 438     } while (*str++);
 439     return ((char *) 0);
 440 }
 441
 442 /*
 443  *
 444  */
 445
 446 char *
 447 strncat(char *s1, const char *s2, unsigned long n)
 448 {
 449         char *os1;
 450         int i = n;
 451
 452         os1 = s1;
 453         while (*s1++)
 454                 ;
 455         --s1;
 456         while ((*s1++ = *s2++))
 457                 if (--i < 0) {
 458                         *--s1 = '\0';
 459                         break;
 460                 }
 461         return(os1);
 462 }