[ashd.git] / src / dirplex / conf.c

/*
    ashd - A Sane HTTP Daemon
    Copyright (C) 2008  Fredrik Tolf <fredrik@dolda2000.com>

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
*/

#include <stdlib.h>
#include <stdio.h>
#include <unistd.h>
#include <string.h>
#include <errno.h>
#include <fnmatch.h>
#include <sys/stat.h>

#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <utils.h>
#include <log.h>
#include <cf.h>

#include "dirplex.h"

static struct config *cflist;
struct config *gconfig, *lconfig;

static void freerule(struct rule *rule)
{
    freeca(rule->patterns);
    free(rule);
}

static void freepattern(struct pattern *pat)
{
    struct rule **rule;
    
    for(rule = pat->rules; *rule; rule++)
	freerule(*rule);
    if(pat->childnm != NULL)
	free(pat->childnm);
    freeca(pat->fchild);
    free(pat);
}

static void freeconfig(struct config *cf)
{
    struct child *ch, *nch;
    struct pattern *pat, *npat;
    
    if(cf->prev != NULL)
	cf->prev->next = cf->next;
    if(cf->next != NULL)
	cf->next->prev = cf->prev;
    if(cf == cflist)
	cflist = cf->next;
    if(cf->path != NULL)
	free(cf->path);
    for(ch = cf->children; ch != NULL; ch = nch) {
	nch = ch->next;
	freechild(ch);
    }
    for(pat = cf->patterns; pat != NULL; pat = npat) {
	npat = pat->next;
	freepattern(pat);
    }
    freeca(cf->index);
    if(cf->capture != NULL)
	free(cf->capture);
    free(cf);
}

struct child *getchild(struct config *cf, char *name)
{
    struct child *ch;
    
    for(ch = cf->children; ch; ch = ch->next) {
	if(!strcmp(ch->name, name))
	    break;
    }
    return(ch);
}

static struct rule *newrule(struct pattern *pat)
{
    int i;
    struct rule *rule;
    
    for(i = 0; pat->rules[i]; i++);
    pat->rules = srealloc(pat->rules, sizeof(*pat->rules) * (i + 2));
    rule = pat->rules[i] = szmalloc(sizeof(*rule));
    pat->rules[i + 1] = NULL;
    return(rule);
}

static struct pattern *newpattern(void)
{
    struct pattern *pat;
    
    omalloc(pat);
    pat->rules = szmalloc(sizeof(*pat->rules));
    return(pat);
}

static char **cadup(char **w)
{
    char **ret;
    int i, l;
    
    l = calen(w);
    ret = smalloc(sizeof(*ret) * (l + 1));
    for(i = 0; i < l; i++)
	ret[i] = sstrdup(w[i]);
    ret[i] = NULL;
    return(ret);
}

static struct pattern *parsepattern(struct cfstate *s)
{
    struct pattern *pat;
    struct rule *rule;
    int sl;

    if(!strcmp(s->argv[0], "match")) {
	s->expstart = 1;
	pat = newpattern();
    } else {
	return(NULL);
    }
    
