1994-05-27 05:00:24 +00:00
|
|
|
/*
|
1996-01-13 09:03:58 +00:00
|
|
|
* ++Copyright++ 1983, 1990, 1993
|
|
|
|
* -
|
1994-05-27 05:00:24 +00:00
|
|
|
* Copyright (c) 1983, 1990, 1993
|
1996-01-13 09:03:58 +00:00
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
1994-05-27 05:00:24 +00:00
|
|
|
* 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:
|
1996-01-13 09:03:58 +00:00
|
|
|
* This product includes software developed by the University of
|
|
|
|
* California, Berkeley and its contributors.
|
1994-05-27 05:00:24 +00:00
|
|
|
* 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.
|
1996-01-13 09:03:58 +00:00
|
|
|
*
|
1994-05-27 05:00:24 +00:00
|
|
|
* 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.
|
1996-01-13 09:03:58 +00:00
|
|
|
* -
|
|
|
|
* Portions Copyright (c) 1993 by Digital Equipment Corporation.
|
|
|
|
*
|
|
|
|
* Permission to use, copy, modify, and distribute this software for any
|
|
|
|
* purpose with or without fee is hereby granted, provided that the above
|
|
|
|
* copyright notice and this permission notice appear in all copies, and that
|
|
|
|
* the name of Digital Equipment Corporation not be used in advertising or
|
|
|
|
* publicity pertaining to distribution of the document or software without
|
|
|
|
* specific, written prior permission.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
|
|
|
|
* WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
|
|
|
|
* OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL DIGITAL EQUIPMENT
|
|
|
|
* CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
|
|
|
|
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
|
|
|
|
* ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
|
|
|
|
* SOFTWARE.
|
|
|
|
* -
|
|
|
|
* --Copyright--
|
1994-05-27 05:00:24 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#if defined(LIBC_SCCS) && !defined(lint)
|
|
|
|
static char sccsid[] = "@(#)inet_addr.c 8.1 (Berkeley) 6/17/93";
|
1999-08-28 00:22:10 +00:00
|
|
|
static char rcsid[] = "$FreeBSD$";
|
1994-05-27 05:00:24 +00:00
|
|
|
#endif /* LIBC_SCCS and not lint */
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
1999-10-31 04:07:56 +00:00
|
|
|
|
1994-05-27 05:00:24 +00:00
|
|
|
#include <netinet/in.h>
|
|
|
|
#include <arpa/inet.h>
|
1999-10-31 04:07:56 +00:00
|
|
|
|
1994-05-27 05:00:24 +00:00
|
|
|
#include <ctype.h>
|
1999-10-31 04:07:56 +00:00
|
|
|
#include <errno.h>
|
|
|
|
#include <string.h>
|
1994-05-27 05:00:24 +00:00
|
|
|
|
|
|
|
/*
|
1999-10-31 04:07:56 +00:00
|
|
|
* ASCII internet address interpretation routine.
|
1994-05-27 05:00:24 +00:00
|
|
|
* The value returned is in network order.
|
|
|
|
*/
|
1999-10-31 04:07:56 +00:00
|
|
|
u_long /* XXX should be struct in_addr :( */
|
1994-05-27 05:00:24 +00:00
|
|
|
inet_addr(cp)
|
|
|
|
register const char *cp;
|
|
|
|
{
|
|
|
|
struct in_addr val;
|
|
|
|
|
|
|
|
if (inet_aton(cp, &val))
|
|
|
|
return (val.s_addr);
|
|
|
|
return (INADDR_NONE);
|
|
|
|
}
|
|
|
|
|
1996-01-13 09:03:58 +00:00
|
|
|
/*
|
1999-10-31 04:07:56 +00:00
|
|
|
* Check whether "cp" is a valid ASCII representation
|
1994-05-27 05:00:24 +00:00
|
|
|
* 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)
|
|
|
|
register const char *cp;
|
|
|
|
struct in_addr *addr;
|
|
|
|
{
|
1999-10-31 04:07:56 +00:00
|
|
|
u_long parts[4];
|
|
|
|
u_long val;
|
|
|
|
char *c;
|
|
|
|
char *endptr;
|
|
|
|
int base, gotend, n;
|
|
|
|
|
|
|
|
c = (char *)cp;
|
|
|
|
n = 0;
|
|
|
|
/*
|
|
|
|
* Run through the string, grabbing numbers until
|
|
|
|
* the end of the string, or some error
|
|
|
|
*/
|
|
|
|
gotend = 0;
|
|
|
|
while (!gotend) {
|
|
|
|
errno = 0;
|
|
|
|
val = strtoul(c, &endptr, 0);
|
|
|
|
|
1999-11-03 04:18:34 +00:00
|
|
|
if (errno == ERANGE) /* Fail completely if it overflowed. */
|
1999-10-31 04:07:56 +00:00
|
|
|
return (0);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If the whole string is invalid, endptr will equal
|
|
|
|
* c.. this way we can make sure someone hasn't
|
|
|
|
* gone '.12' or something which would get past
|
|
|
|
* the next check.
|
1994-05-27 05:00:24 +00:00
|
|
|
*/
|
1999-10-31 04:07:56 +00:00
|
|
|
if (endptr == c)
|
1996-01-13 09:03:58 +00:00
|
|
|
return (0);
|
1999-10-31 04:07:56 +00:00
|
|
|
parts[n] = val;
|
|
|
|
c = endptr;
|
|
|
|
|
|
|
|
/* Check the next character past the previous number's end */
|
|
|
|
switch (*c) {
|
|
|
|
case '.' :
|
|
|
|
/* Make sure we only do 3 dots .. */
|
|
|
|
if (n == 3) /* Whoops. Quit. */
|
1994-05-27 05:00:24 +00:00
|
|
|
return (0);
|
1999-10-31 04:07:56 +00:00
|
|
|
n++;
|
|
|
|
c++;
|
1994-05-27 05:00:24 +00:00
|
|
|
break;
|
1999-10-31 04:07:56 +00:00
|
|
|
|
1999-10-31 04:43:55 +00:00
|
|
|
case '\0':
|
1999-10-31 04:07:56 +00:00
|
|
|
gotend = 1;
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
1999-11-04 04:30:44 +00:00
|
|
|
if (isspace((unsigned char)*c)) {
|
1999-10-31 04:43:55 +00:00
|
|
|
gotend = 1;
|
|
|
|
break;
|
|
|
|
} else
|
|
|
|
return (0); /* Invalid character, so fail */
|
1999-10-31 04:07:56 +00:00
|
|
|
}
|
|
|
|
|
1994-05-27 05:00:24 +00:00
|
|
|
}
|
1999-10-31 04:07:56 +00:00
|
|
|
|
1994-05-27 05:00:24 +00:00
|
|
|
/*
|
|
|
|
* Concoct the address according to
|
|
|
|
* the number of parts specified.
|
|
|
|
*/
|
|
|
|
|
1999-10-31 04:07:56 +00:00
|
|
|
switch (n) {
|
|
|
|
case 0: /* a -- 32 bits */
|
|
|
|
/*
|
|
|
|
* Nothing is necessary here. Overflow checking was
|
|
|
|
* already done in strtoul().
|
|
|
|
*/
|
1994-05-27 05:00:24 +00:00
|
|
|
break;
|
1999-10-31 04:07:56 +00:00
|
|
|
case 1: /* a.b -- 8.24 bits */
|
|
|
|
if (val > 0xffffff || parts[0] > 0xff)
|
1994-05-27 05:00:24 +00:00
|
|
|
return (0);
|
|
|
|
val |= parts[0] << 24;
|
|
|
|
break;
|
|
|
|
|
1999-10-31 04:07:56 +00:00
|
|
|
case 2: /* a.b.c -- 8.8.16 bits */
|
|
|
|
if (val > 0xffff || parts[0] > 0xff || parts[1] > 0xff)
|
1994-05-27 05:00:24 +00:00
|
|
|
return (0);
|
|
|
|
val |= (parts[0] << 24) | (parts[1] << 16);
|
|
|
|
break;
|
|
|
|
|
1999-10-31 04:07:56 +00:00
|
|
|
case 3: /* a.b.c.d -- 8.8.8.8 bits */
|
|
|
|
if (val > 0xff || parts[0] > 0xff || parts[1] > 0xff ||
|
|
|
|
parts[2] > 0xff)
|
1994-05-27 05:00:24 +00:00
|
|
|
return (0);
|
|
|
|
val |= (parts[0] << 24) | (parts[1] << 16) | (parts[2] << 8);
|
|
|
|
break;
|
|
|
|
}
|
1999-10-31 04:07:56 +00:00
|
|
|
|
|
|
|
if (addr != NULL)
|
1994-05-27 05:00:24 +00:00
|
|
|
addr->s_addr = htonl(val);
|
|
|
|
return (1);
|
|
|
|
}
|
1998-09-02 00:53:17 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Weak aliases for applications that use certain private entry points,
|
|
|
|
* and fail to include <arpa/inet.h>.
|
|
|
|
*/
|
|
|
|
#undef inet_addr
|
|
|
|
__weak_reference(__inet_addr, inet_addr);
|
|
|
|
#undef inet_aton
|
|
|
|
__weak_reference(__inet_aton, inet_aton);
|