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