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),
196 * Stat either a symlink or its referent, depending on the settings of
197 * copy_links, copy_unsafe_links, etc.
199 * @return -1 on error; or 0. If a symlink, then @p Linkbuf (of size
200 * MAXPATHLEN) contains the symlink target.
202 int readlink_stat(const char *path, STRUCT_STAT * buffer, char *linkbuf)
206 return do_stat(path, buffer);
208 if (do_lstat(path, buffer) == -1) {
211 if (S_ISLNK(buffer->st_mode)) {
213 l = readlink((char *) path, linkbuf, MAXPATHLEN - 1);
217 if (copy_unsafe_links && (topsrcname[0] != '\0') &&
218 unsafe_symlink(linkbuf, topsrcname)) {
219 return do_stat(path, buffer);
224 return do_stat(path, buffer);
228 int link_stat(const char *path, STRUCT_STAT * buffer)
232 return do_stat(path, buffer);
234 return do_lstat(path, buffer);
237 return do_stat(path, buffer);
242 This function is used to check if a file should be included/excluded
243 from the list of files based on its name and type etc
245 static int check_exclude_file(int f, char *fname, STRUCT_STAT * st)
247 extern int delete_excluded;
249 /* f is set to -1 when calculating deletion file list */
250 if ((f == -1) && delete_excluded) {
253 if (check_exclude(fname, local_exclude_list, st)) {
259 /* used by the one_file_system code */
260 static dev_t filesystem_dev;
262 static void set_filesystem(char *fname)
265 if (link_stat(fname, &st) != 0)
267 filesystem_dev = st.st_dev;
271 static int to_wire_mode(mode_t mode)
273 if (S_ISLNK(mode) && (_S_IFLNK != 0120000)) {
274 return (mode & ~(_S_IFMT)) | 0120000;
279 static mode_t from_wire_mode(int mode)
281 if ((mode & (_S_IFMT)) == 0120000 && (_S_IFLNK != 0120000)) {
282 return (mode & ~(_S_IFMT)) | _S_IFLNK;
284 return (mode_t) mode;
288 static void send_directory(int f, struct file_list *flist, char *dir);
290 static char *flist_dir;
294 * Make sure @p flist is big enough to hold at least @p flist->count
297 static void flist_expand(struct file_list *flist)
299 if (flist->count >= flist->malloced) {
303 if (flist->malloced < 1000)
304 flist->malloced += 1000;
306 flist->malloced *= 2;
308 new_bytes = sizeof(flist->files[0]) * flist->malloced;
311 new_ptr = realloc(flist->files, new_bytes);
313 new_ptr = malloc(new_bytes);
316 rprintf(FINFO, "expand file_list to %.0f bytes, did%s move\n",
318 (new_ptr == flist->files) ? " not" : "");
321 flist->files = (struct file_struct **) new_ptr;
324 out_of_memory("flist_expand");
329 static void send_file_entry(struct file_struct *file, int f,
333 static time_t last_time;
334 static mode_t last_mode;
335 static DEV64_T last_rdev;
336 static uid_t last_uid;
337 static gid_t last_gid;
338 static char lastname[MAXPATHLEN];
350 fname = f_name(file);
354 if (file->mode == last_mode)
356 if (file->rdev == last_rdev)
358 if (file->uid == last_uid)
360 if (file->gid == last_gid)
362 if (file->modtime == last_time)
366 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
368 l2 = strlen(fname) - l1;
375 /* we must make sure we don't send a zero flags byte or the other
376 end will terminate the flist transfer */
377 if (flags == 0 && !S_ISDIR(file->mode))
378 flags |= FLAG_DELETE;
382 write_byte(f, flags);
383 if (flags & SAME_NAME)
385 if (flags & LONG_NAME)
389 write_buf(f, fname + l1, l2);
391 write_longint(f, file->length);
392 if (!(flags & SAME_TIME))
393 write_int(f, (int) file->modtime);
394 if (!(flags & SAME_MODE))
395 write_int(f, to_wire_mode(file->mode));
396 if (preserve_uid && !(flags & SAME_UID)) {
398 write_int(f, (int) file->uid);
400 if (preserve_gid && !(flags & SAME_GID)) {
402 write_int(f, (int) file->gid);
404 if (preserve_devices && IS_DEVICE(file->mode)
405 && !(flags & SAME_RDEV))
406 write_int(f, (int) file->rdev);
409 if (preserve_links && S_ISLNK(file->mode)) {
410 write_int(f, strlen(file->link));
411 write_buf(f, file->link, strlen(file->link));
415 #if SUPPORT_HARD_LINKS
416 if (preserve_hard_links && S_ISREG(file->mode)) {
417 if (remote_version < 26) {
418 /* 32-bit dev_t and ino_t */
419 write_int(f, (int) file->dev);
420 write_int(f, (int) file->inode);
422 /* 64-bit dev_t and ino_t */
423 write_longint(f, file->dev);
424 write_longint(f, file->inode);
429 if (always_checksum) {
430 if (remote_version < 21) {
431 write_buf(f, file->sum, 2);
433 write_buf(f, file->sum, MD4_SUM_LENGTH);
437 last_mode = file->mode;
438 last_rdev = file->rdev;
439 last_uid = file->uid;
440 last_gid = file->gid;
441 last_time = file->modtime;
443 strlcpy(lastname, fname, MAXPATHLEN);
444 lastname[MAXPATHLEN - 1] = 0;
449 static void receive_file_entry(struct file_struct **fptr,
450 unsigned flags, int f)
452 static time_t last_time;
453 static mode_t last_mode;
454 static DEV64_T last_rdev;
455 static uid_t last_uid;
456 static gid_t last_gid;
457 static char lastname[MAXPATHLEN];
458 char thisname[MAXPATHLEN];
459 unsigned int l1 = 0, l2 = 0;
461 struct file_struct *file;
463 if (flags & SAME_NAME)
466 if (flags & LONG_NAME)
471 file = (struct file_struct *) malloc(sizeof(*file));
473 out_of_memory("receive_file_entry");
474 memset((char *) file, 0, sizeof(*file));
477 if (l2 >= MAXPATHLEN - l1) {
479 "overflow: flags=0x%x l1=%d l2=%d lastname=%s\n",
480 flags, l1, l2, lastname);
481 overflow("receive_file_entry");
484 strlcpy(thisname, lastname, l1 + 1);
485 read_sbuf(f, &thisname[l1], l2);
486 thisname[l1 + l2] = 0;
488 strlcpy(lastname, thisname, MAXPATHLEN);
489 lastname[MAXPATHLEN - 1] = 0;
491 clean_fname(thisname);
493 if (sanitize_paths) {
494 sanitize_path(thisname, NULL);
497 if ((p = strrchr(thisname, '/'))) {
498 static char *lastdir;
500 if (lastdir && strcmp(thisname, lastdir) == 0) {
501 file->dirname = lastdir;
503 file->dirname = strdup(thisname);
504 lastdir = file->dirname;
506 file->basename = strdup(p + 1);
508 file->dirname = NULL;
509 file->basename = strdup(thisname);
513 out_of_memory("receive_file_entry 1");
517 file->length = read_longint(f);
519 (flags & SAME_TIME) ? last_time : (time_t) read_int(f);
521 (flags & SAME_MODE) ? last_mode : from_wire_mode(read_int(f));
524 (flags & SAME_UID) ? last_uid : (uid_t) read_int(f);
527 (flags & SAME_GID) ? last_gid : (gid_t) read_int(f);
528 if (preserve_devices && IS_DEVICE(file->mode))
530 (flags & SAME_RDEV) ? last_rdev : (dev_t) read_int(f);
532 if (preserve_links && S_ISLNK(file->mode)) {
535 rprintf(FERROR, "overflow: l=%d\n", l);
536 overflow("receive_file_entry");
538 file->link = (char *) malloc(l + 1);
540 out_of_memory("receive_file_entry 2");
541 read_sbuf(f, file->link, l);
542 if (sanitize_paths) {
543 sanitize_path(file->link, file->dirname);
546 #if SUPPORT_HARD_LINKS
547 if (preserve_hard_links && S_ISREG(file->mode)) {
548 if (remote_version < 26) {
549 file->dev = read_int(f);
550 file->inode = read_int(f);
552 file->dev = read_longint(f);
553 file->inode = read_longint(f);
558 if (always_checksum) {
559 file->sum = (char *) malloc(MD4_SUM_LENGTH);
561 out_of_memory("md4 sum");
562 if (remote_version < 21) {
563 read_buf(f, file->sum, 2);
565 read_buf(f, file->sum, MD4_SUM_LENGTH);
569 last_mode = file->mode;
570 last_rdev = file->rdev;
571 last_uid = file->uid;
572 last_gid = file->gid;
573 last_time = file->modtime;
575 if (!preserve_perms) {
576 extern int orig_umask;
577 /* set an appropriate set of permissions based on original
578 permissions and umask. This emulates what GNU cp does */
579 file->mode &= ~orig_umask;
584 /* determine if a file in a different filesstem should be skipped
585 when one_file_system is set. We bascally only want to include
586 the mount points - but they can be hard to find! */
587 static int skip_filesystem(char *fname, STRUCT_STAT * st)
590 char *p = strrchr(fname, '/');
592 /* skip all but directories */
593 if (!S_ISDIR(st->st_mode))
596 /* if its not a subdirectory then allow */
601 if (link_stat(fname, &st2)) {
607 return (st2.st_dev != filesystem_dev);
610 #define STRDUP(ap, p) (ap ? string_area_strdup(ap, p) : strdup(p))
611 /* IRIX cc cares that the operands to the ternary have the same type. */
612 #define MALLOC(ap, i) (ap ? (void*) string_area_malloc(ap, i) : malloc(i))
615 * Create a file_struct for a named file by reading its stat()
616 * information and performing extensive checks against global
619 * @return the new file, or NULL if there was an error or this file
620 * should be excluded.
622 * @todo There is a small optimization opportunity here to avoid
623 * stat()ing the file in some circumstances, which has a certain cost.
624 * We are called immediately after doing readdir(), and so we may
625 * already know the d_type of the file. We could for example avoid
626 * statting directories if we're not recursing, but this is not a very
627 * important case. Some systems may not have d_type.
629 struct file_struct *make_file(int f, char *fname, struct string_area **ap,
632 struct file_struct *file;
634 char sum[SUM_LENGTH];
636 char cleaned_name[MAXPATHLEN];
637 char linkbuf[MAXPATHLEN];
638 extern int module_id;
640 strlcpy(cleaned_name, fname, MAXPATHLEN);
641 cleaned_name[MAXPATHLEN - 1] = 0;
642 clean_fname(cleaned_name);
643 if (sanitize_paths) {
644 sanitize_path(cleaned_name, NULL);
646 fname = cleaned_name;
648 memset(sum, 0, SUM_LENGTH);
650 if (readlink_stat(fname, &st, linkbuf) != 0) {
651 int save_errno = errno;
652 if ((errno == ENOENT) && copy_links && !noexcludes) {
653 /* symlink pointing nowhere, see if excluded */
654 memset((char *) &st, 0, sizeof(st));
655 if (check_exclude_file(f, fname, &st)) {
656 /* file is excluded anyway, ignore silently */
661 rprintf(FERROR, "readlink %s: %s\n",
662 fname, strerror(save_errno));
666 /* we use noexcludes from backup.c */
670 if (S_ISDIR(st.st_mode) && !recurse) {
671 rprintf(FINFO, "skipping directory %s\n", fname);
675 if (one_file_system && st.st_dev != filesystem_dev) {
676 if (skip_filesystem(fname, &st))
680 if (check_exclude_file(f, fname, &st))
684 if (lp_ignore_nonreadable(module_id) && access(fname, R_OK) != 0)
690 rprintf(FINFO, "make_file(%d,%s)\n", f, fname);
692 file = (struct file_struct *) malloc(sizeof(*file));
694 out_of_memory("make_file");
695 memset((char *) file, 0, sizeof(*file));
697 if ((p = strrchr(fname, '/'))) {
698 static char *lastdir;
700 if (lastdir && strcmp(fname, lastdir) == 0) {
701 file->dirname = lastdir;
703 file->dirname = strdup(fname);
704 lastdir = file->dirname;
706 file->basename = STRDUP(ap, p + 1);
709 file->dirname = NULL;
710 file->basename = STRDUP(ap, fname);
713 file->modtime = st.st_mtime;
714 file->length = st.st_size;
715 file->mode = st.st_mode;
716 file->uid = st.st_uid;
717 file->gid = st.st_gid;
718 file->dev = st.st_dev;
719 file->inode = st.st_ino;
720 #ifdef HAVE_STRUCT_STAT_ST_RDEV
721 file->rdev = st.st_rdev;
725 if (S_ISLNK(st.st_mode)) {
726 file->link = STRDUP(ap, linkbuf);
730 if (always_checksum) {
731 file->sum = (char *) MALLOC(ap, MD4_SUM_LENGTH);
733 out_of_memory("md4 sum");
734 /* drat. we have to provide a null checksum for non-regular
735 files in order to be compatible with earlier versions
737 if (S_ISREG(st.st_mode)) {
738 file_checksum(fname, file->sum, st.st_size);
740 memset(file->sum, 0, MD4_SUM_LENGTH);
745 static char *lastdir;
746 if (lastdir && strcmp(lastdir, flist_dir) == 0) {
747 file->basedir = lastdir;
749 file->basedir = strdup(flist_dir);
750 lastdir = file->basedir;
753 file->basedir = NULL;
756 if (!S_ISDIR(st.st_mode))
757 stats.total_size += st.st_size;
764 void send_file_name(int f, struct file_list *flist, char *fname,
765 int recursive, unsigned base_flags)
767 struct file_struct *file;
769 file = make_file(f, fname, &flist->string_area, 0);
774 maybe_emit_filelist_progress(flist);
778 if (write_batch) /* dw */
779 file->flags = FLAG_DELETE;
781 if (strcmp(file->basename, "")) {
782 flist->files[flist->count++] = file;
783 send_file_entry(file, f, base_flags);
786 if (S_ISDIR(file->mode) && recursive) {
787 struct exclude_struct **last_exclude_list =
789 send_directory(f, flist, f_name(file));
790 local_exclude_list = last_exclude_list;
797 static void send_directory(int f, struct file_list *flist, char *dir)
801 char fname[MAXPATHLEN];
808 rprintf(FERROR, "opendir(%s): %s\n", dir, strerror(errno));
812 strlcpy(fname, dir, MAXPATHLEN);
814 if (fname[l - 1] != '/') {
815 if (l == MAXPATHLEN - 1) {
818 "skipping long-named directory %s\n",
823 strlcat(fname, "/", MAXPATHLEN);
826 p = fname + strlen(fname);
828 local_exclude_list = NULL;
831 if (strlen(fname) + strlen(".cvsignore") <= MAXPATHLEN - 1) {
832 strcpy(p, ".cvsignore");
834 make_exclude_list(fname, NULL, 0, 0);
838 "cannot cvs-exclude in long-named directory %s\n",
843 for (di = readdir(d); di; di = readdir(d)) {
844 char *dname = d_name(di);
845 if (strcmp(dname, ".") == 0 || strcmp(dname, "..") == 0)
847 strlcpy(p, dname, MAXPATHLEN - l);
848 send_file_name(f, flist, fname, recurse, 0);
851 if (local_exclude_list) {
852 add_exclude_list("!", &local_exclude_list, 0);
861 * I *think* f==-1 means that the list should just be built in memory
862 * and not transmitted. But who can tell? -- mbp
864 struct file_list *send_file_list(int f, int argc, char *argv[])
868 char *p, *dir, *olddir;
869 char lastpath[MAXPATHLEN] = "";
870 struct file_list *flist;
873 if (show_filelist_p() && f != -1)
874 start_filelist_progress("building file list");
876 start_write = stats.total_written;
881 io_start_buffering(f);
884 for (i = 0; i < argc; i++) {
885 char *fname = topsrcname;
887 strlcpy(fname, argv[i], MAXPATHLEN);
890 if (l != 1 && fname[l - 1] == '/') {
891 if ((l == 2) && (fname[0] == '.')) {
892 /* Turn ./ into just . rather than ./.
893 This was put in to avoid a problem with
894 rsync -aR --delete from ./
895 The send_file_name() below of ./ was
896 mysteriously preventing deletes */
899 strlcat(fname, ".", MAXPATHLEN);
903 if (link_stat(fname, &st) != 0) {
906 rprintf(FERROR, "link_stat %s : %s\n",
907 fname, strerror(errno));
912 if (S_ISDIR(st.st_mode) && !recurse) {
913 rprintf(FINFO, "skipping directory %s\n", fname);
920 if (!relative_paths) {
921 p = strrchr(fname, '/');
930 } else if (f != -1 && (p = strrchr(fname, '/'))) {
931 /* this ensures we send the intermediate directories,
932 thus getting their permissions right */
934 if (strcmp(lastpath, fname)) {
935 strlcpy(lastpath, fname, sizeof(lastpath));
937 for (p = fname + 1; (p = strchr(p, '/'));
939 int copy_links_saved = copy_links;
940 int recurse_saved = recurse;
942 copy_links = copy_unsafe_links;
943 /* set recurse to 1 to prevent make_file
944 from ignoring directory, but still
945 turn off the recursive parameter to
948 send_file_name(f, flist, fname, 0,
950 copy_links = copy_links_saved;
951 recurse = recurse_saved;
963 olddir = push_dir(dir, 1);
967 rprintf(FERROR, "push_dir %s : %s\n",
968 dir, strerror(errno));
976 set_filesystem(fname);
978 send_file_name(f, flist, fname, recurse, FLAG_DELETE);
980 if (olddir != NULL) {
982 if (pop_dir(olddir) != 0) {
983 rprintf(FERROR, "pop_dir %s : %s\n",
984 dir, strerror(errno));
985 exit_cleanup(RERR_FILESELECT);
990 topsrcname[0] = '\0';
993 send_file_entry(NULL, f, 0);
996 if (show_filelist_p() && f != -1) {
997 finish_filelist_progress(flist);
1000 clean_flist(flist, 0);
1002 /* now send the uid/gid list. This was introduced in protocol
1004 if (f != -1 && remote_version >= 15) {
1008 /* if protocol version is >= 17 then send the io_error flag */
1009 if (f != -1 && remote_version >= 17) {
1010 extern int module_id;
1011 write_int(f, lp_ignore_errors(module_id) ? 0 : io_error);
1016 stats.flist_size = stats.total_written - start_write;
1017 stats.num_files = flist->count;
1018 if (write_batch) /* dw */
1019 write_batch_flist_info(flist->count, flist->files);
1023 rprintf(FINFO, "send_file_list done\n");
1029 struct file_list *recv_file_list(int f)
1031 struct file_list *flist;
1032 unsigned char flags;
1034 extern int list_only;
1036 if (show_filelist_p())
1037 start_filelist_progress("receiving file list");
1039 start_read = stats.total_read;
1041 flist = (struct file_list *) malloc(sizeof(flist[0]));
1046 flist->malloced = 1000;
1048 (struct file_struct **) malloc(sizeof(flist->files[0]) *
1054 for (flags = read_byte(f); flags; flags = read_byte(f)) {
1055 int i = flist->count;
1057 flist_expand(flist);
1059 receive_file_entry(&flist->files[i], flags, f);
1061 if (S_ISREG(flist->files[i]->mode))
1062 stats.total_size += flist->files[i]->length;
1066 maybe_emit_filelist_progress(flist);
1069 rprintf(FINFO, "recv_file_name(%s)\n",
1070 f_name(flist->files[i]));
1075 rprintf(FINFO, "received %d names\n", flist->count);
1077 clean_flist(flist, relative_paths);
1079 if (show_filelist_p()) {
1080 finish_filelist_progress(flist);
1083 /* now recv the uid/gid list. This was introduced in protocol version 15 */
1084 if (f != -1 && remote_version >= 15) {
1085 recv_uid_list(f, flist);
1088 /* if protocol version is >= 17 then recv the io_error flag */
1089 if (f != -1 && remote_version >= 17 && !read_batch) { /* dw-added readbatch */
1090 extern int module_id;
1091 extern int ignore_errors;
1092 if (lp_ignore_errors(module_id) || ignore_errors) {
1095 io_error |= read_int(f);
1101 for (i = 0; i < flist->count; i++) {
1102 list_file_entry(flist->files[i]);
1108 rprintf(FINFO, "recv_file_list done\n");
1110 stats.flist_size = stats.total_read - start_read;
1111 stats.num_files = flist->count;
1116 out_of_memory("recv_file_list");
1117 return NULL; /* not reached */
1122 * XXX: This is currently the hottest function while building the file
1123 * list, because building f_name()s every time is expensive.
1125 int file_compare(struct file_struct **f1, struct file_struct **f2)
1127 if (!(*f1)->basename && !(*f2)->basename)
1129 if (!(*f1)->basename)
1131 if (!(*f2)->basename)
1133 if ((*f1)->dirname == (*f2)->dirname)
1134 return u_strcmp((*f1)->basename, (*f2)->basename);
1135 return u_strcmp(f_name(*f1), f_name(*f2));
1139 int flist_find(struct file_list *flist, struct file_struct *f)
1141 int low = 0, high = flist->count - 1;
1143 if (flist->count <= 0)
1146 while (low != high) {
1147 int mid = (low + high) / 2;
1149 file_compare(&flist->files[flist_up(flist, mid)], &f);
1151 return flist_up(flist, mid);
1159 if (file_compare(&flist->files[flist_up(flist, low)], &f) == 0)
1160 return flist_up(flist, low);
1168 void free_file(struct file_struct *file)
1173 free(file->basename);
1183 * allocate a new file list
1185 struct file_list *flist_new()
1187 struct file_list *flist;
1189 flist = (struct file_list *) malloc(sizeof(flist[0]));
1191 out_of_memory("send_file_list");
1194 flist->malloced = 0;
1195 flist->files = NULL;
1198 flist->string_area = string_area_new(0);
1200 flist->string_area = NULL;
1206 * free up all elements in a flist
1208 void flist_free(struct file_list *flist)
1211 for (i = 1; i < flist->count; i++) {
1212 if (!flist->string_area)
1213 free_file(flist->files[i]);
1214 free(flist->files[i]);
1216 /* FIXME: I don't think we generally need to blank the flist
1217 * since it's about to be freed. This will just cause more
1218 * memory traffic. If you want a freed-memory debugger, you
1219 * know where to get it. */
1220 memset((char *) flist->files, 0,
1221 sizeof(flist->files[0]) * flist->count);
1223 if (flist->string_area)
1224 string_area_free(flist->string_area);
1225 memset((char *) flist, 0, sizeof(*flist));
1231 * This routine ensures we don't have any duplicate names in our file list.
1232 * duplicate names can cause corruption because of the pipelining
1234 static void clean_flist(struct file_list *flist, int strip_root)
1238 if (!flist || flist->count == 0)
1241 qsort(flist->files, flist->count,
1242 sizeof(flist->files[0]), (int (*)()) file_compare);
1244 for (i = 1; i < flist->count; i++) {
1245 if (flist->files[i]->basename &&
1246 flist->files[i - 1]->basename &&
1247 strcmp(f_name(flist->files[i]),
1248 f_name(flist->files[i - 1])) == 0) {
1249 if (verbose > 1 && !am_server)
1251 "removing duplicate name %s from file list %d\n",
1252 f_name(flist->files[i - 1]),
1254 /* it's not great that the flist knows the semantics of the
1255 * file memory usage, but i'd rather not add a flag byte
1256 * to that struct. XXX can i use a bit in the flags field? */
1257 if (flist->string_area)
1258 flist->files[i][0] = null_file;
1260 free_file(flist->files[i]);
1264 /* FIXME: There is a bug here when filenames are repeated more
1265 * than once, because we don't handle freed files when doing
1266 * the comparison. */
1269 /* we need to strip off the root directory in the case
1270 of relative paths, but this must be done _after_
1271 the sorting phase */
1272 for (i = 0; i < flist->count; i++) {
1273 if (flist->files[i]->dirname &&
1274 flist->files[i]->dirname[0] == '/') {
1275 memmove(&flist->files[i]->dirname[0],
1276 &flist->files[i]->dirname[1],
1277 strlen(flist->files[i]->dirname));
1280 if (flist->files[i]->dirname &&
1281 !flist->files[i]->dirname[0]) {
1282 flist->files[i]->dirname = NULL;
1291 for (i = 0; i < flist->count; i++) {
1292 rprintf(FINFO, "[%d] i=%d %s %s mode=0%o len=%.0f\n",
1294 NS(flist->files[i]->dirname),
1295 NS(flist->files[i]->basename),
1296 (int) flist->files[i]->mode,
1297 (double) flist->files[i]->length);
1303 * return the full filename of a flist entry
1305 * This function is too expensive at the moment, because it copies
1306 * strings when often we only want to compare them. In any case,
1307 * using strlcat is silly because it will walk the string repeatedly.
1309 char *f_name(struct file_struct *f)
1311 static char names[10][MAXPATHLEN];
1315 if (!f || !f->basename)
1323 off = strlcpy(p, f->dirname, MAXPATHLEN);
1324 off += strlcpy(p + off, "/", MAXPATHLEN - off);
1325 off += strlcpy(p + off, f->basename, MAXPATHLEN - off);
1327 strlcpy(p, f->basename, MAXPATHLEN);