1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
|
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* or http://www.opensolaris.org/os/licensing.
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 2004 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
/* Copyright (c) 1988 AT&T */
/* All Rights Reserved */
#pragma ident "%Z%%M% %I% %E% SMI"
#include <sys/ddi.h>
#include <sys/errno.h>
/*
* String to integer conversion routines.
*
* This file is derived from usr/src/common/util/strtol.c
*
* We cannot use the user land versions as there is no errno to report
* error in kernel. So the return value is used to return an error,
* and the result is stored in an extra parameter passed by reference.
* Otherwise, the following functions are identical to the user land
* versions.
*/
/*
* We should have a kernel version of ctype.h.
*/
#define isalnum(ch) (isalpha(ch) || isdigit(ch))
#define isalpha(ch) (isupper(ch) || islower(ch))
#define isdigit(ch) ((ch) >= '0' && (ch) <= '9')
#define islower(ch) ((ch) >= 'a' && (ch) <= 'z')
#define isspace(ch) (((ch) == ' ') || ((ch) == '\r') || ((ch) == '\n') || \
((ch) == '\t') || ((ch) == '\f'))
#define isupper(ch) ((ch) >= 'A' && (ch) <= 'Z')
#define isxdigit(ch) (isdigit(ch) || ((ch) >= 'a' && (ch) <= 'f') || \
((ch) >= 'A' && (ch) <= 'F'))
#define DIGIT(x) \
(isdigit(x) ? (x) - '0' : islower(x) ? (x) + 10 - 'a' : (x) + 10 - 'A')
#define MBASE ('z' - 'a' + 1 + 10)
/*
* The following macro is a local version of isalnum() which limits
* alphabetic characters to the ranges a-z and A-Z; locale dependent
* characters will not return 1. The members of a-z and A-Z are
* assumed to be in ascending order and contiguous
*/
#define lisalnum(x) \
(isdigit(x) || ((x) >= 'a' && (x) <= 'z') || ((x) >= 'A' && (x) <= 'Z'))
int
ddi_strtol(const char *str, char **nptr, int base, long *result)
{
long val;
int c;
int xx, neg = 0;
long multmin;
long limit;
const char **ptr = (const char **)nptr;
const unsigned char *ustr = (const unsigned char *)str;
if (ptr != (const char **)0)
*ptr = (char *)ustr; /* in case no number is formed */
if (base < 0 || base > MBASE || base == 1) {
/* base is invalid -- should be a fatal error */
return (EINVAL);
}
if (!isalnum(c = *ustr)) {
while (isspace(c))
c = *++ustr;
switch (c) {
case '-':
neg++;
/* FALLTHROUGH */
case '+':
c = *++ustr;
}
}
if (base == 0)
if (c != '0')
base = 10;
else if (ustr[1] == 'x' || ustr[1] == 'X')
base = 16;
else
base = 8;
/*
* for any base > 10, the digits incrementally following
* 9 are assumed to be "abc...z" or "ABC...Z"
*/
if (!lisalnum(c) || (xx = DIGIT(c)) >= base)
return (EINVAL); /* no number formed */
if (base == 16 && c == '0' && (ustr[1] == 'x' || ustr[1] == 'X') &&
isxdigit(ustr[2]))
c = *(ustr += 2); /* skip over leading "0x" or "0X" */
/* this code assumes that abs(LONG_MIN) >= abs(LONG_MAX) */
if (neg)
limit = LONG_MIN;
else
limit = -LONG_MAX;
multmin = limit / (long)base;
val = -DIGIT(c);
for (c = *++ustr; lisalnum(c) && (xx = DIGIT(c)) < base; ) {
/* accumulate neg avoids surprises near MAXLONG */
if (val < multmin)
goto overflow;
val *= base;
if (val < limit + xx)
goto overflow;
val -= xx;
c = *++ustr;
}
if (ptr != (const char **)0)
*ptr = (char *)ustr;
*result = neg ? val : -val;
return (0);
overflow:
for (c = *++ustr; lisalnum(c) && (xx = DIGIT(c)) < base; (c = *++ustr))
;
if (ptr != (const char **)0)
*ptr = (char *)ustr;
return (ERANGE);
}
int
ddi_strtoul(const char *str, char **nptr, int base, unsigned long *result)
{
unsigned long val;
int c;
int xx;
unsigned long multmax;
int neg = 0;
const char **ptr = (const char **)nptr;
const unsigned char *ustr = (const unsigned char *)str;
if (ptr != (const char **)0)
*ptr = (char *)ustr; /* in case no number is formed */
if (base < 0 || base > MBASE || base == 1) {
/* base is invalid -- should be a fatal error */
return (EINVAL);
}
if (!isalnum(c = *ustr)) {
while (isspace(c))
c = *++ustr;
switch (c) {
case '-':
neg++;
/* FALLTHROUGH */
case '+':
c = *++ustr;
}
}
if (base == 0)
if (c != '0')
base = 10;
else if (ustr[1] == 'x' || ustr[1] == 'X')
base = 16;
else
base = 8;
/*
* for any base > 10, the digits incrementally following
* 9 are assumed to be "abc...z" or "ABC...Z"
*/
if (!lisalnum(c) || (xx = DIGIT(c)) >= base)
return (EINVAL); /* no number formed */
if (base == 16 && c == '0' && (ustr[1] == 'x' || ustr[1] == 'X') &&
isxdigit(ustr[2]))
c = *(ustr += 2); /* skip over leading "0x" or "0X" */
multmax = ULONG_MAX / (unsigned long)base;
val = DIGIT(c);
for (c = *++ustr; lisalnum(c) && (xx = DIGIT(c)) < base; ) {
if (val > multmax)
goto overflow;
val *= base;
if (ULONG_MAX - val < xx)
goto overflow;
val += xx;
c = *++ustr;
}
if (ptr != (const char **)0)
*ptr = (char *)ustr;
*result = neg ? -val : val;
return (0);
overflow:
for (c = *++ustr; lisalnum(c) && (xx = DIGIT(c)) < base; (c = *++ustr))
;
if (ptr != (const char **)0)
*ptr = (char *)ustr;
return (ERANGE);
}
|
