conf.c revision 1.2 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1992, 1993
3 1.1 cgd * The Regents of the University of California. All rights reserved.
4 1.1 cgd * All rights reserved.
5 1.1 cgd *
6 1.1 cgd * This code is derived from software donated to Berkeley by
7 1.1 cgd * Jan-Simon Pendry.
8 1.1 cgd *
9 1.1 cgd * Redistribution and use in source and binary forms, with or without
10 1.1 cgd * modification, are permitted provided that the following conditions
11 1.1 cgd * are met:
12 1.1 cgd * 1. Redistributions of source code must retain the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer.
14 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
15 1.1 cgd * notice, this list of conditions and the following disclaimer in the
16 1.1 cgd * documentation and/or other materials provided with the distribution.
17 1.1 cgd * 3. All advertising materials mentioning features or use of this software
18 1.1 cgd * must display the following acknowledgement:
19 1.1 cgd * This product includes software developed by the University of
20 1.1 cgd * California, Berkeley and its contributors.
21 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
22 1.1 cgd * may be used to endorse or promote products derived from this software
23 1.1 cgd * without specific prior written permission.
24 1.1 cgd *
25 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 1.1 cgd * SUCH DAMAGE.
36 1.1 cgd *
37 1.2 mycroft * from: Id: conf.c,v 1.2 1992/05/27 07:09:27 jsp Exp
38 1.2 mycroft * from: @(#)conf.c 8.2 (Berkeley) 3/27/94
39 1.2 mycroft * $Id: conf.c,v 1.2 1994/06/08 19:24:46 mycroft Exp $
40 1.1 cgd */
41 1.1 cgd
42 1.1 cgd #include <stdio.h>
43 1.1 cgd #include <stdlib.h>
44 1.1 cgd #include <unistd.h>
45 1.1 cgd #include <string.h>
46 1.1 cgd #include <errno.h>
47 1.1 cgd #include <limits.h>
48 1.1 cgd #include <regexp.h>
49 1.1 cgd #include <sys/types.h>
50 1.1 cgd #include <sys/param.h>
51 1.1 cgd #include <sys/syslog.h>
52 1.1 cgd
53 1.1 cgd #include "portald.h"
54 1.1 cgd
55 1.1 cgd #define ALLOC(ty) (xmalloc(sizeof(ty)))
56 1.1 cgd
57 1.1 cgd typedef struct path path;
58 1.1 cgd struct path {
59 1.1 cgd qelem p_q; /* 2-way linked list */
60 1.1 cgd int p_lno; /* Line number of this record */
61 1.1 cgd char *p_args; /* copy of arg string (malloc) */
62 1.1 cgd char *p_key; /* Pathname to match (also p_argv[0]) */
63 1.1 cgd regexp *p_re; /* RE to match against pathname (malloc) */
64 1.1 cgd int p_argc; /* number of elements in arg string */
65 1.1 cgd char **p_argv; /* argv[] pointers into arg string (malloc) */
66 1.1 cgd };
67 1.1 cgd
68 1.1 cgd static char *conf_file; /* XXX for regerror */
69 1.1 cgd static path *curp; /* XXX for regerror */
70 1.1 cgd
71 1.1 cgd /*
72 1.1 cgd * Add an element to a 2-way list,
73 1.1 cgd * just after (pred)
74 1.1 cgd */
75 1.1 cgd static void ins_que(elem, pred)
76 1.1 cgd qelem *elem, *pred;
77 1.1 cgd {
78 1.1 cgd qelem *p = pred->q_forw;
79 1.1 cgd elem->q_back = pred;
80 1.1 cgd elem->q_forw = p;
81 1.1 cgd pred->q_forw = elem;
82 1.1 cgd p->q_back = elem;
83 1.1 cgd }
84 1.1 cgd
85 1.1 cgd /*
86 1.1 cgd * Remove an element from a 2-way list
87 1.1 cgd */
88 1.1 cgd static void rem_que(elem)
89 1.1 cgd qelem *elem;
90 1.1 cgd {
91 1.1 cgd qelem *p = elem->q_forw;
92 1.1 cgd qelem *p2 = elem->q_back;
93 1.1 cgd p2->q_forw = p;
94 1.1 cgd p->q_back = p2;
95 1.1 cgd }
96 1.1 cgd
97 1.1 cgd /*
98 1.1 cgd * Error checking malloc
99 1.1 cgd */
100 1.1 cgd static void *xmalloc(siz)
101 1.1 cgd unsigned siz;
102 1.1 cgd {
103 1.1 cgd void *p = malloc(siz);
104 1.1 cgd if (p)
105 1.1 cgd return (p);
106 1.1 cgd syslog(LOG_ALERT, "malloc: failed to get %d bytes", siz);
107 1.1 cgd exit(1);
108 1.1 cgd }
109 1.1 cgd
110 1.1 cgd /*
111 1.1 cgd * Insert the path in the list.
112 1.1 cgd * If there is already an element with the same key then
113 1.1 cgd * the *second* one is ignored (return 0). If the key is
114 1.1 cgd * not found then the path is added to the end of the list
115 1.1 cgd * and 1 is returned.
116 1.1 cgd */
117 1.1 cgd static int pinsert(p0, q0)
118 1.1 cgd path *p0;
119 1.1 cgd qelem *q0;
120 1.1 cgd {
121 1.1 cgd qelem *q;
122 1.1 cgd
123 1.1 cgd if (p0->p_argc == 0)
124 1.1 cgd return (0);
125 1.1 cgd
126 1.1 cgd for (q = q0->q_forw; q != q0; q = q->q_forw) {
127 1.1 cgd path *p = (path *) q;
128 1.1 cgd if (strcmp(p->p_key, p0->p_key) == 0)
129 1.1 cgd return (0);
130 1.1 cgd }
131 1.1 cgd ins_que(&p0->p_q, q0->q_back);
132 1.1 cgd return (1);
133 1.1 cgd
134 1.1 cgd }
135 1.1 cgd
136 1.1 cgd void regerror(s)
137 1.1 cgd const char *s;
138 1.1 cgd {
139 1.1 cgd syslog(LOG_ERR, "%s:%s: regcomp %s: %s",
140 1.1 cgd conf_file, curp->p_lno, curp->p_key, s);
141 1.1 cgd }
142 1.1 cgd
143 1.1 cgd static path *palloc(cline, lno)
144 1.1 cgd char *cline;
145 1.1 cgd int lno;
146 1.1 cgd {
147 1.1 cgd int c;
148 1.1 cgd char *s;
149 1.1 cgd char *key;
150 1.1 cgd path *p;
151 1.1 cgd char **ap;
152 1.1 cgd
153 1.1 cgd /*
154 1.1 cgd * Implement comment chars
155 1.1 cgd */
156 1.1 cgd s = strchr(cline, '#');
157 1.1 cgd if (s)
158 1.1 cgd *s = 0;
159 1.1 cgd
160 1.1 cgd /*
161 1.1 cgd * Do a pass through the string to count the number
162 1.1 cgd * of arguments
163 1.1 cgd */
164 1.1 cgd c = 0;
165 1.1 cgd key = strdup(cline);
166 1.1 cgd for (s = key; s != NULL; ) {
167 1.1 cgd char *val;
168 1.1 cgd while ((val = strsep(&s, " \t\n")) != NULL && *val == '\0')
169 1.1 cgd ;
170 1.1 cgd if (val)
171 1.1 cgd c++;
172 1.1 cgd }
173 1.1 cgd c++;
174 1.1 cgd free(key);
175 1.1 cgd
176 1.1 cgd if (c <= 1)
177 1.1 cgd return (0);
178 1.1 cgd
179 1.1 cgd /*
180 1.1 cgd * Now do another pass and generate a new path structure
181 1.1 cgd */
182 1.1 cgd p = ALLOC(path);
183 1.1 cgd p->p_argc = 0;
184 1.1 cgd p->p_argv = xmalloc(c * sizeof(char *));
185 1.1 cgd p->p_args = strdup(cline);
186 1.1 cgd ap = p->p_argv;
187 1.1 cgd for (s = p->p_args; s != NULL; ) {
188 1.1 cgd char *val;
189 1.1 cgd while ((val = strsep(&s, " \t\n")) != NULL && *val == '\0')
190 1.1 cgd ;
191 1.1 cgd if (val) {
192 1.1 cgd *ap++ = val;
193 1.1 cgd p->p_argc++;
194 1.1 cgd }
195 1.1 cgd }
196 1.1 cgd *ap = 0;
197 1.1 cgd
198 1.1 cgd #ifdef DEBUG
199 1.1 cgd for (c = 0; c < p->p_argc; c++)
200 1.1 cgd printf("%sv[%d] = %s\n", c?"\t":"", c, p->p_argv[c]);
201 1.1 cgd #endif
202 1.1 cgd
203 1.1 cgd p->p_key = p->p_argv[0];
204 1.1 cgd if (strpbrk(p->p_key, RE_CHARS)) {
205 1.1 cgd curp = p; /* XXX */
206 1.1 cgd p->p_re = regcomp(p->p_key);
207 1.1 cgd curp = 0; /* XXX */
208 1.1 cgd } else {
209 1.1 cgd p->p_re = 0;
210 1.1 cgd }
211 1.1 cgd p->p_lno = lno;
212 1.1 cgd
213 1.1 cgd return (p);
214 1.1 cgd }
215 1.1 cgd
216 1.1 cgd /*
217 1.1 cgd * Free a path structure
218 1.1 cgd */
219 1.1 cgd static void pfree(p)
220 1.1 cgd path *p;
221 1.1 cgd {
222 1.1 cgd free(p->p_args);
223 1.1 cgd if (p->p_re)
224 1.1 cgd free((char *) p->p_re);
225 1.1 cgd free((char *) p->p_argv);
226 1.1 cgd free((char *) p);
227 1.1 cgd }
228 1.1 cgd
229 1.1 cgd /*
230 1.1 cgd * Discard all currently held path structures on q0.
231 1.1 cgd * and add all the ones on xq.
232 1.1 cgd */
233 1.1 cgd static void preplace(q0, xq)
234 1.1 cgd qelem *q0;
235 1.1 cgd qelem *xq;
236 1.1 cgd {
237 1.1 cgd /*
238 1.1 cgd * While the list is not empty,
239 1.1 cgd * take the first element off the list
240 1.1 cgd * and free it.
241 1.1 cgd */
242 1.1 cgd while (q0->q_forw != q0) {
243 1.2 mycroft qelem *q = q0->q_forw;
244 1.1 cgd rem_que(q);
245 1.1 cgd pfree((path *) q);
246 1.1 cgd }
247 1.1 cgd while (xq->q_forw != xq) {
248 1.1 cgd qelem *q = xq->q_forw;
249 1.1 cgd rem_que(q);
250 1.1 cgd ins_que(q, q0);
251 1.1 cgd }
252 1.1 cgd }
253 1.1 cgd
254 1.1 cgd /*
255 1.1 cgd * Read the lines from the configuration file and
256 1.1 cgd * add them to the list of paths.
257 1.1 cgd */
258 1.1 cgd static void readfp(q0, fp)
259 1.1 cgd qelem *q0;
260 1.1 cgd FILE *fp;
261 1.1 cgd {
262 1.1 cgd char cline[LINE_MAX];
263 1.1 cgd int nread = 0;
264 1.1 cgd qelem q;
265 1.1 cgd
266 1.1 cgd /*
267 1.1 cgd * Make a new empty list.
268 1.1 cgd */
269 1.1 cgd q.q_forw = q.q_back = &q;
270 1.1 cgd
271 1.1 cgd /*
272 1.1 cgd * Read the lines from the configuration file.
273 1.1 cgd */
274 1.1 cgd while (fgets(cline, sizeof(cline), fp)) {
275 1.1 cgd path *p = palloc(cline, nread+1);
276 1.1 cgd if (p && !pinsert(p, &q))
277 1.1 cgd pfree(p);
278 1.1 cgd nread++;
279 1.1 cgd }
280 1.1 cgd
281 1.1 cgd /*
282 1.1 cgd * If some records were read, then throw
283 1.1 cgd * away the old list and replace with the
284 1.1 cgd * new one.
285 1.1 cgd */
286 1.1 cgd if (nread)
287 1.1 cgd preplace(q0, &q);
288 1.1 cgd }
289 1.1 cgd
290 1.1 cgd /*
291 1.1 cgd * Read the configuration file (conf) and replace
292 1.1 cgd * the existing path list with the new version.
293 1.1 cgd * If the file is not readable, then no changes take place
294 1.1 cgd */
295 1.1 cgd void conf_read(q, conf)
296 1.1 cgd qelem *q;
297 1.1 cgd char *conf;
298 1.1 cgd {
299 1.1 cgd FILE *fp = fopen(conf, "r");
300 1.1 cgd if (fp) {
301 1.1 cgd conf_file = conf; /* XXX */
302 1.1 cgd readfp(q, fp);
303 1.1 cgd conf_file = 0; /* XXX */
304 1.1 cgd (void) fclose(fp);
305 1.1 cgd } else {
306 1.1 cgd syslog(LOG_ERR, "open config file \"%s\": %s", conf, strerror(errno));
307 1.1 cgd }
308 1.1 cgd }
309 1.1 cgd
310 1.1 cgd
311 1.1 cgd char **conf_match(q0, key)
312 1.1 cgd qelem *q0;
313 1.1 cgd char *key;
314 1.1 cgd {
315 1.1 cgd qelem *q;
316 1.1 cgd
317 1.1 cgd for (q = q0->q_forw; q != q0; q = q->q_forw) {
318 1.1 cgd path *p = (path *) q;
319 1.1 cgd if (p->p_re) {
320 1.1 cgd if (regexec(p->p_re, key))
321 1.1 cgd return (p->p_argv+1);
322 1.1 cgd } else {
323 1.1 cgd if (strncmp(p->p_key, key, strlen(p->p_key)) == 0)
324 1.1 cgd return (p->p_argv+1);
325 1.1 cgd }
326 1.1 cgd }
327 1.1 cgd
328 1.1 cgd return (0);
329 1.1 cgd }
330