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