release/src/router/libpcap/Win32/Src/inet_net.c

   1 /*
   2  * Copyright (c) 1983, 1993
   3  *      The Regents of the University of California.  All rights reserved.
   4  * All rights reserved.
   5  *
   6  * Redistribution and use in source and binary forms, with or without
   7  * modification, are permitted provided that the following conditions
   8  * are met:
   9  * 1. Redistributions of source code must retain the above copyright
  10  *    notice, this list of conditions and the following disclaimer.
  11  * 2. Redistributions in binary form must reproduce the above copyright
  12  *    notice, this list of conditions and the following disclaimer in the
  13  *    documentation and/or other materials provided with the distribution.
  14  * 3. All advertising materials mentioning features or use of this software
  15  *    must display the following acknowledgement:
  16  *      This product includes software developed by the University of
  17  *      California, Berkeley and its contributors.
  18  * 4. Neither the name of the University nor the names of its contributors
  19  *    may be used to endorse or promote products derived from this software
  20  *    without specific prior written permission.
  21  *
  22  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  23  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  24  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  25  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  26  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  27  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  28  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  29  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  30  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  31  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  32  * SUCH DAMAGE.
  33  */
  34
  35 #if defined(LIBC_SCCS) && !defined(lint)
  36 static char sccsid[] = "@(#)inet_network.c      8.1 (Berkeley) 6/4/93";
  37 #endif /* LIBC_SCCS and not lint */
  38
  39 #include "inetprivate.h"
  40
  41 /*
  42  * Internet network address interpretation routine.
  43  * The library routines call this routine to interpret
  44  * network numbers.
  45  */
  46 u_int32_t
  47 inet_network(const char *cp)
  48 {
  49         register u_long val, base, n;
  50         register char c;
  51         u_long parts[4], *pp = parts;
  52         register int i;
  53
  54 again:
  55         /*
  56          * Collect number up to ``.''.
  57          * Values are specified as for C:
  58          * 0x=hex, 0=octal, other=decimal.
  59          */
  60         val = 0; base = 10;
  61         /*
  62          * The 4.4BSD version of this file also accepts 'x__' as a hexa
  63          * number.  I don't think this is correct.  -- Uli
  64          */
  65         if (*cp == '0') {
  66                 if (*++cp == 'x' || *cp == 'X')
  67                         base = 16, cp++;
  68                 else
  69                         base = 8;
  70         }
  71         while ((c = *cp)) {
  72                 if (isdigit(c)) {
  73                         val = (val * base) + (c - '0');
  74                         cp++;
  75                         continue;
  76                 }
  77                 if (base == 16 && isxdigit(c)) {
  78                         val = (val << 4) + (c + 10 - (islower(c) ? 'a' : 'A'));
  79                         cp++;
  80                         continue;
  81                 }
  82                 break;
  83         }
  84         if (*cp == '.') {
  85                 if (pp >= parts + 4)
  86                         return (INADDR_NONE);
  87                 *pp++ = val, cp++;
  88                 goto again;
  89         }
  90         if (*cp && !isspace(*cp))
  91                 return (INADDR_NONE);
  92         *pp++ = val;
  93         n = pp - parts;
  94         if (n > 4)
  95                 return (INADDR_NONE);
  96         for (val = 0, i = 0; i < (int)n; i++) {
  97                 val <<= 8;
  98                 val |= parts[i] & 0xff;
  99         }
 100         return (val);
 101 }