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.
28 * @sa http://lists.samba.org/pipermail/rsync/2000-June/002351.html
34 extern struct stats stats;
37 extern int do_progress;
39 extern int always_checksum;
41 extern int cvs_exclude;
45 extern int one_file_system;
46 extern int make_backups;
47 extern int preserve_links;
48 extern int preserve_hard_links;
49 extern int preserve_perms;
50 extern int preserve_devices;
51 extern int preserve_uid;
52 extern int preserve_gid;
53 extern int preserve_times;
54 extern int relative_paths;
55 extern int copy_links;
56 extern int copy_unsafe_links;
57 extern int remote_version;
59 extern int sanitize_paths;
61 extern int read_batch;
62 extern int write_batch;
64 static char topsrcname[MAXPATHLEN];
66 static struct exclude_struct **local_exclude_list;
68 static struct file_struct null_file;
70 static void clean_flist(struct file_list *flist, int strip_root);
73 static int show_filelist_p(void)
75 return verbose && recurse && !am_server;
78 static void start_filelist_progress(char *kind)
80 rprintf(FINFO, "%s ... ", kind);
81 if ((verbose > 1) || do_progress)
87 static void emit_filelist_progress(const struct file_list *flist)
89 rprintf(FINFO, " %d files...\r", flist->count);
93 static void maybe_emit_filelist_progress(const struct file_list *flist)
95 if (do_progress && show_filelist_p() && ((flist->count % 100) == 0))
96 emit_filelist_progress(flist);
100 static void finish_filelist_progress(const struct file_list *flist)
103 /* This overwrites the progress line */
104 rprintf(FINFO, "%d file%sto consider\n",
105 flist->count, flist->count == 1 ? " " : "s ");
107 rprintf(FINFO, "done\n");
111 void show_flist_stats(void)
117 static struct string_area *string_area_new(int size)
119 struct string_area *a;
123 a = malloc(sizeof(*a));
125 out_of_memory("string_area_new");
126 a->current = a->base = malloc(size);
128 out_of_memory("string_area_new buffer");
129 a->end = a->base + size;
135 static void string_area_free(struct string_area *a)
137 struct string_area *next;
139 for (; a; a = next) {
145 static char *string_area_malloc(struct string_area **ap, int size)
148 struct string_area *a;
150 /* does the request fit into the current space? */
152 if (a->current + size >= a->end) {
153 /* no; get space, move new string_area to front of the list */
154 a = string_area_new(size > ARENA_SIZE ? size : ARENA_SIZE);
159 /* have space; do the "allocation." */
165 static char *string_area_strdup(struct string_area **ap, const char *src)
167 char *dest = string_area_malloc(ap, strlen(src) + 1);
168 return strcpy(dest, src);
171 static void list_file_entry(struct file_struct *f)
176 /* this can happen if duplicate names were removed */
179 permstring(perms, f->mode);
181 if (preserve_links && S_ISLNK(f->mode)) {
182 rprintf(FINFO, "%s %11.0f %s %s -> %s\n",
184 (double) f->length, timestring(f->modtime),
187 rprintf(FINFO, "%s %11.0f %s %s\n",
189 (double) f->length, timestring(f->modtime),
195 int readlink_stat(const char *Path, STRUCT_STAT * Buffer, char *Linkbuf)
199 return do_stat(Path, Buffer);
201 if (do_lstat(Path, Buffer) == -1) {
204 if (S_ISLNK(Buffer->st_mode)) {
207 readlink((char *) Path, Linkbuf,
208 MAXPATHLEN - 1)) == -1) {
212 if (copy_unsafe_links && (topsrcname[0] != '\0') &&
213 unsafe_symlink(Linkbuf, topsrcname)) {
214 return do_stat(Path, Buffer);
219 return do_stat(Path, Buffer);
223 int link_stat(const char *Path, STRUCT_STAT * Buffer)
227 return do_stat(Path, Buffer);
229 return do_lstat(Path, Buffer);
232 return do_stat(Path, Buffer);
237 This function is used to check if a file should be included/excluded
238 from the list of files based on its name and type etc
240 static int check_exclude_file(int f, char *fname, STRUCT_STAT * st)
242 extern int delete_excluded;
244 /* f is set to -1 when calculating deletion file list */
245 if ((f == -1) && delete_excluded) {
248 if (check_exclude(fname, local_exclude_list, st)) {
254 /* used by the one_file_system code */
255 static dev_t filesystem_dev;
257 static void set_filesystem(char *fname)
260 if (link_stat(fname, &st) != 0)
262 filesystem_dev = st.st_dev;
266 static int to_wire_mode(mode_t mode)
268 if (S_ISLNK(mode) && (_S_IFLNK != 0120000)) {
269 return (mode & ~(_S_IFMT)) | 0120000;
274 static mode_t from_wire_mode(int mode)
276 if ((mode & (_S_IFMT)) == 0120000 && (_S_IFLNK != 0120000)) {
277 return (mode & ~(_S_IFMT)) | _S_IFLNK;
279 return (mode_t) mode;
283 static void send_directory(int f, struct file_list *flist, char *dir);
285 static char *flist_dir;
289 * Make sure @p flist is big enough to hold at least @p flist->count
292 static void flist_expand(struct file_list *flist)
294 if (flist->count >= flist->malloced) {
298 if (flist->malloced < 1000)
299 flist->malloced += 1000;
301 flist->malloced *= 2;
303 new_bytes = sizeof(flist->files[0]) * flist->malloced;
306 new_ptr = realloc(flist->files, new_bytes);
308 new_ptr = malloc(new_bytes);
311 rprintf(FINFO, "expand file_list to %.0f bytes, did%s move\n",
313 (new_ptr == flist->files) ? " not" : "");
316 flist->files = (struct file_struct **) new_ptr;
319 out_of_memory("flist_expand");
324 static void send_file_entry(struct file_struct *file, int f,
328 static time_t last_time;
329 static mode_t last_mode;
330 static DEV64_T last_rdev;
331 static uid_t last_uid;
332 static gid_t last_gid;
333 static char lastname[MAXPATHLEN];
345 fname = f_name(file);
349 if (file->mode == last_mode)
351 if (file->rdev == last_rdev)
353 if (file->uid == last_uid)
355 if (file->gid == last_gid)
357 if (file->modtime == last_time)
361 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
363 l2 = strlen(fname) - l1;
370 /* we must make sure we don't send a zero flags byte or the other
371 end will terminate the flist transfer */
372 if (flags == 0 && !S_ISDIR(file->mode))
373 flags |= FLAG_DELETE;
377 write_byte(f, flags);
378 if (flags & SAME_NAME)
380 if (flags & LONG_NAME)
384 write_buf(f, fname + l1, l2);
386 write_longint(f, file->length);
387 if (!(flags & SAME_TIME))
388 write_int(f, (int) file->modtime);
389 if (!(flags & SAME_MODE))
390 write_int(f, to_wire_mode(file->mode));
391 if (preserve_uid && !(flags & SAME_UID)) {
393 write_int(f, (int) file->uid);
395 if (preserve_gid && !(flags & SAME_GID)) {
397 write_int(f, (int) file->gid);
399 if (preserve_devices && IS_DEVICE(file->mode)
400 && !(flags & SAME_RDEV))
401 write_int(f, (int) file->rdev);
404 if (preserve_links && S_ISLNK(file->mode)) {
405 write_int(f, strlen(file->link));
406 write_buf(f, file->link, strlen(file->link));
410 #if SUPPORT_HARD_LINKS
411 if (preserve_hard_links && S_ISREG(file->mode)) {
412 if (remote_version < 26) {
413 /* 32-bit dev_t and ino_t */
414 write_int(f, (int) file->dev);
415 write_int(f, (int) file->inode);
417 /* 64-bit dev_t and ino_t */
418 write_longint(f, file->dev);
419 write_longint(f, file->inode);
424 if (always_checksum) {
425 if (remote_version < 21) {
426 write_buf(f, file->sum, 2);
428 write_buf(f, file->sum, MD4_SUM_LENGTH);
432 last_mode = file->mode;
433 last_rdev = file->rdev;
434 last_uid = file->uid;
435 last_gid = file->gid;
436 last_time = file->modtime;
438 strlcpy(lastname, fname, MAXPATHLEN);
439 lastname[MAXPATHLEN - 1] = 0;
444 static void receive_file_entry(struct file_struct **fptr,
445 unsigned flags, int f)
447 static time_t last_time;
448 static mode_t last_mode;
449 static DEV64_T last_rdev;
450 static uid_t last_uid;
451 static gid_t last_gid;
452 static char lastname[MAXPATHLEN];
453 char thisname[MAXPATHLEN];
454 unsigned int l1 = 0, l2 = 0;
456 struct file_struct *file;
458 if (flags & SAME_NAME)
461 if (flags & LONG_NAME)
466 file = (struct file_struct *) malloc(sizeof(*file));
468 out_of_memory("receive_file_entry");
469 memset((char *) file, 0, sizeof(*file));
472 if (l2 >= MAXPATHLEN - l1) {
474 "overflow: flags=0x%x l1=%d l2=%d lastname=%s\n",
475 flags, l1, l2, lastname);
476 overflow("receive_file_entry");
479 strlcpy(thisname, lastname, l1 + 1);
480 read_sbuf(f, &thisname[l1], l2);
481 thisname[l1 + l2] = 0;
483 strlcpy(lastname, thisname, MAXPATHLEN);
484 lastname[MAXPATHLEN - 1] = 0;
486 clean_fname(thisname);
488 if (sanitize_paths) {
489 sanitize_path(thisname, NULL);
492 if ((p = strrchr(thisname, '/'))) {
493 static char *lastdir;
495 if (lastdir && strcmp(thisname, lastdir) == 0) {
496 file->dirname = lastdir;
498 file->dirname = strdup(thisname);
499 lastdir = file->dirname;
501 file->basename = strdup(p + 1);
503 file->dirname = NULL;
504 file->basename = strdup(thisname);
508 out_of_memory("receive_file_entry 1");
512 file->length = read_longint(f);
514 (flags & SAME_TIME) ? last_time : (time_t) read_int(f);
516 (flags & SAME_MODE) ? last_mode : from_wire_mode(read_int(f));
519 (flags & SAME_UID) ? last_uid : (uid_t) read_int(f);
522 (flags & SAME_GID) ? last_gid : (gid_t) read_int(f);
523 if (preserve_devices && IS_DEVICE(file->mode))
525 (flags & SAME_RDEV) ? last_rdev : (dev_t) read_int(f);
527 if (preserve_links && S_ISLNK(file->mode)) {
530 rprintf(FERROR, "overflow: l=%d\n", l);
531 overflow("receive_file_entry");
533 file->link = (char *) malloc(l + 1);
535 out_of_memory("receive_file_entry 2");
536 read_sbuf(f, file->link, l);
537 if (sanitize_paths) {
538 sanitize_path(file->link, file->dirname);
541 #if SUPPORT_HARD_LINKS
542 if (preserve_hard_links && S_ISREG(file->mode)) {
543 if (remote_version < 26) {
544 file->dev = read_int(f);
545 file->inode = read_int(f);
547 file->dev = read_longint(f);
548 file->inode = read_longint(f);
553 if (always_checksum) {
554 file->sum = (char *) malloc(MD4_SUM_LENGTH);
556 out_of_memory("md4 sum");
557 if (remote_version < 21) {
558 read_buf(f, file->sum, 2);
560 read_buf(f, file->sum, MD4_SUM_LENGTH);
564 last_mode = file->mode;
565 last_rdev = file->rdev;
566 last_uid = file->uid;
567 last_gid = file->gid;
568 last_time = file->modtime;
570 if (!preserve_perms) {
571 extern int orig_umask;
572 /* set an appropriate set of permissions based on original
573 permissions and umask. This emulates what GNU cp does */
574 file->mode &= ~orig_umask;
579 /* determine if a file in a different filesstem should be skipped
580 when one_file_system is set. We bascally only want to include
581 the mount points - but they can be hard to find! */
582 static int skip_filesystem(char *fname, STRUCT_STAT * st)
585 char *p = strrchr(fname, '/');
587 /* skip all but directories */
588 if (!S_ISDIR(st->st_mode))
591 /* if its not a subdirectory then allow */
596 if (link_stat(fname, &st2)) {
602 return (st2.st_dev != filesystem_dev);
605 #define STRDUP(ap, p) (ap ? string_area_strdup(ap, p) : strdup(p))
606 /* IRIX cc cares that the operands to the ternary have the same type. */
607 #define MALLOC(ap, i) (ap ? (void*) string_area_malloc(ap, i) : malloc(i))
610 * Create a file_struct for a named file by reading its stat()
611 * information and performing extensive checks against global
614 * @return the new file, or NULL if there was an error or this file
615 * should be excluded.
617 * @todo There is a small optimization opportunity here to avoid
618 * stat()ing the file in some circumstances, which has a certain cost.
619 * We are called immediately after doing readdir(), and so we may
620 * already know the d_type of the file. We could for example avoid
621 * statting directories if we're not recursing, but this is not a very
622 * important case. Some systems may not have d_type.
624 struct file_struct *make_file(int f, char *fname, struct string_area **ap,
627 struct file_struct *file;
629 char sum[SUM_LENGTH];
631 char cleaned_name[MAXPATHLEN];
632 char linkbuf[MAXPATHLEN];
633 extern int module_id;
635 strlcpy(cleaned_name, fname, MAXPATHLEN);
636 cleaned_name[MAXPATHLEN - 1] = 0;
637 clean_fname(cleaned_name);
638 if (sanitize_paths) {
639 sanitize_path(cleaned_name, NULL);
641 fname = cleaned_name;
643 memset(sum, 0, SUM_LENGTH);
645 if (readlink_stat(fname, &st, linkbuf) != 0) {
646 int save_errno = errno;
647 if ((errno == ENOENT) && copy_links && !noexcludes) {
648 /* symlink pointing nowhere, see if excluded */
649 memset((char *) &st, 0, sizeof(st));
650 if (check_exclude_file(f, fname, &st)) {
651 /* file is excluded anyway, ignore silently */
656 rprintf(FERROR, "readlink %s: %s\n",
657 fname, strerror(save_errno));
661 /* we use noexcludes from backup.c */
665 if (S_ISDIR(st.st_mode) && !recurse) {
666 rprintf(FINFO, "skipping directory %s\n", fname);
670 if (one_file_system && st.st_dev != filesystem_dev) {
671 if (skip_filesystem(fname, &st))
675 if (check_exclude_file(f, fname, &st))
679 if (lp_ignore_nonreadable(module_id) && access(fname, R_OK) != 0)
685 rprintf(FINFO, "make_file(%d,%s)\n", f, fname);
687 file = (struct file_struct *) malloc(sizeof(*file));
689 out_of_memory("make_file");
690 memset((char *) file, 0, sizeof(*file));
692 if ((p = strrchr(fname, '/'))) {
693 static char *lastdir;
695 if (lastdir && strcmp(fname, lastdir) == 0) {
696 file->dirname = lastdir;
698 file->dirname = strdup(fname);
699 lastdir = file->dirname;
701 file->basename = STRDUP(ap, p + 1);
704 file->dirname = NULL;
705 file->basename = STRDUP(ap, fname);
708 file->modtime = st.st_mtime;
709 file->length = st.st_size;
710 file->mode = st.st_mode;
711 file->uid = st.st_uid;
712 file->gid = st.st_gid;
713 file->dev = st.st_dev;
714 file->inode = st.st_ino;
715 #ifdef HAVE_STRUCT_STAT_ST_RDEV
716 file->rdev = st.st_rdev;
720 if (S_ISLNK(st.st_mode)) {
721 file->link = STRDUP(ap, linkbuf);
725 if (always_checksum) {
726 file->sum = (char *) MALLOC(ap, MD4_SUM_LENGTH);
728 out_of_memory("md4 sum");
729 /* drat. we have to provide a null checksum for non-regular
730 files in order to be compatible with earlier versions
732 if (S_ISREG(st.st_mode)) {
733 file_checksum(fname, file->sum, st.st_size);
735 memset(file->sum, 0, MD4_SUM_LENGTH);
740 static char *lastdir;
741 if (lastdir && strcmp(lastdir, flist_dir) == 0) {
742 file->basedir = lastdir;
744 file->basedir = strdup(flist_dir);
745 lastdir = file->basedir;
748 file->basedir = NULL;
751 if (!S_ISDIR(st.st_mode))
752 stats.total_size += st.st_size;
759 void send_file_name(int f, struct file_list *flist, char *fname,
760 int recursive, unsigned base_flags)
762 struct file_struct *file;
764 file = make_file(f, fname, &flist->string_area, 0);
769 maybe_emit_filelist_progress(flist);
773 if (write_batch) /* dw */
774 file->flags = FLAG_DELETE;
776 if (strcmp(file->basename, "")) {
777 flist->files[flist->count++] = file;
778 send_file_entry(file, f, base_flags);
781 if (S_ISDIR(file->mode) && recursive) {
782 struct exclude_struct **last_exclude_list =
784 send_directory(f, flist, f_name(file));
785 local_exclude_list = last_exclude_list;
792 static void send_directory(int f, struct file_list *flist, char *dir)
796 char fname[MAXPATHLEN];
803 rprintf(FERROR, "opendir(%s): %s\n", dir, strerror(errno));
807 strlcpy(fname, dir, MAXPATHLEN);
809 if (fname[l - 1] != '/') {
810 if (l == MAXPATHLEN - 1) {
813 "skipping long-named directory %s\n",
818 strlcat(fname, "/", MAXPATHLEN);
821 p = fname + strlen(fname);
823 local_exclude_list = NULL;
826 if (strlen(fname) + strlen(".cvsignore") <= MAXPATHLEN - 1) {
827 strcpy(p, ".cvsignore");
829 make_exclude_list(fname, NULL, 0, 0);
833 "cannot cvs-exclude in long-named directory %s\n",
838 for (di = readdir(d); di; di = readdir(d)) {
839 char *dname = d_name(di);
840 if (strcmp(dname, ".") == 0 || strcmp(dname, "..") == 0)
842 strlcpy(p, dname, MAXPATHLEN - l);
843 send_file_name(f, flist, fname, recurse, 0);
846 if (local_exclude_list) {
847 add_exclude_list("!", &local_exclude_list, 0);
856 * I *think* f==-1 means that the list should just be built in memory
857 * and not transmitted. But who can tell? -- mbp
859 struct file_list *send_file_list(int f, int argc, char *argv[])
863 char *p, *dir, *olddir;
864 char lastpath[MAXPATHLEN] = "";
865 struct file_list *flist;
868 if (show_filelist_p() && f != -1)
869 start_filelist_progress("building file list");
871 start_write = stats.total_written;
876 io_start_buffering(f);
879 for (i = 0; i < argc; i++) {
880 char *fname = topsrcname;
882 strlcpy(fname, argv[i], MAXPATHLEN);
885 if (l != 1 && fname[l - 1] == '/') {
886 if ((l == 2) && (fname[0] == '.')) {
887 /* Turn ./ into just . rather than ./.
888 This was put in to avoid a problem with
889 rsync -aR --delete from ./
890 The send_file_name() below of ./ was
891 mysteriously preventing deletes */
894 strlcat(fname, ".", MAXPATHLEN);
898 if (link_stat(fname, &st) != 0) {
901 rprintf(FERROR, "link_stat %s : %s\n",
902 fname, strerror(errno));
907 if (S_ISDIR(st.st_mode) && !recurse) {
908 rprintf(FINFO, "skipping directory %s\n", fname);
915 if (!relative_paths) {
916 p = strrchr(fname, '/');
925 } else if (f != -1 && (p = strrchr(fname, '/'))) {
926 /* this ensures we send the intermediate directories,
927 thus getting their permissions right */
929 if (strcmp(lastpath, fname)) {
930 strlcpy(lastpath, fname, sizeof(lastpath));
932 for (p = fname + 1; (p = strchr(p, '/'));
934 int copy_links_saved = copy_links;
935 int recurse_saved = recurse;
937 copy_links = copy_unsafe_links;
938 /* set recurse to 1 to prevent make_file
939 from ignoring directory, but still
940 turn off the recursive parameter to
943 send_file_name(f, flist, fname, 0,
945 copy_links = copy_links_saved;
946 recurse = recurse_saved;
958 olddir = push_dir(dir, 1);
962 rprintf(FERROR, "push_dir %s : %s\n",
963 dir, strerror(errno));
971 set_filesystem(fname);
973 send_file_name(f, flist, fname, recurse, FLAG_DELETE);
975 if (olddir != NULL) {
977 if (pop_dir(olddir) != 0) {
978 rprintf(FERROR, "pop_dir %s : %s\n",
979 dir, strerror(errno));
980 exit_cleanup(RERR_FILESELECT);
985 topsrcname[0] = '\0';
988 send_file_entry(NULL, f, 0);
991 if (show_filelist_p() && f != -1) {
992 finish_filelist_progress(flist);
995 clean_flist(flist, 0);
997 /* now send the uid/gid list. This was introduced in protocol
999 if (f != -1 && remote_version >= 15) {
1003 /* if protocol version is >= 17 then send the io_error flag */
1004 if (f != -1 && remote_version >= 17) {
1005 extern int module_id;
1006 write_int(f, lp_ignore_errors(module_id) ? 0 : io_error);
1011 stats.flist_size = stats.total_written - start_write;
1012 stats.num_files = flist->count;
1013 if (write_batch) /* dw */
1014 write_batch_flist_info(flist->count, flist->files);
1018 rprintf(FINFO, "send_file_list done\n");
1024 struct file_list *recv_file_list(int f)
1026 struct file_list *flist;
1027 unsigned char flags;
1029 extern int list_only;
1031 if (show_filelist_p())
1032 start_filelist_progress("receiving file list");
1034 start_read = stats.total_read;
1036 flist = (struct file_list *) malloc(sizeof(flist[0]));
1041 flist->malloced = 1000;
1043 (struct file_struct **) malloc(sizeof(flist->files[0]) *
1049 for (flags = read_byte(f); flags; flags = read_byte(f)) {
1050 int i = flist->count;
1052 flist_expand(flist);
1054 receive_file_entry(&flist->files[i], flags, f);
1056 if (S_ISREG(flist->files[i]->mode))
1057 stats.total_size += flist->files[i]->length;
1061 maybe_emit_filelist_progress(flist);
1064 rprintf(FINFO, "recv_file_name(%s)\n",
1065 f_name(flist->files[i]));
1070 rprintf(FINFO, "received %d names\n", flist->count);
1072 clean_flist(flist, relative_paths);
1074 if (show_filelist_p()) {
1075 finish_filelist_progress(flist);
1078 /* now recv the uid/gid list. This was introduced in protocol version 15 */
1079 if (f != -1 && remote_version >= 15) {
1080 recv_uid_list(f, flist);
1083 /* if protocol version is >= 17 then recv the io_error flag */
1084 if (f != -1 && remote_version >= 17 && !read_batch) { /* dw-added readbatch */
1085 extern int module_id;
1086 extern int ignore_errors;
1087 if (lp_ignore_errors(module_id) || ignore_errors) {
1090 io_error |= read_int(f);
1096 for (i = 0; i < flist->count; i++) {
1097 list_file_entry(flist->files[i]);
1103 rprintf(FINFO, "recv_file_list done\n");
1105 stats.flist_size = stats.total_read - start_read;
1106 stats.num_files = flist->count;
1111 out_of_memory("recv_file_list");
1112 return NULL; /* not reached */
1117 * XXX: This is currently the hottest function while building the file
1118 * list, because building f_name()s every time is expensive.
1120 int file_compare(struct file_struct **f1, struct file_struct **f2)
1122 if (!(*f1)->basename && !(*f2)->basename)
1124 if (!(*f1)->basename)
1126 if (!(*f2)->basename)
1128 if ((*f1)->dirname == (*f2)->dirname)
1129 return u_strcmp((*f1)->basename, (*f2)->basename);
1130 return u_strcmp(f_name(*f1), f_name(*f2));
1134 int flist_find(struct file_list *flist, struct file_struct *f)
1136 int low = 0, high = flist->count - 1;
1138 if (flist->count <= 0)
1141 while (low != high) {
1142 int mid = (low + high) / 2;
1144 file_compare(&flist->files[flist_up(flist, mid)], &f);
1146 return flist_up(flist, mid);
1154 if (file_compare(&flist->files[flist_up(flist, low)], &f) == 0)
1155 return flist_up(flist, low);
1163 void free_file(struct file_struct *file)
1168 free(file->basename);
1178 * allocate a new file list
1180 struct file_list *flist_new()
1182 struct file_list *flist;
1184 flist = (struct file_list *) malloc(sizeof(flist[0]));
1186 out_of_memory("send_file_list");
1189 flist->malloced = 0;
1190 flist->files = NULL;
1193 flist->string_area = string_area_new(0);
1195 flist->string_area = NULL;
1201 * free up all elements in a flist
1203 void flist_free(struct file_list *flist)
1206 for (i = 1; i < flist->count; i++) {
1207 if (!flist->string_area)
1208 free_file(flist->files[i]);
1209 free(flist->files[i]);
1211 /* FIXME: I don't think we generally need to blank the flist
1212 * since it's about to be freed. This will just cause more
1213 * memory traffic. If you want a freed-memory debugger, you
1214 * know where to get it. */
1215 memset((char *) flist->files, 0,
1216 sizeof(flist->files[0]) * flist->count);
1218 if (flist->string_area)
1219 string_area_free(flist->string_area);
1220 memset((char *) flist, 0, sizeof(*flist));
1226 * This routine ensures we don't have any duplicate names in our file list.
1227 * duplicate names can cause corruption because of the pipelining
1229 static void clean_flist(struct file_list *flist, int strip_root)
1233 if (!flist || flist->count == 0)
1236 qsort(flist->files, flist->count,
1237 sizeof(flist->files[0]), (int (*)()) file_compare);
1239 for (i = 1; i < flist->count; i++) {
1240 if (flist->files[i]->basename &&
1241 flist->files[i - 1]->basename &&
1242 strcmp(f_name(flist->files[i]),
1243 f_name(flist->files[i - 1])) == 0) {
1244 if (verbose > 1 && !am_server)
1246 "removing duplicate name %s from file list %d\n",
1247 f_name(flist->files[i - 1]),
1249 /* it's not great that the flist knows the semantics of the
1250 * file memory usage, but i'd rather not add a flag byte
1251 * to that struct. XXX can i use a bit in the flags field? */
1252 if (flist->string_area)
1253 flist->files[i][0] = null_file;
1255 free_file(flist->files[i]);
1259 /* FIXME: There is a bug here when filenames are repeated more
1260 * than once, because we don't handle freed files when doing
1261 * the comparison. */
1264 /* we need to strip off the root directory in the case
1265 of relative paths, but this must be done _after_
1266 the sorting phase */
1267 for (i = 0; i < flist->count; i++) {
1268 if (flist->files[i]->dirname &&
1269 flist->files[i]->dirname[0] == '/') {
1270 memmove(&flist->files[i]->dirname[0],
1271 &flist->files[i]->dirname[1],
1272 strlen(flist->files[i]->dirname));
1275 if (flist->files[i]->dirname &&
1276 !flist->files[i]->dirname[0]) {
1277 flist->files[i]->dirname = NULL;
1286 for (i = 0; i < flist->count; i++) {
1287 rprintf(FINFO, "[%d] i=%d %s %s mode=0%o len=%.0f\n",
1289 NS(flist->files[i]->dirname),
1290 NS(flist->files[i]->basename),
1291 (int) flist->files[i]->mode,
1292 (double) flist->files[i]->length);
1298 * return the full filename of a flist entry
1300 * This function is too expensive at the moment, because it copies
1301 * strings when often we only want to compare them. In any case,
1302 * using strlcat is silly because it will walk the string repeatedly.
1304 char *f_name(struct file_struct *f)
1306 static char names[10][MAXPATHLEN];
1310 if (!f || !f->basename)
1318 off = strlcpy(p, f->dirname, MAXPATHLEN);
1319 off += strlcpy(p + off, "/", MAXPATHLEN - off);
1320 off += strlcpy(p + off, f->basename, MAXPATHLEN - off);
1322 strlcpy(p, f->basename, MAXPATHLEN);