|  | /* AKAROS_PORT: copied from resolv/, no changes.  We don't build resolv, but we | 
|  | * still needed this file. */ | 
|  |  | 
|  | /* | 
|  | * Copyright (c) 1983, 1990, 1993 | 
|  | *    The 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. | 
|  | * 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. | 
|  | */ | 
|  |  | 
|  | /* | 
|  | * 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. | 
|  | */ | 
|  |  | 
|  | /* | 
|  | * Portions Copyright (c) 1996-1999 by Internet Software Consortium. | 
|  | * | 
|  | * 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. | 
|  | * | 
|  | * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS | 
|  | * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES | 
|  | * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE | 
|  | * CONSORTIUM 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. | 
|  | */ | 
|  |  | 
|  | #if defined(LIBC_SCCS) && !defined(lint) | 
|  | static const char sccsid[] = "@(#)inet_addr.c	8.1 (Berkeley) 6/17/93"; | 
|  | static const char rcsid[] = "$BINDId: inet_addr.c,v 8.11 1999/10/13 16:39:25 vixie Exp $"; | 
|  | #endif /* LIBC_SCCS and not lint */ | 
|  |  | 
|  | #include <sys/types.h> | 
|  | #include <sys/param.h> | 
|  |  | 
|  | #include <netinet/in.h> | 
|  | #include <arpa/inet.h> | 
|  |  | 
|  | #include <ctype.h> | 
|  |  | 
|  | #ifdef _LIBC | 
|  | # include <endian.h> | 
|  | # include <stdint.h> | 
|  | # include <stdlib.h> | 
|  | # include <limits.h> | 
|  | # include <errno.h> | 
|  | #endif | 
|  |  | 
|  | /* | 
|  | * Ascii internet address interpretation routine. | 
|  | * The value returned is in network order. | 
|  | */ | 
|  | in_addr_t | 
|  | inet_addr(const char *cp) { | 
|  | struct in_addr val; | 
|  |  | 
|  | if (__inet_aton(cp, &val)) | 
|  | return (val.s_addr); | 
|  | return (INADDR_NONE); | 
|  | } | 
|  |  | 
|  | /* | 
|  | * 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(const char *cp, struct in_addr *addr) | 
|  | { | 
|  | static const in_addr_t max[4] = { 0xffffffff, 0xffffff, 0xffff, 0xff }; | 
|  | in_addr_t val; | 
|  | #ifndef _LIBC | 
|  | int base; | 
|  | #endif | 
|  | char c; | 
|  | union iaddr { | 
|  | uint8_t bytes[4]; | 
|  | uint32_t word; | 
|  | } res; | 
|  | uint8_t *pp = res.bytes; | 
|  | int digit; | 
|  |  | 
|  | #ifdef _LIBC | 
|  | int saved_errno = errno; | 
|  | __set_errno (0); | 
|  | #endif | 
|  |  | 
|  | res.word = 0; | 
|  |  | 
|  | c = *cp; | 
|  | for (;;) { | 
|  | /* | 
|  | * Collect number up to ``.''. | 
|  | * Values are specified as for C: | 
|  | * 0x=hex, 0=octal, isdigit=decimal. | 
|  | */ | 
|  | if (!isdigit(c)) | 
|  | goto ret_0; | 
|  | #ifdef _LIBC | 
|  | { | 
|  | char *endp; | 
|  | unsigned long ul = strtoul (cp, (char **) &endp, 0); | 
|  | if (ul == ULONG_MAX && errno == ERANGE) | 
|  | goto ret_0; | 
|  | if (ul > 0xfffffffful) | 
|  | goto ret_0; | 
|  | val = ul; | 
|  | digit = cp != endp; | 
|  | cp = endp; | 
|  | } | 
|  | c = *cp; | 
|  | #else | 
|  | val = 0; base = 10; digit = 0; | 
|  | if (c == '0') { | 
|  | c = *++cp; | 
|  | if (c == 'x' || c == 'X') | 
|  | base = 16, c = *++cp; | 
|  | else { | 
|  | base = 8; | 
|  | digit = 1 ; | 
|  | } | 
|  | } | 
|  | for (;;) { | 
|  | if (isascii(c) && isdigit(c)) { | 
|  | if (base == 8 && (c == '8' || c == '9')) | 
|  | return (0); | 
|  | val = (val * base) + (c - '0'); | 
|  | c = *++cp; | 
|  | digit = 1; | 
|  | } else if (base == 16 && isascii(c) && isxdigit(c)) { | 
|  | val = (val << 4) | | 
|  | (c + 10 - (islower(c) ? 'a' : 'A')); | 
|  | c = *++cp; | 
|  | digit = 1; | 
|  | } else | 
|  | break; | 
|  | } | 
|  | #endif | 
|  | if (c == '.') { | 
|  | /* | 
|  | * 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 > res.bytes + 2 || val > 0xff) | 
|  | goto ret_0; | 
|  | *pp++ = val; | 
|  | c = *++cp; | 
|  | } else | 
|  | break; | 
|  | } | 
|  | /* | 
|  | * Check for trailing characters. | 
|  | */ | 
|  | if (c != '\0' && (!isascii(c) || !isspace(c))) | 
|  | goto ret_0; | 
|  | /* | 
|  | * Did we get a valid digit? | 
|  | */ | 
|  | if (!digit) | 
|  | goto ret_0; | 
|  |  | 
|  | /* Check whether the last part is in its limits depending on | 
|  | the number of parts in total.  */ | 
|  | if (val > max[pp - res.bytes]) | 
|  | goto ret_0; | 
|  |  | 
|  | if (addr != NULL) | 
|  | addr->s_addr = res.word | htonl (val); | 
|  |  | 
|  | #ifdef _LIBC | 
|  | __set_errno (saved_errno); | 
|  | #endif | 
|  | return (1); | 
|  |  | 
|  | ret_0: | 
|  | #ifdef _LIBC | 
|  | __set_errno (saved_errno); | 
|  | #endif | 
|  | return (0); | 
|  | } | 
|  | weak_alias (__inet_aton, inet_aton) | 
|  | libc_hidden_def (__inet_aton) | 
|  | libc_hidden_weak (inet_aton) |