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
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
|
/*
inet_pton.c -- convert IPv4 and IPv6 addresses from text to binary form
Modifications to inet_pton6 allowing IPv4 addresses to appear
throughout, and miscellaneous modifications to inet_pton4, by Tom
Harrison <tomhrr@cpan.org> (Copyright (C) 2010).
Copyright (C) 2006 Free Software Foundation, Inc.
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, 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
Copyright (c) 1996,1999 by Internet Software Consortium.
Permission to use, copy, modify, and distribute this software for any
purpose with or without fee is hereby granted, provided that the above
copyright notice and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
SOFTWARE.
*/
#include <ctype.h>
#include <string.h>
#include <errno.h>
#define NS_INADDRSZ 4
#define NS_IN6ADDRSZ 16
#define NS_INT16SZ 2
int inet_pton4 (const char *src, unsigned char *dst);
int inet_pton6 (const char *src, unsigned char *dst);
/* int
* inet_pton4(src, dst)
* like inet_aton() but without all the hexadecimal, octal (with the
* exception of 0) and shorthand.
* return:
* 1 if `src' is a valid dotted quad, else 0.
* notice:
* does not touch `dst' unless it's returning 1.
* author:
* Paul Vixie, 1996.
* (Some modifications by Tom Harrison, 2010.)
*/
int
inet_pton4 (const char *src, unsigned char *dst)
{
int saw_digit, octets, ch;
unsigned char tmp[NS_INADDRSZ], *tp;
memset(tmp, 0, NS_INADDRSZ);
saw_digit = 0;
octets = 0;
*(tp = tmp) = 0;
while ((ch = *src++) != '\0') {
if (ch >= '0' && ch <= '9') {
unsigned n = *tp * 10 + (ch - '0');
if (saw_digit && *tp == 0) {
return 0;
}
if (n > 255) {
return 0;
}
*tp = n;
if (!saw_digit) {
++octets;
saw_digit = 1;
}
} else if (ch == '.' && saw_digit) {
if (octets == 4) {
return 0;
}
++tp;
saw_digit = 0;
} else {
return 0;
}
}
memcpy(dst, tmp, NS_INADDRSZ);
return 1;
}
/* int
* inet_pton6(src, dst)
* convert presentation level address to network order binary form.
* return:
* 1 if `src' is a valid IPv6 address (may contain IPv4 addresses
* in any position), else 0.
* notice:
* (1) does not touch `dst' unless it's returning 1.
* (2) :: in a full address is silently ignored.
* credit:
* inspired by Mark Andrews.
* author:
* Paul Vixie, 1996.
* (Modifications allowing IPv4 addresses to appear throughout
* by Tom Harrison, 2010.)
*/
int
inet_pton6 (const char *src, unsigned char *dst)
{
static const char xdigits[] = "0123456789abcdef";
unsigned char tmp[NS_IN6ADDRSZ], *tp, *endp, *colonp;
const char *ipv4_endp;
char ipv4[16];
int diff;
const char *curtok;
int ch, saw_xdigit;
unsigned val;
tp = (unsigned char *) memset (tmp, '\0', NS_IN6ADDRSZ);
endp = tp + NS_IN6ADDRSZ;
colonp = NULL;
/* Leading :: requires some special handling. */
if (*src == ':') {
if (*++src != ':') {
return 0;
}
}
curtok = src;
saw_xdigit = 0;
val = 0;
while ((ch = tolower (*src++)) != '\0') {
const char *pch;
pch = strchr (xdigits, ch);
if (pch != NULL) {
val <<= 4;
val |= (pch - xdigits);
if (val > 0xffff) {
return 0;
}
saw_xdigit = 1;
continue;
}
if (ch == ':') {
curtok = src;
if (!saw_xdigit) {
if (colonp) {
return 0;
}
colonp = tp;
continue;
} else if (*src == '\0') {
return 0;
}
if (tp + NS_INT16SZ > endp) {
return 0;
}
*tp++ = (unsigned char) (val >> 8) & 0xff;
*tp++ = (unsigned char) val & 0xff;
saw_xdigit = 0;
val = 0;
continue;
}
if (ch == '.' && ((tp + NS_INADDRSZ) <= endp)) {
/* Find the next : from curtok, copy from curtok to that
* point to ipv4, if it's IPv4 all is good. If the : is not found,
* it terminates, so check it directly. */
ipv4_endp = strchr(curtok, ':');
if (ipv4_endp) {
diff = ipv4_endp - curtok;
if (diff > 15) {
return 0;
}
memcpy(ipv4, curtok, diff);
ipv4[diff] = '\0';
diff = inet_pton4(ipv4, tp);
} else {
diff = inet_pton4(curtok, tp);
}
if (diff) {
val = (tp[2] << 8) | tp[3];
tp += 2;
saw_xdigit=1;
if (ipv4_endp) {
src = ipv4_endp;
continue;
} else {
saw_xdigit=0;
tp += 2;
break;
}
}
}
return 0;
}
if (saw_xdigit) {
if (tp + NS_INT16SZ > endp) {
return 0;
}
*tp++ = (unsigned char) (val >> 8) & 0xff;
*tp++ = (unsigned char) val & 0xff;
}
if (colonp != NULL) {
/*
* Since some memmove()'s erroneously fail to handle
* overlapping regions, we'll do the shift by hand.
*/
const int n = tp - colonp;
int i;
if (tp == endp) {
return 0;
}
for (i = 1; i <= n; i++) {
endp[-i] = colonp[n - i];
colonp[n - i] = 0;
}
tp = endp;
}
while (tp < endp) {
*(tp++) = 0;
}
memcpy(dst, tmp, NS_IN6ADDRSZ);
return 1;
}
|
