1/*	$NetBSD: excludes.c,v 1.12 2003/11/17 00:02:33 dbj Exp $	*/
2
3/*
4 * Copyright 2000 Massachusetts Institute of Technology
5 *
6 * Permission to use, copy, modify, and distribute this software and
7 * its documentation for any purpose and without fee is hereby
8 * granted, provided that both the above copyright notice and this
9 * permission notice appear in all copies, that both the above
10 * copyright notice and this permission notice appear in all
11 * supporting documentation, and that the name of M.I.T. not be used
12 * in advertising or publicity pertaining to distribution of the
13 * software without specific, written prior permission.  M.I.T. makes
14 * no representations about the suitability of this software for any
15 * purpose.  It is provided "as is" without express or implied
16 * warranty.
17 *
18 * THIS SOFTWARE IS PROVIDED BY M.I.T. ``AS IS''.  M.I.T. DISCLAIMS
19 * ALL EXPRESS OR IMPLIED WARRANTIES WITH REGARD TO THIS SOFTWARE,
20 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
21 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. IN NO EVENT
22 * SHALL M.I.T. BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
25 * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
26 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
27 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
28 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * SUCH DAMAGE.
30 */
31
32#if HAVE_NBTOOL_CONFIG_H
33#include "nbtool_config.h"
34#endif
35
36#include <sys/cdefs.h>
37
38#if defined(__RCSID) && !defined(lint)
39__RCSID("$NetBSD: excludes.c,v 1.12 2003/11/17 00:02:33 dbj Exp $");
40#endif
41
42#include <sys/types.h>
43#include <sys/queue.h>
44
45#include <fnmatch.h>
46#include <stdio.h>
47#include <stdlib.h>
48#include <string.h>
49#include <time.h>
50#include <util.h>
51
52#include "extern.h"
53
54
55/*
56 * We're assuming that there won't be a whole lot of excludes,
57 * so it's OK to use a stupid algorithm.
58 */
59struct exclude {
60	LIST_ENTRY(exclude) link;
61	const char *glob;
62	int pathname;
63};
64static LIST_HEAD(, exclude) excludes;
65
66
67void
68init_excludes(void)
69{
70
71	LIST_INIT(&excludes);
72}
73
74void
75read_excludes_file(const char *name)
76{
77	FILE *fp;
78	char *line;
79	struct exclude *e;
80
81	fp = fopen(name, "r");
82	if (fp == 0)
83		err(1, "%s", name);
84
85	while ((line = fparseln(fp, NULL, NULL, NULL,
86	    FPARSELN_UNESCCOMM | FPARSELN_UNESCCONT | FPARSELN_UNESCESC))
87	    != NULL) {
88		if (line[0] == '\0')
89			continue;
90
91		if ((e = malloc(sizeof *e)) == NULL)
92			mtree_err("memory allocation error");
93
94		e->glob = line;
95		if (strchr(e->glob, '/') != NULL)
96			e->pathname = 1;
97		else
98			e->pathname = 0;
99		LIST_INSERT_HEAD(&excludes, e, link);
100	}
101	fclose(fp);
102}
103
104int
105check_excludes(const char *fname, const char *path)
106{
107	struct exclude *e;
108
109	/* fnmatch(3) has a funny return value convention... */
110#define MATCH(g, n) (fnmatch((g), (n), FNM_PATHNAME) == 0)
111
112	e = LIST_FIRST(&excludes);
113	while (e) {
114		if ((e->pathname && MATCH(e->glob, path))
115		    || MATCH(e->glob, fname)) {
116			return (1);
117		}
118		e = LIST_NEXT(e, link);
119	}
120	return (0);
121}
122