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