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 struct exclude_struct **local_exclude_list;
66 static struct file_struct null_file;
68 static void clean_flist(struct file_list *flist, int strip_root);
71 static int show_filelist_p(void)
73 return verbose && recurse && !am_server;
76 static void start_filelist_progress(char *kind)
78 rprintf(FINFO, "%s ... ", kind);
79 if ((verbose > 1) || do_progress)
85 static void emit_filelist_progress(const struct file_list *flist)
87 rprintf(FINFO, " %d files...\r", flist->count);
91 static void maybe_emit_filelist_progress(const struct file_list *flist)
93 if (do_progress && show_filelist_p() && ((flist->count % 100) == 0))
94 emit_filelist_progress(flist);
98 static void finish_filelist_progress(const struct file_list *flist)
101 /* This overwrites the progress line */
102 rprintf(FINFO, "%d file%sto consider\n",
103 flist->count, flist->count == 1 ? " " : "s ");
105 rprintf(FINFO, "done\n");
109 void show_flist_stats(void)
115 static struct string_area *string_area_new(int size)
117 struct string_area *a;
121 a = new(struct string_area);
123 out_of_memory("string_area_new");
124 a->current = a->base = new_array(char, size);
126 out_of_memory("string_area_new buffer");
127 a->end = a->base + size;
133 static void string_area_free(struct string_area *a)
135 struct string_area *next;
137 for (; a; a = next) {
143 static char *string_area_malloc(struct string_area **ap, int size)
146 struct string_area *a;
148 /* does the request fit into the current space? */
150 if (a->current + size >= a->end) {
151 /* no; get space, move new string_area to front of the list */
152 a = string_area_new(size > ARENA_SIZE ? size : ARENA_SIZE);
157 /* have space; do the "allocation." */
163 static char *string_area_strdup(struct string_area **ap, const char *src)
165 char *dest = string_area_malloc(ap, strlen(src) + 1);
166 return strcpy(dest, src);
169 static void list_file_entry(struct file_struct *f)
174 /* this can happen if duplicate names were removed */
177 permstring(perms, f->mode);
179 if (preserve_links && S_ISLNK(f->mode)) {
180 rprintf(FINFO, "%s %11.0f %s %s -> %s\n",
182 (double) f->length, timestring(f->modtime),
185 rprintf(FINFO, "%s %11.0f %s %s\n",
187 (double) f->length, timestring(f->modtime),
194 * Stat either a symlink or its referent, depending on the settings of
195 * copy_links, copy_unsafe_links, etc.
197 * @retval -1 on error
199 * @retval 0 for success
201 * @post If @p path is a symlink, then @p linkbuf (of size @c
202 * MAXPATHLEN) contains the symlink target.
204 * @post @p buffer contains information about the link or the
205 * referrent as appropriate, if they exist.
207 int readlink_stat(const char *path, STRUCT_STAT * buffer, char *linkbuf)
211 return do_stat(path, buffer);
213 if (do_lstat(path, buffer) == -1) {
216 if (S_ISLNK(buffer->st_mode)) {
218 l = readlink((char *) path, linkbuf, MAXPATHLEN - 1);
222 if (copy_unsafe_links && unsafe_symlink(linkbuf, path)) {
224 rprintf(FINFO,"copying unsafe symlink \"%s\" -> \"%s\"\n",
227 return do_stat(path, buffer);
232 return do_stat(path, buffer);
236 int link_stat(const char *path, STRUCT_STAT * buffer)
240 return do_stat(path, buffer);
242 return do_lstat(path, buffer);
245 return do_stat(path, buffer);
250 This function is used to check if a file should be included/excluded
251 from the list of files based on its name and type etc
253 static int check_exclude_file(int f, char *fname, STRUCT_STAT * st)
255 extern int delete_excluded;
257 /* f is set to -1 when calculating deletion file list */
258 if ((f == -1) && delete_excluded) {
261 if (check_exclude(fname, local_exclude_list, st)) {
267 /* used by the one_file_system code */
268 static dev_t filesystem_dev;
270 static void set_filesystem(char *fname)
273 if (link_stat(fname, &st) != 0)
275 filesystem_dev = st.st_dev;
279 static int to_wire_mode(mode_t mode)
281 if (S_ISLNK(mode) && (_S_IFLNK != 0120000)) {
282 return (mode & ~(_S_IFMT)) | 0120000;
287 static mode_t from_wire_mode(int mode)
289 if ((mode & (_S_IFMT)) == 0120000 && (_S_IFLNK != 0120000)) {
290 return (mode & ~(_S_IFMT)) | _S_IFLNK;
292 return (mode_t) mode;
296 static void send_directory(int f, struct file_list *flist, char *dir);
298 static char *flist_dir;
302 * Make sure @p flist is big enough to hold at least @p flist->count
305 static void flist_expand(struct file_list *flist)
307 if (flist->count >= flist->malloced) {
310 if (flist->malloced < 1000)
311 flist->malloced += 1000;
313 flist->malloced *= 2;
316 new_ptr = realloc_array(flist->files,
317 struct file_struct *,
320 new_ptr = new_array(struct file_struct *,
324 rprintf(FINFO, "expand file_list to %.0f bytes, did%s move\n",
325 (double)sizeof(flist->files[0])
327 (new_ptr == flist->files) ? " not" : "");
330 flist->files = (struct file_struct **) new_ptr;
333 out_of_memory("flist_expand");
338 static void send_file_entry(struct file_struct *file, int f,
342 static time_t last_time;
343 static mode_t last_mode;
344 static DEV64_T last_rdev;
345 static uid_t last_uid;
346 static gid_t last_gid;
347 static char lastname[MAXPATHLEN];
359 io_write_phase = "send_file_entry";
361 fname = f_name(file);
365 if (file->mode == last_mode)
367 if (file->rdev == last_rdev)
369 if (file->uid == last_uid)
371 if (file->gid == last_gid)
373 if (file->modtime == last_time)
377 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
379 l2 = strlen(fname) - l1;
386 /* we must make sure we don't send a zero flags byte or the other
387 end will terminate the flist transfer */
388 if (flags == 0 && !S_ISDIR(file->mode))
389 flags |= FLAG_DELETE;
393 write_byte(f, flags);
394 if (flags & SAME_NAME)
396 if (flags & LONG_NAME)
400 write_buf(f, fname + l1, l2);
402 write_longint(f, file->length);
403 if (!(flags & SAME_TIME))
404 write_int(f, (int) file->modtime);
405 if (!(flags & SAME_MODE))
406 write_int(f, to_wire_mode(file->mode));
407 if (preserve_uid && !(flags & SAME_UID)) {
409 write_int(f, (int) file->uid);
411 if (preserve_gid && !(flags & SAME_GID)) {
413 write_int(f, (int) file->gid);
415 if (preserve_devices && IS_DEVICE(file->mode)
416 && !(flags & SAME_RDEV))
417 write_int(f, (int) file->rdev);
420 if (preserve_links && S_ISLNK(file->mode)) {
421 write_int(f, strlen(file->link));
422 write_buf(f, file->link, strlen(file->link));
426 #if SUPPORT_HARD_LINKS
427 if (preserve_hard_links && S_ISREG(file->mode)) {
428 if (remote_version < 26) {
429 /* 32-bit dev_t and ino_t */
430 write_int(f, (int) file->dev);
431 write_int(f, (int) file->inode);
433 /* 64-bit dev_t and ino_t */
434 write_longint(f, file->dev);
435 write_longint(f, file->inode);
440 if (always_checksum) {
441 if (remote_version < 21) {
442 write_buf(f, file->sum, 2);
444 write_buf(f, file->sum, MD4_SUM_LENGTH);
448 last_mode = file->mode;
449 last_rdev = file->rdev;
450 last_uid = file->uid;
451 last_gid = file->gid;
452 last_time = file->modtime;
454 strlcpy(lastname, fname, MAXPATHLEN);
455 lastname[MAXPATHLEN - 1] = 0;
457 io_write_phase = "unknown";
462 static void receive_file_entry(struct file_struct **fptr,
463 unsigned flags, int f)
465 static time_t last_time;
466 static mode_t last_mode;
467 static DEV64_T last_rdev;
468 static uid_t last_uid;
469 static gid_t last_gid;
470 static char lastname[MAXPATHLEN];
471 char thisname[MAXPATHLEN];
472 unsigned int l1 = 0, l2 = 0;
474 struct file_struct *file;
476 if (flags & SAME_NAME)
479 if (flags & LONG_NAME)
484 file = new(struct file_struct);
486 out_of_memory("receive_file_entry");
487 memset((char *) file, 0, sizeof(*file));
490 if (l2 >= MAXPATHLEN - l1) {
492 "overflow: flags=0x%x l1=%d l2=%d lastname=%s\n",
493 flags, l1, l2, lastname);
494 overflow("receive_file_entry");
497 strlcpy(thisname, lastname, l1 + 1);
498 read_sbuf(f, &thisname[l1], l2);
499 thisname[l1 + l2] = 0;
501 strlcpy(lastname, thisname, MAXPATHLEN);
502 lastname[MAXPATHLEN - 1] = 0;
504 clean_fname(thisname);
506 if (sanitize_paths) {
507 sanitize_path(thisname, NULL);
510 if ((p = strrchr(thisname, '/'))) {
511 static char *lastdir;
513 if (lastdir && strcmp(thisname, lastdir) == 0) {
514 file->dirname = lastdir;
516 file->dirname = strdup(thisname);
517 lastdir = file->dirname;
519 file->basename = strdup(p + 1);
521 file->dirname = NULL;
522 file->basename = strdup(thisname);
526 out_of_memory("receive_file_entry 1");
530 file->length = read_longint(f);
532 (flags & SAME_TIME) ? last_time : (time_t) read_int(f);
534 (flags & SAME_MODE) ? last_mode : from_wire_mode(read_int(f));
537 (flags & SAME_UID) ? last_uid : (uid_t) read_int(f);
540 (flags & SAME_GID) ? last_gid : (gid_t) read_int(f);
541 if (preserve_devices && IS_DEVICE(file->mode))
543 (flags & SAME_RDEV) ? last_rdev : (DEV64_T) read_int(f);
545 if (preserve_links && S_ISLNK(file->mode)) {
548 rprintf(FERROR, "overflow: l=%d\n", l);
549 overflow("receive_file_entry");
551 file->link = new_array(char, l + 1);
553 out_of_memory("receive_file_entry 2");
554 read_sbuf(f, file->link, l);
555 if (sanitize_paths) {
556 sanitize_path(file->link, file->dirname);
559 #if SUPPORT_HARD_LINKS
560 if (preserve_hard_links && S_ISREG(file->mode)) {
561 if (remote_version < 26) {
562 file->dev = read_int(f);
563 file->inode = read_int(f);
565 file->dev = read_longint(f);
566 file->inode = read_longint(f);
571 if (always_checksum) {
572 file->sum = new_array(char, MD4_SUM_LENGTH);
574 out_of_memory("md4 sum");
575 if (remote_version < 21) {
576 read_buf(f, file->sum, 2);
578 read_buf(f, file->sum, MD4_SUM_LENGTH);
582 last_mode = file->mode;
583 last_rdev = file->rdev;
584 last_uid = file->uid;
585 last_gid = file->gid;
586 last_time = file->modtime;
588 if (!preserve_perms) {
589 extern int orig_umask;
590 /* set an appropriate set of permissions based on original
591 permissions and umask. This emulates what GNU cp does */
592 file->mode &= ~orig_umask;
597 /* determine if a file in a different filesstem should be skipped
598 when one_file_system is set. We bascally only want to include
599 the mount points - but they can be hard to find! */
600 static int skip_filesystem(char *fname, STRUCT_STAT * st)
603 char *p = strrchr(fname, '/');
605 /* skip all but directories */
606 if (!S_ISDIR(st->st_mode))
609 /* if its not a subdirectory then allow */
614 if (link_stat(fname, &st2)) {
620 return (st2.st_dev != filesystem_dev);
623 #define STRDUP(ap, p) (ap ? string_area_strdup(ap, p) : strdup(p))
624 /* IRIX cc cares that the operands to the ternary have the same type. */
625 #define MALLOC(ap, i) (ap ? (void*) string_area_malloc(ap, i) : malloc(i))
628 * Create a file_struct for a named file by reading its stat()
629 * information and performing extensive checks against global
632 * @return the new file, or NULL if there was an error or this file
633 * should be excluded.
635 * @todo There is a small optimization opportunity here to avoid
636 * stat()ing the file in some circumstances, which has a certain cost.
637 * We are called immediately after doing readdir(), and so we may
638 * already know the d_type of the file. We could for example avoid
639 * statting directories if we're not recursing, but this is not a very
640 * important case. Some systems may not have d_type.
642 struct file_struct *make_file(int f, char *fname, struct string_area **ap,
645 struct file_struct *file;
647 char sum[SUM_LENGTH];
649 char cleaned_name[MAXPATHLEN];
650 char linkbuf[MAXPATHLEN];
651 extern int module_id;
653 strlcpy(cleaned_name, fname, MAXPATHLEN);
654 cleaned_name[MAXPATHLEN - 1] = 0;
655 clean_fname(cleaned_name);
656 if (sanitize_paths) {
657 sanitize_path(cleaned_name, NULL);
659 fname = cleaned_name;
661 memset(sum, 0, SUM_LENGTH);
663 if (readlink_stat(fname, &st, linkbuf) != 0) {
664 int save_errno = errno;
665 if ((errno == ENOENT) && !noexcludes) {
666 /* either symlink pointing nowhere or file that
667 * was removed during rsync run; see if excluded
668 * before reporting an error */
669 memset((char *) &st, 0, sizeof(st));
670 if (check_exclude_file(f, fname, &st)) {
671 /* file is excluded anyway, ignore silently */
676 rprintf(FERROR, "readlink %s: %s\n",
677 fname, strerror(save_errno));
681 /* we use noexcludes from backup.c */
685 if (S_ISDIR(st.st_mode) && !recurse) {
686 rprintf(FINFO, "skipping directory %s\n", fname);
690 if (one_file_system && st.st_dev != filesystem_dev) {
691 if (skip_filesystem(fname, &st))
695 if (check_exclude_file(f, fname, &st))
699 if (lp_ignore_nonreadable(module_id) && access(fname, R_OK) != 0)
705 rprintf(FINFO, "make_file(%d,%s)\n", f, fname);
707 file = new(struct file_struct);
709 out_of_memory("make_file");
710 memset((char *) file, 0, sizeof(*file));
712 if ((p = strrchr(fname, '/'))) {
713 static char *lastdir;
715 if (lastdir && strcmp(fname, lastdir) == 0) {
716 file->dirname = lastdir;
718 file->dirname = strdup(fname);
719 lastdir = file->dirname;
721 file->basename = STRDUP(ap, p + 1);
724 file->dirname = NULL;
725 file->basename = STRDUP(ap, fname);
728 file->modtime = st.st_mtime;
729 file->length = st.st_size;
730 file->mode = st.st_mode;
731 file->uid = st.st_uid;
732 file->gid = st.st_gid;
733 file->dev = st.st_dev;
734 file->inode = st.st_ino;
735 #ifdef HAVE_STRUCT_STAT_ST_RDEV
736 file->rdev = st.st_rdev;
740 if (S_ISLNK(st.st_mode)) {
741 file->link = STRDUP(ap, linkbuf);
745 if (always_checksum) {
746 file->sum = (char *) MALLOC(ap, MD4_SUM_LENGTH);
748 out_of_memory("md4 sum");
749 /* drat. we have to provide a null checksum for non-regular
750 files in order to be compatible with earlier versions
752 if (S_ISREG(st.st_mode)) {
753 file_checksum(fname, file->sum, st.st_size);
755 memset(file->sum, 0, MD4_SUM_LENGTH);
760 static char *lastdir;
761 if (lastdir && strcmp(lastdir, flist_dir) == 0) {
762 file->basedir = lastdir;
764 file->basedir = strdup(flist_dir);
765 lastdir = file->basedir;
768 file->basedir = NULL;
771 if (!S_ISDIR(st.st_mode))
772 stats.total_size += st.st_size;
779 void send_file_name(int f, struct file_list *flist, char *fname,
780 int recursive, unsigned base_flags)
782 struct file_struct *file;
784 file = make_file(f, fname, &flist->string_area, 0);
789 maybe_emit_filelist_progress(flist);
793 if (write_batch) /* dw */
794 file->flags = FLAG_DELETE;
796 if (strcmp(file->basename, "")) {
797 flist->files[flist->count++] = file;
798 send_file_entry(file, f, base_flags);
801 if (S_ISDIR(file->mode) && recursive) {
802 struct exclude_struct **last_exclude_list =
804 send_directory(f, flist, f_name(file));
805 local_exclude_list = last_exclude_list;
812 static void send_directory(int f, struct file_list *flist, char *dir)
816 char fname[MAXPATHLEN];
823 rprintf(FERROR, "opendir(%s): %s\n", dir, strerror(errno));
827 strlcpy(fname, dir, MAXPATHLEN);
829 if (fname[l - 1] != '/') {
830 if (l == MAXPATHLEN - 1) {
833 "skipping long-named directory %s\n",
838 strlcat(fname, "/", MAXPATHLEN);
841 p = fname + strlen(fname);
843 local_exclude_list = NULL;
846 if (strlen(fname) + strlen(".cvsignore") <= MAXPATHLEN - 1) {
847 strcpy(p, ".cvsignore");
849 make_exclude_list(fname, NULL, 0, 0);
853 "cannot cvs-exclude in long-named directory %s\n",
858 for (di = readdir(d); di; di = readdir(d)) {
859 char *dname = d_name(di);
860 if (strcmp(dname, ".") == 0 || strcmp(dname, "..") == 0)
862 strlcpy(p, dname, MAXPATHLEN - l);
863 send_file_name(f, flist, fname, recurse, 0);
866 if (local_exclude_list) {
867 add_exclude_list("!", &local_exclude_list, 0);
876 * I <b>think</b> f==-1 means that the list should just be built in
877 * memory and not transmitted. But who can tell? -- mbp
879 struct file_list *send_file_list(int f, int argc, char *argv[])
883 char *p, *dir, *olddir;
884 char lastpath[MAXPATHLEN] = "";
885 struct file_list *flist;
888 if (show_filelist_p() && f != -1)
889 start_filelist_progress("building file list");
891 start_write = stats.total_written;
896 io_start_buffering(f);
899 for (i = 0; i < argc; i++) {
900 char fname2[MAXPATHLEN];
901 char *fname = fname2;
903 strlcpy(fname, argv[i], MAXPATHLEN);
906 if (l != 1 && fname[l - 1] == '/') {
907 if ((l == 2) && (fname[0] == '.')) {
908 /* Turn ./ into just . rather than ./.
909 This was put in to avoid a problem with
910 rsync -aR --delete from ./
911 The send_file_name() below of ./ was
912 mysteriously preventing deletes */
915 strlcat(fname, ".", MAXPATHLEN);
919 if (link_stat(fname, &st) != 0) {
922 rprintf(FERROR, "link_stat %s : %s\n",
923 fname, strerror(errno));
928 if (S_ISDIR(st.st_mode) && !recurse) {
929 rprintf(FINFO, "skipping directory %s\n", fname);
936 if (!relative_paths) {
937 p = strrchr(fname, '/');
946 } else if (f != -1 && (p = strrchr(fname, '/'))) {
947 /* this ensures we send the intermediate directories,
948 thus getting their permissions right */
950 if (strcmp(lastpath, fname)) {
951 strlcpy(lastpath, fname, sizeof(lastpath));
953 for (p = fname + 1; (p = strchr(p, '/'));
955 int copy_links_saved = copy_links;
956 int recurse_saved = recurse;
958 copy_links = copy_unsafe_links;
959 /* set recurse to 1 to prevent make_file
960 from ignoring directory, but still
961 turn off the recursive parameter to
964 send_file_name(f, flist, fname, 0,
966 copy_links = copy_links_saved;
967 recurse = recurse_saved;
979 olddir = push_dir(dir, 1);
983 rprintf(FERROR, "push_dir %s : %s\n",
984 dir, strerror(errno));
992 set_filesystem(fname);
994 send_file_name(f, flist, fname, recurse, FLAG_DELETE);
996 if (olddir != NULL) {
998 if (pop_dir(olddir) != 0) {
999 rprintf(FERROR, "pop_dir %s : %s\n",
1000 dir, strerror(errno));
1001 exit_cleanup(RERR_FILESELECT);
1007 send_file_entry(NULL, f, 0);
1010 if (show_filelist_p() && f != -1) {
1011 finish_filelist_progress(flist);
1014 clean_flist(flist, 0);
1016 /* now send the uid/gid list. This was introduced in protocol
1018 if (f != -1 && remote_version >= 15) {
1022 /* if protocol version is >= 17 then send the io_error flag */
1023 if (f != -1 && remote_version >= 17) {
1024 extern int module_id;
1025 write_int(f, lp_ignore_errors(module_id) ? 0 : io_error);
1030 stats.flist_size = stats.total_written - start_write;
1031 stats.num_files = flist->count;
1032 if (write_batch) /* dw */
1033 write_batch_flist_info(flist->count, flist->files);
1037 rprintf(FINFO, "send_file_list done\n");
1043 struct file_list *recv_file_list(int f)
1045 struct file_list *flist;
1046 unsigned char flags;
1048 extern int list_only;
1050 if (show_filelist_p())
1051 start_filelist_progress("receiving file list");
1053 start_read = stats.total_read;
1055 flist = new(struct file_list);
1060 flist->malloced = 1000;
1061 flist->files = new_array(struct file_struct *, flist->malloced);
1066 for (flags = read_byte(f); flags; flags = read_byte(f)) {
1067 int i = flist->count;
1069 flist_expand(flist);
1071 receive_file_entry(&flist->files[i], flags, f);
1073 if (S_ISREG(flist->files[i]->mode))
1074 stats.total_size += flist->files[i]->length;
1078 maybe_emit_filelist_progress(flist);
1081 rprintf(FINFO, "recv_file_name(%s)\n",
1082 f_name(flist->files[i]));
1087 rprintf(FINFO, "received %d names\n", flist->count);
1089 clean_flist(flist, relative_paths);
1091 if (show_filelist_p()) {
1092 finish_filelist_progress(flist);
1095 /* now recv the uid/gid list. This was introduced in protocol version 15 */
1096 if (f != -1 && remote_version >= 15) {
1097 recv_uid_list(f, flist);
1100 /* if protocol version is >= 17 then recv the io_error flag */
1101 if (f != -1 && remote_version >= 17 && !read_batch) { /* dw-added readbatch */
1102 extern int module_id;
1103 extern int ignore_errors;
1104 if (lp_ignore_errors(module_id) || ignore_errors) {
1107 io_error |= read_int(f);
1113 for (i = 0; i < flist->count; i++) {
1114 list_file_entry(flist->files[i]);
1120 rprintf(FINFO, "recv_file_list done\n");
1122 stats.flist_size = stats.total_read - start_read;
1123 stats.num_files = flist->count;
1128 out_of_memory("recv_file_list");
1129 return NULL; /* not reached */
1134 * XXX: This is currently the hottest function while building the file
1135 * list, because building f_name()s every time is expensive.
1137 int file_compare(struct file_struct **f1, struct file_struct **f2)
1139 if (!(*f1)->basename && !(*f2)->basename)
1141 if (!(*f1)->basename)
1143 if (!(*f2)->basename)
1145 if ((*f1)->dirname == (*f2)->dirname)
1146 return u_strcmp((*f1)->basename, (*f2)->basename);
1147 return u_strcmp(f_name(*f1), f_name(*f2));
1151 int flist_find(struct file_list *flist, struct file_struct *f)
1153 int low = 0, high = flist->count - 1;
1155 while (high >= 0 && !flist->files[high]->basename) high--;
1160 while (low != high) {
1161 int mid = (low + high) / 2;
1163 file_compare(&flist->files[flist_up(flist, mid)], &f);
1165 return flist_up(flist, mid);
1173 if (file_compare(&flist->files[flist_up(flist, low)], &f) == 0)
1174 return flist_up(flist, low);
1182 void free_file(struct file_struct *file)
1187 free(file->basename);
1197 * allocate a new file list
1199 struct file_list *flist_new(void)
1201 struct file_list *flist;
1203 flist = new(struct file_list);
1205 out_of_memory("send_file_list");
1208 flist->malloced = 0;
1209 flist->files = NULL;
1212 flist->string_area = string_area_new(0);
1214 flist->string_area = NULL;
1220 * free up all elements in a flist
1222 void flist_free(struct file_list *flist)
1225 for (i = 1; i < flist->count; i++) {
1226 if (!flist->string_area)
1227 free_file(flist->files[i]);
1228 free(flist->files[i]);
1230 /* FIXME: I don't think we generally need to blank the flist
1231 * since it's about to be freed. This will just cause more
1232 * memory traffic. If you want a freed-memory debugger, you
1233 * know where to get it. */
1234 memset((char *) flist->files, 0,
1235 sizeof(flist->files[0]) * flist->count);
1237 if (flist->string_area)
1238 string_area_free(flist->string_area);
1239 memset((char *) flist, 0, sizeof(*flist));
1245 * This routine ensures we don't have any duplicate names in our file list.
1246 * duplicate names can cause corruption because of the pipelining
1248 static void clean_flist(struct file_list *flist, int strip_root)
1251 char *name, *prev_name = NULL;
1253 if (!flist || flist->count == 0)
1256 qsort(flist->files, flist->count,
1257 sizeof(flist->files[0]), (int (*)()) file_compare);
1259 for (i = 0; i < flist->count; i++) {
1260 if (flist->files[i]->basename) {
1261 prev_name = f_name(flist->files[i]);
1265 while (++i < flist->count) {
1266 if (!flist->files[i]->basename)
1268 name = f_name(flist->files[i]);
1269 if (strcmp(name, prev_name) == 0) {
1270 if (verbose > 1 && !am_server) {
1272 "removing duplicate name %s from file list %d\n",
1275 /* it's not great that the flist knows the semantics of
1276 * the file memory usage, but i'd rather not add a flag
1277 * byte to that struct.
1278 * XXX can i use a bit in the flags field? */
1279 if (flist->string_area)
1280 flist->files[i][0] = null_file;
1282 free_file(flist->files[i]);
1288 /* we need to strip off the root directory in the case
1289 of relative paths, but this must be done _after_
1290 the sorting phase */
1291 for (i = 0; i < flist->count; i++) {
1292 if (flist->files[i]->dirname &&
1293 flist->files[i]->dirname[0] == '/') {
1294 memmove(&flist->files[i]->dirname[0],
1295 &flist->files[i]->dirname[1],
1296 strlen(flist->files[i]->dirname));
1299 if (flist->files[i]->dirname &&
1300 !flist->files[i]->dirname[0]) {
1301 flist->files[i]->dirname = NULL;
1309 for (i = 0; i < flist->count; i++) {
1310 rprintf(FINFO, "[%d] i=%d %s %s mode=0%o len=%.0f\n",
1312 NS(flist->files[i]->dirname),
1313 NS(flist->files[i]->basename),
1314 (int) flist->files[i]->mode,
1315 (double) flist->files[i]->length);
1321 * return the full filename of a flist entry
1323 * This function is too expensive at the moment, because it copies
1324 * strings when often we only want to compare them. In any case,
1325 * using strlcat is silly because it will walk the string repeatedly.
1327 char *f_name(struct file_struct *f)
1329 static char names[10][MAXPATHLEN];
1333 if (!f || !f->basename)
1341 off = strlcpy(p, f->dirname, MAXPATHLEN);
1342 off += strlcpy(p + off, "/", MAXPATHLEN - off);
1343 off += strlcpy(p + off, f->basename, MAXPATHLEN - off);
1345 strlcpy(p, f->basename, MAXPATHLEN);