289 lines
7.6 KiB
C
289 lines
7.6 KiB
C
/*
|
|
* Copyright (c) 1983, 1990 Regents of the University of California.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#if defined(LIBC_SCCS) && !defined(lint)
|
|
static char sccsid[] = "@(#)inet_addr.c 5.10 (Berkeley) 2/24/91";
|
|
#endif /* LIBC_SCCS and not lint */
|
|
|
|
#define _KERNEL
|
|
#include "ixemul.h"
|
|
|
|
#include <sys/param.h>
|
|
#include <netinet/in.h>
|
|
#include <arpa/inet.h>
|
|
#include <ctype.h>
|
|
#include <stdio.h>
|
|
|
|
/*
|
|
* Check whether "cp" is a valid ascii representation
|
|
* of an Internet address and convert to a binary address.
|
|
* Returns 1 if the address is valid, 0 if not.
|
|
* This replaces inet_addr, the return value from which
|
|
* cannot distinguish between failure and a local broadcast address.
|
|
*/
|
|
|
|
int
|
|
inet_aton(cp, addr)
|
|
const char *cp;
|
|
struct in_addr *addr;
|
|
{
|
|
register u_long val, base, n;
|
|
register char c;
|
|
u_long parts[4], *pp = parts;
|
|
|
|
for (;;) {
|
|
/*
|
|
* Collect number up to ``.''.
|
|
* Values are specified as for C:
|
|
* 0x=hex, 0=octal, other=decimal.
|
|
*/
|
|
val = 0; base = 10;
|
|
if (*cp == '0') {
|
|
if (*++cp == 'x' || *cp == 'X')
|
|
base = 16, cp++;
|
|
else
|
|
base = 8;
|
|
}
|
|
while ((c = *cp) != '\0') {
|
|
if (isascii(c) && isdigit(c)) {
|
|
val = (val * base) + (c - '0');
|
|
cp++;
|
|
continue;
|
|
}
|
|
if (base == 16 && isascii(c) && isxdigit(c)) {
|
|
val = (val << 4) +
|
|
(c + 10 - (islower(c) ? 'a' : 'A'));
|
|
cp++;
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
if (*cp == '.') {
|
|
/*
|
|
* Internet format:
|
|
* a.b.c.d
|
|
* a.b.c (with c treated as 16-bits)
|
|
* a.b (with b treated as 24 bits)
|
|
*/
|
|
if (pp >= parts + 3 || val > 0xff)
|
|
return (0);
|
|
*pp++ = val, cp++;
|
|
} else
|
|
break;
|
|
}
|
|
/*
|
|
* Check for trailing characters.
|
|
*/
|
|
if (*cp && (!isascii(*cp) || !isspace(*cp)))
|
|
return (0);
|
|
/*
|
|
* Concoct the address according to
|
|
* the number of parts specified.
|
|
*/
|
|
n = pp - parts + 1;
|
|
switch (n) {
|
|
|
|
case 1: /* a -- 32 bits */
|
|
break;
|
|
|
|
case 2: /* a.b -- 8.24 bits */
|
|
if (val > 0xffffff)
|
|
return (0);
|
|
val |= parts[0] << 24;
|
|
break;
|
|
|
|
case 3: /* a.b.c -- 8.8.16 bits */
|
|
if (val > 0xffff)
|
|
return (0);
|
|
val |= (parts[0] << 24) | (parts[1] << 16);
|
|
break;
|
|
|
|
case 4: /* a.b.c.d -- 8.8.8.8 bits */
|
|
if (val > 0xff)
|
|
return (0);
|
|
val |= (parts[0] << 24) | (parts[1] << 16) | (parts[2] << 8);
|
|
break;
|
|
}
|
|
if (addr)
|
|
addr->s_addr = htonl(val);
|
|
return (1);
|
|
}
|
|
|
|
/*
|
|
* Ascii internet address interpretation routine.
|
|
* The value returned is in network order.
|
|
*/
|
|
u_long
|
|
inet_addr(cp)
|
|
const char *cp;
|
|
{
|
|
struct in_addr val;
|
|
|
|
if (inet_aton(cp, &val))
|
|
return (val.s_addr);
|
|
return (u_long)-1;
|
|
}
|
|
|
|
/*
|
|
* Return the local network address portion of an
|
|
* internet address; handles class a/b/c network
|
|
* number formats.
|
|
*/
|
|
u_long
|
|
inet_lnaof(in)
|
|
struct in_addr in;
|
|
{
|
|
register u_long i = ntohl(in.s_addr);
|
|
|
|
if (IN_CLASSA(i))
|
|
return ((i)&IN_CLASSA_HOST);
|
|
else if (IN_CLASSB(i))
|
|
return ((i)&IN_CLASSB_HOST);
|
|
else
|
|
return ((i)&IN_CLASSC_HOST);
|
|
}
|
|
|
|
/*
|
|
* Formulate an Internet address from network + host. Used in
|
|
* building addresses stored in the ifnet structure.
|
|
*/
|
|
struct in_addr
|
|
inet_makeaddr(net, host)
|
|
u_long net, host;
|
|
{
|
|
u_long addr;
|
|
|
|
if (net < 128)
|
|
addr = (net << IN_CLASSA_NSHIFT) | (host & IN_CLASSA_HOST);
|
|
else if (net < 65536)
|
|
addr = (net << IN_CLASSB_NSHIFT) | (host & IN_CLASSB_HOST);
|
|
else if (net < 16777216L)
|
|
addr = (net << IN_CLASSC_NSHIFT) | (host & IN_CLASSC_HOST);
|
|
else
|
|
addr = net | host;
|
|
addr = htonl(addr);
|
|
return (*(struct in_addr *)&addr);
|
|
}
|
|
|
|
/*
|
|
* Return the network number from an internet
|
|
* address; handles class a/b/c network #'s.
|
|
*/
|
|
u_long
|
|
inet_netof(in)
|
|
struct in_addr in;
|
|
{
|
|
register u_long i = ntohl(in.s_addr);
|
|
|
|
if (IN_CLASSA(i))
|
|
return (((i)&IN_CLASSA_NET) >> IN_CLASSA_NSHIFT);
|
|
else if (IN_CLASSB(i))
|
|
return (((i)&IN_CLASSB_NET) >> IN_CLASSB_NSHIFT);
|
|
else
|
|
return (((i)&IN_CLASSC_NET) >> IN_CLASSC_NSHIFT);
|
|
}
|
|
|
|
#ifndef INADDR_NONE
|
|
#define INADDR_NONE __IPADDR(0xffffffff) /* -1 return */
|
|
#endif
|
|
/*
|
|
* Internet network address interpretation routine.
|
|
* The library routines call this routine to interpret
|
|
* network numbers.
|
|
*/
|
|
u_long
|
|
inet_network(cp)
|
|
register const char *cp;
|
|
{
|
|
register u_long val, base, n, i;
|
|
register char c;
|
|
u_long parts[4], *pp = parts;
|
|
int digit;
|
|
|
|
again:
|
|
val = 0; base = 10; digit = 0;
|
|
if (*cp == '0')
|
|
digit = 1, base = 8, cp++;
|
|
if (*cp == 'x' || *cp == 'X')
|
|
base = 16, cp++;
|
|
while ((c = *cp) != 0) {
|
|
if (isdigit(c)) {
|
|
if (base == 8 && (c == '8' || c == '9'))
|
|
return (INADDR_NONE);
|
|
val = (val * base) + (c - '0');
|
|
cp++;
|
|
digit = 1;
|
|
continue;
|
|
}
|
|
if (base == 16 && isxdigit(c)) {
|
|
val = (val << 4) + (c + 10 - (islower(c) ? 'a' : 'A'));
|
|
cp++;
|
|
digit = 1;
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
if (!digit)
|
|
return (INADDR_NONE);
|
|
if (*cp == '.') {
|
|
if (pp >= parts + 4 || val > 0xff)
|
|
return (INADDR_NONE);
|
|
*pp++ = val, cp++;
|
|
goto again;
|
|
}
|
|
if (*cp && !isspace(*cp))
|
|
return (INADDR_NONE);
|
|
*pp++ = val;
|
|
n = pp - parts;
|
|
if (n > 4)
|
|
return (INADDR_NONE);
|
|
for (val = 0, i = 0; i < n; i++) {
|
|
val <<= 8;
|
|
val |= parts[i] & 0xff;
|
|
}
|
|
return (val);
|
|
}
|
|
char *
|
|
inet_ntoa(in)
|
|
struct in_addr in;
|
|
{
|
|
usetup;
|
|
char *p = (char *)∈
|
|
|
|
#define UC(b) (((int)b)&0xff)
|
|
|
|
snprintf(u.u_ntoa_buf, sizeof(u.u_ntoa_buf),
|
|
"%d.%d.%d.%d", UC(p[0]), UC(p[1]), UC(p[2]), UC(p[3]));
|
|
return u.u_ntoa_buf;
|
|
}
|