mirror of
https://github.com/autc04/Retro68.git
synced 2024-11-24 23:32:06 +00:00
208 lines
6.7 KiB
C
208 lines
6.7 KiB
C
|
/*
|
||
|
FUNCTION
|
||
|
<<wcstoul>>---wide string to unsigned long
|
||
|
|
||
|
INDEX
|
||
|
wcstoul
|
||
|
INDEX
|
||
|
_wcstoul_r
|
||
|
|
||
|
ANSI_SYNOPSIS
|
||
|
#include <wchar.h>
|
||
|
unsigned long wcstoul(const wchar_t *<[s]>, wchar_t **<[ptr]>,
|
||
|
int <[base]>);
|
||
|
|
||
|
unsigned long _wcstoul_r(void *<[reent]>, const wchar_t *<[s]>,
|
||
|
wchar_t **<[ptr]>, int <[base]>);
|
||
|
|
||
|
TRAD_SYNOPSIS
|
||
|
#include <wchar.h>
|
||
|
unsigned long wcstoul(<[s]>, <[ptr]>, <[base]>)
|
||
|
wchar_t *<[s]>;
|
||
|
wchar_t **<[ptr]>;
|
||
|
int <[base]>;
|
||
|
|
||
|
unsigned long _wcstoul_r(<[reent]>, <[s]>, <[ptr]>, <[base]>)
|
||
|
wchar_t *<[reent]>;
|
||
|
wchar_t *<[s]>;
|
||
|
wchar_t **<[ptr]>;
|
||
|
int <[base]>;
|
||
|
|
||
|
DESCRIPTION
|
||
|
The function <<wcstoul>> converts the wide string <<*<[s]>>> to
|
||
|
an <<unsigned long>>. First, it breaks down the string into three parts:
|
||
|
leading whitespace, which is ignored; a subject string consisting
|
||
|
of the digits meaningful in the radix specified by <[base]>
|
||
|
(for example, <<0>> through <<7>> if the value of <[base]> is 8);
|
||
|
and a trailing portion consisting of one or more unparseable characters,
|
||
|
which always includes the terminating null character. Then, it attempts
|
||
|
to convert the subject string into an unsigned long integer, and returns the
|
||
|
result.
|
||
|
|
||
|
If the value of <[base]> is zero, the subject string is expected to look
|
||
|
like a normal C integer constant (save that no optional sign is permitted):
|
||
|
a possible <<0x>> indicating hexadecimal radix, and a number.
|
||
|
If <[base]> is between 2 and 36, the expected form of the subject is a
|
||
|
sequence of digits (which may include letters, depending on the
|
||
|
base) representing an integer in the radix specified by <[base]>.
|
||
|
The letters <<a>>--<<z>> (or <<A>>--<<Z>>) are used as digits valued from
|
||
|
10 to 35. If <[base]> is 16, a leading <<0x>> is permitted.
|
||
|
|
||
|
The subject sequence is the longest initial sequence of the input
|
||
|
string that has the expected form, starting with the first
|
||
|
non-whitespace character. If the string is empty or consists entirely
|
||
|
of whitespace, or if the first non-whitespace character is not a
|
||
|
permissible digit, the subject string is empty.
|
||
|
|
||
|
If the subject string is acceptable, and the value of <[base]> is zero,
|
||
|
<<wcstoul>> attempts to determine the radix from the input string. A
|
||
|
string with a leading <<0x>> is treated as a hexadecimal value; a string with
|
||
|
a leading <<0>> and no <<x>> is treated as octal; all other strings are
|
||
|
treated as decimal. If <[base]> is between 2 and 36, it is used as the
|
||
|
conversion radix, as described above. Finally, a pointer to the first
|
||
|
character past the converted subject string is stored in <[ptr]>, if
|
||
|
<[ptr]> is not <<NULL>>.
|
||
|
|
||
|
If the subject string is empty (that is, if <<*>><[s]> does not start
|
||
|
with a substring in acceptable form), no conversion
|
||
|
is performed and the value of <[s]> is stored in <[ptr]> (if <[ptr]> is
|
||
|
not <<NULL>>).
|
||
|
|
||
|
The alternate function <<_wcstoul_r>> is a reentrant version. The
|
||
|
extra argument <[reent]> is a pointer to a reentrancy structure.
|
||
|
|
||
|
|
||
|
RETURNS
|
||
|
<<wcstoul>> returns the converted value, if any. If no conversion was
|
||
|
made, <<0>> is returned.
|
||
|
|
||
|
<<wcstoul>> returns <<ULONG_MAX>> if the magnitude of the converted
|
||
|
value is too large, and sets <<errno>> to <<ERANGE>>.
|
||
|
|
||
|
PORTABILITY
|
||
|
<<wcstoul>> is ANSI.
|
||
|
|
||
|
<<wcstoul>> requires no supporting OS subroutines.
|
||
|
*/
|
||
|
|
||
|
/*
|
||
|
* Copyright (c) 1990 Regents of the University of California.
|
||
|
* All rights reserved.
|
||
|
*
|
||
|
* Redistribution and use in source and binary forms, with or without
|
||
|
* modification, are permitted provided that the following conditions
|
||
|
* are met:
|
||
|
* 1. Redistributions of source code must retain the above copyright
|
||
|
* notice, this list of conditions and the following disclaimer.
|
||
|
* 2. Redistributions in binary form must reproduce the above copyright
|
||
|
* notice, this list of conditions and the following disclaimer in the
|
||
|
* documentation and/or other materials provided with the distribution.
|
||
|
* 3. All advertising materials mentioning features or use of this software
|
||
|
* must display the following acknowledgement:
|
||
|
* This product includes software developed by the University of
|
||
|
* California, Berkeley and its contributors.
|
||
|
* 4. Neither the name of the University nor the names of its contributors
|
||
|
* may be used to endorse or promote products derived from this software
|
||
|
* without specific prior written permission.
|
||
|
*
|
||
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
||
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
||
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
||
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
||
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
||
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||
|
* SUCH DAMAGE.
|
||
|
*/
|
||
|
|
||
|
#include <_ansi.h>
|
||
|
#include <limits.h>
|
||
|
#include <wctype.h>
|
||
|
#include <wchar.h>
|
||
|
#include <errno.h>
|
||
|
#include <stdlib.h>
|
||
|
#include <reent.h>
|
||
|
|
||
|
/*
|
||
|
* Convert a wide string to an unsigned long integer.
|
||
|
*
|
||
|
* Ignores `locale' stuff. Assumes that the upper and lower case
|
||
|
* alphabets and digits are each contiguous.
|
||
|
*/
|
||
|
unsigned long
|
||
|
_DEFUN (_wcstoul_r, (rptr, nptr, endptr, base),
|
||
|
struct _reent *rptr _AND
|
||
|
_CONST wchar_t *nptr _AND
|
||
|
wchar_t **endptr _AND
|
||
|
int base)
|
||
|
{
|
||
|
register const wchar_t *s = nptr;
|
||
|
register unsigned long acc;
|
||
|
register int c;
|
||
|
register unsigned long cutoff;
|
||
|
register int neg = 0, any, cutlim;
|
||
|
|
||
|
/*
|
||
|
* See strtol for comments as to the logic used.
|
||
|
*/
|
||
|
do {
|
||
|
c = *s++;
|
||
|
} while (iswspace(c));
|
||
|
if (c == L'-') {
|
||
|
neg = 1;
|
||
|
c = *s++;
|
||
|
} else if (c == L'+')
|
||
|
c = *s++;
|
||
|
if ((base == 0 || base == 16) &&
|
||
|
c == L'0' && (*s == L'x' || *s == L'X')) {
|
||
|
c = s[1];
|
||
|
s += 2;
|
||
|
base = 16;
|
||
|
}
|
||
|
if (base == 0)
|
||
|
base = c == L'0' ? 8 : 10;
|
||
|
cutoff = (unsigned long)ULONG_MAX / (unsigned long)base;
|
||
|
cutlim = (unsigned long)ULONG_MAX % (unsigned long)base;
|
||
|
for (acc = 0, any = 0;; c = *s++) {
|
||
|
if (iswdigit(c))
|
||
|
c -= L'0';
|
||
|
else if (iswalpha(c))
|
||
|
c -= iswupper(c) ? L'A' - 10 : L'a' - 10;
|
||
|
else
|
||
|
break;
|
||
|
if (c >= base)
|
||
|
break;
|
||
|
if (any < 0 || acc > cutoff || (acc == cutoff && c > cutlim))
|
||
|
any = -1;
|
||
|
else {
|
||
|
any = 1;
|
||
|
acc *= base;
|
||
|
acc += c;
|
||
|
}
|
||
|
}
|
||
|
if (any < 0) {
|
||
|
acc = ULONG_MAX;
|
||
|
rptr->_errno = ERANGE;
|
||
|
} else if (neg)
|
||
|
acc = -acc;
|
||
|
if (endptr != 0)
|
||
|
*endptr = (wchar_t *) (any ? s - 1 : nptr);
|
||
|
return (acc);
|
||
|
}
|
||
|
|
||
|
#ifndef _REENT_ONLY
|
||
|
|
||
|
unsigned long
|
||
|
_DEFUN (wcstoul, (s, ptr, base),
|
||
|
_CONST wchar_t *s _AND
|
||
|
wchar_t **ptr _AND
|
||
|
int base)
|
||
|
{
|
||
|
return _wcstoul_r (_REENT, s, ptr, base);
|
||
|
}
|
||
|
|
||
|
#endif
|