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