]> git.saurik.com Git - apple/libc.git/blob - net/inet_network.c
7e743caada97e491c6c07e98ad4ab30200aa5c35
[apple/libc.git] / net / inet_network.c
1 /*
2 * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
3 *
4 * @APPLE_LICENSE_HEADER_START@
5 *
6 * Copyright (c) 1999-2003 Apple Computer, Inc. All Rights Reserved.
7 *
8 * This file contains Original Code and/or Modifications of Original Code
9 * as defined in and that are subject to the Apple Public Source License
10 * Version 2.0 (the 'License'). You may not use this file except in
11 * compliance with the License. Please obtain a copy of the License at
12 * http://www.opensource.apple.com/apsl/ and read it before using this
13 * file.
14 *
15 * The Original Code and all software distributed under the License are
16 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
17 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
18 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
20 * Please see the License for the specific language governing rights and
21 * limitations under the License.
22 *
23 * @APPLE_LICENSE_HEADER_END@
24 */
25 /*
26 * Copyright (c) 1983, 1993
27 * The Regents of the University of California. All rights reserved.
28 *
29 * Redistribution and use in source and binary forms, with or without
30 * modification, are permitted provided that the following conditions
31 * are met:
32 * 1. Redistributions of source code must retain the above copyright
33 * notice, this list of conditions and the following disclaimer.
34 * 2. Redistributions in binary form must reproduce the above copyright
35 * notice, this list of conditions and the following disclaimer in the
36 * documentation and/or other materials provided with the distribution.
37 * 3. All advertising materials mentioning features or use of this software
38 * must display the following acknowledgement:
39 * This product includes software developed by the University of
40 * California, Berkeley and its contributors.
41 * 4. Neither the name of the University nor the names of its contributors
42 * may be used to endorse or promote products derived from this software
43 * without specific prior written permission.
44 *
45 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
46 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
47 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
48 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
49 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
50 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
51 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
52 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
53 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
54 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
55 * SUCH DAMAGE.
56 */
57
58
59 #include <sys/types.h>
60 #include <netinet/in.h>
61 #include <arpa/inet.h>
62 #include <ctype.h>
63
64 /*
65 * Internet network address interpretation routine.
66 * The library routines call this routine to interpret
67 * network numbers.
68 */
69 u_long
70 inet_network(cp)
71 register const char *cp;
72 {
73 register u_long val, base, n;
74 register char c;
75 u_long parts[4], *pp = parts;
76 register int i;
77
78 again:
79 val = 0; base = 10;
80 if (*cp == '0')
81 base = 8, cp++;
82 if (*cp == 'x' || *cp == 'X')
83 base = 16, cp++;
84 while (c = *cp) {
85 if (isdigit(c)) {
86 val = (val * base) + (c - '0');
87 cp++;
88 continue;
89 }
90 if (base == 16 && isxdigit(c)) {
91 val = (val << 4) + (c + 10 - (islower(c) ? 'a' : 'A'));
92 cp++;
93 continue;
94 }
95 break;
96 }
97 if (*cp == '.') {
98 if (pp >= parts + 4)
99 return (INADDR_NONE);
100 *pp++ = val, cp++;
101 goto again;
102 }
103 if (*cp && !isspace(*cp))
104 return (INADDR_NONE);
105 *pp++ = val;
106 n = pp - parts;
107 if (n > 4)
108 return (INADDR_NONE);
109 for (val = 0, i = 0; i < n; i++) {
110 val <<= 8;
111 val |= parts[i] & 0xff;
112 }
113 return (val);
114 }