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