1 /*        $NetBSD: inet_addr.c,v 1.4 2018/07/26 00:20:41 kamil Exp $  */
2 
3 /*
4  * Copyright (c) 1983, 1990, 1993
5  *    The Regents of the University of California.  All rights reserved.
6  *
7  * Redistribution and use in source and binary forms, with or without
8  * modification, are permitted provided that the following conditions
9  * are met:
10  * 1. Redistributions of source code must retain the above copyright
11  *    notice, this list of conditions and the following disclaimer.
12  * 2. Redistributions in binary form must reproduce the above copyright
13  *    notice, this list of conditions and the following disclaimer in the
14  *    documentation and/or other materials provided with the distribution.
15  * 3. All advertising materials mentioning features or use of this software
16  *    must display the following acknowledgement:
17  *        This product includes software developed by the University of
18  *        California, Berkeley and its contributors.
19  * 4. Neither the name of the University nor the names of its contributors
20  *    may be used to endorse or promote products derived from this software
21  *    without specific prior written permission.
22  *
23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33  * SUCH DAMAGE.
34  */
35 
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 
56 /*
57  * Copyright (c) 2004 by Internet Systems Consortium, Inc. ("ISC")
58  * Portions Copyright (c) 1996-1999 by Internet Software Consortium.
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.
63  *
64  * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES
65  * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
66  * MERCHANTABILITY AND FITNESS.  IN NO EVENT SHALL ISC BE LIABLE FOR
67  * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
68  * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
69  * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
70  * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
71  */
72 
73 #if !defined(_KERNEL) && !defined(_STANDALONE)
74 #include <sys/cdefs.h>
75 #if defined(LIBC_SCCS) && !defined(lint)
76 #if 0
77 static const char sccsid[] = "@(#)inet_addr.c     8.1 (Berkeley) 6/17/93";
78 static const char rcsid[] = "Id: inet_addr.c,v 1.2.206.2 2004/03/17 00:29:45 marka Exp";
79 #else
80 __RCSID("$NetBSD: inet_addr.c,v 1.4 2018/07/26 00:20:41 kamil Exp $");
81 #endif
82 #endif /* LIBC_SCCS and not lint */
83 
84 #include "port_before.h"
85 
86 #include "namespace.h"
87 #include <sys/types.h>
88 #include <sys/param.h>
89 
90 #include <netinet/in.h>
91 #include <arpa/inet.h>
92 
93 #include <ctype.h>
94 
95 #include "port_after.h"
96 
97 #ifdef __weak_alias
__weak_alias(inet_aton,_inet_aton)98 __weak_alias(inet_aton,_inet_aton)
99 #endif
100 #else
101 #include <lib/libkern/libkern.h>
102 #include <netinet/in.h>
103 #endif
104 
105 /*
106  * Ascii internet address interpretation routine.
107  * The value returned is in network order.
108  */
109 uint32_t
110 inet_addr(const char *cp) {
111           struct in_addr val;
112 
113           if (inet_aton(cp, &val))
114                     return (val.s_addr);
115           return (INADDR_NONE);
116 }
117 
118 /*
119  * Check whether "cp" is a valid ascii representation
120  * of an Internet address and convert to a binary address.
121  * Returns 1 if the address is valid, 0 if not.
122  * This replaces inet_addr, the return value from which
123  * cannot distinguish between failure and a local broadcast address.
124  */
125 int
inet_aton(const char * cp,struct in_addr * addr)126 inet_aton(const char *cp, struct in_addr *addr) {
127           uint32_t val;
128           int base;
129           size_t n;
130           char c;
131           uint8_t parts[4];
132           uint8_t *pp = parts;
133           int digit;
134 
135           c = *cp;
136           for (;;) {
137                     /*
138                      * Collect number up to ``.''.
139                      * Values are specified as for C:
140                      * 0x=hex, 0=octal, isdigit=decimal.
141                      */
142                     if (!isdigit((unsigned char)c))
143                               return (0);
144                     val = 0; base = 10; digit = 0;
145                     if (c == '0') {
146                               c = *++cp;
147                               if (c == 'x' || c == 'X')
148                                         base = 16, c = *++cp;
149                               else {
150                                         base = 8;
151                                         digit = 1 ;
152                               }
153                     }
154                     for (;;) {
155                               if (isascii(c) && isdigit((unsigned char)c)) {
156                                         if (base == 8 && (c == '8' || c == '9'))
157                                                   return (0);
158                                         val = (val * base) + (c - '0');
159                                         c = *++cp;
160                                         digit = 1;
161                               } else if (base == 16 && isascii(c) &&
162                                            isxdigit((unsigned char)c)) {
163                                         val = (val << 4) |
164                                                   (c + 10 - (islower((unsigned char)c) ? 'a' : 'A'));
165                                         c = *++cp;
166                                         digit = 1;
167                               } else
168                                         break;
169                     }
170                     if (c == '.') {
171                               /*
172                                * Internet format:
173                                *        a.b.c.d
174                                *        a.b.c     (with c treated as 16 bits)
175                                *        a.b       (with b treated as 24 bits)
176                                */
177                               if (pp >= parts + 3 || val > 0xffU)
178                                         return (0);
179                               *pp++ = val;
180                               c = *++cp;
181                     } else
182                               break;
183           }
184           /*
185            * Check for trailing characters.
186            */
187           if (c != '\0' && (!isascii(c) || !isspace((unsigned char)c)))
188                     return (0);
189           /*
190            * Did we get a valid digit?
191            */
192           if (!digit)
193                     return (0);
194           /*
195            * Concoct the address according to
196            * the number of parts specified.
197            */
198           n = pp - parts + 1;
199           switch (n) {
200           case 1:                                 /* a -- 32 bits */
201                     break;
202 
203           case 2:                                 /* a.b -- 8.24 bits */
204                     if (val > 0xffffffU)
205                               return (0);
206                     val |= (uint32_t)parts[0] << 24;
207                     break;
208 
209           case 3:                                 /* a.b.c -- 8.8.16 bits */
210                     if (val > 0xffffU)
211                               return (0);
212                     val |= ((uint32_t)parts[0] << 24) | (parts[1] << 16);
213                     break;
214 
215           case 4:                                 /* a.b.c.d -- 8.8.8.8 bits */
216                     if (val > 0xffU)
217                               return (0);
218                     val |= ((uint32_t)parts[0] << 24) | (parts[1] << 16) |
219                             (parts[2] << 8);
220                     break;
221           }
222           if (addr != NULL)
223                     addr->s_addr = htonl(val);
224           return (1);
225 }
226