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
  30 #include <sys/cdefs.h>
  31 __FBSDID("$FreeBSD: src/usr.sbin/mtree/excludes.c,v 1.8 2003/10/21 08:27:05 phk Exp $");
  32
  33 #include <sys/types.h>
  34 #include <sys/queue.h>
  35
  36 #include <err.h>
  37 #include <errno.h>
  38 #include <fnmatch.h>
  39 #include <fts.h>
  40 #include <stdio.h>
  41 #include <stdint.h>
  42 #include <stdlib.h>
  43
  44 #include "metrics.h"
  45 #include "extern.h"
  46
  47 /*
  48  * We're assuming that there won't be a whole lot of excludes,
  49  * so it's OK to use a stupid algorithm.
  50  */
  51 struct exclude {
  52         LIST_ENTRY(exclude) link;
  53         const char *glob;
  54         int pathname;
  55 };
  56 static LIST_HEAD(, exclude) excludes;
  57
  58 void
  59 init_excludes(void)
  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                         RECORD_FAILURE(59, ENOMEM);
  86                         errx(1, "memory allocation error");
  87                 }
  88                 e->glob = str;
  89                 memcpy(str, line, len);
  90                 str[len] = '\0';
  91                 if (strchr(str, '/'))
  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         LIST_FOREACH(e, &excludes, link) {
 109                 if ((e->pathname && MATCH(e->glob, path))
 110                     || MATCH(e->glob, fname))
 111                         return 1;
 112         }
 113         return 0;
 114 }