| 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-2020 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 | <https://www.gnu.org/licenses/>.  */ | 
|---|
| 46 |  | 
|---|
| 47 | #include <sys/types.h> | 
|---|
| 48 | #include <netinet/in.h> | 
|---|
| 49 | #include <arpa/inet.h> | 
|---|
| 50 | #include <ctype.h> | 
|---|
| 51 |  | 
|---|
| 52 | /* | 
|---|
| 53 | * Internet network address interpretation routine. | 
|---|
| 54 | * The library routines call this routine to interpret | 
|---|
| 55 | * network numbers. | 
|---|
| 56 | */ | 
|---|
| 57 | uint32_t | 
|---|
| 58 | inet_network (const char *cp) | 
|---|
| 59 | { | 
|---|
| 60 | uint32_t val, base, n, i; | 
|---|
| 61 | char c; | 
|---|
| 62 | uint32_t parts[4], *pp = parts; | 
|---|
| 63 | int digit; | 
|---|
| 64 |  | 
|---|
| 65 | again: | 
|---|
| 66 | val = 0; base = 10; digit = 0; | 
|---|
| 67 | if (*cp == '0') | 
|---|
| 68 | digit = 1, base = 8, cp++; | 
|---|
| 69 | if (*cp == 'x' || *cp == 'X') | 
|---|
| 70 | digit = 0, base = 16, cp++; | 
|---|
| 71 | while ((c = *cp) != 0) { | 
|---|
| 72 | if (isdigit(c)) { | 
|---|
| 73 | if (base == 8 && (c == '8' || c == '9')) | 
|---|
| 74 | return (INADDR_NONE); | 
|---|
| 75 | val = (val * base) + (c - '0'); | 
|---|
| 76 | cp++; | 
|---|
| 77 | digit = 1; | 
|---|
| 78 | continue; | 
|---|
| 79 | } | 
|---|
| 80 | if (base == 16 && isxdigit(c)) { | 
|---|
| 81 | val = (val << 4) + (tolower (c) + 10 - 'a'); | 
|---|
| 82 | cp++; | 
|---|
| 83 | digit = 1; | 
|---|
| 84 | continue; | 
|---|
| 85 | } | 
|---|
| 86 | break; | 
|---|
| 87 | } | 
|---|
| 88 | if (!digit) | 
|---|
| 89 | return (INADDR_NONE); | 
|---|
| 90 | if (pp >= parts + 4 || val > 0xff) | 
|---|
| 91 | return (INADDR_NONE); | 
|---|
| 92 | if (*cp == '.') { | 
|---|
| 93 | *pp++ = val, cp++; | 
|---|
| 94 | goto again; | 
|---|
| 95 | } | 
|---|
| 96 | while (isspace(*cp)) | 
|---|
| 97 | cp++; | 
|---|
| 98 | if (*cp) | 
|---|
| 99 | return (INADDR_NONE); | 
|---|
| 100 | if (pp >= parts + 4 || val > 0xff) | 
|---|
| 101 | return (INADDR_NONE); | 
|---|
| 102 | *pp++ = val; | 
|---|
| 103 | n = pp - parts; | 
|---|
| 104 | for (val = 0, i = 0; i < n; i++) { | 
|---|
| 105 | val <<= 8; | 
|---|
| 106 | val |= parts[i] & 0xff; | 
|---|
| 107 | } | 
|---|
| 108 | return (val); | 
|---|
| 109 | } | 
|---|
| 110 |  | 
|---|