• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /** @file
2   Copyright (c) 2010, 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.php
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   @(#)strtoul.c  8.1 (Berkeley) 6/4/93
40   Citrus: xpg4dl/FreeBSD/lib/libc/locale/wcstoul.c,v 1.2 2001/09/21 16:11:41 yamt Exp
41   NetBSD: wcstoul.c,v 1.1 2001/09/27 16:30:37 yamt Exp
42   NetBSD: _wcstoul.h,v 1.3 2005/11/29 03:11:59 christos Exp
43  */
44 
45 #include <Library/BaseLib.h>
46 
47 /*
48  * function template for wcstoul, wcstoull and wcstoumax.
49  *
50  * parameters:
51  *  _FUNCNAME  : function name
52  *      __wUINT     : return type
53  *      __wINT      : signed version of __wUINT
54  *      __wUINT_MAX : upper limit of the return type
55  */
56 
57 __wUINT
_FUNCNAME(const wchar_t * nptr,wchar_t ** endptr,int base)58 _FUNCNAME(
59   const wchar_t *nptr,
60   wchar_t **endptr,
61   int base
62   )
63 {
64   const wchar_t *s;
65   __wUINT acc, cutoff;
66   wint_t wc;
67   int i;
68   int neg, any, cutlim;
69 
70   _DIAGASSERT(nptr != NULL);
71   /* endptr may be NULL */
72 
73   if (base && (base < 2 || base > 36)) {
74     errno = EINVAL;
75     return 0;
76   }
77 
78   /*
79    * Skip white space and pick up leading +/- sign if any.
80    * If base is 0, allow 0x for hex and 0 for octal, else
81    * assume decimal; if base is already 16, allow 0x.
82    */
83   s = nptr;
84   do {
85     wc = (wchar_t) *s++;
86   } while (iswspace(wc));
87   if (wc == L'-') {
88     neg = 1;
89     wc = *s++;
90   } else {
91     neg = 0;
92     if (wc == L'+')
93       wc = *s++;
94   }
95   if ((base == 0 || base == 16) &&
96       wc == L'0' && (*s == L'x' || *s == L'X')) {
97     wc = s[1];
98     s += 2;
99     base = 16;
100   }
101   if (base == 0)
102     base = wc == L'0' ? 8 : 10;
103 
104   /*
105    * See strtoul for comments as to the logic used.
106    */
107   cutoff = (__wUINT)DivU64x32 ((UINT64) __wUINT_MAX, (UINT32) base);
108   cutlim = (int) ModU64x32 ((UINT64) __wUINT_MAX, (UINT32) base);
109   for (acc = 0, any = 0;; wc = (wint_t) *s++) {
110     i = __wctoint((wchar_t)wc);
111     if (i == -1) {
112       break;
113     }
114     if (i >= base)
115       break;
116     if (any < 0)
117       continue;
118     if (acc > cutoff || (acc == cutoff && i > cutlim)) {
119       any = -1;
120       acc = __wUINT_MAX;
121       errno = ERANGE;
122     } else {
123       any = 1;
124       acc *= (__wUINT)base;
125       acc += i;
126     }
127   }
128   if (neg && any > 0)
129     acc = (__wUINT)(-((__wINT)acc));
130   if (endptr != 0)
131     *endptr = __UNCONST(any ? s - 1 : nptr);
132   return (acc);
133 }
134