Commit | Line | Data |
---|---|---|
f0f5767f MP |
1 | /* -*- c-file-style: "linux" -*- |
2 | ||
3 | Copyright (C) 1996-2001 by Andrew Tridgell <tridge@samba.org> | |
4 | Copyright (C) 1996 by Paul Mackerras | |
c627d613 AT |
5 | |
6 | This program is free software; you can redistribute it and/or modify | |
7 | it under the terms of the GNU General Public License as published by | |
8 | the Free Software Foundation; either version 2 of the License, or | |
9 | (at your option) any later version. | |
10 | ||
11 | This program is distributed in the hope that it will be useful, | |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
17 | along with this program; if not, write to the Free Software | |
18 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. | |
19 | */ | |
20 | ||
2b6b4d53 AT |
21 | /* a lot of this stuff was originally derived from GNU tar, although |
22 | it has now changed so much that it is hard to tell :) */ | |
c627d613 | 23 | |
d567322f MP |
24 | /* include/exclude cluestick added by Martin Pool <mbp@samba.org> */ |
25 | ||
c627d613 AT |
26 | #include "rsync.h" |
27 | ||
28 | extern int verbose; | |
8458724d | 29 | extern int delete_mode; |
c627d613 | 30 | |
2b6b4d53 | 31 | static struct exclude_struct **exclude_list; |
c627d613 | 32 | |
2b6b4d53 | 33 | /* build an exclude structure given a exclude pattern */ |
f0f5767f | 34 | static struct exclude_struct *make_exclude(const char *pattern, int include) |
c627d613 | 35 | { |
2b6b4d53 | 36 | struct exclude_struct *ret; |
c627d613 | 37 | |
2b6b4d53 AT |
38 | ret = (struct exclude_struct *)malloc(sizeof(*ret)); |
39 | if (!ret) out_of_memory("make_exclude"); | |
c627d613 | 40 | |
2b6b4d53 AT |
41 | memset(ret, 0, sizeof(*ret)); |
42 | ||
2b6b4d53 AT |
43 | if (strncmp(pattern,"- ",2) == 0) { |
44 | pattern += 2; | |
45 | } else if (strncmp(pattern,"+ ",2) == 0) { | |
46 | ret->include = 1; | |
47 | pattern += 2; | |
48 | } else { | |
49 | ret->include = include; | |
50 | } | |
51 | ||
52 | ret->pattern = strdup(pattern); | |
53 | ||
587cb08d | 54 | if (!ret->pattern) out_of_memory("make_exclude"); |
c627d613 | 55 | |
2bca43f6 | 56 | if (strpbrk(pattern, "*[?")) { |
2bca43f6 | 57 | ret->regular_exp = 1; |
9bec5286 AT |
58 | ret->fnmatch_flags = FNM_PATHNAME; |
59 | if (strstr(pattern, "**")) { | |
60 | static int tested; | |
61 | if (!tested) { | |
62 | tested = 1; | |
63 | if (fnmatch("a/b/*", "a/b/c/d", FNM_PATHNAME)==0) { | |
64 | rprintf(FERROR,"WARNING: fnmatch FNM_PATHNAME is broken on your system\n"); | |
65 | } | |
66 | } | |
67 | ret->fnmatch_flags = 0; | |
68 | } | |
2bca43f6 | 69 | } |
c627d613 | 70 | |
2b6b4d53 AT |
71 | if (strlen(pattern) > 1 && pattern[strlen(pattern)-1] == '/') { |
72 | ret->pattern[strlen(pattern)-1] = 0; | |
73 | ret->directory = 1; | |
74 | } | |
c627d613 | 75 | |
2b6b4d53 AT |
76 | if (!strchr(ret->pattern,'/')) { |
77 | ret->local = 1; | |
78 | } | |
0944563e | 79 | |
2b6b4d53 AT |
80 | return ret; |
81 | } | |
82 | ||
83 | static void free_exclude(struct exclude_struct *ex) | |
84 | { | |
2b6b4d53 AT |
85 | free(ex->pattern); |
86 | memset(ex,0,sizeof(*ex)); | |
87 | free(ex); | |
88 | } | |
c627d613 | 89 | |
d567322f MP |
90 | static int check_one_exclude(char *name, struct exclude_struct *ex, |
91 | STRUCT_STAT *st) | |
2b6b4d53 AT |
92 | { |
93 | char *p; | |
94 | int match_start=0; | |
95 | char *pattern = ex->pattern; | |
96 | ||
97 | if (ex->local && (p=strrchr(name,'/'))) | |
98 | name = p+1; | |
99 | ||
100 | if (!name[0]) return 0; | |
101 | ||
102 | if (ex->directory && !S_ISDIR(st->st_mode)) return 0; | |
103 | ||
104 | if (*pattern == '/' && *name != '/') { | |
105 | match_start = 1; | |
106 | pattern++; | |
107 | } | |
108 | ||
109 | if (ex->regular_exp) { | |
c36cd317 | 110 | if (fnmatch(pattern, name, ex->fnmatch_flags) == 0) { |
2b6b4d53 | 111 | return 1; |
c36cd317 | 112 | } |
2b6b4d53 AT |
113 | } else { |
114 | int l1 = strlen(name); | |
ea2111d1 | 115 | int l2 = strlen(pattern); |
2b6b4d53 | 116 | if (l2 <= l1 && |
ea2111d1 | 117 | strcmp(name+(l1-l2),pattern) == 0 && |
c36cd317 | 118 | (l1==l2 || (!match_start && name[l1-(l2+1)] == '/'))) { |
2b6b4d53 | 119 | return 1; |
c36cd317 | 120 | } |
2b6b4d53 AT |
121 | } |
122 | ||
123 | return 0; | |
c627d613 AT |
124 | } |
125 | ||
126 | ||
d567322f MP |
127 | static void report_exclude_result(char const *name, |
128 | struct exclude_struct const *ent, | |
129 | STRUCT_STAT const *st) | |
130 | { | |
131 | /* If a trailing slash is present to match only directories, | |
132 | * then it is stripped out by make_exclude. So as a special | |
133 | * case we add it back in here. */ | |
134 | ||
135 | if (verbose >= 2) | |
136 | rprintf(FINFO, "%s %s %s because of pattern %s%s\n", | |
137 | ent->include ? "including" : "excluding", | |
138 | S_ISDIR(st->st_mode) ? "directory" : "file", | |
139 | name, ent->pattern, | |
140 | ent->directory ? "/" : ""); | |
141 | } | |
142 | ||
143 | ||
144 | /* | |
145 | * Return true if file NAME is defined to be excluded by either | |
146 | * LOCAL_EXCLUDE_LIST or the globals EXCLUDE_LIST. | |
147 | */ | |
148 | int check_exclude(char *name, struct exclude_struct **local_exclude_list, | |
2b6b4d53 | 149 | STRUCT_STAT *st) |
c627d613 | 150 | { |
2b6b4d53 | 151 | int n; |
1f52f4c4 | 152 | struct exclude_struct *ent; |
c627d613 | 153 | |
5d5811f7 DD |
154 | if (name && (name[0] == '.') && !name[1]) |
155 | /* never exclude '.', even if somebody does --exclude '*' */ | |
156 | return 0; | |
157 | ||
2b6b4d53 | 158 | if (exclude_list) { |
d567322f MP |
159 | for (n=0; exclude_list[n]; n++) { |
160 | ent = exclude_list[n]; | |
161 | if (check_one_exclude(name, ent, st)) { | |
162 | report_exclude_result(name, ent, st); | |
163 | return !ent->include; | |
164 | } | |
165 | } | |
2b6b4d53 | 166 | } |
c627d613 | 167 | |
2b6b4d53 | 168 | if (local_exclude_list) { |
d567322f | 169 | for (n=0; local_exclude_list[n]; n++) { |
531d06b8 | 170 | ent = local_exclude_list[n]; |
d567322f MP |
171 | if (check_one_exclude(name, ent, st)) { |
172 | report_exclude_result(name, ent, st); | |
173 | return !ent->include; | |
174 | } | |
175 | } | |
2b6b4d53 | 176 | } |
c627d613 | 177 | |
2b6b4d53 | 178 | return 0; |
c627d613 AT |
179 | } |
180 | ||
181 | ||
f0f5767f | 182 | void add_exclude_list(const char *pattern, struct exclude_struct ***list, int include) |
c627d613 | 183 | { |
2b6b4d53 AT |
184 | int len=0; |
185 | if (list && *list) | |
186 | for (; (*list)[len]; len++) ; | |
187 | ||
188 | if (strcmp(pattern,"!") == 0) { | |
189 | if (verbose > 2) | |
190 | rprintf(FINFO,"clearing exclude list\n"); | |
191 | while ((len)--) { | |
192 | free_exclude((*list)[len]); | |
193 | } | |
194 | free((*list)); | |
195 | *list = NULL; | |
196 | return; | |
197 | } | |
198 | ||
fe8c0a98 | 199 | *list = (struct exclude_struct **)Realloc(*list,sizeof(struct exclude_struct *)*(len+2)); |
2b6b4d53 AT |
200 | |
201 | if (!*list || !((*list)[len] = make_exclude(pattern, include))) | |
202 | out_of_memory("add_exclude"); | |
203 | ||
204 | if (verbose > 2) | |
205 | rprintf(FINFO,"add_exclude(%s)\n",pattern); | |
206 | ||
207 | (*list)[len+1] = NULL; | |
c627d613 AT |
208 | } |
209 | ||
f0f5767f | 210 | void add_exclude(const char *pattern, int include) |
c627d613 | 211 | { |
2b6b4d53 | 212 | add_exclude_list(pattern,&exclude_list, include); |
c627d613 AT |
213 | } |
214 | ||
f0f5767f | 215 | struct exclude_struct **make_exclude_list(const char *fname, |
2b6b4d53 AT |
216 | struct exclude_struct **list1, |
217 | int fatal, int include) | |
c627d613 | 218 | { |
2b6b4d53 AT |
219 | struct exclude_struct **list=list1; |
220 | FILE *f = fopen(fname,"r"); | |
221 | char line[MAXPATHLEN]; | |
222 | if (!f) { | |
223 | if (fatal) { | |
a039749b MP |
224 | rsyserr(FERROR, errno, |
225 | "failed to open %s file %s", | |
226 | include ? "include" : "exclude", | |
227 | fname); | |
65417579 | 228 | exit_cleanup(RERR_FILEIO); |
2b6b4d53 AT |
229 | } |
230 | return list; | |
231 | } | |
232 | ||
233 | while (fgets(line,MAXPATHLEN,f)) { | |
234 | int l = strlen(line); | |
235 | if (l && line[l-1] == '\n') l--; | |
236 | line[l] = 0; | |
122f19a6 DD |
237 | if (line[0] && (line[0] != ';') && (line[0] != '#')) { |
238 | /* Skip lines starting with semicolon or pound. | |
239 | It probably wouldn't cause any harm to not skip | |
240 | them but there's no need to save them. */ | |
241 | add_exclude_list(line,&list,include); | |
242 | } | |
2b6b4d53 AT |
243 | } |
244 | fclose(f); | |
245 | return list; | |
c627d613 AT |
246 | } |
247 | ||
248 | ||
f0f5767f | 249 | void add_exclude_file(const char *fname, int fatal, int include) |
c627d613 | 250 | { |
8f3a2d54 AT |
251 | if (!fname || !*fname) return; |
252 | ||
2b6b4d53 | 253 | exclude_list = make_exclude_list(fname,exclude_list,fatal,include); |
c627d613 AT |
254 | } |
255 | ||
256 | ||
257 | void send_exclude_list(int f) | |
258 | { | |
2b6b4d53 AT |
259 | int i; |
260 | extern int remote_version; | |
25cf8893 AT |
261 | extern int list_only, recurse; |
262 | ||
263 | /* this is a complete hack - blame Rusty */ | |
264 | if (list_only && !recurse) { | |
265 | add_exclude("/*/*", 0); | |
266 | } | |
2b6b4d53 AT |
267 | |
268 | if (!exclude_list) { | |
269 | write_int(f,0); | |
270 | return; | |
271 | } | |
272 | ||
273 | for (i=0;exclude_list[i];i++) { | |
2b6b4d53 | 274 | int l; |
2fb139c1 AT |
275 | char pattern[MAXPATHLEN]; |
276 | ||
277 | strlcpy(pattern,exclude_list[i]->pattern,sizeof(pattern)); | |
278 | if (exclude_list[i]->directory) strlcat(pattern,"/", sizeof(pattern)); | |
2b6b4d53 | 279 | |
587cb08d DD |
280 | l = strlen(pattern); |
281 | if (l == 0) continue; | |
282 | if (exclude_list[i]->include) { | |
283 | if (remote_version < 19) { | |
2b6b4d53 | 284 | rprintf(FERROR,"remote rsync does not support include syntax - aborting\n"); |
ec9df380 | 285 | exit_cleanup(RERR_UNSUPPORTED); |
2b6b4d53 | 286 | } |
587cb08d DD |
287 | write_int(f,l+2); |
288 | write_buf(f,"+ ",2); | |
289 | } else { | |
290 | write_int(f,l); | |
2b6b4d53 | 291 | } |
2b6b4d53 AT |
292 | write_buf(f,pattern,l); |
293 | } | |
294 | ||
295 | write_int(f,0); | |
c627d613 AT |
296 | } |
297 | ||
298 | ||
299 | void recv_exclude_list(int f) | |
300 | { | |
2b6b4d53 AT |
301 | char line[MAXPATHLEN]; |
302 | int l; | |
303 | while ((l=read_int(f))) { | |
304 | if (l >= MAXPATHLEN) overflow("recv_exclude_list"); | |
305 | read_sbuf(f,line,l); | |
306 | add_exclude(line,0); | |
307 | } | |
c627d613 AT |
308 | } |
309 | ||
651443a7 DD |
310 | /* Get the next include/exclude arg from the string. It works in a similar way |
311 | ** to strtok - initially an arg is sent over, from then on NULL. This | |
312 | ** routine takes into account any +/- in the strings and does not | |
313 | ** consider the space following it as a delimeter. | |
314 | */ | |
315 | char *get_exclude_tok(char *p) | |
316 | { | |
317 | static char *s; | |
318 | static int more; | |
319 | char *t; | |
320 | ||
321 | if (p) { | |
322 | s=p; | |
323 | if (*p) | |
324 | more=1; | |
325 | } | |
326 | ||
327 | if (!more) | |
328 | return(NULL); | |
c627d613 | 329 | |
651443a7 DD |
330 | /* Skip over any initial spaces */ |
331 | while(isspace(*s)) | |
332 | s++; | |
333 | ||
334 | /* Are we at the end of the string? */ | |
335 | if (*s) { | |
336 | /* remember the beginning of the token */ | |
337 | t=s; | |
338 | ||
339 | /* Is this a '+' or '-' followed by a space (not whitespace)? */ | |
340 | if ((*s=='+' || *s=='-') && *(s+1)==' ') | |
341 | s+=2; | |
342 | ||
343 | /* Skip to the next space or the end of the string */ | |
344 | while(!isspace(*s) && *s!='\0') | |
345 | s++; | |
346 | } else { | |
347 | t=NULL; | |
348 | } | |
349 | ||
350 | /* Have we reached the end of the string? */ | |
351 | if (*s) | |
352 | *s++='\0'; | |
353 | else | |
354 | more=0; | |
355 | return(t); | |
356 | } | |
357 | ||
358 | ||
8f3a2d54 AT |
359 | void add_exclude_line(char *p) |
360 | { | |
361 | char *tok; | |
362 | if (!p || !*p) return; | |
363 | p = strdup(p); | |
364 | if (!p) out_of_memory("add_exclude_line"); | |
651443a7 | 365 | for (tok=get_exclude_tok(p); tok; tok=get_exclude_tok(NULL)) |
2b6b4d53 | 366 | add_exclude(tok, 0); |
8f3a2d54 AT |
367 | free(p); |
368 | } | |
369 | ||
cd64343a DD |
370 | void add_include_line(char *p) |
371 | { | |
372 | char *tok; | |
373 | if (!p || !*p) return; | |
374 | p = strdup(p); | |
375 | if (!p) out_of_memory("add_include_line"); | |
651443a7 | 376 | for (tok=get_exclude_tok(p); tok; tok=get_exclude_tok(NULL)) |
cd64343a DD |
377 | add_exclude(tok, 1); |
378 | free(p); | |
379 | } | |
380 | ||
8f3a2d54 | 381 | |
c627d613 AT |
382 | static char *cvs_ignore_list[] = { |
383 | "RCS","SCCS","CVS","CVS.adm","RCSLOG","cvslog.*", | |
384 | "tags","TAGS",".make.state",".nse_depinfo", | |
385 | "*~", "#*", ".#*", ",*", "*.old", "*.bak", "*.BAK", "*.orig", | |
386 | "*.rej", ".del-*", "*.a", "*.o", "*.obj", "*.so", "*.Z", "*.elc", "*.ln", | |
387 | "core",NULL}; | |
388 | ||
389 | ||
390 | ||
391 | void add_cvs_excludes(void) | |
392 | { | |
2b6b4d53 AT |
393 | char fname[MAXPATHLEN]; |
394 | char *p; | |
395 | int i; | |
c627d613 | 396 | |
2b6b4d53 AT |
397 | for (i=0; cvs_ignore_list[i]; i++) |
398 | add_exclude(cvs_ignore_list[i], 0); | |
c627d613 | 399 | |
2b6b4d53 | 400 | if ((p=getenv("HOME")) && strlen(p) < (MAXPATHLEN-12)) { |
8950ac03 | 401 | snprintf(fname,sizeof(fname), "%s/.cvsignore",p); |
2b6b4d53 AT |
402 | add_exclude_file(fname,0,0); |
403 | } | |
c627d613 | 404 | |
2b6b4d53 | 405 | add_exclude_line(getenv("CVSIGNORE")); |
c627d613 | 406 | } |