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