Back to index

glibc  2.9
inet_net.c
Go to the documentation of this file.
00001 /*
00002  * Copyright (c) 1983, 1993
00003  *     The Regents of the University of California.  All rights reserved.
00004  *
00005  * Redistribution and use in source and binary forms, with or without
00006  * modification, are permitted provided that the following conditions
00007  * are met:
00008  * 1. Redistributions of source code must retain the above copyright
00009  *    notice, this list of conditions and the following disclaimer.
00010  * 2. Redistributions in binary form must reproduce the above copyright
00011  *    notice, this list of conditions and the following disclaimer in the
00012  *    documentation and/or other materials provided with the distribution.
00013  * 4. Neither the name of the University nor the names of its contributors
00014  *    may be used to endorse or promote products derived from this software
00015  *    without specific prior written permission.
00016  *
00017  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
00018  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00019  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
00020  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
00021  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
00022  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
00023  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
00024  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
00025  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
00026  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
00027  * SUCH DAMAGE.
00028  */
00029 
00030 #if defined(LIBC_SCCS) && !defined(lint)
00031 static char sccsid[] = "@(#)inet_network.c       8.1 (Berkeley) 6/4/93";
00032 #endif /* LIBC_SCCS and not lint */
00033 
00034 #include <sys/types.h>
00035 #include <netinet/in.h>
00036 #include <arpa/inet.h>
00037 #include <ctype.h>
00038 
00039 /*
00040  * Internet network address interpretation routine.
00041  * The library routines call this routine to interpret
00042  * network numbers.
00043  */
00044 u_int32_t
00045 inet_network(cp)
00046        register const char *cp;
00047 {
00048        register u_int32_t val, base, n, i;
00049        register char c;
00050        u_int32_t parts[4], *pp = parts;
00051        int digit;
00052 
00053 again:
00054        val = 0; base = 10; digit = 0;
00055        if (*cp == '0')
00056               digit = 1, base = 8, cp++;
00057        if (*cp == 'x' || *cp == 'X')
00058               digit = 0, base = 16, cp++;
00059        while ((c = *cp) != 0) {
00060               if (isdigit(c)) {
00061                      if (base == 8 && (c == '8' || c == '9'))
00062                             return (INADDR_NONE);
00063                      val = (val * base) + (c - '0');
00064                      cp++;
00065                      digit = 1;
00066                      continue;
00067               }
00068               if (base == 16 && isxdigit(c)) {
00069                      val = (val << 4) + (tolower (c) + 10 - 'a');
00070                      cp++;
00071                      digit = 1;
00072                      continue;
00073               }
00074               break;
00075        }
00076        if (!digit)
00077               return (INADDR_NONE);
00078        if (pp >= parts + 4 || val > 0xff)
00079               return (INADDR_NONE);
00080        if (*cp == '.') {
00081               *pp++ = val, cp++;
00082               goto again;
00083        }
00084        if (*cp && !isspace(*cp))
00085               return (INADDR_NONE);
00086        if (pp >= parts + 4 || val > 0xff)
00087               return (INADDR_NONE);
00088        *pp++ = val;
00089        n = pp - parts;
00090        for (val = 0, i = 0; i < n; i++) {
00091               val <<= 8;
00092               val |= parts[i] & 0xff;
00093        }
00094        return (val);
00095 }