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