    if((s->argc > 1) && !strcmp(s->argv[1], "directory"))
	pat->type = PT_DIR;
    sl = s->lno;
    while(1) {
	getcfline(s);
	if(!strcmp(s->argv[0], "filename")) {
	    if(s->argc < 2) {
		flog(LOG_WARNING, "%s:%i: missing pattern for `filename' match", s->file, s->lno);
		continue;
	    }
	    rule = newrule(pat);
	    rule->type = PAT_BASENAME;
	    rule->patterns = cadup(s->argv + 1);
	} else if(!strcmp(s->argv[0], "pathname")) {
	    if(s->argc < 2) {
		flog(LOG_WARNING, "%s:%i: missing pattern for `pathname' match", s->file, s->lno);
		continue;
	    }
	    rule = newrule(pat);
	    rule->type = PAT_PATHNAME;
	    rule->patterns = cadup(s->argv + 1);
	} else if(!strcmp(s->argv[0], "all")) {
	    newrule(pat)->type = PAT_ALL;
	} else if(!strcmp(s->argv[0], "default")) {
	    newrule(pat)->type = PAT_DEFAULT;
	} else if(!strcmp(s->argv[0], "handler")) {
	    if(s->argc < 2) {
		flog(LOG_WARNING, "%s:%i: missing child name for `handler' directive", s->file, s->lno);
		continue;
	    }
	    if(pat->childnm != NULL)
		free(pat->childnm);
	    pat->childnm = sstrdup(s->argv[1]);
	} else if(!strcmp(s->argv[0], "fork")) {
	    pat->fchild = cadup(s->argv + 1);
	} else if(!strcmp(s->argv[0], "end") || !strcmp(s->argv[0], "eof")) {
	    break;
	} else {
	    flog(LOG_WARNING, "%s:%i: unknown directive `%s' in pattern declaration", s->file, s->lno, s->argv[0]);
	}
    }
    
    if(pat->rules[0] == NULL) {
	flog(LOG_WARNING, "%s:%i: missing rules in match declaration", s->file, sl);
	freepattern(pat);
	return(NULL);
    }
    if((pat->childnm == NULL) && (pat->fchild == NULL)) {
	flog(LOG_WARNING, "%s:%i: missing handler in match declaration", s->file, sl);
	freepattern(pat);
	return(NULL);
    }
    return(pat);
}

static struct config *emptyconfig(void)
{
    struct config *cf;
    
    omalloc(cf);
    return(cf);
}

struct config *readconfig(char *file)
{
    struct cfstate *s;
    FILE *in;
    struct config *cf;
    struct child *child;
    struct pattern *pat;
    
    if((in = fopen(file, "r")) == NULL) {
	flog(LOG_WARNING, "%s: %s", file, strerror(errno));
	return(NULL);
    }
    s = mkcfparser(in, file);
    cf = emptyconfig();
    
    while(1) {
	getcfline(s);
	if((child = parsechild(s)) != NULL) {
	    child->next = cf->children;
	    cf->children = child;
	} else if((pat = parsepattern(s)) != NULL) {
	    pat->next = cf->patterns;
	    cf->patterns = pat;
	} else if(!strcmp(s->argv[0], "index-file")) {
	    freeca(cf->index);
	    cf->index = NULL;
	    if(s->argc > 1)
		cf->index = cadup(s->argv + 1);
	} else if(!strcmp(s->argv[0], "capture")) {
	    if(s->argc < 2) {
		flog(LOG_WARNING, "%s:%i: missing argument to capture declaration", s->file, s->lno);
		continue;
	    }
	    if(cf->capture != NULL)
		free(cf->capture);
	    cf->capture = sstrdup(s->argv[1]);
	} else if(!strcmp(s->argv[0], "eof")) {
	    break;
	} else {
	    flog(LOG_WARNING, "%s:%i: unknown directive `%s'", s->file, s->lno, s->argv[0]);
	}
    }
    
    freecfparser(s);
    fclose(in);
    return(cf);
}

static void mergechildren(struct config *dst, struct config *src)
{
    struct child *ch1, *ch2;
    
    for(ch1 = dst->children; ch1 != NULL; ch1 = ch1->next) {
	for(ch2 = src->children; ch2 != NULL; ch2 = ch2->next) {
	    if(!strcmp(ch1->name, ch2->name)) {
		ch1->fd = ch2->fd;
		ch2->fd = -1;
		break;
	    }
	}
    }
}

struct config *getconfig(char *path)
{
    struct config *cf, *ocf;
    struct stat sb;
    char *fn;
    time_t mtime;
    
