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