1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 3 * 4 * Copyright (c) 1990, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * Chris Torek. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. 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 * From: @(#)strtoul.c 8.1 (Berkeley) 6/4/93 35 */ 36 37 #include <sys/cdefs.h> 38 #include <sys/param.h> 39 #include <sys/systm.h> 40 #include <sys/ctype.h> 41 #include <sys/limits.h> 42 43 /* 44 * Convert a string to an unsigned long integer. 45 * 46 * Ignores `locale' stuff. Assumes that the upper and lower case 47 * alphabets and digits are each contiguous. 48 */ 49 unsigned long 50 strtoul(const char *nptr, char **endptr, int base) 51 { 52 const char *s = nptr; 53 unsigned long acc; 54 unsigned char c; 55 unsigned long cutoff; 56 int neg = 0, any, cutlim; 57 58 /* 59 * See strtol for comments as to the logic used. 60 */ 61 do { 62 c = *s++; 63 } while (isspace(c)); 64 if (c == '-') { 65 neg = 1; 66 c = *s++; 67 } else if (c == '+') 68 c = *s++; 69 if ((base == 0 || base == 16) && 70 c == '0' && (*s == 'x' || *s == 'X')) { 71 c = s[1]; 72 s += 2; 73 base = 16; 74 } 75 if (base == 0) 76 base = c == '0' ? 8 : 10; 77 cutoff = (unsigned long)ULONG_MAX / (unsigned long)base; 78 cutlim = (unsigned long)ULONG_MAX % (unsigned long)base; 79 for (acc = 0, any = 0;; c = *s++) { 80 if (!isascii(c)) 81 break; 82 if (isdigit(c)) 83 c -= '0'; 84 else if (isalpha(c)) 85 c -= isupper(c) ? 'A' - 10 : 'a' - 10; 86 else 87 break; 88 if (c >= base) 89 break; 90 if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim)) 91 any = -1; 92 else { 93 any = 1; 94 acc *= base; 95 acc += c; 96 } 97 } 98 if (any < 0) { 99 acc = ULONG_MAX; 100 } else if (neg) 101 acc = -acc; 102 if (endptr != NULL) 103 *endptr = __DECONST(char *, any ? s - 1 : nptr); 104 return (acc); 105 } 106