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 | ||
20 | /* generate and receive file lists */ | |
21 | ||
22 | #include "rsync.h" | |
23 | ||
a800434a AT |
24 | extern struct stats stats; |
25 | ||
43a481dc AT |
26 | extern int csum_length; |
27 | ||
c627d613 AT |
28 | extern int verbose; |
29 | extern int am_server; | |
30 | extern int always_checksum; | |
c627d613 AT |
31 | |
32 | extern int cvs_exclude; | |
33 | ||
a06d19e3 AT |
34 | extern int recurse; |
35 | ||
c627d613 AT |
36 | extern int one_file_system; |
37 | extern int make_backups; | |
38 | extern int preserve_links; | |
dc5ddbcc | 39 | extern int preserve_hard_links; |
c627d613 AT |
40 | extern int preserve_perms; |
41 | extern int preserve_devices; | |
42 | extern int preserve_uid; | |
43 | extern int preserve_gid; | |
44 | extern int preserve_times; | |
6574b4f7 | 45 | extern int relative_paths; |
82306bf6 | 46 | extern int copy_links; |
b5313607 | 47 | extern int copy_unsafe_links; |
f6c34742 | 48 | extern int remote_version; |
6ba9279f | 49 | extern int io_error; |
c627d613 | 50 | |
b5313607 DD |
51 | static char topsrcname[MAXPATHLEN]; |
52 | ||
2b6b4d53 | 53 | static struct exclude_struct **local_exclude_list; |
c627d613 | 54 | |
0199b05f AT |
55 | static void clean_flist(struct file_list *flist, int strip_root); |
56 | ||
f7632fc6 AT |
57 | |
58 | static void list_file_entry(struct file_struct *f) | |
59 | { | |
60 | char perms[11] = "----------"; | |
61 | char *perm_map = "rwxrwxrwx"; | |
62 | int i; | |
63 | ||
7212be92 DD |
64 | if (!f->basename) |
65 | /* this can happen if duplicate names were removed */ | |
66 | return; | |
67 | ||
f7632fc6 AT |
68 | for (i=0;i<9;i++) { |
69 | if (f->mode & (1<<i)) perms[9-i] = perm_map[8-i]; | |
70 | } | |
71 | if (S_ISLNK(f->mode)) perms[0] = 'l'; | |
72 | if (S_ISDIR(f->mode)) perms[0] = 'd'; | |
73 | if (S_ISBLK(f->mode)) perms[0] = 'b'; | |
74 | if (S_ISCHR(f->mode)) perms[0] = 'c'; | |
75 | if (S_ISSOCK(f->mode)) perms[0] = 's'; | |
76 | if (S_ISFIFO(f->mode)) perms[0] = 'p'; | |
77 | ||
78 | if (preserve_links && S_ISLNK(f->mode)) { | |
79 | rprintf(FINFO,"%s %11.0f %s %s -> %s\n", | |
80 | perms, | |
81 | (double)f->length, timestring(f->modtime), | |
82 | f_name(f), f->link); | |
83 | } else { | |
84 | rprintf(FINFO,"%s %11.0f %s %s\n", | |
85 | perms, | |
86 | (double)f->length, timestring(f->modtime), f_name(f)); | |
87 | } | |
88 | } | |
89 | ||
90 | ||
b5313607 DD |
91 | int readlink_stat(const char *Path, STRUCT_STAT *Buffer, char *Linkbuf) |
92 | { | |
93 | #if SUPPORT_LINKS | |
94 | if (copy_links) { | |
95 | return do_stat(Path, Buffer); | |
96 | } | |
97 | if (do_lstat(Path, Buffer) == -1) { | |
98 | return -1; | |
99 | } | |
100 | if (S_ISLNK(Buffer->st_mode)) { | |
101 | int l; | |
102 | if ((l = readlink(Path,Linkbuf,MAXPATHLEN-1)) == -1) { | |
103 | return -1; | |
104 | } | |
105 | Linkbuf[l] = 0; | |
106 | if (copy_unsafe_links && (topsrcname[0] != '\0') && | |
107 | unsafe_symlink(Linkbuf, topsrcname)) { | |
108 | return do_stat(Path, Buffer); | |
109 | } | |
110 | } | |
111 | return 0; | |
112 | #else | |
113 | return do_stat(Path, Buffer); | |
114 | #endif | |
115 | } | |
116 | ||
bcacc18b | 117 | int link_stat(const char *Path, STRUCT_STAT *Buffer) |
82306bf6 AT |
118 | { |
119 | #if SUPPORT_LINKS | |
120 | if (copy_links) { | |
bcacc18b | 121 | return do_stat(Path, Buffer); |
82306bf6 | 122 | } else { |
bcacc18b | 123 | return do_lstat(Path, Buffer); |
82306bf6 AT |
124 | } |
125 | #else | |
bcacc18b | 126 | return do_stat(Path, Buffer); |
82306bf6 AT |
127 | #endif |
128 | } | |
129 | ||
c627d613 AT |
130 | /* |
131 | This function is used to check if a file should be included/excluded | |
132 | from the list of files based on its name and type etc | |
133 | */ | |
bcacc18b | 134 | static int match_file_name(char *fname,STRUCT_STAT *st) |
c627d613 | 135 | { |
2b6b4d53 | 136 | if (check_exclude(fname,local_exclude_list,st)) { |
c627d613 | 137 | if (verbose > 2) |
9486289c | 138 | rprintf(FINFO,"excluding file %s\n",fname); |
c627d613 AT |
139 | return 0; |
140 | } | |
141 | return 1; | |
142 | } | |
143 | ||
144 | /* used by the one_file_system code */ | |
145 | static dev_t filesystem_dev; | |
146 | ||
147 | static void set_filesystem(char *fname) | |
148 | { | |
bcacc18b | 149 | STRUCT_STAT st; |
82306bf6 | 150 | if (link_stat(fname,&st) != 0) return; |
c627d613 AT |
151 | filesystem_dev = st.st_dev; |
152 | } | |
153 | ||
154 | ||
b280a1f4 AT |
155 | static int to_wire_mode(mode_t mode) |
156 | { | |
157 | if (S_ISLNK(mode) && (S_IFLNK != 0120000)) { | |
158 | return (mode & ~(_S_IFMT)) | 0120000; | |
159 | } | |
160 | return (int)mode; | |
161 | } | |
162 | ||
163 | static mode_t from_wire_mode(int mode) | |
164 | { | |
165 | if ((mode & (_S_IFMT)) == 0120000 && (S_IFLNK != 0120000)) { | |
166 | return (mode & ~(_S_IFMT)) | S_IFLNK; | |
167 | } | |
168 | return (mode_t)mode; | |
169 | } | |
170 | ||
171 | ||
c627d613 AT |
172 | static void send_directory(int f,struct file_list *flist,char *dir); |
173 | ||
3a6a366f | 174 | static char *flist_dir; |
c627d613 | 175 | |
3ec4dd97 | 176 | |
6e4fb64e | 177 | static void send_file_entry(struct file_struct *file,int f,unsigned base_flags) |
c627d613 | 178 | { |
72914a60 AT |
179 | unsigned char flags; |
180 | static time_t last_time; | |
181 | static mode_t last_mode; | |
182 | static dev_t last_rdev; | |
183 | static uid_t last_uid; | |
184 | static gid_t last_gid; | |
185 | static char lastname[MAXPATHLEN]; | |
186 | char *fname; | |
187 | int l1,l2; | |
188 | ||
189 | if (f == -1) return; | |
190 | ||
191 | if (!file) { | |
192 | write_byte(f,0); | |
193 | return; | |
194 | } | |
195 | ||
196 | fname = f_name(file); | |
197 | ||
198 | flags = base_flags; | |
199 | ||
200 | if (file->mode == last_mode) flags |= SAME_MODE; | |
201 | if (file->rdev == last_rdev) flags |= SAME_RDEV; | |
202 | if (file->uid == last_uid) flags |= SAME_UID; | |
203 | if (file->gid == last_gid) flags |= SAME_GID; | |
204 | if (file->modtime == last_time) flags |= SAME_TIME; | |
205 | ||
206 | for (l1=0;lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);l1++) ; | |
207 | l2 = strlen(fname) - l1; | |
208 | ||
209 | if (l1 > 0) flags |= SAME_NAME; | |
210 | if (l2 > 255) flags |= LONG_NAME; | |
211 | ||
212 | /* we must make sure we don't send a zero flags byte or the other | |
213 | end will terminate the flist transfer */ | |
214 | if (flags == 0 && !S_ISDIR(file->mode)) flags |= FLAG_DELETE; | |
215 | if (flags == 0) flags |= LONG_NAME; | |
216 | ||
217 | write_byte(f,flags); | |
218 | if (flags & SAME_NAME) | |
219 | write_byte(f,l1); | |
220 | if (flags & LONG_NAME) | |
221 | write_int(f,l2); | |
222 | else | |
223 | write_byte(f,l2); | |
224 | write_buf(f,fname+l1,l2); | |
225 | ||
226 | write_longint(f,file->length); | |
227 | if (!(flags & SAME_TIME)) | |
228 | write_int(f,(int)file->modtime); | |
229 | if (!(flags & SAME_MODE)) | |
b280a1f4 | 230 | write_int(f,to_wire_mode(file->mode)); |
72914a60 AT |
231 | if (preserve_uid && !(flags & SAME_UID)) { |
232 | add_uid(file->uid); | |
233 | write_int(f,(int)file->uid); | |
234 | } | |
235 | if (preserve_gid && !(flags & SAME_GID)) { | |
236 | add_gid(file->gid); | |
237 | write_int(f,(int)file->gid); | |
238 | } | |
239 | if (preserve_devices && IS_DEVICE(file->mode) && !(flags & SAME_RDEV)) | |
240 | write_int(f,(int)file->rdev); | |
c627d613 AT |
241 | |
242 | #if SUPPORT_LINKS | |
72914a60 AT |
243 | if (preserve_links && S_ISLNK(file->mode)) { |
244 | write_int(f,strlen(file->link)); | |
245 | write_buf(f,file->link,strlen(file->link)); | |
246 | } | |
c627d613 AT |
247 | #endif |
248 | ||
dc5ddbcc | 249 | #if SUPPORT_HARD_LINKS |
72914a60 AT |
250 | if (preserve_hard_links && S_ISREG(file->mode)) { |
251 | write_int(f,(int)file->dev); | |
252 | write_int(f,(int)file->inode); | |
253 | } | |
dc5ddbcc AT |
254 | #endif |
255 | ||
72914a60 AT |
256 | if (always_checksum) { |
257 | write_buf(f,file->sum,csum_length); | |
258 | } | |
182dca5c | 259 | |
72914a60 AT |
260 | last_mode = file->mode; |
261 | last_rdev = file->rdev; | |
262 | last_uid = file->uid; | |
263 | last_gid = file->gid; | |
264 | last_time = file->modtime; | |
4fe159a8 | 265 | |
37f9805d | 266 | strlcpy(lastname,fname,MAXPATHLEN); |
72914a60 | 267 | lastname[MAXPATHLEN-1] = 0; |
182dca5c AT |
268 | } |
269 | ||
270 | ||
271 | ||
3333ffbd AT |
272 | static void receive_file_entry(struct file_struct **fptr, |
273 | unsigned flags,int f) | |
182dca5c | 274 | { |
72914a60 AT |
275 | static time_t last_time; |
276 | static mode_t last_mode; | |
277 | static dev_t last_rdev; | |
278 | static uid_t last_uid; | |
279 | static gid_t last_gid; | |
280 | static char lastname[MAXPATHLEN]; | |
281 | char thisname[MAXPATHLEN]; | |
282 | int l1=0,l2=0; | |
283 | char *p; | |
284 | struct file_struct *file; | |
285 | ||
286 | if (flags & SAME_NAME) | |
287 | l1 = read_byte(f); | |
4fe159a8 | 288 | |
72914a60 AT |
289 | if (flags & LONG_NAME) |
290 | l2 = read_int(f); | |
291 | else | |
292 | l2 = read_byte(f); | |
293 | ||
294 | file = (struct file_struct *)malloc(sizeof(*file)); | |
295 | if (!file) out_of_memory("receive_file_entry"); | |
296 | memset((char *)file, 0, sizeof(*file)); | |
297 | (*fptr) = file; | |
298 | ||
299 | if (l2 >= MAXPATHLEN-l1) overflow("receive_file_entry"); | |
300 | ||
37f9805d | 301 | strlcpy(thisname,lastname,l1+1); |
72914a60 AT |
302 | read_sbuf(f,&thisname[l1],l2); |
303 | thisname[l1+l2] = 0; | |
304 | ||
37f9805d | 305 | strlcpy(lastname,thisname,MAXPATHLEN); |
72914a60 AT |
306 | lastname[MAXPATHLEN-1] = 0; |
307 | ||
308 | clean_fname(thisname); | |
309 | ||
72914a60 AT |
310 | if ((p = strrchr(thisname,'/'))) { |
311 | static char *lastdir; | |
312 | *p = 0; | |
313 | if (lastdir && strcmp(thisname, lastdir)==0) { | |
314 | file->dirname = lastdir; | |
315 | } else { | |
316 | file->dirname = strdup(thisname); | |
317 | lastdir = file->dirname; | |
318 | } | |
319 | file->basename = strdup(p+1); | |
320 | } else { | |
321 | file->dirname = NULL; | |
322 | file->basename = strdup(thisname); | |
323 | } | |
324 | ||
325 | if (!file->basename) out_of_memory("receive_file_entry 1"); | |
326 | ||
327 | ||
328 | file->flags = flags; | |
329 | file->length = read_longint(f); | |
330 | file->modtime = (flags & SAME_TIME) ? last_time : (time_t)read_int(f); | |
b280a1f4 | 331 | file->mode = (flags & SAME_MODE) ? last_mode : from_wire_mode(read_int(f)); |
72914a60 AT |
332 | if (preserve_uid) |
333 | file->uid = (flags & SAME_UID) ? last_uid : (uid_t)read_int(f); | |
334 | if (preserve_gid) | |
335 | file->gid = (flags & SAME_GID) ? last_gid : (gid_t)read_int(f); | |
336 | if (preserve_devices && IS_DEVICE(file->mode)) | |
337 | file->rdev = (flags & SAME_RDEV) ? last_rdev : (dev_t)read_int(f); | |
338 | ||
339 | if (preserve_links && S_ISLNK(file->mode)) { | |
340 | int l = read_int(f); | |
341 | file->link = (char *)malloc(l+1); | |
342 | if (!file->link) out_of_memory("receive_file_entry 2"); | |
343 | read_sbuf(f,file->link,l); | |
344 | } | |
dc5ddbcc AT |
345 | |
346 | #if SUPPORT_HARD_LINKS | |
72914a60 AT |
347 | if (preserve_hard_links && S_ISREG(file->mode)) { |
348 | file->dev = read_int(f); | |
349 | file->inode = read_int(f); | |
350 | } | |
dc5ddbcc | 351 | #endif |
182dca5c | 352 | |
72914a60 AT |
353 | if (always_checksum) { |
354 | file->sum = (char *)malloc(MD4_SUM_LENGTH); | |
355 | if (!file->sum) out_of_memory("md4 sum"); | |
356 | read_buf(f,file->sum,csum_length); | |
357 | } | |
182dca5c | 358 | |
72914a60 AT |
359 | last_mode = file->mode; |
360 | last_rdev = file->rdev; | |
361 | last_uid = file->uid; | |
362 | last_gid = file->gid; | |
363 | last_time = file->modtime; | |
364 | ||
365 | if (!preserve_perms) { | |
366 | extern int orig_umask; | |
367 | /* set an appropriate set of permissions based on original | |
368 | permissions and umask. This emulates what GNU cp does */ | |
369 | file->mode &= ~orig_umask; | |
370 | } | |
c627d613 AT |
371 | } |
372 | ||
373 | ||
0c5f37d9 AT |
374 | /* determine if a file in a different filesstem should be skipped |
375 | when one_file_system is set. We bascally only want to include | |
376 | the mount points - but they can be hard to find! */ | |
bcacc18b | 377 | static int skip_filesystem(char *fname, STRUCT_STAT *st) |
0c5f37d9 | 378 | { |
bcacc18b | 379 | STRUCT_STAT st2; |
0c5f37d9 AT |
380 | char *p = strrchr(fname, '/'); |
381 | ||
382 | /* skip all but directories */ | |
383 | if (!S_ISDIR(st->st_mode)) return 1; | |
384 | ||
385 | /* if its not a subdirectory then allow */ | |
386 | if (!p) return 0; | |
387 | ||
388 | *p = 0; | |
389 | if (link_stat(fname, &st2)) { | |
390 | *p = '/'; | |
391 | return 0; | |
392 | } | |
393 | *p = '/'; | |
394 | ||
395 | return (st2.st_dev != filesystem_dev); | |
396 | } | |
4fe159a8 | 397 | |
a06d19e3 | 398 | static struct file_struct *make_file(char *fname) |
c627d613 | 399 | { |
3ec4dd97 | 400 | struct file_struct *file; |
bcacc18b | 401 | STRUCT_STAT st; |
3ec4dd97 AT |
402 | char sum[SUM_LENGTH]; |
403 | char *p; | |
404 | char cleaned_name[MAXPATHLEN]; | |
b5313607 | 405 | char linkbuf[MAXPATHLEN]; |
3ec4dd97 | 406 | |
37f9805d | 407 | strlcpy(cleaned_name, fname, MAXPATHLEN); |
3ec4dd97 AT |
408 | cleaned_name[MAXPATHLEN-1] = 0; |
409 | clean_fname(cleaned_name); | |
410 | fname = cleaned_name; | |
411 | ||
f5780433 | 412 | memset(sum,0,SUM_LENGTH); |
3ec4dd97 | 413 | |
b5313607 | 414 | if (readlink_stat(fname,&st,linkbuf) != 0) { |
6ba9279f | 415 | io_error = 1; |
9486289c | 416 | rprintf(FERROR,"%s: %s\n", |
3ec4dd97 AT |
417 | fname,strerror(errno)); |
418 | return NULL; | |
419 | } | |
c627d613 | 420 | |
3ec4dd97 | 421 | if (S_ISDIR(st.st_mode) && !recurse) { |
9486289c | 422 | rprintf(FINFO,"skipping directory %s\n",fname); |
3ec4dd97 AT |
423 | return NULL; |
424 | } | |
425 | ||
0c5f37d9 AT |
426 | if (one_file_system && st.st_dev != filesystem_dev) { |
427 | if (skip_filesystem(fname, &st)) | |
428 | return NULL; | |
429 | } | |
3ec4dd97 AT |
430 | |
431 | if (!match_file_name(fname,&st)) | |
432 | return NULL; | |
433 | ||
434 | if (verbose > 2) | |
9486289c | 435 | rprintf(FINFO,"make_file(%s)\n",fname); |
3ec4dd97 AT |
436 | |
437 | file = (struct file_struct *)malloc(sizeof(*file)); | |
438 | if (!file) out_of_memory("make_file"); | |
f5780433 | 439 | memset((char *)file,0,sizeof(*file)); |
3ec4dd97 AT |
440 | |
441 | if ((p = strrchr(fname,'/'))) { | |
442 | static char *lastdir; | |
443 | *p = 0; | |
444 | if (lastdir && strcmp(fname, lastdir)==0) { | |
445 | file->dirname = lastdir; | |
446 | } else { | |
447 | file->dirname = strdup(fname); | |
448 | lastdir = file->dirname; | |
449 | } | |
450 | file->basename = strdup(p+1); | |
451 | *p = '/'; | |
452 | } else { | |
453 | file->dirname = NULL; | |
454 | file->basename = strdup(fname); | |
455 | } | |
c627d613 | 456 | |
3ec4dd97 AT |
457 | file->modtime = st.st_mtime; |
458 | file->length = st.st_size; | |
459 | file->mode = st.st_mode; | |
460 | file->uid = st.st_uid; | |
461 | file->gid = st.st_gid; | |
462 | file->dev = st.st_dev; | |
463 | file->inode = st.st_ino; | |
c627d613 | 464 | #ifdef HAVE_ST_RDEV |
3ec4dd97 | 465 | file->rdev = st.st_rdev; |
c627d613 AT |
466 | #endif |
467 | ||
468 | #if SUPPORT_LINKS | |
3ec4dd97 | 469 | if (S_ISLNK(st.st_mode)) { |
b5313607 | 470 | file->link = strdup(linkbuf); |
3ec4dd97 | 471 | } |
c627d613 AT |
472 | #endif |
473 | ||
1250f24e | 474 | if (always_checksum) { |
2d0bb8eb AT |
475 | file->sum = (char *)malloc(MD4_SUM_LENGTH); |
476 | if (!file->sum) out_of_memory("md4 sum"); | |
1250f24e AT |
477 | /* drat. we have to provide a null checksum for non-regular |
478 | files in order to be compatible with earlier versions | |
479 | of rsync */ | |
480 | if (S_ISREG(st.st_mode)) { | |
481 | file_checksum(fname,file->sum,st.st_size); | |
482 | } else { | |
483 | memset(file->sum, 0, MD4_SUM_LENGTH); | |
484 | } | |
3ec4dd97 | 485 | } |
c627d613 | 486 | |
3ec4dd97 AT |
487 | if (flist_dir) { |
488 | static char *lastdir; | |
489 | if (lastdir && strcmp(lastdir, flist_dir)==0) { | |
490 | file->basedir = lastdir; | |
491 | } else { | |
492 | file->basedir = strdup(flist_dir); | |
493 | lastdir = file->basedir; | |
494 | } | |
495 | } else { | |
496 | file->basedir = NULL; | |
497 | } | |
c627d613 | 498 | |
3ec4dd97 | 499 | if (!S_ISDIR(st.st_mode)) |
a800434a | 500 | stats.total_size += st.st_size; |
c627d613 | 501 | |
3ec4dd97 | 502 | return file; |
c627d613 AT |
503 | } |
504 | ||
505 | ||
506 | ||
2bca43f6 | 507 | void send_file_name(int f,struct file_list *flist,char *fname, |
3333ffbd | 508 | int recursive, unsigned base_flags) |
c627d613 AT |
509 | { |
510 | struct file_struct *file; | |
511 | ||
a06d19e3 | 512 | file = make_file(fname); |
c627d613 AT |
513 | |
514 | if (!file) return; | |
515 | ||
516 | if (flist->count >= flist->malloced) { | |
3ec4dd97 AT |
517 | if (flist->malloced < 1000) |
518 | flist->malloced += 1000; | |
f9c51620 | 519 | else |
3ec4dd97 AT |
520 | flist->malloced *= 2; |
521 | flist->files = (struct file_struct **)realloc(flist->files, | |
522 | sizeof(flist->files[0])* | |
523 | flist->malloced); | |
f9c51620 AT |
524 | if (!flist->files) |
525 | out_of_memory("send_file_name"); | |
c627d613 AT |
526 | } |
527 | ||
3ec4dd97 AT |
528 | if (strcmp(file->basename,"")) { |
529 | flist->files[flist->count++] = file; | |
3333ffbd | 530 | send_file_entry(file,f,base_flags); |
c627d613 AT |
531 | } |
532 | ||
649d65ed | 533 | if (S_ISDIR(file->mode) && recursive) { |
2b6b4d53 AT |
534 | struct exclude_struct **last_exclude_list = local_exclude_list; |
535 | send_directory(f,flist,f_name(file)); | |
536 | local_exclude_list = last_exclude_list; | |
537 | return; | |
c627d613 AT |
538 | } |
539 | } | |
540 | ||
541 | ||
542 | ||
543 | static void send_directory(int f,struct file_list *flist,char *dir) | |
544 | { | |
3ec4dd97 AT |
545 | DIR *d; |
546 | struct dirent *di; | |
547 | char fname[MAXPATHLEN]; | |
548 | int l; | |
549 | char *p; | |
550 | ||
551 | d = opendir(dir); | |
552 | if (!d) { | |
6ba9279f | 553 | io_error = 1; |
2f7512b0 | 554 | rprintf(FERROR,"opendir(%s): %s\n", |
3ec4dd97 AT |
555 | dir,strerror(errno)); |
556 | return; | |
557 | } | |
c627d613 | 558 | |
37f9805d | 559 | strlcpy(fname,dir,MAXPATHLEN); |
3ec4dd97 AT |
560 | l = strlen(fname); |
561 | if (fname[l-1] != '/') { | |
562 | if (l == MAXPATHLEN-1) { | |
6ba9279f | 563 | io_error = 1; |
9486289c | 564 | rprintf(FERROR,"skipping long-named directory %s\n",fname); |
3ec4dd97 AT |
565 | closedir(d); |
566 | return; | |
567 | } | |
37f9805d | 568 | strlcat(fname,"/", MAXPATHLEN); |
3ec4dd97 AT |
569 | l++; |
570 | } | |
571 | p = fname + strlen(fname); | |
c627d613 | 572 | |
3d913675 AT |
573 | local_exclude_list = NULL; |
574 | ||
3ec4dd97 AT |
575 | if (cvs_exclude) { |
576 | if (strlen(fname) + strlen(".cvsignore") <= MAXPATHLEN-1) { | |
577 | strcpy(p,".cvsignore"); | |
2b6b4d53 | 578 | local_exclude_list = make_exclude_list(fname,NULL,0,0); |
3ec4dd97 | 579 | } else { |
6ba9279f | 580 | io_error = 1; |
9486289c | 581 | rprintf(FINFO,"cannot cvs-exclude in long-named directory %s\n",fname); |
3ec4dd97 AT |
582 | } |
583 | } | |
584 | ||
585 | for (di=readdir(d); di; di=readdir(d)) { | |
d6e6ecbd AT |
586 | char *dname = d_name(di); |
587 | if (strcmp(dname,".")==0 || | |
588 | strcmp(dname,"..")==0) | |
3ec4dd97 | 589 | continue; |
37f9805d | 590 | strlcpy(p,dname,MAXPATHLEN-l); |
7b1ce0d7 | 591 | send_file_name(f,flist,fname,recurse,0); |
3ec4dd97 | 592 | } |
c627d613 | 593 | |
3d913675 AT |
594 | if (local_exclude_list) { |
595 | add_exclude_list("!", &local_exclude_list, 0); | |
596 | } | |
597 | ||
3ec4dd97 | 598 | closedir(d); |
c627d613 AT |
599 | } |
600 | ||
601 | ||
602 | ||
a06d19e3 | 603 | struct file_list *send_file_list(int f,int argc,char *argv[]) |
c627d613 | 604 | { |
649d65ed | 605 | int i,l; |
bcacc18b | 606 | STRUCT_STAT st; |
2bca43f6 | 607 | char *p,*dir,*olddir; |
649d65ed AT |
608 | char lastpath[MAXPATHLEN]=""; |
609 | struct file_list *flist; | |
a800434a | 610 | int64 start_write; |
649d65ed AT |
611 | |
612 | if (verbose && recurse && !am_server && f != -1) { | |
9486289c AT |
613 | rprintf(FINFO,"building file list ... "); |
614 | rflush(FINFO); | |
649d65ed | 615 | } |
c627d613 | 616 | |
a800434a AT |
617 | start_write = stats.total_written; |
618 | ||
649d65ed AT |
619 | flist = (struct file_list *)malloc(sizeof(flist[0])); |
620 | if (!flist) out_of_memory("send_file_list"); | |
c627d613 | 621 | |
649d65ed AT |
622 | flist->count=0; |
623 | flist->malloced = 1000; | |
624 | flist->files = (struct file_struct **)malloc(sizeof(flist->files[0])* | |
625 | flist->malloced); | |
626 | if (!flist->files) out_of_memory("send_file_list"); | |
c627d613 | 627 | |
d6dead6b AT |
628 | if (f != -1) { |
629 | io_start_buffering(f); | |
630 | } | |
631 | ||
649d65ed | 632 | for (i=0;i<argc;i++) { |
b5313607 | 633 | char *fname = topsrcname; |
c627d613 | 634 | |
37f9805d | 635 | strlcpy(fname,argv[i],MAXPATHLEN); |
c627d613 | 636 | |
649d65ed AT |
637 | l = strlen(fname); |
638 | if (l != 1 && fname[l-1] == '/') { | |
37f9805d | 639 | strlcat(fname,".",MAXPATHLEN); |
649d65ed | 640 | } |
c627d613 | 641 | |
649d65ed | 642 | if (link_stat(fname,&st) != 0) { |
6ba9279f | 643 | io_error=1; |
9486289c | 644 | rprintf(FERROR,"%s : %s\n",fname,strerror(errno)); |
649d65ed AT |
645 | continue; |
646 | } | |
c627d613 | 647 | |
649d65ed | 648 | if (S_ISDIR(st.st_mode) && !recurse) { |
9486289c | 649 | rprintf(FINFO,"skipping directory %s\n",fname); |
649d65ed AT |
650 | continue; |
651 | } | |
c627d613 | 652 | |
649d65ed | 653 | dir = NULL; |
2bca43f6 | 654 | olddir = NULL; |
649d65ed AT |
655 | |
656 | if (!relative_paths) { | |
657 | p = strrchr(fname,'/'); | |
658 | if (p) { | |
659 | *p = 0; | |
660 | if (p == fname) | |
661 | dir = "/"; | |
662 | else | |
663 | dir = fname; | |
664 | fname = p+1; | |
665 | } | |
666 | } else if (f != -1 && (p=strrchr(fname,'/'))) { | |
667 | /* this ensures we send the intermediate directories, | |
668 | thus getting their permissions right */ | |
669 | *p = 0; | |
670 | if (strcmp(lastpath,fname)) { | |
37f9805d | 671 | strlcpy(lastpath, fname, sizeof(lastpath)); |
649d65ed AT |
672 | *p = '/'; |
673 | for (p=fname+1; (p=strchr(p,'/')); p++) { | |
6c82f74b | 674 | int copy_links_saved = copy_links; |
649d65ed | 675 | *p = 0; |
b5313607 | 676 | copy_links = copy_unsafe_links; |
3333ffbd | 677 | send_file_name(f, flist, fname, 0, 0); |
6c82f74b | 678 | copy_links = copy_links_saved; |
649d65ed AT |
679 | *p = '/'; |
680 | } | |
681 | } else { | |
682 | *p = '/'; | |
683 | } | |
684 | } | |
685 | ||
686 | if (!*fname) | |
687 | fname = "."; | |
688 | ||
689 | if (dir && *dir) { | |
2bca43f6 | 690 | olddir = push_dir(dir, 1); |
5243c216 AT |
691 | |
692 | if (!olddir) { | |
6ba9279f | 693 | io_error=1; |
5243c216 | 694 | rprintf(FERROR,"push_dir %s : %s\n", |
649d65ed AT |
695 | dir,strerror(errno)); |
696 | continue; | |
697 | } | |
5243c216 | 698 | |
649d65ed | 699 | flist_dir = dir; |
2bca43f6 DD |
700 | } |
701 | ||
702 | if (one_file_system) | |
703 | set_filesystem(fname); | |
704 | ||
705 | if (!recurse || !send_included_file_names(f,flist)) | |
3333ffbd | 706 | send_file_name(f,flist,fname,recurse,FLAG_DELETE); |
2bca43f6 DD |
707 | |
708 | if (olddir != NULL) { | |
649d65ed | 709 | flist_dir = NULL; |
5243c216 AT |
710 | if (pop_dir(olddir) != 0) { |
711 | rprintf(FERROR,"pop_dir %s : %s\n", | |
712 | dir,strerror(errno)); | |
65417579 | 713 | exit_cleanup(RERR_FILESELECT); |
649d65ed | 714 | } |
649d65ed | 715 | } |
649d65ed | 716 | } |
dc5ddbcc | 717 | |
b5313607 DD |
718 | topsrcname[0] = '\0'; |
719 | ||
649d65ed | 720 | if (f != -1) { |
3333ffbd | 721 | send_file_entry(NULL,f,0); |
649d65ed | 722 | } |
c627d613 | 723 | |
649d65ed | 724 | if (verbose && recurse && !am_server && f != -1) |
9486289c | 725 | rprintf(FINFO,"done\n"); |
649d65ed | 726 | |
0199b05f | 727 | clean_flist(flist, 0); |
649d65ed AT |
728 | |
729 | /* now send the uid/gid list. This was introduced in protocol | |
730 | version 15 */ | |
731 | if (f != -1 && remote_version >= 15) { | |
732 | send_uid_list(f); | |
733 | } | |
f6c34742 | 734 | |
6ba9279f AT |
735 | /* if protocol version is >= 17 then send the io_error flag */ |
736 | if (f != -1 && remote_version >= 17) { | |
737 | write_int(f, io_error); | |
738 | } | |
739 | ||
d6dead6b AT |
740 | if (f != -1) { |
741 | io_end_buffering(f); | |
a800434a AT |
742 | stats.flist_size = stats.total_written - start_write; |
743 | stats.num_files = flist->count; | |
d6dead6b AT |
744 | } |
745 | ||
17faa41c | 746 | if (verbose > 2) |
9486289c | 747 | rprintf(FINFO,"send_file_list done\n"); |
17faa41c | 748 | |
649d65ed | 749 | return flist; |
c627d613 AT |
750 | } |
751 | ||
752 | ||
753 | struct file_list *recv_file_list(int f) | |
754 | { | |
c627d613 | 755 | struct file_list *flist; |
182dca5c | 756 | unsigned char flags; |
a800434a | 757 | int64 start_read; |
f7632fc6 | 758 | extern int list_only; |
c627d613 | 759 | |
a06d19e3 | 760 | if (verbose && recurse && !am_server) { |
9486289c AT |
761 | rprintf(FINFO,"receiving file list ... "); |
762 | rflush(FINFO); | |
a06d19e3 | 763 | } |
c627d613 | 764 | |
a800434a AT |
765 | start_read = stats.total_read; |
766 | ||
c627d613 AT |
767 | flist = (struct file_list *)malloc(sizeof(flist[0])); |
768 | if (!flist) | |
769 | goto oom; | |
770 | ||
771 | flist->count=0; | |
3ec4dd97 AT |
772 | flist->malloced=1000; |
773 | flist->files = (struct file_struct **)malloc(sizeof(flist->files[0])* | |
774 | flist->malloced); | |
c627d613 AT |
775 | if (!flist->files) |
776 | goto oom; | |
777 | ||
778 | ||
182dca5c | 779 | for (flags=read_byte(f); flags; flags=read_byte(f)) { |
c627d613 AT |
780 | int i = flist->count; |
781 | ||
782 | if (i >= flist->malloced) { | |
3ec4dd97 AT |
783 | if (flist->malloced < 1000) |
784 | flist->malloced += 1000; | |
f9c51620 | 785 | else |
3ec4dd97 AT |
786 | flist->malloced *= 2; |
787 | flist->files =(struct file_struct **)realloc(flist->files, | |
788 | sizeof(flist->files[0])* | |
789 | flist->malloced); | |
f9c51620 AT |
790 | if (!flist->files) |
791 | goto oom; | |
c627d613 AT |
792 | } |
793 | ||
182dca5c | 794 | receive_file_entry(&flist->files[i],flags,f); |
c627d613 | 795 | |
3ec4dd97 | 796 | if (S_ISREG(flist->files[i]->mode)) |
a800434a | 797 | stats.total_size += flist->files[i]->length; |
c627d613 AT |
798 | |
799 | flist->count++; | |
800 | ||
801 | if (verbose > 2) | |
9486289c | 802 | rprintf(FINFO,"recv_file_name(%s)\n",f_name(flist->files[i])); |
c627d613 AT |
803 | } |
804 | ||
805 | ||
806 | if (verbose > 2) | |
9486289c | 807 | rprintf(FINFO,"received %d names\n",flist->count); |
c627d613 | 808 | |
0199b05f | 809 | clean_flist(flist, relative_paths); |
c627d613 | 810 | |
a06d19e3 | 811 | if (verbose && recurse && !am_server) { |
9486289c | 812 | rprintf(FINFO,"done\n"); |
a06d19e3 AT |
813 | } |
814 | ||
f6c34742 AT |
815 | /* now recv the uid/gid list. This was introduced in protocol version 15 */ |
816 | if (f != -1 && remote_version >= 15) { | |
817 | recv_uid_list(f, flist); | |
818 | } | |
819 | ||
6ba9279f AT |
820 | /* if protocol version is >= 17 then recv the io_error flag */ |
821 | if (f != -1 && remote_version >= 17) { | |
822 | io_error |= read_int(f); | |
823 | } | |
824 | ||
f7632fc6 AT |
825 | if (list_only) { |
826 | int i; | |
827 | for (i=0;i<flist->count;i++) { | |
828 | list_file_entry(flist->files[i]); | |
829 | } | |
830 | } | |
831 | ||
832 | ||
17faa41c | 833 | if (verbose > 2) |
9486289c | 834 | rprintf(FINFO,"recv_file_list done\n"); |
17faa41c | 835 | |
a800434a AT |
836 | stats.flist_size = stats.total_read - start_read; |
837 | stats.num_files = flist->count; | |
838 | ||
c627d613 AT |
839 | return flist; |
840 | ||
841 | oom: | |
842 | out_of_memory("recv_file_list"); | |
843 | return NULL; /* not reached */ | |
844 | } | |
845 | ||
846 | ||
3ec4dd97 | 847 | int file_compare(struct file_struct **f1,struct file_struct **f2) |
c627d613 | 848 | { |
3ec4dd97 AT |
849 | if (!(*f1)->basename && !(*f2)->basename) return 0; |
850 | if (!(*f1)->basename) return -1; | |
851 | if (!(*f2)->basename) return 1; | |
852 | if ((*f1)->dirname == (*f2)->dirname) | |
aa9b77a5 AT |
853 | return u_strcmp((*f1)->basename, (*f2)->basename); |
854 | return u_strcmp(f_name(*f1),f_name(*f2)); | |
c627d613 AT |
855 | } |
856 | ||
857 | ||
858 | int flist_find(struct file_list *flist,struct file_struct *f) | |
859 | { | |
d966ee25 AT |
860 | int low=0,high=flist->count-1; |
861 | ||
862 | if (flist->count <= 0) return -1; | |
863 | ||
864 | while (low != high) { | |
865 | int mid = (low+high)/2; | |
3ec4dd97 | 866 | int ret = file_compare(&flist->files[flist_up(flist, mid)],&f); |
d966ee25 AT |
867 | if (ret == 0) return flist_up(flist, mid); |
868 | if (ret > 0) { | |
869 | high=mid; | |
870 | } else { | |
871 | low=mid+1; | |
872 | } | |
873 | } | |
874 | ||
3ec4dd97 | 875 | if (file_compare(&flist->files[flist_up(flist,low)],&f) == 0) |
d966ee25 AT |
876 | return flist_up(flist,low); |
877 | return -1; | |
c627d613 AT |
878 | } |
879 | ||
880 | ||
3ec4dd97 AT |
881 | /* |
882 | * free up one file | |
883 | */ | |
884 | static void free_file(struct file_struct *file) | |
c627d613 | 885 | { |
3ec4dd97 AT |
886 | if (!file) return; |
887 | if (file->basename) free(file->basename); | |
888 | if (file->link) free(file->link); | |
0b910560 | 889 | if (file->sum) free(file->sum); |
f5780433 | 890 | memset((char *)file, 0, sizeof(*file)); |
3ec4dd97 | 891 | } |
c627d613 | 892 | |
c627d613 | 893 | |
3ec4dd97 AT |
894 | /* |
895 | * free up all elements in a flist | |
896 | */ | |
897 | void flist_free(struct file_list *flist) | |
898 | { | |
899 | int i; | |
900 | for (i=1;i<flist->count;i++) { | |
901 | free_file(flist->files[i]); | |
649d65ed | 902 | free(flist->files[i]); |
3ec4dd97 | 903 | } |
f5780433 | 904 | memset((char *)flist->files, 0, sizeof(flist->files[0])*flist->count); |
3ec4dd97 | 905 | free(flist->files); |
f5780433 | 906 | memset((char *)flist, 0, sizeof(*flist)); |
3ec4dd97 | 907 | free(flist); |
c627d613 AT |
908 | } |
909 | ||
910 | ||
911 | /* | |
912 | * This routine ensures we don't have any duplicate names in our file list. | |
913 | * duplicate names can cause corruption because of the pipelining | |
914 | */ | |
0199b05f | 915 | static void clean_flist(struct file_list *flist, int strip_root) |
c627d613 | 916 | { |
3ec4dd97 | 917 | int i; |
c627d613 | 918 | |
3ec4dd97 AT |
919 | if (!flist || flist->count == 0) |
920 | return; | |
c627d613 | 921 | |
3ec4dd97 AT |
922 | qsort(flist->files,flist->count, |
923 | sizeof(flist->files[0]), | |
924 | (int (*)())file_compare); | |
925 | ||
926 | for (i=1;i<flist->count;i++) { | |
927 | if (flist->files[i]->basename && | |
649d65ed | 928 | flist->files[i-1]->basename && |
3ec4dd97 AT |
929 | strcmp(f_name(flist->files[i]), |
930 | f_name(flist->files[i-1])) == 0) { | |
931 | if (verbose > 1 && !am_server) | |
9486289c | 932 | rprintf(FINFO,"removing duplicate name %s from file list %d\n", |
3ec4dd97 AT |
933 | f_name(flist->files[i-1]),i-1); |
934 | free_file(flist->files[i]); | |
3ec4dd97 AT |
935 | } |
936 | } | |
0199b05f AT |
937 | |
938 | if (strip_root) { | |
939 | /* we need to strip off the root directory in the case | |
940 | of relative paths, but this must be done _after_ | |
941 | the sorting phase */ | |
942 | for (i=0;i<flist->count;i++) { | |
943 | if (flist->files[i]->dirname && | |
944 | flist->files[i]->dirname[0] == '/') { | |
945 | memmove(&flist->files[i]->dirname[0], | |
946 | &flist->files[i]->dirname[1], | |
947 | strlen(flist->files[i]->dirname)); | |
948 | } | |
949 | ||
950 | if (flist->files[i]->dirname && | |
951 | !flist->files[i]->dirname[0]) { | |
952 | flist->files[i]->dirname = NULL; | |
953 | } | |
954 | } | |
955 | } | |
956 | ||
957 | ||
958 | if (verbose <= 3) return; | |
959 | ||
960 | for (i=0;i<flist->count;i++) { | |
961 | rprintf(FINFO,"[%d] i=%d %s %s mode=0%o len=%d\n", | |
962 | getpid(), i, | |
74e708d8 AT |
963 | NS(flist->files[i]->dirname), |
964 | NS(flist->files[i]->basename), | |
0199b05f | 965 | flist->files[i]->mode, |
74e708d8 | 966 | (int)flist->files[i]->length); |
0199b05f | 967 | } |
3ec4dd97 AT |
968 | } |
969 | ||
970 | ||
971 | /* | |
972 | * return the full filename of a flist entry | |
973 | */ | |
974 | char *f_name(struct file_struct *f) | |
975 | { | |
976 | static char names[10][MAXPATHLEN]; | |
977 | static int n; | |
978 | char *p = names[n]; | |
979 | ||
649d65ed | 980 | if (!f || !f->basename) return NULL; |
3ec4dd97 AT |
981 | |
982 | n = (n+1)%10; | |
983 | ||
984 | if (f->dirname) { | |
37f9805d AT |
985 | strlcpy(p, f->dirname, MAXPATHLEN); |
986 | strlcat(p, "/", MAXPATHLEN); | |
987 | strlcat(p, f->basename, MAXPATHLEN); | |
3ec4dd97 | 988 | } else { |
37f9805d | 989 | strlcpy(p, f->basename, MAXPATHLEN); |
3ec4dd97 AT |
990 | } |
991 | ||
992 | return p; | |
c627d613 AT |
993 | } |
994 |