usr.sbin/mtree/excludes.c

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