Home | History | Annotate | Line # | Download | only in inet 
      1 /*	$NetBSD: inet_network.c,v 1.5 2022/10/06 06:03:06 ryo Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1983, 1993
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     10  * 1. Redistributions of source code must retain the above copyright
     11  *    notice, this list of conditions and the following disclaimer.
     12  * 2. Redistributions in binary form must reproduce the above copyright
     13  *    notice, this list of conditions and the following disclaimer in the
     14  *    documentation and/or other materials provided with the distribution.
     15  * 3. Neither the name of the University nor the names of its contributors
     16  *    may be used to endorse or promote products derived from this software
     17  *    without specific prior written permission.
     18  *
     19  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29  * SUCH DAMAGE.
     30  */
     31 
     32 #include <sys/cdefs.h>
     33 #if defined(LIBC_SCCS) && !defined(lint)
     34 #if 0
     35 static char sccsid[] = "@(#)inet_network.c	8.1 (Berkeley) 6/4/93";
     36 #else
     37 __RCSID("$NetBSD: inet_network.c,v 1.5 2022/10/06 06:03:06 ryo Exp $");
     38 #endif
     39 #endif /* LIBC_SCCS and not lint */
     40 
     41 #include "namespace.h"
     42 #include <sys/types.h>
     43 #include <netinet/in.h>
     44 #include <arpa/inet.h>
     45 
     46 #include <assert.h>
     47 #include <ctype.h>
     48 #ifdef _DIAGNOSTIC
     49 #include <stddef.h>	/* for NULL */
     50 #endif
     51 
     52 #ifdef __weak_alias
     53 __weak_alias(inet_network,_inet_network)
     54 #endif
     55 
     56 /*
     57  * Internet network address interpretation routine.
     58  * The library routines call this routine to interpret
     59  * network numbers.
     60  */
     61 in_addr_t
     62 inet_network(const char *cp)
     63 {
     64 	in_addr_t val;
     65 	size_t i, n;
     66 	u_char c;
     67 	in_addr_t parts[4], *pp = parts;
     68 	int digit, base;
     69 
     70 	_DIAGASSERT(cp != NULL);
     71 
     72 again:
     73 	val = 0; base = 10; digit = 0;
     74 	if (*cp == '0') {
     75 		digit = 1, base = 8, cp++;
     76 		if (*cp == 'x' || *cp == 'X')
     77 			digit = 0, base = 16, cp++;
     78 	}
     79 	while ((c = *cp) != 0) {
     80 		if (isdigit(c)) {
     81 			if (base == 8 && (c == '8' || c == '9'))
     82 				return (INADDR_NONE);
     83 			val = (val * base) + (c - '0');
     84 			cp++;
     85 			digit = 1;
     86 			continue;
     87 		}
     88 		if (base == 16 && isxdigit(c)) {
     89 			val = (val << 4) + (c + 10 - (islower(c) ? 'a' : 'A'));
     90 			cp++;
     91 			digit = 1;
     92 			continue;
     93 		}
     94 		break;
     95 	}
     96 	if (!digit)
     97 		return (INADDR_NONE);
     98 	if (pp >= parts + 4 || val > 0xff)
     99 		return (INADDR_NONE);
    100 	if (*cp == '.') {
    101 		*pp++ = val, cp++;
    102 		goto again;
    103 	}
    104 	if (*cp && !isspace((u_char) *cp))
    105 		return (INADDR_NONE);
    106 	*pp++ = val;
    107 	n = pp - parts;
    108 	if (n > 4)
    109 		return (INADDR_NONE);
    110 	for (val = 0, i = 0; i < n; i++) {
    111 		val <<= 8;
    112 		val |= parts[i] & 0xff;
    113 	}
    114 	return (val);
    115 }
    116