2 * Copyright (c) 1983, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 #if defined(LIBC_SCCS) && !defined(lint)
31 static char sccsid[] = "@(#)inet_network.c 8.1 (Berkeley) 6/4/93";
32 #endif /* LIBC_SCCS and not lint */
34 #include <sys/types.h>
35 #include <netinet/in.h>
36 #include <arpa/inet.h>
40 * Internet network address interpretation routine.
41 * The library routines call this routine to interpret
46 register const char *cp;
48 register u_int32_t val, base, n, i;
50 u_int32_t parts[4], *pp = parts;
54 val = 0; base = 10; digit = 0;
56 digit = 1, base = 8, cp++;
57 if (*cp == 'x' || *cp == 'X')
58 digit = 0, base = 16, cp++;
59 while ((c = *cp) != 0) {
61 if (base == 8 && (c == '8' || c == '9'))
63 val = (val * base) + (c - '0');
68 if (base == 16 && isxdigit(c)) {
69 val = (val << 4) + (tolower (c) + 10 - 'a');
78 if (pp >= parts + 4 || val > 0xff)
84 if (*cp && !isspace(*cp))
86 if (pp >= parts + 4 || val > 0xff)
90 for (val = 0, i = 0; i < n; i++) {
92 val |= parts[i] & 0xff;