| Vishal Bhoj | 82c8071 | 2015-12-15 21:13:33 +0530 | [diff] [blame^] | 1 | /*
|
| 2 | * Copyright (c) 1983, 1993
|
| 3 | * The Regents of the University of California. All rights reserved.
|
| 4 | *
|
| 5 | * Redistribution and use in source and binary forms, with or without
|
| 6 | * modification, are permitted provided that the following conditions
|
| 7 | * are met:
|
| 8 | * 1. Redistributions of source code must retain the above copyright
|
| 9 | * notice, this list of conditions and the following disclaimer.
|
| 10 | * 2. Redistributions in binary form must reproduce the above copyright
|
| 11 | * notice, this list of conditions and the following disclaimer in the
|
| 12 | * documentation and/or other materials provided with the distribution.
|
| 13 | * 3. All advertising materials mentioning features or use of this software
|
| 14 | * must display the following acknowledgement:
|
| 15 | * This product includes software developed by the University of
|
| 16 | * California, Berkeley and its contributors.
|
| 17 | * 4. Neither the name of the University nor the names of its contributors
|
| 18 | * may be used to endorse or promote products derived from this software
|
| 19 | * without specific prior written permission.
|
| 20 | *
|
| 21 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
| 22 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
| 23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
| 24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
| 25 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
| 26 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
| 27 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
| 28 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
| 29 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
| 30 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
| 31 | * SUCH DAMAGE.
|
| 32 | */
|
| 33 |
|
| 34 | /* Portions Copyright (c) 1993 Carlos Leandro and Rui Salgueiro
|
| 35 | * Dep. Matematica Universidade de Coimbra, Portugal, Europe
|
| 36 | *
|
| 37 | * Permission to use, copy, modify, and distribute this software for any
|
| 38 | * purpose with or without fee is hereby granted, provided that the above
|
| 39 | * copyright notice and this permission notice appear in all copies.
|
| 40 | *
|
| 41 | * from getnetent.c 1.1 (Coimbra) 93/06/02
|
| 42 | */
|
| 43 |
|
| 44 | #if defined(LIBC_SCCS) && !defined(lint)
|
| 45 | static char sccsid[] = "@(#)getnetent.c 8.1 (Berkeley) 6/4/93";
|
| 46 | static char orig_rcsid[] = "From: Id: getnetent.c,v 8.4 1997/06/01 20:34:37 vixie Exp";
|
| 47 | static chat rcsid[] = "$Id: getnetbyht.c,v 1.1.1.1 2003/11/19 01:51:27 kyu3 Exp $";
|
| 48 | #endif /* LIBC_SCCS and not lint */
|
| 49 |
|
| 50 | #include <sys/types.h>
|
| 51 | #include <sys/socket.h>
|
| 52 | #include <netinet/in.h>
|
| 53 | #include <arpa/inet.h>
|
| 54 | #include <arpa/nameser.h>
|
| 55 | #include <netdb.h>
|
| 56 | #include <stdio.h>
|
| 57 | #include <string.h>
|
| 58 |
|
| 59 | #define MAXALIASES 35
|
| 60 |
|
| 61 | static FILE *netf;
|
| 62 | static char line[BUFSIZ+1];
|
| 63 | static struct netent net;
|
| 64 | static char *net_aliases[MAXALIASES];
|
| 65 | static int _net_stayopen;
|
| 66 |
|
| 67 | void
|
| 68 | _setnethtent(int f)
|
| 69 | {
|
| 70 |
|
| 71 | if (netf == NULL)
|
| 72 | netf = fopen(_PATH_NETWORKS, "r" );
|
| 73 | else
|
| 74 | rewind(netf);
|
| 75 | _net_stayopen |= f;
|
| 76 | }
|
| 77 |
|
| 78 | void
|
| 79 | _endnethtent()
|
| 80 | {
|
| 81 |
|
| 82 | if (netf) {
|
| 83 | fclose(netf);
|
| 84 | netf = NULL;
|
| 85 | }
|
| 86 | _net_stayopen = 0;
|
| 87 | }
|
| 88 |
|
| 89 | struct netent *
|
| 90 | getnetent()
|
| 91 | {
|
| 92 | char *p;
|
| 93 | register char *cp, **q;
|
| 94 |
|
| 95 | if (netf == NULL && (netf = fopen(_PATH_NETWORKS, "r" )) == NULL)
|
| 96 | return (NULL);
|
| 97 | again:
|
| 98 | p = fgets(line, sizeof line, netf);
|
| 99 | if (p == NULL)
|
| 100 | return (NULL);
|
| 101 | if (*p == '#')
|
| 102 | goto again;
|
| 103 | cp = strpbrk(p, "#\n");
|
| 104 | if (cp == NULL)
|
| 105 | goto again;
|
| 106 | *cp = '\0';
|
| 107 | net.n_name = p;
|
| 108 | cp = strpbrk(p, " \t");
|
| 109 | if (cp == NULL)
|
| 110 | goto again;
|
| 111 | *cp++ = '\0';
|
| 112 | while (*cp == ' ' || *cp == '\t')
|
| 113 | cp++;
|
| 114 | p = strpbrk(cp, " \t");
|
| 115 | if (p != NULL)
|
| 116 | *p++ = '\0';
|
| 117 | net.n_net = inet_network(cp);
|
| 118 | net.n_addrtype = AF_INET;
|
| 119 | q = net.n_aliases = net_aliases;
|
| 120 | if (p != NULL)
|
| 121 | cp = p;
|
| 122 | while (cp && *cp) {
|
| 123 | if (*cp == ' ' || *cp == '\t') {
|
| 124 | cp++;
|
| 125 | continue;
|
| 126 | }
|
| 127 | if (q < &net_aliases[MAXALIASES - 1])
|
| 128 | *q++ = cp;
|
| 129 | cp = strpbrk(cp, " \t");
|
| 130 | if (cp != NULL)
|
| 131 | *cp++ = '\0';
|
| 132 | }
|
| 133 | *q = NULL;
|
| 134 | return (&net);
|
| 135 | }
|
| 136 |
|
| 137 | struct netent *
|
| 138 | _getnetbyhtname(register const char *name)
|
| 139 | {
|
| 140 | register struct netent *p;
|
| 141 | register char **cp;
|
| 142 |
|
| 143 | setnetent(_net_stayopen);
|
| 144 | while ( NULL != (p = getnetent()) ) {
|
| 145 | if (strcasecmp(p->n_name, name) == 0)
|
| 146 | break;
|
| 147 | for (cp = p->n_aliases; *cp != 0; cp++)
|
| 148 | if (strcasecmp(*cp, name) == 0)
|
| 149 | goto found;
|
| 150 | }
|
| 151 | found:
|
| 152 | if (!_net_stayopen)
|
| 153 | endnetent();
|
| 154 | return (p);
|
| 155 | }
|
| 156 |
|
| 157 | struct netent *
|
| 158 | _getnetbyhtaddr(register unsigned long net, register int type)
|
| 159 | {
|
| 160 | register struct netent *p;
|
| 161 |
|
| 162 | setnetent(_net_stayopen);
|
| 163 | while ( NULL != (p = getnetent()) )
|
| 164 | if (p->n_addrtype == type && p->n_net == net)
|
| 165 | break;
|
| 166 | if (!_net_stayopen)
|
| 167 | endnetent();
|
| 168 | return (p);
|
| 169 | }
|