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 * $FreeBSD: src/usr.sbin/mtree/excludes.c,v 1.1.2.4 2001/01/12 19:17:18 phk Exp $ 30 * $DragonFly: src/usr.sbin/mtree/excludes.c,v 1.3 2004/03/15 16:24:22 dillon Exp $ 31 */ 32 33 #include <sys/types.h> 34 #include <sys/time.h> /* XXX for mtree.h */ 35 #include <sys/queue.h> 36 37 #include <err.h> 38 #include <fnmatch.h> 39 #include <fts.h> 40 #include <stdio.h> 41 #include <stdlib.h> 42 43 #include "mtree.h" /* XXX for extern.h */ 44 #include "extern.h" 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 void 58 init_excludes(void) 59 { 60 61 LIST_INIT(&excludes); 62 } 63 64 void 65 read_excludes_file(const char *name) 66 { 67 FILE *fp; 68 char *line, *str; 69 struct exclude *e; 70 size_t len; 71 72 fp = fopen(name, "r"); 73 if (fp == 0) 74 err(1, "%s", name); 75 76 while ((line = fgetln(fp, &len)) != 0) { 77 if (line[len - 1] == '\n') 78 len--; 79 if (len == 0) 80 continue; 81 82 str = malloc(len + 1); 83 e = malloc(sizeof *e); 84 if (str == 0 || e == 0) 85 errx(1, "memory allocation error"); 86 e->glob = str; 87 memcpy(str, line, len); 88 str[len] = '\0'; 89 if (strchr(str, '/')) 90 e->pathname = 1; 91 else 92 e->pathname = 0; 93 LIST_INSERT_HEAD(&excludes, e, link); 94 } 95 fclose(fp); 96 } 97 98 int 99 check_excludes(const char *fname, const char *path) 100 { 101 struct exclude *e; 102 103 /* fnmatch(3) has a funny return value convention... */ 104 #define MATCH(g, n) (fnmatch((g), (n), FNM_PATHNAME) == 0) 105 106 LIST_FOREACH(e, &excludes, link) { 107 if ((e->pathname && MATCH(e->glob, path)) || 108 MATCH(e->glob, fname)) 109 return 1; 110 } 111 return 0; 112 } 113