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
39 * $FreeBSD: src/sbin/mount_portal/conf.c,v 1.8 1999/08/28 00:13:35 peter Exp $
49 #include <sys/types.h>
50 #include <sys/param.h>
51 #include <sys/syslog.h>
55 #define ALLOC(ty) (xmalloc(sizeof(ty)))
57 typedef struct path path;
59 qelem p_q; /* 2-way linked list */
60 int p_lno; /* Line number of this record */
61 char *p_args; /* copy of arg string (malloc) */
62 char *p_key; /* Pathname to match (also p_argv[0]) */
63 regex_t p_rx; /* RE to match against pathname () */
64 int p_rxvalid; /* non-zero if valid regular expression */
65 int p_argc; /* number of elements in arg string */
66 char **p_argv; /* argv[] pointers into arg string (malloc) */
69 static char *conf_file; /* XXX for regerror */
70 static path *curp; /* XXX for regerror */
73 * Add an element to a 2-way list,
77 ins_que(qelem *elem, qelem *pred)
79 qelem *p = pred->q_forw;
87 * Remove an element from a 2-way list
92 qelem *p = elem->q_forw;
93 qelem *p2 = elem->q_back;
99 * Error checking malloc
102 xmalloc(unsigned siz)
104 void *p = malloc(siz);
107 syslog(LOG_ALERT, "malloc: failed to get %d bytes", siz);
112 * Insert the path in the list.
113 * If there is already an element with the same key then
114 * the *second* one is ignored (return 0). If the key is
115 * not found then the path is added to the end of the list
119 pinsert(path *p0, qelem *q0)
126 for (q = q0->q_forw; q != q0; q = q->q_forw) {
127 path *p = (path *) q;
128 if (strcmp(p->p_key, p0->p_key) == 0)
131 ins_que(&p0->p_q, q0->q_back);
137 palloc(char *cline, int lno)
146 * Implement comment chars
148 s = strchr(cline, '#');
153 * Do a pass through the string to count the number
158 for (s = key; s != NULL; ) {
160 while ((val = strsep(&s, " \t\n")) != NULL && *val == '\0')
172 * Now do another pass and generate a new path structure
176 p->p_argv = xmalloc(c * sizeof(char *));
177 p->p_args = strdup(cline);
179 for (s = p->p_args; s != NULL; ) {
181 while ((val = strsep(&s, " \t\n")) != NULL && *val == '\0')
191 for (c = 0; c < p->p_argc; c++)
192 printf("%sv[%d] = %s\n", c?"\t":"", c, p->p_argv[c]);
195 p->p_key = p->p_argv[0];
196 if (strpbrk(p->p_key, RE_CHARS)) {
200 val = regcomp(&p->p_rx, p->p_key, REG_EXTENDED | REG_NOSUB);
202 char errbuf[_POSIX2_LINE_MAX];
203 regerror(val, &p->p_rx, errbuf, sizeof errbuf);
204 syslog(LOG_ERR, "%s:%d: regcomp %s: %s",
205 conf_file, curp->p_lno, curp->p_key, errbuf);
211 curp = NULL; /* XXX */
221 * Free a path structure
230 free((char *) p->p_argv);
235 * Discard all currently held path structures on q0.
236 * and add all the ones on xq.
239 preplace(qelem *q0, qelem *xq)
242 * While the list is not empty,
243 * take the first element off the list
246 while (q0->q_forw != q0) {
247 qelem *q = q0->q_forw;
251 while (xq->q_forw != xq) {
252 qelem *q = xq->q_forw;
259 * Read the lines from the configuration file and
260 * add them to the list of paths.
263 readfp(qelem *q0, FILE *fp)
265 char cline[LINE_MAX];
270 * Make a new empty list.
272 q.q_forw = q.q_back = &q;
275 * Read the lines from the configuration file.
277 while (fgets(cline, sizeof(cline), fp)) {
278 path *p = palloc(cline, nread+1);
279 if (p && !pinsert(p, &q))
285 * If some records were read, then throw
286 * away the old list and replace with the
294 * Read the configuration file (conf) and replace
295 * the existing path list with the new version.
296 * If the file is not readable, then no changes take place
299 conf_read(qelem *q, char *conf)
301 FILE *fp = fopen(conf, "r");
303 conf_file = conf; /* XXX */
305 conf_file = NULL; /* XXX */
308 syslog(LOG_ERR, "open config file \"%s\": %s", conf, strerror(errno));
314 conf_match(qelem *q0, char *key)
318 for (q = q0->q_forw; q != q0; q = q->q_forw) {
319 path *p = (path *) q;
321 if (!regexec(&p->p_rx, key, 0, 0, 0)) {
322 return p->p_argv + 1;
325 if (strncmp(p->p_key, key, strlen(p->p_key)) == 0)
326 return (p->p_argv+1);