2 * Copyright (c) 1992, 1993
3 * The Regents of the University of California. All rights reserved.
6 * This code is derived from software donated to Berkeley by
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by the University of
20 * California, Berkeley and its contributors.
21 * 4. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * @(#)conf.c 8.2 (Berkeley) 3/27/94
41 static const char rcsid[] =
52 #include <sys/types.h>
53 #include <sys/param.h>
54 #include <sys/syslog.h>
58 #define ALLOC(ty) (xmalloc(sizeof(ty)))
60 typedef struct path path;
62 qelem p_q; /* 2-way linked list */
63 int p_lno; /* Line number of this record */
64 char *p_args; /* copy of arg string (malloc) */
65 char *p_key; /* Pathname to match (also p_argv[0]) */
66 regex_t p_rx; /* RE to match against pathname () */
67 int p_rxvalid; /* non-zero if valid regular expression */
68 int p_argc; /* number of elements in arg string */
69 char **p_argv; /* argv[] pointers into arg string (malloc) */
72 static char *conf_file; /* XXX for regerror */
73 static path *curp; /* XXX for regerror */
76 * Add an element to a 2-way list,
79 static void ins_que(elem, pred)
82 qelem *p = pred->q_forw;
90 * Remove an element from a 2-way list
92 static void rem_que(elem)
95 qelem *p = elem->q_forw;
96 qelem *p2 = elem->q_back;
102 * Error checking malloc
104 static void *xmalloc(siz)
107 void *p = malloc(siz);
110 syslog(LOG_ALERT, "malloc: failed to get %d bytes", siz);
115 * Insert the path in the list.
116 * If there is already an element with the same key then
117 * the *second* one is ignored (return 0). If the key is
118 * not found then the path is added to the end of the list
121 static int pinsert(p0, q0)
130 for (q = q0->q_forw; q != q0; q = q->q_forw) {
131 path *p = (path *) q;
132 if (strcmp(p->p_key, p0->p_key) == 0)
135 ins_que(&p0->p_q, q0->q_back);
140 static path *palloc(cline, lno)
151 * Implement comment chars
153 s = strchr(cline, '#');
158 * Do a pass through the string to count the number
163 for (s = key; s != NULL; ) {
165 while ((val = strsep(&s, " \t\n")) != NULL && *val == '\0')
177 * Now do another pass and generate a new path structure
181 p->p_argv = xmalloc(c * sizeof(char *));
182 p->p_args = strdup(cline);
184 for (s = p->p_args; s != NULL; ) {
186 while ((val = strsep(&s, " \t\n")) != NULL && *val == '\0')
196 for (c = 0; c < p->p_argc; c++)
197 printf("%sv[%d] = %s\n", c?"\t":"", c, p->p_argv[c]);
200 p->p_key = p->p_argv[0];
201 if (strpbrk(p->p_key, RE_CHARS)) {
205 val = regcomp(&p->p_rx, p->p_key, REG_EXTENDED | REG_NOSUB);
207 char errbuf[_POSIX2_LINE_MAX];
208 regerror(val, &p->p_rx, errbuf, sizeof errbuf);
209 syslog(LOG_ERR, "%s:%d: regcomp %s: %s",
210 conf_file, curp->p_lno, curp->p_key, errbuf);
226 * Free a path structure
235 free((char *) p->p_argv);
240 * Discard all currently held path structures on q0.
241 * and add all the ones on xq.
243 static void preplace(q0, xq)
248 * While the list is not empty,
249 * take the first element off the list
252 while (q0->q_forw != q0) {
253 qelem *q = q0->q_forw;
257 while (xq->q_forw != xq) {
258 qelem *q = xq->q_forw;
265 * Read the lines from the configuration file and
266 * add them to the list of paths.
268 static void readfp(q0, fp)
272 char cline[LINE_MAX];
277 * Make a new empty list.
279 q.q_forw = q.q_back = &q;
282 * Read the lines from the configuration file.
284 while (fgets(cline, sizeof(cline), fp)) {
285 path *p = palloc(cline, nread+1);
286 if (p && !pinsert(p, &q))
292 * If some records were read, then throw
293 * away the old list and replace with the
301 * Read the configuration file (conf) and replace
302 * the existing path list with the new version.
303 * If the file is not readable, then no changes take place
305 void conf_read(q, conf)
309 FILE *fp = fopen(conf, "r");
311 conf_file = conf; /* XXX */
313 conf_file = 0; /* XXX */
316 syslog(LOG_ERR, "open config file \"%s\": %s", conf, strerror(errno));
321 char **conf_match(q0, key)
327 for (q = q0->q_forw; q != q0; q = q->q_forw) {
328 path *p = (path *) q;
330 if (!regexec(&p->p_rx, key, 0, 0, 0)) {
331 return p->p_argv + 1;
334 if (strncmp(p->p_key, key, strlen(p->p_key)) == 0)
335 return (p->p_argv+1);