90 lines
2.0 KiB
C
Executable File
90 lines
2.0 KiB
C
Executable File
/* Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T */
|
|
/* All Rights Reserved */
|
|
|
|
/* THIS IS UNPUBLISHED PROPRIETARY SOURCE CODE OF AT&T */
|
|
/* The copyright notice above does not evidence any */
|
|
/* actual or intended publication of such source code. */
|
|
|
|
#ident "@(#)inet_network.c 1.5 93/09/30 SMI" /* SVr4.0 1.1 */
|
|
|
|
/*
|
|
* +++++++++++++++++++++++++++++++++++++++++++++++++++++++++
|
|
* PROPRIETARY NOTICE (Combined)
|
|
*
|
|
* This source code is unpublished proprietary information
|
|
* constituting, or derived under license from AT&T's UNIX(r) System V.
|
|
* In addition, portions of such source code were derived from Berkeley
|
|
* 4.3 BSD under license from the Regents of the University of
|
|
* California.
|
|
*
|
|
*
|
|
*
|
|
* Copyright Notice
|
|
*
|
|
* Notice of copyright on this source code product does not indicate
|
|
* publication.
|
|
*
|
|
* (c) 1986,1987,1988.1989 Sun Microsystems, Inc
|
|
* (c) 1983,1984,1985,1986,1987,1988,1989 AT&T.
|
|
* All rights reserved.
|
|
*
|
|
*/
|
|
|
|
|
|
#include <sys/types.h>
|
|
#include <ctype.h>
|
|
|
|
/*
|
|
* 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;
|
|
register char c;
|
|
u_long parts[4], *pp = parts;
|
|
register int i;
|
|
|
|
again:
|
|
val = 0; base = 10;
|
|
if (*cp == '0')
|
|
base = 8, cp++;
|
|
if (*cp == 'x' || *cp == 'X')
|
|
base = 16, cp++;
|
|
while ((c = *cp) != NULL) {
|
|
if (isdigit(c)) {
|
|
if ((c - '0') >= base)
|
|
break;
|
|
val = (val * base) + (c - '0');
|
|
cp++;
|
|
continue;
|
|
}
|
|
if (base == 16 && isxdigit(c)) {
|
|
val = (val << 4) + (c + 10 - (islower(c) ? 'a' : 'A'));
|
|
cp++;
|
|
continue;
|
|
}
|
|
break;
|
|
}
|
|
if (*cp == '.') {
|
|
if (pp >= parts + 4)
|
|
return ((u_long)-1);
|
|
*pp++ = val, cp++;
|
|
goto again;
|
|
}
|
|
if (*cp && !isspace(*cp))
|
|
return ((u_long)-1);
|
|
*pp++ = val;
|
|
n = pp - parts;
|
|
if (n > 4)
|
|
return ((u_long)-1);
|
|
for (val = 0, i = 0; i < n; i++) {
|
|
val <<= 8;
|
|
val |= parts[i] & 0xff;
|
|
}
|
|
return (val);
|
|
}
|