2
3/*
4 * ++Copyright++ 1983, 1990, 1993
5 * -
6 * Copyright (c) 1983, 1990, 1993
7 * The Regents of the University of California. All rights reserved.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by the University of
20 * California, Berkeley and its contributors.
21 * 4. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * SUCH DAMAGE.
36 * -
37 * Portions Copyright (c) 1993 by Digital Equipment Corporation.
38 *
39 * Permission to use, copy, modify, and distribute this software for any
40 * purpose with or without fee is hereby granted, provided that the above
41 * copyright notice and this permission notice appear in all copies, and that
42 * the name of Digital Equipment Corporation not be used in advertising or
43 * publicity pertaining to distribution of the document or software without
44 * specific, written prior permission.
45 *
46 * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
47 * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
48 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT
49 * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
50 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
51 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
52 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
53 * SOFTWARE.
54 * -
55 * --Copyright--
56 */
57
58#if !defined(lint)
59static const char sccsid[] = "@(#)inet_addr.c 8.1 (Berkeley) 6/17/93";
60static const char rcsid[] = "@(#)$Id: inet_addr.c,v 1.8.2.3 2004/12/09 19:41:20 darrenr Exp $";
61#endif /* LIBC_SCCS and not lint */
62
63#include <sys/param.h>
64#include <netinet/in.h>
65#include <arpa/inet.h>
66#include <ctype.h>
67
68#ifndef __P
| 2
3/*
4 * ++Copyright++ 1983, 1990, 1993
5 * -
6 * Copyright (c) 1983, 1990, 1993
7 * The Regents of the University of California. All rights reserved.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by the University of
20 * California, Berkeley and its contributors.
21 * 4. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * SUCH DAMAGE.
36 * -
37 * Portions Copyright (c) 1993 by Digital Equipment Corporation.
38 *
39 * Permission to use, copy, modify, and distribute this software for any
40 * purpose with or without fee is hereby granted, provided that the above
41 * copyright notice and this permission notice appear in all copies, and that
42 * the name of Digital Equipment Corporation not be used in advertising or
43 * publicity pertaining to distribution of the document or software without
44 * specific, written prior permission.
45 *
46 * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
47 * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
48 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT
49 * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
50 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
51 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
52 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
53 * SOFTWARE.
54 * -
55 * --Copyright--
56 */
57
58#if !defined(lint)
59static const char sccsid[] = "@(#)inet_addr.c 8.1 (Berkeley) 6/17/93";
60static const char rcsid[] = "@(#)$Id: inet_addr.c,v 1.8.2.3 2004/12/09 19:41:20 darrenr Exp $";
61#endif /* LIBC_SCCS and not lint */
62
63#include <sys/param.h>
64#include <netinet/in.h>
65#include <arpa/inet.h>
66#include <ctype.h>
67
68#ifndef __P
|
74#endif
75int inet_aton __P((const char *, struct in_addr *));
76
77/*
78 * Because the ctype(3) posix definition, if used "safely" in code everywhere,
79 * would mean all normal code that walks through strings needed casts. Yuck.
80 */
81#define ISALNUM(x) isalnum((u_char)(x))
82#define ISALPHA(x) isalpha((u_char)(x))
83#define ISASCII(x) isascii((u_char)(x))
84#define ISDIGIT(x) isdigit((u_char)(x))
85#define ISPRINT(x) isprint((u_char)(x))
86#define ISSPACE(x) isspace((u_char)(x))
87#define ISUPPER(x) isupper((u_char)(x))
88#define ISXDIGIT(x) isxdigit((u_char)(x))
89#define ISLOWER(x) islower((u_char)(x))
90
91/*
92 * Check whether "cp" is a valid ascii representation
93 * of an Internet address and convert to a binary address.
94 * Returns 1 if the address is valid, 0 if not.
95 * This replaces inet_addr, the return value from which
96 * cannot distinguish between failure and a local broadcast address.
97 */
98int
99inet_aton(cp, addr)
100 register const char *cp;
101 struct in_addr *addr;
102{
103 register u_long val;
104 register int base, n;
105 register char c;
106 u_int parts[4];
107 register u_int *pp = parts;
108
109 c = *cp;
110 for (;;) {
111 /*
112 * Collect number up to ``.''.
113 * Values are specified as for C:
114 * 0x=hex, 0=octal, isdigit=decimal.
115 */
116 if (!ISDIGIT(c))
117 return (0);
118 val = 0; base = 10;
119 if (c == '0') {
120 c = *++cp;
121 if (c == 'x' || c == 'X')
122 base = 16, c = *++cp;
123 else
124 base = 8;
125 }
126 for (;;) {
127 if (ISASCII(c) && ISDIGIT(c)) {
128 val = (val * base) + (c - '0');
129 c = *++cp;
130 } else if (base == 16 && ISASCII(c) && ISXDIGIT(c)) {
131 val = (val << 4) |
132 (c + 10 - (ISLOWER(c) ? 'a' : 'A'));
133 c = *++cp;
134 } else
135 break;
136 }
137 if (c == '.') {
138 /*
139 * Internet format:
140 * a.b.c.d
141 * a.b.c (with c treated as 16 bits)
142 * a.b (with b treated as 24 bits)
143 */
144 if (pp >= parts + 3)
145 return (0);
146 *pp++ = val;
147 c = *++cp;
148 } else
149 break;
150 }
151 /*
152 * Check for trailing characters.
153 */
154 if (c != '\0' && (!ISASCII(c) || !ISSPACE(c)))
155 return (0);
156 /*
157 * Concoct the address according to
158 * the number of parts specified.
159 */
160 n = pp - parts + 1;
161 switch (n) {
162
163 case 0:
164 return (0); /* initial nondigit */
165
166 case 1: /* a -- 32 bits */
167 break;
168
169 case 2: /* a.b -- 8.24 bits */
170 if (val > 0xffffff)
171 return (0);
172 val |= parts[0] << 24;
173 break;
174
175 case 3: /* a.b.c -- 8.8.16 bits */
176 if (val > 0xffff)
177 return (0);
178 val |= (parts[0] << 24) | (parts[1] << 16);
179 break;
180
181 case 4: /* a.b.c.d -- 8.8.8.8 bits */
182 if (val > 0xff)
183 return (0);
184 val |= (parts[0] << 24) | (parts[1] << 16) | (parts[2] << 8);
185 break;
186 }
187 if (addr)
188 addr->s_addr = htonl(val);
189 return (1);
190}
191
192/* these are compatibility routines, not needed on recent BSD releases */
193
194/*
195 * Ascii internet address interpretation routine.
196 * The value returned is in network order.
197 */
198#if 0
199inet_addr(cp)
200 const char *cp;
201{
202 struct in_addr val;
203
204 if (inet_aton(cp, &val))
205 return (val.s_addr);
206 return (0xffffffff);
207}
208#endif
| 70#endif
71int inet_aton __P((const char *, struct in_addr *));
72
73/*
74 * Because the ctype(3) posix definition, if used "safely" in code everywhere,
75 * would mean all normal code that walks through strings needed casts. Yuck.
76 */
77#define ISALNUM(x) isalnum((u_char)(x))
78#define ISALPHA(x) isalpha((u_char)(x))
79#define ISASCII(x) isascii((u_char)(x))
80#define ISDIGIT(x) isdigit((u_char)(x))
81#define ISPRINT(x) isprint((u_char)(x))
82#define ISSPACE(x) isspace((u_char)(x))
83#define ISUPPER(x) isupper((u_char)(x))
84#define ISXDIGIT(x) isxdigit((u_char)(x))
85#define ISLOWER(x) islower((u_char)(x))
86
87/*
88 * Check whether "cp" is a valid ascii representation
89 * of an Internet address and convert to a binary address.
90 * Returns 1 if the address is valid, 0 if not.
91 * This replaces inet_addr, the return value from which
92 * cannot distinguish between failure and a local broadcast address.
93 */
94int
95inet_aton(cp, addr)
96 register const char *cp;
97 struct in_addr *addr;
98{
99 register u_long val;
100 register int base, n;
101 register char c;
102 u_int parts[4];
103 register u_int *pp = parts;
104
105 c = *cp;
106 for (;;) {
107 /*
108 * Collect number up to ``.''.
109 * Values are specified as for C:
110 * 0x=hex, 0=octal, isdigit=decimal.
111 */
112 if (!ISDIGIT(c))
113 return (0);
114 val = 0; base = 10;
115 if (c == '0') {
116 c = *++cp;
117 if (c == 'x' || c == 'X')
118 base = 16, c = *++cp;
119 else
120 base = 8;
121 }
122 for (;;) {
123 if (ISASCII(c) && ISDIGIT(c)) {
124 val = (val * base) + (c - '0');
125 c = *++cp;
126 } else if (base == 16 && ISASCII(c) && ISXDIGIT(c)) {
127 val = (val << 4) |
128 (c + 10 - (ISLOWER(c) ? 'a' : 'A'));
129 c = *++cp;
130 } else
131 break;
132 }
133 if (c == '.') {
134 /*
135 * Internet format:
136 * a.b.c.d
137 * a.b.c (with c treated as 16 bits)
138 * a.b (with b treated as 24 bits)
139 */
140 if (pp >= parts + 3)
141 return (0);
142 *pp++ = val;
143 c = *++cp;
144 } else
145 break;
146 }
147 /*
148 * Check for trailing characters.
149 */
150 if (c != '\0' && (!ISASCII(c) || !ISSPACE(c)))
151 return (0);
152 /*
153 * Concoct the address according to
154 * the number of parts specified.
155 */
156 n = pp - parts + 1;
157 switch (n) {
158
159 case 0:
160 return (0); /* initial nondigit */
161
162 case 1: /* a -- 32 bits */
163 break;
164
165 case 2: /* a.b -- 8.24 bits */
166 if (val > 0xffffff)
167 return (0);
168 val |= parts[0] << 24;
169 break;
170
171 case 3: /* a.b.c -- 8.8.16 bits */
172 if (val > 0xffff)
173 return (0);
174 val |= (parts[0] << 24) | (parts[1] << 16);
175 break;
176
177 case 4: /* a.b.c.d -- 8.8.8.8 bits */
178 if (val > 0xff)
179 return (0);
180 val |= (parts[0] << 24) | (parts[1] << 16) | (parts[2] << 8);
181 break;
182 }
183 if (addr)
184 addr->s_addr = htonl(val);
185 return (1);
186}
187
188/* these are compatibility routines, not needed on recent BSD releases */
189
190/*
191 * Ascii internet address interpretation routine.
192 * The value returned is in network order.
193 */
194#if 0
195inet_addr(cp)
196 const char *cp;
197{
198 struct in_addr val;
199
200 if (inet_aton(cp, &val))
201 return (val.s_addr);
202 return (0xffffffff);
203}
204#endif
|