nexmon – Blame information for rev 1
?pathlinks?
Rev | Author | Line No. | Line |
---|---|---|---|
1 | office | 1 | /* |
2 | * Copyright (c) 1983, 1990, 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. 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. |
||
16 | * |
||
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 |
||
27 | * SUCH DAMAGE. |
||
28 | */ |
||
29 | |||
30 | #include "config.h" |
||
31 | |||
32 | #include "inet_aton.h" |
||
33 | |||
34 | #if defined(LIBC_SCCS) && !defined(lint) |
||
35 | static char sccsid[] = "@(#)inet_addr.c 8.1 (Berkeley) 6/17/93"; |
||
36 | #endif /* LIBC_SCCS and not lint */ |
||
37 | |||
38 | #include <ctype.h> |
||
39 | |||
40 | #ifdef HAVE_SYS_PARAM_H |
||
41 | #include <sys/param.h> |
||
42 | #endif |
||
43 | |||
44 | |||
45 | |||
46 | /* |
||
47 | * Check whether "cp" is a valid ascii representation |
||
48 | * of an Internet address and convert to a binary address. |
||
49 | * Returns 1 if the address is valid, 0 if not. |
||
50 | * This replaces inet_addr, the return value from which |
||
51 | * cannot distinguish between failure and a local broadcast address. |
||
52 | */ |
||
53 | int |
||
54 | inet_aton(cp_arg, addr) |
||
55 | const char *cp_arg; |
||
56 | struct in_addr *addr; |
||
57 | { |
||
58 | register const u_char *cp = cp_arg; |
||
59 | register u_long val; |
||
60 | register int base; |
||
61 | register size_t n; |
||
62 | register u_char c; |
||
63 | u_int parts[4]; |
||
64 | register u_int *pp = parts; |
||
65 | |||
66 | for (;;) { |
||
67 | /* |
||
68 | * Collect number up to ``.''. |
||
69 | * Values are specified as for C: |
||
70 | * 0x=hex, 0=octal, other=decimal. |
||
71 | */ |
||
72 | val = 0; base = 10; |
||
73 | if (*cp == '0') { |
||
74 | if (*++cp == 'x' || *cp == 'X') |
||
75 | base = 16, cp++; |
||
76 | else |
||
77 | base = 8; |
||
78 | } |
||
79 | while ((c = *cp) != '\0') { |
||
80 | if (isascii(c) && isdigit(c)) { |
||
81 | val = (val * base) + (c - '0'); |
||
82 | cp++; |
||
83 | continue; |
||
84 | } |
||
85 | if (base == 16 && isascii(c) && isxdigit(c)) { |
||
86 | val = (val << 4) + |
||
87 | (c + 10 - (islower(c) ? 'a' : 'A')); |
||
88 | cp++; |
||
89 | continue; |
||
90 | } |
||
91 | break; |
||
92 | } |
||
93 | if (*cp == '.') { |
||
94 | /* |
||
95 | * Internet format: |
||
96 | * a.b.c.d |
||
97 | * a.b.c (with c treated as 16-bits) |
||
98 | * a.b (with b treated as 24 bits) |
||
99 | */ |
||
100 | if (pp >= parts + 3 || val > 0xff) |
||
101 | return (0); |
||
102 | *pp++ = val, cp++; |
||
103 | } else |
||
104 | break; |
||
105 | } |
||
106 | /* |
||
107 | * Check for trailing characters. |
||
108 | */ |
||
109 | if (*cp && (!isascii(*cp) || !isspace(*cp))) |
||
110 | return (0); |
||
111 | /* |
||
112 | * Concoct the address according to |
||
113 | * the number of parts specified. |
||
114 | */ |
||
115 | n = pp - parts + 1; |
||
116 | switch (n) { |
||
117 | |||
118 | case 1: /* a -- 32 bits */ |
||
119 | break; |
||
120 | |||
121 | case 2: /* a.b -- 8.24 bits */ |
||
122 | if (val > 0xffffff) |
||
123 | return (0); |
||
124 | val |= parts[0] << 24; |
||
125 | break; |
||
126 | |||
127 | case 3: /* a.b.c -- 8.8.16 bits */ |
||
128 | if (val > 0xffff) |
||
129 | return (0); |
||
130 | val |= (parts[0] << 24) | (parts[1] << 16); |
||
131 | break; |
||
132 | |||
133 | case 4: /* a.b.c.d -- 8.8.8.8 bits */ |
||
134 | if (val > 0xff) |
||
135 | return (0); |
||
136 | val |= (parts[0] << 24) | (parts[1] << 16) | (parts[2] << 8); |
||
137 | break; |
||
138 | } |
||
139 | if (addr) |
||
140 | addr->s_addr = htonl(val); |
||
141 | return (1); |
||
142 | } |
||
143 | |||
144 | /* |
||
145 | * Editor modelines - http://www.wireshark.org/tools/modelines.html |
||
146 | * |
||
147 | * Local variables: |
||
148 | * c-basic-offset: 8 |
||
149 | * tab-width: 8 |
||
150 | * indent-tabs-mode: t |
||
151 | * End: |
||
152 | * |
||
153 | * vi: set shiftwidth=8 tabstop=8 noexpandtab: |
||
154 | * :indentSize=8:tabSize=8:noTabs=false: |
||
155 | */ |