In option descriptions, the short form of --copy-dirlinks is -k, not -K.
[rsync/rsync.git] / flist.c
... / ...
CommitLineData
1/*
2 * Generate and receive file lists.
3 *
4 * Copyright (C) 1996 Andrew Tridgell
5 * Copyright (C) 1996 Paul Mackerras
6 * Copyright (C) 2001, 2002 Martin Pool <mbp@samba.org>
7 * Copyright (C) 2002-2007 Wayne Davison
8 *
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License version 2 as
11 * published by the Free Software Foundation.
12 *
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
17 *
18 * You should have received a copy of the GNU General Public License along
19 * with this program; if not, write to the Free Software Foundation, Inc.,
20 * 51 Franklin Street - Fifth Floor, Boston, MA 02110-1301, USA.
21 */
22
23#include "rsync.h"
24#include "rounding.h"
25#include "io.h"
26
27extern int verbose;
28extern int list_only;
29extern int am_root;
30extern int am_server;
31extern int am_daemon;
32extern int am_sender;
33extern int inc_recurse;
34extern int do_progress;
35extern int always_checksum;
36extern int module_id;
37extern int ignore_errors;
38extern int numeric_ids;
39extern int recurse;
40extern int xfer_dirs;
41extern int filesfrom_fd;
42extern int one_file_system;
43extern int copy_dirlinks;
44extern int keep_dirlinks;
45extern int preserve_acls;
46extern int preserve_links;
47extern int preserve_hard_links;
48extern int preserve_devices;
49extern int preserve_specials;
50extern int preserve_uid;
51extern int preserve_gid;
52extern int relative_paths;
53extern int implied_dirs;
54extern int file_extra_cnt;
55extern int ignore_perishable;
56extern int non_perishable_cnt;
57extern int prune_empty_dirs;
58extern int copy_links;
59extern int copy_unsafe_links;
60extern int protocol_version;
61extern int sanitize_paths;
62extern struct stats stats;
63
64extern char curr_dir[MAXPATHLEN];
65
66extern struct chmod_mode_struct *chmod_modes;
67
68extern struct filter_list_struct filter_list;
69extern struct filter_list_struct server_filter_list;
70
71int io_error;
72int checksum_len;
73dev_t filesystem_dev; /* used to implement -x */
74
75struct file_list *cur_flist, *first_flist, *dir_flist;
76int send_dir_ndx = -1, send_dir_depth = 0;
77int flist_cnt = 0; /* how many (non-tmp) file list objects exist */
78int file_total = 0; /* total of all active items over all file-lists */
79int flist_eof = 0; /* all the file-lists are now known */
80
81/* The tmp_* vars are used as a cache area by make_file() to store data
82 * that the sender doesn't need to remember in its file list. The data
83 * will survive just long enough to be used by send_file_entry(). */
84static dev_t tmp_rdev;
85#ifdef SUPPORT_HARD_LINKS
86static int64 tmp_dev, tmp_ino;
87#endif
88static char tmp_sum[MD4_SUM_LENGTH];
89
90static char empty_sum[MD4_SUM_LENGTH];
91static int flist_count_offset; /* for --delete --progress */
92
93static void clean_flist(struct file_list *flist, int strip_root, int no_dups);
94static void output_flist(struct file_list *flist);
95
96void init_flist(void)
97{
98 if (verbose > 4) {
99 rprintf(FINFO, "FILE_STRUCT_LEN=%d, EXTRA_LEN=%d\n",
100 (int)FILE_STRUCT_LEN, (int)EXTRA_LEN);
101 }
102 checksum_len = protocol_version < 21 ? 2 : MD4_SUM_LENGTH;
103}
104
105static int show_filelist_p(void)
106{
107 return verbose && xfer_dirs && !am_server && !inc_recurse;
108}
109
110static void start_filelist_progress(char *kind)
111{
112 rprintf(FCLIENT, "%s ... ", kind);
113 if (verbose > 1 || do_progress)
114 rprintf(FCLIENT, "\n");
115 rflush(FINFO);
116}
117
118static void emit_filelist_progress(int count)
119{
120 rprintf(FCLIENT, " %d files...\r", count);
121}
122
123static void maybe_emit_filelist_progress(int count)
124{
125 if (do_progress && show_filelist_p() && (count % 100) == 0)
126 emit_filelist_progress(count);
127}
128
129static void finish_filelist_progress(const struct file_list *flist)
130{
131 if (do_progress) {
132 /* This overwrites the progress line */
133 rprintf(FINFO, "%d file%sto consider\n",
134 flist->count, flist->count == 1 ? " " : "s ");
135 } else
136 rprintf(FINFO, "done\n");
137}
138
139void show_flist_stats(void)
140{
141 /* Nothing yet */
142}
143
144static void list_file_entry(struct file_struct *f)
145{
146 char permbuf[PERMSTRING_SIZE];
147 double len;
148
149 if (!F_IS_ACTIVE(f)) {
150 /* this can happen if duplicate names were removed */
151 return;
152 }
153
154 permstring(permbuf, f->mode);
155 len = F_LENGTH(f);
156
157 /* TODO: indicate '+' if the entry has an ACL. */
158
159#ifdef SUPPORT_LINKS
160 if (preserve_links && S_ISLNK(f->mode)) {
161 rprintf(FINFO, "%s %11.0f %s %s -> %s\n",
162 permbuf, len, timestring(f->modtime),
163 f_name(f, NULL), F_SYMLINK(f));
164 } else
165#endif
166 {
167 rprintf(FINFO, "%s %11.0f %s %s\n",
168 permbuf, len, timestring(f->modtime),
169 f_name(f, NULL));
170 }
171}
172
173/* Stat either a symlink or its referent, depending on the settings of
174 * copy_links, copy_unsafe_links, etc. Returns -1 on error, 0 on success.
175 *
176 * If path is the name of a symlink, then the linkbuf buffer (which must hold
177 * MAXPATHLEN chars) will be set to the symlink's target string.
178 *
179 * The stat structure pointed to by stp will contain information about the
180 * link or the referent as appropriate, if they exist. */
181static int readlink_stat(const char *path, STRUCT_STAT *stp, char *linkbuf)
182{
183#ifdef SUPPORT_LINKS
184 if (link_stat(path, stp, copy_dirlinks) < 0)
185 return -1;
186 if (S_ISLNK(stp->st_mode)) {
187 int llen = readlink(path, linkbuf, MAXPATHLEN - 1);
188 if (llen < 0)
189 return -1;
190 linkbuf[llen] = '\0';
191 if (copy_unsafe_links && unsafe_symlink(linkbuf, path)) {
192 if (verbose > 1) {
193 rprintf(FINFO,"copying unsafe symlink \"%s\" -> \"%s\"\n",
194 path, linkbuf);
195 }
196 return do_stat(path, stp);
197 }
198 }
199 return 0;
200#else
201 return do_stat(path, stp);
202#endif
203}
204
205int link_stat(const char *path, STRUCT_STAT *stp, int follow_dirlinks)
206{
207#ifdef SUPPORT_LINKS
208 if (copy_links)
209 return do_stat(path, stp);
210 if (do_lstat(path, stp) < 0)
211 return -1;
212 if (follow_dirlinks && S_ISLNK(stp->st_mode)) {
213 STRUCT_STAT st;
214 if (do_stat(path, &st) == 0 && S_ISDIR(st.st_mode))
215 *stp = st;
216 }
217 return 0;
218#else
219 return do_stat(path, stp);
220#endif
221}
222
223/* This function is used to check if a file should be included/excluded
224 * from the list of files based on its name and type etc. The value of
225 * filter_level is set to either SERVER_FILTERS or ALL_FILTERS. */
226static int is_excluded(char *fname, int is_dir, int filter_level)
227{
228#if 0 /* This currently never happens, so avoid a useless compare. */
229 if (filter_level == NO_FILTERS)
230 return 0;
231#endif
232 if (fname) {
233 /* never exclude '.', even if somebody does --exclude '*' */
234 if (fname[0] == '.' && !fname[1])
235 return 0;
236 /* Handle the -R version of the '.' dir. */
237 if (fname[0] == '/') {
238 int len = strlen(fname);
239 if (fname[len-1] == '.' && fname[len-2] == '/')
240 return 0;
241 }
242 }
243 if (server_filter_list.head
244 && check_filter(&server_filter_list, fname, is_dir) < 0)
245 return 1;
246 if (filter_level != ALL_FILTERS)
247 return 0;
248 if (filter_list.head
249 && check_filter(&filter_list, fname, is_dir) < 0)
250 return 1;
251 return 0;
252}
253
254static int to_wire_mode(mode_t mode)
255{
256#ifdef SUPPORT_LINKS
257#if _S_IFLNK != 0120000
258 if (S_ISLNK(mode))
259 return (mode & ~(_S_IFMT)) | 0120000;
260#endif
261#endif
262 return mode;
263}
264
265static mode_t from_wire_mode(int mode)
266{
267#if _S_IFLNK != 0120000
268 if ((mode & (_S_IFMT)) == 0120000)
269 return (mode & ~(_S_IFMT)) | _S_IFLNK;
270#endif
271 return mode;
272}
273
274static void send_directory(int f, struct file_list *flist, int ndx,
275 char *fbuf, int len, int flags);
276
277static const char *flist_dir, *orig_dir;
278static int flist_dir_len;
279
280
281/**
282 * Make sure @p flist is big enough to hold at least @p flist->count
283 * entries.
284 **/
285void flist_expand(struct file_list *flist)
286{
287 struct file_struct **new_ptr;
288
289 if (flist->count < flist->malloced)
290 return;
291
292 if (flist->malloced < FLIST_START)
293 flist->malloced = FLIST_START;
294 else if (flist->malloced >= FLIST_LINEAR)
295 flist->malloced += FLIST_LINEAR;
296 else
297 flist->malloced *= 2;
298
299 /*
300 * In case count jumped or we are starting the list
301 * with a known size just set it.
302 */
303 if (flist->malloced < flist->count)
304 flist->malloced = flist->count;
305
306 new_ptr = realloc_array(flist->files, struct file_struct *,
307 flist->malloced);
308
309 if (verbose >= 2 && flist->malloced != FLIST_START) {
310 rprintf(FCLIENT, "[%s] expand file_list to %.0f bytes, did%s move\n",
311 who_am_i(),
312 (double)sizeof flist->files[0] * flist->malloced,
313 (new_ptr == flist->files) ? " not" : "");
314 }
315
316 flist->files = new_ptr;
317
318 if (!flist->files)
319 out_of_memory("flist_expand");
320}
321
322int push_flist_dir(const char *dir, int len)
323{
324 if (dir == flist_dir)
325 return 1;
326
327 if (!orig_dir)
328 orig_dir = strdup(curr_dir);
329
330 if (flist_dir && !pop_dir(orig_dir)) {
331 rsyserr(FERROR, errno, "pop_dir %s failed",
332 full_fname(orig_dir));
333 exit_cleanup(RERR_FILESELECT);
334 }
335
336 if (dir && !push_dir(dir, 0)) {
337 io_error |= IOERR_GENERAL;
338 rsyserr(FERROR, errno, "push_dir %s failed",
339 full_fname(dir));
340 return 0;
341 }
342
343 flist_dir = dir;
344 flist_dir_len = len >= 0 ? len : dir ? (int)strlen(dir) : 0;
345
346 return 1;
347}
348
349static void send_file_entry(int f, struct file_struct *file, int ndx)
350{
351 static time_t modtime;
352 static mode_t mode;
353 static int64 dev;
354 static dev_t rdev;
355 static uint32 rdev_major;
356 static uid_t uid;
357 static gid_t gid;
358 static char *user_name, *group_name;
359 static char lastname[MAXPATHLEN];
360 char fname[MAXPATHLEN];
361 int first_hlink_ndx = -1;
362 int l1, l2;
363 int flags;
364
365 f_name(file, fname);
366
367 flags = file->flags & FLAG_TOP_DIR; /* FLAG_TOP_DIR == XMIT_TOP_DIR */
368
369 if (file->mode == mode)
370 flags |= XMIT_SAME_MODE;
371 else
372 mode = file->mode;
373 if ((preserve_devices && IS_DEVICE(mode))
374 || (preserve_specials && IS_SPECIAL(mode))) {
375 if (protocol_version < 28) {
376 if (tmp_rdev == rdev)
377 flags |= XMIT_SAME_RDEV_pre28;
378 else
379 rdev = tmp_rdev;
380 } else {
381 rdev = tmp_rdev;
382 if ((uint32)major(rdev) == rdev_major)
383 flags |= XMIT_SAME_RDEV_MAJOR;
384 else
385 rdev_major = major(rdev);
386 if (protocol_version < 30 && (uint32)minor(rdev) <= 0xFFu)
387 flags |= XMIT_RDEV_MINOR_8_pre30;
388 }
389 } else if (protocol_version < 28)
390 rdev = MAKEDEV(0, 0);
391 if (preserve_uid) {
392 if (F_UID(file) == uid && *lastname)
393 flags |= XMIT_SAME_UID;
394 else {
395 uid = F_UID(file);
396 if (preserve_uid && !numeric_ids) {
397 user_name = add_uid(uid);
398 if (inc_recurse && user_name)
399 flags |= XMIT_USER_NAME_FOLLOWS;
400 }
401 }
402 }
403 if (preserve_gid) {
404 if (F_GID(file) == gid && *lastname)
405 flags |= XMIT_SAME_GID;
406 else {
407 gid = F_GID(file);
408 if (preserve_gid && !numeric_ids) {
409 group_name = add_gid(gid);
410 if (inc_recurse && group_name)
411 flags |= XMIT_GROUP_NAME_FOLLOWS;
412 }
413 }
414 }
415 if (file->modtime == modtime)
416 flags |= XMIT_SAME_TIME;
417 else
418 modtime = file->modtime;
419
420#ifdef SUPPORT_HARD_LINKS
421 if (tmp_dev != 0) {
422 if (protocol_version >= 30) {
423 struct idev_node *np = idev_node(tmp_dev, tmp_ino);
424 first_hlink_ndx = (int32)(long)np->data - 1;
425 if (first_hlink_ndx < 0) {
426 np->data = (void*)(long)(ndx + 1);
427 flags |= XMIT_HLINK_FIRST;
428 }
429 flags |= XMIT_HLINKED;
430 } else {
431 if (tmp_dev == dev) {
432 if (protocol_version >= 28)
433 flags |= XMIT_SAME_DEV_pre30;
434 } else
435 dev = tmp_dev;
436 flags |= XMIT_HLINKED;
437 }
438 }
439#endif
440
441 for (l1 = 0;
442 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
443 l1++) {}
444 l2 = strlen(fname+l1);
445
446 if (l1 > 0)
447 flags |= XMIT_SAME_NAME;
448 if (l2 > 255)
449 flags |= XMIT_LONG_NAME;
450
451 /* We must make sure we don't send a zero flag byte or the
452 * other end will terminate the flist transfer. Note that
453 * the use of XMIT_TOP_DIR on a non-dir has no meaning, so
454 * it's harmless way to add a bit to the first flag byte. */
455 if (protocol_version >= 28) {
456 if (!flags && !S_ISDIR(mode))
457 flags |= XMIT_TOP_DIR;
458 if ((flags & 0xFF00) || !flags) {
459 flags |= XMIT_EXTENDED_FLAGS;
460 write_shortint(f, flags);
461 } else
462 write_byte(f, flags);
463 } else {
464 if (!(flags & 0xFF))
465 flags |= S_ISDIR(mode) ? XMIT_LONG_NAME : XMIT_TOP_DIR;
466 write_byte(f, flags);
467 }
468 if (flags & XMIT_SAME_NAME)
469 write_byte(f, l1);
470 if (flags & XMIT_LONG_NAME)
471 write_abbrevint30(f, l2);
472 else
473 write_byte(f, l2);
474 write_buf(f, fname + l1, l2);
475
476 if (first_hlink_ndx >= 0) {
477 write_abbrevint30(f, first_hlink_ndx);
478 goto the_end;
479 }
480
481 write_longint(f, F_LENGTH(file));
482 if (!(flags & XMIT_SAME_TIME))
483 write_int(f, modtime);
484 if (!(flags & XMIT_SAME_MODE))
485 write_int(f, to_wire_mode(mode));
486 if (preserve_uid && !(flags & XMIT_SAME_UID)) {
487 if (protocol_version < 30)
488 write_int(f, uid);
489 else {
490 write_abbrevint(f, uid);
491 if (flags & XMIT_USER_NAME_FOLLOWS) {
492 int len = strlen(user_name);
493 write_byte(f, len);
494 write_buf(f, user_name, len);
495 }
496 }
497 }
498 if (preserve_gid && !(flags & XMIT_SAME_GID)) {
499 if (protocol_version < 30)
500 write_int(f, gid);
501 else {
502 write_abbrevint(f, gid);
503 if (flags & XMIT_GROUP_NAME_FOLLOWS) {
504 int len = strlen(group_name);
505 write_byte(f, len);
506 write_buf(f, group_name, len);
507 }
508 }
509 }
510 if ((preserve_devices && IS_DEVICE(mode))
511 || (preserve_specials && IS_SPECIAL(mode))) {
512 if (protocol_version < 28) {
513 if (!(flags & XMIT_SAME_RDEV_pre28))
514 write_int(f, (int)rdev);
515 } else {
516 if (!(flags & XMIT_SAME_RDEV_MAJOR))
517 write_abbrevint30(f, major(rdev));
518 if (protocol_version >= 30)
519 write_abbrevint(f, minor(rdev));
520 else if (flags & XMIT_RDEV_MINOR_8_pre30)
521 write_byte(f, minor(rdev));
522 else
523 write_int(f, minor(rdev));
524 }
525 }
526
527#ifdef SUPPORT_LINKS
528 if (preserve_links && S_ISLNK(mode)) {
529 const char *sl = F_SYMLINK(file);
530 int len = strlen(sl);
531 write_abbrevint30(f, len);
532 write_buf(f, sl, len);
533 }
534#endif
535
536#ifdef SUPPORT_HARD_LINKS
537 if (tmp_dev != 0 && protocol_version < 30) {
538 if (protocol_version < 26) {
539 /* 32-bit dev_t and ino_t */
540 write_int(f, (int32)dev);
541 write_int(f, (int32)tmp_ino);
542 } else {
543 /* 64-bit dev_t and ino_t */
544 if (!(flags & XMIT_SAME_DEV_pre30))
545 write_longint(f, dev);
546 write_longint(f, tmp_ino);
547 }
548 }
549#endif
550
551 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
552 const char *sum;
553 if (S_ISREG(mode))
554 sum = tmp_sum;
555 else {
556 /* Prior to 28, we sent a useless set of nulls. */
557 sum = empty_sum;
558 }
559 write_buf(f, sum, checksum_len);
560 }
561
562 the_end:
563 strlcpy(lastname, fname, MAXPATHLEN);
564
565 if (S_ISREG(mode) || S_ISLNK(mode))
566 stats.total_size += F_LENGTH(file);
567}
568
569static struct file_struct *recv_file_entry(struct file_list *flist,
570 int flags, int f)
571{
572 static time_t modtime;
573 static mode_t mode;
574 static int64 dev;
575 static dev_t rdev;
576 static uint32 rdev_major;
577 static uid_t uid;
578 static gid_t gid;
579 static char lastname[MAXPATHLEN], *lastdir;
580 static int lastdir_depth, lastdir_len = -1;
581 static unsigned int del_hier_name_len = 0;
582 static int in_del_hier = 0;
583 char thisname[MAXPATHLEN];
584 unsigned int l1 = 0, l2 = 0;
585 int alloc_len, basename_len, linkname_len;
586 int extra_len = file_extra_cnt * EXTRA_LEN;
587 int first_hlink_ndx = -1;
588 OFF_T file_length;
589 const char *basename;
590 char *bp;
591 struct file_struct *file;
592
593 if (flags & XMIT_SAME_NAME)
594 l1 = read_byte(f);
595
596 if (flags & XMIT_LONG_NAME)
597 l2 = read_abbrevint30(f);
598 else
599 l2 = read_byte(f);
600
601 if (l2 >= MAXPATHLEN - l1) {
602 rprintf(FERROR,
603 "overflow: flags=0x%x l1=%d l2=%d lastname=%s [%s]\n",
604 flags, l1, l2, lastname, who_am_i());
605 overflow_exit("recv_file_entry");
606 }
607
608 strlcpy(thisname, lastname, l1 + 1);
609 read_sbuf(f, &thisname[l1], l2);
610 thisname[l1 + l2] = 0;
611
612 strlcpy(lastname, thisname, MAXPATHLEN);
613
614 clean_fname(thisname, 0);
615
616 if (sanitize_paths)
617 sanitize_path(thisname, thisname, "", 0, NULL);
618
619 if ((basename = strrchr(thisname, '/')) != NULL) {
620 int len = basename++ - thisname;
621 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
622 lastdir = new_array(char, len + 1);
623 memcpy(lastdir, thisname, len);
624 lastdir[len] = '\0';
625 lastdir_len = len;
626 lastdir_depth = count_dir_elements(lastdir);
627 }
628 } else
629 basename = thisname;
630 basename_len = strlen(basename) + 1; /* count the '\0' */
631
632#ifdef SUPPORT_HARD_LINKS
633 if (protocol_version >= 30
634 && BITS_SETnUNSET(flags, XMIT_HLINKED, XMIT_HLINK_FIRST)) {
635 struct file_struct *first;
636 first_hlink_ndx = read_abbrevint30(f);
637 if (first_hlink_ndx < 0 || first_hlink_ndx >= flist->count) {
638 rprintf(FERROR,
639 "hard-link reference out of range: %d (%d)\n",
640 first_hlink_ndx, flist->count);
641 exit_cleanup(RERR_PROTOCOL);
642 }
643 first = flist->files[first_hlink_ndx];
644 file_length = F_LENGTH(first);
645 modtime = first->modtime;
646 mode = first->mode;
647 if (preserve_uid)
648 uid = F_UID(first);
649 if (preserve_gid)
650 gid = F_GID(first);
651 if ((preserve_devices && IS_DEVICE(mode))
652 || (preserve_specials && IS_SPECIAL(mode))) {
653 uint32 *devp = F_RDEV_P(first);
654 rdev = MAKEDEV(DEV_MAJOR(devp), DEV_MINOR(devp));
655 extra_len += 2 * EXTRA_LEN;
656 }
657 if (preserve_links && S_ISLNK(mode))
658 linkname_len = strlen(F_SYMLINK(first)) + 1;
659 else
660 linkname_len = 0;
661 goto create_object;
662 }
663#endif
664
665 file_length = read_longint(f);
666 if (!(flags & XMIT_SAME_TIME))
667 modtime = (time_t)read_int(f);
668 if (!(flags & XMIT_SAME_MODE))
669 mode = from_wire_mode(read_int(f));
670
671 if (chmod_modes && !S_ISLNK(mode))
672 mode = tweak_mode(mode, chmod_modes);
673
674 if (preserve_uid && !(flags & XMIT_SAME_UID)) {
675 if (protocol_version < 30)
676 uid = (uid_t)read_int(f);
677 else {
678 uid = (uid_t)read_abbrevint(f);
679 if (flags & XMIT_USER_NAME_FOLLOWS)
680 uid = recv_user_name(f, uid);
681 else if (inc_recurse && am_root && !numeric_ids)
682 uid = match_uid(uid);
683 }
684 }
685 if (preserve_gid && !(flags & XMIT_SAME_GID)) {
686 if (protocol_version < 30)
687 gid = (gid_t)read_int(f);
688 else {
689 gid = (gid_t)read_abbrevint(f);
690 if (flags & XMIT_GROUP_NAME_FOLLOWS)
691 gid = recv_group_name(f, gid);
692 else if (inc_recurse && (!am_root || !numeric_ids))
693 gid = match_gid(gid);
694 }
695 }
696
697 if ((preserve_devices && IS_DEVICE(mode))
698 || (preserve_specials && IS_SPECIAL(mode))) {
699 if (protocol_version < 28) {
700 if (!(flags & XMIT_SAME_RDEV_pre28))
701 rdev = (dev_t)read_int(f);
702 } else {
703 uint32 rdev_minor;
704 if (!(flags & XMIT_SAME_RDEV_MAJOR))
705 rdev_major = read_abbrevint30(f);
706 if (protocol_version >= 30)
707 rdev_minor = read_abbrevint(f);
708 else if (flags & XMIT_RDEV_MINOR_8_pre30)
709 rdev_minor = read_byte(f);
710 else
711 rdev_minor = read_int(f);
712 rdev = MAKEDEV(rdev_major, rdev_minor);
713 }
714 extra_len += 2 * EXTRA_LEN;
715 file_length = 0;
716 } else if (protocol_version < 28)
717 rdev = MAKEDEV(0, 0);
718
719#ifdef SUPPORT_LINKS
720 if (preserve_links && S_ISLNK(mode)) {
721 linkname_len = read_abbrevint30(f) + 1; /* count the '\0' */
722 if (linkname_len <= 0 || linkname_len > MAXPATHLEN) {
723 rprintf(FERROR, "overflow: linkname_len=%d\n",
724 linkname_len - 1);
725 overflow_exit("recv_file_entry");
726 }
727 }
728 else
729#endif
730 linkname_len = 0;
731
732#ifdef SUPPORT_HARD_LINKS
733 create_object:
734 if (preserve_hard_links) {
735 if (protocol_version < 28 && S_ISREG(mode))
736 flags |= XMIT_HLINKED;
737 if (flags & XMIT_HLINKED)
738 extra_len += EXTRA_LEN;
739 }
740#endif
741
742#ifdef SUPPORT_ACLS
743 /* We need one or two index int32s when we're preserving ACLs. */
744 if (preserve_acls)
745 extra_len += (S_ISDIR(mode) ? 2 : 1) * EXTRA_LEN;
746#endif
747
748 if (always_checksum && S_ISREG(mode))
749 extra_len += SUM_EXTRA_CNT * EXTRA_LEN;
750
751 if (file_length > 0xFFFFFFFFu && S_ISREG(mode))
752 extra_len += EXTRA_LEN;
753
754#if EXTRA_ROUNDING > 0
755 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
756 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
757#endif
758
759 if (inc_recurse && S_ISDIR(mode)) {
760 if (one_file_system) {
761 /* Room to save the dir's device for -x */
762 extra_len += 2 * EXTRA_LEN;
763 }
764 flist = dir_flist;
765 }
766
767 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
768 + linkname_len;
769 bp = pool_alloc(flist->file_pool, alloc_len, "recv_file_entry");
770
771 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
772 bp += extra_len;
773 file = (struct file_struct *)bp;
774 bp += FILE_STRUCT_LEN;
775
776 memcpy(bp, basename, basename_len);
777 bp += basename_len + linkname_len; /* skip space for symlink too */
778
779#ifdef SUPPORT_HARD_LINKS
780 if (flags & XMIT_HLINKED)
781 file->flags |= FLAG_HLINKED;
782#endif
783 file->modtime = modtime;
784 file->len32 = (uint32)file_length;
785 if (file_length > 0xFFFFFFFFu && S_ISREG(mode)) {
786 file->flags |= FLAG_LENGTH64;
787 OPT_EXTRA(file, 0)->unum = (uint32)(file_length >> 32);
788 }
789 file->mode = mode;
790 if (preserve_uid)
791 F_OWNER(file) = uid;
792 if (preserve_gid)
793 F_GROUP(file) = gid;
794
795 if (basename != thisname) {
796 file->dirname = lastdir;
797 F_DEPTH(file) = lastdir_depth + 1;
798 } else
799 F_DEPTH(file) = 1;
800
801 if (S_ISDIR(mode)) {
802 if (basename_len == 1+1 && *basename == '.') /* +1 for '\0' */
803 F_DEPTH(file)--;
804 if (flags & XMIT_TOP_DIR) {
805 in_del_hier = recurse;
806 del_hier_name_len = F_DEPTH(file) == 0 ? 0 : l1 + l2;
807 if (relative_paths && del_hier_name_len > 2
808 && lastname[del_hier_name_len-1] == '.'
809 && lastname[del_hier_name_len-2] == '/')
810 del_hier_name_len -= 2;
811 file->flags |= FLAG_TOP_DIR | FLAG_XFER_DIR;
812 } else if (in_del_hier) {
813 if (!relative_paths || !del_hier_name_len
814 || (l1 >= del_hier_name_len
815 && lastname[del_hier_name_len] == '/'))
816 file->flags |= FLAG_XFER_DIR;
817 else
818 in_del_hier = 0;
819 }
820 }
821
822 if ((preserve_devices && IS_DEVICE(mode))
823 || (preserve_specials && IS_SPECIAL(mode))) {
824 uint32 *devp = F_RDEV_P(file);
825 DEV_MAJOR(devp) = major(rdev);
826 DEV_MINOR(devp) = minor(rdev);
827 }
828
829#ifdef SUPPORT_LINKS
830 if (linkname_len) {
831 bp = (char*)file->basename + basename_len;
832 if (first_hlink_ndx >= 0) {
833 struct file_struct *first = flist->files[first_hlink_ndx];
834 memcpy(bp, F_SYMLINK(first), linkname_len);
835 } else
836 read_sbuf(f, bp, linkname_len - 1);
837 if (sanitize_paths)
838 sanitize_path(bp, bp, "", lastdir_depth, NULL);
839 }
840#endif
841
842#ifdef SUPPORT_HARD_LINKS
843 if (preserve_hard_links && flags & XMIT_HLINKED) {
844 if (protocol_version >= 30) {
845 F_HL_GNUM(file) = flags & XMIT_HLINK_FIRST
846 ? flist->count : first_hlink_ndx;
847 } else {
848 static int32 cnt = 0;
849 struct idev_node *np;
850 int64 ino;
851 int32 ndx;
852 if (protocol_version < 26) {
853 dev = read_int(f);
854 ino = read_int(f);
855 } else {
856 if (!(flags & XMIT_SAME_DEV_pre30))
857 dev = read_longint(f);
858 ino = read_longint(f);
859 }
860 np = idev_node(dev, ino);
861 ndx = (int32)(long)np->data - 1;
862 if (ndx < 0) {
863 ndx = cnt++;
864 np->data = (void*)(long)cnt;
865 }
866 F_HL_GNUM(file) = ndx;
867 }
868 }
869#endif
870
871 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
872 if (S_ISREG(mode))
873 bp = (char*)F_SUM(file);
874 else {
875 /* Prior to 28, we get a useless set of nulls. */
876 bp = tmp_sum;
877 }
878 if (first_hlink_ndx >= 0) {
879 struct file_struct *first = flist->files[first_hlink_ndx];
880 memcpy(bp, F_SUM(first), checksum_len);
881 } else
882 read_buf(f, bp, checksum_len);
883 }
884
885#ifdef SUPPORT_ACLS
886 if (preserve_acls && !S_ISLNK(mode))
887 receive_acl(file, f);
888#endif
889
890 if (S_ISREG(mode) || S_ISLNK(mode))
891 stats.total_size += file_length;
892
893 return file;
894}
895
896/**
897 * Create a file_struct for a named file by reading its stat()
898 * information and performing extensive checks against global
899 * options.
900 *
901 * @return the new file, or NULL if there was an error or this file
902 * should be excluded.
903 *
904 * @todo There is a small optimization opportunity here to avoid
905 * stat()ing the file in some circumstances, which has a certain cost.
906 * We are called immediately after doing readdir(), and so we may
907 * already know the d_type of the file. We could for example avoid
908 * statting directories if we're not recursing, but this is not a very
909 * important case. Some systems may not have d_type.
910 **/
911struct file_struct *make_file(const char *fname, struct file_list *flist,
912 STRUCT_STAT *stp, int flags, int filter_level)
913{
914 static char *lastdir;
915 static int lastdir_len = -1;
916 struct file_struct *file;
917 STRUCT_STAT st;
918 char thisname[MAXPATHLEN];
919 char linkname[MAXPATHLEN];
920 int alloc_len, basename_len, linkname_len;
921 int extra_len = file_extra_cnt * EXTRA_LEN;
922 const char *basename;
923 char *bp;
924
925 if (strlcpy(thisname, fname, sizeof thisname)
926 >= sizeof thisname - flist_dir_len) {
927 rprintf(FINFO, "skipping overly long name: %s\n", fname);
928 return NULL;
929 }
930 clean_fname(thisname, 0);
931 if (sanitize_paths)
932 sanitize_path(thisname, thisname, "", 0, NULL);
933
934 if (stp && S_ISDIR(stp->st_mode)) {
935 st = *stp; /* Needed for "symlink/." with --relative. */
936 *linkname = '\0'; /* make IBM code checker happy */
937 } else if (readlink_stat(thisname, &st, linkname) != 0) {
938 int save_errno = errno;
939 /* See if file is excluded before reporting an error. */
940 if (filter_level != NO_FILTERS
941 && (is_excluded(thisname, 0, filter_level)
942 || is_excluded(thisname, 1, filter_level))) {
943 if (ignore_perishable && save_errno != ENOENT)
944 non_perishable_cnt++;
945 return NULL;
946 }
947 if (save_errno == ENOENT) {
948#ifdef SUPPORT_LINKS
949 /* Avoid "vanished" error if symlink points nowhere. */
950 if (copy_links && do_lstat(thisname, &st) == 0
951 && S_ISLNK(st.st_mode)) {
952 io_error |= IOERR_GENERAL;
953 rprintf(FERROR, "symlink has no referent: %s\n",
954 full_fname(thisname));
955 } else
956#endif
957 {
958 enum logcode c = am_daemon && protocol_version < 28
959 ? FERROR : FINFO;
960 io_error |= IOERR_VANISHED;
961 rprintf(c, "file has vanished: %s\n",
962 full_fname(thisname));
963 }
964 } else {
965 io_error |= IOERR_GENERAL;
966 rsyserr(FERROR, save_errno, "readlink %s failed",
967 full_fname(thisname));
968 }
969 return NULL;
970 }
971
972 /* backup.c calls us with filter_level set to NO_FILTERS. */
973 if (filter_level == NO_FILTERS)
974 goto skip_filters;
975
976 if (S_ISDIR(st.st_mode) && !xfer_dirs) {
977 rprintf(FINFO, "skipping directory %s\n", thisname);
978 return NULL;
979 }
980
981 /* -x only affects directories because we need to avoid recursing
982 * into a mount-point directory, not to avoid copying a symlinked
983 * file if -L (or similar) was specified. */
984 if (one_file_system && st.st_dev != filesystem_dev
985 && S_ISDIR(st.st_mode)) {
986 if (one_file_system > 1) {
987 if (verbose > 2) {
988 rprintf(FINFO, "skipping mount-point dir %s\n",
989 thisname);
990 }
991 return NULL;
992 }
993 flags |= FLAG_MOUNT_DIR;
994 }
995
996 if (is_excluded(thisname, S_ISDIR(st.st_mode) != 0, filter_level)) {
997 if (ignore_perishable)
998 non_perishable_cnt++;
999 return NULL;
1000 }
1001
1002 if (lp_ignore_nonreadable(module_id)) {
1003#ifdef SUPPORT_LINKS
1004 if (!S_ISLNK(st.st_mode))
1005#endif
1006 if (access(thisname, R_OK) != 0)
1007 return NULL;
1008 }
1009
1010 skip_filters:
1011
1012 /* Only divert a directory in the main transfer. */
1013 if (flist && flist->prev && S_ISDIR(st.st_mode)
1014 && flags & FLAG_DIVERT_DIRS) {
1015 flist = dir_flist;
1016 /* Room for parent/sibling/next-child info. */
1017 extra_len += 3 * EXTRA_LEN;
1018 }
1019
1020 if (verbose > 2) {
1021 rprintf(FINFO, "[%s] make_file(%s,*,%d)\n",
1022 who_am_i(), thisname, filter_level);
1023 }
1024
1025 if ((basename = strrchr(thisname, '/')) != NULL) {
1026 int len = basename++ - thisname;
1027 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
1028 lastdir = new_array(char, len + 1);
1029 memcpy(lastdir, thisname, len);
1030 lastdir[len] = '\0';
1031 lastdir_len = len;
1032 }
1033 } else
1034 basename = thisname;
1035 basename_len = strlen(basename) + 1; /* count the '\0' */
1036
1037#ifdef SUPPORT_LINKS
1038 linkname_len = S_ISLNK(st.st_mode) ? strlen(linkname) + 1 : 0;
1039#else
1040 linkname_len = 0;
1041#endif
1042
1043 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode))
1044 extra_len += EXTRA_LEN;
1045
1046#if EXTRA_ROUNDING > 0
1047 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
1048 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
1049#endif
1050
1051 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
1052 + linkname_len;
1053 if (flist)
1054 bp = pool_alloc(flist->file_pool, alloc_len, "make_file");
1055 else {
1056 if (!(bp = new_array(char, alloc_len)))
1057 out_of_memory("make_file");
1058 }
1059
1060 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
1061 bp += extra_len;
1062 file = (struct file_struct *)bp;
1063 bp += FILE_STRUCT_LEN;
1064
1065 memcpy(bp, basename, basename_len);
1066 bp += basename_len + linkname_len; /* skip space for symlink too */
1067
1068#ifdef SUPPORT_HARD_LINKS
1069 if (preserve_hard_links && flist && flist->prev) {
1070 if (protocol_version >= 28
1071 ? (!S_ISDIR(st.st_mode) && st.st_nlink > 1)
1072 : S_ISREG(st.st_mode)) {
1073 tmp_dev = st.st_dev;
1074 tmp_ino = st.st_ino;
1075 } else
1076 tmp_dev = 0;
1077 }
1078#endif
1079
1080#ifdef HAVE_STRUCT_STAT_ST_RDEV
1081 if (IS_DEVICE(st.st_mode) || IS_SPECIAL(st.st_mode)) {
1082 tmp_rdev = st.st_rdev;
1083 st.st_size = 0;
1084 }
1085#endif
1086
1087 file->flags = flags;
1088 file->modtime = st.st_mtime;
1089 file->len32 = (uint32)st.st_size;
1090 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode)) {
1091 file->flags |= FLAG_LENGTH64;
1092 OPT_EXTRA(file, 0)->unum = (uint32)(st.st_size >> 32);
1093 }
1094 file->mode = st.st_mode;
1095 if (preserve_uid)
1096 F_OWNER(file) = st.st_uid;
1097 if (preserve_gid)
1098 F_GROUP(file) = st.st_gid;
1099
1100 if (basename != thisname)
1101 file->dirname = lastdir;
1102
1103#ifdef SUPPORT_LINKS
1104 if (linkname_len) {
1105 bp = (char*)file->basename + basename_len;
1106 memcpy(bp, linkname, linkname_len);
1107 }
1108#endif
1109
1110 if (always_checksum && am_sender && S_ISREG(st.st_mode))
1111 file_checksum(thisname, tmp_sum, st.st_size);
1112
1113 F_ROOTDIR(file) = flist_dir;
1114
1115 /* This code is only used by the receiver when it is building
1116 * a list of files for a delete pass. */
1117 if (keep_dirlinks && linkname_len && flist) {
1118 STRUCT_STAT st2;
1119 int save_mode = file->mode;
1120 file->mode = S_IFDIR; /* Find a directory with our name. */
1121 if (flist_find(dir_flist, file) >= 0
1122 && do_stat(thisname, &st2) == 0 && S_ISDIR(st2.st_mode)) {
1123 file->modtime = st2.st_mtime;
1124 file->len32 = 0;
1125 file->mode = st2.st_mode;
1126 if (preserve_uid)
1127 F_OWNER(file) = st2.st_uid;
1128 if (preserve_gid)
1129 F_GROUP(file) = st2.st_gid;
1130 } else
1131 file->mode = save_mode;
1132 }
1133
1134 if (basename_len == 0+1)
1135 return NULL;
1136
1137 if (inc_recurse && flist == dir_flist) {
1138 flist_expand(flist);
1139 flist->files[flist->count++] = file;
1140 }
1141
1142 return file;
1143}
1144
1145/* Only called for temporary file_struct entries created by make_file(). */
1146void unmake_file(struct file_struct *file)
1147{
1148 int extra_cnt = file_extra_cnt + LEN64_BUMP(file);
1149#if EXTRA_ROUNDING > 0
1150 if (extra_cnt & EXTRA_ROUNDING)
1151 extra_cnt = (extra_cnt | EXTRA_ROUNDING) + 1;
1152#endif
1153 free(REQ_EXTRA(file, extra_cnt));
1154}
1155
1156static struct file_struct *send_file_name(int f, struct file_list *flist,
1157 char *fname, STRUCT_STAT *stp,
1158 int flags, int filter_flags)
1159{
1160 struct file_struct *file;
1161#ifdef SUPPORT_ACLS
1162 statx sx;
1163#endif
1164
1165 file = make_file(fname, flist, stp, flags, filter_flags);
1166 if (!file)
1167 return NULL;
1168
1169 if (chmod_modes && !S_ISLNK(file->mode))
1170 file->mode = tweak_mode(file->mode, chmod_modes);
1171
1172#ifdef SUPPORT_ACLS
1173 if (preserve_acls && !S_ISLNK(file->mode) && f >= 0) {
1174 sx.st.st_mode = file->mode;
1175 sx.acc_acl = sx.def_acl = NULL;
1176 if (get_acl(fname, &sx) < 0)
1177 return NULL;
1178 }
1179#endif
1180
1181 maybe_emit_filelist_progress(flist->count + flist_count_offset);
1182
1183 flist_expand(flist);
1184 flist->files[flist->count++] = file;
1185 if (f >= 0) {
1186 send_file_entry(f, file, flist->count - 1);
1187#ifdef SUPPORT_ACLS
1188 if (preserve_acls && !S_ISLNK(file->mode)) {
1189 send_acl(&sx, f);
1190 free_acl(&sx);
1191 }
1192#endif
1193 }
1194 return file;
1195}
1196
1197static void send_if_directory(int f, struct file_list *flist,
1198 struct file_struct *file,
1199 char *fbuf, unsigned int ol,
1200 int flags)
1201{
1202 char is_dot_dir = fbuf[ol-1] == '.' && (ol == 1 || fbuf[ol-2] == '/');
1203
1204 if (S_ISDIR(file->mode)
1205 && !(file->flags & FLAG_MOUNT_DIR) && f_name(file, fbuf)) {
1206 void *save_filters;
1207 unsigned int len = strlen(fbuf);
1208 if (len > 1 && fbuf[len-1] == '/')
1209 fbuf[--len] = '\0';
1210 if (len >= MAXPATHLEN - 1) {
1211 io_error |= IOERR_GENERAL;
1212 rprintf(FERROR, "skipping long-named directory: %s\n",
1213 full_fname(fbuf));
1214 return;
1215 }
1216 save_filters = push_local_filters(fbuf, len);
1217 send_directory(f, flist, -1, fbuf, len, flags);
1218 pop_local_filters(save_filters);
1219 fbuf[ol] = '\0';
1220 if (is_dot_dir)
1221 fbuf[ol-1] = '.';
1222 }
1223}
1224
1225static int file_compare(struct file_struct **file1, struct file_struct **file2)
1226{
1227 return f_name_cmp(*file1, *file2);
1228}
1229
1230/* We take an entire set of sibling dirs from dir_flist (start <= ndx <= end),
1231 * sort them by name, and link them into the tree, setting the appropriate
1232 * parent/child/sibling pointers. */
1233static void add_dirs_to_tree(int parent_ndx, int start, int end)
1234{
1235 int i;
1236 int32 *dp = NULL;
1237 int32 *parent_dp = parent_ndx < 0 ? NULL
1238 : F_DIRNODE_P(dir_flist->files[parent_ndx]);
1239
1240 qsort(dir_flist->files + start, end - start + 1,
1241 sizeof dir_flist->files[0], (int (*)())file_compare);
1242
1243 for (i = start; i <= end; i++) {
1244 struct file_struct *file = dir_flist->files[i];
1245 if (!(file->flags & FLAG_XFER_DIR)
1246 || file->flags & FLAG_MOUNT_DIR)
1247 continue;
1248 if (dp)
1249 DIR_NEXT_SIBLING(dp) = i;
1250 else if (parent_dp)
1251 DIR_FIRST_CHILD(parent_dp) = i;
1252 else
1253 send_dir_ndx = i;
1254 dp = F_DIRNODE_P(file);
1255 DIR_PARENT(dp) = parent_ndx;
1256 DIR_FIRST_CHILD(dp) = -1;
1257 }
1258 if (dp)
1259 DIR_NEXT_SIBLING(dp) = -1;
1260}
1261
1262/* This function is normally called by the sender, but the receiving side also
1263 * calls it from get_dirlist() with f set to -1 so that we just construct the
1264 * file list in memory without sending it over the wire. Also, get_dirlist()
1265 * might call this with f set to -2, which also indicates that local filter
1266 * rules should be ignored. */
1267static void send_directory(int f, struct file_list *flist, int parent_ndx,
1268 char *fbuf, int len, int flags)
1269{
1270 struct dirent *di;
1271 unsigned remainder;
1272 char *p;
1273 DIR *d;
1274 int divert_dirs = (flags & FLAG_DIVERT_DIRS) != 0;
1275 int start = divert_dirs ? dir_flist->count : flist->count;
1276 int filter_flags = f == -2 ? SERVER_FILTERS : ALL_FILTERS;
1277
1278 assert(flist != NULL);
1279
1280 if (!(d = opendir(fbuf))) {
1281 io_error |= IOERR_GENERAL;
1282 rsyserr(FERROR, errno, "opendir %s failed", full_fname(fbuf));
1283 return;
1284 }
1285
1286 p = fbuf + len;
1287 if (len != 1 || *fbuf != '/')
1288 *p++ = '/';
1289 *p = '\0';
1290 remainder = MAXPATHLEN - (p - fbuf);
1291
1292 for (errno = 0, di = readdir(d); di; errno = 0, di = readdir(d)) {
1293 char *dname = d_name(di);
1294 if (dname[0] == '.' && (dname[1] == '\0'
1295 || (dname[1] == '.' && dname[2] == '\0')))
1296 continue;
1297 if (strlcpy(p, dname, remainder) >= remainder) {
1298 io_error |= IOERR_GENERAL;
1299 rprintf(FINFO,
1300 "cannot send long-named file %s\n",
1301 full_fname(fbuf));
1302 continue;
1303 }
1304
1305 send_file_name(f, flist, fbuf, NULL, flags, filter_flags);
1306 }
1307
1308 fbuf[len] = '\0';
1309
1310 if (errno) {
1311 io_error |= IOERR_GENERAL;
1312 rsyserr(FERROR, errno, "readdir(%s)", full_fname(fbuf));
1313 }
1314
1315 closedir(d);
1316
1317 if (f < 0)
1318 return;
1319
1320 if (divert_dirs)
1321 add_dirs_to_tree(parent_ndx, start, dir_flist->count - 1);
1322 else if (recurse) {
1323 int i, end = flist->count - 1;
1324 /* send_if_directory() bumps flist->count, so use "end". */
1325 for (i = start; i <= end; i++)
1326 send_if_directory(f, flist, flist->files[i], fbuf, len, flags);
1327 }
1328}
1329
1330void send_extra_file_list(int f, int at_least)
1331{
1332 char fbuf[MAXPATHLEN];
1333 struct file_list *flist;
1334 int64 start_write;
1335 int future_cnt, save_io_error = io_error;
1336
1337 if (send_dir_ndx < 0)
1338 return;
1339
1340 /* Keep sending data until we have the requested number of
1341 * files in the upcoming file-lists. */
1342 if (cur_flist->next) {
1343 flist = first_flist->prev; /* the newest flist */
1344 future_cnt = flist->count
1345 + flist->ndx_start - cur_flist->next->ndx_start;
1346 } else
1347 future_cnt = 0;
1348 while (future_cnt < at_least) {
1349 struct file_struct *file = dir_flist->files[send_dir_ndx];
1350 int32 *dp;
1351 int dlen;
1352
1353 f_name(file, fbuf);
1354 dlen = strlen(fbuf);
1355
1356 if (F_ROOTDIR(file) != flist_dir) {
1357 if (!push_flist_dir(F_ROOTDIR(file), -1))
1358 exit_cleanup(RERR_FILESELECT);
1359 }
1360
1361 flist = flist_new(0, "send_extra_file_list");
1362 start_write = stats.total_written;
1363
1364 write_ndx(f, NDX_FLIST_OFFSET - send_dir_ndx);
1365 change_local_filter_dir(fbuf, dlen, send_dir_depth);
1366 send_directory(f, flist, send_dir_ndx, fbuf, dlen, FLAG_DIVERT_DIRS | FLAG_XFER_DIR);
1367 write_byte(f, 0);
1368
1369 clean_flist(flist, 0, 0);
1370 file_total += flist->count;
1371 future_cnt += flist->count;
1372 stats.flist_size += stats.total_written - start_write;
1373 stats.num_files += flist->count;
1374 if (verbose > 3)
1375 output_flist(flist);
1376
1377 dp = F_DIRNODE_P(file);
1378 if (DIR_FIRST_CHILD(dp) >= 0) {
1379 send_dir_ndx = DIR_FIRST_CHILD(dp);
1380 send_dir_depth++;
1381 } else {
1382 while (DIR_NEXT_SIBLING(dp) < 0) {
1383 if ((send_dir_ndx = DIR_PARENT(dp)) < 0) {
1384 write_ndx(f, NDX_FLIST_EOF);
1385 flist_eof = 1;
1386 change_local_filter_dir(NULL, 0, 0);
1387 goto finish;
1388 }
1389 send_dir_depth--;
1390 file = dir_flist->files[send_dir_ndx];
1391 dp = F_DIRNODE_P(file);
1392 }
1393 send_dir_ndx = DIR_NEXT_SIBLING(dp);
1394 }
1395 }
1396
1397 finish:
1398 if (io_error != save_io_error && !ignore_errors)
1399 send_msg_int(MSG_IO_ERROR, io_error);
1400}
1401
1402struct file_list *send_file_list(int f, int argc, char *argv[])
1403{
1404 int len;
1405 STRUCT_STAT st;
1406 char *p, *dir;
1407 char lastpath[MAXPATHLEN] = "";
1408 struct file_list *flist;
1409 struct timeval start_tv, end_tv;
1410 int64 start_write;
1411 int use_ff_fd = 0;
1412 int flags, disable_buffering;
1413
1414 rprintf(FLOG, "building file list\n");
1415 if (show_filelist_p())
1416 start_filelist_progress("building file list");
1417 else if (inc_recurse && verbose && !am_server)
1418 rprintf(FCLIENT, "sending incremental file list\n");
1419
1420 start_write = stats.total_written;
1421 gettimeofday(&start_tv, NULL);
1422
1423#ifdef SUPPORT_HARD_LINKS
1424 if (preserve_hard_links && protocol_version >= 30 && !cur_flist)
1425 init_hard_links();
1426#endif
1427
1428 flist = cur_flist = flist_new(0, "send_file_list");
1429 if (inc_recurse) {
1430 dir_flist = flist_new(FLIST_TEMP, "send_file_list");
1431 flags = FLAG_DIVERT_DIRS;
1432 } else {
1433 dir_flist = cur_flist;
1434 flags = 0;
1435 }
1436
1437 disable_buffering = io_start_buffering_out(f);
1438 if (filesfrom_fd >= 0) {
1439 if (argv[0] && !push_dir(argv[0], 0)) {
1440 rsyserr(FERROR, errno, "push_dir %s failed",
1441 full_fname(argv[0]));
1442 exit_cleanup(RERR_FILESELECT);
1443 }
1444 use_ff_fd = 1;
1445 }
1446
1447 while (1) {
1448 char fbuf[MAXPATHLEN];
1449 char *fn;
1450 int is_dot_dir;
1451
1452 if (use_ff_fd) {
1453 if (read_filesfrom_line(filesfrom_fd, fbuf) == 0)
1454 break;
1455 sanitize_path(fbuf, fbuf, "", 0, NULL);
1456 } else {
1457 if (argc-- == 0)
1458 break;
1459 strlcpy(fbuf, *argv++, MAXPATHLEN);
1460 if (sanitize_paths)
1461 sanitize_path(fbuf, fbuf, "", 0, NULL);
1462 }
1463
1464 len = strlen(fbuf);
1465 if (relative_paths) {
1466 /* We clean up fbuf below. */
1467 is_dot_dir = 0;
1468 } else if (!len || fbuf[len - 1] == '/') {
1469 if (len == 2 && fbuf[0] == '.') {
1470 /* Turn "./" into just "." rather than "./." */
1471 fbuf[1] = '\0';
1472 } else {
1473 if (len + 1 >= MAXPATHLEN)
1474 overflow_exit("send_file_list");
1475 fbuf[len++] = '.';
1476 fbuf[len] = '\0';
1477 }
1478 is_dot_dir = 1;
1479 } else if (len > 1 && fbuf[len-1] == '.' && fbuf[len-2] == '.'
1480 && (len == 2 || fbuf[len-3] == '/')) {
1481 if (len + 2 >= MAXPATHLEN)
1482 overflow_exit("send_file_list");
1483 fbuf[len++] = '/';
1484 fbuf[len++] = '.';
1485 fbuf[len] = '\0';
1486 is_dot_dir = 1;
1487 } else {
1488 is_dot_dir = fbuf[len-1] == '.'
1489 && (len == 1 || fbuf[len-2] == '/');
1490 }
1491
1492 if (link_stat(fbuf, &st, copy_dirlinks) != 0) {
1493 io_error |= IOERR_GENERAL;
1494 rsyserr(FERROR, errno, "link_stat %s failed",
1495 full_fname(fbuf));
1496 continue;
1497 }
1498
1499 if (S_ISDIR(st.st_mode) && !xfer_dirs) {
1500 rprintf(FINFO, "skipping directory %s\n", fbuf);
1501 continue;
1502 }
1503
1504 dir = NULL;
1505
1506 if (!relative_paths) {
1507 p = strrchr(fbuf, '/');
1508 if (p) {
1509 *p = '\0';
1510 if (p == fbuf)
1511 dir = "/";
1512 else
1513 dir = fbuf;
1514 len -= p - fbuf + 1;
1515 fn = p + 1;
1516 } else
1517 fn = fbuf;
1518 } else {
1519 if ((p = strstr(fbuf, "/./")) != NULL) {
1520 *p = '\0';
1521 if (p == fbuf)
1522 dir = "/";
1523 else
1524 dir = fbuf;
1525 len -= p - fbuf + 3;
1526 fn = p + 3;
1527 } else
1528 fn = fbuf;
1529 /* Get rid of trailing "/" and "/.". */
1530 while (len) {
1531 if (fn[len - 1] == '/') {
1532 is_dot_dir = 1;
1533 if (!--len && !dir) {
1534 len++;
1535 break;
1536 }
1537 }
1538 else if (len >= 2 && fn[len - 1] == '.'
1539 && fn[len - 2] == '/') {
1540 is_dot_dir = 1;
1541 if (!(len -= 2) && !dir) {
1542 len++;
1543 break;
1544 }
1545 } else
1546 break;
1547 }
1548 if (len == 1 && fn[0] == '/')
1549 fn[len++] = '.';
1550 fn[len] = '\0';
1551 /* Reject a ".." dir in the active part of the path. */
1552 for (p = fn; (p = strstr(p, "..")) != NULL; p += 2) {
1553 if ((p[2] == '/' || p[2] == '\0')
1554 && (p == fn || p[-1] == '/')) {
1555 rprintf(FERROR,
1556 "found \"..\" dir in relative path: %s\n",
1557 fbuf);
1558 exit_cleanup(RERR_SYNTAX);
1559 }
1560 }
1561 }
1562
1563 if (!*fn) {
1564 len = 1;
1565 fn = ".";
1566 }
1567
1568 if (dir && *dir) {
1569 static const char *lastdir;
1570 static int lastdir_len = -1;
1571 int len = strlen(dir);
1572
1573 if (len != lastdir_len || memcmp(lastdir, dir, len) != 0) {
1574 if (!push_flist_dir(strdup(dir), len))
1575 goto push_error;
1576 lastdir = flist_dir;
1577 lastdir_len = flist_dir_len;
1578 } else if (!push_flist_dir(lastdir, lastdir_len)) {
1579 push_error:
1580 io_error |= IOERR_GENERAL;
1581 rsyserr(FERROR, errno, "push_dir %s failed",
1582 full_fname(dir));
1583 continue;
1584 }
1585 }
1586
1587 if (fn != fbuf)
1588 memmove(fbuf, fn, len + 1);
1589
1590 if (implied_dirs && (p=strrchr(fbuf,'/')) && p != fbuf) {
1591 /* Send the implied directories at the start of the
1592 * source spec, so we get their permissions right. */
1593 char *lp = lastpath, *slash = fbuf;
1594 *p = '\0';
1595 /* Skip any initial directories in our path that we
1596 * have in common with lastpath. */
1597 for (fn = fbuf; *fn && *lp == *fn; lp++, fn++) {
1598 if (*fn == '/')
1599 slash = fn;
1600 }
1601 *p = '/';
1602 if (fn != p || (*lp && *lp != '/')) {
1603 int save_copy_links = copy_links;
1604 int save_xfer_dirs = xfer_dirs;
1605 int dir_flags = inc_recurse ? FLAG_DIVERT_DIRS : 0;
1606 copy_links |= copy_unsafe_links;
1607 xfer_dirs = 1;
1608 while ((slash = strchr(slash+1, '/')) != 0) {
1609 *slash = '\0';
1610 send_file_name(f, flist, fbuf, NULL,
1611 dir_flags, ALL_FILTERS);
1612 *slash = '/';
1613 }
1614 copy_links = save_copy_links;
1615 xfer_dirs = save_xfer_dirs;
1616 *p = '\0';
1617 strlcpy(lastpath, fbuf, sizeof lastpath);
1618 *p = '/';
1619 }
1620 }
1621
1622 if (one_file_system)
1623 filesystem_dev = st.st_dev;
1624
1625 if (recurse || (xfer_dirs && is_dot_dir)) {
1626 struct file_struct *file;
1627 int top_flags = FLAG_TOP_DIR | FLAG_XFER_DIR
1628 | (is_dot_dir ? 0 : flags)
1629 | (inc_recurse ? FLAG_DIVERT_DIRS : 0);
1630 file = send_file_name(f, flist, fbuf, &st,
1631 top_flags, ALL_FILTERS);
1632 if (file && !inc_recurse)
1633 send_if_directory(f, flist, file, fbuf, len, flags);
1634 } else
1635 send_file_name(f, flist, fbuf, &st, flags, ALL_FILTERS);
1636 }
1637
1638 gettimeofday(&end_tv, NULL);
1639 stats.flist_buildtime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
1640 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
1641 if (stats.flist_buildtime == 0)
1642 stats.flist_buildtime = 1;
1643 start_tv = end_tv;
1644
1645 write_byte(f, 0); /* Indicate end of file list */
1646
1647#ifdef SUPPORT_HARD_LINKS
1648 if (preserve_hard_links && protocol_version >= 30 && !inc_recurse)
1649 idev_destroy();
1650#endif
1651
1652 if (show_filelist_p())
1653 finish_filelist_progress(flist);
1654
1655 gettimeofday(&end_tv, NULL);
1656 stats.flist_xfertime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
1657 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
1658
1659 /* Sort the list without removing any duplicates in non-incremental
1660 * mode. This allows the receiving side to ask for whatever name it
1661 * kept. For incremental mode, the sender also removes duplicates
1662 * in this initial file-list so that it avoids re-sending duplicated
1663 * directories. */
1664 clean_flist(flist, 0, inc_recurse);
1665 file_total += flist->count;
1666
1667 if (!numeric_ids && !inc_recurse)
1668 send_uid_list(f);
1669
1670 /* send the io_error flag */
1671 if (protocol_version < 30)
1672 write_int(f, ignore_errors ? 0 : io_error);
1673 else if (io_error && !ignore_errors)
1674 send_msg_int(MSG_IO_ERROR, io_error);
1675
1676 if (disable_buffering)
1677 io_end_buffering_out();
1678
1679 stats.flist_size = stats.total_written - start_write;
1680 stats.num_files = flist->count;
1681
1682 if (verbose > 3)
1683 output_flist(flist);
1684
1685 if (verbose > 2)
1686 rprintf(FINFO, "send_file_list done\n");
1687
1688 if (inc_recurse) {
1689 add_dirs_to_tree(-1, 0, dir_flist->count - 1);
1690 if (file_total == 1) {
1691 /* If we're creating incremental file-lists and there
1692 * was just 1 item in the first file-list, send 1 more
1693 * file-list to check if this is a 1-file xfer. */
1694 if (send_dir_ndx < 0)
1695 write_ndx(f, NDX_DONE);
1696 else
1697 send_extra_file_list(f, 1);
1698 }
1699 }
1700
1701 return flist;
1702}
1703
1704struct file_list *recv_file_list(int f)
1705{
1706 struct file_list *flist;
1707 int dstart, flags;
1708 int64 start_read;
1709
1710 if (!first_flist)
1711 rprintf(FLOG, "receiving file list\n");
1712 if (show_filelist_p())
1713 start_filelist_progress("receiving file list");
1714 else if (inc_recurse && verbose && !am_server && !first_flist)
1715 rprintf(FCLIENT, "receiving incremental file list\n");
1716
1717 start_read = stats.total_read;
1718
1719 flist = flist_new(0, "recv_file_list");
1720
1721#ifdef SUPPORT_HARD_LINKS
1722 if (preserve_hard_links && protocol_version < 30)
1723 init_hard_links();
1724#endif
1725
1726 if (inc_recurse) {
1727 if (flist->ndx_start == 0)
1728 dir_flist = flist_new(FLIST_TEMP, "recv_file_list");
1729 dstart = dir_flist->count;
1730 } else {
1731 dir_flist = flist;
1732 dstart = 0;
1733 }
1734
1735 while ((flags = read_byte(f)) != 0) {
1736 struct file_struct *file;
1737
1738 flist_expand(flist);
1739
1740 if (protocol_version >= 28 && (flags & XMIT_EXTENDED_FLAGS))
1741 flags |= read_byte(f) << 8;
1742 file = recv_file_entry(flist, flags, f);
1743
1744 if (inc_recurse && S_ISDIR(file->mode)) {
1745 flist_expand(dir_flist);
1746 dir_flist->files[dir_flist->count++] = file;
1747 }
1748
1749 flist->files[flist->count++] = file;
1750
1751 maybe_emit_filelist_progress(flist->count);
1752
1753 if (verbose > 2) {
1754 rprintf(FINFO, "recv_file_name(%s)\n",
1755 f_name(file, NULL));
1756 }
1757 }
1758 file_total += flist->count;
1759
1760 if (verbose > 2)
1761 rprintf(FINFO, "received %d names\n", flist->count);
1762
1763 if (show_filelist_p())
1764 finish_filelist_progress(flist);
1765
1766 clean_flist(flist, relative_paths, 1);
1767
1768 if (inc_recurse) {
1769 qsort(dir_flist->files + dstart, dir_flist->count - dstart,
1770 sizeof dir_flist->files[0], (int (*)())file_compare);
1771 } else if (f >= 0)
1772 recv_uid_list(f, flist);
1773
1774 if (protocol_version < 30) {
1775 /* Recv the io_error flag */
1776 if (ignore_errors)
1777 read_int(f);
1778 else
1779 io_error |= read_int(f);
1780 }
1781
1782 if (verbose > 3)
1783 output_flist(flist);
1784
1785 if (list_only) {
1786 int i;
1787 for (i = 0; i < flist->count; i++)
1788 list_file_entry(flist->files[i]);
1789 }
1790
1791 if (verbose > 2)
1792 rprintf(FINFO, "recv_file_list done\n");
1793
1794 stats.flist_size += stats.total_read - start_read;
1795 stats.num_files += flist->count;
1796
1797 return flist;
1798}
1799
1800/* This is only used once by the receiver if the very first file-list
1801 * has exactly one item in it. */
1802void recv_additional_file_list(int f)
1803{
1804 struct file_list *flist;
1805 int ndx = read_ndx(f);
1806 if (ndx == NDX_DONE) {
1807 flist_eof = 1;
1808 change_local_filter_dir(NULL, 0, 0);
1809 } else {
1810 ndx = NDX_FLIST_OFFSET - ndx;
1811 if (ndx < 0 || ndx >= dir_flist->count) {
1812 ndx = NDX_FLIST_OFFSET - ndx;
1813 rprintf(FERROR,
1814 "Invalid dir index: %d (%d - %d)\n",
1815 ndx, NDX_FLIST_OFFSET,
1816 NDX_FLIST_OFFSET - dir_flist->count);
1817 exit_cleanup(RERR_PROTOCOL);
1818 }
1819 flist = recv_file_list(f);
1820 flist->parent_ndx = ndx;
1821 }
1822}
1823
1824/* Search for an identically-named item in the file list. Note that the
1825 * items must agree in their directory-ness, or no match is returned. */
1826int flist_find(struct file_list *flist, struct file_struct *f)
1827{
1828 int low = flist->low, high = flist->high;
1829 int diff, mid, mid_up;
1830
1831 while (low <= high) {
1832 mid = (low + high) / 2;
1833 if (F_IS_ACTIVE(flist->files[mid]))
1834 mid_up = mid;
1835 else {
1836 /* Scan for the next non-empty entry using the cached
1837 * distance values. If the value isn't fully up-to-
1838 * date, update it. */
1839 mid_up = mid + F_DEPTH(flist->files[mid]);
1840 if (!F_IS_ACTIVE(flist->files[mid_up])) {
1841 do {
1842 mid_up += F_DEPTH(flist->files[mid_up]);
1843 } while (!F_IS_ACTIVE(flist->files[mid_up]));
1844 F_DEPTH(flist->files[mid]) = mid_up - mid;
1845 }
1846 if (mid_up > high) {
1847 /* If there's nothing left above us, set high to
1848 * a non-empty entry below us and continue. */
1849 high = mid - (int)flist->files[mid]->len32;
1850 if (!F_IS_ACTIVE(flist->files[high])) {
1851 do {
1852 high -= (int)flist->files[high]->len32;
1853 } while (!F_IS_ACTIVE(flist->files[high]));
1854 flist->files[mid]->len32 = mid - high;
1855 }
1856 continue;
1857 }
1858 }
1859 diff = f_name_cmp(flist->files[mid_up], f);
1860 if (diff == 0) {
1861 if (protocol_version < 29
1862 && S_ISDIR(flist->files[mid_up]->mode)
1863 != S_ISDIR(f->mode))
1864 return -1;
1865 return mid_up;
1866 }
1867 if (diff < 0)
1868 low = mid_up + 1;
1869 else
1870 high = mid - 1;
1871 }
1872 return -1;
1873}
1874
1875/*
1876 * Free up any resources a file_struct has allocated
1877 * and clear the file.
1878 */
1879void clear_file(struct file_struct *file)
1880{
1881 /* The +1 zeros out the first char of the basename. */
1882 memset(file, 0, FILE_STRUCT_LEN + 1);
1883 /* In an empty entry, F_DEPTH() is an offset to the next non-empty
1884 * entry. Likewise for len32 in the opposite direction. We assume
1885 * that we're alone for now since flist_find() will adjust the counts
1886 * it runs into that aren't up-to-date. */
1887 file->len32 = F_DEPTH(file) = 1;
1888}
1889
1890/* Allocate a new file list. */
1891struct file_list *flist_new(int flags, char *msg)
1892{
1893 struct file_list *flist;
1894
1895 flist = new(struct file_list);
1896 if (!flist)
1897 out_of_memory(msg);
1898
1899 memset(flist, 0, sizeof flist[0]);
1900
1901 if (!(flags & FLIST_TEMP)) {
1902 if (first_flist) {
1903 flist->ndx_start = first_flist->prev->ndx_start
1904 + first_flist->prev->count;
1905 }
1906 /* This is a doubly linked list with prev looping back to
1907 * the end of the list, but the last next pointer is NULL. */
1908 if (!first_flist)
1909 first_flist = cur_flist = flist->prev = flist;
1910 else {
1911 flist->prev = first_flist->prev;
1912 flist->prev->next = first_flist->prev = flist;
1913 }
1914 flist_cnt++;
1915 }
1916
1917 if (!(flist->file_pool = pool_create(FILE_EXTENT, 0, out_of_memory, POOL_INTERN)))
1918 out_of_memory(msg);
1919
1920 return flist;
1921}
1922
1923/* Free up all elements in a flist. */
1924void flist_free(struct file_list *flist)
1925{
1926 if (!flist->prev)
1927 ; /* Was FLIST_TEMP dir-list. */
1928 else if (flist == flist->prev) {
1929 first_flist = cur_flist = NULL;
1930 file_total = 0;
1931 flist_cnt = 0;
1932 } else {
1933 if (flist == cur_flist)
1934 cur_flist = flist->next;
1935 if (flist == first_flist)
1936 first_flist = first_flist->next;
1937 else {
1938 flist->prev->next = flist->next;
1939 if (!flist->next)
1940 flist->next = first_flist;
1941 }
1942 flist->next->prev = flist->prev;
1943 file_total -= flist->count;
1944 flist_cnt--;
1945 }
1946
1947 pool_destroy(flist->file_pool);
1948 free(flist->files);
1949 free(flist);
1950}
1951
1952/*
1953 * This routine ensures we don't have any duplicate names in our file list.
1954 * duplicate names can cause corruption because of the pipelining
1955 */
1956static void clean_flist(struct file_list *flist, int strip_root, int no_dups)
1957{
1958 char fbuf[MAXPATHLEN];
1959 int i, prev_i = 0;
1960
1961 if (!flist)
1962 return;
1963 if (flist->count == 0) {
1964 flist->high = -1;
1965 return;
1966 }
1967
1968 qsort(flist->files, flist->count,
1969 sizeof flist->files[0], (int (*)())file_compare);
1970
1971 for (i = no_dups? 0 : flist->count; i < flist->count; i++) {
1972 if (F_IS_ACTIVE(flist->files[i])) {
1973 prev_i = i;
1974 break;
1975 }
1976 }
1977 flist->low = prev_i;
1978 while (++i < flist->count) {
1979 int j;
1980 struct file_struct *file = flist->files[i];
1981
1982 if (!F_IS_ACTIVE(file))
1983 continue;
1984 if (f_name_cmp(file, flist->files[prev_i]) == 0)
1985 j = prev_i;
1986 else if (protocol_version >= 29 && S_ISDIR(file->mode)) {
1987 int save_mode = file->mode;
1988 /* Make sure that this directory doesn't duplicate a
1989 * non-directory earlier in the list. */
1990 flist->high = prev_i;
1991 file->mode = S_IFREG;
1992 j = flist_find(flist, file);
1993 file->mode = save_mode;
1994 } else
1995 j = -1;
1996 if (j >= 0) {
1997 struct file_struct *fp = flist->files[j];
1998 int keep, drop;
1999 /* If one is a dir and the other is not, we want to
2000 * keep the dir because it might have contents in the
2001 * list. */
2002 if (S_ISDIR(file->mode) != S_ISDIR(fp->mode)) {
2003 if (S_ISDIR(file->mode))
2004 keep = i, drop = j;
2005 else
2006 keep = j, drop = i;
2007 } else if (protocol_version < 27)
2008 keep = j, drop = i;
2009 else
2010 keep = i, drop = j;
2011 if (verbose > 1 && !am_server) {
2012 rprintf(FINFO,
2013 "removing duplicate name %s from file list (%d)\n",
2014 f_name(file, fbuf), drop);
2015 }
2016 /* Make sure we don't lose track of a user-specified
2017 * top directory. */
2018 flist->files[keep]->flags |= flist->files[drop]->flags
2019 & (FLAG_TOP_DIR|FLAG_XFER_DIR);
2020
2021 clear_file(flist->files[drop]);
2022
2023 if (keep == i) {
2024 if (flist->low == drop) {
2025 for (j = drop + 1;
2026 j < i && !F_IS_ACTIVE(flist->files[j]);
2027 j++) {}
2028 flist->low = j;
2029 }
2030 prev_i = i;
2031 }
2032 } else
2033 prev_i = i;
2034 }
2035 flist->high = no_dups ? prev_i : flist->count - 1;
2036
2037 if (strip_root) {
2038 /* We need to strip off the leading slashes for relative
2039 * paths, but this must be done _after_ the sorting phase. */
2040 for (i = flist->low; i <= flist->high; i++) {
2041 struct file_struct *file = flist->files[i];
2042
2043 if (!file->dirname)
2044 continue;
2045 while (*file->dirname == '/')
2046 file->dirname++;
2047 if (!*file->dirname)
2048 file->dirname = NULL;
2049 }
2050 }
2051
2052 if (prune_empty_dirs && no_dups) {
2053 int j, prev_depth = 0;
2054
2055 prev_i = 0; /* It's OK that this isn't really true. */
2056
2057 for (i = flist->low; i <= flist->high; i++) {
2058 struct file_struct *fp, *file = flist->files[i];
2059
2060 /* This temporarily abuses the F_DEPTH() value for a
2061 * directory that is in a chain that might get pruned.
2062 * We restore the old value if it gets a reprieve. */
2063 if (S_ISDIR(file->mode) && F_DEPTH(file)) {
2064 /* Dump empty dirs when coming back down. */
2065 for (j = prev_depth; j >= F_DEPTH(file); j--) {
2066 fp = flist->files[prev_i];
2067 if (F_DEPTH(fp) >= 0)
2068 break;
2069 prev_i = -F_DEPTH(fp)-1;
2070 clear_file(fp);
2071 }
2072 prev_depth = F_DEPTH(file);
2073 if (is_excluded(f_name(file, fbuf), 1,
2074 ALL_FILTERS)) {
2075 /* Keep dirs through this dir. */
2076 for (j = prev_depth-1; ; j--) {
2077 fp = flist->files[prev_i];
2078 if (F_DEPTH(fp) >= 0)
2079 break;
2080 prev_i = -F_DEPTH(fp)-1;
2081 F_DEPTH(fp) = j;
2082 }
2083 } else
2084 F_DEPTH(file) = -prev_i-1;
2085 prev_i = i;
2086 } else {
2087 /* Keep dirs through this non-dir. */
2088 for (j = prev_depth; ; j--) {
2089 fp = flist->files[prev_i];
2090 if (F_DEPTH(fp) >= 0)
2091 break;
2092 prev_i = -F_DEPTH(fp)-1;
2093 F_DEPTH(fp) = j;
2094 }
2095 }
2096 }
2097 /* Dump all remaining empty dirs. */
2098 while (1) {
2099 struct file_struct *fp = flist->files[prev_i];
2100 if (F_DEPTH(fp) >= 0)
2101 break;
2102 prev_i = -F_DEPTH(fp)-1;
2103 clear_file(fp);
2104 }
2105
2106 for (i = flist->low; i <= flist->high; i++) {
2107 if (F_IS_ACTIVE(flist->files[i]))
2108 break;
2109 }
2110 flist->low = i;
2111 for (i = flist->high; i >= flist->low; i--) {
2112 if (F_IS_ACTIVE(flist->files[i]))
2113 break;
2114 }
2115 flist->high = i;
2116 }
2117}
2118
2119static void output_flist(struct file_list *flist)
2120{
2121 char uidbuf[16], gidbuf[16], depthbuf[16];
2122 struct file_struct *file;
2123 const char *root, *dir, *slash, *name, *trail;
2124 const char *who = who_am_i();
2125 int i;
2126
2127 rprintf(FINFO, "[%s] flist start=%d, count=%d, low=%d, high=%d\n",
2128 who, flist->ndx_start, flist->count, flist->low, flist->high);
2129 for (i = 0; i < flist->count; i++) {
2130 file = flist->files[i];
2131 if ((am_root || am_sender) && preserve_uid) {
2132 snprintf(uidbuf, sizeof uidbuf, " uid=%ld",
2133 (long)F_UID(file));
2134 } else
2135 *uidbuf = '\0';
2136 if (preserve_gid && F_GID(file) != GID_NONE) {
2137 snprintf(gidbuf, sizeof gidbuf, " gid=%ld",
2138 (long)F_GID(file));
2139 } else
2140 *gidbuf = '\0';
2141 if (!am_sender)
2142 snprintf(depthbuf, sizeof depthbuf, "%d", F_DEPTH(file));
2143 if (F_IS_ACTIVE(file)) {
2144 root = am_sender ? NS(F_ROOTDIR(file)) : depthbuf;
2145 if ((dir = file->dirname) == NULL)
2146 dir = slash = "";
2147 else
2148 slash = "/";
2149 name = file->basename;
2150 trail = S_ISDIR(file->mode) ? "/" : "";
2151 } else
2152 root = dir = slash = name = trail = "";
2153 rprintf(FINFO, "[%s] i=%d %s %s%s%s%s mode=0%o len=%.0f%s%s flags=%x\n",
2154 who, i, root, dir, slash, name, trail, (int)file->mode,
2155 (double)F_LENGTH(file), uidbuf, gidbuf, file->flags);
2156 }
2157}
2158
2159enum fnc_state { s_DIR, s_SLASH, s_BASE, s_TRAILING };
2160enum fnc_type { t_PATH, t_ITEM };
2161
2162/* Compare the names of two file_struct entities, similar to how strcmp()
2163 * would do if it were operating on the joined strings.
2164 *
2165 * Some differences beginning with protocol_version 29: (1) directory names
2166 * are compared with an assumed trailing slash so that they compare in a
2167 * way that would cause them to sort immediately prior to any content they
2168 * may have; (2) a directory of any name compares after a non-directory of
2169 * any name at the same depth; (3) a directory with name "." compares prior
2170 * to anything else. These changes mean that a directory and a non-dir
2171 * with the same name will not compare as equal (protocol_version >= 29).
2172 *
2173 * The dirname component can be an empty string, but the basename component
2174 * cannot (and never is in the current codebase). The basename component
2175 * may be NULL (for a removed item), in which case it is considered to be
2176 * after any existing item. */
2177int f_name_cmp(struct file_struct *f1, struct file_struct *f2)
2178{
2179 int dif;
2180 const uchar *c1, *c2;
2181 enum fnc_state state1, state2;
2182 enum fnc_type type1, type2;
2183 enum fnc_type t_path = protocol_version >= 29 ? t_PATH : t_ITEM;
2184
2185 if (!f1 || !F_IS_ACTIVE(f1)) {
2186 if (!f2 || !F_IS_ACTIVE(f2))
2187 return 0;
2188 return -1;
2189 }
2190 if (!f2 || !F_IS_ACTIVE(f2))
2191 return 1;
2192
2193 c1 = (uchar*)f1->dirname;
2194 c2 = (uchar*)f2->dirname;
2195 if (c1 == c2)
2196 c1 = c2 = NULL;
2197 if (!c1) {
2198 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2199 c1 = (const uchar*)f1->basename;
2200 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2201 type1 = t_ITEM;
2202 state1 = s_TRAILING;
2203 c1 = (uchar*)"";
2204 } else
2205 state1 = s_BASE;
2206 } else {
2207 type1 = t_path;
2208 state1 = s_DIR;
2209 }
2210 if (!c2) {
2211 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2212 c2 = (const uchar*)f2->basename;
2213 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2214 type2 = t_ITEM;
2215 state2 = s_TRAILING;
2216 c2 = (uchar*)"";
2217 } else
2218 state2 = s_BASE;
2219 } else {
2220 type2 = t_path;
2221 state2 = s_DIR;
2222 }
2223
2224 if (type1 != type2)
2225 return type1 == t_PATH ? 1 : -1;
2226
2227 do {
2228 if (!*c1) {
2229 switch (state1) {
2230 case s_DIR:
2231 state1 = s_SLASH;
2232 c1 = (uchar*)"/";
2233 break;
2234 case s_SLASH:
2235 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2236 c1 = (const uchar*)f1->basename;
2237 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2238 type1 = t_ITEM;
2239 state1 = s_TRAILING;
2240 c1 = (uchar*)"";
2241 } else
2242 state1 = s_BASE;
2243 break;
2244 case s_BASE:
2245 state1 = s_TRAILING;
2246 if (type1 == t_PATH) {
2247 c1 = (uchar*)"/";
2248 break;
2249 }
2250 /* FALL THROUGH */
2251 case s_TRAILING:
2252 type1 = t_ITEM;
2253 break;
2254 }
2255 if (*c2 && type1 != type2)
2256 return type1 == t_PATH ? 1 : -1;
2257 }
2258 if (!*c2) {
2259 switch (state2) {
2260 case s_DIR:
2261 state2 = s_SLASH;
2262 c2 = (uchar*)"/";
2263 break;
2264 case s_SLASH:
2265 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2266 c2 = (const uchar*)f2->basename;
2267 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2268 type2 = t_ITEM;
2269 state2 = s_TRAILING;
2270 c2 = (uchar*)"";
2271 } else
2272 state2 = s_BASE;
2273 break;
2274 case s_BASE:
2275 state2 = s_TRAILING;
2276 if (type2 == t_PATH) {
2277 c2 = (uchar*)"/";
2278 break;
2279 }
2280 /* FALL THROUGH */
2281 case s_TRAILING:
2282 if (!*c1)
2283 return 0;
2284 type2 = t_ITEM;
2285 break;
2286 }
2287 if (type1 != type2)
2288 return type1 == t_PATH ? 1 : -1;
2289 }
2290 } while ((dif = (int)*c1++ - (int)*c2++) == 0);
2291
2292 return dif;
2293}
2294
2295char *f_name_buf(void)
2296{
2297 static char names[5][MAXPATHLEN];
2298 static unsigned int n;
2299
2300 n = (n + 1) % (sizeof names / sizeof names[0]);
2301
2302 return names[n];
2303}
2304
2305/* Return a copy of the full filename of a flist entry, using the indicated
2306 * buffer or one of 5 static buffers if fbuf is NULL. No size-checking is
2307 * done because we checked the size when creating the file_struct entry.
2308 */
2309char *f_name(struct file_struct *f, char *fbuf)
2310{
2311 if (!f || !F_IS_ACTIVE(f))
2312 return NULL;
2313
2314 if (!fbuf)
2315 fbuf = f_name_buf();
2316
2317 if (f->dirname) {
2318 int len = strlen(f->dirname);
2319 memcpy(fbuf, f->dirname, len);
2320 fbuf[len] = '/';
2321 strlcpy(fbuf + len + 1, f->basename, MAXPATHLEN - (len + 1));
2322 } else
2323 strlcpy(fbuf, f->basename, MAXPATHLEN);
2324
2325 return fbuf;
2326}
2327
2328/* Do a non-recursive scan of the named directory, possibly ignoring all
2329 * exclude rules except for the daemon's. If "dlen" is >=0, it is the length
2330 * of the dirname string, and also indicates that "dirname" is a MAXPATHLEN
2331 * buffer (the functions we call will append names onto the end, but the old
2332 * dir value will be restored on exit). */
2333struct file_list *get_dirlist(char *dirname, int dlen, int ignore_filter_rules)
2334{
2335 struct file_list *dirlist;
2336 char dirbuf[MAXPATHLEN];
2337 int save_recurse = recurse;
2338 int save_xfer_dirs = xfer_dirs;
2339
2340 if (dlen < 0) {
2341 dlen = strlcpy(dirbuf, dirname, MAXPATHLEN);
2342 if (dlen >= MAXPATHLEN)
2343 return NULL;
2344 dirname = dirbuf;
2345 }
2346
2347 dirlist = flist_new(FLIST_TEMP, "get_dirlist");
2348
2349 recurse = 0;
2350 xfer_dirs = 1;
2351 send_directory(ignore_filter_rules ? -2 : -1, dirlist, -1, dirname, dlen, 0);
2352 xfer_dirs = save_xfer_dirs;
2353 recurse = save_recurse;
2354 if (do_progress)
2355 flist_count_offset += dirlist->count;
2356
2357 clean_flist(dirlist, 0, 0);
2358
2359 if (verbose > 3)
2360 output_flist(dirlist);
2361
2362 return dirlist;
2363}