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