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