Improved the setting of cleanup_got_literal so that we know if the
[rsync/rsync.git] / flist.c
... / ...
CommitLineData
1/*
2 Copyright (C) Andrew Tridgell 1996
3 Copyright (C) Paul Mackerras 1996
4 Copyright (C) 2001, 2002 by Martin Pool <mbp@samba.org>
5
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.
10
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.
15
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.
19*/
20
21/** @file flist.c
22 * Generate and receive file lists
23 *
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.
27 *
28 * @sa http://lists.samba.org/pipermail/rsync/2000-June/002351.html
29 *
30 **/
31
32#include "rsync.h"
33
34extern struct stats stats;
35
36extern int verbose;
37extern int do_progress;
38extern int am_server;
39extern int always_checksum;
40
41extern int cvs_exclude;
42
43extern int recurse;
44extern char *files_from;
45extern int filesfrom_fd;
46
47extern int one_file_system;
48extern int make_backups;
49extern int preserve_links;
50extern int preserve_hard_links;
51extern int preserve_perms;
52extern int preserve_devices;
53extern int preserve_uid;
54extern int preserve_gid;
55extern int preserve_times;
56extern int relative_paths;
57extern int implied_dirs;
58extern int copy_links;
59extern int copy_unsafe_links;
60extern int protocol_version;
61extern int sanitize_paths;
62
63extern int read_batch;
64extern int write_batch;
65
66extern struct exclude_struct **exclude_list;
67extern struct exclude_struct **server_exclude_list;
68extern struct exclude_struct **local_exclude_list;
69
70int io_error;
71
72static struct file_struct null_file;
73
74static void clean_flist(struct file_list *flist, int strip_root, int no_dups);
75
76
77static int show_filelist_p(void)
78{
79 return verbose && (recurse || files_from) && !am_server;
80}
81
82static void start_filelist_progress(char *kind)
83{
84 rprintf(FINFO, "%s ... ", kind);
85 if ((verbose > 1) || do_progress)
86 rprintf(FINFO, "\n");
87 rflush(FINFO);
88}
89
90
91static void emit_filelist_progress(const struct file_list *flist)
92{
93 rprintf(FINFO, " %d files...\r", flist->count);
94}
95
96
97static void maybe_emit_filelist_progress(const struct file_list *flist)
98{
99 if (do_progress && show_filelist_p() && ((flist->count % 100) == 0))
100 emit_filelist_progress(flist);
101}
102
103
104static void finish_filelist_progress(const struct file_list *flist)
105{
106 if (do_progress) {
107 /* This overwrites the progress line */
108 rprintf(FINFO, "%d file%sto consider\n",
109 flist->count, flist->count == 1 ? " " : "s ");
110 } else {
111 rprintf(FINFO, "done\n");
112 }
113}
114
115void show_flist_stats(void)
116{
117 /* Nothing yet */
118}
119
120
121static struct string_area *string_area_new(int size)
122{
123 struct string_area *a;
124
125 if (size <= 0)
126 size = ARENA_SIZE;
127 a = new(struct string_area);
128 if (!a)
129 out_of_memory("string_area_new");
130 a->current = a->base = new_array(char, size);
131 if (!a->current)
132 out_of_memory("string_area_new buffer");
133 a->end = a->base + size;
134 a->next = NULL;
135
136 return a;
137}
138
139static void string_area_free(struct string_area *a)
140{
141 struct string_area *next;
142
143 for (; a; a = next) {
144 next = a->next;
145 free(a->base);
146 }
147}
148
149static char *string_area_malloc(struct string_area **ap, int size)
150{
151 char *p;
152 struct string_area *a;
153
154 /* does the request fit into the current space? */
155 a = *ap;
156 if (a->current + size >= a->end) {
157 /* no; get space, move new string_area to front of the list */
158 a = string_area_new(size > ARENA_SIZE ? size : ARENA_SIZE);
159 a->next = *ap;
160 *ap = a;
161 }
162
163 /* have space; do the "allocation." */
164 p = a->current;
165 a->current += size;
166 return p;
167}
168
169static char *string_area_strdup(struct string_area **ap, const char *src)
170{
171 char *dest = string_area_malloc(ap, strlen(src) + 1);
172 return strcpy(dest, src);
173}
174
175static void list_file_entry(struct file_struct *f)
176{
177 char perms[11];
178
179 if (!f->basename)
180 /* this can happen if duplicate names were removed */
181 return;
182
183 permstring(perms, f->mode);
184
185 if (preserve_links && S_ISLNK(f->mode)) {
186 rprintf(FINFO, "%s %11.0f %s %s -> %s\n",
187 perms,
188 (double) f->length, timestring(f->modtime),
189 f_name(f), f->link);
190 } else {
191 rprintf(FINFO, "%s %11.0f %s %s\n",
192 perms,
193 (double) f->length, timestring(f->modtime),
194 f_name(f));
195 }
196}
197
198
199/**
200 * Stat either a symlink or its referent, depending on the settings of
201 * copy_links, copy_unsafe_links, etc.
202 *
203 * @retval -1 on error
204 *
205 * @retval 0 for success
206 *
207 * @post If @p path is a symlink, then @p linkbuf (of size @c
208 * MAXPATHLEN) contains the symlink target.
209 *
210 * @post @p buffer contains information about the link or the
211 * referrent as appropriate, if they exist.
212 **/
213int readlink_stat(const char *path, STRUCT_STAT * buffer, char *linkbuf)
214{
215#if SUPPORT_LINKS
216 if (copy_links) {
217 return do_stat(path, buffer);
218 }
219 if (do_lstat(path, buffer) == -1) {
220 return -1;
221 }
222 if (S_ISLNK(buffer->st_mode)) {
223 int l;
224 l = readlink((char *) path, linkbuf, MAXPATHLEN - 1);
225 if (l == -1)
226 return -1;
227 linkbuf[l] = 0;
228 if (copy_unsafe_links && unsafe_symlink(linkbuf, path)) {
229 if (verbose > 1) {
230 rprintf(FINFO,"copying unsafe symlink \"%s\" -> \"%s\"\n",
231 path, linkbuf);
232 }
233 return do_stat(path, buffer);
234 }
235 }
236 return 0;
237#else
238 return do_stat(path, buffer);
239#endif
240}
241
242int link_stat(const char *path, STRUCT_STAT * buffer)
243{
244#if SUPPORT_LINKS
245 if (copy_links) {
246 return do_stat(path, buffer);
247 } else {
248 return do_lstat(path, buffer);
249 }
250#else
251 return do_stat(path, buffer);
252#endif
253}
254
255/*
256 * This function is used to check if a file should be included/excluded
257 * from the list of files based on its name and type etc. The value of
258 * exclude_level is set to either SERVER_EXCLUDES or ALL_EXCLUDES.
259 */
260static int check_exclude_file(char *fname, int is_dir, int exclude_level)
261{
262#if 0 /* This currently never happens, so avoid a useless compare. */
263 if (exclude_level == NO_EXCLUDES)
264 return 0;
265#endif
266 if (fname) {
267 /* never exclude '.', even if somebody does --exclude '*' */
268 if (fname[0] == '.' && !fname[1])
269 return 0;
270 /* Handle the -R version of the '.' dir. */
271 if (fname[0] == '/') {
272 int len = strlen(fname);
273 if (fname[len-1] == '.' && fname[len-2] == '/')
274 return 0;
275 }
276 }
277 if (server_exclude_list
278 && check_exclude(server_exclude_list, fname, is_dir))
279 return 1;
280 if (exclude_level != ALL_EXCLUDES)
281 return 0;
282 if (exclude_list && check_exclude(exclude_list, fname, is_dir))
283 return 1;
284 if (local_exclude_list
285 && check_exclude(local_exclude_list, fname, is_dir))
286 return 1;
287 return 0;
288}
289
290/* used by the one_file_system code */
291static dev_t filesystem_dev;
292
293static void set_filesystem(char *fname)
294{
295 STRUCT_STAT st;
296 if (link_stat(fname, &st) != 0)
297 return;
298 filesystem_dev = st.st_dev;
299}
300
301
302static int to_wire_mode(mode_t mode)
303{
304 if (S_ISLNK(mode) && (_S_IFLNK != 0120000)) {
305 return (mode & ~(_S_IFMT)) | 0120000;
306 }
307 return (int) mode;
308}
309
310static mode_t from_wire_mode(int mode)
311{
312 if ((mode & (_S_IFMT)) == 0120000 && (_S_IFLNK != 0120000)) {
313 return (mode & ~(_S_IFMT)) | _S_IFLNK;
314 }
315 return (mode_t) mode;
316}
317
318
319static void send_directory(int f, struct file_list *flist, char *dir);
320
321static char *flist_dir;
322
323
324/**
325 * Make sure @p flist is big enough to hold at least @p flist->count
326 * entries.
327 **/
328static void flist_expand(struct file_list *flist)
329{
330 if (flist->count >= flist->malloced) {
331 void *new_ptr;
332
333 if (flist->malloced < 1000)
334 flist->malloced += 1000;
335 else
336 flist->malloced *= 2;
337
338 if (flist->files) {
339 new_ptr = realloc_array(flist->files,
340 struct file_struct *,
341 flist->malloced);
342 } else {
343 new_ptr = new_array(struct file_struct *,
344 flist->malloced);
345 }
346
347 if (verbose >= 2) {
348 rprintf(FINFO, "expand file_list to %.0f bytes, did%s move\n",
349 (double)sizeof(flist->files[0])
350 * flist->malloced,
351 (new_ptr == flist->files) ? " not" : "");
352 }
353
354 flist->files = (struct file_struct **) new_ptr;
355
356 if (!flist->files)
357 out_of_memory("flist_expand");
358 }
359}
360
361
362static void send_file_entry(struct file_struct *file, int f,
363 unsigned base_flags)
364{
365 unsigned char flags;
366 static time_t last_time;
367 static mode_t last_mode;
368 static DEV64_T last_rdev;
369 static uid_t last_uid;
370 static gid_t last_gid;
371 static char lastname[MAXPATHLEN];
372 char *fname, buf[MAXPATHLEN];
373 int l1, l2;
374
375 if (f == -1)
376 return;
377
378 if (!file) {
379 write_byte(f, 0);
380 return;
381 }
382
383 io_write_phase = "send_file_entry";
384
385 fname = f_name_to(file, buf, sizeof buf);
386
387 flags = base_flags;
388
389 if (file->mode == last_mode)
390 flags |= SAME_MODE;
391 if (file->rdev == last_rdev)
392 flags |= SAME_RDEV;
393 if (file->uid == last_uid)
394 flags |= SAME_UID;
395 if (file->gid == last_gid)
396 flags |= SAME_GID;
397 if (file->modtime == last_time)
398 flags |= SAME_TIME;
399
400 for (l1 = 0;
401 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
402 l1++) {}
403 l2 = strlen(fname) - l1;
404
405 if (l1 > 0)
406 flags |= SAME_NAME;
407 if (l2 > 255)
408 flags |= LONG_NAME;
409
410 /* we must make sure we don't send a zero flags byte or the other
411 end will terminate the flist transfer */
412 if (flags == 0 && !S_ISDIR(file->mode))
413 flags |= FLAG_DELETE;
414 if (flags == 0)
415 flags |= LONG_NAME;
416
417 write_byte(f, flags);
418 if (flags & SAME_NAME)
419 write_byte(f, l1);
420 if (flags & LONG_NAME)
421 write_int(f, l2);
422 else
423 write_byte(f, l2);
424 write_buf(f, fname + l1, l2);
425
426 write_longint(f, file->length);
427 if (!(flags & SAME_TIME))
428 write_int(f, (int) file->modtime);
429 if (!(flags & SAME_MODE))
430 write_int(f, to_wire_mode(file->mode));
431 if (preserve_uid && !(flags & SAME_UID)) {
432 add_uid(file->uid);
433 write_int(f, (int) file->uid);
434 }
435 if (preserve_gid && !(flags & SAME_GID)) {
436 add_gid(file->gid);
437 write_int(f, (int) file->gid);
438 }
439 if (preserve_devices && IS_DEVICE(file->mode)
440 && !(flags & SAME_RDEV))
441 write_int(f, (int) file->rdev);
442
443#if SUPPORT_LINKS
444 if (preserve_links && S_ISLNK(file->mode)) {
445 write_int(f, strlen(file->link));
446 write_buf(f, file->link, strlen(file->link));
447 }
448#endif
449
450#if SUPPORT_HARD_LINKS
451 if (preserve_hard_links && S_ISREG(file->mode)) {
452 if (protocol_version < 26) {
453 /* 32-bit dev_t and ino_t */
454 write_int(f, (int) file->dev);
455 write_int(f, (int) file->inode);
456 } else {
457 /* 64-bit dev_t and ino_t */
458 write_longint(f, file->dev);
459 write_longint(f, file->inode);
460 }
461 }
462#endif
463
464 if (always_checksum) {
465 if (protocol_version < 21) {
466 write_buf(f, file->sum, 2);
467 } else {
468 write_buf(f, file->sum, MD4_SUM_LENGTH);
469 }
470 }
471
472 last_mode = file->mode;
473 last_rdev = file->rdev;
474 last_uid = file->uid;
475 last_gid = file->gid;
476 last_time = file->modtime;
477
478 strlcpy(lastname, fname, MAXPATHLEN);
479 lastname[MAXPATHLEN - 1] = 0;
480
481 io_write_phase = "unknown";
482}
483
484
485
486static void receive_file_entry(struct file_struct **fptr,
487 unsigned flags, int f)
488{
489 static time_t last_time;
490 static mode_t last_mode;
491 static DEV64_T last_rdev;
492 static uid_t last_uid;
493 static gid_t last_gid;
494 static char lastname[MAXPATHLEN];
495 char thisname[MAXPATHLEN];
496 unsigned int l1 = 0, l2 = 0;
497 char *p;
498 struct file_struct *file;
499
500 if (flags & SAME_NAME)
501 l1 = read_byte(f);
502
503 if (flags & LONG_NAME)
504 l2 = read_int(f);
505 else
506 l2 = read_byte(f);
507
508 file = new(struct file_struct);
509 if (!file)
510 out_of_memory("receive_file_entry");
511 memset((char *) file, 0, sizeof(*file));
512 (*fptr) = file;
513
514 if (l2 >= MAXPATHLEN - l1) {
515 rprintf(FERROR,
516 "overflow: flags=0x%x l1=%d l2=%d lastname=%s\n",
517 flags, l1, l2, lastname);
518 overflow("receive_file_entry");
519 }
520
521 strlcpy(thisname, lastname, l1 + 1);
522 read_sbuf(f, &thisname[l1], l2);
523 thisname[l1 + l2] = 0;
524
525 strlcpy(lastname, thisname, MAXPATHLEN);
526 lastname[MAXPATHLEN - 1] = 0;
527
528 clean_fname(thisname);
529
530 if (sanitize_paths) {
531 sanitize_path(thisname, NULL);
532 }
533
534 if ((p = strrchr(thisname, '/'))) {
535 static char *lastdir;
536 *p = 0;
537 if (lastdir && strcmp(thisname, lastdir) == 0) {
538 file->dirname = lastdir;
539 } else {
540 file->dirname = strdup(thisname);
541 lastdir = file->dirname;
542 }
543 file->basename = strdup(p + 1);
544 } else {
545 file->dirname = NULL;
546 file->basename = strdup(thisname);
547 }
548
549 if (!file->basename)
550 out_of_memory("receive_file_entry 1");
551
552
553 file->flags = flags;
554 file->length = read_longint(f);
555 file->modtime =
556 (flags & SAME_TIME) ? last_time : (time_t) read_int(f);
557 file->mode =
558 (flags & SAME_MODE) ? last_mode : from_wire_mode(read_int(f));
559 if (preserve_uid)
560 file->uid =
561 (flags & SAME_UID) ? last_uid : (uid_t) read_int(f);
562 if (preserve_gid)
563 file->gid =
564 (flags & SAME_GID) ? last_gid : (gid_t) read_int(f);
565 if (preserve_devices && IS_DEVICE(file->mode))
566 file->rdev =
567 (flags & SAME_RDEV) ? last_rdev : (DEV64_T) read_int(f);
568
569 if (preserve_links && S_ISLNK(file->mode)) {
570 int l = read_int(f);
571 if (l < 0) {
572 rprintf(FERROR, "overflow: l=%d\n", l);
573 overflow("receive_file_entry");
574 }
575 file->link = new_array(char, l + 1);
576 if (!file->link)
577 out_of_memory("receive_file_entry 2");
578 read_sbuf(f, file->link, l);
579 if (sanitize_paths) {
580 sanitize_path(file->link, file->dirname);
581 }
582 }
583#if SUPPORT_HARD_LINKS
584 if (preserve_hard_links && S_ISREG(file->mode)) {
585 if (protocol_version < 26) {
586 file->dev = read_int(f);
587 file->inode = read_int(f);
588 } else {
589 file->dev = read_longint(f);
590 file->inode = read_longint(f);
591 }
592 }
593#endif
594
595 if (always_checksum) {
596 file->sum = new_array(char, MD4_SUM_LENGTH);
597 if (!file->sum)
598 out_of_memory("md4 sum");
599 if (protocol_version < 21) {
600 read_buf(f, file->sum, 2);
601 } else {
602 read_buf(f, file->sum, MD4_SUM_LENGTH);
603 }
604 }
605
606 last_mode = file->mode;
607 last_rdev = file->rdev;
608 last_uid = file->uid;
609 last_gid = file->gid;
610 last_time = file->modtime;
611
612 if (!preserve_perms) {
613 extern int orig_umask;
614 /* set an appropriate set of permissions based on original
615 permissions and umask. This emulates what GNU cp does */
616 file->mode &= ~orig_umask;
617 }
618}
619
620
621/* determine if a file in a different filesstem should be skipped
622 when one_file_system is set. We bascally only want to include
623 the mount points - but they can be hard to find! */
624static int skip_filesystem(char *fname, STRUCT_STAT * st)
625{
626 STRUCT_STAT st2;
627 char *p = strrchr(fname, '/');
628
629 /* skip all but directories */
630 if (!S_ISDIR(st->st_mode))
631 return 1;
632
633 /* if its not a subdirectory then allow */
634 if (!p)
635 return 0;
636
637 *p = 0;
638 if (link_stat(fname, &st2)) {
639 *p = '/';
640 return 0;
641 }
642 *p = '/';
643
644 return (st2.st_dev != filesystem_dev);
645}
646
647#define STRDUP(ap, p) (ap ? string_area_strdup(ap, p) : strdup(p))
648/* IRIX cc cares that the operands to the ternary have the same type. */
649#define MALLOC(ap, i) (ap ? (void*) string_area_malloc(ap, i) : malloc(i))
650
651/**
652 * Create a file_struct for a named file by reading its stat()
653 * information and performing extensive checks against global
654 * options.
655 *
656 * @return the new file, or NULL if there was an error or this file
657 * should be excluded.
658 *
659 * @todo There is a small optimization opportunity here to avoid
660 * stat()ing the file in some circumstances, which has a certain cost.
661 * We are called immediately after doing readdir(), and so we may
662 * already know the d_type of the file. We could for example avoid
663 * statting directories if we're not recursing, but this is not a very
664 * important case. Some systems may not have d_type.
665 **/
666struct file_struct *make_file(char *fname, struct string_area **ap,
667 int exclude_level)
668{
669 struct file_struct *file;
670 STRUCT_STAT st;
671 char sum[SUM_LENGTH];
672 char *p;
673 char cleaned_name[MAXPATHLEN];
674 char linkbuf[MAXPATHLEN];
675 extern int module_id;
676
677 strlcpy(cleaned_name, fname, MAXPATHLEN);
678 cleaned_name[MAXPATHLEN - 1] = 0;
679 clean_fname(cleaned_name);
680 if (sanitize_paths) {
681 sanitize_path(cleaned_name, NULL);
682 }
683 fname = cleaned_name;
684
685 memset(sum, 0, SUM_LENGTH);
686
687 if (readlink_stat(fname, &st, linkbuf) != 0) {
688 int save_errno = errno;
689 if (errno == ENOENT && exclude_level != NO_EXCLUDES) {
690 /* either symlink pointing nowhere or file that
691 * was removed during rsync run; see if excluded
692 * before reporting an error */
693 if (check_exclude_file(fname, 0, exclude_level)) {
694 /* file is excluded anyway, ignore silently */
695 return NULL;
696 }
697 }
698 io_error |= IOERR_GENERAL;
699 rprintf(FERROR, "readlink %s failed: %s\n",
700 full_fname(fname), strerror(save_errno));
701 return NULL;
702 }
703
704 /* backup.c calls us with exclude_level set to NO_EXCLUDES. */
705 if (exclude_level == NO_EXCLUDES)
706 goto skip_excludes;
707
708 if (S_ISDIR(st.st_mode) && !recurse && !files_from) {
709 rprintf(FINFO, "skipping directory %s\n", fname);
710 return NULL;
711 }
712
713 if (one_file_system && st.st_dev != filesystem_dev) {
714 if (skip_filesystem(fname, &st))
715 return NULL;
716 }
717
718 if (check_exclude_file(fname, S_ISDIR(st.st_mode) != 0, exclude_level))
719 return NULL;
720
721 if (lp_ignore_nonreadable(module_id) && access(fname, R_OK) != 0)
722 return NULL;
723
724 skip_excludes:
725
726 if (verbose > 2)
727 rprintf(FINFO, "make_file(%s,*,%d)\n", fname, exclude_level);
728
729 file = new(struct file_struct);
730 if (!file)
731 out_of_memory("make_file");
732 memset((char *) file, 0, sizeof(*file));
733
734 if ((p = strrchr(fname, '/'))) {
735 static char *lastdir;
736 *p = 0;
737 if (lastdir && strcmp(fname, lastdir) == 0) {
738 file->dirname = lastdir;
739 } else {
740 file->dirname = strdup(fname);
741 lastdir = file->dirname;
742 }
743 file->basename = STRDUP(ap, p + 1);
744 *p = '/';
745 } else {
746 file->dirname = NULL;
747 file->basename = STRDUP(ap, fname);
748 }
749
750 file->modtime = st.st_mtime;
751 file->length = st.st_size;
752 file->mode = st.st_mode;
753 file->uid = st.st_uid;
754 file->gid = st.st_gid;
755 file->dev = st.st_dev;
756 file->inode = st.st_ino;
757#ifdef HAVE_STRUCT_STAT_ST_RDEV
758 file->rdev = st.st_rdev;
759#endif
760
761#if SUPPORT_LINKS
762 if (S_ISLNK(st.st_mode)) {
763 file->link = STRDUP(ap, linkbuf);
764 }
765#endif
766
767 if (always_checksum) {
768 file->sum = (char *) MALLOC(ap, MD4_SUM_LENGTH);
769 if (!file->sum)
770 out_of_memory("md4 sum");
771 /* drat. we have to provide a null checksum for non-regular
772 files in order to be compatible with earlier versions
773 of rsync */
774 if (S_ISREG(st.st_mode)) {
775 file_checksum(fname, file->sum, st.st_size);
776 } else {
777 memset(file->sum, 0, MD4_SUM_LENGTH);
778 }
779 }
780
781 if (flist_dir) {
782 static char *lastdir;
783 if (lastdir && strcmp(lastdir, flist_dir) == 0) {
784 file->basedir = lastdir;
785 } else {
786 file->basedir = strdup(flist_dir);
787 lastdir = file->basedir;
788 }
789 } else {
790 file->basedir = NULL;
791 }
792
793 if (!S_ISDIR(st.st_mode))
794 stats.total_size += st.st_size;
795
796 return file;
797}
798
799
800void send_file_name(int f, struct file_list *flist, char *fname,
801 int recursive, unsigned base_flags)
802{
803 struct file_struct *file;
804 char buf[MAXPATHLEN];
805 extern int delete_excluded;
806
807 /* f is set to -1 when calculating deletion file list */
808 file = make_file(fname, &flist->string_area,
809 f == -1 && delete_excluded? SERVER_EXCLUDES
810 : ALL_EXCLUDES);
811
812 if (!file)
813 return;
814
815 maybe_emit_filelist_progress(flist);
816
817 flist_expand(flist);
818
819 if (write_batch)
820 file->flags = FLAG_DELETE;
821
822 if (file->basename[0]) {
823 flist->files[flist->count++] = file;
824 send_file_entry(file, f, base_flags);
825 }
826
827 if (S_ISDIR(file->mode) && recursive) {
828 struct exclude_struct **last_exclude_list =
829 local_exclude_list;
830 send_directory(f, flist, f_name_to(file, buf, sizeof buf));
831 local_exclude_list = last_exclude_list;
832 return;
833 }
834}
835
836
837static void send_directory(int f, struct file_list *flist, char *dir)
838{
839 DIR *d;
840 struct dirent *di;
841 char fname[MAXPATHLEN];
842 int l;
843 char *p;
844
845 d = opendir(dir);
846 if (!d) {
847 io_error |= IOERR_GENERAL;
848 rprintf(FERROR, "opendir %s failed: %s\n",
849 full_fname(dir), strerror(errno));
850 return;
851 }
852
853 strlcpy(fname, dir, MAXPATHLEN);
854 l = strlen(fname);
855 if (fname[l - 1] != '/') {
856 if (l == MAXPATHLEN - 1) {
857 io_error |= IOERR_GENERAL;
858 rprintf(FERROR, "skipping long-named directory: %s\n",
859 full_fname(fname));
860 closedir(d);
861 return;
862 }
863 strlcat(fname, "/", MAXPATHLEN);
864 l++;
865 }
866 p = fname + strlen(fname);
867
868 local_exclude_list = NULL;
869
870 if (cvs_exclude) {
871 if (strlen(fname) + strlen(".cvsignore") <= MAXPATHLEN - 1) {
872 strcpy(p, ".cvsignore");
873 add_exclude_file(&exclude_list,fname,MISSING_OK,ADD_EXCLUDE);
874 } else {
875 io_error |= IOERR_GENERAL;
876 rprintf(FINFO,
877 "cannot cvs-exclude in long-named directory %s\n",
878 full_fname(fname));
879 }
880 }
881
882 for (errno = 0, di = readdir(d); di; errno = 0, di = readdir(d)) {
883 char *dname = d_name(di);
884 if (dname[0] == '.' && (dname[1] == '\0'
885 || (dname[1] == '.' && dname[2] == '\0')))
886 continue;
887 strlcpy(p, dname, MAXPATHLEN - l);
888 send_file_name(f, flist, fname, recurse, 0);
889 }
890 if (errno) {
891 io_error |= IOERR_GENERAL;
892 rprintf(FERROR, "readdir(%s): (%d) %s\n",
893 dir, errno, strerror(errno));
894 }
895
896 if (local_exclude_list)
897 free_exclude_list(&local_exclude_list); /* Zeros pointer too */
898
899 closedir(d);
900}
901
902
903/**
904 * The delete_files() function in receiver.c sets f to -1 so that we just
905 * construct the file list in memory without sending it over the wire. It
906 * also has the side-effect of ignoring user-excludes if delete_excluded
907 * is set (so that the delete list includes user-excluded files).
908 **/
909struct file_list *send_file_list(int f, int argc, char *argv[])
910{
911 int l;
912 STRUCT_STAT st;
913 char *p, *dir, *olddir;
914 char lastpath[MAXPATHLEN] = "";
915 struct file_list *flist;
916 int64 start_write;
917 int use_ff_fd = 0;
918
919 if (show_filelist_p() && f != -1)
920 start_filelist_progress("building file list");
921
922 start_write = stats.total_written;
923
924 flist = flist_new();
925
926 if (f != -1) {
927 io_start_buffering_out(f);
928 if (filesfrom_fd >= 0) {
929 if (argv[0] && !push_dir(argv[0], 0)) {
930 rprintf(FERROR, "push_dir %s failed: %s\n",
931 full_fname(argv[0]), strerror(errno));
932 exit_cleanup(RERR_FILESELECT);
933 }
934 use_ff_fd = 1;
935 }
936 }
937
938 while (1) {
939 char fname2[MAXPATHLEN];
940 char *fname = fname2;
941
942 if (use_ff_fd) {
943 if (read_filesfrom_line(filesfrom_fd, fname) == 0)
944 break;
945 sanitize_path(fname, NULL);
946 } else {
947 if (argc-- == 0)
948 break;
949 strlcpy(fname, *argv++, MAXPATHLEN);
950 if (sanitize_paths)
951 sanitize_path(fname, NULL);
952 }
953
954 l = strlen(fname);
955 if (fname[l - 1] == '/') {
956 if (l == 2 && fname[0] == '.') {
957 /* Turn "./" into just "." rather than "./." */
958 fname[1] = '\0';
959 } else {
960 strlcat(fname, ".", MAXPATHLEN);
961 }
962 }
963
964 if (link_stat(fname, &st) != 0) {
965 if (f != -1) {
966 io_error |= IOERR_GENERAL;
967 rprintf(FERROR, "link_stat %s failed: %s\n",
968 full_fname(fname), strerror(errno));
969 }
970 continue;
971 }
972
973 if (S_ISDIR(st.st_mode) && !recurse && !files_from) {
974 rprintf(FINFO, "skipping directory %s\n", fname);
975 continue;
976 }
977
978 dir = NULL;
979 olddir = NULL;
980
981 if (!relative_paths) {
982 p = strrchr(fname, '/');
983 if (p) {
984 *p = 0;
985 if (p == fname)
986 dir = "/";
987 else
988 dir = fname;
989 fname = p + 1;
990 }
991 } else if (f != -1 && implied_dirs && (p=strrchr(fname,'/')) && p != fname) {
992 /* this ensures we send the intermediate directories,
993 thus getting their permissions right */
994 char *lp = lastpath, *fn = fname, *slash = fname;
995 *p = 0;
996 /* Skip any initial directories in our path that we
997 * have in common with lastpath. */
998 while (*fn && *lp == *fn) {
999 if (*fn == '/')
1000 slash = fn;
1001 lp++, fn++;
1002 }
1003 *p = '/';
1004 if (fn != p || (*lp && *lp != '/')) {
1005 int copy_links_saved = copy_links;
1006 int recurse_saved = recurse;
1007 copy_links = copy_unsafe_links;
1008 /* set recurse to 1 to prevent make_file
1009 * from ignoring directory, but still
1010 * turn off the recursive parameter to
1011 * send_file_name */
1012 recurse = 1;
1013 while ((slash = strchr(slash+1, '/')) != 0) {
1014 *slash = 0;
1015 send_file_name(f, flist, fname, 0, 0);
1016 *slash = '/';
1017 }
1018 copy_links = copy_links_saved;
1019 recurse = recurse_saved;
1020 *p = 0;
1021 strlcpy(lastpath, fname, sizeof lastpath);
1022 *p = '/';
1023 }
1024 }
1025
1026 if (!*fname)
1027 fname = ".";
1028
1029 if (dir && *dir) {
1030 olddir = push_dir(dir, 1);
1031
1032 if (!olddir) {
1033 io_error |= IOERR_GENERAL;
1034 rprintf(FERROR, "push_dir %s failed: %s\n",
1035 full_fname(dir), strerror(errno));
1036 continue;
1037 }
1038
1039 flist_dir = dir;
1040 }
1041
1042 if (one_file_system)
1043 set_filesystem(fname);
1044
1045 send_file_name(f, flist, fname, recurse, FLAG_DELETE);
1046
1047 if (olddir != NULL) {
1048 flist_dir = NULL;
1049 if (pop_dir(olddir) != 0) {
1050 rprintf(FERROR, "pop_dir %s failed: %s\n",
1051 full_fname(dir), strerror(errno));
1052 exit_cleanup(RERR_FILESELECT);
1053 }
1054 }
1055 }
1056
1057 if (f != -1) {
1058 send_file_entry(NULL, f, 0);
1059 }
1060
1061 if (show_filelist_p() && f != -1) {
1062 finish_filelist_progress(flist);
1063 }
1064
1065 clean_flist(flist, 0, 0);
1066
1067 /* now send the uid/gid list. This was introduced in protocol
1068 version 15 */
1069 if (f != -1) {
1070 send_uid_list(f);
1071 }
1072
1073 /* send the io_error flag */
1074 if (f != -1) {
1075 extern int module_id;
1076 write_int(f, lp_ignore_errors(module_id) ? 0 : io_error);
1077 }
1078
1079 if (f != -1) {
1080 io_end_buffering();
1081 stats.flist_size = stats.total_written - start_write;
1082 stats.num_files = flist->count;
1083 if (write_batch)
1084 write_batch_flist_info(flist->count, flist->files);
1085 }
1086
1087 if (verbose > 2)
1088 rprintf(FINFO, "send_file_list done\n");
1089
1090 return flist;
1091}
1092
1093
1094struct file_list *recv_file_list(int f)
1095{
1096 struct file_list *flist;
1097 unsigned char flags;
1098 int64 start_read;
1099 extern int list_only;
1100
1101 if (show_filelist_p())
1102 start_filelist_progress("receiving file list");
1103
1104 start_read = stats.total_read;
1105
1106 flist = new(struct file_list);
1107 if (!flist)
1108 goto oom;
1109
1110 flist->count = 0;
1111 flist->malloced = 1000;
1112 flist->files = new_array(struct file_struct *, flist->malloced);
1113 if (!flist->files)
1114 goto oom;
1115
1116
1117 for (flags = read_byte(f); flags; flags = read_byte(f)) {
1118 int i = flist->count;
1119
1120 flist_expand(flist);
1121
1122 receive_file_entry(&flist->files[i], flags, f);
1123
1124 if (S_ISREG(flist->files[i]->mode))
1125 stats.total_size += flist->files[i]->length;
1126
1127 flist->count++;
1128
1129 maybe_emit_filelist_progress(flist);
1130
1131 if (verbose > 2) {
1132 rprintf(FINFO, "recv_file_name(%s)\n",
1133 f_name(flist->files[i]));
1134 }
1135 }
1136
1137
1138 if (verbose > 2)
1139 rprintf(FINFO, "received %d names\n", flist->count);
1140
1141 clean_flist(flist, relative_paths, 1);
1142
1143 if (show_filelist_p()) {
1144 finish_filelist_progress(flist);
1145 }
1146
1147 /* now recv the uid/gid list. This was introduced in protocol version 15 */
1148 if (f != -1) {
1149 recv_uid_list(f, flist);
1150 }
1151
1152 /* recv the io_error flag */
1153 if (f != -1 && !read_batch) { /* dw-added readbatch */
1154 extern int module_id;
1155 extern int ignore_errors;
1156 if (lp_ignore_errors(module_id) || ignore_errors) {
1157 read_int(f);
1158 } else {
1159 io_error |= read_int(f);
1160 }
1161 }
1162
1163 if (list_only) {
1164 int i;
1165 for (i = 0; i < flist->count; i++) {
1166 list_file_entry(flist->files[i]);
1167 }
1168 }
1169
1170
1171 if (verbose > 2)
1172 rprintf(FINFO, "recv_file_list done\n");
1173
1174 stats.flist_size = stats.total_read - start_read;
1175 stats.num_files = flist->count;
1176
1177 return flist;
1178
1179 oom:
1180 out_of_memory("recv_file_list");
1181 return NULL; /* not reached */
1182}
1183
1184
1185int file_compare(struct file_struct **f1, struct file_struct **f2)
1186{
1187 if (!(*f1)->basename && !(*f2)->basename)
1188 return 0;
1189 if (!(*f1)->basename)
1190 return -1;
1191 if (!(*f2)->basename)
1192 return 1;
1193 if ((*f1)->dirname == (*f2)->dirname)
1194 return u_strcmp((*f1)->basename, (*f2)->basename);
1195 return f_name_cmp(*f1, *f2);
1196}
1197
1198
1199int flist_find(struct file_list *flist, struct file_struct *f)
1200{
1201 int low = 0, high = flist->count - 1;
1202
1203 while (high >= 0 && !flist->files[high]->basename) high--;
1204
1205 if (high < 0)
1206 return -1;
1207
1208 while (low != high) {
1209 int mid = (low + high) / 2;
1210 int ret =
1211 file_compare(&flist->files[flist_up(flist, mid)], &f);
1212 if (ret == 0)
1213 return flist_up(flist, mid);
1214 if (ret > 0) {
1215 high = mid;
1216 } else {
1217 low = mid + 1;
1218 }
1219 }
1220
1221 if (file_compare(&flist->files[flist_up(flist, low)], &f) == 0)
1222 return flist_up(flist, low);
1223 return -1;
1224}
1225
1226
1227/*
1228 * free up one file
1229 */
1230void free_file(struct file_struct *file)
1231{
1232 if (!file)
1233 return;
1234 if (file->basename)
1235 free(file->basename);
1236 if (file->link)
1237 free(file->link);
1238 if (file->sum)
1239 free(file->sum);
1240 *file = null_file;
1241}
1242
1243
1244/*
1245 * allocate a new file list
1246 */
1247struct file_list *flist_new(void)
1248{
1249 struct file_list *flist;
1250
1251 flist = new(struct file_list);
1252 if (!flist)
1253 out_of_memory("send_file_list");
1254
1255 flist->count = 0;
1256 flist->malloced = 0;
1257 flist->files = NULL;
1258
1259#if ARENA_SIZE > 0
1260 flist->string_area = string_area_new(0);
1261#else
1262 flist->string_area = NULL;
1263#endif
1264 return flist;
1265}
1266
1267/*
1268 * free up all elements in a flist
1269 */
1270void flist_free(struct file_list *flist)
1271{
1272 int i;
1273 for (i = 1; i < flist->count; i++) {
1274 if (!flist->string_area)
1275 free_file(flist->files[i]);
1276 free(flist->files[i]);
1277 }
1278 /* FIXME: I don't think we generally need to blank the flist
1279 * since it's about to be freed. This will just cause more
1280 * memory traffic. If you want a freed-memory debugger, you
1281 * know where to get it. */
1282 memset((char *) flist->files, 0,
1283 sizeof(flist->files[0]) * flist->count);
1284 free(flist->files);
1285 if (flist->string_area)
1286 string_area_free(flist->string_area);
1287 memset((char *) flist, 0, sizeof(*flist));
1288 free(flist);
1289}
1290
1291
1292/*
1293 * This routine ensures we don't have any duplicate names in our file list.
1294 * duplicate names can cause corruption because of the pipelining
1295 */
1296static void clean_flist(struct file_list *flist, int strip_root, int no_dups)
1297{
1298 int i, prev_i = 0;
1299
1300 if (!flist || flist->count == 0)
1301 return;
1302
1303 qsort(flist->files, flist->count,
1304 sizeof(flist->files[0]), (int (*)()) file_compare);
1305
1306 for (i = no_dups? 0 : flist->count; i < flist->count; i++) {
1307 if (flist->files[i]->basename) {
1308 prev_i = i;
1309 break;
1310 }
1311 }
1312 while (++i < flist->count) {
1313 if (!flist->files[i]->basename)
1314 continue;
1315 if (f_name_cmp(flist->files[i], flist->files[prev_i]) == 0) {
1316 if (verbose > 1 && !am_server) {
1317 rprintf(FINFO,
1318 "removing duplicate name %s from file list %d\n",
1319 f_name(flist->files[i]), i);
1320 }
1321 /* Make sure that if we unduplicate '.', that we don't
1322 * lose track of a user-specified starting point (or
1323 * else deletions will mysteriously fail with -R). */
1324 if (flist->files[i]->flags & FLAG_DELETE)
1325 flist->files[prev_i]->flags |= FLAG_DELETE;
1326 /* it's not great that the flist knows the semantics of
1327 * the file memory usage, but i'd rather not add a flag
1328 * byte to that struct.
1329 * XXX can i use a bit in the flags field? */
1330 if (flist->string_area)
1331 flist->files[i][0] = null_file;
1332 else
1333 free_file(flist->files[i]);
1334 }
1335 else
1336 prev_i = i;
1337 }
1338
1339 if (strip_root) {
1340 /* we need to strip off the root directory in the case
1341 of relative paths, but this must be done _after_
1342 the sorting phase */
1343 for (i = 0; i < flist->count; i++) {
1344 if (flist->files[i]->dirname &&
1345 flist->files[i]->dirname[0] == '/') {
1346 memmove(&flist->files[i]->dirname[0],
1347 &flist->files[i]->dirname[1],
1348 strlen(flist->files[i]->dirname));
1349 }
1350
1351 if (flist->files[i]->dirname &&
1352 !flist->files[i]->dirname[0]) {
1353 flist->files[i]->dirname = NULL;
1354 }
1355 }
1356 }
1357
1358 if (verbose <= 3)
1359 return;
1360
1361 for (i = 0; i < flist->count; i++) {
1362 rprintf(FINFO, "[%d] i=%d %s %s mode=0%o len=%.0f\n",
1363 (int) getpid(), i,
1364 NS(flist->files[i]->dirname),
1365 NS(flist->files[i]->basename),
1366 (int) flist->files[i]->mode,
1367 (double) flist->files[i]->length);
1368 }
1369}
1370
1371
1372enum fnc_state { fnc_DIR, fnc_SLASH, fnc_BASE };
1373
1374/* Compare the names of two file_struct entities, just like strcmp()
1375 * would do if it were operating on the joined strings. We assume
1376 * that there are no 0-length strings.
1377 */
1378int f_name_cmp(struct file_struct *f1, struct file_struct *f2)
1379{
1380 int dif;
1381 const uchar *c1, *c2;
1382 enum fnc_state state1 = fnc_DIR, state2 = fnc_DIR;
1383
1384 if (!f1 || !f1->basename) {
1385 if (!f2 || !f2->basename)
1386 return 0;
1387 return -1;
1388 }
1389 if (!f2 || !f2->basename)
1390 return 1;
1391
1392 if (!(c1 = f1->dirname)) {
1393 state1 = fnc_BASE;
1394 c1 = f1->basename;
1395 }
1396 if (!(c2 = f2->dirname)) {
1397 state2 = fnc_BASE;
1398 c2 = f2->basename;
1399 }
1400
1401 while (1) {
1402 if ((dif = (int)*c1 - (int)*c2) != 0)
1403 break;
1404 if (!*++c1) {
1405 switch (state1) {
1406 case fnc_DIR:
1407 state1 = fnc_SLASH;
1408 c1 = "/";
1409 break;
1410 case fnc_SLASH:
1411 state1 = fnc_BASE;
1412 c1 = f1->basename;
1413 break;
1414 case fnc_BASE:
1415 break;
1416 }
1417 }
1418 if (!*++c2) {
1419 switch (state2) {
1420 case fnc_DIR:
1421 state2 = fnc_SLASH;
1422 c2 = "/";
1423 break;
1424 case fnc_SLASH:
1425 state2 = fnc_BASE;
1426 c2 = f2->basename;
1427 break;
1428 case fnc_BASE:
1429 if (!*c1)
1430 return 0;
1431 break;
1432 }
1433 }
1434 }
1435
1436 return dif;
1437}
1438
1439
1440/* Return a copy of the full filename of a flist entry, using the indicated
1441 * buffer.
1442 */
1443char *f_name_to(struct file_struct *f, char *buf, int bsize)
1444{
1445 if (!f || !f->basename)
1446 return NULL;
1447
1448 if (f->dirname) {
1449 int off = strlcpy(buf, f->dirname, bsize);
1450 off += strlcpy(buf + off, "/", bsize - off);
1451 strlcpy(buf + off, f->basename, bsize - off);
1452 } else
1453 strlcpy(buf, f->basename, bsize);
1454 return buf;
1455}
1456
1457
1458/* Like f_name_to(), but we rotate through 5 static buffers of our own.
1459 */
1460char *f_name(struct file_struct *f)
1461{
1462 static char names[5][MAXPATHLEN];
1463 static unsigned int n;
1464
1465 n = (n + 1) % (sizeof names / sizeof names[0]);
1466
1467 return f_name_to(f, names[n], sizeof names[0]);
1468}