|
Added
Link Here
|
| 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/types.h> |
| 31 |
#include <sys/queue.h> |
| 32 |
|
| 33 |
#include <err.h> |
| 34 |
#include <fnmatch.h> |
| 35 |
#include <fts.h> |
| 36 |
#include <stdio.h> |
| 37 |
#include <stdlib.h> |
| 38 |
|
| 39 |
/* |
| 40 |
* We're assuming that there won't be a whole lot of excludes, |
| 41 |
* so it's OK to use a stupid algorithm. |
| 42 |
*/ |
| 43 |
struct exclude { |
| 44 |
LIST_ENTRY(exclude) link; |
| 45 |
const char *glob; |
| 46 |
int pathname; |
| 47 |
}; |
| 48 |
static LIST_HEAD(, exclude) excludes; |
| 49 |
|
| 50 |
void |
| 51 |
init_excludes(void) |
| 52 |
{ |
| 53 |
LIST_INIT(&excludes); |
| 54 |
} |
| 55 |
|
| 56 |
void |
| 57 |
read_excludes_file(const char *name) |
| 58 |
{ |
| 59 |
FILE *fp; |
| 60 |
char *line, *str; |
| 61 |
struct exclude *e; |
| 62 |
size_t len; |
| 63 |
|
| 64 |
fp = fopen(name, "r"); |
| 65 |
if (fp == 0) |
| 66 |
err(1, "%s", name); |
| 67 |
|
| 68 |
while ((line = fgetln(fp, &len)) != 0) { |
| 69 |
if (line[len - 1] == '\n') |
| 70 |
len--; |
| 71 |
if (len == 0) |
| 72 |
continue; |
| 73 |
|
| 74 |
str = malloc(len + 1); |
| 75 |
e = malloc(sizeof *e); |
| 76 |
if (str == 0 || e == 0) |
| 77 |
errx(1, "memory allocation error"); |
| 78 |
e->glob = str; |
| 79 |
memcpy(str, line, len); |
| 80 |
str[len] = '\0'; |
| 81 |
if (strchr(str, '/')) |
| 82 |
e->pathname = 1; |
| 83 |
LIST_INSERT_HEAD(&excludes, e, link); |
| 84 |
} |
| 85 |
fclose(fp); |
| 86 |
} |
| 87 |
|
| 88 |
int |
| 89 |
check_excludes(const char *fname, const char *path) |
| 90 |
{ |
| 91 |
struct exclude *e; |
| 92 |
|
| 93 |
/* fnmatch(3) has a funny return value convention... */ |
| 94 |
#define MATCH(g, n) (fnmatch((g), (n), FNM_PATHNAME) == 0) |
| 95 |
|
| 96 |
for (e = excludes.lh_first; e != 0; e = e->link.le_next) { |
| 97 |
if (e->pathname && MATCH(e->glob, path) |
| 98 |
|| MATCH(e->glob, fname)) |
| 99 |
return 1; |
| 100 |
} |
| 101 |
return 0; |
| 102 |
} |