11573Srgrimes/* 21573Srgrimes * Copyright (c) 1990, 1993 31573Srgrimes * The Regents of the University of California. All rights reserved. 41573Srgrimes * 5227753Stheraven * Copyright (c) 2011 The FreeBSD Foundation 6227753Stheraven * All rights reserved. 7227753Stheraven * Portions of this software were developed by David Chisnall 8227753Stheraven * under sponsorship from the FreeBSD Foundation. 9227753Stheraven * 101573Srgrimes * Redistribution and use in source and binary forms, with or without 111573Srgrimes * modification, are permitted provided that the following conditions 121573Srgrimes * are met: 131573Srgrimes * 1. Redistributions of source code must retain the above copyright 141573Srgrimes * notice, this list of conditions and the following disclaimer. 151573Srgrimes * 2. Redistributions in binary form must reproduce the above copyright 161573Srgrimes * notice, this list of conditions and the following disclaimer in the 171573Srgrimes * documentation and/or other materials provided with the distribution. 181573Srgrimes * 4. Neither the name of the University nor the names of its contributors 191573Srgrimes * may be used to endorse or promote products derived from this software 201573Srgrimes * without specific prior written permission. 211573Srgrimes * 221573Srgrimes * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 231573Srgrimes * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 241573Srgrimes * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 251573Srgrimes * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 261573Srgrimes * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 271573Srgrimes * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 281573Srgrimes * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 291573Srgrimes * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 301573Srgrimes * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 311573Srgrimes * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 321573Srgrimes * SUCH DAMAGE. 331573Srgrimes */ 341573Srgrimes 351573Srgrimes#if defined(LIBC_SCCS) && !defined(lint) 361573Srgrimesstatic char sccsid[] = "@(#)strtoul.c 8.1 (Berkeley) 6/4/93"; 371573Srgrimes#endif /* LIBC_SCCS and not lint */ 3892986Sobrien#include <sys/cdefs.h> 3992986Sobrien__FBSDID("$FreeBSD$"); 401573Srgrimes 41247001Skientzle#include "stand.h" 421573Srgrimes#include <limits.h> 431573Srgrimes 441573Srgrimes/* 451573Srgrimes * Convert a string to an unsigned long integer. 461573Srgrimes * 4782975Sache * Assumes that the upper and lower case 481573Srgrimes * alphabets and digits are each contiguous. 491573Srgrimes */ 501573Srgrimesunsigned long 51246931Skientzlestrtoul(const char * __restrict nptr, char ** __restrict endptr, int base) 521573Srgrimes{ 5387016Sache const char *s; 5487016Sache unsigned long acc; 5587494Sache char c; 5687016Sache unsigned long cutoff; 5787494Sache int neg, any, cutlim; 581573Srgrimes 591573Srgrimes /* 601573Srgrimes * See strtol for comments as to the logic used. 611573Srgrimes */ 6282975Sache s = nptr; 631573Srgrimes do { 641573Srgrimes c = *s++; 65246931Skientzle } while (isspace((unsigned char)c)); 661573Srgrimes if (c == '-') { 671573Srgrimes neg = 1; 681573Srgrimes c = *s++; 6982975Sache } else { 7082975Sache neg = 0; 7182975Sache if (c == '+') 7282975Sache c = *s++; 7382975Sache } 741573Srgrimes if ((base == 0 || base == 16) && 75140536Sache c == '0' && (*s == 'x' || *s == 'X') && 76140577Sache ((s[1] >= '0' && s[1] <= '9') || 77140577Sache (s[1] >= 'A' && s[1] <= 'F') || 78140577Sache (s[1] >= 'a' && s[1] <= 'f'))) { 791573Srgrimes c = s[1]; 801573Srgrimes s += 2; 811573Srgrimes base = 16; 821573Srgrimes } 831573Srgrimes if (base == 0) 841573Srgrimes base = c == '0' ? 8 : 10; 8582982Sache acc = any = 0; 8687023Sfenner if (base < 2 || base > 36) 8782975Sache goto noconv; 8882975Sache 8982975Sache cutoff = ULONG_MAX / base; 9082975Sache cutlim = ULONG_MAX % base; 9182982Sache for ( ; ; c = *s++) { 9287494Sache if (c >= '0' && c <= '9') 9387494Sache c -= '0'; 9487494Sache else if (c >= 'A' && c <= 'Z') 9587494Sache c -= 'A' - 10; 9687494Sache else if (c >= 'a' && c <= 'z') 9787494Sache c -= 'a' - 10; 981573Srgrimes else 991573Srgrimes break; 10087494Sache if (c >= base) 1011573Srgrimes break; 10287494Sache if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim)) 1031573Srgrimes any = -1; 1041573Srgrimes else { 1051573Srgrimes any = 1; 1061573Srgrimes acc *= base; 10787494Sache acc += c; 1081573Srgrimes } 1091573Srgrimes } 1101573Srgrimes if (any < 0) { 1111573Srgrimes acc = ULONG_MAX; 1121573Srgrimes errno = ERANGE; 11382975Sache } else if (!any) { 11482975Sachenoconv: 11582975Sache errno = EINVAL; 1161573Srgrimes } else if (neg) 1171573Srgrimes acc = -acc; 11882975Sache if (endptr != NULL) 1191573Srgrimes *endptr = (char *)(any ? s - 1 : nptr); 1201573Srgrimes return (acc); 1211573Srgrimes} 122