1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
|
#include <u.h>
#include <libc.h>
#include <fcall.h>
#include <bio.h>
#include <regexp.h>
#define Extern
#include "exportfs.h"
Reprog **exclude, **include;
char *patternfile;
void
exclusions(void)
{
Biobuf *f;
int ni, nmaxi, ne, nmaxe;
char *line;
if(patternfile == nil)
return;
f = Bopen(patternfile, OREAD);
if(f == nil)
fatal("cannot open patternfile");
ni = 0;
nmaxi = 100;
include = malloc(nmaxi*sizeof(*include));
if(include == nil)
fatal("out of memory");
include[0] = nil;
ne = 0;
nmaxe = 100;
exclude = malloc(nmaxe*sizeof(*exclude));
if(exclude == nil)
fatal("out of memory");
exclude[0] = nil;
while(line = Brdline(f, '\n')){
line[Blinelen(f) - 1] = 0;
if(strlen(line) < 2 || line[1] != ' ')
continue;
switch(line[0]){
case '+':
if(ni+1 >= nmaxi){
nmaxi = 2*nmaxi;
include = realloc(include, nmaxi*sizeof(*include));
if(include == nil)
fatal("out of memory");
}
DEBUG(DFD, "\tinclude %s\n", line+2);
include[ni] = regcomp(line+2);
include[++ni] = nil;
break;
case '-':
if(ne+1 >= nmaxe){
nmaxe = 2*nmaxe;
exclude = realloc(exclude, nmaxe*sizeof(*exclude));
if(exclude == nil)
fatal("out of memory");
}
DEBUG(DFD, "\texclude %s\n", line+2);
exclude[ne] = regcomp(line+2);
exclude[++ne] = nil;
break;
default:
DEBUG(DFD, "ignoring pattern %s\n", line);
break;
}
}
Bterm(f);
}
int
excludefile(char *path)
{
Reprog **re;
char *p;
if(*(path+1) == 0)
p = "/";
else
p = path+1;
DEBUG(DFD, "checking %s\n", path);
for(re = include; *re != nil; re++){
if(regexec(*re, p, nil, 0) != 1){
DEBUG(DFD, "excluded+ %s\n", path);
return -1;
}
}
for(re = exclude; *re != nil; re++){
if(regexec(*re, p, nil, 0) == 1){
DEBUG(DFD, "excluded- %s\n", path);
return -1;
}
}
return 0;
}
int
preaddir(Fid *f, uchar *data, int n, vlong offset)
{
int r = 0, m;
Dir *d;
DEBUG(DFD, "\tpreaddir n=%d wo=%lld fo=%lld\n", n, offset, f->offset);
if(offset == 0 && f->offset != 0){
if(seek(f->fid, 0, 0) != 0)
return -1;
f->offset = f->cdir = f->ndir = 0;
free(f->dir);
f->dir = nil;
}else if(offset != f->offset){
werrstr("can't seek dir %lld to %lld", f->offset, offset);
return -1;
}
while(n > 0){
if(f->dir == nil){
f->ndir = dirread(f->fid, &f->dir);
if(f->ndir < 0)
return f->ndir;
if(f->ndir == 0)
return r;
}
d = &f->dir[f->cdir++];
if(exclude){
char *p = makepath(f->f, d->name);
if(excludefile(p)){
free(p);
goto skipentry;
}
free(p);
}
m = convD2M(d, data, n);
DEBUG(DFD, "\t\tconvD2M %d\n", m);
if(m <= BIT16SZ){
DEBUG(DFD, "\t\t\tneeded %d\n", GBIT16(data));
/* not enough room for full entry; leave for next time */
f->cdir--;
return r;
}else{
data += m;
n -= m;
r += m;
f->offset += m;
}
skipentry: if(f->cdir >= f->ndir){
f->cdir = f->ndir = 0;
free(f->dir);
f->dir = nil;
}
}
return r;
}
|
