xref: /minix/external/bsd/bind/dist/lib/lwres/lwinetaton.c (revision 00b67f09)
1*00b67f09SDavid van Moolenbroek /*	$NetBSD: lwinetaton.c,v 1.7 2014/12/10 04:38:02 christos Exp $	*/
2*00b67f09SDavid van Moolenbroek 
3*00b67f09SDavid van Moolenbroek /*
4*00b67f09SDavid van Moolenbroek  * Portions Copyright (C) 2004, 2005, 2007, 2012-2014  Internet Systems Consortium, Inc. ("ISC")
5*00b67f09SDavid van Moolenbroek  * Portions Copyright (C) 1996-2001, 2003  Internet Software Consortium.
6*00b67f09SDavid van Moolenbroek  *
7*00b67f09SDavid van Moolenbroek  * Permission to use, copy, modify, and/or distribute this software for any
8*00b67f09SDavid van Moolenbroek  * purpose with or without fee is hereby granted, provided that the above
9*00b67f09SDavid van Moolenbroek  * copyright notice and this permission notice appear in all copies.
10*00b67f09SDavid van Moolenbroek  *
11*00b67f09SDavid van Moolenbroek  * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES WITH
12*00b67f09SDavid van Moolenbroek  * REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
13*00b67f09SDavid van Moolenbroek  * AND FITNESS.  IN NO EVENT SHALL ISC BE LIABLE FOR ANY SPECIAL, DIRECT,
14*00b67f09SDavid van Moolenbroek  * INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
15*00b67f09SDavid van Moolenbroek  * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
16*00b67f09SDavid van Moolenbroek  * OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
17*00b67f09SDavid van Moolenbroek  * PERFORMANCE OF THIS SOFTWARE.
18*00b67f09SDavid van Moolenbroek  */
19*00b67f09SDavid van Moolenbroek 
20*00b67f09SDavid van Moolenbroek /*
21*00b67f09SDavid van Moolenbroek  * Copyright (c) 1983, 1990, 1993
22*00b67f09SDavid van Moolenbroek  *    The Regents of the University of California.  All rights reserved.
23*00b67f09SDavid van Moolenbroek  *
24*00b67f09SDavid van Moolenbroek  * Redistribution and use in source and binary forms, with or without
25*00b67f09SDavid van Moolenbroek  * modification, are permitted provided that the following conditions
26*00b67f09SDavid van Moolenbroek  * are met:
27*00b67f09SDavid van Moolenbroek  * 1. Redistributions of source code must retain the above copyright
28*00b67f09SDavid van Moolenbroek  *    notice, this list of conditions and the following disclaimer.
29*00b67f09SDavid van Moolenbroek  * 2. Redistributions in binary form must reproduce the above copyright
30*00b67f09SDavid van Moolenbroek  *    notice, this list of conditions and the following disclaimer in the
31*00b67f09SDavid van Moolenbroek  *    documentation and/or other materials provided with the distribution.
32*00b67f09SDavid van Moolenbroek  * 3. Neither the name of the University nor the names of its contributors
33*00b67f09SDavid van Moolenbroek  *    may be used to endorse or promote products derived from this software
34*00b67f09SDavid van Moolenbroek  *    without specific prior written permission.
35*00b67f09SDavid van Moolenbroek  *
36*00b67f09SDavid van Moolenbroek  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
37*00b67f09SDavid van Moolenbroek  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
38*00b67f09SDavid van Moolenbroek  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
39*00b67f09SDavid van Moolenbroek  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
40*00b67f09SDavid van Moolenbroek  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
41*00b67f09SDavid van Moolenbroek  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
42*00b67f09SDavid van Moolenbroek  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
43*00b67f09SDavid van Moolenbroek  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
44*00b67f09SDavid van Moolenbroek  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
45*00b67f09SDavid van Moolenbroek  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
46*00b67f09SDavid van Moolenbroek  * SUCH DAMAGE.
47*00b67f09SDavid van Moolenbroek  */
48*00b67f09SDavid van Moolenbroek 
49*00b67f09SDavid van Moolenbroek /*
50*00b67f09SDavid van Moolenbroek  * Portions Copyright (c) 1993 by Digital Equipment Corporation.
51*00b67f09SDavid van Moolenbroek  *
52*00b67f09SDavid van Moolenbroek  * Permission to use, copy, modify, and distribute this software for any
53*00b67f09SDavid van Moolenbroek  * purpose with or without fee is hereby granted, provided that the above
54*00b67f09SDavid van Moolenbroek  * copyright notice and this permission notice appear in all copies, and that
55*00b67f09SDavid van Moolenbroek  * the name of Digital Equipment Corporation not be used in advertising or
56*00b67f09SDavid van Moolenbroek  * publicity pertaining to distribution of the document or software without
57*00b67f09SDavid van Moolenbroek  * specific, written prior permission.
58*00b67f09SDavid van Moolenbroek  *
59*00b67f09SDavid van Moolenbroek  * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
60*00b67f09SDavid van Moolenbroek  * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
61*00b67f09SDavid van Moolenbroek  * OF MERCHANTABILITY AND FITNESS.   IN NO EVENT SHALL DIGITAL EQUIPMENT
62*00b67f09SDavid van Moolenbroek  * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
63*00b67f09SDavid van Moolenbroek  * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
64*00b67f09SDavid van Moolenbroek  * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
65*00b67f09SDavid van Moolenbroek  * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
66*00b67f09SDavid van Moolenbroek  * SOFTWARE.
67*00b67f09SDavid van Moolenbroek  */
68*00b67f09SDavid van Moolenbroek 
69*00b67f09SDavid van Moolenbroek /*! \file lwinetaton.c
70*00b67f09SDavid van Moolenbroek  */
71*00b67f09SDavid van Moolenbroek #if defined(LIBC_SCCS) && !defined(lint)
72*00b67f09SDavid van Moolenbroek static char sccsid[] = "@(#)inet_addr.c	8.1 (Berkeley) 6/17/93";
73*00b67f09SDavid van Moolenbroek static char rcsid[] = "Id: lwinetaton.c,v 1.16 2007/06/19 23:47:22 tbox Exp ";
74*00b67f09SDavid van Moolenbroek #endif /* LIBC_SCCS and not lint */
75*00b67f09SDavid van Moolenbroek 
76*00b67f09SDavid van Moolenbroek #include <config.h>
77*00b67f09SDavid van Moolenbroek 
78*00b67f09SDavid van Moolenbroek #include <ctype.h>
79*00b67f09SDavid van Moolenbroek 
80*00b67f09SDavid van Moolenbroek #include <stddef.h>
81*00b67f09SDavid van Moolenbroek 
82*00b67f09SDavid van Moolenbroek #include <lwres/int.h>
83*00b67f09SDavid van Moolenbroek #include <lwres/net.h>
84*00b67f09SDavid van Moolenbroek 
85*00b67f09SDavid van Moolenbroek #include "assert_p.h"
86*00b67f09SDavid van Moolenbroek 
87*00b67f09SDavid van Moolenbroek /*!
88*00b67f09SDavid van Moolenbroek  * Check whether "cp" is a valid ascii representation
89*00b67f09SDavid van Moolenbroek  * of an Internet address and convert to a binary address.
90*00b67f09SDavid van Moolenbroek  * Returns 1 if the address is valid, 0 if not.
91*00b67f09SDavid van Moolenbroek  * This replaces inet_addr, the return value from which
92*00b67f09SDavid van Moolenbroek  * cannot distinguish between failure and a local broadcast address.
93*00b67f09SDavid van Moolenbroek  */
94*00b67f09SDavid van Moolenbroek int
lwres_net_aton(const char * cp,struct in_addr * addr)95*00b67f09SDavid van Moolenbroek lwres_net_aton(const char *cp, struct in_addr *addr) {
96*00b67f09SDavid van Moolenbroek 	lwres_uint32_t val;
97*00b67f09SDavid van Moolenbroek 	int base;
98*00b67f09SDavid van Moolenbroek 	ptrdiff_t n;
99*00b67f09SDavid van Moolenbroek 	unsigned char c;
100*00b67f09SDavid van Moolenbroek 	lwres_uint8_t parts[4];
101*00b67f09SDavid van Moolenbroek 	lwres_uint8_t *pp = parts;
102*00b67f09SDavid van Moolenbroek 	int digit;
103*00b67f09SDavid van Moolenbroek 
104*00b67f09SDavid van Moolenbroek 	REQUIRE(cp != NULL);
105*00b67f09SDavid van Moolenbroek 
106*00b67f09SDavid van Moolenbroek 	c = *cp;
107*00b67f09SDavid van Moolenbroek 	for (;;) {
108*00b67f09SDavid van Moolenbroek 		/*
109*00b67f09SDavid van Moolenbroek 		 * Collect number up to ``.''.
110*00b67f09SDavid van Moolenbroek 		 * Values are specified as for C:
111*00b67f09SDavid van Moolenbroek 		 * 0x=hex, 0=octal, isdigit=decimal.
112*00b67f09SDavid van Moolenbroek 		 */
113*00b67f09SDavid van Moolenbroek 		if (!isdigit(c & 0xff))
114*00b67f09SDavid van Moolenbroek 			return (0);
115*00b67f09SDavid van Moolenbroek 		val = 0;
116*00b67f09SDavid van Moolenbroek 		base = 10;
117*00b67f09SDavid van Moolenbroek 		digit = 0;
118*00b67f09SDavid van Moolenbroek 		if (c == '0') {
119*00b67f09SDavid van Moolenbroek 			c = *++cp;
120*00b67f09SDavid van Moolenbroek 			if (c == 'x' || c == 'X') {
121*00b67f09SDavid van Moolenbroek 				base = 16;
122*00b67f09SDavid van Moolenbroek 				c = *++cp;
123*00b67f09SDavid van Moolenbroek 			} else {
124*00b67f09SDavid van Moolenbroek 				base = 8;
125*00b67f09SDavid van Moolenbroek 				digit = 1;
126*00b67f09SDavid van Moolenbroek 			}
127*00b67f09SDavid van Moolenbroek 		}
128*00b67f09SDavid van Moolenbroek 		for (;;) {
129*00b67f09SDavid van Moolenbroek 			/*
130*00b67f09SDavid van Moolenbroek 			 * isascii() is valid for all integer values, and
131*00b67f09SDavid van Moolenbroek 			 * when it is true, c is known to be in scope
132*00b67f09SDavid van Moolenbroek 			 * for isdigit().  No cast necessary.  Similar
133*00b67f09SDavid van Moolenbroek 			 * comment applies for later ctype uses.
134*00b67f09SDavid van Moolenbroek 			 */
135*00b67f09SDavid van Moolenbroek 			if (isascii(c) && isdigit(c)) {
136*00b67f09SDavid van Moolenbroek 				if (base == 8 && (c == '8' || c == '9'))
137*00b67f09SDavid van Moolenbroek 					return (0);
138*00b67f09SDavid van Moolenbroek 				val = (val * base) + (c - '0');
139*00b67f09SDavid van Moolenbroek 				c = *++cp;
140*00b67f09SDavid van Moolenbroek 				digit = 1;
141*00b67f09SDavid van Moolenbroek 			} else if (base == 16 && isascii(c) && isxdigit(c)) {
142*00b67f09SDavid van Moolenbroek 				val = (val << 4) |
143*00b67f09SDavid van Moolenbroek 					(c + 10 - (islower(c) ? 'a' : 'A'));
144*00b67f09SDavid van Moolenbroek 				c = *++cp;
145*00b67f09SDavid van Moolenbroek 				digit = 1;
146*00b67f09SDavid van Moolenbroek 			} else
147*00b67f09SDavid van Moolenbroek 				break;
148*00b67f09SDavid van Moolenbroek 		}
149*00b67f09SDavid van Moolenbroek 		if (c == '.') {
150*00b67f09SDavid van Moolenbroek 			/*
151*00b67f09SDavid van Moolenbroek 			 * Internet format:
152*00b67f09SDavid van Moolenbroek 			 *	a.b.c.d
153*00b67f09SDavid van Moolenbroek 			 *	a.b.c	(with c treated as 16 bits)
154*00b67f09SDavid van Moolenbroek 			 *	a.b	(with b treated as 24 bits)
155*00b67f09SDavid van Moolenbroek 			 */
156*00b67f09SDavid van Moolenbroek 			if (pp >= parts + 3 || val > 0xffU)
157*00b67f09SDavid van Moolenbroek 				return (0);
158*00b67f09SDavid van Moolenbroek 			*pp++ = (lwres_uint8_t)val;
159*00b67f09SDavid van Moolenbroek 			c = *++cp;
160*00b67f09SDavid van Moolenbroek 		} else
161*00b67f09SDavid van Moolenbroek 			break;
162*00b67f09SDavid van Moolenbroek 	}
163*00b67f09SDavid van Moolenbroek 	/*
164*00b67f09SDavid van Moolenbroek 	 * Check for trailing characters.
165*00b67f09SDavid van Moolenbroek 	 */
166*00b67f09SDavid van Moolenbroek 	if (c != '\0' && (!isascii(c) || !isspace(c)))
167*00b67f09SDavid van Moolenbroek 		return (0);
168*00b67f09SDavid van Moolenbroek 	/*
169*00b67f09SDavid van Moolenbroek 	 * Did we get a valid digit?
170*00b67f09SDavid van Moolenbroek 	 */
171*00b67f09SDavid van Moolenbroek 	if (!digit)
172*00b67f09SDavid van Moolenbroek 		return (0);
173*00b67f09SDavid van Moolenbroek 	/*
174*00b67f09SDavid van Moolenbroek 	 * Concoct the address according to
175*00b67f09SDavid van Moolenbroek 	 * the number of parts specified.
176*00b67f09SDavid van Moolenbroek 	 */
177*00b67f09SDavid van Moolenbroek 	n = pp - parts + 1;
178*00b67f09SDavid van Moolenbroek 	switch (n) {
179*00b67f09SDavid van Moolenbroek 	case 1:				/* a -- 32 bits */
180*00b67f09SDavid van Moolenbroek 		break;
181*00b67f09SDavid van Moolenbroek 
182*00b67f09SDavid van Moolenbroek 	case 2:				/* a.b -- 8.24 bits */
183*00b67f09SDavid van Moolenbroek 		if (val > 0xffffffU)
184*00b67f09SDavid van Moolenbroek 			return (0);
185*00b67f09SDavid van Moolenbroek 		val |= parts[0] << 24;
186*00b67f09SDavid van Moolenbroek 		break;
187*00b67f09SDavid van Moolenbroek 
188*00b67f09SDavid van Moolenbroek 	case 3:				/* a.b.c -- 8.8.16 bits */
189*00b67f09SDavid van Moolenbroek 		if (val > 0xffffU)
190*00b67f09SDavid van Moolenbroek 			return (0);
191*00b67f09SDavid van Moolenbroek 		val |= (parts[0] << 24) | (parts[1] << 16);
192*00b67f09SDavid van Moolenbroek 		break;
193*00b67f09SDavid van Moolenbroek 
194*00b67f09SDavid van Moolenbroek 	case 4:				/* a.b.c.d -- 8.8.8.8 bits */
195*00b67f09SDavid van Moolenbroek 		if (val > 0xffU)
196*00b67f09SDavid van Moolenbroek 			return (0);
197*00b67f09SDavid van Moolenbroek 		val |= (parts[0] << 24) | (parts[1] << 16) | (parts[2] << 8);
198*00b67f09SDavid van Moolenbroek 		break;
199*00b67f09SDavid van Moolenbroek 	}
200*00b67f09SDavid van Moolenbroek 	if (addr != NULL)
201*00b67f09SDavid van Moolenbroek 		addr->s_addr = htonl(val);
202*00b67f09SDavid van Moolenbroek 
203*00b67f09SDavid van Moolenbroek 	return (1);
204*00b67f09SDavid van Moolenbroek }
205