]>
Commit | Line | Data |
---|---|---|
2aa62f2b | 1 | /** @File\r |
2 | Internet network address interpretation routine.\r | |
3 | \r | |
4 | Copyright (c) 2011, Intel Corporation. All rights reserved.<BR>\r | |
5 | This program and the accompanying materials are licensed and made available under\r | |
6 | the terms and conditions of the BSD License that accompanies this distribution.\r | |
7 | The full text of the license may be found at\r | |
8 | http://opensource.org/licenses/bsd-license.\r | |
9 | \r | |
10 | THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,\r | |
11 | WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.\r | |
12 | \r | |
13 | * Copyright (c) 1983, 1993\r | |
14 | * The Regents of the University of California. All rights reserved.\r | |
15 | *\r | |
16 | * Redistribution and use in source and binary forms, with or without\r | |
17 | * modification, are permitted provided that the following conditions\r | |
18 | * are met:\r | |
19 | * 1. Redistributions of source code must retain the above copyright\r | |
20 | * notice, this list of conditions and the following disclaimer.\r | |
21 | * 2. Redistributions in binary form must reproduce the above copyright\r | |
22 | * notice, this list of conditions and the following disclaimer in the\r | |
23 | * documentation and/or other materials provided with the distribution.\r | |
24 | * 3. Neither the name of the University nor the names of its contributors\r | |
25 | * may be used to endorse or promote products derived from this software\r | |
26 | * without specific prior written permission.\r | |
27 | *\r | |
28 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND\r | |
29 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r | |
30 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r | |
31 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE\r | |
32 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r | |
33 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\r | |
34 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\r | |
35 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\r | |
36 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\r | |
37 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\r | |
38 | * SUCH DAMAGE.\r | |
39 | \r | |
40 | NetBSD: inet_network.c,v 1.1 2004/05/20 23:13:02 christos Exp\r | |
41 | inet_network.c 8.1 (Berkeley) 6/4/93\r | |
42 | **/\r | |
43 | #include <LibConfig.h>\r | |
44 | \r | |
45 | #include "namespace.h"\r | |
46 | #include <sys/types.h>\r | |
47 | #include <netinet/in.h>\r | |
48 | #include <arpa/inet.h>\r | |
49 | \r | |
50 | #include <assert.h>\r | |
51 | #include <ctype.h>\r | |
52 | #ifdef _DIAGNOSTIC\r | |
53 | #include <stddef.h> /* for NULL */\r | |
54 | #endif\r | |
55 | \r | |
56 | #ifdef __weak_alias\r | |
57 | __weak_alias(inet_network,_inet_network)\r | |
58 | #endif\r | |
59 | \r | |
60 | /*\r | |
61 | * Internet network address interpretation routine.\r | |
62 | * The library routines call this routine to interpret\r | |
63 | * network numbers.\r | |
64 | */\r | |
65 | in_addr_t\r | |
66 | inet_network(const char *cp)\r | |
67 | {\r | |
68 | in_addr_t val;\r | |
69 | size_t i, n;\r | |
70 | u_char c;\r | |
71 | in_addr_t parts[4], *pp = parts;\r | |
72 | int digit, base;\r | |
73 | \r | |
74 | _DIAGASSERT(cp != NULL);\r | |
75 | \r | |
76 | again:\r | |
77 | val = 0; base = 10; digit = 0;\r | |
78 | if (*cp == '0')\r | |
79 | digit = 1, base = 8, cp++;\r | |
80 | if (*cp == 'x' || *cp == 'X')\r | |
81 | base = 16, cp++;\r | |
82 | while ((c = *cp) != 0) {\r | |
83 | if (isdigit(c)) {\r | |
84 | if (base == 8 && (c == '8' || c == '9'))\r | |
85 | return (INADDR_NONE);\r | |
86 | val = (val * base) + (c - '0');\r | |
87 | cp++;\r | |
88 | digit = 1;\r | |
89 | continue;\r | |
90 | }\r | |
91 | if (base == 16 && isxdigit(c)) {\r | |
92 | val = (val << 4) + (c + 10 - (islower(c) ? 'a' : 'A'));\r | |
93 | cp++;\r | |
94 | digit = 1;\r | |
95 | continue;\r | |
96 | }\r | |
97 | break;\r | |
98 | }\r | |
99 | if (!digit)\r | |
100 | return (INADDR_NONE);\r | |
101 | if (*cp == '.') {\r | |
102 | if (pp >= parts + 4 || val > 0xff)\r | |
103 | return (INADDR_NONE);\r | |
104 | *pp++ = val, cp++;\r | |
105 | goto again;\r | |
106 | }\r | |
107 | if (*cp && !isspace((u_char) *cp))\r | |
108 | return (INADDR_NONE);\r | |
109 | if (pp >= parts + 4 || val > 0xff)\r | |
110 | return (INADDR_NONE);\r | |
111 | *pp++ = val;\r | |
112 | n = pp - parts;\r | |
113 | if (n > 4)\r | |
114 | return (INADDR_NONE);\r | |
115 | for (val = 0, i = 0; i < n; i++) {\r | |
116 | val <<= 8;\r | |
117 | val |= parts[i] & 0xff;\r | |
118 | }\r | |
119 | return (val);\r | |
120 | }\r |