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