lib/liblwres/lwinetaton.c

   1 /*
   2  * Portions Copyright (C) 1996-2001  Internet Software Consortium.
   3  *
   4  * Permission to use, copy, modify, and distribute this software for any
   5  * purpose with or without fee is hereby granted, provided that the above
   6  * copyright notice and this permission notice appear in all copies.
   7  *
   8  * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM
   9  * DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL
  10  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL
  11  * INTERNET SOFTWARE CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT,
  12  * INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING
  13  * FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT,
  14  * NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
  15  * WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
  16  */
  17
  18 /*
  19  * Copyright (c) 1983, 1990, 1993
  20  *    The Regents of the University of California.  All rights reserved.
  21  *
  22  * Redistribution and use in source and binary forms, with or without
  23  * modification, are permitted provided that the following conditions
  24  * are met:
  25  * 1. Redistributions of source code must retain the above copyright
  26  *    notice, this list of conditions and the following disclaimer.
  27  * 2. Redistributions in binary form must reproduce the above copyright
  28  *    notice, this list of conditions and the following disclaimer in the
  29  *    documentation and/or other materials provided with the distribution.
  30  * 3. All advertising materials mentioning features or use of this software
  31  *    must display the following acknowledgement:
  32  *      This product includes software developed by the University of
  33  *      California, Berkeley and its contributors.
  34  * 4. Neither the name of the University nor the names of its contributors
  35  *    may be used to endorse or promote products derived from this software
  36  *    without specific prior written permission.
  37  *
  38  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  39  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  40  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  41  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  42  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  43  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  44  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  45  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  46  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  47  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  48  * SUCH DAMAGE.
  49  */
  50
  51 /*
  52  * Portions Copyright (c) 1993 by Digital Equipment Corporation.
  53  *
  54  * Permission to use, copy, modify, and distribute this software for any
  55  * purpose with or without fee is hereby granted, provided that the above
  56  * copyright notice and this permission notice appear in all copies, and that
  57  * the name of Digital Equipment Corporation not be used in advertising or
  58  * publicity pertaining to distribution of the document or software without
  59  * specific, written prior permission.
  60  *
  61  * THE SOFTWARE IS PROVIDED "AS IS" AND DIGITAL EQUIPMENT CORP. DISCLAIMS ALL
  62  * WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES
  63  * OF MERCHANTABILITY AND FITNESS.   IN NO EVENT SHALL DIGITAL EQUIPMENT
  64  * CORPORATION BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
  65  * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
  66  * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
  67  * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
  68  * SOFTWARE.
  69  */
  70
  71 #if defined(LIBC_SCCS) && !defined(lint)
  72 static char sccsid[] = "@(#)inet_addr.c 8.1 (Berkeley) 6/17/93";
  73 static char rcsid[] = "$Id: lwinetaton.c,v 1.1 2004/03/15 20:35:25 as Exp $";
  74 #endif /* LIBC_SCCS and not lint */
  75
  76 #include <config.h>
  77
  78 #include <ctype.h>
  79
  80 #include <stddef.h>
  81
  82 #include <lwres/int.h>
  83 #include <lwres/net.h>
  84
  85 #include "assert_p.h"
  86
  87 /*
  88  * Check whether "cp" is a valid ascii representation
  89  * of an Internet address and convert to a binary address.
  90  * Returns 1 if the address is valid, 0 if not.
  91  * This replaces inet_addr, the return value from which
  92  * cannot distinguish between failure and a local broadcast address.
  93  */
  94 int
  95 lwres_net_aton(const char *cp, struct in_addr *addr) {
  96         unsigned long val;
  97         int base, n;
  98         unsigned char c;
  99         lwres_uint8_t parts[4];
 100         lwres_uint8_t *pp = parts;
 101         int digit;
 102
 103         REQUIRE(cp != NULL);
 104
 105         c = *cp;
 106         for (;;) {
 107                 /*
 108                  * Collect number up to ``.''.
 109                  * Values are specified as for C:
 110                  * 0x=hex, 0=octal, isdigit=decimal.
 111                  */
 112                 if (!isdigit(c & 0xff))
 113                         return (0);
 114                 val = 0;
 115                 base = 10;
 116                 digit = 0;
 117                 if (c == '0') {
 118                         c = *++cp;
 119                         if (c == 'x' || c == 'X') {
 120                                 base = 16;
 121                                 c = *++cp;
 122                         } else {
 123                                 base = 8;
 124                                 digit = 1;
 125                         }
 126                 }
 127                 for (;;) {
 128                         /*
 129                          * isascii() is valid for all integer values, and
 130                          * when it is true, c is known to be in scope
 131                          * for isdigit().  No cast necessary.  Similar
 132                          * comment applies for later ctype uses.
 133                          */
 134                         if (isascii(c) && isdigit(c)) {
 135                                 if (base == 8 && (c == '8' || c == '9'))
 136                                         return (0);
 137                                 val = (val * base) + (c - '0');
 138                                 c = *++cp;
 139                                 digit = 1;
 140                         } else if (base == 16 && isascii(c) && isxdigit(c)) {
 141                                 val = (val << 4) |
 142                                         (c + 10 - (islower(c) ? 'a' : 'A'));
 143                                 c = *++cp;
 144                                 digit = 1;
 145                         } else
 146                                 break;
 147                 }
 148                 if (c == '.') {
 149                         /*
 150                          * Internet format:
 151                          *      a.b.c.d
 152                          *      a.b.c   (with c treated as 16 bits)
 153                          *      a.b     (with b treated as 24 bits)
 154                          */
 155                         if (pp >= parts + 3 || val > 0xff)
 156                                 return (0);
 157                         *pp++ = (lwres_uint8_t)val;
 158                         c = *++cp;
 159                 } else
 160                         break;
 161         }
 162         /*
 163          * Check for trailing characters.
 164          */
 165         if (c != '\0' && (!isascii(c) || !isspace(c)))
 166                 return (0);
 167         /*
 168          * Did we get a valid digit?
 169          */
 170         if (!digit)
 171                 return (0);
 172         /*
 173          * Concoct the address according to
 174          * the number of parts specified.
 175          */
 176         n = pp - parts + 1;
 177         switch (n) {
 178         case 1:                         /* a -- 32 bits */
 179                 break;
 180
 181         case 2:                         /* a.b -- 8.24 bits */
 182                 if (val > 0xffffff)
 183                         return (0);
 184                 val |= parts[0] << 24;
 185                 break;
 186
 187         case 3:                         /* a.b.c -- 8.8.16 bits */
 188                 if (val > 0xffff)
 189                         return (0);
 190                 val |= (parts[0] << 24) | (parts[1] << 16);
 191                 break;
 192
 193         case 4:                         /* a.b.c.d -- 8.8.8.8 bits */
 194                 if (val > 0xff)
 195                         return (0);
 196                 val |= (parts[0] << 24) | (parts[1] << 16) | (parts[2] << 8);
 197                 break;
 198         }
 199         if (addr != NULL)
 200                 addr->s_addr = htonl(val);
 201
 202         return (1);
 203 }