4 * Copyright (c) 1989, 1993, 1995
5 * The Regents of the University of California. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the University of
18 * California, Berkeley and its contributors.
19 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * Copyright (c) 2004 by Internet Systems Consortium, Inc. ("ISC")
38 * Portions Copyright (c) 1996,1999 by Internet Software Consortium.
40 * Permission to use, copy, modify, and distribute this software for any
41 * purpose with or without fee is hereby granted, provided that the above
42 * copyright notice and this permission notice appear in all copies.
44 * THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES
45 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
46 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR
47 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
48 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
49 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
50 * OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
53 #if defined(LIBC_SCCS) && !defined(lint)
54 static const char rcsid
[] = "Id: lcl_pr.c,v 1.4 2006/03/09 23:57:56 marka Exp";
55 #endif /* LIBC_SCCS and not lint */
59 #include "port_before.h"
61 #include <sys/types.h>
62 #include <netinet/in.h>
63 #include <arpa/nameser.h>
73 #include <isc/memcluster.h>
75 #include "port_after.h"
80 #ifndef _PATH_PROTOCOLS
81 #define _PATH_PROTOCOLS "/etc/protocols"
91 struct protoent proto
;
92 char * proto_aliases
[MAXALIASES
];
97 static void pr_close(struct irs_pr
*);
98 static struct protoent
* pr_next(struct irs_pr
*);
99 static struct protoent
* pr_byname(struct irs_pr
*, const char *);
100 static struct protoent
* pr_bynumber(struct irs_pr
*, int);
101 static void pr_rewind(struct irs_pr
*);
102 static void pr_minimize(struct irs_pr
*);
113 irs_lcl_pr(struct irs_acc
*this) {
117 if (!(pr
= memget(sizeof *pr
))) {
121 if (!(pvt
= memget(sizeof *pvt
))) {
122 memput(pr
, sizeof *this);
126 memset(pvt
, 0, sizeof *pvt
);
128 pr
->close
= pr_close
;
129 pr
->byname
= pr_byname
;
130 pr
->bynumber
= pr_bynumber
;
132 pr
->rewind
= pr_rewind
;
133 pr
->minimize
= pr_minimize
;
142 pr_close(struct irs_pr
*this) {
143 struct pvt
*pvt
= (struct pvt
*)this->private;
146 (void) fclose(pvt
->fp
);
149 memput(pvt
, sizeof *pvt
);
150 memput(this, sizeof *this);
153 static struct protoent
*
154 pr_byname(struct irs_pr
*this, const char *name
) {
160 while ((p
= pr_next(this))) {
161 if (!strcmp(p
->p_name
, name
))
163 for (cp
= p
->p_aliases
; *cp
; cp
++)
164 if (!strcmp(*cp
, name
))
171 static struct protoent
*
172 pr_bynumber(struct irs_pr
*this, int proto
) {
176 while ((p
= pr_next(this)))
177 if (p
->p_proto
== proto
)
183 pr_rewind(struct irs_pr
*this) {
184 struct pvt
*pvt
= (struct pvt
*)this->private;
187 if (fseek(pvt
->fp
, 0L, SEEK_SET
) == 0)
189 (void)fclose(pvt
->fp
);
191 if (!(pvt
->fp
= fopen(_PATH_PROTOCOLS
, "r" )))
193 if (fcntl(fileno(pvt
->fp
), F_SETFD
, 1) < 0) {
194 (void)fclose(pvt
->fp
);
199 static struct protoent
*
200 pr_next(struct irs_pr
*this) {
201 struct pvt
*pvt
= (struct pvt
*)this->private;
203 char *bufp
, *ndbuf
, *dbuf
= NULL
;
204 int c
, bufsiz
, offset
;
218 if ((p
= fgets(bufp
+ offset
, bufsiz
- offset
, pvt
->fp
)) == NULL
) {
223 if (!strchr(p
, '\n') && !feof(pvt
->fp
)) {
225 /* allocate space for longer line */
227 if ((ndbuf
= malloc(bufsiz
+ GROWBUF
)) != NULL
)
230 ndbuf
= realloc(dbuf
, bufsiz
+ GROWBUF
);
235 offset
= strlen(dbuf
);
237 /* allocation failed; skip this long line */
238 while ((c
= getc(pvt
->fp
)) != EOF
)
252 cp
= strpbrk(p
, "#\n");
255 pvt
->proto
.p_name
= p
;
256 cp
= strpbrk(p
, " \t");
260 while (*cp
== ' ' || *cp
== '\t')
262 p
= strpbrk(cp
, " \t");
265 pvt
->proto
.p_proto
= atoi(cp
);
266 q
= pvt
->proto
.p_aliases
= pvt
->proto_aliases
;
270 if (*cp
== ' ' || *cp
== '\t') {
274 if (q
< &pvt
->proto_aliases
[MAXALIASES
- 1])
276 cp
= strpbrk(cp
, " \t");
283 return (&pvt
->proto
);
287 pr_minimize(struct irs_pr
*this) {
288 struct pvt
*pvt
= (struct pvt
*)this->private;
290 if (pvt
->fp
!= NULL
) {
291 (void)fclose(pvt
->fp
);