| xf.li | bdd93d5 | 2023-05-12 07:10:14 -0700 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (c) 1983, 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 | * 4. 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 | /* Copyright (C) 2013-2016 Free Software Foundation, Inc. |
| 31 | This file is part of the GNU C Library. |
| 32 | |
| 33 | The GNU C Library is free software; you can redistribute it and/or |
| 34 | modify it under the terms of the GNU Lesser General Public |
| 35 | License as published by the Free Software Foundation; either |
| 36 | version 2.1 of the License, or (at your option) any later version. |
| 37 | |
| 38 | The GNU C Library is distributed in the hope that it will be useful, |
| 39 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 40 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 41 | Lesser General Public License for more details. |
| 42 | |
| 43 | You should have received a copy of the GNU Lesser General Public |
| 44 | License along with the GNU C Library; if not, see |
| 45 | <http://www.gnu.org/licenses/>. */ |
| 46 | |
| 47 | |
| 48 | #if defined(LIBC_SCCS) && !defined(lint) |
| 49 | static char sccsid[] = "@(#)inet_network.c 8.1 (Berkeley) 6/4/93"; |
| 50 | #endif /* LIBC_SCCS and not lint */ |
| 51 | |
| 52 | #include <sys/types.h> |
| 53 | #include <netinet/in.h> |
| 54 | #include <arpa/inet.h> |
| 55 | #include <ctype.h> |
| 56 | |
| 57 | /* |
| 58 | * Internet network address interpretation routine. |
| 59 | * The library routines call this routine to interpret |
| 60 | * network numbers. |
| 61 | */ |
| 62 | u_int32_t |
| 63 | inet_network (const char *cp) |
| 64 | { |
| 65 | u_int32_t val, base, n, i; |
| 66 | char c; |
| 67 | u_int32_t parts[4], *pp = parts; |
| 68 | int digit; |
| 69 | |
| 70 | again: |
| 71 | val = 0; base = 10; digit = 0; |
| 72 | if (*cp == '0') |
| 73 | digit = 1, base = 8, cp++; |
| 74 | if (*cp == 'x' || *cp == 'X') |
| 75 | digit = 0, base = 16, cp++; |
| 76 | while ((c = *cp) != 0) { |
| 77 | if (isdigit(c)) { |
| 78 | if (base == 8 && (c == '8' || c == '9')) |
| 79 | return (INADDR_NONE); |
| 80 | val = (val * base) + (c - '0'); |
| 81 | cp++; |
| 82 | digit = 1; |
| 83 | continue; |
| 84 | } |
| 85 | if (base == 16 && isxdigit(c)) { |
| 86 | val = (val << 4) + (tolower (c) + 10 - 'a'); |
| 87 | cp++; |
| 88 | digit = 1; |
| 89 | continue; |
| 90 | } |
| 91 | break; |
| 92 | } |
| 93 | if (!digit) |
| 94 | return (INADDR_NONE); |
| 95 | if (pp >= parts + 4 || val > 0xff) |
| 96 | return (INADDR_NONE); |
| 97 | if (*cp == '.') { |
| 98 | *pp++ = val, cp++; |
| 99 | goto again; |
| 100 | } |
| 101 | while (isspace(*cp)) |
| 102 | cp++; |
| 103 | if (*cp) |
| 104 | return (INADDR_NONE); |
| 105 | if (pp >= parts + 4 || val > 0xff) |
| 106 | return (INADDR_NONE); |
| 107 | *pp++ = val; |
| 108 | n = pp - parts; |
| 109 | for (val = 0, i = 0; i < n; i++) { |
| 110 | val <<= 8; |
| 111 | val |= parts[i] & 0xff; |
| 112 | } |
| 113 | return (val); |
| 114 | } |