    fn = sprintf3("%s/.htrc", path);
    for(cf = cflist; cf != NULL; cf = cf->next) {
	if(!strcmp(cf->path, path)) {
	    if(now - cf->lastck > 5) {
		if(stat(fn, &sb) || (sb.st_mtime != cf->mtime))
		    break;
	    }
	    cf->lastck = now;
	    return(cf);
	}
    }
    ocf = cf;
    if(access(fn, R_OK) || stat(fn, &sb)) {
	cf = emptyconfig();
	mtime = 0;
    } else {
	if((cf = readconfig(fn)) == NULL)
	    return(NULL);
	mtime = sb.st_mtime;
    }
    if(ocf != NULL) {
	mergechildren(cf, ocf);
	freeconfig(ocf);
    }
    cf->path = sstrdup(path);
    cf->mtime = mtime;
    cf->lastck = now;
    cf->next = cflist;
    cf->prev = NULL;
    if(cflist != NULL)
	cflist->prev = cf;
    cflist = cf;
    return(cf);
}

struct config **getconfigs(char *file)
{
    static struct config **ret = NULL;
    struct {
	struct config **b;
	size_t s, d;
    } buf;
    struct config *cf;
    char *tmp, *p;
    
    if(ret != NULL)
	free(ret);
    bufinit(buf);
    tmp = sstrdup(file);
    while(1) {
	if((p = strrchr(tmp, '/')) == NULL)
	    break;
	*p = 0;
	if((cf = getconfig(tmp)) != NULL)
	    bufadd(buf, cf);
    }
    free(tmp);
    if((cf = getconfig(".")) != NULL)
	bufadd(buf, cf);
    if(lconfig != NULL)
	bufadd(buf, lconfig);
    if(gconfig != NULL)
	bufadd(buf, gconfig);
    bufadd(buf, NULL);
    return(ret = buf.b);
}

struct child *findchild(char *file, char *name, struct config **cf)
{
    int i;
    struct config **cfs;
    struct child *ch;
    
    cfs = getconfigs(file);
    for(i = 0; cfs[i] != NULL; i++) {
	if((ch = getchild(cfs[i], name)) != NULL) {
	    if(cf != NULL)
		*cf = cfs[i];
	    return(ch);
	}
    }
    return(NULL);
}

struct pattern *findmatch(char *file, int trydefault, int dir)
{
    int i, o, c;
    char *bn;
    struct config **cfs;
    struct pattern *pat;
    struct rule *rule;
    
    if((bn = strrchr(file, '/')) != NULL)
	bn++;
    else
	bn = file;
    cfs = getconfigs(file);
    for(c = 0; cfs[c] != NULL; c++) {
	for(pat = cfs[c]->patterns; pat != NULL; pat = pat->next) {
	    if(!dir && (pat->type == PT_DIR))
		continue;
	    if(dir && (pat->type != PT_DIR))
		continue;
	    for(i = 0; (rule = pat->rules[i]) != NULL; i++) {
		if(rule->type == PAT_BASENAME) {
		    for(o = 0; rule->patterns[o] != NULL; o++) {
			if(!fnmatch(rule->patterns[o], bn, 0))
			    break;
		    }
		    if(rule->patterns[o] == NULL)
			break;
		} else if(rule->type == PAT_PATHNAME) {
		    for(o = 0; rule->patterns[o] != NULL; o++) {
			if(!fnmatch(rule->patterns[o], file, FNM_PATHNAME))
			    break;
		    }
		    if(rule->patterns[o] == NULL)
			break;
		} else if(rule->type == PAT_ALL) {
		} else if(rule->type == PAT_DEFAULT) {
		    if(!trydefault)
			break;
		}
	    }
	    if(!rule)
		return(pat);
	}
    }
    if(!trydefault)
	return(findmatch(file, 1, dir));
    return(NULL);
}
Commit	Line	Data
992ce9ef FT	1	/*
	2	ashd - A Sane HTTP Daemon
	3	Copyright (C) 2008 Fredrik Tolf <fredrik@dolda2000.com>
	4
	5	This program is free software: you can redistribute it and/or modify
	6	it under the terms of the GNU General Public License as published by
	7	the Free Software Foundation, either version 3 of the License, or
	8	(at your option) any later version.
	9
	10	This program is distributed in the hope that it will be useful,
	11	but WITHOUT ANY WARRANTY; without even the implied warranty of
	12	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	13	GNU General Public License for more details.
	14
	15	You should have received a copy of the GNU General Public License
	16	along with this program. If not, see <http://www.gnu.org/licenses/>.
	17	*/
	18
	19	#include <stdlib.h>
	20	#include <stdio.h>
