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