| 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 | * 3. All advertising materials mentioning features or use of this software
|
|---|
| 14 | * must display the following acknowledgement:
|
|---|
| 15 | * This product includes software developed by the University of
|
|---|
| 16 | * California, Berkeley and its contributors.
|
|---|
| 17 | * 4. Neither the name of the University nor the names of its contributors
|
|---|
| 18 | * may be used to endorse or promote products derived from this software
|
|---|
| 19 | * without specific prior written permission.
|
|---|
| 20 | *
|
|---|
| 21 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|---|
| 22 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|---|
| 23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|---|
| 24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|---|
| 25 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|---|
| 26 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|---|
| 27 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|---|
| 28 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|---|
| 29 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|---|
| 30 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|---|
| 31 | * SUCH DAMAGE.
|
|---|
| 32 | */
|
|---|
| 33 |
|
|---|
| 34 | #if defined(LIBC_SCCS) && !defined(lint)
|
|---|
| 35 | static char sccsid[] = "@(#)inet_network.c 8.1 (Berkeley) 6/4/93";
|
|---|
| 36 | #endif /* LIBC_SCCS and not lint */
|
|---|
| 37 |
|
|---|
| 38 | #include <sys/types.h>
|
|---|
| 39 | #include <ctype.h>
|
|---|
| 40 | #include <net/gen/in.h>
|
|---|
| 41 | #include <net/gen/inet.h>
|
|---|
| 42 |
|
|---|
| 43 | #define INADDR_NONE ((ipaddr_t) -1)
|
|---|
| 44 |
|
|---|
| 45 | /*
|
|---|
| 46 | * Internet network address interpretation routine.
|
|---|
| 47 | * The library routines call this routine to interpret
|
|---|
| 48 | * network numbers.
|
|---|
| 49 | */
|
|---|
| 50 | ipaddr_t
|
|---|
| 51 | inet_network(cp)
|
|---|
| 52 | register const char *cp;
|
|---|
| 53 | {
|
|---|
| 54 | register ipaddr_t val, base, n;
|
|---|
| 55 | register char c;
|
|---|
| 56 | ipaddr_t parts[4], *pp = parts;
|
|---|
| 57 | register int i;
|
|---|
| 58 |
|
|---|
| 59 | again:
|
|---|
| 60 | val = 0; base = 10;
|
|---|
| 61 | if (*cp == '0')
|
|---|
| 62 | base = 8, cp++;
|
|---|
| 63 | if (*cp == 'x' || *cp == 'X')
|
|---|
| 64 | base = 16, cp++;
|
|---|
| 65 | while (c = *cp) {
|
|---|
| 66 | if (isdigit(c)) {
|
|---|
| 67 | val = (val * base) + (c - '0');
|
|---|
| 68 | cp++;
|
|---|
| 69 | continue;
|
|---|
| 70 | }
|
|---|
| 71 | if (base == 16 && isxdigit(c)) {
|
|---|
| 72 | val = (val << 4) + (c + 10 - (islower(c) ? 'a' : 'A'));
|
|---|
| 73 | cp++;
|
|---|
| 74 | continue;
|
|---|
| 75 | }
|
|---|
| 76 | break;
|
|---|
| 77 | }
|
|---|
| 78 | if (*cp == '.') {
|
|---|
| 79 | if (pp >= parts + 4)
|
|---|
| 80 | return (INADDR_NONE);
|
|---|
| 81 | *pp++ = val, cp++;
|
|---|
| 82 | goto again;
|
|---|
| 83 | }
|
|---|
| 84 | if (*cp && !isspace(*cp))
|
|---|
| 85 | return (INADDR_NONE);
|
|---|
| 86 | *pp++ = val;
|
|---|
| 87 | n = pp - parts;
|
|---|
| 88 | if (n > 4)
|
|---|
| 89 | return (INADDR_NONE);
|
|---|
| 90 | for (val = 0, i = 0; i < n; i++) {
|
|---|
| 91 | val <<= 8;
|
|---|
| 92 | val |= parts[i] & 0xff;
|
|---|
| 93 | }
|
|---|
| 94 | return (val);
|
|---|
| 95 | }
|
|---|
