strtoul.c revision 116189
152845Sphk/*-
252845Sphk * Copyright (c) 1990, 1993
352845Sphk *	The Regents of the University of California.  All rights reserved.
452845Sphk *
552845Sphk * This code is derived from software contributed to Berkeley by
652845Sphk * Chris Torek.
752845Sphk *
852845Sphk * Redistribution and use in source and binary forms, with or without
952845Sphk * modification, are permitted provided that the following conditions
1052845Sphk * are met:
1152845Sphk * 1. Redistributions of source code must retain the above copyright
1252845Sphk *    notice, this list of conditions and the following disclaimer.
1352845Sphk * 2. Redistributions in binary form must reproduce the above copyright
1452845Sphk *    notice, this list of conditions and the following disclaimer in the
1552845Sphk *    documentation and/or other materials provided with the distribution.
1652845Sphk * 3. All advertising materials mentioning features or use of this software
1752845Sphk *    must display the following acknowledgement:
1852845Sphk *	This product includes software developed by the University of
1952845Sphk *	California, Berkeley and its contributors.
2052845Sphk * 4. Neither the name of the University nor the names of its contributors
2152845Sphk *    may be used to endorse or promote products derived from this software
2252845Sphk *    without specific prior written permission.
2352845Sphk *
2452845Sphk * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
2552845Sphk * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
2652845Sphk * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
2752845Sphk * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
2852845Sphk * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2952845Sphk * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
3052845Sphk * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
3152845Sphk * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
3252845Sphk * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
3352845Sphk * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
3452845Sphk * SUCH DAMAGE.
3552845Sphk *
36116189Sobrien * From: @(#)strtoul.c	8.1 (Berkeley) 6/4/93
3752845Sphk */
3852845Sphk
39116189Sobrien#include <sys/cdefs.h>
40116189Sobrien__FBSDID("$FreeBSD: head/sys/libkern/strtoul.c 116189 2003-06-11 05:37:42Z obrien $");
41116189Sobrien
4252845Sphk#include <sys/param.h>
4352845Sphk#include <sys/systm.h>
4452845Sphk#include <sys/ctype.h>
45114216Skan#include <sys/limits.h>
4652845Sphk
4752845Sphk/*
4852845Sphk * Convert a string to an unsigned long integer.
4952845Sphk *
5052845Sphk * Ignores `locale' stuff.  Assumes that the upper and lower case
5152845Sphk * alphabets and digits are each contiguous.
5252845Sphk */
5352845Sphkunsigned long
5452845Sphkstrtoul(nptr, endptr, base)
5552845Sphk	const char *nptr;
5653648Sarchie	char **endptr;
5752845Sphk	int base;
5852845Sphk{
5952845Sphk	const char *s = nptr;
6052845Sphk	unsigned long acc;
6152845Sphk	unsigned char c;
6252845Sphk	unsigned long cutoff;
6352845Sphk	int neg = 0, any, cutlim;
6452845Sphk
6552845Sphk	/*
6652845Sphk	 * See strtol for comments as to the logic used.
6752845Sphk	 */
6852845Sphk	do {
6952845Sphk		c = *s++;
7052845Sphk	} while (isspace(c));
7152845Sphk	if (c == '-') {
7252845Sphk		neg = 1;
7352845Sphk		c = *s++;
7452845Sphk	} else if (c == '+')
7552845Sphk		c = *s++;
7652845Sphk	if ((base == 0 || base == 16) &&
7752845Sphk	    c == '0' && (*s == 'x' || *s == 'X')) {
7852845Sphk		c = s[1];
7952845Sphk		s += 2;
8052845Sphk		base = 16;
8152845Sphk	}
8252845Sphk	if (base == 0)
8352845Sphk		base = c == '0' ? 8 : 10;
8452845Sphk	cutoff = (unsigned long)ULONG_MAX / (unsigned long)base;
8552845Sphk	cutlim = (unsigned long)ULONG_MAX % (unsigned long)base;
8652845Sphk	for (acc = 0, any = 0;; c = *s++) {
8752845Sphk		if (!isascii(c))
8852845Sphk			break;
8952845Sphk		if (isdigit(c))
9052845Sphk			c -= '0';
9152845Sphk		else if (isalpha(c))
9252845Sphk			c -= isupper(c) ? 'A' - 10 : 'a' - 10;
9352845Sphk		else
9452845Sphk			break;
9552845Sphk		if (c >= base)
9652845Sphk			break;
9752845Sphk		if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
9852845Sphk			any = -1;
9952845Sphk		else {
10052845Sphk			any = 1;
10152845Sphk			acc *= base;
10252845Sphk			acc += c;
10352845Sphk		}
10452845Sphk	}
10552845Sphk	if (any < 0) {
10652845Sphk		acc = ULONG_MAX;
10752845Sphk	} else if (neg)
10852845Sphk		acc = -acc;
10952845Sphk	if (endptr != 0)
11054006Sarchie		*((const char **)endptr) = any ? s - 1 : nptr;
11152845Sphk	return (acc);
11252845Sphk}
113