net.subproj/inet_addr.c

   1 /*
   2  * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
   3  *
   4  * @APPLE_LICENSE_HEADER_START@
   5  *
   6  * The contents of this file constitute Original Code as defined in and
   7  * are subject to the Apple Public Source License Version 1.1 (the
   8  * "License").  You may not use this file except in compliance with the
   9  * License.  Please obtain a copy of the License at
  10  * http://www.apple.com/publicsource and read it before using this file.
  11  *
  12  * This Original Code and all software distributed under the License are
  13  * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
  14  * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
  15  * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
  16  * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT.  Please see the
  17  * License for the specific language governing rights and limitations
  18  * under the License.
  19  *
  20  * @APPLE_LICENSE_HEADER_END@
  21  */
  22 /*
  23  * Copyright (c) 1983, 1990, 1993
  24  *      The Regents of the University of California.  All rights reserved.
  25  *
  26  * Redistribution and use in source and binary forms, with or without
  27  * modification, are permitted provided that the following conditions
  28  * are met:
  29  * 1. Redistributions of source code must retain the above copyright
  30  *    notice, this list of conditions and the following disclaimer.
  31  * 2. Redistributions in binary form must reproduce the above copyright
  32  *    notice, this list of conditions and the following disclaimer in the
  33  *    documentation and/or other materials provided with the distribution.
  34  * 3. All advertising materials mentioning features or use of this software
  35  *    must display the following acknowledgement:
  36  *      This product includes software developed by the University of
  37  *      California, Berkeley and its contributors.
  38  * 4. Neither the name of the University nor the names of its contributors
  39  *    may be used to endorse or promote products derived from this software
  40  *    without specific prior written permission.
  41  *
  42  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  43  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  44  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  45  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  46  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  47  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  48  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  49  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  50  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  51  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  52  * SUCH DAMAGE.
  53  */
  54
  55
  56 #include <sys/param.h>
  57 #include <netinet/in.h>
  58 #include <arpa/inet.h>
  59 #include <ctype.h>
  60
  61 /*
  62  * Ascii internet address interpretation routine.
  63  * The value returned is in network order.
  64  */
  65 u_long
  66 inet_addr(cp)
  67         register const char *cp;
  68 {
  69         struct in_addr val;
  70
  71         if (inet_aton(cp, &val))
  72                 return (val.s_addr);
  73         return (INADDR_NONE);
  74 }
  75
  76 /*
  77  * Check whether "cp" is a valid ascii representation
  78  * of an Internet address and convert to a binary address.
  79  * Returns 1 if the address is valid, 0 if not.
  80  * This replaces inet_addr, the return value from which
  81  * cannot distinguish between failure and a local broadcast address.
  82  */
  83 int
  84 inet_aton(cp, addr)
  85         register const char *cp;
  86         struct in_addr *addr;
  87 {
  88         register u_long val;
  89         register int base, n;
  90         register char c;
  91         u_int parts[4];
  92         register u_int *pp = parts;
  93
  94         for (;;) {
  95                 /*
  96                  * Collect number up to ``.''.
  97                  * Values are specified as for C:
  98                  * 0x=hex, 0=octal, other=decimal.
  99                  */
 100                 val = 0; base = 10;
 101                 if (*cp == '0') {
 102                         if (*++cp == 'x' || *cp == 'X')
 103                                 base = 16, cp++;
 104                         else
 105                                 base = 8;
 106                 }
 107                 while ((c = *cp) != '\0') {
 108                         if (isascii(c) && isdigit(c)) {
 109                                 val = (val * base) + (c - '0');
 110                                 cp++;
 111                                 continue;
 112                         }
 113                         if (base == 16 && isascii(c) && isxdigit(c)) {
 114                                 val = (val << 4) +
 115                                         (c + 10 - (islower(c) ? 'a' : 'A'));
 116                                 cp++;
 117                                 continue;
 118                         }
 119                         break;
 120                 }
 121                 if (*cp == '.') {
 122                         /*
 123                          * Internet format:
 124                          *      a.b.c.d
 125                          *      a.b.c   (with c treated as 16-bits)
 126                          *      a.b     (with b treated as 24 bits)
 127                          */
 128                         if (pp >= parts + 3 || val > 0xff)
 129                                 return (0);
 130                         *pp++ = val, cp++;
 131                 } else
 132                         break;
 133         }
 134         /*
 135          * Check for trailing characters.
 136          */
 137         if (*cp && (!isascii(*cp) || !isspace(*cp)))
 138                 return (0);
 139         /*
 140          * Concoct the address according to
 141          * the number of parts specified.
 142          */
 143         n = pp - parts + 1;
 144         switch (n) {
 145
 146         case 1:                         /* a -- 32 bits */
 147                 break;
 148
 149         case 2:                         /* a.b -- 8.24 bits */
 150                 if (val > 0xffffff)
 151                         return (0);
 152                 val |= parts[0] << 24;
 153                 break;
 154
 155         case 3:                         /* a.b.c -- 8.8.16 bits */
 156                 if (val > 0xffff)
 157                         return (0);
 158                 val |= (parts[0] << 24) | (parts[1] << 16);
 159                 break;
 160
 161         case 4:                         /* a.b.c.d -- 8.8.8.8 bits */
 162                 if (val > 0xff)
 163                         return (0);
 164                 val |= (parts[0] << 24) | (parts[1] << 16) | (parts[2] << 8);
 165                 break;
 166         }
 167         if (addr)
 168                 addr->s_addr = htonl(val);
 169         return (1);
 170 }