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