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