992ce9ef	21	#include <unistd.h>
600a1ce7	22	#include <string.h>
992ce9ef	23	#include <errno.h>
992ce9ef	24	#include <fnmatch.h>
600a1ce7	25	#include <sys/stat.h>
992ce9ef FT	26
	27	#ifdef HAVE_CONFIG_H
	28	#include <config.h>
	29	#endif
	30	#include <utils.h>
992ce9ef	31	#include <log.h>
06c1a718	32	#include <cf.h>
992ce9ef	33
600a1ce7	34	#include "dirplex.h"
992ce9ef	35
0fc6fd13	36	static struct config *cflist;
600a1ce7	37	struct config gconfig, lconfig;
992ce9ef	38
1eba4f97 FT	39	static void freerule(struct rule *rule)
	40	{
	41	freeca(rule->patterns);
	42	free(rule);
	43	}
	44
992ce9ef FT	45	static void freepattern(struct pattern *pat)
	46	{
	47	struct rule **rule;
	48
1eba4f97 FT	49	for(rule = pat->rules; *rule; rule++)
1eba4f97 FT	50	freerule(*rule);
992ce9ef FT	51	if(pat->childnm != NULL)
992ce9ef FT	52	free(pat->childnm);
624f637d	53	freeca(pat->fchild);
992ce9ef FT	54	free(pat);
	55	}
	56
	57	static void freeconfig(struct config *cf)
	58	{
	59	struct child ch, nch;
	60	struct pattern pat, npat;
	61
	62	if(cf->prev != NULL)
	63	cf->prev->next = cf->next;
	64	if(cf->next != NULL)
	65	cf->next->prev = cf->prev;
	66	if(cf == cflist)
	67	cflist = cf->next;
0fc6fd13 FT	68	if(cf->path != NULL)
0fc6fd13 FT	69	free(cf->path);
992ce9ef FT	70	for(ch = cf->children; ch != NULL; ch = nch) {
	71	nch = ch->next;
	72	freechild(ch);
	73	}
	74	for(pat = cf->patterns; pat != NULL; pat = npat) {
	75	npat = pat->next;
	76	freepattern(pat);
	77	}
6373daf9	78	freeca(cf->index);
300d73d9 FT	79	if(cf->capture != NULL)
300d73d9 FT	80	free(cf->capture);
992ce9ef FT	81	free(cf);
	82	}
	83
600a1ce7	84	struct child getchild(struct config cf, char *name)
992ce9ef FT	85	{
	86	struct child *ch;
	87
	88	for(ch = cf->children; ch; ch = ch->next) {
	89	if(!strcmp(ch->name, name))
	90	break;
	91	}
	92	return(ch);
	93	}
	94
	95	static struct rule newrule(struct pattern pat)
	96	{
	97	int i;
	98	struct rule *rule;
	99
	100	for(i = 0; pat->rules[i]; i++);
	101	pat->rules = srealloc(pat->rules, sizeof(pat->rules) (i + 2));
cceb3611	102	rule = pat->rules[i] = szmalloc(sizeof(*rule));
992ce9ef FT	103	pat->rules[i + 1] = NULL;
	104	return(rule);
	105	}
	106
	107	static struct pattern *newpattern(void)
	108	{
	109	struct pattern *pat;
	110
	111	omalloc(pat);
	112	pat->rules = szmalloc(sizeof(*pat->rules));
	113	return(pat);
	114	}
	115
1eba4f97 FT	116	static char cadup(char w)
	117	{
	118	char **ret;
	119	int i, l;
	120
	121	l = calen(w);
	122	ret = smalloc(sizeof(ret) (l + 1));
	123	for(i = 0; i < l; i++)
	124	ret[i] = sstrdup(w[i]);
	125	ret[i] = NULL;
	126	return(ret);
	127	}
	128
