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
|
/* My bet is this was written by Chris Torek.
I reformatted and ansidecl-ized it, and tweaked it a little. */
#include <ctype.h>
#include <stdio.h>
#include <errno.h>
#include <stdlib.h>
#include <string.h>
#include <limits.h>
struct ltest
{
const char *str; /* Convert this. */
unsigned long int expect; /* To get this. */
int base; /* Use this base. */
char left; /* With this left over. */
int err; /* And this in errno. */
};
static const struct ltest tests[] =
{
/* First, signed numbers: */
/* simple... */
{"123", 123, 0, 0, 0},
{"+123", 123, 0, 0, 0},
{" 123", 123, 0, 0, 0},
{" 123 ", 123, 0, ' ', 0},
{" -17", -17, 0, 0, 0},
/* implicit base... */
{"0123", 0123, 0, 0, 0},
{"0123a", 0123, 0, 'a', 0},
{"01239", 0123, 0, '9', 0},
{"0x123", 0x123, 0, 0, 0},
{"-0x123", -0x123, 0, 0, 0},
{"0x0xc", 0, 0, 'x', 0},
{" +0x123fg", 0x123f, 0, 'g', 0},
/* explicit base... */
{"123", 0x123, 16, 0, 0},
{"0x123", 0x123, 16, 0, 0},
{"123", 0123, 8, 0, 0},
{"0123", 0123, 8, 0, 0},
{"0123", 123, 10, 0, 0},
{"0x123", 0, 10, 'x', 0},
/* case insensitivity... */
{"abcd", 0xabcd, 16, 0, 0},
{"AbCd", 0xabcd, 16, 0, 0},
{"0xABCD", 0xabcd, 16, 0, 0},
{"0Xabcd", 0xabcd, 16, 0, 0},
/* odd bases... */
{"0xyz", 33 * 35 + 34, 35, 'z', 0},
{"yz!", 34 * 36 + 35, 36, '!', 0},
{"-yz", -(34*36 + 35), 36, 0, 0},
{"GhI4", ((16*20 + 17)*20 + 18)*20 + 4, 20, 0, 0},
/* extremes... */
#if LONG_MAX == 0x7fffffff
{"2147483647", 2147483647, 0, 0, 0},
{"2147483648", 2147483647, 0, 0, ERANGE},
{"214748364888", 2147483647, 0, 0, ERANGE},
{"2147483650", 2147483647, 0, 0, ERANGE},
{"-2147483648", 0x80000000, 0, 0, 0},
{"-2147483649", 0x80000000, 0, 0, ERANGE},
{"0x1122334455z", 2147483647, 16, 'z', ERANGE},
#else
{"9223372036854775807", 9223372036854775807, 0, 0, 0},
{"9223372036854775808", 9223372036854775807, 0, 0, ERANGE},
{"922337203685477580777", 9223372036854775807, 0, 0, ERANGE},
{"9223372036854775810", 9223372036854775807, 0, 0, ERANGE},
{"-2147483648", -2147483648, 0, 0, 0},
{"-9223372036854775808", 0x8000000000000000, 0, 0, 0},
{"-9223372036854775809", 0x8000000000000000, 0, 0, ERANGE},
{"0x112233445566778899z", 9223372036854775807, 16, 'z', ERANGE},
{"0xFFFFFFFFFFFF00FF" , 9223372036854775807, 0, 0, ERANGE},
#endif
{NULL, 0, 0, 0, 0},
/* Then unsigned. */
{" 0", 0, 0, 0, 0},
{"0xffffffffg", 0xffffffff, 0, 'g', 0},
#if LONG_MAX == 0x7fffffff
{"-0xfedcba98", 0x01234568, 0, 0, 0},
{"0xf1f2f3f4f5", 0xffffffff, 0, 0, ERANGE},
{"-0x123456789", 0xffffffff, 0, 0, ERANGE},
#else
{"0xffffffffffffffffg", 0xffffffffffffffff, 0, 'g', 0},
{"-0xfedcba987654321", 0xf0123456789abcdf, 0, 0, 0},
{"0xf1f2f3f4f5f6f7f8f9", 0xffffffffffffffff, 0, 0, ERANGE},
{"-0x123456789abcdef01", 0xffffffffffffffff, 0, 0, ERANGE},
#endif
{NULL, 0, 0, 0, 0},
};
/* Prototypes for local functions. */
static void expand (char *dst, int c);
int
main (void)
{
register const struct ltest *lt;
char *ep;
int status = 0;
int save_errno;
for (lt = tests; lt->str != NULL; ++lt)
{
register long int l;
errno = 0;
l = strtol (lt->str, &ep, lt->base);
save_errno = errno;
printf ("strtol(\"%s\", , %d) test %u",
lt->str, lt->base, (unsigned int) (lt - tests));
if (l == (long int) lt->expect && *ep == lt->left
&& save_errno == lt->err)
puts("\tOK");
else
{
puts("\tBAD");
if (l != (long int) lt->expect)
printf(" returns %ld, expected %ld\n",
l, (long int) lt->expect);
if (lt->left != *ep)
{
char exp1[5], exp2[5];
expand (exp1, *ep);
expand (exp2, lt->left);
printf (" leaves '%s', expected '%s'\n", exp1, exp2);
}
if (save_errno != lt->err)
printf (" errno %d (%s) instead of %d (%s)\n",
save_errno, strerror (save_errno),
lt->err, strerror (lt->err));
status = 1;
}
}
for (++lt; lt->str != NULL; lt++)
{
register unsigned long int ul;
errno = 0;
ul = strtoul (lt->str, &ep, lt->base);
save_errno = errno;
printf ("strtoul(\"%s\", , %d) test %u",
lt->str, lt->base, (unsigned int) (lt - tests));
if (ul == lt->expect && *ep == lt->left && save_errno == lt->err)
puts("\tOK");
else
{
puts ("\tBAD");
if (ul != lt->expect)
printf (" returns %lu, expected %lu\n",
ul, lt->expect);
if (lt->left != *ep)
{
char exp1[5], exp2[5];
expand (exp1, *ep);
expand (exp2, lt->left);
printf (" leaves '%s', expected '%s'\n", exp1, exp2);
}
if (save_errno != lt->err)
printf (" errno %d (%s) instead of %d (%s)\n",
save_errno, strerror (save_errno),
lt->err, strerror (lt->err));
status = 1;
}
}
return status ? EXIT_FAILURE : EXIT_SUCCESS;
}
static void
expand (dst, c)
char *dst;
int c;
{
if (isprint (c))
{
dst[0] = c;
dst[1] = '\0';
}
else
(void) sprintf (dst, "%#.3o", (unsigned int) c);
}
|
GitWeb