summaryrefslogtreecommitdiff
path: root/src/lib/libc/net/inet_network.c
diff options
context:
space:
mode:
authorderaadt <>1995-10-18 08:42:23 +0000
committerderaadt <>1995-10-18 08:42:23 +0000
commit0527d29da443886d92e9a418180c5b25a5f8d270 (patch)
tree86b3a64928451a669cefa27900e5884036b4e349 /src/lib/libc/net/inet_network.c
downloadopenbsd-0527d29da443886d92e9a418180c5b25a5f8d270.tar.gz
openbsd-0527d29da443886d92e9a418180c5b25a5f8d270.tar.bz2
openbsd-0527d29da443886d92e9a418180c5b25a5f8d270.zip
initial import of NetBSD tree
Diffstat (limited to 'src/lib/libc/net/inet_network.c')
-rw-r--r--src/lib/libc/net/inet_network.c99
1 files changed, 99 insertions, 0 deletions
diff --git a/src/lib/libc/net/inet_network.c b/src/lib/libc/net/inet_network.c
new file mode 100644
index 0000000000..35105fa75a
--- /dev/null
+++ b/src/lib/libc/net/inet_network.c
@@ -0,0 +1,99 @@
1/* $NetBSD: inet_network.c,v 1.4 1995/02/25 06:20:45 cgd Exp $ */
2
3/*
4 * Copyright (c) 1983, 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#if defined(LIBC_SCCS) && !defined(lint)
37#if 0
38static char sccsid[] = "@(#)inet_network.c 8.1 (Berkeley) 6/4/93";
39#else
40static char rcsid[] = "$NetBSD: inet_network.c,v 1.4 1995/02/25 06:20:45 cgd Exp $";
41#endif
42#endif /* LIBC_SCCS and not lint */
43
44#include <sys/types.h>
45#include <netinet/in.h>
46#include <arpa/inet.h>
47#include <ctype.h>
48
49/*
50 * Internet network address interpretation routine.
51 * The library routines call this routine to interpret
52 * network numbers.
53 */
54u_long
55inet_network(cp)
56 register const char *cp;
57{
58 register u_long val, base, n;
59 register char c;
60 u_long parts[4], *pp = parts;
61 register int i;
62
63again:
64 val = 0; base = 10;
65 if (*cp == '0')
66 base = 8, cp++;
67 if (*cp == 'x' || *cp == 'X')
68 base = 16, cp++;
69 while (c = *cp) {
70 if (isdigit(c)) {
71 val = (val * base) + (c - '0');
72 cp++;
73 continue;
74 }
75 if (base == 16 && isxdigit(c)) {
76 val = (val << 4) + (c + 10 - (islower(c) ? 'a' : 'A'));
77 cp++;
78 continue;
79 }
80 break;
81 }
82 if (*cp == '.') {
83 if (pp >= parts + 4)
84 return (INADDR_NONE);
85 *pp++ = val, cp++;
86 goto again;
87 }
88 if (*cp && !isspace(*cp))
89 return (INADDR_NONE);
90 *pp++ = val;
91 n = pp - parts;
92 if (n > 4)
93 return (INADDR_NONE);
94 for (val = 0, i = 0; i < n; i++) {
95 val <<= 8;
96 val |= parts[i] & 0xff;
97 }
98 return (val);
99}