06c1a718 FT	129	static struct pattern parsepattern(struct cfstate s)
	130	{
	131	struct pattern *pat;
	132	struct rule *rule;
1eba4f97	133	int sl;
06c1a718 FT	134
	135	if(!strcmp(s->argv[0], "match")) {
	136	s->expstart = 1;
	137	pat = newpattern();
	138	} else {
	139	return(NULL);
	140	}
	141
8232cebe FT	142	if((s->argc > 1) && !strcmp(s->argv[1], "directory"))
8232cebe FT	143	pat->type = PT_DIR;
06c1a718 FT	144	sl = s->lno;
	145	while(1) {
	146	getcfline(s);
	147	if(!strcmp(s->argv[0], "filename")) {
	148	if(s->argc < 2) {
	149	flog(LOG_WARNING, "%s:%i: missing pattern for `filename' match", s->file, s->lno);
	150	continue;
	151	}
	152	rule = newrule(pat);
	153	rule->type = PAT_BASENAME;
1eba4f97	154	rule->patterns = cadup(s->argv + 1);
06c1a718 FT	155	} else if(!strcmp(s->argv[0], "pathname")) {
	156	if(s->argc < 2) {
	157	flog(LOG_WARNING, "%s:%i: missing pattern for `pathname' match", s->file, s->lno);
	158	continue;
	159	}
	160	rule = newrule(pat);
	161	rule->type = PAT_PATHNAME;
1eba4f97	162	rule->patterns = cadup(s->argv + 1);
06c1a718 FT	163	} else if(!strcmp(s->argv[0], "all")) {
	164	newrule(pat)->type = PAT_ALL;
	165	} else if(!strcmp(s->argv[0], "default")) {
	166	newrule(pat)->type = PAT_DEFAULT;
	167	} else if(!strcmp(s->argv[0], "handler")) {
	168	if(s->argc < 2) {
	169	flog(LOG_WARNING, "%s:%i: missing child name for `handler' directive", s->file, s->lno);
	170	continue;
	171	}
	172	if(pat->childnm != NULL)
	173	free(pat->childnm);
	174	pat->childnm = sstrdup(s->argv[1]);
624f637d	175	} else if(!strcmp(s->argv[0], "fork")) {
1eba4f97	176	pat->fchild = cadup(s->argv + 1);
06c1a718 FT	177	} else if(!strcmp(s->argv[0], "end") \|\| !strcmp(s->argv[0], "eof")) {
	178	break;
	179	} else {
	180	flog(LOG_WARNING, "%s:%i: unknown directive `%s' in pattern declaration", s->file, s->lno, s->argv[0]);
	181	}
	182	}
	183
	184	if(pat->rules[0] == NULL) {
	185	flog(LOG_WARNING, "%s:%i: missing rules in match declaration", s->file, sl);
	186	freepattern(pat);
	187	return(NULL);
	188	}
624f637d	189	if((pat->childnm == NULL) && (pat->fchild == NULL)) {
06c1a718 FT	190	flog(LOG_WARNING, "%s:%i: missing handler in match declaration", s->file, sl);
	191	freepattern(pat);
	192	return(NULL);
	193	}
	194	return(pat);
	195	}
	196
17e55136 FT	197	static struct config *emptyconfig(void)
	198	{
	199	struct config *cf;
	200
	201	omalloc(cf);
	202	return(cf);
	203	}
	204
