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