net/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 #include <errno.h>
  61
  62 /*
  63  * Ascii internet address interpretation routine.
  64  * The value returned is in network order.
  65  */
  66 u_long
  67 inet_addr(cp)
  68         register const char *cp;
  69 {
  70         struct in_addr val;
  71
  72         if (inet_aton(cp, &val))
  73                 return (val.s_addr);
  74         return (INADDR_NONE);
  75 }
  76
  77 /*
  78  * Check whether "cp" is a valid ascii representation
  79  * of an Internet address and convert to a binary address.
  80  * Returns 1 if the address is valid, 0 if not.
  81  * This replaces inet_addr, the return value from which
  82  * cannot distinguish between failure and a local broadcast address.
  83  */
  84 int
  85 inet_aton(cp, addr)
  86         register const char *cp;
  87         struct in_addr *addr;
  88 {
  89         u_long parts[4];
  90         u_int32_t val;
  91         char *c;
  92         char *endptr;
  93         int gotend, n;
  94
  95         c = (char *)cp;
  96         n = 0;
  97         /*
  98          * Run through the string, grabbing numbers until
  99          * the end of the string, or some error
 100          */
 101         gotend = 0;
 102         while (!gotend) {
 103                 errno = 0;
 104                 val = strtoul(c, &endptr, 0);
 105
 106                 if (errno == ERANGE)    /* Fail completely if it overflowed. */
 107                         return (0);
 108
 109                 /*
 110                  * If the whole string is invalid, endptr will equal
 111                  * c.. this way we can make sure someone hasn't
 112                  * gone '.12' or something which would get past
 113                  * the next check.
 114                  */
 115                 if (endptr == c)
 116                         return (0);
 117                 parts[n] = val;
 118                 c = endptr;
 119
 120                 /* Check the next character past the previous number's end */
 121                 switch (*c) {
 122                 case '.' :
 123                         /* Make sure we only do 3 dots .. */
 124                         if (n == 3)     /* Whoops. Quit. */
 125                                 return (0);
 126                         n++;
 127                         c++;
 128                         break;
 129
 130                 case '\0':
 131                         gotend = 1;
 132                         break;
 133
 134                 default:
 135                         if (isspace((unsigned char)*c)) {
 136                                 gotend = 1;
 137                                 break;
 138                         } else
 139                                 return (0);     /* Invalid character, so fail */
 140                 }
 141
 142         }
 143
 144         /*
 145          * Concoct the address according to
 146          * the number of parts specified.
 147          */
 148
 149         switch (n) {
 150         case 0:                         /* a -- 32 bits */
 151                 /*
 152                  * Nothing is necessary here.  Overflow checking was
 153                  * already done in strtoul().
 154                  */
 155                 break;
 156         case 1:                         /* a.b -- 8.24 bits */
 157                 if (val > 0xffffff || parts[0] > 0xff)
 158                         return (0);
 159                 val |= parts[0] << 24;
 160                 break;
 161
 162         case 2:                         /* a.b.c -- 8.8.16 bits */
 163                 if (val > 0xffff || parts[0] > 0xff || parts[1] > 0xff)
 164                         return (0);
 165                 val |= (parts[0] << 24) | (parts[1] << 16);
 166                 break;
 167
 168         case 3:                         /* a.b.c.d -- 8.8.8.8 bits */
 169                 if (val > 0xff || parts[0] > 0xff || parts[1] > 0xff ||
 170                     parts[2] > 0xff)
 171                         return (0);
 172                 val |= (parts[0] << 24) | (parts[1] << 16) | (parts[2] << 8);
 173                 break;
 174         }
 175
 176         if (addr != NULL)
 177                 addr->s_addr = htonl(val);
 178         return (1);
 179 }