600a1ce7	205	struct config readconfig(char file)
992ce9ef	206	{
06c1a718 FT	207	struct cfstate *s;
06c1a718 FT	208	FILE *in;
992ce9ef	209	struct config *cf;
992ce9ef FT	210	struct child *child;
992ce9ef FT	211	struct pattern *pat;
992ce9ef	212
17e55136 FT	213	if((in = fopen(file, "r")) == NULL) {
17e55136 FT	214	flog(LOG_WARNING, "%s: %s", file, strerror(errno));
992ce9ef	215	return(NULL);
06c1a718	216	}
17e55136 FT	217	s = mkcfparser(in, file);
17e55136 FT	218	cf = emptyconfig();
06c1a718 FT	219
	220	while(1) {
	221	getcfline(s);
	222	if((child = parsechild(s)) != NULL) {
	223	child->next = cf->children;
	224	cf->children = child;
	225	} else if((pat = parsepattern(s)) != NULL) {
	226	pat->next = cf->patterns;
	227	cf->patterns = pat;
6373daf9 FT	228	} else if(!strcmp(s->argv[0], "index-file")) {
	229	freeca(cf->index);
	230	cf->index = NULL;
	231	if(s->argc > 1)
	232	cf->index = cadup(s->argv + 1);
300d73d9 FT	233	} else if(!strcmp(s->argv[0], "capture")) {
	234	if(s->argc < 2) {
	235	flog(LOG_WARNING, "%s:%i: missing argument to capture declaration", s->file, s->lno);
	236	continue;
	237	}
	238	if(cf->capture != NULL)
	239	free(cf->capture);
	240	cf->capture = sstrdup(s->argv[1]);
06c1a718 FT	241	} else if(!strcmp(s->argv[0], "eof")) {
	242	break;
	243	} else {
	244	flog(LOG_WARNING, "%s:%i: unknown directive `%s'", s->file, s->lno, s->argv[0]);
992ce9ef	245	}
06c1a718	246	}
992ce9ef	247
06c1a718 FT	248	freecfparser(s);
06c1a718 FT	249	fclose(in);
992ce9ef FT	250	return(cf);
	251	}
	252
a756e349 FT	253	static void mergechildren(struct config dst, struct config src)
	254	{
	255	struct child ch1, ch2;
	256
	257	for(ch1 = dst->children; ch1 != NULL; ch1 = ch1->next) {
	258	for(ch2 = src->children; ch2 != NULL; ch2 = ch2->next) {
	259	if(!strcmp(ch1->name, ch2->name)) {
	260	ch1->fd = ch2->fd;
	261	ch2->fd = -1;
	262	break;
	263	}
	264	}
	265	}
	266	}
	267
600a1ce7	268	struct config getconfig(char path)
992ce9ef	269	{
a756e349	270	struct config cf, ocf;
992ce9ef	271	struct stat sb;
17e55136 FT	272	char *fn;
17e55136 FT	273	time_t mtime;
992ce9ef	274
17e55136	275	fn = sprintf3("%s/.htrc", path);
992ce9ef FT	276	for(cf = cflist; cf != NULL; cf = cf->next) {
992ce9ef FT	277	if(!strcmp(cf->path, path)) {
17e55136	278	if(now - cf->lastck > 5) {
a756e349	279	if(stat(fn, &sb) \|\| (sb.st_mtime != cf->mtime))
17e55136	280	break;
992ce9ef	281	}
17e55136	282	cf->lastck = now;
992ce9ef FT	283	return(cf);
	284	}
	285	}
a756e349	286	ocf = cf;
17e55136 FT	287	if(access(fn, R_OK) \|\| stat(fn, &sb)) {
	288	cf = emptyconfig();
	289	mtime = 0;
	290	} else {
	291	if((cf = readconfig(fn)) == NULL)
	292	return(NULL);
	293	mtime = sb.st_mtime;
992ce9ef	294	}
a756e349 FT	295	if(ocf != NULL) {
	296	mergechildren(cf, ocf);
	297	freeconfig(ocf);
	298	}
17e55136 FT	299	cf->path = sstrdup(path);
	300	cf->mtime = mtime;
	301	cf->lastck = now;
	302	cf->next = cflist;
d245c327 FT	303	cf->prev = NULL;
	304	if(cflist != NULL)
	305	cflist->prev = cf;
17e55136	306	cflist = cf;
992ce9ef FT	307	return(cf);
	308	}
	309
