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