GCC Code Coverage Report
Directory: ./ Exec Total Coverage
File: lib/libc/locale/_wcstol.h Lines: 0 44 0.0 %
Date: 2017-11-13 Branches: 0 44 0.0 %

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