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