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