workbench/network/stacks/AROSTCP/bsdsocket/api/strtoul.c

   1 /*
   2  * Copyright (c) 1990, 1993
   3  *      The Regents of the University of California.  All rights reserved.
   4  * Copyright (c) 2005 Pavel Fedin
   5  *
   6  * Redistribution and use in source and binary forms, with or without
   7  * modification, are permitted provided that the following conditions
   8  * are met:
   9  * 1. Redistributions of source code must retain the above copyright
  10  *    notice, this list of conditions and the following disclaimer.
  11  * 2. Redistributions in binary form must reproduce the above copyright
  12  *    notice, this list of conditions and the following disclaimer in the
  13  *    documentation and/or other materials provided with the distribution.
  14  * 3. All advertising materials mentioning features or use of this software
  15  *    must display the following acknowledgement:
  16  *      This product includes software developed by the University of
  17  *      California, Berkeley and its contributors.
  18  * 4. Neither the name of the University nor the names of its contributors
  19  *    may be used to endorse or promote products derived from this software
  20  *    without specific prior written permission.
  21  *
  22  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  23  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  24  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  25  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  26  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  27  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  28  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  29  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  30  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  31  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  32  * SUCH DAMAGE.
  33  */
  34
  35 #include <sys/cdefs.h>
  36 #include <limits.h>
  37 #include <ctype.h>
  38 #include <errno.h>
  39 #include <stdlib.h>
  40 #include "miami.h"
  41
  42 /*
  43  * Convert a string to an unsigned long integer.
  44  *
  45  * Assumes that the upper and lower case
  46  * alphabets and digits are each contiguous.
  47  */
  48 unsigned long
  49 __strtoul(const char * __restrict nptr, char ** __restrict endptr, int base, int *errno)
  50 {
  51         const char *s;
  52         unsigned long acc;
  53         char c;
  54         unsigned long cutoff;
  55         int neg, any, cutlim;
  56
  57         /*
  58          * See strtol for comments as to the logic used.
  59          */
  60         s = nptr;
  61         do {
  62                 c = *s++;
  63         } while (isspace((unsigned char)c));
  64         if (c == '-') {
  65                 neg = 1;
  66                 c = *s++;
  67         } else {
  68                 neg = 0;
  69                 if (c == '+')
  70                         c = *s++;
  71         }
  72         if ((base == 0 || base == 16) &&
  73             c == '0' && (*s == 'x' || *s == 'X') &&
  74             ((s[1] >= '0' && s[1] <= '9') ||
  75             (s[1] >= 'A' && s[1] <= 'F') ||
  76             (s[1] >= 'a' && s[1] <= 'f'))) {
  77                 c = s[1];
  78                 s += 2;
  79                 base = 16;
  80         }
  81         if (base == 0)
  82                 base = c == '0' ? 8 : 10;
  83         acc = any = 0;
  84         if (base < 2 || base > 36)
  85                 goto noconv;
  86
  87         cutoff = ULONG_MAX / base;
  88         cutlim = ULONG_MAX % base;
  89         for ( ; ; c = *s++) {
  90                 if (c >= '0' && c <= '9')
  91                         c -= '0';
  92                 else if (c >= 'A' && c <= 'Z')
  93                         c -= 'A' - 10;
  94                 else if (c >= 'a' && c <= 'z')
  95                         c -= 'a' - 10;
  96                 else
  97                         break;
  98                 if (c >= base)
  99                         break;
 100                 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
 101                         any = -1;
 102                 else {
 103                         any = 1;
 104                         acc *= base;
 105                         acc += c;
 106                 }
 107         }
 108         if (any < 0) {
 109                 acc = ULONG_MAX;
 110                 *errno = ERANGE;
 111         } else if (!any) {
 112 noconv:
 113                 *errno = EINVAL;
 114         } else if (neg)
 115                 acc = -acc;
 116         if (endptr != NULL)
 117                 *endptr = (char *)(any ? s - 1 : nptr);
 118         return (acc);
 119 }