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
|
/*
* cook - file construction tool
* Copyright (C) 1997, 1999 Peter Miller;
* All rights reserved.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
*
* MANIFEST: implement missing functions from <stdlib.h>
*/
#include <ac/stdlib.h>
#include <ac/errno.h>
#ifndef HAVE_MBLEN
/* either mblen not available, or it is broken */
#undef mblen
int
mblen(s, n)
const char *s;
size_t n;
{
return (s && *s);
}
#undef mbtowc
int
mbtowc(pwc, s, n)
wchar_t *pwc;
const char *s;
size_t n;
{
if (!s)
return 0;
if (pwc)
*pwc = *(unsigned char *)s;
return (*s != 0);
}
#undef wctomb
int
wctomb(s, wc)
char *s;
wchar_t wc;
{
if (!s)
return 0;
*s = wc;
return 1;
}
#endif /* !HAVE_MBLEN */
#ifndef HAVE_STRTOL
long
strtol(nptr, endptr, base)
const char *nptr;
char **endptr;
int base;
{
const char *s;
int neg;
long n, n2;
int ndigits;
int c;
/*
* This is not an ANSI C conforming implementation.
* Don't use it if you have a choice.
*/
neg = 0;
s = nptr;
for (;;)
{
c = (unsigned char)*s++;
if (!isspace(c))
break;
}
if (c == '-')
{
neg = 1;
c = (unsigned char)*s++;
}
else if (c == '+')
c = (unsigned char)*s++;
if ((base == 0 || base == 16) && c == '0' && (*s == 'x' || *s == 'X'))
{
++s;
c = (unsigned char)*s++;
base = 16;
}
if (base == 0)
base = (c == '0' ? 8 : 10);
n = 0;
ndigits = 0;
for (;;)
{
if (isdigit(c))
c -= '0';
else if (isupper(c))
c -= 'A' - 10;
else if (islower(c))
c += 'a' - 10;
else
break;
if (c >= base)
break;
n2 = n * base + c;
if (n2 < n)
{
/*
* This is a hack. A real C library will provide
* a much better function than this.
* E.g. take a look at P.J.Plaugher's book.
*/
n = 0;
errno = ERANGE;
break;
}
n = n2;
++ndigits;
c = (unsigned char)*s++;
}
if (endptr)
*endptr = (char *)(ndigits ? s - 1 : nptr);
return (neg ? -n : n);
}
#endif /* !HAVE_STRTOL */
|