600a1ce7	310	struct config *getconfigs(char file)
992ce9ef	311	{
8dce6d19 FT	312	static struct config **ret = NULL;
	313	struct {
	314	struct config **b;
	315	size_t s, d;
	316	} buf;
992ce9ef	317	struct config *cf;
8dce6d19 FT	318	char tmp, p;
	319
	320	if(ret != NULL)
	321	free(ret);
	322	bufinit(buf);
	323	tmp = sstrdup(file);
992ce9ef	324	while(1) {
8dce6d19	325	if((p = strrchr(tmp, '/')) == NULL)
992ce9ef	326	break;
8dce6d19 FT	327	*p = 0;
	328	if((cf = getconfig(tmp)) != NULL)
	329	bufadd(buf, cf);
	330	}
	331	free(tmp);
	332	if((cf = getconfig(".")) != NULL)
	333	bufadd(buf, cf);
0fc6fd13 FT	334	if(lconfig != NULL)
	335	bufadd(buf, lconfig);
	336	if(gconfig != NULL)
	337	bufadd(buf, gconfig);
8dce6d19 FT	338	bufadd(buf, NULL);
	339	return(ret = buf.b);
	340	}
	341
da75c835	342	struct child findchild(char file, char name, struct config *cf)
8dce6d19 FT	343	{
	344	int i;
	345	struct config **cfs;
	346	struct child *ch;
	347
	348	cfs = getconfigs(file);
	349	for(i = 0; cfs[i] != NULL; i++) {
da75c835 FT	350	if((ch = getchild(cfs[i], name)) != NULL) {
	351	if(cf != NULL)
	352	*cf = cfs[i];
	353	return(ch);
	354	}
992ce9ef	355	}
da75c835	356	return(NULL);
992ce9ef FT	357	}
992ce9ef FT	358
600a1ce7	359	struct pattern findmatch(char file, int trydefault, int dir)
992ce9ef	360	{
1eba4f97	361	int i, o, c;
8dce6d19 FT	362	char *bn;
8dce6d19 FT	363	struct config **cfs;
992ce9ef FT	364	struct pattern *pat;
	365	struct rule *rule;
	366
	367	if((bn = strrchr(file, '/')) != NULL)
	368	bn++;
	369	else
	370	bn = file;
8dce6d19 FT	371	cfs = getconfigs(file);
	372	for(c = 0; cfs[c] != NULL; c++) {
	373	for(pat = cfs[c]->patterns; pat != NULL; pat = pat->next) {
8232cebe FT	374	if(!dir && (pat->type == PT_DIR))
	375	continue;
	376	if(dir && (pat->type != PT_DIR))
	377	continue;
992ce9ef FT	378	for(i = 0; (rule = pat->rules[i]) != NULL; i++) {
992ce9ef FT	379	if(rule->type == PAT_BASENAME) {
1eba4f97 FT	380	for(o = 0; rule->patterns[o] != NULL; o++) {
	381	if(!fnmatch(rule->patterns[o], bn, 0))
	382	break;
	383	}
	384	if(rule->patterns[o] == NULL)
992ce9ef FT	385	break;
992ce9ef FT	386	} else if(rule->type == PAT_PATHNAME) {
1eba4f97 FT	387	for(o = 0; rule->patterns[o] != NULL; o++) {
	388	if(!fnmatch(rule->patterns[o], file, FNM_PATHNAME))
	389	break;
	390	}
	391	if(rule->patterns[o] == NULL)
992ce9ef FT	392	break;
	393	} else if(rule->type == PAT_ALL) {
	394	} else if(rule->type == PAT_DEFAULT) {
	395	if(!trydefault)
	396	break;
	397	}
	398	}
	399	if(!rule)
8dce6d19	400	return(pat);
992ce9ef FT	401	}
992ce9ef FT	402	}
8232cebe FT	403	if(!trydefault)
8232cebe FT	404	return(findmatch(file, 1, dir));
8dce6d19	405	return(NULL);
992ce9ef	406	}