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