BSD 4_3_Net_2 release
[unix-history] / usr / src / lib / libc / net / inet_addr.c
CommitLineData
bb0cfa24 1/*
177ad8dd 2 * Copyright (c) 1983, 1990 Regents of the University of California.
140b4f5f
KB
3 * All rights reserved.
4 *
af359dea
C
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
bb0cfa24
DF
32 */
33
2ce81398 34#if defined(LIBC_SCCS) && !defined(lint)
af359dea 35static char sccsid[] = "@(#)inet_addr.c 5.10 (Berkeley) 2/24/91";
140b4f5f 36#endif /* LIBC_SCCS and not lint */
5e649950 37
24fac7d8 38#include <sys/param.h>
056d5bbd 39#include <netinet/in.h>
24fac7d8 40#include <arpa/inet.h>
dcdb79c9 41#include <ctype.h>
5e649950 42
ff79189c 43/*
177ad8dd 44 * Ascii internet address interpretation routine.
d6c70669 45 * The value returned is in network order.
ff79189c 46 */
b2053919 47u_long
ff79189c 48inet_addr(cp)
24fac7d8 49 register const char *cp;
177ad8dd
MK
50{
51 struct in_addr val;
52
53 if (inet_aton(cp, &val))
54 return (val.s_addr);
55 return (INADDR_NONE);
56}
57
58/*
59 * Check whether "cp" is a valid ascii representation
60 * of an Internet address and convert to a binary address.
61 * Returns 1 if the address is valid, 0 if not.
62 * This replaces inet_addr, the return value from which
63 * cannot distinguish between failure and a local broadcast address.
64 */
65
66inet_aton(cp, addr)
67 register char *cp;
68 struct in_addr *addr;
ff79189c 69{
d6c70669 70 register u_long val, base, n;
ff79189c 71 register char c;
d6c70669 72 u_long parts[4], *pp = parts;
ff79189c 73
177ad8dd 74 for (;;) {
ff79189c 75 /*
177ad8dd
MK
76 * Collect number up to ``.''.
77 * Values are specified as for C:
78 * 0x=hex, 0=octal, other=decimal.
ff79189c 79 */
177ad8dd
MK
80 val = 0; base = 10;
81 if (*cp == '0') {
82 if (*++cp == 'x' || *cp == 'X')
83 base = 16, cp++;
84 else
85 base = 8;
86 }
87 while ((c = *cp) != '\0') {
88 if (isascii(c) && isdigit(c)) {
89 val = (val * base) + (c - '0');
90 cp++;
91 continue;
92 }
93 if (base == 16 && isascii(c) && isxdigit(c)) {
94 val = (val << 4) +
95 (c + 10 - (islower(c) ? 'a' : 'A'));
96 cp++;
97 continue;
98 }
99 break;
100 }
101 if (*cp == '.') {
102 /*
103 * Internet format:
104 * a.b.c.d
105 * a.b.c (with c treated as 16-bits)
106 * a.b (with b treated as 24 bits)
107 */
108 if (pp >= parts + 3 || val > 0xff)
109 return (0);
110 *pp++ = val, cp++;
111 } else
112 break;
ff79189c 113 }
d6c70669
SL
114 /*
115 * Check for trailing characters.
116 */
177ad8dd
MK
117 if (*cp && (!isascii(*cp) || !isspace(*cp)))
118 return (0);
d6c70669
SL
119 /*
120 * Concoct the address according to
121 * the number of parts specified.
122 */
177ad8dd 123 n = pp - parts + 1;
d6c70669
SL
124 switch (n) {
125
126 case 1: /* a -- 32 bits */
d6c70669
SL
127 break;
128
129 case 2: /* a.b -- 8.24 bits */
177ad8dd
MK
130 if (val > 0xffffff)
131 return (0);
132 val |= parts[0] << 24;
d6c70669
SL
133 break;
134
135 case 3: /* a.b.c -- 8.8.16 bits */
177ad8dd
MK
136 if (val > 0xffff)
137 return (0);
138 val |= (parts[0] << 24) | (parts[1] << 16);
d6c70669
SL
139 break;
140
141 case 4: /* a.b.c.d -- 8.8.8.8 bits */
177ad8dd
MK
142 if (val > 0xff)
143 return (0);
144 val |= (parts[0] << 24) | (parts[1] << 16) | (parts[2] << 8);
d6c70669 145 break;
ff79189c 146 }
177ad8dd
MK
147 if (addr)
148 addr->s_addr = htonl(val);
149 return (1);
ff79189c 150}