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