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 #endif /* LIBC_SCCS and not lint */ 48 #include <sys/cdefs.h> 49 __FBSDID("$FreeBSD$"); 50 51 #include <sys/types.h> 52 #include <sys/socket.h> 53 #include <netinet/in.h> 54 #include <arpa/inet.h> 55 #include <arpa/nameser.h> 56 #include <netdb.h> 57 #include <stdio.h> 58 #include <string.h> 59 #include <stdarg.h> 60 #include <nsswitch.h> 61 62 #define MAXALIASES 35 63 64 static FILE *netf; 65 static char line[BUFSIZ+1]; 66 static struct netent net; 67 static char *net_aliases[MAXALIASES]; 68 static int _net_stayopen; 69 70 void 71 _setnethtent(f) 72 int f; 73 { 74 75 if (netf == NULL) 76 netf = fopen(_PATH_NETWORKS, "r" ); 77 else 78 rewind(netf); 79 _net_stayopen |= f; 80 } 81 82 void 83 _endnethtent() 84 { 85 86 if (netf) { 87 fclose(netf); 88 netf = NULL; 89 } 90 _net_stayopen = 0; 91 } 92 93 struct netent * 94 getnetent() 95 { 96 char *p; 97 char *cp, **q; 98 99 if (netf == NULL && (netf = fopen(_PATH_NETWORKS, "r" )) == NULL) 100 return (NULL); 101 again: 102 p = fgets(line, sizeof line, netf); 103 if (p == NULL) 104 return (NULL); 105 if (*p == '#') 106 goto again; 107 cp = strpbrk(p, "#\n"); 108 if (cp != NULL) 109 *cp = '\0'; 110 net.n_name = p; 111 cp = strpbrk(p, " \t"); 112 if (cp == NULL) 113 goto again; 114 *cp++ = '\0'; 115 while (*cp == ' ' || *cp == '\t') 116 cp++; 117 p = strpbrk(cp, " \t"); 118 if (p != NULL) 119 *p++ = '\0'; 120 net.n_net = inet_network(cp); 121 net.n_addrtype = AF_INET; 122 q = net.n_aliases = net_aliases; 123 if (p != NULL) 124 cp = p; 125 while (cp && *cp) { 126 if (*cp == ' ' || *cp == '\t') { 127 cp++; 128 continue; 129 } 130 if (q < &net_aliases[MAXALIASES - 1]) 131 *q++ = cp; 132 cp = strpbrk(cp, " \t"); 133 if (cp != NULL) 134 *cp++ = '\0'; 135 } 136 *q = NULL; 137 return (&net); 138 } 139 140 int 141 _ht_getnetbyname(void *rval, void *cb_data, va_list ap) 142 { 143 const char *name; 144 struct netent *p; 145 char **cp; 146 147 name = va_arg(ap, const char *); 148 149 setnetent(_net_stayopen); 150 while ( (p = getnetent()) ) { 151 if (strcasecmp(p->n_name, name) == 0) 152 break; 153 for (cp = p->n_aliases; *cp != 0; cp++) 154 if (strcasecmp(*cp, name) == 0) 155 goto found; 156 } 157 found: 158 if (!_net_stayopen) 159 endnetent(); 160 *(struct netent **)rval = p; 161 return (p != NULL) ? NS_SUCCESS : NS_NOTFOUND; 162 } 163 164 int 165 _ht_getnetbyaddr(void *rval, void *cb_data, va_list ap) 166 { 167 unsigned long net; 168 int type; 169 struct netent *p; 170 171 net = va_arg(ap, unsigned long); 172 type = va_arg(ap, int); 173 174 setnetent(_net_stayopen); 175 while ( (p = getnetent()) ) 176 if (p->n_addrtype == type && p->n_net == net) 177 break; 178 if (!_net_stayopen) 179 endnetent(); 180 *(struct netent **)rval = p; 181 return (p != NULL) ? NS_SUCCESS : NS_NOTFOUND; 182 } 183