usr.sbin/mtree/excludes.c

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