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 * @retval -1 on error
201 * @retval 0 for success
203 * @post If @p path is a symlink, then @p linkbuf (of size @c
204 * MAXPATHLEN) contains the symlink target.
206 * @post @p buffer contains information about the link or the
207 * referrent as appropriate, if they exist.
209 int readlink_stat(const char *path, STRUCT_STAT * buffer, char *linkbuf)
213 return do_stat(path, buffer);
215 if (do_lstat(path, buffer) == -1) {
218 if (S_ISLNK(buffer->st_mode)) {
220 l = readlink((char *) path, linkbuf, MAXPATHLEN - 1);
224 if (copy_unsafe_links && (topsrcname[0] != '\0') &&
225 unsafe_symlink(linkbuf, topsrcname)) {
226 return do_stat(path, buffer);
231 return do_stat(path, buffer);
235 int link_stat(const char *path, STRUCT_STAT * buffer)
239 return do_stat(path, buffer);
241 return do_lstat(path, buffer);
244 return do_stat(path, buffer);
249 This function is used to check if a file should be included/excluded
250 from the list of files based on its name and type etc
252 static int check_exclude_file(int f, char *fname, STRUCT_STAT * st)
254 extern int delete_excluded;
256 /* f is set to -1 when calculating deletion file list */
257 if ((f == -1) && delete_excluded) {
260 if (check_exclude(fname, local_exclude_list, st)) {
266 /* used by the one_file_system code */
267 static dev_t filesystem_dev;
269 static void set_filesystem(char *fname)
272 if (link_stat(fname, &st) != 0)
274 filesystem_dev = st.st_dev;
278 static int to_wire_mode(mode_t mode)
280 if (S_ISLNK(mode) && (_S_IFLNK != 0120000)) {
281 return (mode & ~(_S_IFMT)) | 0120000;
286 static mode_t from_wire_mode(int mode)
288 if ((mode & (_S_IFMT)) == 0120000 && (_S_IFLNK != 0120000)) {
289 return (mode & ~(_S_IFMT)) | _S_IFLNK;
291 return (mode_t) mode;
295 static void send_directory(int f, struct file_list *flist, char *dir);
297 static char *flist_dir;
301 * Make sure @p flist is big enough to hold at least @p flist->count
304 static void flist_expand(struct file_list *flist)
306 if (flist->count >= flist->malloced) {
310 if (flist->malloced < 1000)
311 flist->malloced += 1000;
313 flist->malloced *= 2;
315 new_bytes = sizeof(flist->files[0]) * flist->malloced;
318 new_ptr = realloc(flist->files, new_bytes);
320 new_ptr = malloc(new_bytes);
323 rprintf(FINFO, "expand file_list to %.0f bytes, did%s move\n",
325 (new_ptr == flist->files) ? " not" : "");
328 flist->files = (struct file_struct **) new_ptr;
331 out_of_memory("flist_expand");
336 static void send_file_entry(struct file_struct *file, int f,
340 static time_t last_time;
341 static mode_t last_mode;
342 static DEV64_T last_rdev;
343 static uid_t last_uid;
344 static gid_t last_gid;
345 static char lastname[MAXPATHLEN];
357 io_write_phase = "send_file_entry";
359 fname = f_name(file);
363 if (file->mode == last_mode)
365 if (file->rdev == last_rdev)
367 if (file->uid == last_uid)
369 if (file->gid == last_gid)
371 if (file->modtime == last_time)
375 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
377 l2 = strlen(fname) - l1;
384 /* we must make sure we don't send a zero flags byte or the other
385 end will terminate the flist transfer */
386 if (flags == 0 && !S_ISDIR(file->mode))
387 flags |= FLAG_DELETE;
391 write_byte(f, flags);
392 if (flags & SAME_NAME)
394 if (flags & LONG_NAME)
398 write_buf(f, fname + l1, l2);
400 write_longint(f, file->length);
401 if (!(flags & SAME_TIME))
402 write_int(f, (int) file->modtime);
403 if (!(flags & SAME_MODE))
404 write_int(f, to_wire_mode(file->mode));
405 if (preserve_uid && !(flags & SAME_UID)) {
407 write_int(f, (int) file->uid);
409 if (preserve_gid && !(flags & SAME_GID)) {
411 write_int(f, (int) file->gid);
413 if (preserve_devices && IS_DEVICE(file->mode)
414 && !(flags & SAME_RDEV))
415 write_int(f, (int) file->rdev);
418 if (preserve_links && S_ISLNK(file->mode)) {
419 write_int(f, strlen(file->link));
420 write_buf(f, file->link, strlen(file->link));
424 #if SUPPORT_HARD_LINKS
425 if (preserve_hard_links && S_ISREG(file->mode)) {
426 if (remote_version < 26) {
427 /* 32-bit dev_t and ino_t */
428 write_int(f, (int) file->dev);
429 write_int(f, (int) file->inode);
431 /* 64-bit dev_t and ino_t */
432 write_longint(f, file->dev);
433 write_longint(f, file->inode);
438 if (always_checksum) {
439 if (remote_version < 21) {
440 write_buf(f, file->sum, 2);
442 write_buf(f, file->sum, MD4_SUM_LENGTH);
446 last_mode = file->mode;
447 last_rdev = file->rdev;
448 last_uid = file->uid;
449 last_gid = file->gid;
450 last_time = file->modtime;
452 strlcpy(lastname, fname, MAXPATHLEN);
453 lastname[MAXPATHLEN - 1] = 0;
455 io_write_phase = "unknown";
460 static void receive_file_entry(struct file_struct **fptr,
461 unsigned flags, int f)
463 static time_t last_time;
464 static mode_t last_mode;
465 static DEV64_T last_rdev;
466 static uid_t last_uid;
467 static gid_t last_gid;
468 static char lastname[MAXPATHLEN];
469 char thisname[MAXPATHLEN];
470 unsigned int l1 = 0, l2 = 0;
472 struct file_struct *file;
474 if (flags & SAME_NAME)
477 if (flags & LONG_NAME)
482 file = (struct file_struct *) malloc(sizeof(*file));
484 out_of_memory("receive_file_entry");
485 memset((char *) file, 0, sizeof(*file));
488 if (l2 >= MAXPATHLEN - l1) {
490 "overflow: flags=0x%x l1=%d l2=%d lastname=%s\n",
491 flags, l1, l2, lastname);
492 overflow("receive_file_entry");
495 strlcpy(thisname, lastname, l1 + 1);
496 read_sbuf(f, &thisname[l1], l2);
497 thisname[l1 + l2] = 0;
499 strlcpy(lastname, thisname, MAXPATHLEN);
500 lastname[MAXPATHLEN - 1] = 0;
502 clean_fname(thisname);
504 if (sanitize_paths) {
505 sanitize_path(thisname, NULL);
508 if ((p = strrchr(thisname, '/'))) {
509 static char *lastdir;
511 if (lastdir && strcmp(thisname, lastdir) == 0) {
512 file->dirname = lastdir;
514 file->dirname = strdup(thisname);
515 lastdir = file->dirname;
517 file->basename = strdup(p + 1);
519 file->dirname = NULL;
520 file->basename = strdup(thisname);
524 out_of_memory("receive_file_entry 1");
528 file->length = read_longint(f);
530 (flags & SAME_TIME) ? last_time : (time_t) read_int(f);
532 (flags & SAME_MODE) ? last_mode : from_wire_mode(read_int(f));
535 (flags & SAME_UID) ? last_uid : (uid_t) read_int(f);
538 (flags & SAME_GID) ? last_gid : (gid_t) read_int(f);
539 if (preserve_devices && IS_DEVICE(file->mode))
541 (flags & SAME_RDEV) ? last_rdev : (dev_t) read_int(f);
543 if (preserve_links && S_ISLNK(file->mode)) {
546 rprintf(FERROR, "overflow: l=%d\n", l);
547 overflow("receive_file_entry");
549 file->link = (char *) malloc(l + 1);
551 out_of_memory("receive_file_entry 2");
552 read_sbuf(f, file->link, l);
553 if (sanitize_paths) {
554 sanitize_path(file->link, file->dirname);
557 #if SUPPORT_HARD_LINKS
558 if (preserve_hard_links && S_ISREG(file->mode)) {
559 if (remote_version < 26) {
560 file->dev = read_int(f);
561 file->inode = read_int(f);
563 file->dev = read_longint(f);
564 file->inode = read_longint(f);
569 if (always_checksum) {
570 file->sum = (char *) malloc(MD4_SUM_LENGTH);
572 out_of_memory("md4 sum");
573 if (remote_version < 21) {
574 read_buf(f, file->sum, 2);
576 read_buf(f, file->sum, MD4_SUM_LENGTH);
580 last_mode = file->mode;
581 last_rdev = file->rdev;
582 last_uid = file->uid;
583 last_gid = file->gid;
584 last_time = file->modtime;
586 if (!preserve_perms) {
587 extern int orig_umask;
588 /* set an appropriate set of permissions based on original
589 permissions and umask. This emulates what GNU cp does */
590 file->mode &= ~orig_umask;
595 /* determine if a file in a different filesstem should be skipped
596 when one_file_system is set. We bascally only want to include
597 the mount points - but they can be hard to find! */
598 static int skip_filesystem(char *fname, STRUCT_STAT * st)
601 char *p = strrchr(fname, '/');
603 /* skip all but directories */
604 if (!S_ISDIR(st->st_mode))
607 /* if its not a subdirectory then allow */
612 if (link_stat(fname, &st2)) {
618 return (st2.st_dev != filesystem_dev);
621 #define STRDUP(ap, p) (ap ? string_area_strdup(ap, p) : strdup(p))
622 /* IRIX cc cares that the operands to the ternary have the same type. */
623 #define MALLOC(ap, i) (ap ? (void*) string_area_malloc(ap, i) : malloc(i))
626 * Create a file_struct for a named file by reading its stat()
627 * information and performing extensive checks against global
630 * @return the new file, or NULL if there was an error or this file
631 * should be excluded.
633 * @todo There is a small optimization opportunity here to avoid
634 * stat()ing the file in some circumstances, which has a certain cost.
635 * We are called immediately after doing readdir(), and so we may
636 * already know the d_type of the file. We could for example avoid
637 * statting directories if we're not recursing, but this is not a very
638 * important case. Some systems may not have d_type.
640 struct file_struct *make_file(int f, char *fname, struct string_area **ap,
643 struct file_struct *file;
645 char sum[SUM_LENGTH];
647 char cleaned_name[MAXPATHLEN];
648 char linkbuf[MAXPATHLEN];
649 extern int module_id;
651 strlcpy(cleaned_name, fname, MAXPATHLEN);
652 cleaned_name[MAXPATHLEN - 1] = 0;
653 clean_fname(cleaned_name);
654 if (sanitize_paths) {
655 sanitize_path(cleaned_name, NULL);
657 fname = cleaned_name;
659 memset(sum, 0, SUM_LENGTH);
661 if (readlink_stat(fname, &st, linkbuf) != 0) {
662 int save_errno = errno;
663 if ((errno == ENOENT) && copy_links && !noexcludes) {
664 /* symlink pointing nowhere, see if excluded */
665 memset((char *) &st, 0, sizeof(st));
666 if (check_exclude_file(f, fname, &st)) {
667 /* file is excluded anyway, ignore silently */
672 rprintf(FERROR, "readlink %s: %s\n",
673 fname, strerror(save_errno));
677 /* we use noexcludes from backup.c */
681 if (S_ISDIR(st.st_mode) && !recurse) {
682 rprintf(FINFO, "skipping directory %s\n", fname);
686 if (one_file_system && st.st_dev != filesystem_dev) {
687 if (skip_filesystem(fname, &st))
691 if (check_exclude_file(f, fname, &st))
695 if (lp_ignore_nonreadable(module_id) && access(fname, R_OK) != 0)
701 rprintf(FINFO, "make_file(%d,%s)\n", f, fname);
703 file = (struct file_struct *) malloc(sizeof(*file));
705 out_of_memory("make_file");
706 memset((char *) file, 0, sizeof(*file));
708 if ((p = strrchr(fname, '/'))) {
709 static char *lastdir;
711 if (lastdir && strcmp(fname, lastdir) == 0) {
712 file->dirname = lastdir;
714 file->dirname = strdup(fname);
715 lastdir = file->dirname;
717 file->basename = STRDUP(ap, p + 1);
720 file->dirname = NULL;
721 file->basename = STRDUP(ap, fname);
724 file->modtime = st.st_mtime;
725 file->length = st.st_size;
726 file->mode = st.st_mode;
727 file->uid = st.st_uid;
728 file->gid = st.st_gid;
729 file->dev = st.st_dev;
730 file->inode = st.st_ino;
731 #ifdef HAVE_STRUCT_STAT_ST_RDEV
732 file->rdev = st.st_rdev;
736 if (S_ISLNK(st.st_mode)) {
737 file->link = STRDUP(ap, linkbuf);
741 if (always_checksum) {
742 file->sum = (char *) MALLOC(ap, MD4_SUM_LENGTH);
744 out_of_memory("md4 sum");
745 /* drat. we have to provide a null checksum for non-regular
746 files in order to be compatible with earlier versions
748 if (S_ISREG(st.st_mode)) {
749 file_checksum(fname, file->sum, st.st_size);
751 memset(file->sum, 0, MD4_SUM_LENGTH);
756 static char *lastdir;
757 if (lastdir && strcmp(lastdir, flist_dir) == 0) {
758 file->basedir = lastdir;
760 file->basedir = strdup(flist_dir);
761 lastdir = file->basedir;
764 file->basedir = NULL;
767 if (!S_ISDIR(st.st_mode))
768 stats.total_size += st.st_size;
775 void send_file_name(int f, struct file_list *flist, char *fname,
776 int recursive, unsigned base_flags)
778 struct file_struct *file;
780 file = make_file(f, fname, &flist->string_area, 0);
785 maybe_emit_filelist_progress(flist);
789 if (write_batch) /* dw */
790 file->flags = FLAG_DELETE;
792 if (strcmp(file->basename, "")) {
793 flist->files[flist->count++] = file;
794 send_file_entry(file, f, base_flags);
797 if (S_ISDIR(file->mode) && recursive) {
798 struct exclude_struct **last_exclude_list =
800 send_directory(f, flist, f_name(file));
801 local_exclude_list = last_exclude_list;
808 static void send_directory(int f, struct file_list *flist, char *dir)
812 char fname[MAXPATHLEN];
819 rprintf(FERROR, "opendir(%s): %s\n", dir, strerror(errno));
823 strlcpy(fname, dir, MAXPATHLEN);
825 if (fname[l - 1] != '/') {
826 if (l == MAXPATHLEN - 1) {
829 "skipping long-named directory %s\n",
834 strlcat(fname, "/", MAXPATHLEN);
837 p = fname + strlen(fname);
839 local_exclude_list = NULL;
842 if (strlen(fname) + strlen(".cvsignore") <= MAXPATHLEN - 1) {
843 strcpy(p, ".cvsignore");
845 make_exclude_list(fname, NULL, 0, 0);
849 "cannot cvs-exclude in long-named directory %s\n",
854 for (di = readdir(d); di; di = readdir(d)) {
855 char *dname = d_name(di);
856 if (strcmp(dname, ".") == 0 || strcmp(dname, "..") == 0)
858 strlcpy(p, dname, MAXPATHLEN - l);
859 send_file_name(f, flist, fname, recurse, 0);
862 if (local_exclude_list) {
863 add_exclude_list("!", &local_exclude_list, 0);
872 * I *think* f==-1 means that the list should just be built in memory
873 * and not transmitted. But who can tell? -- mbp
875 struct file_list *send_file_list(int f, int argc, char *argv[])
879 char *p, *dir, *olddir;
880 char lastpath[MAXPATHLEN] = "";
881 struct file_list *flist;
884 if (show_filelist_p() && f != -1)
885 start_filelist_progress("building file list");
887 start_write = stats.total_written;
892 io_start_buffering(f);
895 for (i = 0; i < argc; i++) {
896 char *fname = topsrcname;
898 strlcpy(fname, argv[i], MAXPATHLEN);
901 if (l != 1 && fname[l - 1] == '/') {
902 if ((l == 2) && (fname[0] == '.')) {
903 /* Turn ./ into just . rather than ./.
904 This was put in to avoid a problem with
905 rsync -aR --delete from ./
906 The send_file_name() below of ./ was
907 mysteriously preventing deletes */
910 strlcat(fname, ".", MAXPATHLEN);
914 if (link_stat(fname, &st) != 0) {
917 rprintf(FERROR, "link_stat %s : %s\n",
918 fname, strerror(errno));
923 if (S_ISDIR(st.st_mode) && !recurse) {
924 rprintf(FINFO, "skipping directory %s\n", fname);
931 if (!relative_paths) {
932 p = strrchr(fname, '/');
941 } else if (f != -1 && (p = strrchr(fname, '/'))) {
942 /* this ensures we send the intermediate directories,
943 thus getting their permissions right */
945 if (strcmp(lastpath, fname)) {
946 strlcpy(lastpath, fname, sizeof(lastpath));
948 for (p = fname + 1; (p = strchr(p, '/'));
950 int copy_links_saved = copy_links;
951 int recurse_saved = recurse;
953 copy_links = copy_unsafe_links;
954 /* set recurse to 1 to prevent make_file
955 from ignoring directory, but still
956 turn off the recursive parameter to
959 send_file_name(f, flist, fname, 0,
961 copy_links = copy_links_saved;
962 recurse = recurse_saved;
974 olddir = push_dir(dir, 1);
978 rprintf(FERROR, "push_dir %s : %s\n",
979 dir, strerror(errno));
987 set_filesystem(fname);
989 send_file_name(f, flist, fname, recurse, FLAG_DELETE);
991 if (olddir != NULL) {
993 if (pop_dir(olddir) != 0) {
994 rprintf(FERROR, "pop_dir %s : %s\n",
995 dir, strerror(errno));
996 exit_cleanup(RERR_FILESELECT);
1001 topsrcname[0] = '\0';
1004 send_file_entry(NULL, f, 0);
1007 if (show_filelist_p() && f != -1) {
1008 finish_filelist_progress(flist);
1011 clean_flist(flist, 0);
1013 /* now send the uid/gid list. This was introduced in protocol
1015 if (f != -1 && remote_version >= 15) {
1019 /* if protocol version is >= 17 then send the io_error flag */
1020 if (f != -1 && remote_version >= 17) {
1021 extern int module_id;
1022 write_int(f, lp_ignore_errors(module_id) ? 0 : io_error);
1027 stats.flist_size = stats.total_written - start_write;
1028 stats.num_files = flist->count;
1029 if (write_batch) /* dw */
1030 write_batch_flist_info(flist->count, flist->files);
1034 rprintf(FINFO, "send_file_list done\n");
1040 struct file_list *recv_file_list(int f)
1042 struct file_list *flist;
1043 unsigned char flags;
1045 extern int list_only;
1047 if (show_filelist_p())
1048 start_filelist_progress("receiving file list");
1050 start_read = stats.total_read;
1052 flist = (struct file_list *) malloc(sizeof(flist[0]));
1057 flist->malloced = 1000;
1059 (struct file_struct **) malloc(sizeof(flist->files[0]) *
1065 for (flags = read_byte(f); flags; flags = read_byte(f)) {
1066 int i = flist->count;
1068 flist_expand(flist);
1070 receive_file_entry(&flist->files[i], flags, f);
1072 if (S_ISREG(flist->files[i]->mode))
1073 stats.total_size += flist->files[i]->length;
1077 maybe_emit_filelist_progress(flist);
1080 rprintf(FINFO, "recv_file_name(%s)\n",
1081 f_name(flist->files[i]));
1086 rprintf(FINFO, "received %d names\n", flist->count);
1088 clean_flist(flist, relative_paths);
1090 if (show_filelist_p()) {
1091 finish_filelist_progress(flist);
1094 /* now recv the uid/gid list. This was introduced in protocol version 15 */
1095 if (f != -1 && remote_version >= 15) {
1096 recv_uid_list(f, flist);
1099 /* if protocol version is >= 17 then recv the io_error flag */
1100 if (f != -1 && remote_version >= 17 && !read_batch) { /* dw-added readbatch */
1101 extern int module_id;
1102 extern int ignore_errors;
1103 if (lp_ignore_errors(module_id) || ignore_errors) {
1106 io_error |= read_int(f);
1112 for (i = 0; i < flist->count; i++) {
1113 list_file_entry(flist->files[i]);
1119 rprintf(FINFO, "recv_file_list done\n");
1121 stats.flist_size = stats.total_read - start_read;
1122 stats.num_files = flist->count;
1127 out_of_memory("recv_file_list");
1128 return NULL; /* not reached */
1133 * XXX: This is currently the hottest function while building the file
1134 * list, because building f_name()s every time is expensive.
1136 int file_compare(struct file_struct **f1, struct file_struct **f2)
1138 if (!(*f1)->basename && !(*f2)->basename)
1140 if (!(*f1)->basename)
1142 if (!(*f2)->basename)
1144 if ((*f1)->dirname == (*f2)->dirname)
1145 return u_strcmp((*f1)->basename, (*f2)->basename);
1146 return u_strcmp(f_name(*f1), f_name(*f2));
1150 int flist_find(struct file_list *flist, struct file_struct *f)
1152 int low = 0, high = flist->count - 1;
1154 if (flist->count <= 0)
1157 while (low != high) {
1158 int mid = (low + high) / 2;
1160 file_compare(&flist->files[flist_up(flist, mid)], &f);
1162 return flist_up(flist, mid);
1170 if (file_compare(&flist->files[flist_up(flist, low)], &f) == 0)
1171 return flist_up(flist, low);
1179 void free_file(struct file_struct *file)
1184 free(file->basename);
1194 * allocate a new file list
1196 struct file_list *flist_new()
1198 struct file_list *flist;
1200 flist = (struct file_list *) malloc(sizeof(flist[0]));
1202 out_of_memory("send_file_list");
1205 flist->malloced = 0;
1206 flist->files = NULL;
1209 flist->string_area = string_area_new(0);
1211 flist->string_area = NULL;
1217 * free up all elements in a flist
1219 void flist_free(struct file_list *flist)
1222 for (i = 1; i < flist->count; i++) {
1223 if (!flist->string_area)
1224 free_file(flist->files[i]);
1225 free(flist->files[i]);
1227 /* FIXME: I don't think we generally need to blank the flist
1228 * since it's about to be freed. This will just cause more
1229 * memory traffic. If you want a freed-memory debugger, you
1230 * know where to get it. */
1231 memset((char *) flist->files, 0,
1232 sizeof(flist->files[0]) * flist->count);
1234 if (flist->string_area)
1235 string_area_free(flist->string_area);
1236 memset((char *) flist, 0, sizeof(*flist));
1242 * This routine ensures we don't have any duplicate names in our file list.
1243 * duplicate names can cause corruption because of the pipelining
1245 static void clean_flist(struct file_list *flist, int strip_root)
1249 if (!flist || flist->count == 0)
1252 qsort(flist->files, flist->count,
1253 sizeof(flist->files[0]), (int (*)()) file_compare);
1255 for (i = 1; i < flist->count; i++) {
1256 if (flist->files[i]->basename &&
1257 flist->files[i - 1]->basename &&
1258 strcmp(f_name(flist->files[i]),
1259 f_name(flist->files[i - 1])) == 0) {
1260 if (verbose > 1 && !am_server)
1262 "removing duplicate name %s from file list %d\n",
1263 f_name(flist->files[i - 1]),
1265 /* it's not great that the flist knows the semantics of the
1266 * file memory usage, but i'd rather not add a flag byte
1267 * to that struct. XXX can i use a bit in the flags field? */
1268 if (flist->string_area)
1269 flist->files[i][0] = null_file;
1271 free_file(flist->files[i]);
1275 /* FIXME: There is a bug here when filenames are repeated more
1276 * than once, because we don't handle freed files when doing
1277 * the comparison. */
1280 /* we need to strip off the root directory in the case
1281 of relative paths, but this must be done _after_
1282 the sorting phase */
1283 for (i = 0; i < flist->count; i++) {
1284 if (flist->files[i]->dirname &&
1285 flist->files[i]->dirname[0] == '/') {
1286 memmove(&flist->files[i]->dirname[0],
1287 &flist->files[i]->dirname[1],
1288 strlen(flist->files[i]->dirname));
1291 if (flist->files[i]->dirname &&
1292 !flist->files[i]->dirname[0]) {
1293 flist->files[i]->dirname = NULL;
1302 for (i = 0; i < flist->count; i++) {
1303 rprintf(FINFO, "[%d] i=%d %s %s mode=0%o len=%.0f\n",
1305 NS(flist->files[i]->dirname),
1306 NS(flist->files[i]->basename),
1307 (int) flist->files[i]->mode,
1308 (double) flist->files[i]->length);
1314 * return the full filename of a flist entry
1316 * This function is too expensive at the moment, because it copies
1317 * strings when often we only want to compare them. In any case,
1318 * using strlcat is silly because it will walk the string repeatedly.
1320 char *f_name(struct file_struct *f)
1322 static char names[10][MAXPATHLEN];
1326 if (!f || !f->basename)
1334 off = strlcpy(p, f->dirname, MAXPATHLEN);
1335 off += strlcpy(p + off, "/", MAXPATHLEN - off);
1336 off += strlcpy(p + off, f->basename, MAXPATHLEN - off);
1338 strlcpy(p, f->basename, MAXPATHLEN);