xref: /netbsd-src/lib/libc/locale/_wcstol.h (revision 8b0f9554ff8762542c4defc4f70e1eb76fb508fa)
1 /* $NetBSD: _wcstol.h,v 1.3 2005/11/29 03:11:59 christos Exp $ */
2 
3 /*-
4  * Copyright (c) 1990, 1993
5  *	The Regents of the University of California.  All rights reserved.
6  *
7  * Redistribution and use in source and binary forms, with or without
8  * modification, are permitted provided that the following conditions
9  * are met:
10  * 1. Redistributions of source code must retain the above copyright
11  *    notice, this list of conditions and the following disclaimer.
12  * 2. Redistributions in binary form must reproduce the above copyright
13  *    notice, this list of conditions and the following disclaimer in the
14  *    documentation and/or other materials provided with the distribution.
15  * 3. Neither the name of the University nor the names of its contributors
16  *    may be used to endorse or promote products derived from this software
17  *    without specific prior written permission.
18  *
19  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29  * SUCH DAMAGE.
30  *
31  * Original version ID:
32  * @(#)strtol.c	8.1 (Berkeley) 6/4/93
33  * NetBSD: wcstol.c,v 1.1 2001/09/27 16:30:36 yamt Exp
34  * Citrus: xpg4dl/FreeBSD/lib/libc/locale/wcstol.c,v 1.2 2001/09/21 16:11:41 yamt Exp
35  */
36 
37 /*
38  * function template for wcstol, wcstoll and wcstoimax.
39  *
40  * parameters:
41  *	_FUNCNAME : function name
42  *      __INT     : return type
43  *      __INT_MIN : lower limit of the return type
44  *      __INT_MAX : upper limit of the return type
45  */
46 
47 __INT
48 _FUNCNAME(nptr, endptr, base)
49 	const wchar_t *nptr;
50 	wchar_t **endptr;
51 	int base;
52 {
53 	const wchar_t *s;
54 	__INT acc, cutoff;
55 	wint_t wc;
56 	int i;
57 	int neg, any, cutlim;
58 
59 	_DIAGASSERT(nptr != NULL);
60 	/* endptr may be NULL */
61 
62 #ifdef __GNUC__
63 	(void)&acc; (void)&cutoff;
64 #endif
65 
66 	/* check base value */
67 	if (base && (base < 2 || base > 36)) {
68 		errno = EINVAL;
69 		return 0;
70 	}
71 
72 	/*
73 	 * Skip white space and pick up leading +/- sign if any.
74 	 * If base is 0, allow 0x for hex and 0 for octal, else
75 	 * assume decimal; if base is already 16, allow 0x.
76 	 */
77 	s = nptr;
78 	do {
79 		wc = (wchar_t) *s++;
80 	} while (iswspace(wc));
81 	if (wc == L'-') {
82 		neg = 1;
83 		wc = *s++;
84 	} else {
85 		neg = 0;
86 		if (wc == L'+')
87 			wc = *s++;
88 	}
89 	if ((base == 0 || base == 16) &&
90 	    wc == L'0' && (*s == L'x' || *s == L'X')) {
91 		wc = s[1];
92 		s += 2;
93 		base = 16;
94 	}
95 	if (base == 0)
96 		base = wc == L'0' ? 8 : 10;
97 
98 	/*
99 	 * See strtol for comments as to the logic used.
100 	 */
101 	cutoff = neg ? __INT_MIN : __INT_MAX;
102 	cutlim = (int)(cutoff % base);
103 	cutoff /= base;
104 	if (neg) {
105 		if (cutlim > 0) {
106 			cutlim -= base;
107 			cutoff += 1;
108 		}
109 		cutlim = -cutlim;
110 	}
111 	for (acc = 0, any = 0;; wc = (wchar_t) *s++) {
112 		i = __wctoint(wc);
113 		if (i == -1)
114 			break;
115 		if (i >= base)
116 			break;
117 		if (any < 0)
118 			continue;
119 		if (neg) {
120 			if (acc < cutoff || (acc == cutoff && i > cutlim)) {
121 				any = -1;
122 				acc = __INT_MIN;
123 				errno = ERANGE;
124 			} else {
125 				any = 1;
126 				acc *= base;
127 				acc -= i;
128 			}
129 		} else {
130 			if (acc > cutoff || (acc == cutoff && i > cutlim)) {
131 				any = -1;
132 				acc = __INT_MAX;
133 				errno = ERANGE;
134 			} else {
135 				any = 1;
136 				acc *= base;
137 				acc += i;
138 			}
139 		}
140 	}
141 	if (endptr != 0)
142 		*endptr = __UNCONST(any ? s - 1 : nptr);
143 	return (acc);
144 }
145