2 * Copyright (c) 1989, 1993, 1995
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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
35 * Copyright (c) 2004 by Internet Systems Consortium, Inc. ("ISC")
36 * Portions Copyright (c) 1996,1999 by Internet Software Consortium.
38 * Permission to use, copy, modify, and distribute this software for any
39 * purpose with or without fee is hereby granted, provided that the above
40 * copyright notice and this permission notice appear in all copies.
42 * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES
43 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
44 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR
45 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
46 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
47 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
48 * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
51 #include "port_before.h"
53 #include <sys/types.h>
54 #include <netinet/in.h>
55 #include <arpa/nameser.h>
65 #include <isc/memcluster.h>
67 #include "port_after.h"
72 #ifndef _PATH_PROTOCOLS
73 #define _PATH_PROTOCOLS "/etc/protocols"
83 struct protoent proto
;
84 char * proto_aliases
[MAXALIASES
];
89 static void pr_close(struct irs_pr
*);
90 static struct protoent
* pr_next(struct irs_pr
*);
91 static struct protoent
* pr_byname(struct irs_pr
*, const char *);
92 static struct protoent
* pr_bynumber(struct irs_pr
*, int);
93 static void pr_rewind(struct irs_pr
*);
94 static void pr_minimize(struct irs_pr
*);
105 irs_lcl_pr(struct irs_acc
*this) {
109 if (!(pr
= memget(sizeof *pr
))) {
113 if (!(pvt
= memget(sizeof *pvt
))) {
114 memput(pr
, sizeof *this);
118 memset(pvt
, 0, sizeof *pvt
);
120 pr
->close
= pr_close
;
121 pr
->byname
= pr_byname
;
122 pr
->bynumber
= pr_bynumber
;
124 pr
->rewind
= pr_rewind
;
125 pr
->minimize
= pr_minimize
;
134 pr_close(struct irs_pr
*this) {
135 struct pvt
*pvt
= (struct pvt
*)this->private;
138 (void) fclose(pvt
->fp
);
141 memput(pvt
, sizeof *pvt
);
142 memput(this, sizeof *this);
145 static struct protoent
*
146 pr_byname(struct irs_pr
*this, const char *name
) {
152 while ((p
= pr_next(this))) {
153 if (!strcmp(p
->p_name
, name
))
155 for (cp
= p
->p_aliases
; *cp
; cp
++)
156 if (!strcmp(*cp
, name
))
163 static struct protoent
*
164 pr_bynumber(struct irs_pr
*this, int proto
) {
168 while ((p
= pr_next(this)))
169 if (p
->p_proto
== proto
)
175 pr_rewind(struct irs_pr
*this) {
176 struct pvt
*pvt
= (struct pvt
*)this->private;
179 if (fseek(pvt
->fp
, 0L, SEEK_SET
) == 0)
181 (void)fclose(pvt
->fp
);
183 if (!(pvt
->fp
= fopen(_PATH_PROTOCOLS
, "r" )))
185 if (fcntl(fileno(pvt
->fp
), F_SETFD
, 1) < 0) {
186 (void)fclose(pvt
->fp
);
191 static struct protoent
*
192 pr_next(struct irs_pr
*this) {
193 struct pvt
*pvt
= (struct pvt
*)this->private;
195 char *bufp
, *ndbuf
, *dbuf
= NULL
;
196 int c
, bufsiz
, offset
;
210 if ((p
= fgets(bufp
+ offset
, bufsiz
- offset
, pvt
->fp
)) == NULL
) {
215 if (!strchr(p
, '\n') && !feof(pvt
->fp
)) {
217 /* allocate space for longer line */
219 if ((ndbuf
= malloc(bufsiz
+ GROWBUF
)) != NULL
)
222 ndbuf
= realloc(dbuf
, bufsiz
+ GROWBUF
);
227 offset
= strlen(dbuf
);
229 /* allocation failed; skip this long line */
230 while ((c
= getc(pvt
->fp
)) != EOF
)
244 cp
= strpbrk(p
, "#\n");
247 pvt
->proto
.p_name
= p
;
248 cp
= strpbrk(p
, " \t");
252 while (*cp
== ' ' || *cp
== '\t')
254 p
= strpbrk(cp
, " \t");
257 pvt
->proto
.p_proto
= atoi(cp
);
258 q
= pvt
->proto
.p_aliases
= pvt
->proto_aliases
;
262 if (*cp
== ' ' || *cp
== '\t') {
266 if (q
< &pvt
->proto_aliases
[MAXALIASES
- 1])
268 cp
= strpbrk(cp
, " \t");
275 return (&pvt
->proto
);
279 pr_minimize(struct irs_pr
*this) {
280 struct pvt
*pvt
= (struct pvt
*)this->private;
282 if (pvt
->fp
!= NULL
) {
283 (void)fclose(pvt
->fp
);