excludes.c revision 1.9 1 /* $NetBSD: excludes.c,v 1.9 2002/04/09 02:35:31 thorpej 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 #include <sys/cdefs.h>
33 __RCSID("$NetBSD: excludes.c,v 1.9 2002/04/09 02:35:31 thorpej Exp $");
34
35 #include <sys/types.h>
36 #include <sys/queue.h>
37
38 #include <fnmatch.h>
39 #include <stdio.h>
40 #include <stdlib.h>
41 #include <string.h>
42 #include <time.h>
43 #include <util.h>
44
45 #include "extern.h"
46
47
48 /*
49 * We're assuming that there won't be a whole lot of excludes,
50 * so it's OK to use a stupid algorithm.
51 */
52 struct exclude {
53 LIST_ENTRY(exclude) link;
54 const char *glob;
55 int pathname;
56 };
57 static LIST_HEAD(, exclude) excludes;
58
59
60 void
61 init_excludes(void)
62 {
63
64 LIST_INIT(&excludes);
65 }
66
67 void
68 read_excludes_file(const char *name)
69 {
70 FILE *fp;
71 char *line;
72 struct exclude *e;
73
74 fp = fopen(name, "r");
75 if (fp == 0)
76 err(1, "%s", name);
77
78 while ((line = fparseln(fp, NULL, NULL, NULL,
79 FPARSELN_UNESCCOMM | FPARSELN_UNESCCONT | FPARSELN_UNESCESC))
80 != NULL) {
81 if (line[0] == '\0')
82 continue;
83
84 if ((e = malloc(sizeof *e)) == NULL)
85 mtree_err("memory allocation error");
86
87 e->glob = line;
88 if (strchr(e->glob, '/') != NULL)
89 e->pathname = 1;
90 else
91 e->pathname = 0;
92 LIST_INSERT_HEAD(&excludes, e, link);
93 }
94 fclose(fp);
95 }
96
97 int
98 check_excludes(const char *fname, const char *path)
99 {
100 struct exclude *e;
101
102 /* fnmatch(3) has a funny return value convention... */
103 #define MATCH(g, n) (fnmatch((g), (n), FNM_PATHNAME) == 0)
104
105 e = LIST_FIRST(&excludes);
106 while (e) {
107 if ((e->pathname && MATCH(e->glob, path))
108 || MATCH(e->glob, fname)) {
109 return (1);
110 }
111 e = LIST_NEXT(e, link);
112 }
113 return (0);
114 }
115