some code cleanup in preparation for a cleaner client/server split
[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 fprintf(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++) ;
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 strncpy(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 strncpy(thisname,lastname,l1);
257 read_sbuf(f,&thisname[l1],l2);
258 thisname[l1+l2] = 0;
259
260 strncpy(lastname,thisname,MAXPATHLEN-1);
261 lastname[MAXPATHLEN-1] = 0;
262
263 clean_fname(thisname);
264
265 if ((p = strrchr(thisname,'/'))) {
266 static char *lastdir;
267 *p = 0;
268 if (lastdir && strcmp(thisname, lastdir)==0) {
269 file->dirname = lastdir;
270 } else {
271 file->dirname = strdup(thisname);
272 lastdir = file->dirname;
273 }
274 file->basename = strdup(p+1);
275 } else {
276 file->dirname = NULL;
277 file->basename = strdup(thisname);
278 }
279
280 if (!file->basename) out_of_memory("receive_file_entry 1");
281
282
283 file->flags = flags;
284 file->length = read_longint(f);
285 file->modtime = (flags & SAME_TIME) ? last_time : (time_t)read_int(f);
286 file->mode = (flags & SAME_MODE) ? last_mode : (mode_t)read_int(f);
287 if (preserve_uid)
288 file->uid = (flags & SAME_UID) ? last_uid : (uid_t)read_int(f);
289 if (preserve_gid)
290 file->gid = (flags & SAME_GID) ? last_gid : (gid_t)read_int(f);
291 if (preserve_devices && IS_DEVICE(file->mode))
292 file->rdev = (flags & SAME_RDEV) ? last_rdev : (dev_t)read_int(f);
293
294 if (preserve_links && S_ISLNK(file->mode)) {
295 int l = read_int(f);
296 file->link = (char *)malloc(l+1);
297 if (!file->link) out_of_memory("receive_file_entry 2");
298 read_sbuf(f,file->link,l);
299 }
300
301#if SUPPORT_HARD_LINKS
302 if (preserve_hard_links && S_ISREG(file->mode)) {
303 file->dev = read_int(f);
304 file->inode = read_int(f);
305 }
306#endif
307
308 if (always_checksum) {
309 file->sum = (char *)malloc(MD4_SUM_LENGTH);
310 if (!file->sum) out_of_memory("md4 sum");
311 read_buf(f,file->sum,csum_length);
312 }
313
314 last_mode = file->mode;
315 last_rdev = file->rdev;
316 last_uid = file->uid;
317 last_gid = file->gid;
318 last_time = file->modtime;
319}
320
321
322/* determine if a file in a different filesstem should be skipped
323 when one_file_system is set. We bascally only want to include
324 the mount points - but they can be hard to find! */
325static int skip_filesystem(char *fname, STRUCT_STAT *st)
326{
327 STRUCT_STAT st2;
328 char *p = strrchr(fname, '/');
329
330 /* skip all but directories */
331 if (!S_ISDIR(st->st_mode)) return 1;
332
333 /* if its not a subdirectory then allow */
334 if (!p) return 0;
335
336 *p = 0;
337 if (link_stat(fname, &st2)) {
338 *p = '/';
339 return 0;
340 }
341 *p = '/';
342
343 return (st2.st_dev != filesystem_dev);
344}
345
346static struct file_struct *make_file(char *fname)
347{
348 struct file_struct *file;
349 STRUCT_STAT st;
350 char sum[SUM_LENGTH];
351 char *p;
352 char cleaned_name[MAXPATHLEN];
353
354 strncpy(cleaned_name, fname, MAXPATHLEN-1);
355 cleaned_name[MAXPATHLEN-1] = 0;
356 clean_fname(cleaned_name);
357 fname = cleaned_name;
358
359 bzero(sum,SUM_LENGTH);
360
361 if (link_stat(fname,&st) != 0) {
362 io_error = 1;
363 fprintf(FERROR,"%s: %s\n",
364 fname,strerror(errno));
365 return NULL;
366 }
367
368 if (S_ISDIR(st.st_mode) && !recurse) {
369 fprintf(FINFO,"skipping directory %s\n",fname);
370 return NULL;
371 }
372
373 if (one_file_system && st.st_dev != filesystem_dev) {
374 if (skip_filesystem(fname, &st))
375 return NULL;
376 }
377
378 if (!match_file_name(fname,&st))
379 return NULL;
380
381 if (verbose > 2)
382 fprintf(FINFO,"make_file(%s)\n",fname);
383
384 file = (struct file_struct *)malloc(sizeof(*file));
385 if (!file) out_of_memory("make_file");
386 bzero((char *)file,sizeof(*file));
387
388 if ((p = strrchr(fname,'/'))) {
389 static char *lastdir;
390 *p = 0;
391 if (lastdir && strcmp(fname, lastdir)==0) {
392 file->dirname = lastdir;
393 } else {
394 file->dirname = strdup(fname);
395 lastdir = file->dirname;
396 }
397 file->basename = strdup(p+1);
398 *p = '/';
399 } else {
400 file->dirname = NULL;
401 file->basename = strdup(fname);
402 }
403
404 file->modtime = st.st_mtime;
405 file->length = st.st_size;
406 file->mode = st.st_mode;
407 file->uid = st.st_uid;
408 file->gid = st.st_gid;
409 file->dev = st.st_dev;
410 file->inode = st.st_ino;
411#ifdef HAVE_ST_RDEV
412 file->rdev = st.st_rdev;
413#endif
414
415#if SUPPORT_LINKS
416 if (S_ISLNK(st.st_mode)) {
417 int l;
418 char lnk[MAXPATHLEN];
419 if ((l=readlink(fname,lnk,MAXPATHLEN-1)) == -1) {
420 io_error=1;
421 fprintf(FERROR,"readlink %s : %s\n",
422 fname,strerror(errno));
423 return NULL;
424 }
425 lnk[l] = 0;
426 file->link = strdup(lnk);
427 }
428#endif
429
430 if (always_checksum) {
431 file->sum = (char *)malloc(MD4_SUM_LENGTH);
432 if (!file->sum) out_of_memory("md4 sum");
433 /* drat. we have to provide a null checksum for non-regular
434 files in order to be compatible with earlier versions
435 of rsync */
436 if (S_ISREG(st.st_mode)) {
437 file_checksum(fname,file->sum,st.st_size);
438 } else {
439 memset(file->sum, 0, MD4_SUM_LENGTH);
440 }
441 }
442
443 if (flist_dir) {
444 static char *lastdir;
445 if (lastdir && strcmp(lastdir, flist_dir)==0) {
446 file->basedir = lastdir;
447 } else {
448 file->basedir = strdup(flist_dir);
449 lastdir = file->basedir;
450 }
451 } else {
452 file->basedir = NULL;
453 }
454
455 if (!S_ISDIR(st.st_mode))
456 total_size += st.st_size;
457
458 return file;
459}
460
461
462
463static void send_file_name(int f,struct file_list *flist,char *fname,
464 int recursive, unsigned base_flags)
465{
466 struct file_struct *file;
467
468 file = make_file(fname);
469
470 if (!file) return;
471
472 if (flist->count >= flist->malloced) {
473 if (flist->malloced < 1000)
474 flist->malloced += 1000;
475 else
476 flist->malloced *= 2;
477 flist->files = (struct file_struct **)realloc(flist->files,
478 sizeof(flist->files[0])*
479 flist->malloced);
480 if (!flist->files)
481 out_of_memory("send_file_name");
482 }
483
484 if (strcmp(file->basename,"")) {
485 flist->files[flist->count++] = file;
486 send_file_entry(file,f,base_flags);
487 }
488
489 if (S_ISDIR(file->mode) && recursive) {
490 char **last_exclude_list = local_exclude_list;
491 send_directory(f,flist,f_name(file));
492 local_exclude_list = last_exclude_list;
493 return;
494 }
495}
496
497
498
499static void send_directory(int f,struct file_list *flist,char *dir)
500{
501 DIR *d;
502 struct dirent *di;
503 char fname[MAXPATHLEN];
504 int l;
505 char *p;
506
507 d = opendir(dir);
508 if (!d) {
509 io_error = 1;
510 fprintf(FERROR,"%s: %s\n",
511 dir,strerror(errno));
512 return;
513 }
514
515 strncpy(fname,dir,MAXPATHLEN-1);
516 fname[MAXPATHLEN-1]=0;
517 l = strlen(fname);
518 if (fname[l-1] != '/') {
519 if (l == MAXPATHLEN-1) {
520 io_error = 1;
521 fprintf(FERROR,"skipping long-named directory %s\n",fname);
522 closedir(d);
523 return;
524 }
525 strcat(fname,"/");
526 l++;
527 }
528 p = fname + strlen(fname);
529
530 if (cvs_exclude) {
531 if (strlen(fname) + strlen(".cvsignore") <= MAXPATHLEN-1) {
532 strcpy(p,".cvsignore");
533 local_exclude_list = make_exclude_list(fname,NULL,0);
534 } else {
535 io_error = 1;
536 fprintf(FINFO,"cannot cvs-exclude in long-named directory %s\n",fname);
537 }
538 }
539
540 for (di=readdir(d); di; di=readdir(d)) {
541 char *dname = d_name(di);
542 if (strcmp(dname,".")==0 ||
543 strcmp(dname,"..")==0)
544 continue;
545 strncpy(p,dname,MAXPATHLEN-(l+1));
546 send_file_name(f,flist,fname,recurse,FLAG_DELETE);
547 }
548
549 closedir(d);
550}
551
552
553
554struct file_list *send_file_list(int f,int argc,char *argv[])
555{
556 int i,l;
557 STRUCT_STAT st;
558 char *p,*dir;
559 char dbuf[MAXPATHLEN];
560 char lastpath[MAXPATHLEN]="";
561 struct file_list *flist;
562
563 if (verbose && recurse && !am_server && f != -1) {
564 fprintf(FINFO,"building file list ... ");
565 fflush(FINFO);
566 }
567
568 flist = (struct file_list *)malloc(sizeof(flist[0]));
569 if (!flist) out_of_memory("send_file_list");
570
571 flist->count=0;
572 flist->malloced = 1000;
573 flist->files = (struct file_struct **)malloc(sizeof(flist->files[0])*
574 flist->malloced);
575 if (!flist->files) out_of_memory("send_file_list");
576
577 for (i=0;i<argc;i++) {
578 char fname2[MAXPATHLEN];
579 char *fname = fname2;
580
581 strncpy(fname,argv[i],MAXPATHLEN-1);
582 fname[MAXPATHLEN-1] = 0;
583
584 l = strlen(fname);
585 if (l != 1 && fname[l-1] == '/') {
586 strcat(fname,".");
587 }
588
589 if (link_stat(fname,&st) != 0) {
590 io_error=1;
591 fprintf(FERROR,"%s : %s\n",fname,strerror(errno));
592 continue;
593 }
594
595 if (S_ISDIR(st.st_mode) && !recurse) {
596 fprintf(FINFO,"skipping directory %s\n",fname);
597 continue;
598 }
599
600 dir = NULL;
601
602 if (!relative_paths) {
603 p = strrchr(fname,'/');
604 if (p) {
605 *p = 0;
606 if (p == fname)
607 dir = "/";
608 else
609 dir = fname;
610 fname = p+1;
611 }
612 } else if (f != -1 && (p=strrchr(fname,'/'))) {
613 /* this ensures we send the intermediate directories,
614 thus getting their permissions right */
615 *p = 0;
616 if (strcmp(lastpath,fname)) {
617 strcpy(lastpath, fname);
618 *p = '/';
619 for (p=fname+1; (p=strchr(p,'/')); p++) {
620 *p = 0;
621 send_file_name(f, flist, fname, 0, 0);
622 *p = '/';
623 }
624 } else {
625 *p = '/';
626 }
627 }
628
629 if (!*fname)
630 fname = ".";
631
632 if (dir && *dir) {
633 if (getcwd(dbuf,MAXPATHLEN-1) == NULL) {
634 fprintf(FERROR,"getwd : %s\n",strerror(errno));
635 exit_cleanup(1);
636 }
637 if (chdir(dir) != 0) {
638 io_error=1;
639 fprintf(FERROR,"chdir %s : %s\n",
640 dir,strerror(errno));
641 continue;
642 }
643 flist_dir = dir;
644 if (one_file_system)
645 set_filesystem(fname);
646 send_file_name(f,flist,fname,recurse,FLAG_DELETE);
647 flist_dir = NULL;
648 if (chdir(dbuf) != 0) {
649 fprintf(FERROR,"chdir %s : %s\n",
650 dbuf,strerror(errno));
651 exit_cleanup(1);
652 }
653 continue;
654 }
655
656 if (one_file_system)
657 set_filesystem(fname);
658 send_file_name(f,flist,fname,recurse,FLAG_DELETE);
659 }
660
661 if (f != -1) {
662 send_file_entry(NULL,f,0);
663 write_flush(f);
664 }
665
666 if (verbose && recurse && !am_server && f != -1)
667 fprintf(FINFO,"done\n");
668
669 clean_flist(flist);
670
671 /* now send the uid/gid list. This was introduced in protocol
672 version 15 */
673 if (f != -1 && remote_version >= 15) {
674 send_uid_list(f);
675 }
676
677 /* if protocol version is >= 17 then send the io_error flag */
678 if (f != -1 && remote_version >= 17) {
679 write_int(f, io_error);
680 }
681
682 if (verbose > 2)
683 fprintf(FINFO,"send_file_list done\n");
684
685 return flist;
686}
687
688
689struct file_list *recv_file_list(int f)
690{
691 struct file_list *flist;
692 unsigned char flags;
693
694 if (verbose && recurse && !am_server) {
695 fprintf(FINFO,"receiving file list ... ");
696 fflush(FINFO);
697 }
698
699 flist = (struct file_list *)malloc(sizeof(flist[0]));
700 if (!flist)
701 goto oom;
702
703 flist->count=0;
704 flist->malloced=1000;
705 flist->files = (struct file_struct **)malloc(sizeof(flist->files[0])*
706 flist->malloced);
707 if (!flist->files)
708 goto oom;
709
710
711 for (flags=read_byte(f); flags; flags=read_byte(f)) {
712 int i = flist->count;
713
714 if (i >= flist->malloced) {
715 if (flist->malloced < 1000)
716 flist->malloced += 1000;
717 else
718 flist->malloced *= 2;
719 flist->files =(struct file_struct **)realloc(flist->files,
720 sizeof(flist->files[0])*
721 flist->malloced);
722 if (!flist->files)
723 goto oom;
724 }
725
726 receive_file_entry(&flist->files[i],flags,f);
727
728 if (S_ISREG(flist->files[i]->mode))
729 total_size += flist->files[i]->length;
730
731 flist->count++;
732
733 if (verbose > 2)
734 fprintf(FINFO,"recv_file_name(%s)\n",f_name(flist->files[i]));
735 }
736
737
738 if (verbose > 2)
739 fprintf(FINFO,"received %d names\n",flist->count);
740
741 clean_flist(flist);
742
743 if (verbose && recurse && !am_server) {
744 fprintf(FINFO,"done\n");
745 }
746
747 /* now recv the uid/gid list. This was introduced in protocol version 15 */
748 if (f != -1 && remote_version >= 15) {
749 recv_uid_list(f, flist);
750 }
751
752 /* if protocol version is >= 17 then recv the io_error flag */
753 if (f != -1 && remote_version >= 17) {
754 io_error |= read_int(f);
755 }
756
757 if (verbose > 2)
758 fprintf(FINFO,"recv_file_list done\n");
759
760 return flist;
761
762oom:
763 out_of_memory("recv_file_list");
764 return NULL; /* not reached */
765}
766
767
768int file_compare(struct file_struct **f1,struct file_struct **f2)
769{
770 if (!(*f1)->basename && !(*f2)->basename) return 0;
771 if (!(*f1)->basename) return -1;
772 if (!(*f2)->basename) return 1;
773 if ((*f1)->dirname == (*f2)->dirname)
774 return strcmp((*f1)->basename, (*f2)->basename);
775 return strcmp(f_name(*f1),f_name(*f2));
776}
777
778
779int flist_find(struct file_list *flist,struct file_struct *f)
780{
781 int low=0,high=flist->count-1;
782
783 if (flist->count <= 0) return -1;
784
785 while (low != high) {
786 int mid = (low+high)/2;
787 int ret = file_compare(&flist->files[flist_up(flist, mid)],&f);
788 if (ret == 0) return flist_up(flist, mid);
789 if (ret > 0) {
790 high=mid;
791 } else {
792 low=mid+1;
793 }
794 }
795
796 if (file_compare(&flist->files[flist_up(flist,low)],&f) == 0)
797 return flist_up(flist,low);
798 return -1;
799}
800
801
802/*
803 * free up one file
804 */
805static void free_file(struct file_struct *file)
806{
807 if (!file) return;
808 if (file->basename) free(file->basename);
809 if (file->link) free(file->link);
810 if (file->sum) free(file->sum);
811 bzero((char *)file, sizeof(*file));
812}
813
814
815/*
816 * free up all elements in a flist
817 */
818void flist_free(struct file_list *flist)
819{
820 int i;
821 for (i=1;i<flist->count;i++) {
822 free_file(flist->files[i]);
823 free(flist->files[i]);
824 }
825 bzero((char *)flist->files, sizeof(flist->files[0])*flist->count);
826 free(flist->files);
827 bzero((char *)flist, sizeof(*flist));
828 free(flist);
829}
830
831
832/*
833 * This routine ensures we don't have any duplicate names in our file list.
834 * duplicate names can cause corruption because of the pipelining
835 */
836void clean_flist(struct file_list *flist)
837{
838 int i;
839
840 if (!flist || flist->count == 0)
841 return;
842
843 qsort(flist->files,flist->count,
844 sizeof(flist->files[0]),
845 (int (*)())file_compare);
846
847 for (i=1;i<flist->count;i++) {
848 if (flist->files[i]->basename &&
849 flist->files[i-1]->basename &&
850 strcmp(f_name(flist->files[i]),
851 f_name(flist->files[i-1])) == 0) {
852 if (verbose > 1 && !am_server)
853 fprintf(FINFO,"removing duplicate name %s from file list %d\n",
854 f_name(flist->files[i-1]),i-1);
855 free_file(flist->files[i]);
856 }
857 }
858}
859
860
861/*
862 * return the full filename of a flist entry
863 */
864char *f_name(struct file_struct *f)
865{
866 static char names[10][MAXPATHLEN];
867 static int n;
868 char *p = names[n];
869
870 if (!f || !f->basename) return NULL;
871
872 n = (n+1)%10;
873
874 if (f->dirname) {
875 sprintf(p, "%s/%s", f->dirname, f->basename);
876 } else {
877 strcpy(p, f->basename);
878 }
879
880 return p;
881}
882