xref: /illumos-gate/usr/src/lib/libresolv2/common/inet/inet_network.c (revision 628e3cbed6489fa1db545d8524a06cd6535af456)
1 /*
2  * Copyright 1997-2003 Sun Microsystems, Inc.  All rights reserved.
3  * Use is subject to license terms.
4  */
5 
6 /*
7  * Copyright (c) 1983, 1993
8  *	The Regents of the University of California.  All rights reserved.
9  *
10  * Redistribution and use in source and binary forms, with or without
11  * modification, are permitted provided that the following conditions
12  * are met:
13  * 1. Redistributions of source code must retain the above copyright
14  *    notice, this list of conditions and the following disclaimer.
15  * 2. Redistributions in binary form must reproduce the above copyright
16  *    notice, this list of conditions and the following disclaimer in the
17  *    documentation and/or other materials provided with the distribution.
18  * 3. All advertising materials mentioning features or use of this software
19  *    must display the following acknowledgement:
20  *	This product includes software developed by the University of
21  *	California, Berkeley and its contributors.
22  * 4. Neither the name of the University nor the names of its contributors
23  *    may be used to endorse or promote products derived from this software
24  *    without specific prior written permission.
25  *
26  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36  * SUCH DAMAGE.
37  */
38 
39 #pragma ident	"%Z%%M%	%I%	%E% SMI"
40 
41 #if defined(LIBC_SCCS) && !defined(lint)
42 static const char sccsid[] = "@(#)inet_network.c	8.1 (Berkeley) 6/4/93";
43 #endif /* LIBC_SCCS and not lint */
44 
45 #include "port_before.h"
46 
47 #include <sys/types.h>
48 #include <netinet/in.h>
49 #include <arpa/inet.h>
50 #include <ctype.h>
51 
52 #include "port_after.h"
53 
54 /*
55  * Internet network address interpretation routine.
56  * The library routines call this routine to interpret
57  * network numbers.
58  */
59 #ifdef	ORIGINAL_ISC_CODE
60 u_long
61 #else
62 in_addr_t
63 #endif
64 inet_network(cp)
65 	register const char *cp;
66 {
67 #ifdef	ORIGINAL_ISC_CODE
68 	register u_long val, base, n, i;
69 #else
70 	register in_addr_t val, base, n, i;
71 #endif
72 	register char c;
73 #ifdef	ORIGINAL_ISC_CODE
74 	u_long parts[4], *pp = parts;
75 #else
76 	in_addr_t parts[4], *pp = parts;
77 #endif
78 	int digit;
79 
80 again:
81 	val = 0; base = 10; digit = 0;
82 	if (*cp == '0')
83 		digit = 1, base = 8, cp++;
84 	if (*cp == 'x' || *cp == 'X')
85 		base = 16, cp++;
86 	while ((c = *cp) != 0) {
87 		if (isdigit((unsigned char)c)) {
88 			if (base == 8 && (c == '8' || c == '9'))
89 				return (INADDR_NONE);
90 			val = (val * base) + (c - '0');
91 			cp++;
92 			digit = 1;
93 			continue;
94 		}
95 		if (base == 16 && isxdigit((unsigned char)c)) {
96 			val = (val << 4) +
97 			(c + 10 - (islower((unsigned char)c) ? 'a' : 'A'));
98 			cp++;
99 			digit = 1;
100 			continue;
101 		}
102 		break;
103 	}
104 	if (!digit)
105 		return (INADDR_NONE);
106 #ifdef ORIGINAL_ISC_CODE
107 	if (*cp == '.') {
108 		if (pp >= parts + 4 || val > 0xff)
109 			return (INADDR_NONE);
110 #else
111 	if (pp >= parts + 4 || val > 0xff)
112 		return (INADDR_NONE);
113 	if (*cp == '.') {
114 #endif
115 		*pp++ = val, cp++;
116 		goto again;
117 	}
118 	if (*cp && !isspace(*cp&0xff))
119 		return (INADDR_NONE);
120 	*pp++ = val;
121 	n = pp - parts;
122 	if (n > 4)
123 		return (INADDR_NONE);
124 	for (val = 0, i = 0; i < n; i++) {
125 		val <<= 8;
126 		val |= parts[i] & 0xff;
127 	}
128 	return (val);
129 }
130