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 maybe_emit_filelist_progress(const struct file_list *flist)
89 if (do_progress && show_filelist_p() && ((flist->count % 100) == 0))
90 emit_filelist_progress(flist);
94 static void emit_filelist_progress(const struct file_list *flist)
96 rprintf(FINFO, " %d files...\r", flist->count);
100 static void finish_filelist_progress(const struct file_list *flist)
103 /* This overwrites the progress line */
104 rprintf(FINFO, "%d files to consider\n", flist->count);
106 rprintf(FINFO, "done\n");
110 void show_flist_stats(void)
116 static struct string_area *string_area_new(int size)
118 struct string_area *a;
122 a = malloc(sizeof(*a));
124 out_of_memory("string_area_new");
125 a->current = a->base = malloc(size);
127 out_of_memory("string_area_new buffer");
128 a->end = a->base + size;
134 static void string_area_free(struct string_area *a)
136 struct string_area *next;
138 for (; a; a = next) {
144 static char *string_area_malloc(struct string_area **ap, int size)
147 struct string_area *a;
149 /* does the request fit into the current space? */
151 if (a->current + size >= a->end) {
152 /* no; get space, move new string_area to front of the list */
153 a = string_area_new(size > ARENA_SIZE ? size : ARENA_SIZE);
158 /* have space; do the "allocation." */
164 static char *string_area_strdup(struct string_area **ap, const char *src)
166 char *dest = string_area_malloc(ap, strlen(src) + 1);
167 return strcpy(dest, src);
170 static void list_file_entry(struct file_struct *f)
175 /* this can happen if duplicate names were removed */
178 permstring(perms, f->mode);
180 if (preserve_links && S_ISLNK(f->mode)) {
181 rprintf(FINFO, "%s %11.0f %s %s -> %s\n",
183 (double) f->length, timestring(f->modtime),
186 rprintf(FINFO, "%s %11.0f %s %s\n",
188 (double) f->length, timestring(f->modtime),
194 int readlink_stat(const char *Path, STRUCT_STAT * Buffer, char *Linkbuf)
198 return do_stat(Path, Buffer);
200 if (do_lstat(Path, Buffer) == -1) {
203 if (S_ISLNK(Buffer->st_mode)) {
206 readlink((char *) Path, Linkbuf,
207 MAXPATHLEN - 1)) == -1) {
211 if (copy_unsafe_links && (topsrcname[0] != '\0') &&
212 unsafe_symlink(Linkbuf, topsrcname)) {
213 return do_stat(Path, Buffer);
218 return do_stat(Path, Buffer);
222 int link_stat(const char *Path, STRUCT_STAT * Buffer)
226 return do_stat(Path, Buffer);
228 return do_lstat(Path, Buffer);
231 return do_stat(Path, Buffer);
236 This function is used to check if a file should be included/excluded
237 from the list of files based on its name and type etc
239 static int check_exclude_file(int f, char *fname, STRUCT_STAT * st)
241 extern int delete_excluded;
243 /* f is set to -1 when calculating deletion file list */
244 if ((f == -1) && delete_excluded) {
247 if (check_exclude(fname, local_exclude_list, st)) {
253 /* used by the one_file_system code */
254 static dev_t filesystem_dev;
256 static void set_filesystem(char *fname)
259 if (link_stat(fname, &st) != 0)
261 filesystem_dev = st.st_dev;
265 static int to_wire_mode(mode_t mode)
267 if (S_ISLNK(mode) && (_S_IFLNK != 0120000)) {
268 return (mode & ~(_S_IFMT)) | 0120000;
273 static mode_t from_wire_mode(int mode)
275 if ((mode & (_S_IFMT)) == 0120000 && (_S_IFLNK != 0120000)) {
276 return (mode & ~(_S_IFMT)) | _S_IFLNK;
278 return (mode_t) mode;
282 static void send_directory(int f, struct file_list *flist, char *dir);
284 static char *flist_dir;
288 * Make sure @p flist is big enough to hold at least @p flist->count
291 static void flist_expand(struct file_list *flist)
293 if (flist->count >= flist->malloced) {
297 if (flist->malloced < 1000)
298 flist->malloced += 1000;
300 flist->malloced *= 2;
302 new_bytes = sizeof(flist->files[0]) * flist->malloced;
304 new_ptr = realloc(flist->files, new_bytes);
307 rprintf(FINFO, "expand file_list to %.0f bytes, did%s move\n",
309 (new_ptr == flist->files) ? " not" : "");
312 flist->files = (struct file_struct **) new_ptr;
315 out_of_memory("flist_expand");
320 static void send_file_entry(struct file_struct *file, int f,
324 static time_t last_time;
325 static mode_t last_mode;
326 static DEV64_T last_rdev;
327 static uid_t last_uid;
328 static gid_t last_gid;
329 static char lastname[MAXPATHLEN];
341 fname = f_name(file);
345 if (file->mode == last_mode)
347 if (file->rdev == last_rdev)
349 if (file->uid == last_uid)
351 if (file->gid == last_gid)
353 if (file->modtime == last_time)
357 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
359 l2 = strlen(fname) - l1;
366 /* we must make sure we don't send a zero flags byte or the other
367 end will terminate the flist transfer */
368 if (flags == 0 && !S_ISDIR(file->mode))
369 flags |= FLAG_DELETE;
373 write_byte(f, flags);
374 if (flags & SAME_NAME)
376 if (flags & LONG_NAME)
380 write_buf(f, fname + l1, l2);
382 write_longint(f, file->length);
383 if (!(flags & SAME_TIME))
384 write_int(f, (int) file->modtime);
385 if (!(flags & SAME_MODE))
386 write_int(f, to_wire_mode(file->mode));
387 if (preserve_uid && !(flags & SAME_UID)) {
389 write_int(f, (int) file->uid);
391 if (preserve_gid && !(flags & SAME_GID)) {
393 write_int(f, (int) file->gid);
395 if (preserve_devices && IS_DEVICE(file->mode)
396 && !(flags & SAME_RDEV))
397 write_int(f, (int) file->rdev);
400 if (preserve_links && S_ISLNK(file->mode)) {
401 write_int(f, strlen(file->link));
402 write_buf(f, file->link, strlen(file->link));
406 #if SUPPORT_HARD_LINKS
407 if (preserve_hard_links && S_ISREG(file->mode)) {
408 if (remote_version < 26) {
409 /* 32-bit dev_t and ino_t */
410 write_int(f, (int) file->dev);
411 write_int(f, (int) file->inode);
413 /* 64-bit dev_t and ino_t */
414 write_longint(f, file->dev);
415 write_longint(f, file->inode);
420 if (always_checksum) {
421 if (remote_version < 21) {
422 write_buf(f, file->sum, 2);
424 write_buf(f, file->sum, MD4_SUM_LENGTH);
428 last_mode = file->mode;
429 last_rdev = file->rdev;
430 last_uid = file->uid;
431 last_gid = file->gid;
432 last_time = file->modtime;
434 strlcpy(lastname, fname, MAXPATHLEN);
435 lastname[MAXPATHLEN - 1] = 0;
440 static void receive_file_entry(struct file_struct **fptr,
441 unsigned flags, int f)
443 static time_t last_time;
444 static mode_t last_mode;
445 static DEV64_T last_rdev;
446 static uid_t last_uid;
447 static gid_t last_gid;
448 static char lastname[MAXPATHLEN];
449 char thisname[MAXPATHLEN];
450 unsigned int l1 = 0, l2 = 0;
452 struct file_struct *file;
454 if (flags & SAME_NAME)
457 if (flags & LONG_NAME)
462 file = (struct file_struct *) malloc(sizeof(*file));
464 out_of_memory("receive_file_entry");
465 memset((char *) file, 0, sizeof(*file));
468 if (l2 >= MAXPATHLEN - l1) {
470 "overflow: flags=0x%x l1=%d l2=%d lastname=%s\n",
471 flags, l1, l2, lastname);
472 overflow("receive_file_entry");
475 strlcpy(thisname, lastname, l1 + 1);
476 read_sbuf(f, &thisname[l1], l2);
477 thisname[l1 + l2] = 0;
479 strlcpy(lastname, thisname, MAXPATHLEN);
480 lastname[MAXPATHLEN - 1] = 0;
482 clean_fname(thisname);
484 if (sanitize_paths) {
485 sanitize_path(thisname, NULL);
488 if ((p = strrchr(thisname, '/'))) {
489 static char *lastdir;
491 if (lastdir && strcmp(thisname, lastdir) == 0) {
492 file->dirname = lastdir;
494 file->dirname = strdup(thisname);
495 lastdir = file->dirname;
497 file->basename = strdup(p + 1);
499 file->dirname = NULL;
500 file->basename = strdup(thisname);
504 out_of_memory("receive_file_entry 1");
508 file->length = read_longint(f);
510 (flags & SAME_TIME) ? last_time : (time_t) read_int(f);
512 (flags & SAME_MODE) ? last_mode : from_wire_mode(read_int(f));
515 (flags & SAME_UID) ? last_uid : (uid_t) read_int(f);
518 (flags & SAME_GID) ? last_gid : (gid_t) read_int(f);
519 if (preserve_devices && IS_DEVICE(file->mode))
521 (flags & SAME_RDEV) ? last_rdev : (dev_t) read_int(f);
523 if (preserve_links && S_ISLNK(file->mode)) {
526 rprintf(FERROR, "overflow: l=%d\n", l);
527 overflow("receive_file_entry");
529 file->link = (char *) malloc(l + 1);
531 out_of_memory("receive_file_entry 2");
532 read_sbuf(f, file->link, l);
533 if (sanitize_paths) {
534 sanitize_path(file->link, file->dirname);
537 #if SUPPORT_HARD_LINKS
538 if (preserve_hard_links && S_ISREG(file->mode)) {
539 if (remote_version < 26) {
540 file->dev = read_int(f);
541 file->inode = read_int(f);
543 file->dev = read_longint(f);
544 file->inode = read_longint(f);
549 if (always_checksum) {
550 file->sum = (char *) malloc(MD4_SUM_LENGTH);
552 out_of_memory("md4 sum");
553 if (remote_version < 21) {
554 read_buf(f, file->sum, 2);
556 read_buf(f, file->sum, MD4_SUM_LENGTH);
560 last_mode = file->mode;
561 last_rdev = file->rdev;
562 last_uid = file->uid;
563 last_gid = file->gid;
564 last_time = file->modtime;
566 if (!preserve_perms) {
567 extern int orig_umask;
568 /* set an appropriate set of permissions based on original
569 permissions and umask. This emulates what GNU cp does */
570 file->mode &= ~orig_umask;
575 /* determine if a file in a different filesstem should be skipped
576 when one_file_system is set. We bascally only want to include
577 the mount points - but they can be hard to find! */
578 static int skip_filesystem(char *fname, STRUCT_STAT * st)
581 char *p = strrchr(fname, '/');
583 /* skip all but directories */
584 if (!S_ISDIR(st->st_mode))
587 /* if its not a subdirectory then allow */
592 if (link_stat(fname, &st2)) {
598 return (st2.st_dev != filesystem_dev);
601 #define STRDUP(ap, p) (ap ? string_area_strdup(ap, p) : strdup(p))
602 /* IRIX cc cares that the operands to the ternary have the same type. */
603 #define MALLOC(ap, i) (ap ? (void*) string_area_malloc(ap, i) : malloc(i))
606 * Create a file_struct for a named file by reading its stat()
607 * information and performing extensive checks against global
610 * @return the new file, or NULL if there was an error or this file
611 * should be excluded.
613 * @todo There is a small optimization opportunity here to avoid
614 * stat()ing the file in some circumstances, which has a certain cost.
615 * We are called immediately after doing readdir(), and so we may
616 * already know the d_type of the file. We could for example avoid
617 * statting directories if we're not recursing, but this is not a very
618 * important case. Some systems may not have d_type.
620 struct file_struct *make_file(int f, char *fname, struct string_area **ap,
623 struct file_struct *file;
625 char sum[SUM_LENGTH];
627 char cleaned_name[MAXPATHLEN];
628 char linkbuf[MAXPATHLEN];
629 extern int module_id;
631 strlcpy(cleaned_name, fname, MAXPATHLEN);
632 cleaned_name[MAXPATHLEN - 1] = 0;
633 clean_fname(cleaned_name);
634 if (sanitize_paths) {
635 sanitize_path(cleaned_name, NULL);
637 fname = cleaned_name;
639 memset(sum, 0, SUM_LENGTH);
641 if (readlink_stat(fname, &st, linkbuf) != 0) {
642 int save_errno = errno;
643 if ((errno == ENOENT) && copy_links && !noexcludes) {
644 /* symlink pointing nowhere, see if excluded */
645 memset((char *) &st, 0, sizeof(st));
646 if (check_exclude_file(f, fname, &st)) {
647 /* file is excluded anyway, ignore silently */
652 rprintf(FERROR, "readlink %s: %s\n",
653 fname, strerror(save_errno));
657 /* we use noexcludes from backup.c */
661 if (S_ISDIR(st.st_mode) && !recurse) {
662 rprintf(FINFO, "skipping directory %s\n", fname);
666 if (one_file_system && st.st_dev != filesystem_dev) {
667 if (skip_filesystem(fname, &st))
671 if (check_exclude_file(f, fname, &st))
675 if (lp_ignore_nonreadable(module_id) && access(fname, R_OK) != 0)
681 rprintf(FINFO, "make_file(%d,%s)\n", f, fname);
683 file = (struct file_struct *) malloc(sizeof(*file));
685 out_of_memory("make_file");
686 memset((char *) file, 0, sizeof(*file));
688 if ((p = strrchr(fname, '/'))) {
689 static char *lastdir;
691 if (lastdir && strcmp(fname, lastdir) == 0) {
692 file->dirname = lastdir;
694 file->dirname = strdup(fname);
695 lastdir = file->dirname;
697 file->basename = STRDUP(ap, p + 1);
700 file->dirname = NULL;
701 file->basename = STRDUP(ap, fname);
704 file->modtime = st.st_mtime;
705 file->length = st.st_size;
706 file->mode = st.st_mode;
707 file->uid = st.st_uid;
708 file->gid = st.st_gid;
709 file->dev = st.st_dev;
710 file->inode = st.st_ino;
711 #ifdef HAVE_STRUCT_STAT_ST_RDEV
712 file->rdev = st.st_rdev;
716 if (S_ISLNK(st.st_mode)) {
717 file->link = STRDUP(ap, linkbuf);
721 if (always_checksum) {
722 file->sum = (char *) MALLOC(ap, MD4_SUM_LENGTH);
724 out_of_memory("md4 sum");
725 /* drat. we have to provide a null checksum for non-regular
726 files in order to be compatible with earlier versions
728 if (S_ISREG(st.st_mode)) {
729 file_checksum(fname, file->sum, st.st_size);
731 memset(file->sum, 0, MD4_SUM_LENGTH);
736 static char *lastdir;
737 if (lastdir && strcmp(lastdir, flist_dir) == 0) {
738 file->basedir = lastdir;
740 file->basedir = strdup(flist_dir);
741 lastdir = file->basedir;
744 file->basedir = NULL;
747 if (!S_ISDIR(st.st_mode))
748 stats.total_size += st.st_size;
755 void send_file_name(int f, struct file_list *flist, char *fname,
756 int recursive, unsigned base_flags)
758 struct file_struct *file;
760 file = make_file(f, fname, &flist->string_area, 0);
765 maybe_emit_filelist_progress(flist);
769 if (write_batch) /* dw */
770 file->flags = FLAG_DELETE;
772 if (strcmp(file->basename, "")) {
773 flist->files[flist->count++] = file;
774 send_file_entry(file, f, base_flags);
777 if (S_ISDIR(file->mode) && recursive) {
778 struct exclude_struct **last_exclude_list =
780 send_directory(f, flist, f_name(file));
781 local_exclude_list = last_exclude_list;
788 static void send_directory(int f, struct file_list *flist, char *dir)
792 char fname[MAXPATHLEN];
799 rprintf(FERROR, "opendir(%s): %s\n", dir, strerror(errno));
803 strlcpy(fname, dir, MAXPATHLEN);
805 if (fname[l - 1] != '/') {
806 if (l == MAXPATHLEN - 1) {
809 "skipping long-named directory %s\n",
814 strlcat(fname, "/", MAXPATHLEN);
817 p = fname + strlen(fname);
819 local_exclude_list = NULL;
822 if (strlen(fname) + strlen(".cvsignore") <= MAXPATHLEN - 1) {
823 strcpy(p, ".cvsignore");
825 make_exclude_list(fname, NULL, 0, 0);
829 "cannot cvs-exclude in long-named directory %s\n",
834 for (di = readdir(d); di; di = readdir(d)) {
835 char *dname = d_name(di);
836 if (strcmp(dname, ".") == 0 || strcmp(dname, "..") == 0)
838 strlcpy(p, dname, MAXPATHLEN - l);
839 send_file_name(f, flist, fname, recurse, 0);
842 if (local_exclude_list) {
843 add_exclude_list("!", &local_exclude_list, 0);
852 * I *think* f==-1 means that the list should just be built in memory
853 * and not transmitted. But who can tell? -- mbp
855 struct file_list *send_file_list(int f, int argc, char *argv[])
859 char *p, *dir, *olddir;
860 char lastpath[MAXPATHLEN] = "";
861 struct file_list *flist;
864 if (show_filelist_p() && f != -1)
865 start_filelist_progress("building file list");
867 start_write = stats.total_written;
872 io_start_buffering(f);
875 for (i = 0; i < argc; i++) {
876 char *fname = topsrcname;
878 strlcpy(fname, argv[i], MAXPATHLEN);
881 if (l != 1 && fname[l - 1] == '/') {
882 if ((l == 2) && (fname[0] == '.')) {
883 /* Turn ./ into just . rather than ./.
884 This was put in to avoid a problem with
885 rsync -aR --delete from ./
886 The send_file_name() below of ./ was
887 mysteriously preventing deletes */
890 strlcat(fname, ".", MAXPATHLEN);
894 if (link_stat(fname, &st) != 0) {
897 rprintf(FERROR, "link_stat %s : %s\n",
898 fname, strerror(errno));
903 if (S_ISDIR(st.st_mode) && !recurse) {
904 rprintf(FINFO, "skipping directory %s\n", fname);
911 if (!relative_paths) {
912 p = strrchr(fname, '/');
921 } else if (f != -1 && (p = strrchr(fname, '/'))) {
922 /* this ensures we send the intermediate directories,
923 thus getting their permissions right */
925 if (strcmp(lastpath, fname)) {
926 strlcpy(lastpath, fname, sizeof(lastpath));
928 for (p = fname + 1; (p = strchr(p, '/'));
930 int copy_links_saved = copy_links;
931 int recurse_saved = recurse;
933 copy_links = copy_unsafe_links;
934 /* set recurse to 1 to prevent make_file
935 from ignoring directory, but still
936 turn off the recursive parameter to
939 send_file_name(f, flist, fname, 0,
941 copy_links = copy_links_saved;
942 recurse = recurse_saved;
954 olddir = push_dir(dir, 1);
958 rprintf(FERROR, "push_dir %s : %s\n",
959 dir, strerror(errno));
967 set_filesystem(fname);
969 send_file_name(f, flist, fname, recurse, FLAG_DELETE);
971 if (olddir != NULL) {
973 if (pop_dir(olddir) != 0) {
974 rprintf(FERROR, "pop_dir %s : %s\n",
975 dir, strerror(errno));
976 exit_cleanup(RERR_FILESELECT);
981 topsrcname[0] = '\0';
984 send_file_entry(NULL, f, 0);
987 if (show_filelist_p())
988 finish_filelist_progress(flist);
990 clean_flist(flist, 0);
992 /* now send the uid/gid list. This was introduced in protocol
994 if (f != -1 && remote_version >= 15) {
998 /* if protocol version is >= 17 then send the io_error flag */
999 if (f != -1 && remote_version >= 17) {
1000 extern int module_id;
1001 write_int(f, lp_ignore_errors(module_id) ? 0 : io_error);
1006 stats.flist_size = stats.total_written - start_write;
1007 stats.num_files = flist->count;
1008 if (write_batch) /* dw */
1009 write_batch_flist_info(flist->count, flist->files);
1013 rprintf(FINFO, "send_file_list done\n");
1019 struct file_list *recv_file_list(int f)
1021 struct file_list *flist;
1022 unsigned char flags;
1024 extern int list_only;
1026 if (show_filelist_p())
1027 start_filelist_progress("receiving file list");
1029 start_read = stats.total_read;
1031 flist = (struct file_list *) malloc(sizeof(flist[0]));
1036 flist->malloced = 1000;
1038 (struct file_struct **) malloc(sizeof(flist->files[0]) *
1044 for (flags = read_byte(f); flags; flags = read_byte(f)) {
1045 int i = flist->count;
1047 flist_expand(flist);
1049 receive_file_entry(&flist->files[i], flags, f);
1051 if (S_ISREG(flist->files[i]->mode))
1052 stats.total_size += flist->files[i]->length;
1056 maybe_emit_filelist_progress(flist);
1059 rprintf(FINFO, "recv_file_name(%s)\n",
1060 f_name(flist->files[i]));
1065 rprintf(FINFO, "received %d names\n", flist->count);
1067 clean_flist(flist, relative_paths);
1069 if (show_filelist_p()) {
1070 finish_filelist_progress(flist);
1073 /* now recv the uid/gid list. This was introduced in protocol version 15 */
1074 if (f != -1 && remote_version >= 15) {
1075 recv_uid_list(f, flist);
1078 /* if protocol version is >= 17 then recv the io_error flag */
1079 if (f != -1 && remote_version >= 17 && !read_batch) { /* dw-added readbatch */
1080 extern int module_id;
1081 extern int ignore_errors;
1082 if (lp_ignore_errors(module_id) || ignore_errors) {
1085 io_error |= read_int(f);
1091 for (i = 0; i < flist->count; i++) {
1092 list_file_entry(flist->files[i]);
1098 rprintf(FINFO, "recv_file_list done\n");
1100 stats.flist_size = stats.total_read - start_read;
1101 stats.num_files = flist->count;
1106 out_of_memory("recv_file_list");
1107 return NULL; /* not reached */
1112 * XXX: This is currently the hottest function while building the file
1113 * list, because building f_name()s every time is expensive.
1115 int file_compare(struct file_struct **f1, struct file_struct **f2)
1117 if (!(*f1)->basename && !(*f2)->basename)
1119 if (!(*f1)->basename)
1121 if (!(*f2)->basename)
1123 if ((*f1)->dirname == (*f2)->dirname)
1124 return u_strcmp((*f1)->basename, (*f2)->basename);
1125 return u_strcmp(f_name(*f1), f_name(*f2));
1129 int flist_find(struct file_list *flist, struct file_struct *f)
1131 int low = 0, high = flist->count - 1;
1133 if (flist->count <= 0)
1136 while (low != high) {
1137 int mid = (low + high) / 2;
1139 file_compare(&flist->files[flist_up(flist, mid)], &f);
1141 return flist_up(flist, mid);
1149 if (file_compare(&flist->files[flist_up(flist, low)], &f) == 0)
1150 return flist_up(flist, low);
1158 void free_file(struct file_struct *file)
1163 free(file->basename);
1173 * allocate a new file list
1175 struct file_list *flist_new()
1177 struct file_list *flist;
1179 flist = (struct file_list *) malloc(sizeof(flist[0]));
1181 out_of_memory("send_file_list");
1184 flist->malloced = 0;
1185 flist->files = NULL;
1188 flist->string_area = string_area_new(0);
1190 flist->string_area = NULL;
1196 * free up all elements in a flist
1198 void flist_free(struct file_list *flist)
1201 for (i = 1; i < flist->count; i++) {
1202 if (!flist->string_area)
1203 free_file(flist->files[i]);
1204 free(flist->files[i]);
1206 /* FIXME: I don't think we generally need to blank the flist
1207 * since it's about to be freed. This will just cause more
1208 * memory traffic. If you want a freed-memory debugger, you
1209 * know where to get it. */
1210 memset((char *) flist->files, 0,
1211 sizeof(flist->files[0]) * flist->count);
1213 if (flist->string_area)
1214 string_area_free(flist->string_area);
1215 memset((char *) flist, 0, sizeof(*flist));
1221 * This routine ensures we don't have any duplicate names in our file list.
1222 * duplicate names can cause corruption because of the pipelining
1224 static void clean_flist(struct file_list *flist, int strip_root)
1228 if (!flist || flist->count == 0)
1231 qsort(flist->files, flist->count,
1232 sizeof(flist->files[0]), (int (*)()) file_compare);
1234 for (i = 1; i < flist->count; i++) {
1235 if (flist->files[i]->basename &&
1236 flist->files[i - 1]->basename &&
1237 strcmp(f_name(flist->files[i]),
1238 f_name(flist->files[i - 1])) == 0) {
1239 if (verbose > 1 && !am_server)
1241 "removing duplicate name %s from file list %d\n",
1242 f_name(flist->files[i - 1]),
1244 /* it's not great that the flist knows the semantics of the
1245 * file memory usage, but i'd rather not add a flag byte
1246 * to that struct. XXX can i use a bit in the flags field? */
1247 if (flist->string_area)
1248 flist->files[i][0] = null_file;
1250 free_file(flist->files[i]);
1254 /* FIXME: There is a bug here when filenames are repeated more
1255 * than once, because we don't handle freed files when doing
1256 * the comparison. */
1259 /* we need to strip off the root directory in the case
1260 of relative paths, but this must be done _after_
1261 the sorting phase */
1262 for (i = 0; i < flist->count; i++) {
1263 if (flist->files[i]->dirname &&
1264 flist->files[i]->dirname[0] == '/') {
1265 memmove(&flist->files[i]->dirname[0],
1266 &flist->files[i]->dirname[1],
1267 strlen(flist->files[i]->dirname));
1270 if (flist->files[i]->dirname &&
1271 !flist->files[i]->dirname[0]) {
1272 flist->files[i]->dirname = NULL;
1281 for (i = 0; i < flist->count; i++) {
1282 rprintf(FINFO, "[%d] i=%d %s %s mode=0%o len=%.0f\n",
1284 NS(flist->files[i]->dirname),
1285 NS(flist->files[i]->basename),
1286 (int) flist->files[i]->mode,
1287 (double) flist->files[i]->length);
1293 * return the full filename of a flist entry
1295 * This function is too expensive at the moment, because it copies
1296 * strings when often we only want to compare them. In any case,
1297 * using strlcat is silly because it will walk the string repeatedly.
1299 char *f_name(struct file_struct *f)
1301 static char names[10][MAXPATHLEN];
1305 if (!f || !f->basename)
1313 off = strlcpy(p, f->dirname, MAXPATHLEN);
1314 off += strlcpy(p + off, "/", MAXPATHLEN - off);
1315 off += strlcpy(p + off, f->basename, MAXPATHLEN - off);
1317 strlcpy(p, f->basename, MAXPATHLEN);