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