1 |
30 |
unneback |
/*
|
2 |
|
|
* Copyright (c) 1983, 1993
|
3 |
|
|
* The Regents of the University of California. All rights reserved.
|
4 |
|
|
*
|
5 |
|
|
* Redistribution and use in source and binary forms, with or without
|
6 |
|
|
* modification, are permitted provided that the following conditions
|
7 |
|
|
* are met:
|
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 |
|
|
* 3. All advertising materials mentioning features or use of this software
|
14 |
|
|
* must display the following acknowledgement:
|
15 |
|
|
* This product includes software developed by the University of
|
16 |
|
|
* California, Berkeley and its contributors.
|
17 |
|
|
* 4. Neither the name of the University nor the names of its contributors
|
18 |
|
|
* may be used to endorse or promote products derived from this software
|
19 |
|
|
* without specific prior written permission.
|
20 |
|
|
*
|
21 |
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
22 |
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
23 |
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
24 |
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
25 |
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
26 |
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
27 |
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
28 |
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
29 |
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
30 |
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
31 |
|
|
* SUCH DAMAGE.
|
32 |
|
|
*
|
33 |
|
|
* $Id: inet_network.c,v 1.2 2001-09-27 12:01:53 chris Exp $
|
34 |
|
|
*/
|
35 |
|
|
|
36 |
|
|
#if defined(LIBC_SCCS) && !defined(lint)
|
37 |
|
|
static char sccsid[] = "@(#)inet_network.c 8.1 (Berkeley) 6/4/93";
|
38 |
|
|
#endif /* LIBC_SCCS and not lint */
|
39 |
|
|
|
40 |
|
|
#include <sys/types.h>
|
41 |
|
|
#include <netinet/in.h>
|
42 |
|
|
#include <arpa/inet.h>
|
43 |
|
|
#include <ctype.h>
|
44 |
|
|
|
45 |
|
|
/*
|
46 |
|
|
* Internet network address interpretation routine.
|
47 |
|
|
* The library routines call this routine to interpret
|
48 |
|
|
* network numbers.
|
49 |
|
|
*/
|
50 |
|
|
u_long
|
51 |
|
|
inet_network(cp)
|
52 |
|
|
register const char *cp;
|
53 |
|
|
{
|
54 |
|
|
register u_long val, base, n, i;
|
55 |
|
|
register char c;
|
56 |
|
|
u_long parts[4], *pp = parts;
|
57 |
|
|
|
58 |
|
|
again:
|
59 |
|
|
val = 0; base = 10;
|
60 |
|
|
if (*cp == '0')
|
61 |
|
|
base = 8, cp++;
|
62 |
|
|
if (*cp == 'x' || *cp == 'X')
|
63 |
|
|
base = 16, cp++;
|
64 |
|
|
while ((c = *cp) != 0) {
|
65 |
|
|
if (isdigit(c)) {
|
66 |
|
|
val = (val * base) + (c - '0');
|
67 |
|
|
cp++;
|
68 |
|
|
continue;
|
69 |
|
|
}
|
70 |
|
|
if (base == 16 && isxdigit(c)) {
|
71 |
|
|
val = (val << 4) + (c + 10 - (islower(c) ? 'a' : 'A'));
|
72 |
|
|
cp++;
|
73 |
|
|
continue;
|
74 |
|
|
}
|
75 |
|
|
break;
|
76 |
|
|
}
|
77 |
|
|
if (*cp == '.') {
|
78 |
|
|
if (pp >= parts + 3)
|
79 |
|
|
return (INADDR_NONE);
|
80 |
|
|
*pp++ = val, cp++;
|
81 |
|
|
goto again;
|
82 |
|
|
}
|
83 |
|
|
if (*cp && !isspace(*cp))
|
84 |
|
|
return (INADDR_NONE);
|
85 |
|
|
*pp++ = val;
|
86 |
|
|
n = pp - parts;
|
87 |
|
|
for (val = 0, i = 0; i < n; i++) {
|
88 |
|
|
val <<= 8;
|
89 |
|
|
val |= parts[i] & 0xff;
|
90 |
|
|
}
|
91 |
|
|
return (val);
|
92 |
|
|
}
|