2 Copyright (C) Andrew Tridgell 1996
3 Copyright (C) Paul Mackerras 1996
4 Copyright (C) 2001, 2002 by Martin Pool <mbp@samba.org>
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
22 * Generate and receive file lists
24 * @todo Get rid of the string_area optimization. Efficiently
25 * allocating blocks is the responsibility of the system's malloc
26 * library, not of rsync.
32 extern struct stats stats;
36 extern int always_checksum;
38 extern int cvs_exclude;
42 extern int one_file_system;
43 extern int make_backups;
44 extern int preserve_links;
45 extern int preserve_hard_links;
46 extern int preserve_perms;
47 extern int preserve_devices;
48 extern int preserve_uid;
49 extern int preserve_gid;
50 extern int preserve_times;
51 extern int relative_paths;
52 extern int copy_links;
53 extern int copy_unsafe_links;
54 extern int remote_version;
56 extern int sanitize_paths;
58 extern int read_batch;
59 extern int write_batch;
61 static char topsrcname[MAXPATHLEN];
63 static struct exclude_struct **local_exclude_list;
65 static struct file_struct null_file;
67 static void clean_flist(struct file_list *flist, int strip_root);
70 static int show_build_progress_p(void)
72 extern int do_progress;
74 return do_progress && verbose && recurse && !am_server;
78 * True if we're local, etc, and should emit progress emssages.
80 static void emit_build_progress(const struct file_list *flist)
88 static void finish_build_progress(const struct file_list *flist)
90 if (verbose && recurse && !am_server) {
91 /* This overwrites the progress line, if any. */
92 rprintf(FINFO, RSYNC_NAME ": %d files to consider.\n",
98 static struct string_area *string_area_new(int size)
100 struct string_area *a;
102 if (size <= 0) size = ARENA_SIZE;
103 a = malloc(sizeof(*a));
104 if (!a) out_of_memory("string_area_new");
105 a->current = a->base = malloc(size);
106 if (!a->current) out_of_memory("string_area_new buffer");
107 a->end = a->base + size;
113 static void string_area_free(struct string_area *a)
115 struct string_area *next;
117 for ( ; a ; a = next) {
123 static char *string_area_malloc(struct string_area **ap, int size)
126 struct string_area *a;
128 /* does the request fit into the current space? */
130 if (a->current + size >= a->end) {
131 /* no; get space, move new string_area to front of the list */
132 a = string_area_new(size > ARENA_SIZE ? size : ARENA_SIZE);
137 /* have space; do the "allocation." */
143 static char *string_area_strdup(struct string_area **ap, const char *src)
145 char* dest = string_area_malloc(ap, strlen(src) + 1);
146 return strcpy(dest, src);
149 static void list_file_entry(struct file_struct *f)
154 /* this can happen if duplicate names were removed */
157 permstring(perms, f->mode);
159 if (preserve_links && S_ISLNK(f->mode)) {
160 rprintf(FINFO,"%s %11.0f %s %s -> %s\n",
162 (double)f->length, timestring(f->modtime),
165 rprintf(FINFO,"%s %11.0f %s %s\n",
167 (double)f->length, timestring(f->modtime), f_name(f));
172 int readlink_stat(const char *Path, STRUCT_STAT *Buffer, char *Linkbuf)
176 return do_stat(Path, Buffer);
178 if (do_lstat(Path, Buffer) == -1) {
181 if (S_ISLNK(Buffer->st_mode)) {
183 if ((l = readlink((char *) Path, Linkbuf, MAXPATHLEN-1))== -1) {
187 if (copy_unsafe_links && (topsrcname[0] != '\0') &&
188 unsafe_symlink(Linkbuf, topsrcname)) {
189 return do_stat(Path, Buffer);
194 return do_stat(Path, Buffer);
198 int link_stat(const char *Path, STRUCT_STAT *Buffer)
202 return do_stat(Path, Buffer);
204 return do_lstat(Path, Buffer);
207 return do_stat(Path, Buffer);
212 This function is used to check if a file should be included/excluded
213 from the list of files based on its name and type etc
215 static int check_exclude_file(int f,char *fname,STRUCT_STAT *st)
217 extern int delete_excluded;
219 /* f is set to -1 when calculating deletion file list */
220 if ((f == -1) && delete_excluded) {
223 if (check_exclude(fname,local_exclude_list,st)) {
229 /* used by the one_file_system code */
230 static dev_t filesystem_dev;
232 static void set_filesystem(char *fname)
235 if (link_stat(fname,&st) != 0) return;
236 filesystem_dev = st.st_dev;
240 static int to_wire_mode(mode_t mode)
242 if (S_ISLNK(mode) && (_S_IFLNK != 0120000)) {
243 return (mode & ~(_S_IFMT)) | 0120000;
248 static mode_t from_wire_mode(int mode)
250 if ((mode & (_S_IFMT)) == 0120000 && (_S_IFLNK != 0120000)) {
251 return (mode & ~(_S_IFMT)) | _S_IFLNK;
257 static void send_directory(int f,struct file_list *flist,char *dir);
259 static char *flist_dir;
262 static void send_file_entry(struct file_struct *file,int f,unsigned base_flags)
265 static time_t last_time;
266 static mode_t last_mode;
267 static dev_t last_rdev;
268 static uid_t last_uid;
269 static gid_t last_gid;
270 static char lastname[MAXPATHLEN];
281 fname = f_name(file);
285 if (file->mode == last_mode) flags |= SAME_MODE;
286 if (file->rdev == last_rdev) flags |= SAME_RDEV;
287 if (file->uid == last_uid) flags |= SAME_UID;
288 if (file->gid == last_gid) flags |= SAME_GID;
289 if (file->modtime == last_time) flags |= SAME_TIME;
291 for (l1=0;lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);l1++) ;
292 l2 = strlen(fname) - l1;
294 if (l1 > 0) flags |= SAME_NAME;
295 if (l2 > 255) flags |= LONG_NAME;
297 /* we must make sure we don't send a zero flags byte or the other
298 end will terminate the flist transfer */
299 if (flags == 0 && !S_ISDIR(file->mode)) flags |= FLAG_DELETE;
300 if (flags == 0) flags |= LONG_NAME;
303 if (flags & SAME_NAME)
305 if (flags & LONG_NAME)
309 write_buf(f,fname+l1,l2);
311 write_longint(f,file->length);
312 if (!(flags & SAME_TIME))
313 write_int(f,(int)file->modtime);
314 if (!(flags & SAME_MODE))
315 write_int(f,to_wire_mode(file->mode));
316 if (preserve_uid && !(flags & SAME_UID)) {
318 write_int(f,(int)file->uid);
320 if (preserve_gid && !(flags & SAME_GID)) {
322 write_int(f,(int)file->gid);
324 if (preserve_devices && IS_DEVICE(file->mode) && !(flags & SAME_RDEV))
325 write_int(f,(int)file->rdev);
328 if (preserve_links && S_ISLNK(file->mode)) {
329 write_int(f,strlen(file->link));
330 write_buf(f,file->link,strlen(file->link));
334 #if SUPPORT_HARD_LINKS
335 if (preserve_hard_links && S_ISREG(file->mode)) {
336 if (remote_version < 26) {
337 /* 32-bit dev_t and ino_t */
338 write_int(f,(int)file->dev);
339 write_int(f,(int)file->inode);
341 /* 64-bit dev_t and ino_t */
342 write_longint(f, file->dev);
343 write_longint(f, file->inode);
348 if (always_checksum) {
349 if (remote_version < 21) {
350 write_buf(f,file->sum,2);
352 write_buf(f,file->sum,MD4_SUM_LENGTH);
356 last_mode = file->mode;
357 last_rdev = file->rdev;
358 last_uid = file->uid;
359 last_gid = file->gid;
360 last_time = file->modtime;
362 strlcpy(lastname,fname,MAXPATHLEN);
363 lastname[MAXPATHLEN-1] = 0;
368 static void receive_file_entry(struct file_struct **fptr,
369 unsigned flags,int f)
371 static time_t last_time;
372 static mode_t last_mode;
373 static dev_t last_rdev;
374 static uid_t last_uid;
375 static gid_t last_gid;
376 static char lastname[MAXPATHLEN];
377 char thisname[MAXPATHLEN];
378 unsigned int l1=0,l2=0;
380 struct file_struct *file;
382 if (flags & SAME_NAME)
385 if (flags & LONG_NAME)
390 file = (struct file_struct *)malloc(sizeof(*file));
391 if (!file) out_of_memory("receive_file_entry");
392 memset((char *)file, 0, sizeof(*file));
395 if (l2 >= MAXPATHLEN-l1) {
396 rprintf(FERROR,"overflow: flags=0x%x l1=%d l2=%d lastname=%s\n",
397 flags, l1, l2, lastname);
398 overflow("receive_file_entry");
401 strlcpy(thisname,lastname,l1+1);
402 read_sbuf(f,&thisname[l1],l2);
405 strlcpy(lastname,thisname,MAXPATHLEN);
406 lastname[MAXPATHLEN-1] = 0;
408 clean_fname(thisname);
410 if (sanitize_paths) {
411 sanitize_path(thisname, NULL);
414 if ((p = strrchr(thisname,'/'))) {
415 static char *lastdir;
417 if (lastdir && strcmp(thisname, lastdir)==0) {
418 file->dirname = lastdir;
420 file->dirname = strdup(thisname);
421 lastdir = file->dirname;
423 file->basename = strdup(p+1);
425 file->dirname = NULL;
426 file->basename = strdup(thisname);
429 if (!file->basename) out_of_memory("receive_file_entry 1");
433 file->length = read_longint(f);
434 file->modtime = (flags & SAME_TIME) ? last_time : (time_t)read_int(f);
435 file->mode = (flags & SAME_MODE) ? last_mode : from_wire_mode(read_int(f));
437 file->uid = (flags & SAME_UID) ? last_uid : (uid_t)read_int(f);
439 file->gid = (flags & SAME_GID) ? last_gid : (gid_t)read_int(f);
440 if (preserve_devices && IS_DEVICE(file->mode))
441 file->rdev = (flags & SAME_RDEV) ? last_rdev : (dev_t)read_int(f);
443 if (preserve_links && S_ISLNK(file->mode)) {
446 rprintf(FERROR,"overflow: l=%d\n", l);
447 overflow("receive_file_entry");
449 file->link = (char *)malloc(l+1);
450 if (!file->link) out_of_memory("receive_file_entry 2");
451 read_sbuf(f,file->link,l);
452 if (sanitize_paths) {
453 sanitize_path(file->link, file->dirname);
457 #if SUPPORT_HARD_LINKS
458 if (preserve_hard_links && S_ISREG(file->mode)) {
459 if (remote_version < 26) {
460 file->dev = read_int(f);
461 file->inode = read_int(f);
463 file->dev = read_longint(f);
464 file->inode = read_longint(f);
469 if (always_checksum) {
470 file->sum = (char *)malloc(MD4_SUM_LENGTH);
471 if (!file->sum) out_of_memory("md4 sum");
472 if (remote_version < 21) {
473 read_buf(f,file->sum,2);
475 read_buf(f,file->sum,MD4_SUM_LENGTH);
479 last_mode = file->mode;
480 last_rdev = file->rdev;
481 last_uid = file->uid;
482 last_gid = file->gid;
483 last_time = file->modtime;
485 if (!preserve_perms) {
486 extern int orig_umask;
487 /* set an appropriate set of permissions based on original
488 permissions and umask. This emulates what GNU cp does */
489 file->mode &= ~orig_umask;
494 /* determine if a file in a different filesstem should be skipped
495 when one_file_system is set. We bascally only want to include
496 the mount points - but they can be hard to find! */
497 static int skip_filesystem(char *fname, STRUCT_STAT *st)
500 char *p = strrchr(fname, '/');
502 /* skip all but directories */
503 if (!S_ISDIR(st->st_mode)) return 1;
505 /* if its not a subdirectory then allow */
509 if (link_stat(fname, &st2)) {
515 return (st2.st_dev != filesystem_dev);
518 #define STRDUP(ap, p) (ap ? string_area_strdup(ap, p) : strdup(p))
519 /* IRIX cc cares that the operands to the ternary have the same type. */
520 #define MALLOC(ap, i) (ap ? (void*) string_area_malloc(ap, i) : malloc(i))
522 /* create a file_struct for a named file */
523 struct file_struct *make_file(int f, char *fname, struct string_area **ap,
526 struct file_struct *file;
528 char sum[SUM_LENGTH];
530 char cleaned_name[MAXPATHLEN];
531 char linkbuf[MAXPATHLEN];
532 extern int module_id;
534 strlcpy(cleaned_name, fname, MAXPATHLEN);
535 cleaned_name[MAXPATHLEN-1] = 0;
536 clean_fname(cleaned_name);
537 if (sanitize_paths) {
538 sanitize_path(cleaned_name, NULL);
540 fname = cleaned_name;
542 memset(sum,0,SUM_LENGTH);
544 if (readlink_stat(fname,&st,linkbuf) != 0) {
545 int save_errno = errno;
546 if ((errno == ENOENT) && copy_links && !noexcludes) {
547 /* symlink pointing nowhere, see if excluded */
548 memset((char *)&st, 0, sizeof(st));
549 if (check_exclude_file(f,fname,&st)) {
550 /* file is excluded anyway, ignore silently */
555 rprintf(FERROR,"readlink %s: %s\n",
556 fname,strerror(save_errno));
560 /* we use noexcludes from backup.c */
561 if (noexcludes) goto skip_excludes;
563 if (S_ISDIR(st.st_mode) && !recurse) {
564 rprintf(FINFO,"skipping directory %s\n",fname);
568 if (one_file_system && st.st_dev != filesystem_dev) {
569 if (skip_filesystem(fname, &st))
573 if (check_exclude_file(f,fname,&st))
577 if (lp_ignore_nonreadable(module_id) && access(fname, R_OK) != 0)
583 rprintf(FINFO,"make_file(%d,%s)\n",f,fname);
585 file = (struct file_struct *)malloc(sizeof(*file));
586 if (!file) out_of_memory("make_file");
587 memset((char *)file,0,sizeof(*file));
589 if ((p = strrchr(fname,'/'))) {
590 static char *lastdir;
592 if (lastdir && strcmp(fname, lastdir)==0) {
593 file->dirname = lastdir;
595 file->dirname = strdup(fname);
596 lastdir = file->dirname;
598 file->basename = STRDUP(ap, p+1);
601 file->dirname = NULL;
602 file->basename = STRDUP(ap, fname);
605 file->modtime = st.st_mtime;
606 file->length = st.st_size;
607 file->mode = st.st_mode;
608 file->uid = st.st_uid;
609 file->gid = st.st_gid;
610 file->dev = st.st_dev;
611 file->inode = st.st_ino;
613 file->rdev = st.st_rdev;
617 if (S_ISLNK(st.st_mode)) {
618 file->link = STRDUP(ap, linkbuf);
622 if (always_checksum) {
623 file->sum = (char *)MALLOC(ap, MD4_SUM_LENGTH);
624 if (!file->sum) out_of_memory("md4 sum");
625 /* drat. we have to provide a null checksum for non-regular
626 files in order to be compatible with earlier versions
628 if (S_ISREG(st.st_mode)) {
629 file_checksum(fname,file->sum,st.st_size);
631 memset(file->sum, 0, MD4_SUM_LENGTH);
636 static char *lastdir;
637 if (lastdir && strcmp(lastdir, flist_dir)==0) {
638 file->basedir = lastdir;
640 file->basedir = strdup(flist_dir);
641 lastdir = file->basedir;
644 file->basedir = NULL;
647 if (!S_ISDIR(st.st_mode))
648 stats.total_size += st.st_size;
655 void send_file_name(int f,struct file_list *flist,char *fname,
656 int recursive, unsigned base_flags)
658 struct file_struct *file;
660 file = make_file(f,fname, &flist->string_area, 0);
664 if (show_build_progress_p() & !(flist->count % 100))
665 emit_build_progress(flist);
667 if (flist->count >= flist->malloced) {
668 if (flist->malloced < 1000)
669 flist->malloced += 1000;
671 flist->malloced *= 2;
672 flist->files = (struct file_struct **)realloc(flist->files,
673 sizeof(flist->files[0])*
676 out_of_memory("send_file_name");
679 if (write_batch) /* dw */
680 file->flags = FLAG_DELETE;
682 if (strcmp(file->basename,"")) {
683 flist->files[flist->count++] = file;
684 send_file_entry(file,f,base_flags);
687 if (S_ISDIR(file->mode) && recursive) {
688 struct exclude_struct **last_exclude_list = local_exclude_list;
689 send_directory(f,flist,f_name(file));
690 local_exclude_list = last_exclude_list;
697 static void send_directory(int f,struct file_list *flist,char *dir)
701 char fname[MAXPATHLEN];
708 rprintf(FERROR,"opendir(%s): %s\n",
709 dir,strerror(errno));
713 strlcpy(fname,dir,MAXPATHLEN);
715 if (fname[l-1] != '/') {
716 if (l == MAXPATHLEN-1) {
718 rprintf(FERROR,"skipping long-named directory %s\n",fname);
722 strlcat(fname,"/", MAXPATHLEN);
725 p = fname + strlen(fname);
727 local_exclude_list = NULL;
730 if (strlen(fname) + strlen(".cvsignore") <= MAXPATHLEN-1) {
731 strcpy(p,".cvsignore");
732 local_exclude_list = make_exclude_list(fname,NULL,0,0);
735 rprintf(FINFO,"cannot cvs-exclude in long-named directory %s\n",fname);
739 for (di=readdir(d); di; di=readdir(d)) {
740 char *dname = d_name(di);
741 if (strcmp(dname,".")==0 ||
742 strcmp(dname,"..")==0)
744 strlcpy(p,dname,MAXPATHLEN-l);
745 send_file_name(f,flist,fname,recurse,0);
748 if (local_exclude_list) {
749 add_exclude_list("!", &local_exclude_list, 0);
758 * I *think* f==-1 means that the list should just be built in memory
759 * and not transmitted. But who can tell? -- mbp
761 struct file_list *send_file_list(int f,int argc,char *argv[])
765 char *p,*dir,*olddir;
766 char lastpath[MAXPATHLEN]="";
767 struct file_list *flist;
770 if (verbose && recurse && !am_server && f != -1) {
771 rprintf(FINFO, RSYNC_NAME ": building file list...\n");
773 rprintf(FINFO, "\n");
777 start_write = stats.total_written;
782 io_start_buffering(f);
785 for (i=0;i<argc;i++) {
786 char *fname = topsrcname;
788 strlcpy(fname,argv[i],MAXPATHLEN);
791 if (l != 1 && fname[l-1] == '/') {
792 if ((l == 2) && (fname[0] == '.')) {
793 /* Turn ./ into just . rather than ./.
794 This was put in to avoid a problem with
795 rsync -aR --delete from ./
796 The send_file_name() below of ./ was
797 mysteriously preventing deletes */
800 strlcat(fname,".",MAXPATHLEN);
804 if (link_stat(fname,&st) != 0) {
807 rprintf(FERROR,"link_stat %s : %s\n",fname,strerror(errno));
812 if (S_ISDIR(st.st_mode) && !recurse) {
813 rprintf(FINFO,"skipping directory %s\n",fname);
820 if (!relative_paths) {
821 p = strrchr(fname,'/');
830 } else if (f != -1 && (p=strrchr(fname,'/'))) {
831 /* this ensures we send the intermediate directories,
832 thus getting their permissions right */
834 if (strcmp(lastpath,fname)) {
835 strlcpy(lastpath, fname, sizeof(lastpath));
837 for (p=fname+1; (p=strchr(p,'/')); p++) {
838 int copy_links_saved = copy_links;
839 int recurse_saved = recurse;
841 copy_links = copy_unsafe_links;
842 /* set recurse to 1 to prevent make_file
843 from ignoring directory, but still
844 turn off the recursive parameter to
847 send_file_name(f, flist, fname, 0, 0);
848 copy_links = copy_links_saved;
849 recurse = recurse_saved;
861 olddir = push_dir(dir, 1);
865 rprintf(FERROR,"push_dir %s : %s\n",
866 dir,strerror(errno));
874 set_filesystem(fname);
876 send_file_name(f,flist,fname,recurse,FLAG_DELETE);
878 if (olddir != NULL) {
880 if (pop_dir(olddir) != 0) {
881 rprintf(FERROR,"pop_dir %s : %s\n",
882 dir,strerror(errno));
883 exit_cleanup(RERR_FILESELECT);
888 topsrcname[0] = '\0';
891 send_file_entry(NULL,f,0);
894 finish_build_progress(flist);
896 clean_flist(flist, 0);
898 /* now send the uid/gid list. This was introduced in protocol
900 if (f != -1 && remote_version >= 15) {
904 /* if protocol version is >= 17 then send the io_error flag */
905 if (f != -1 && remote_version >= 17) {
906 extern int module_id;
907 write_int(f, lp_ignore_errors(module_id)? 0 : io_error);
912 stats.flist_size = stats.total_written - start_write;
913 stats.num_files = flist->count;
914 if (write_batch) /* dw */
915 write_batch_flist_info(flist->count, flist->files);
919 rprintf(FINFO,"send_file_list done\n");
925 struct file_list *recv_file_list(int f)
927 struct file_list *flist;
930 extern int list_only;
932 if (verbose && recurse && !am_server) {
933 rprintf(FINFO,"receiving file list ... ");
937 start_read = stats.total_read;
939 flist = (struct file_list *)malloc(sizeof(flist[0]));
944 flist->malloced=1000;
945 flist->files = (struct file_struct **)malloc(sizeof(flist->files[0])*
951 for (flags=read_byte(f); flags; flags=read_byte(f)) {
952 int i = flist->count;
954 if (i >= flist->malloced) {
955 if (flist->malloced < 1000)
956 flist->malloced += 1000;
958 flist->malloced *= 2;
959 flist->files =(struct file_struct **)realloc(flist->files,
960 sizeof(flist->files[0])*
966 receive_file_entry(&flist->files[i],flags,f);
968 if (S_ISREG(flist->files[i]->mode))
969 stats.total_size += flist->files[i]->length;
974 rprintf(FINFO,"recv_file_name(%s)\n",f_name(flist->files[i]));
979 rprintf(FINFO,"received %d names\n",flist->count);
981 clean_flist(flist, relative_paths);
983 if (verbose && recurse && !am_server) {
984 rprintf(FINFO,"done\n");
987 /* now recv the uid/gid list. This was introduced in protocol version 15 */
988 if (f != -1 && remote_version >= 15) {
989 recv_uid_list(f, flist);
992 /* if protocol version is >= 17 then recv the io_error flag */
993 if (f != -1 && remote_version >= 17 && !read_batch) { /* dw-added readbatch */
994 extern int module_id;
995 extern int ignore_errors;
996 if (lp_ignore_errors(module_id) || ignore_errors) {
999 io_error |= read_int(f);
1005 for (i=0;i<flist->count;i++) {
1006 list_file_entry(flist->files[i]);
1012 rprintf(FINFO,"recv_file_list done\n");
1014 stats.flist_size = stats.total_read - start_read;
1015 stats.num_files = flist->count;
1020 out_of_memory("recv_file_list");
1021 return NULL; /* not reached */
1026 * XXX: This is currently the hottest function while building the file
1027 * list, because building f_name()s every time is expensive.
1029 int file_compare(struct file_struct **f1,struct file_struct **f2)
1031 if (!(*f1)->basename && !(*f2)->basename) return 0;
1032 if (!(*f1)->basename) return -1;
1033 if (!(*f2)->basename) return 1;
1034 if ((*f1)->dirname == (*f2)->dirname)
1035 return u_strcmp((*f1)->basename, (*f2)->basename);
1036 return u_strcmp(f_name(*f1),f_name(*f2));
1040 int flist_find(struct file_list *flist,struct file_struct *f)
1042 int low=0,high=flist->count-1;
1044 if (flist->count <= 0) return -1;
1046 while (low != high) {
1047 int mid = (low+high)/2;
1048 int ret = file_compare(&flist->files[flist_up(flist, mid)],&f);
1049 if (ret == 0) return flist_up(flist, mid);
1057 if (file_compare(&flist->files[flist_up(flist,low)],&f) == 0)
1058 return flist_up(flist,low);
1066 void free_file(struct file_struct *file)
1069 if (file->basename) free(file->basename);
1070 if (file->link) free(file->link);
1071 if (file->sum) free(file->sum);
1077 * allocate a new file list
1079 struct file_list *flist_new()
1081 struct file_list *flist;
1083 flist = (struct file_list *)malloc(sizeof(flist[0]));
1084 if (!flist) out_of_memory("send_file_list");
1087 flist->malloced = 1000;
1088 flist->files = (struct file_struct **)malloc(sizeof(flist->files[0])*
1090 if (!flist->files) out_of_memory("send_file_list");
1092 flist->string_area = string_area_new(0);
1094 flist->string_area = NULL;
1099 * free up all elements in a flist
1101 void flist_free(struct file_list *flist)
1104 for (i=1;i<flist->count;i++) {
1105 if (!flist->string_area)
1106 free_file(flist->files[i]);
1107 free(flist->files[i]);
1109 memset((char *)flist->files, 0, sizeof(flist->files[0])*flist->count);
1111 if (flist->string_area)
1112 string_area_free(flist->string_area);
1113 memset((char *)flist, 0, sizeof(*flist));
1119 * This routine ensures we don't have any duplicate names in our file list.
1120 * duplicate names can cause corruption because of the pipelining
1122 static void clean_flist(struct file_list *flist, int strip_root)
1126 if (!flist || flist->count == 0)
1129 qsort(flist->files,flist->count,
1130 sizeof(flist->files[0]),
1131 (int (*)())file_compare);
1133 for (i=1;i<flist->count;i++) {
1134 if (flist->files[i]->basename &&
1135 flist->files[i-1]->basename &&
1136 strcmp(f_name(flist->files[i]),
1137 f_name(flist->files[i-1])) == 0) {
1138 if (verbose > 1 && !am_server)
1139 rprintf(FINFO,"removing duplicate name %s from file list %d\n",
1140 f_name(flist->files[i-1]),i-1);
1141 /* it's not great that the flist knows the semantics of the
1142 * file memory usage, but i'd rather not add a flag byte
1143 * to that struct. XXX can i use a bit in the flags field? */
1144 if (flist->string_area)
1145 flist->files[i][0] = null_file;
1147 free_file(flist->files[i]);
1151 /* FIXME: There is a bug here when filenames are repeated more
1152 * than once, because we don't handle freed files when doing
1153 * the comparison. */
1156 /* we need to strip off the root directory in the case
1157 of relative paths, but this must be done _after_
1158 the sorting phase */
1159 for (i=0;i<flist->count;i++) {
1160 if (flist->files[i]->dirname &&
1161 flist->files[i]->dirname[0] == '/') {
1162 memmove(&flist->files[i]->dirname[0],
1163 &flist->files[i]->dirname[1],
1164 strlen(flist->files[i]->dirname));
1167 if (flist->files[i]->dirname &&
1168 !flist->files[i]->dirname[0]) {
1169 flist->files[i]->dirname = NULL;
1175 if (verbose <= 3) return;
1177 for (i=0;i<flist->count;i++) {
1178 rprintf(FINFO,"[%d] i=%d %s %s mode=0%o len=%.0f\n",
1180 NS(flist->files[i]->dirname),
1181 NS(flist->files[i]->basename),
1182 (int) flist->files[i]->mode,
1183 (double)flist->files[i]->length);
1189 * return the full filename of a flist entry
1191 * This function is too expensive at the moment, because it copies
1192 * strings when often we only want to compare them. In any case,
1193 * using strlcat is silly because it will walk the string repeatedly.
1195 char *f_name(struct file_struct *f)
1197 static char names[10][MAXPATHLEN];
1201 if (!f || !f->basename) return NULL;
1208 off = strlcpy(p, f->dirname, MAXPATHLEN);
1209 off += strlcpy(p+off, "/", MAXPATHLEN-off);
1210 off += strlcpy(p+off, f->basename, MAXPATHLEN-off);
1212 strlcpy(p, f->basename, MAXPATHLEN);