Preparing for release of 3.0.1pre1
[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-2008 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 3 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, visit the http://fsf.org website.
21 */
22
23#include "rsync.h"
24#include "ifuncs.h"
25#include "rounding.h"
26#include "io.h"
27
28extern int verbose;
29extern int am_root;
30extern int am_server;
31extern int am_daemon;
32extern int am_sender;
33extern int am_generator;
34extern int inc_recurse;
35extern int do_progress;
36extern int always_checksum;
37extern int module_id;
38extern int ignore_errors;
39extern int numeric_ids;
40extern int recurse;
41extern int use_qsort;
42extern int xfer_dirs;
43extern int filesfrom_fd;
44extern int one_file_system;
45extern int copy_dirlinks;
46extern int keep_dirlinks;
47extern int preserve_uid;
48extern int preserve_gid;
49extern int preserve_acls;
50extern int preserve_xattrs;
51extern int preserve_links;
52extern int preserve_hard_links;
53extern int preserve_devices;
54extern int preserve_specials;
55extern int uid_ndx;
56extern int gid_ndx;
57extern int eol_nulls;
58extern int relative_paths;
59extern int implied_dirs;
60extern int file_extra_cnt;
61extern int ignore_perishable;
62extern int non_perishable_cnt;
63extern int prune_empty_dirs;
64extern int copy_links;
65extern int copy_unsafe_links;
66extern int protocol_version;
67extern int sanitize_paths;
68extern int munge_symlinks;
69extern int need_unsorted_flist;
70extern int unsort_ndx;
71extern struct stats stats;
72extern char *filesfrom_host;
73
74extern char curr_dir[MAXPATHLEN];
75
76extern struct chmod_mode_struct *chmod_modes;
77
78extern struct filter_list_struct filter_list;
79extern struct filter_list_struct daemon_filter_list;
80
81#ifdef ICONV_OPTION
82extern int filesfrom_convert;
83extern iconv_t ic_send, ic_recv;
84#endif
85
86#define PTR_SIZE (sizeof (struct file_struct *))
87
88int io_error;
89int checksum_len;
90dev_t filesystem_dev; /* used to implement -x */
91
92struct file_list *cur_flist, *first_flist, *dir_flist;
93int send_dir_ndx = -1, send_dir_depth = -1;
94int flist_cnt = 0; /* how many (non-tmp) file list objects exist */
95int file_total = 0; /* total of all active items over all file-lists */
96int flist_eof = 0; /* all the file-lists are now known */
97
98#define NORMAL_NAME 0
99#define SLASH_ENDING_NAME 1
100#define DOT_NAME 2
101
102/* Starting from protocol version 26, we always use 64-bit ino_t and dev_t
103 * internally, even if this platform does not allow files to have 64-bit inums.
104 * The only exception is if we're on a platform with no 64-bit type at all.
105 *
106 * Because we use read_longint() to get these off the wire, if you transfer
107 * devices or (for protocols < 30) hardlinks with dev or inum > 2**32 to a
108 * machine with no 64-bit types then you will get an overflow error.
109 *
110 * Note that if you transfer devices from a 64-bit-devt machine (say, Solaris)
111 * to a 32-bit-devt machine (say, Linux-2.2/x86) then the device numbers will
112 * be truncated. But it's a kind of silly thing to do anyhow. */
113
114/* The tmp_* vars are used as a cache area by make_file() to store data
115 * that the sender doesn't need to remember in its file list. The data
116 * will survive just long enough to be used by send_file_entry(). */
117static dev_t tmp_rdev;
118#ifdef SUPPORT_HARD_LINKS
119static int64 tmp_dev, tmp_ino;
120#endif
121static char tmp_sum[MAX_DIGEST_LEN];
122
123static char empty_sum[MAX_DIGEST_LEN];
124static int flist_count_offset; /* for --delete --progress */
125static int dir_count = 0;
126
127static void flist_sort_and_clean(struct file_list *flist, int strip_root);
128static void output_flist(struct file_list *flist);
129
130void init_flist(void)
131{
132 if (verbose > 4) {
133 rprintf(FINFO, "FILE_STRUCT_LEN=%d, EXTRA_LEN=%d\n",
134 (int)FILE_STRUCT_LEN, (int)EXTRA_LEN);
135 }
136 checksum_len = protocol_version < 21 ? 2
137 : protocol_version < 30 ? MD4_DIGEST_LEN
138 : MD5_DIGEST_LEN;
139}
140
141static int show_filelist_p(void)
142{
143 return verbose && xfer_dirs && !am_server && !inc_recurse;
144}
145
146static void start_filelist_progress(char *kind)
147{
148 rprintf(FCLIENT, "%s ... ", kind);
149 if (verbose > 1 || do_progress)
150 rprintf(FCLIENT, "\n");
151 rflush(FINFO);
152}
153
154static void emit_filelist_progress(int count)
155{
156 rprintf(FCLIENT, " %d files...\r", count);
157}
158
159static void maybe_emit_filelist_progress(int count)
160{
161 if (do_progress && show_filelist_p() && (count % 100) == 0)
162 emit_filelist_progress(count);
163}
164
165static void finish_filelist_progress(const struct file_list *flist)
166{
167 if (do_progress) {
168 /* This overwrites the progress line */
169 rprintf(FINFO, "%d file%sto consider\n",
170 flist->used, flist->used == 1 ? " " : "s ");
171 } else
172 rprintf(FINFO, "done\n");
173}
174
175void show_flist_stats(void)
176{
177 /* Nothing yet */
178}
179
180/* Stat either a symlink or its referent, depending on the settings of
181 * copy_links, copy_unsafe_links, etc. Returns -1 on error, 0 on success.
182 *
183 * If path is the name of a symlink, then the linkbuf buffer (which must hold
184 * MAXPATHLEN chars) will be set to the symlink's target string.
185 *
186 * The stat structure pointed to by stp will contain information about the
187 * link or the referent as appropriate, if they exist. */
188static int readlink_stat(const char *path, STRUCT_STAT *stp, char *linkbuf)
189{
190#ifdef SUPPORT_LINKS
191 if (link_stat(path, stp, copy_dirlinks) < 0)
192 return -1;
193 if (S_ISLNK(stp->st_mode)) {
194 int llen = readlink(path, linkbuf, MAXPATHLEN - 1);
195 if (llen < 0)
196 return -1;
197 linkbuf[llen] = '\0';
198 if (copy_unsafe_links && unsafe_symlink(linkbuf, path)) {
199 if (verbose > 1) {
200 rprintf(FINFO,"copying unsafe symlink \"%s\" -> \"%s\"\n",
201 path, linkbuf);
202 }
203 return x_stat(path, stp, NULL);
204 }
205 if (munge_symlinks && am_sender && llen > SYMLINK_PREFIX_LEN
206 && strncmp(linkbuf, SYMLINK_PREFIX, SYMLINK_PREFIX_LEN) == 0) {
207 memmove(linkbuf, linkbuf + SYMLINK_PREFIX_LEN,
208 llen - SYMLINK_PREFIX_LEN + 1);
209 }
210 }
211 return 0;
212#else
213 return x_stat(path, stp, NULL);
214#endif
215}
216
217int link_stat(const char *path, STRUCT_STAT *stp, int follow_dirlinks)
218{
219#ifdef SUPPORT_LINKS
220 if (copy_links)
221 return x_stat(path, stp, NULL);
222 if (x_lstat(path, stp, NULL) < 0)
223 return -1;
224 if (follow_dirlinks && S_ISLNK(stp->st_mode)) {
225 STRUCT_STAT st;
226 if (x_stat(path, &st, NULL) == 0 && S_ISDIR(st.st_mode))
227 *stp = st;
228 }
229 return 0;
230#else
231 return x_stat(path, stp, NULL);
232#endif
233}
234
235static inline int is_daemon_excluded(const char *fname, int is_dir)
236{
237 if (daemon_filter_list.head
238 && check_filter(&daemon_filter_list, FLOG, fname, is_dir) < 0) {
239 errno = ENOENT;
240 return 1;
241 }
242 return 0;
243}
244
245static inline int path_is_daemon_excluded(char *path, int ignore_filename)
246{
247 if (daemon_filter_list.head && path) {
248 char *slash = path;
249
250 while ((slash = strchr(slash+1, '/')) != NULL) {
251 int ret;
252 *slash = '\0';
253 ret = check_filter(&daemon_filter_list, FLOG, path, 1);
254 *slash = '/';
255 if (ret < 0) {
256 errno = ENOENT;
257 return 1;
258 }
259 }
260
261 if (!ignore_filename
262 && check_filter(&daemon_filter_list, FLOG, path, 1) < 0) {
263 errno = ENOENT;
264 return 1;
265 }
266 }
267
268 return 0;
269}
270
271/* This function is used to check if a file should be included/excluded
272 * from the list of files based on its name and type etc. The value of
273 * filter_level is set to either SERVER_FILTERS or ALL_FILTERS. */
274static int is_excluded(const char *fname, int is_dir, int filter_level)
275{
276#if 0 /* This currently never happens, so avoid a useless compare. */
277 if (filter_level == NO_FILTERS)
278 return 0;
279#endif
280 if (fname) {
281 /* never exclude '.', even if somebody does --exclude '*' */
282 if (fname[0] == '.' && !fname[1])
283 return 0;
284 /* Handle the -R version of the '.' dir. */
285 if (fname[0] == '/') {
286 int len = strlen(fname);
287 if (fname[len-1] == '.' && fname[len-2] == '/')
288 return 0;
289 }
290 }
291 if (is_daemon_excluded(fname, is_dir))
292 return 1;
293 if (filter_level != ALL_FILTERS)
294 return 0;
295 if (filter_list.head
296 && check_filter(&filter_list, FINFO, fname, is_dir) < 0)
297 return 1;
298 return 0;
299}
300
301static void send_directory(int f, struct file_list *flist,
302 char *fbuf, int len, int flags);
303
304static const char *pathname, *orig_dir;
305static int pathname_len;
306
307
308/* Make sure flist can hold at least flist->used + extra entries. */
309static void flist_expand(struct file_list *flist, int extra)
310{
311 struct file_struct **new_ptr;
312
313 if (flist->used + extra <= flist->malloced)
314 return;
315
316 if (flist->malloced < FLIST_START)
317 flist->malloced = FLIST_START;
318 else if (flist->malloced >= FLIST_LINEAR)
319 flist->malloced += FLIST_LINEAR;
320 else
321 flist->malloced *= 2;
322
323 /* In case count jumped or we are starting the list
324 * with a known size just set it. */
325 if (flist->malloced < flist->used + extra)
326 flist->malloced = flist->used + extra;
327
328 new_ptr = realloc_array(flist->files, struct file_struct *,
329 flist->malloced);
330
331 if (verbose >= 2 && flist->malloced != FLIST_START) {
332 rprintf(FCLIENT, "[%s] expand file_list pointer array to %.0f bytes, did%s move\n",
333 who_am_i(),
334 (double)sizeof flist->files[0] * flist->malloced,
335 (new_ptr == flist->files) ? " not" : "");
336 }
337
338 flist->files = new_ptr;
339
340 if (!flist->files)
341 out_of_memory("flist_expand");
342}
343
344static void flist_done_allocating(struct file_list *flist)
345{
346 void *ptr = pool_boundary(flist->file_pool, 8*1024);
347 if (flist->pool_boundary == ptr)
348 flist->pool_boundary = NULL; /* list didn't use any pool memory */
349 else
350 flist->pool_boundary = ptr;
351}
352
353int push_pathname(const char *dir, int len)
354{
355 if (dir == pathname)
356 return 1;
357
358 if (!orig_dir)
359 orig_dir = strdup(curr_dir);
360
361 if (pathname && !pop_dir(orig_dir)) {
362 rsyserr(FERROR, errno, "pop_dir %s failed",
363 full_fname(orig_dir));
364 exit_cleanup(RERR_FILESELECT);
365 }
366
367 if (dir && !push_dir(dir, 0)) {
368 io_error |= IOERR_GENERAL;
369 rsyserr(FERROR, errno, "push_dir %s failed in %s",
370 full_fname(dir), curr_dir);
371 return 0;
372 }
373
374 pathname = dir;
375 pathname_len = len >= 0 ? len : dir ? (int)strlen(dir) : 0;
376
377 return 1;
378}
379
380static void send_file_entry(int f, struct file_struct *file, int ndx, int first_ndx)
381{
382 static time_t modtime;
383 static mode_t mode;
384#ifdef SUPPORT_HARD_LINKS
385 static int64 dev;
386#endif
387 static dev_t rdev;
388 static uint32 rdev_major;
389 static uid_t uid;
390 static gid_t gid;
391 static const char *user_name, *group_name;
392 static char lastname[MAXPATHLEN];
393 char fname[MAXPATHLEN];
394 int first_hlink_ndx = -1;
395 int l1, l2;
396 int xflags;
397
398#ifdef ICONV_OPTION
399 if (ic_send != (iconv_t)-1) {
400 xbuf outbuf, inbuf;
401
402 INIT_CONST_XBUF(outbuf, fname);
403
404 if (file->dirname) {
405 INIT_XBUF_STRLEN(inbuf, (char*)file->dirname);
406 outbuf.size -= 2; /* Reserve room for '/' & 1 more char. */
407 if (iconvbufs(ic_send, &inbuf, &outbuf, 0) < 0)
408 goto convert_error;
409 outbuf.size += 2;
410 outbuf.buf[outbuf.len++] = '/';
411 }
412
413 INIT_XBUF_STRLEN(inbuf, (char*)file->basename);
414 if (iconvbufs(ic_send, &inbuf, &outbuf, 0) < 0) {
415 convert_error:
416 io_error |= IOERR_GENERAL;
417 rprintf(FINFO,
418 "[%s] cannot convert filename: %s (%s)\n",
419 who_am_i(), f_name(file, fname), strerror(errno));
420 return;
421 }
422 outbuf.buf[outbuf.len] = '\0';
423 } else
424#endif
425 f_name(file, fname);
426
427 /* Initialize starting value of xflags. */
428 if (protocol_version >= 30 && S_ISDIR(file->mode)) {
429 dir_count++;
430 if (file->flags & FLAG_CONTENT_DIR)
431 xflags = file->flags & FLAG_TOP_DIR;
432 else if (file->flags & FLAG_IMPLIED_DIR)
433 xflags = XMIT_TOP_DIR | XMIT_NO_CONTENT_DIR;
434 else
435 xflags = XMIT_NO_CONTENT_DIR;
436 } else
437 xflags = file->flags & FLAG_TOP_DIR; /* FLAG_TOP_DIR == XMIT_TOP_DIR */
438
439 if (file->mode == mode)
440 xflags |= XMIT_SAME_MODE;
441 else
442 mode = file->mode;
443
444 if ((preserve_devices && IS_DEVICE(mode))
445 || (preserve_specials && IS_SPECIAL(mode))) {
446 if (protocol_version < 28) {
447 if (tmp_rdev == rdev)
448 xflags |= XMIT_SAME_RDEV_pre28;
449 else
450 rdev = tmp_rdev;
451 } else {
452 rdev = tmp_rdev;
453 if ((uint32)major(rdev) == rdev_major)
454 xflags |= XMIT_SAME_RDEV_MAJOR;
455 else
456 rdev_major = major(rdev);
457 if (protocol_version < 30 && (uint32)minor(rdev) <= 0xFFu)
458 xflags |= XMIT_RDEV_MINOR_8_pre30;
459 }
460 } else if (protocol_version < 28)
461 rdev = MAKEDEV(0, 0);
462 if (preserve_uid) {
463 if ((uid_t)F_OWNER(file) == uid && *lastname)
464 xflags |= XMIT_SAME_UID;
465 else {
466 uid = F_OWNER(file);
467 if (!numeric_ids) {
468 user_name = add_uid(uid);
469 if (inc_recurse && user_name)
470 xflags |= XMIT_USER_NAME_FOLLOWS;
471 }
472 }
473 }
474 if (preserve_gid) {
475 if ((gid_t)F_GROUP(file) == gid && *lastname)
476 xflags |= XMIT_SAME_GID;
477 else {
478 gid = F_GROUP(file);
479 if (!numeric_ids) {
480 group_name = add_gid(gid);
481 if (inc_recurse && group_name)
482 xflags |= XMIT_GROUP_NAME_FOLLOWS;
483 }
484 }
485 }
486 if (file->modtime == modtime)
487 xflags |= XMIT_SAME_TIME;
488 else
489 modtime = file->modtime;
490
491#ifdef SUPPORT_HARD_LINKS
492 if (tmp_dev != 0) {
493 if (protocol_version >= 30) {
494 struct ht_int64_node *np = idev_find(tmp_dev, tmp_ino);
495 first_hlink_ndx = (int32)(long)np->data - 1;
496 if (first_hlink_ndx < 0) {
497 np->data = (void*)(long)(first_ndx + ndx + 1);
498 xflags |= XMIT_HLINK_FIRST;
499 }
500 xflags |= XMIT_HLINKED;
501 } else {
502 if (tmp_dev == dev) {
503 if (protocol_version >= 28)
504 xflags |= XMIT_SAME_DEV_pre30;
505 } else
506 dev = tmp_dev;
507 xflags |= XMIT_HLINKED;
508 }
509 }
510#endif
511
512 for (l1 = 0;
513 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
514 l1++) {}
515 l2 = strlen(fname+l1);
516
517 if (l1 > 0)
518 xflags |= XMIT_SAME_NAME;
519 if (l2 > 255)
520 xflags |= XMIT_LONG_NAME;
521
522 /* We must make sure we don't send a zero flag byte or the
523 * other end will terminate the flist transfer. Note that
524 * the use of XMIT_TOP_DIR on a non-dir has no meaning, so
525 * it's harmless way to add a bit to the first flag byte. */
526 if (protocol_version >= 28) {
527 if (!xflags && !S_ISDIR(mode))
528 xflags |= XMIT_TOP_DIR;
529 if ((xflags & 0xFF00) || !xflags) {
530 xflags |= XMIT_EXTENDED_FLAGS;
531 write_shortint(f, xflags);
532 } else
533 write_byte(f, xflags);
534 } else {
535 if (!(xflags & 0xFF))
536 xflags |= S_ISDIR(mode) ? XMIT_LONG_NAME : XMIT_TOP_DIR;
537 write_byte(f, xflags);
538 }
539 if (xflags & XMIT_SAME_NAME)
540 write_byte(f, l1);
541 if (xflags & XMIT_LONG_NAME)
542 write_varint30(f, l2);
543 else
544 write_byte(f, l2);
545 write_buf(f, fname + l1, l2);
546
547 if (first_hlink_ndx >= 0) {
548 write_varint(f, first_hlink_ndx);
549 if (first_hlink_ndx >= first_ndx)
550 goto the_end;
551 }
552
553 write_varlong30(f, F_LENGTH(file), 3);
554 if (!(xflags & XMIT_SAME_TIME)) {
555 if (protocol_version >= 30)
556 write_varlong(f, modtime, 4);
557 else
558 write_int(f, modtime);
559 }
560 if (!(xflags & XMIT_SAME_MODE))
561 write_int(f, to_wire_mode(mode));
562 if (preserve_uid && !(xflags & XMIT_SAME_UID)) {
563 if (protocol_version < 30)
564 write_int(f, uid);
565 else {
566 write_varint(f, uid);
567 if (xflags & XMIT_USER_NAME_FOLLOWS) {
568 int len = strlen(user_name);
569 write_byte(f, len);
570 write_buf(f, user_name, len);
571 }
572 }
573 }
574 if (preserve_gid && !(xflags & XMIT_SAME_GID)) {
575 if (protocol_version < 30)
576 write_int(f, gid);
577 else {
578 write_varint(f, gid);
579 if (xflags & XMIT_GROUP_NAME_FOLLOWS) {
580 int len = strlen(group_name);
581 write_byte(f, len);
582 write_buf(f, group_name, len);
583 }
584 }
585 }
586 if ((preserve_devices && IS_DEVICE(mode))
587 || (preserve_specials && IS_SPECIAL(mode))) {
588 if (protocol_version < 28) {
589 if (!(xflags & XMIT_SAME_RDEV_pre28))
590 write_int(f, (int)rdev);
591 } else {
592 if (!(xflags & XMIT_SAME_RDEV_MAJOR))
593 write_varint30(f, major(rdev));
594 if (protocol_version >= 30)
595 write_varint(f, minor(rdev));
596 else if (xflags & XMIT_RDEV_MINOR_8_pre30)
597 write_byte(f, minor(rdev));
598 else
599 write_int(f, minor(rdev));
600 }
601 }
602
603#ifdef SUPPORT_LINKS
604 if (preserve_links && S_ISLNK(mode)) {
605 const char *sl = F_SYMLINK(file);
606 int len = strlen(sl);
607 write_varint30(f, len);
608 write_buf(f, sl, len);
609 }
610#endif
611
612#ifdef SUPPORT_HARD_LINKS
613 if (tmp_dev != 0 && protocol_version < 30) {
614 if (protocol_version < 26) {
615 /* 32-bit dev_t and ino_t */
616 write_int(f, (int32)dev);
617 write_int(f, (int32)tmp_ino);
618 } else {
619 /* 64-bit dev_t and ino_t */
620 if (!(xflags & XMIT_SAME_DEV_pre30))
621 write_longint(f, dev);
622 write_longint(f, tmp_ino);
623 }
624 }
625#endif
626
627 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
628 const char *sum;
629 if (S_ISREG(mode))
630 sum = tmp_sum;
631 else {
632 /* Prior to 28, we sent a useless set of nulls. */
633 sum = empty_sum;
634 }
635 write_buf(f, sum, checksum_len);
636 }
637
638 the_end:
639 strlcpy(lastname, fname, MAXPATHLEN);
640
641 if (S_ISREG(mode) || S_ISLNK(mode))
642 stats.total_size += F_LENGTH(file);
643}
644
645static struct file_struct *recv_file_entry(struct file_list *flist,
646 int xflags, int f)
647{
648 static int64 modtime;
649 static mode_t mode;
650#ifdef SUPPORT_HARD_LINKS
651 static int64 dev;
652#endif
653 static dev_t rdev;
654 static uint32 rdev_major;
655 static uid_t uid;
656 static gid_t gid;
657 static uint16 gid_flags;
658 static char lastname[MAXPATHLEN], *lastdir;
659 static int lastdir_depth, lastdir_len = -1;
660 static unsigned int del_hier_name_len = 0;
661 static int in_del_hier = 0;
662 char thisname[MAXPATHLEN];
663 unsigned int l1 = 0, l2 = 0;
664 int alloc_len, basename_len, linkname_len;
665 int extra_len = file_extra_cnt * EXTRA_LEN;
666 int first_hlink_ndx = -1;
667 OFF_T file_length;
668 const char *basename;
669 struct file_struct *file;
670 alloc_pool_t *pool;
671 char *bp;
672
673 if (xflags & XMIT_SAME_NAME)
674 l1 = read_byte(f);
675
676 if (xflags & XMIT_LONG_NAME)
677 l2 = read_varint30(f);
678 else
679 l2 = read_byte(f);
680
681 if (l2 >= MAXPATHLEN - l1) {
682 rprintf(FERROR,
683 "overflow: xflags=0x%x l1=%d l2=%d lastname=%s [%s]\n",
684 xflags, l1, l2, lastname, who_am_i());
685 overflow_exit("recv_file_entry");
686 }
687
688 strlcpy(thisname, lastname, l1 + 1);
689 read_sbuf(f, &thisname[l1], l2);
690 thisname[l1 + l2] = 0;
691
692 /* Abuse basename_len for a moment... */
693 basename_len = strlcpy(lastname, thisname, MAXPATHLEN);
694
695#ifdef ICONV_OPTION
696 if (ic_recv != (iconv_t)-1) {
697 xbuf outbuf, inbuf;
698
699 INIT_CONST_XBUF(outbuf, thisname);
700 INIT_XBUF(inbuf, lastname, basename_len, -1);
701
702 if (iconvbufs(ic_recv, &inbuf, &outbuf, 0) < 0) {
703 io_error |= IOERR_GENERAL;
704 rprintf(FINFO,
705 "[%s] cannot convert filename: %s (%s)\n",
706 who_am_i(), lastname, strerror(errno));
707 outbuf.len = 0;
708 }
709 outbuf.buf[outbuf.len] = '\0';
710 }
711#endif
712
713 clean_fname(thisname, 0);
714
715 if (sanitize_paths)
716 sanitize_path(thisname, thisname, "", 0, SP_DEFAULT);
717
718 if ((basename = strrchr(thisname, '/')) != NULL) {
719 int len = basename++ - thisname;
720 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
721 lastdir = new_array(char, len + 1);
722 memcpy(lastdir, thisname, len);
723 lastdir[len] = '\0';
724 lastdir_len = len;
725 lastdir_depth = count_dir_elements(lastdir);
726 }
727 } else
728 basename = thisname;
729 basename_len = strlen(basename) + 1; /* count the '\0' */
730
731#ifdef SUPPORT_HARD_LINKS
732 if (protocol_version >= 30
733 && BITS_SETnUNSET(xflags, XMIT_HLINKED, XMIT_HLINK_FIRST)) {
734 first_hlink_ndx = read_varint(f);
735 if (first_hlink_ndx < 0 || first_hlink_ndx >= flist->ndx_start + flist->used) {
736 rprintf(FERROR,
737 "hard-link reference out of range: %d (%d)\n",
738 first_hlink_ndx, flist->ndx_start + flist->used);
739 exit_cleanup(RERR_PROTOCOL);
740 }
741 if (first_hlink_ndx >= flist->ndx_start) {
742 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
743 file_length = F_LENGTH(first);
744 modtime = first->modtime;
745 mode = first->mode;
746 if (preserve_uid)
747 uid = F_OWNER(first);
748 if (preserve_gid)
749 gid = F_GROUP(first);
750 if ((preserve_devices && IS_DEVICE(mode))
751 || (preserve_specials && IS_SPECIAL(mode))) {
752 uint32 *devp = F_RDEV_P(first);
753 rdev = MAKEDEV(DEV_MAJOR(devp), DEV_MINOR(devp));
754 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
755 }
756 if (preserve_links && S_ISLNK(mode))
757 linkname_len = strlen(F_SYMLINK(first)) + 1;
758 else
759 linkname_len = 0;
760 goto create_object;
761 }
762 }
763#endif
764
765 file_length = read_varlong30(f, 3);
766 if (!(xflags & XMIT_SAME_TIME)) {
767 if (protocol_version >= 30) {
768 modtime = read_varlong(f, 4);
769#if SIZEOF_TIME_T < SIZEOF_INT64
770 if (!am_generator && (int64)(time_t)modtime != modtime) {
771 rprintf(FERROR_XFER,
772 "Time value of %s truncated on receiver.\n",
773 lastname);
774 }
775#endif
776 } else
777 modtime = read_int(f);
778 }
779 if (!(xflags & XMIT_SAME_MODE))
780 mode = from_wire_mode(read_int(f));
781
782 if (chmod_modes && !S_ISLNK(mode))
783 mode = tweak_mode(mode, chmod_modes);
784
785 if (preserve_uid && !(xflags & XMIT_SAME_UID)) {
786 if (protocol_version < 30)
787 uid = (uid_t)read_int(f);
788 else {
789 uid = (uid_t)read_varint(f);
790 if (xflags & XMIT_USER_NAME_FOLLOWS)
791 uid = recv_user_name(f, uid);
792 else if (inc_recurse && am_root && !numeric_ids)
793 uid = match_uid(uid);
794 }
795 }
796 if (preserve_gid && !(xflags & XMIT_SAME_GID)) {
797 if (protocol_version < 30)
798 gid = (gid_t)read_int(f);
799 else {
800 gid = (gid_t)read_varint(f);
801 gid_flags = 0;
802 if (xflags & XMIT_GROUP_NAME_FOLLOWS)
803 gid = recv_group_name(f, gid, &gid_flags);
804 else if (inc_recurse && (!am_root || !numeric_ids))
805 gid = match_gid(gid, &gid_flags);
806 }
807 }
808
809 if ((preserve_devices && IS_DEVICE(mode))
810 || (preserve_specials && IS_SPECIAL(mode))) {
811 if (protocol_version < 28) {
812 if (!(xflags & XMIT_SAME_RDEV_pre28))
813 rdev = (dev_t)read_int(f);
814 } else {
815 uint32 rdev_minor;
816 if (!(xflags & XMIT_SAME_RDEV_MAJOR))
817 rdev_major = read_varint30(f);
818 if (protocol_version >= 30)
819 rdev_minor = read_varint(f);
820 else if (xflags & XMIT_RDEV_MINOR_8_pre30)
821 rdev_minor = read_byte(f);
822 else
823 rdev_minor = read_int(f);
824 rdev = MAKEDEV(rdev_major, rdev_minor);
825 }
826 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
827 file_length = 0;
828 } else if (protocol_version < 28)
829 rdev = MAKEDEV(0, 0);
830
831#ifdef SUPPORT_LINKS
832 if (preserve_links && S_ISLNK(mode)) {
833 linkname_len = read_varint30(f) + 1; /* count the '\0' */
834 if (linkname_len <= 0 || linkname_len > MAXPATHLEN) {
835 rprintf(FERROR, "overflow: linkname_len=%d\n",
836 linkname_len - 1);
837 overflow_exit("recv_file_entry");
838 }
839 if (munge_symlinks)
840 linkname_len += SYMLINK_PREFIX_LEN;
841 }
842 else
843#endif
844 linkname_len = 0;
845
846#ifdef SUPPORT_HARD_LINKS
847 create_object:
848 if (preserve_hard_links) {
849 if (protocol_version < 28 && S_ISREG(mode))
850 xflags |= XMIT_HLINKED;
851 if (xflags & XMIT_HLINKED)
852 extra_len += (inc_recurse+1) * EXTRA_LEN;
853 }
854#endif
855
856#ifdef SUPPORT_ACLS
857 /* Directories need an extra int32 for the default ACL. */
858 if (preserve_acls && S_ISDIR(mode))
859 extra_len += EXTRA_LEN;
860#endif
861
862 if (always_checksum && S_ISREG(mode))
863 extra_len += SUM_EXTRA_CNT * EXTRA_LEN;
864
865 if (file_length > 0xFFFFFFFFu && S_ISREG(mode))
866 extra_len += EXTRA_LEN;
867
868 if (inc_recurse && S_ISDIR(mode)) {
869 if (one_file_system) {
870 /* Room to save the dir's device for -x */
871 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
872 }
873 pool = dir_flist->file_pool;
874 } else
875 pool = flist->file_pool;
876
877#if EXTRA_ROUNDING > 0
878 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
879 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
880#endif
881
882 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
883 + linkname_len;
884 bp = pool_alloc(pool, alloc_len, "recv_file_entry");
885
886 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
887 bp += extra_len;
888 file = (struct file_struct *)bp;
889 bp += FILE_STRUCT_LEN;
890
891 memcpy(bp, basename, basename_len);
892
893#ifdef SUPPORT_HARD_LINKS
894 if (xflags & XMIT_HLINKED)
895 file->flags |= FLAG_HLINKED;
896#endif
897 file->modtime = (time_t)modtime;
898 file->len32 = (uint32)file_length;
899 if (file_length > 0xFFFFFFFFu && S_ISREG(mode)) {
900 file->flags |= FLAG_LENGTH64;
901 OPT_EXTRA(file, 0)->unum = (uint32)(file_length >> 32);
902 }
903 file->mode = mode;
904 if (preserve_uid)
905 F_OWNER(file) = uid;
906 if (preserve_gid) {
907 F_GROUP(file) = gid;
908 file->flags |= gid_flags;
909 }
910 if (unsort_ndx)
911 F_NDX(file) = flist->used + flist->ndx_start;
912
913 if (basename != thisname) {
914 file->dirname = lastdir;
915 F_DEPTH(file) = lastdir_depth + 1;
916 } else
917 F_DEPTH(file) = 1;
918
919 if (S_ISDIR(mode)) {
920 if (basename_len == 1+1 && *basename == '.') /* +1 for '\0' */
921 F_DEPTH(file)--;
922 if (protocol_version >= 30) {
923 if (!(xflags & XMIT_NO_CONTENT_DIR)) {
924 if (xflags & XMIT_TOP_DIR)
925 file->flags |= FLAG_TOP_DIR;
926 file->flags |= FLAG_CONTENT_DIR;
927 } else if (xflags & XMIT_TOP_DIR)
928 file->flags |= FLAG_IMPLIED_DIR;
929 } else if (xflags & XMIT_TOP_DIR) {
930 in_del_hier = recurse;
931 del_hier_name_len = F_DEPTH(file) == 0 ? 0 : l1 + l2;
932 if (relative_paths && del_hier_name_len > 2
933 && lastname[del_hier_name_len-1] == '.'
934 && lastname[del_hier_name_len-2] == '/')
935 del_hier_name_len -= 2;
936 file->flags |= FLAG_TOP_DIR | FLAG_CONTENT_DIR;
937 } else if (in_del_hier) {
938 if (!relative_paths || !del_hier_name_len
939 || (l1 >= del_hier_name_len
940 && lastname[del_hier_name_len] == '/'))
941 file->flags |= FLAG_CONTENT_DIR;
942 else
943 in_del_hier = 0;
944 }
945 }
946
947 if ((preserve_devices && IS_DEVICE(mode))
948 || (preserve_specials && IS_SPECIAL(mode))) {
949 uint32 *devp = F_RDEV_P(file);
950 DEV_MAJOR(devp) = major(rdev);
951 DEV_MINOR(devp) = minor(rdev);
952 }
953
954#ifdef SUPPORT_LINKS
955 if (linkname_len) {
956 bp += basename_len;
957 if (first_hlink_ndx >= flist->ndx_start) {
958 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
959 memcpy(bp, F_SYMLINK(first), linkname_len);
960 } else if (munge_symlinks) {
961 strlcpy(bp, SYMLINK_PREFIX, linkname_len);
962 bp += SYMLINK_PREFIX_LEN;
963 linkname_len -= SYMLINK_PREFIX_LEN;
964 read_sbuf(f, bp, linkname_len - 1);
965 } else {
966 read_sbuf(f, bp, linkname_len - 1);
967 if (sanitize_paths)
968 sanitize_path(bp, bp, "", lastdir_depth, SP_DEFAULT);
969 }
970 }
971#endif
972
973#ifdef SUPPORT_HARD_LINKS
974 if (preserve_hard_links && xflags & XMIT_HLINKED) {
975 if (protocol_version >= 30) {
976 if (xflags & XMIT_HLINK_FIRST) {
977 F_HL_GNUM(file) = flist->ndx_start + flist->used;
978 } else
979 F_HL_GNUM(file) = first_hlink_ndx;
980 } else {
981 static int32 cnt = 0;
982 struct ht_int64_node *np;
983 int64 ino;
984 int32 ndx;
985 if (protocol_version < 26) {
986 dev = read_int(f);
987 ino = read_int(f);
988 } else {
989 if (!(xflags & XMIT_SAME_DEV_pre30))
990 dev = read_longint(f);
991 ino = read_longint(f);
992 }
993 np = idev_find(dev, ino);
994 ndx = (int32)(long)np->data - 1;
995 if (ndx < 0) {
996 ndx = cnt++;
997 np->data = (void*)(long)cnt;
998 }
999 F_HL_GNUM(file) = ndx;
1000 }
1001 }
1002#endif
1003
1004 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
1005 if (S_ISREG(mode))
1006 bp = F_SUM(file);
1007 else {
1008 /* Prior to 28, we get a useless set of nulls. */
1009 bp = tmp_sum;
1010 }
1011 if (first_hlink_ndx >= flist->ndx_start) {
1012 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
1013 memcpy(bp, F_SUM(first), checksum_len);
1014 } else
1015 read_buf(f, bp, checksum_len);
1016 }
1017
1018#ifdef SUPPORT_ACLS
1019 if (preserve_acls && !S_ISLNK(mode))
1020 receive_acl(file, f);
1021#endif
1022#ifdef SUPPORT_XATTRS
1023 if (preserve_xattrs)
1024 receive_xattr(file, f );
1025#endif
1026
1027 if (S_ISREG(mode) || S_ISLNK(mode))
1028 stats.total_size += file_length;
1029
1030 return file;
1031}
1032
1033/* Create a file_struct for a named file by reading its stat() information
1034 * and performing extensive checks against global options.
1035 *
1036 * Returns a pointer to the new file struct, or NULL if there was an error
1037 * or this file should be excluded. */
1038struct file_struct *make_file(const char *fname, struct file_list *flist,
1039 STRUCT_STAT *stp, int flags, int filter_level)
1040{
1041 static char *lastdir;
1042 static int lastdir_len = -1;
1043 struct file_struct *file;
1044 char thisname[MAXPATHLEN];
1045 char linkname[MAXPATHLEN];
1046 int alloc_len, basename_len, linkname_len;
1047 int extra_len = file_extra_cnt * EXTRA_LEN;
1048 const char *basename;
1049 alloc_pool_t *pool;
1050 STRUCT_STAT st;
1051 char *bp;
1052
1053 if (strlcpy(thisname, fname, sizeof thisname) >= sizeof thisname) {
1054 rprintf(FINFO, "skipping overly long name: %s\n", fname);
1055 return NULL;
1056 }
1057 clean_fname(thisname, 0);
1058 if (sanitize_paths)
1059 sanitize_path(thisname, thisname, "", 0, SP_DEFAULT);
1060
1061 if (stp && S_ISDIR(stp->st_mode)) {
1062 st = *stp; /* Needed for "symlink/." with --relative. */
1063 *linkname = '\0'; /* make IBM code checker happy */
1064 } else if (readlink_stat(thisname, &st, linkname) != 0) {
1065 int save_errno = errno;
1066 /* See if file is excluded before reporting an error. */
1067 if (filter_level != NO_FILTERS
1068 && (is_excluded(thisname, 0, filter_level)
1069 || is_excluded(thisname, 1, filter_level))) {
1070 if (ignore_perishable && save_errno != ENOENT)
1071 non_perishable_cnt++;
1072 return NULL;
1073 }
1074 if (save_errno == ENOENT) {
1075#ifdef SUPPORT_LINKS
1076 /* When our options tell us to follow a symlink that
1077 * points nowhere, tell the user about the symlink
1078 * instead of giving a "vanished" message. We only
1079 * dereference a symlink if one of the --copy*links
1080 * options was specified, so there's no need for the
1081 * extra lstat() if one of these options isn't on. */
1082 if ((copy_links || copy_unsafe_links || copy_dirlinks)
1083 && x_lstat(thisname, &st, NULL) == 0
1084 && S_ISLNK(st.st_mode)) {
1085 io_error |= IOERR_GENERAL;
1086 rprintf(FERROR_XFER, "symlink has no referent: %s\n",
1087 full_fname(thisname));
1088 } else
1089#endif
1090 {
1091 enum logcode c = am_daemon && protocol_version < 28
1092 ? FERROR : FWARNING;
1093 io_error |= IOERR_VANISHED;
1094 rprintf(c, "file has vanished: %s\n",
1095 full_fname(thisname));
1096 }
1097 } else {
1098 io_error |= IOERR_GENERAL;
1099 rsyserr(FERROR_XFER, save_errno, "readlink %s failed",
1100 full_fname(thisname));
1101 }
1102 return NULL;
1103 }
1104
1105 /* backup.c calls us with filter_level set to NO_FILTERS. */
1106 if (filter_level == NO_FILTERS)
1107 goto skip_filters;
1108
1109 if (S_ISDIR(st.st_mode)) {
1110 if (!xfer_dirs) {
1111 rprintf(FINFO, "skipping directory %s\n", thisname);
1112 return NULL;
1113 }
1114 /* -x only affects dirs because we need to avoid recursing
1115 * into a mount-point directory, not to avoid copying a
1116 * symlinked file if -L (or similar) was specified. */
1117 if (one_file_system && st.st_dev != filesystem_dev
1118 && BITS_SETnUNSET(flags, FLAG_CONTENT_DIR, FLAG_TOP_DIR)) {
1119 if (one_file_system > 1) {
1120 if (verbose > 1) {
1121 rprintf(FINFO,
1122 "[%s] skipping mount-point dir %s\n",
1123 who_am_i(), thisname);
1124 }
1125 return NULL;
1126 }
1127 flags |= FLAG_MOUNT_DIR;
1128 flags &= ~FLAG_CONTENT_DIR;
1129 }
1130 } else
1131 flags &= ~FLAG_CONTENT_DIR;
1132
1133 if (is_excluded(thisname, S_ISDIR(st.st_mode) != 0, filter_level)) {
1134 if (ignore_perishable)
1135 non_perishable_cnt++;
1136 return NULL;
1137 }
1138
1139 if (lp_ignore_nonreadable(module_id)) {
1140#ifdef SUPPORT_LINKS
1141 if (!S_ISLNK(st.st_mode))
1142#endif
1143 if (access(thisname, R_OK) != 0)
1144 return NULL;
1145 }
1146
1147 skip_filters:
1148
1149 /* Only divert a directory in the main transfer. */
1150 if (flist) {
1151 if (flist->prev && S_ISDIR(st.st_mode)
1152 && flags & FLAG_DIVERT_DIRS) {
1153 /* Room for parent/sibling/next-child info. */
1154 extra_len += DIRNODE_EXTRA_CNT * EXTRA_LEN;
1155 if (relative_paths)
1156 extra_len += PTR_EXTRA_CNT * EXTRA_LEN;
1157 pool = dir_flist->file_pool;
1158 } else
1159 pool = flist->file_pool;
1160 } else {
1161#ifdef SUPPORT_ACLS
1162 /* Directories need an extra int32 for the default ACL. */
1163 if (preserve_acls && S_ISDIR(st.st_mode))
1164 extra_len += EXTRA_LEN;
1165#endif
1166 pool = NULL;
1167 }
1168
1169 if (verbose > 2) {
1170 rprintf(FINFO, "[%s] make_file(%s,*,%d)\n",
1171 who_am_i(), thisname, filter_level);
1172 }
1173
1174 if ((basename = strrchr(thisname, '/')) != NULL) {
1175 int len = basename++ - thisname;
1176 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
1177 lastdir = new_array(char, len + 1);
1178 memcpy(lastdir, thisname, len);
1179 lastdir[len] = '\0';
1180 lastdir_len = len;
1181 }
1182 } else
1183 basename = thisname;
1184 basename_len = strlen(basename) + 1; /* count the '\0' */
1185
1186#ifdef SUPPORT_LINKS
1187 linkname_len = S_ISLNK(st.st_mode) ? strlen(linkname) + 1 : 0;
1188#else
1189 linkname_len = 0;
1190#endif
1191
1192 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode))
1193 extra_len += EXTRA_LEN;
1194
1195#if EXTRA_ROUNDING > 0
1196 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
1197 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
1198#endif
1199
1200 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
1201 + linkname_len;
1202 if (pool)
1203 bp = pool_alloc(pool, alloc_len, "make_file");
1204 else {
1205 if (!(bp = new_array(char, alloc_len)))
1206 out_of_memory("make_file");
1207 }
1208
1209 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
1210 bp += extra_len;
1211 file = (struct file_struct *)bp;
1212 bp += FILE_STRUCT_LEN;
1213
1214 memcpy(bp, basename, basename_len);
1215
1216#ifdef SUPPORT_HARD_LINKS
1217 if (preserve_hard_links && flist && flist->prev) {
1218 if (protocol_version >= 28
1219 ? (!S_ISDIR(st.st_mode) && st.st_nlink > 1)
1220 : S_ISREG(st.st_mode)) {
1221 tmp_dev = st.st_dev;
1222 tmp_ino = st.st_ino;
1223 } else
1224 tmp_dev = 0;
1225 }
1226#endif
1227
1228#ifdef HAVE_STRUCT_STAT_ST_RDEV
1229 if (IS_DEVICE(st.st_mode) || IS_SPECIAL(st.st_mode)) {
1230 tmp_rdev = st.st_rdev;
1231 st.st_size = 0;
1232 }
1233#endif
1234
1235 file->flags = flags;
1236 file->modtime = st.st_mtime;
1237 file->len32 = (uint32)st.st_size;
1238 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode)) {
1239 file->flags |= FLAG_LENGTH64;
1240 OPT_EXTRA(file, 0)->unum = (uint32)(st.st_size >> 32);
1241 }
1242 file->mode = st.st_mode;
1243 if (uid_ndx) /* Check uid_ndx instead of preserve_uid for del support */
1244 F_OWNER(file) = st.st_uid;
1245 if (gid_ndx) /* Check gid_ndx instead of preserve_gid for del support */
1246 F_GROUP(file) = st.st_gid;
1247
1248 if (basename != thisname)
1249 file->dirname = lastdir;
1250
1251#ifdef SUPPORT_LINKS
1252 if (linkname_len)
1253 memcpy(bp + basename_len, linkname, linkname_len);
1254#endif
1255
1256 if (always_checksum && am_sender && S_ISREG(st.st_mode))
1257 file_checksum(thisname, tmp_sum, st.st_size);
1258
1259 if (am_sender)
1260 F_PATHNAME(file) = pathname;
1261 else if (!pool)
1262 F_DEPTH(file) = extra_len / EXTRA_LEN;
1263
1264 /* This code is only used by the receiver when it is building
1265 * a list of files for a delete pass. */
1266 if (keep_dirlinks && linkname_len && flist) {
1267 STRUCT_STAT st2;
1268 int save_mode = file->mode;
1269 file->mode = S_IFDIR; /* Find a directory with our name. */
1270 if (flist_find(dir_flist, file) >= 0
1271 && x_stat(thisname, &st2, NULL) == 0 && S_ISDIR(st2.st_mode)) {
1272 file->modtime = st2.st_mtime;
1273 file->len32 = 0;
1274 file->mode = st2.st_mode;
1275 if (uid_ndx)
1276 F_OWNER(file) = st2.st_uid;
1277 if (gid_ndx)
1278 F_GROUP(file) = st2.st_gid;
1279 } else
1280 file->mode = save_mode;
1281 }
1282
1283 if (basename_len == 0+1) {
1284 if (!pool)
1285 unmake_file(file);
1286 return NULL;
1287 }
1288
1289 if (unsort_ndx)
1290 F_NDX(file) = dir_count;
1291
1292 return file;
1293}
1294
1295/* Only called for temporary file_struct entries created by make_file(). */
1296void unmake_file(struct file_struct *file)
1297{
1298 free(REQ_EXTRA(file, F_DEPTH(file)));
1299}
1300
1301static struct file_struct *send_file_name(int f, struct file_list *flist,
1302 char *fname, STRUCT_STAT *stp,
1303 int flags, int filter_level)
1304{
1305 struct file_struct *file;
1306#if defined SUPPORT_ACLS || defined SUPPORT_XATTRS
1307 stat_x sx;
1308#endif
1309
1310 file = make_file(fname, flist, stp, flags, filter_level);
1311 if (!file)
1312 return NULL;
1313
1314 if (chmod_modes && !S_ISLNK(file->mode))
1315 file->mode = tweak_mode(file->mode, chmod_modes);
1316
1317#ifdef SUPPORT_ACLS
1318 if (preserve_acls && !S_ISLNK(file->mode) && f >= 0) {
1319 sx.st.st_mode = file->mode;
1320 sx.acc_acl = sx.def_acl = NULL;
1321 if (get_acl(fname, &sx) < 0)
1322 return NULL;
1323 }
1324#endif
1325#ifdef SUPPORT_XATTRS
1326 if (preserve_xattrs && f >= 0) {
1327 sx.xattr = NULL;
1328 if (get_xattr(fname, &sx) < 0)
1329 return NULL;
1330 }
1331#endif
1332
1333 maybe_emit_filelist_progress(flist->used + flist_count_offset);
1334
1335 flist_expand(flist, 1);
1336 flist->files[flist->used++] = file;
1337 if (f >= 0) {
1338 send_file_entry(f, file, flist->used - 1, flist->ndx_start);
1339#ifdef SUPPORT_ACLS
1340 if (preserve_acls && !S_ISLNK(file->mode)) {
1341 send_acl(&sx, f);
1342 free_acl(&sx);
1343 }
1344#endif
1345#ifdef SUPPORT_XATTRS
1346 if (preserve_xattrs) {
1347 F_XATTR(file) = send_xattr(&sx, f);
1348 free_xattr(&sx);
1349 }
1350#endif
1351 }
1352 return file;
1353}
1354
1355static void send_if_directory(int f, struct file_list *flist,
1356 struct file_struct *file,
1357 char *fbuf, unsigned int ol,
1358 int flags)
1359{
1360 char is_dot_dir = fbuf[ol-1] == '.' && (ol == 1 || fbuf[ol-2] == '/');
1361
1362 if (S_ISDIR(file->mode)
1363 && !(file->flags & FLAG_MOUNT_DIR) && f_name(file, fbuf)) {
1364 void *save_filters;
1365 unsigned int len = strlen(fbuf);
1366 if (len > 1 && fbuf[len-1] == '/')
1367 fbuf[--len] = '\0';
1368 if (len >= MAXPATHLEN - 1) {
1369 io_error |= IOERR_GENERAL;
1370 rprintf(FERROR_XFER, "skipping long-named directory: %s\n",
1371 full_fname(fbuf));
1372 return;
1373 }
1374 save_filters = push_local_filters(fbuf, len);
1375 send_directory(f, flist, fbuf, len, flags);
1376 pop_local_filters(save_filters);
1377 fbuf[ol] = '\0';
1378 if (is_dot_dir)
1379 fbuf[ol-1] = '.';
1380 }
1381}
1382
1383static int file_compare(const void *file1, const void *file2)
1384{
1385 return f_name_cmp(*(struct file_struct **)file1,
1386 *(struct file_struct **)file2);
1387}
1388
1389/* The guts of a merge-sort algorithm. This was derived from the glibc
1390 * version, but I (Wayne) changed the merge code to do less copying and
1391 * to require only half the amount of temporary memory. */
1392static void fsort_tmp(struct file_struct **fp, size_t num,
1393 struct file_struct **tmp)
1394{
1395 struct file_struct **f1, **f2, **t;
1396 size_t n1, n2;
1397
1398 n1 = num / 2;
1399 n2 = num - n1;
1400 f1 = fp;
1401 f2 = fp + n1;
1402
1403 if (n1 > 1)
1404 fsort_tmp(f1, n1, tmp);
1405 if (n2 > 1)
1406 fsort_tmp(f2, n2, tmp);
1407
1408 while (f_name_cmp(*f1, *f2) <= 0) {
1409 if (!--n1)
1410 return;
1411 f1++;
1412 }
1413
1414 t = tmp;
1415 memcpy(t, f1, n1 * PTR_SIZE);
1416
1417 *f1++ = *f2++, n2--;
1418
1419 while (n1 > 0 && n2 > 0) {
1420 if (f_name_cmp(*t, *f2) <= 0)
1421 *f1++ = *t++, n1--;
1422 else
1423 *f1++ = *f2++, n2--;
1424 }
1425
1426 if (n1 > 0)
1427 memcpy(f1, t, n1 * PTR_SIZE);
1428}
1429
1430/* This file-struct sorting routine makes sure that any identical names in
1431 * the file list stay in the same order as they were in the original list.
1432 * This is particularly vital in inc_recurse mode where we expect a sort
1433 * on the flist to match the exact order of a sort on the dir_flist. */
1434static void fsort(struct file_struct **fp, size_t num)
1435{
1436 if (num <= 1)
1437 return;
1438
1439 if (use_qsort)
1440 qsort(fp, num, PTR_SIZE, file_compare);
1441 else {
1442 struct file_struct **tmp = new_array(struct file_struct *,
1443 (num+1) / 2);
1444 fsort_tmp(fp, num, tmp);
1445 free(tmp);
1446 }
1447}
1448
1449/* We take an entire set of sibling dirs from the sorted flist and link them
1450 * into the tree, setting the appropriate parent/child/sibling pointers. */
1451static void add_dirs_to_tree(int parent_ndx, struct file_list *from_flist,
1452 int dir_cnt)
1453{
1454 int i;
1455 int32 *dp = NULL;
1456 int32 *parent_dp = parent_ndx < 0 ? NULL
1457 : F_DIR_NODE_P(dir_flist->sorted[parent_ndx]);
1458
1459 flist_expand(dir_flist, dir_cnt);
1460 dir_flist->sorted = dir_flist->files;
1461
1462 for (i = 0; dir_cnt; i++) {
1463 struct file_struct *file = from_flist->sorted[i];
1464
1465 if (!S_ISDIR(file->mode))
1466 continue;
1467
1468 dir_flist->files[dir_flist->used++] = file;
1469 dir_cnt--;
1470
1471 if (file->basename[0] == '.' && file->basename[1] == '\0')
1472 continue;
1473
1474 if (dp)
1475 DIR_NEXT_SIBLING(dp) = dir_flist->used - 1;
1476 else if (parent_dp)
1477 DIR_FIRST_CHILD(parent_dp) = dir_flist->used - 1;
1478 else
1479 send_dir_ndx = dir_flist->used - 1;
1480
1481 dp = F_DIR_NODE_P(file);
1482 DIR_PARENT(dp) = parent_ndx;
1483 DIR_FIRST_CHILD(dp) = -1;
1484 }
1485 if (dp)
1486 DIR_NEXT_SIBLING(dp) = -1;
1487}
1488
1489/* This function is normally called by the sender, but the receiving side also
1490 * calls it from get_dirlist() with f set to -1 so that we just construct the
1491 * file list in memory without sending it over the wire. Also, get_dirlist()
1492 * might call this with f set to -2, which also indicates that local filter
1493 * rules should be ignored. */
1494static void send_directory(int f, struct file_list *flist, char *fbuf, int len,
1495 int flags)
1496{
1497 struct dirent *di;
1498 unsigned remainder;
1499 char *p;
1500 DIR *d;
1501 int divert_dirs = (flags & FLAG_DIVERT_DIRS) != 0;
1502 int start = flist->used;
1503 int filter_level = f == -2 ? SERVER_FILTERS : ALL_FILTERS;
1504
1505 assert(flist != NULL);
1506
1507 if (!(d = opendir(fbuf))) {
1508 io_error |= IOERR_GENERAL;
1509 rsyserr(FERROR_XFER, errno, "opendir %s failed", full_fname(fbuf));
1510 return;
1511 }
1512
1513 p = fbuf + len;
1514 if (len != 1 || *fbuf != '/')
1515 *p++ = '/';
1516 *p = '\0';
1517 remainder = MAXPATHLEN - (p - fbuf);
1518
1519 for (errno = 0, di = readdir(d); di; errno = 0, di = readdir(d)) {
1520 char *dname = d_name(di);
1521 if (dname[0] == '.' && (dname[1] == '\0'
1522 || (dname[1] == '.' && dname[2] == '\0')))
1523 continue;
1524 if (strlcpy(p, dname, remainder) >= remainder) {
1525 io_error |= IOERR_GENERAL;
1526 rprintf(FINFO,
1527 "cannot send long-named file %s\n",
1528 full_fname(fbuf));
1529 continue;
1530 }
1531 if (dname[0] == '\0') {
1532 io_error |= IOERR_GENERAL;
1533 rprintf(FINFO,
1534 "cannot send file with empty name in %s\n",
1535 full_fname(fbuf));
1536 continue;
1537 }
1538
1539 send_file_name(f, flist, fbuf, NULL, flags, filter_level);
1540 }
1541
1542 fbuf[len] = '\0';
1543
1544 if (errno) {
1545 io_error |= IOERR_GENERAL;
1546 rsyserr(FERROR_XFER, errno, "readdir(%s)", full_fname(fbuf));
1547 }
1548
1549 closedir(d);
1550
1551 if (f >= 0 && recurse && !divert_dirs) {
1552 int i, end = flist->used - 1;
1553 /* send_if_directory() bumps flist->used, so use "end". */
1554 for (i = start; i <= end; i++)
1555 send_if_directory(f, flist, flist->files[i], fbuf, len, flags);
1556 }
1557}
1558
1559static char lastpath[MAXPATHLEN] = "";
1560static int lastpath_len = 0;
1561static struct file_struct *lastpath_struct;
1562
1563static void send_implied_dirs(int f, struct file_list *flist, char *fname,
1564 char *start, char *limit, int flags, char name_type)
1565{
1566 struct file_struct *file;
1567 item_list *relname_list;
1568 relnamecache **rnpp;
1569 char *slash;
1570 int len, need_new_dir;
1571 struct filter_list_struct save_filter_list = filter_list;
1572
1573 flags = (flags | FLAG_IMPLIED_DIR) & ~(FLAG_TOP_DIR | FLAG_CONTENT_DIR);
1574 filter_list.head = filter_list.tail = NULL; /* Don't filter implied dirs. */
1575
1576 if (inc_recurse) {
1577 if (lastpath_struct && F_PATHNAME(lastpath_struct) == pathname
1578 && lastpath_len == limit - fname
1579 && strncmp(lastpath, fname, lastpath_len) == 0)
1580 need_new_dir = 0;
1581 else
1582 need_new_dir = 1;
1583 } else
1584 need_new_dir = 1;
1585
1586 if (need_new_dir) {
1587 int save_copy_links = copy_links;
1588 int save_xfer_dirs = xfer_dirs;
1589
1590 copy_links = xfer_dirs = 1;
1591
1592 *limit = '\0';
1593
1594 for (slash = start; (slash = strchr(slash+1, '/')) != NULL; ) {
1595 *slash = '\0';
1596 send_file_name(f, flist, fname, NULL, flags, ALL_FILTERS);
1597 *slash = '/';
1598 }
1599
1600 file = send_file_name(f, flist, fname, NULL, flags, ALL_FILTERS);
1601 if (inc_recurse) {
1602 if (file && !S_ISDIR(file->mode))
1603 file = NULL;
1604 lastpath_struct = file;
1605 }
1606
1607 strlcpy(lastpath, fname, sizeof lastpath);
1608 lastpath_len = limit - fname;
1609
1610 *limit = '/';
1611
1612 copy_links = save_copy_links;
1613 xfer_dirs = save_xfer_dirs;
1614
1615 if (!inc_recurse)
1616 goto done;
1617 }
1618
1619 if (!lastpath_struct)
1620 goto done; /* dir must have vanished */
1621
1622 len = strlen(limit+1);
1623 memcpy(&relname_list, F_DIR_RELNAMES_P(lastpath_struct), sizeof relname_list);
1624 if (!relname_list) {
1625 if (!(relname_list = new0(item_list)))
1626 out_of_memory("send_implied_dirs");
1627 memcpy(F_DIR_RELNAMES_P(lastpath_struct), &relname_list, sizeof relname_list);
1628 }
1629 rnpp = EXPAND_ITEM_LIST(relname_list, relnamecache *, 32);
1630 if (!(*rnpp = (relnamecache*)new_array(char, sizeof (relnamecache) + len)))
1631 out_of_memory("send_implied_dirs");
1632 (*rnpp)->name_type = name_type;
1633 strlcpy((*rnpp)->fname, limit+1, len + 1);
1634
1635done:
1636 filter_list = save_filter_list;
1637}
1638
1639static void send1extra(int f, struct file_struct *file, struct file_list *flist)
1640{
1641 char fbuf[MAXPATHLEN];
1642 item_list *relname_list;
1643 int len, dlen, flags = FLAG_DIVERT_DIRS | FLAG_CONTENT_DIR;
1644 size_t j;
1645
1646 f_name(file, fbuf);
1647 dlen = strlen(fbuf);
1648
1649 if (F_PATHNAME(file) != pathname) {
1650 if (!push_pathname(F_PATHNAME(file), -1))
1651 exit_cleanup(RERR_FILESELECT);
1652 }
1653
1654 change_local_filter_dir(fbuf, dlen, send_dir_depth);
1655
1656 if (file->flags & FLAG_CONTENT_DIR) {
1657 if (one_file_system) {
1658 STRUCT_STAT st;
1659 if (link_stat(fbuf, &st, copy_dirlinks) != 0) {
1660 io_error |= IOERR_GENERAL;
1661 rsyserr(FERROR_XFER, errno, "link_stat %s failed",
1662 full_fname(fbuf));
1663 return;
1664 }
1665 filesystem_dev = st.st_dev;
1666 }
1667 send_directory(f, flist, fbuf, dlen, flags);
1668 }
1669
1670 if (!relative_paths)
1671 return;
1672
1673 memcpy(&relname_list, F_DIR_RELNAMES_P(file), sizeof relname_list);
1674 if (!relname_list)
1675 return;
1676
1677 for (j = 0; j < relname_list->count; j++) {
1678 char *slash;
1679 relnamecache *rnp = ((relnamecache**)relname_list->items)[j];
1680 char name_type = rnp->name_type;
1681
1682 fbuf[dlen] = '/';
1683 len = strlcpy(fbuf + dlen + 1, rnp->fname, sizeof fbuf - dlen - 1);
1684 free(rnp);
1685 if (len >= (int)sizeof fbuf)
1686 continue; /* Impossible... */
1687
1688 slash = strchr(fbuf+dlen+1, '/');
1689 if (slash) {
1690 send_implied_dirs(f, flist, fbuf, fbuf+dlen+1, slash, flags, name_type);
1691 continue;
1692 }
1693
1694 if (name_type != NORMAL_NAME) {
1695 STRUCT_STAT st;
1696 if (link_stat(fbuf, &st, 1) != 0) {
1697 io_error |= IOERR_GENERAL;
1698 rsyserr(FERROR_XFER, errno, "link_stat %s failed",
1699 full_fname(fbuf));
1700 continue;
1701 }
1702 send_file_name(f, flist, fbuf, &st, FLAG_TOP_DIR | flags, ALL_FILTERS);
1703 } else
1704 send_file_name(f, flist, fbuf, NULL, FLAG_TOP_DIR | flags, ALL_FILTERS);
1705 }
1706
1707 free(relname_list);
1708}
1709
1710void send_extra_file_list(int f, int at_least)
1711{
1712 struct file_list *flist;
1713 int64 start_write;
1714 uint16 prev_flags;
1715 int old_cnt, save_io_error = io_error;
1716
1717 if (flist_eof)
1718 return;
1719
1720 /* Keep sending data until we have the requested number of
1721 * files in the upcoming file-lists. */
1722 old_cnt = cur_flist->used;
1723 for (flist = first_flist; flist != cur_flist; flist = flist->next)
1724 old_cnt += flist->used;
1725 while (file_total - old_cnt < at_least) {
1726 struct file_struct *file = dir_flist->sorted[send_dir_ndx];
1727 int dir_ndx, dstart = dir_count;
1728 const char *pathname = F_PATHNAME(file);
1729 int32 *dp;
1730
1731 flist = flist_new(0, "send_extra_file_list");
1732 start_write = stats.total_written;
1733
1734 if (unsort_ndx)
1735 dir_ndx = F_NDX(file);
1736 else
1737 dir_ndx = send_dir_ndx;
1738 write_ndx(f, NDX_FLIST_OFFSET - dir_ndx);
1739 flist->parent_ndx = dir_ndx;
1740
1741 send1extra(f, file, flist);
1742 prev_flags = file->flags;
1743 dp = F_DIR_NODE_P(file);
1744
1745 /* If there are any duplicate directory names that follow, we
1746 * send all the dirs together in one file-list. The dir_flist
1747 * tree links all the child subdirs onto the last dup dir. */
1748 while ((dir_ndx = DIR_NEXT_SIBLING(dp)) >= 0
1749 && dir_flist->sorted[dir_ndx]->flags & FLAG_DUPLICATE) {
1750 send_dir_ndx = dir_ndx;
1751 file = dir_flist->sorted[dir_ndx];
1752 /* Try to avoid some duplicate scanning of identical dirs. */
1753 if (F_PATHNAME(file) == pathname && prev_flags & FLAG_CONTENT_DIR)
1754 file->flags &= ~FLAG_CONTENT_DIR;
1755 send1extra(f, file, flist);
1756 prev_flags = file->flags;
1757 dp = F_DIR_NODE_P(file);
1758 }
1759
1760 write_byte(f, 0);
1761
1762 if (need_unsorted_flist) {
1763 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
1764 out_of_memory("send_extra_file_list");
1765 memcpy(flist->sorted, flist->files,
1766 flist->used * sizeof (struct file_struct*));
1767 } else
1768 flist->sorted = flist->files;
1769
1770 flist_sort_and_clean(flist, 0);
1771
1772 add_dirs_to_tree(send_dir_ndx, flist, dir_count - dstart);
1773 flist_done_allocating(flist);
1774
1775 file_total += flist->used;
1776 stats.flist_size += stats.total_written - start_write;
1777 stats.num_files += flist->used;
1778 if (verbose > 3)
1779 output_flist(flist);
1780
1781 if (DIR_FIRST_CHILD(dp) >= 0) {
1782 send_dir_ndx = DIR_FIRST_CHILD(dp);
1783 send_dir_depth++;
1784 } else {
1785 while (DIR_NEXT_SIBLING(dp) < 0) {
1786 if ((send_dir_ndx = DIR_PARENT(dp)) < 0) {
1787 write_ndx(f, NDX_FLIST_EOF);
1788 flist_eof = 1;
1789 change_local_filter_dir(NULL, 0, 0);
1790 goto finish;
1791 }
1792 send_dir_depth--;
1793 file = dir_flist->sorted[send_dir_ndx];
1794 dp = F_DIR_NODE_P(file);
1795 }
1796 send_dir_ndx = DIR_NEXT_SIBLING(dp);
1797 }
1798 }
1799
1800 finish:
1801 if (io_error != save_io_error && !ignore_errors)
1802 send_msg_int(MSG_IO_ERROR, io_error);
1803}
1804
1805struct file_list *send_file_list(int f, int argc, char *argv[])
1806{
1807 static const char *lastdir;
1808 static int lastdir_len = -1;
1809 int len, dirlen;
1810 STRUCT_STAT st;
1811 char *p, *dir;
1812 struct file_list *flist;
1813 struct timeval start_tv, end_tv;
1814 int64 start_write;
1815 int use_ff_fd = 0;
1816 int disable_buffering;
1817 int flags = recurse ? FLAG_CONTENT_DIR : 0;
1818 int reading_remotely = filesfrom_host != NULL;
1819 int rl_flags = (reading_remotely ? 0 : RL_DUMP_COMMENTS)
1820#ifdef ICONV_OPTION
1821 | (filesfrom_convert ? RL_CONVERT : 0)
1822#endif
1823 | (eol_nulls || reading_remotely ? RL_EOL_NULLS : 0);
1824 int implied_dot_dir = 0;
1825
1826 rprintf(FLOG, "building file list\n");
1827 if (show_filelist_p())
1828 start_filelist_progress("building file list");
1829 else if (inc_recurse && verbose && !am_server)
1830 rprintf(FCLIENT, "sending incremental file list\n");
1831
1832 start_write = stats.total_written;
1833 gettimeofday(&start_tv, NULL);
1834
1835 if (relative_paths && protocol_version >= 30)
1836 implied_dirs = 1; /* We send flagged implied dirs */
1837
1838#ifdef SUPPORT_HARD_LINKS
1839 if (preserve_hard_links && protocol_version >= 30 && !cur_flist)
1840 init_hard_links();
1841#endif
1842
1843 flist = cur_flist = flist_new(0, "send_file_list");
1844 if (inc_recurse) {
1845 dir_flist = flist_new(FLIST_TEMP, "send_file_list");
1846 flags |= FLAG_DIVERT_DIRS;
1847 } else
1848 dir_flist = cur_flist;
1849
1850 disable_buffering = io_start_buffering_out(f);
1851 if (filesfrom_fd >= 0) {
1852 if (argv[0] && !push_dir(argv[0], 0)) {
1853 rsyserr(FERROR_XFER, errno, "push_dir %s failed in %s",
1854 full_fname(argv[0]), curr_dir);
1855 exit_cleanup(RERR_FILESELECT);
1856 }
1857 use_ff_fd = 1;
1858 }
1859
1860 while (1) {
1861 char fbuf[MAXPATHLEN], *fn, name_type;
1862
1863 if (use_ff_fd) {
1864 if (read_line(filesfrom_fd, fbuf, sizeof fbuf, rl_flags) == 0)
1865 break;
1866 sanitize_path(fbuf, fbuf, "", 0, SP_KEEP_DOT_DIRS);
1867 } else {
1868 if (argc-- == 0)
1869 break;
1870 strlcpy(fbuf, *argv++, MAXPATHLEN);
1871 if (sanitize_paths)
1872 sanitize_path(fbuf, fbuf, "", 0, SP_KEEP_DOT_DIRS);
1873 }
1874
1875 len = strlen(fbuf);
1876 if (relative_paths) {
1877 /* We clean up fbuf below. */
1878 name_type = NORMAL_NAME;
1879 } else if (!len || fbuf[len - 1] == '/') {
1880 if (len == 2 && fbuf[0] == '.') {
1881 /* Turn "./" into just "." rather than "./." */
1882 fbuf[--len] = '\0';
1883 } else {
1884 if (len + 1 >= MAXPATHLEN)
1885 overflow_exit("send_file_list");
1886 fbuf[len++] = '.';
1887 fbuf[len] = '\0';
1888 }
1889 name_type = DOT_NAME;
1890 } else if (len > 1 && fbuf[len-1] == '.' && fbuf[len-2] == '.'
1891 && (len == 2 || fbuf[len-3] == '/')) {
1892 if (len + 2 >= MAXPATHLEN)
1893 overflow_exit("send_file_list");
1894 fbuf[len++] = '/';
1895 fbuf[len++] = '.';
1896 fbuf[len] = '\0';
1897 name_type = DOT_NAME;
1898 } else if (fbuf[len-1] == '.' && (len == 1 || fbuf[len-2] == '/'))
1899 name_type = DOT_NAME;
1900 else
1901 name_type = NORMAL_NAME;
1902
1903 dir = NULL;
1904
1905 if (!relative_paths) {
1906 p = strrchr(fbuf, '/');
1907 if (p) {
1908 *p = '\0';
1909 if (p == fbuf)
1910 dir = "/";
1911 else
1912 dir = fbuf;
1913 len -= p - fbuf + 1;
1914 fn = p + 1;
1915 } else
1916 fn = fbuf;
1917 } else {
1918 if ((p = strstr(fbuf, "/./")) != NULL) {
1919 *p = '\0';
1920 if (p == fbuf)
1921 dir = "/";
1922 else {
1923 dir = fbuf;
1924 clean_fname(dir, 0);
1925 }
1926 fn = p + 3;
1927 while (*fn == '/')
1928 fn++;
1929 if (!*fn)
1930 *--fn = '\0'; /* ensure room for '.' */
1931 } else
1932 fn = fbuf;
1933 /* A leading ./ can be used in relative mode to affect
1934 * the dest dir without its name being in the path. */
1935 if (*fn == '.' && fn[1] == '/' && !implied_dot_dir) {
1936 send_file_name(f, flist, ".", NULL,
1937 (flags | FLAG_IMPLIED_DIR) & ~FLAG_CONTENT_DIR,
1938 ALL_FILTERS);
1939 implied_dot_dir = 1;
1940 }
1941 len = clean_fname(fn, CFN_KEEP_TRAILING_SLASH
1942 | CFN_DROP_TRAILING_DOT_DIR);
1943 if (len == 1) {
1944 if (fn[0] == '/') {
1945 fn = "/.";
1946 len = 2;
1947 name_type = DOT_NAME;
1948 } else if (fn[0] == '.')
1949 name_type = DOT_NAME;
1950 } else if (fn[len-1] == '/') {
1951 fn[--len] = '\0';
1952 if (len == 1 && *fn == '.')
1953 name_type = DOT_NAME;
1954 else
1955 name_type = SLASH_ENDING_NAME;
1956 }
1957 /* Reject a ".." dir in the active part of the path. */
1958 for (p = fn; (p = strstr(p, "..")) != NULL; p += 2) {
1959 if ((p[2] == '/' || p[2] == '\0')
1960 && (p == fn || p[-1] == '/')) {
1961 rprintf(FERROR,
1962 "found \"..\" dir in relative path: %s\n",
1963 fn);
1964 exit_cleanup(RERR_SYNTAX);
1965 }
1966 }
1967 }
1968
1969 if (!*fn) {
1970 len = 1;
1971 fn = ".";
1972 name_type = DOT_NAME;
1973 }
1974
1975 dirlen = dir ? strlen(dir) : 0;
1976 if (dirlen != lastdir_len || memcmp(lastdir, dir, dirlen) != 0) {
1977 if (path_is_daemon_excluded(dir, 0)) {
1978 io_error |= IOERR_GENERAL;
1979 rsyserr(FERROR, errno, "push_dir %s failed in %s",
1980 full_fname(dir), curr_dir);
1981 continue;
1982 }
1983 if (!push_pathname(dir ? strdup(dir) : NULL, dirlen))
1984 continue;
1985 lastdir = pathname;
1986 lastdir_len = pathname_len;
1987 } else if (!push_pathname(lastdir, lastdir_len))
1988 continue;
1989
1990 if (fn != fbuf)
1991 memmove(fbuf, fn, len + 1);
1992
1993 if (link_stat(fbuf, &st, copy_dirlinks || name_type != NORMAL_NAME) != 0
1994 || is_daemon_excluded(fbuf, S_ISDIR(st.st_mode) != 0)
1995 || (relative_paths && path_is_daemon_excluded(fbuf, 1))) {
1996 io_error |= IOERR_GENERAL;
1997 rsyserr(FERROR_XFER, errno, "link_stat %s failed",
1998 full_fname(fbuf));
1999 continue;
2000 }
2001
2002 if (S_ISDIR(st.st_mode) && !xfer_dirs) {
2003 rprintf(FINFO, "skipping directory %s\n", fbuf);
2004 continue;
2005 }
2006
2007 if (inc_recurse && relative_paths && *fbuf) {
2008 if ((p = strchr(fbuf+1, '/')) != NULL) {
2009 if (p - fbuf == 1 && *fbuf == '.') {
2010 if ((fn = strchr(p+1, '/')) != NULL)
2011 p = fn;
2012 } else
2013 fn = p;
2014 send_implied_dirs(f, flist, fbuf, fbuf, p, flags, name_type);
2015 if (fn == p)
2016 continue;
2017 }
2018 } else if (implied_dirs && (p=strrchr(fbuf,'/')) && p != fbuf) {
2019 /* Send the implied directories at the start of the
2020 * source spec, so we get their permissions right. */
2021 char *lp = lastpath, *slash = fbuf;
2022 *p = '\0';
2023 /* Skip any initial directories in our path that we
2024 * have in common with lastpath. */
2025 for (fn = fbuf; *fn && *lp == *fn; lp++, fn++) {
2026 if (*fn == '/')
2027 slash = fn;
2028 }
2029 *p = '/';
2030 if (fn != p || (*lp && *lp != '/'))
2031 send_implied_dirs(f, flist, fbuf, slash, p, flags, 0);
2032 }
2033
2034 if (one_file_system)
2035 filesystem_dev = st.st_dev;
2036
2037 if (recurse || (xfer_dirs && name_type != NORMAL_NAME)) {
2038 struct file_struct *file;
2039 int top_flags = FLAG_TOP_DIR | FLAG_CONTENT_DIR | flags;
2040 file = send_file_name(f, flist, fbuf, &st,
2041 top_flags, ALL_FILTERS);
2042 if (!file)
2043 continue;
2044 if (inc_recurse) {
2045 if (name_type == DOT_NAME) {
2046 if (send_dir_depth < 0) {
2047 send_dir_depth = 0;
2048 change_local_filter_dir(fbuf, len, send_dir_depth);
2049 }
2050 send_directory(f, flist, fbuf, len, flags);
2051 }
2052 } else
2053 send_if_directory(f, flist, file, fbuf, len, flags);
2054 } else
2055 send_file_name(f, flist, fbuf, &st, flags, ALL_FILTERS);
2056 }
2057
2058 gettimeofday(&end_tv, NULL);
2059 stats.flist_buildtime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
2060 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
2061 if (stats.flist_buildtime == 0)
2062 stats.flist_buildtime = 1;
2063 start_tv = end_tv;
2064
2065 write_byte(f, 0); /* Indicate end of file list */
2066
2067#ifdef SUPPORT_HARD_LINKS
2068 if (preserve_hard_links && protocol_version >= 30 && !inc_recurse)
2069 idev_destroy();
2070#endif
2071
2072 if (show_filelist_p())
2073 finish_filelist_progress(flist);
2074
2075 gettimeofday(&end_tv, NULL);
2076 stats.flist_xfertime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
2077 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
2078
2079 /* When converting names, both sides keep an unsorted file-list array
2080 * because the names will differ on the sending and receiving sides
2081 * (both sides will use the unsorted index number for each item). */
2082
2083 /* Sort the list without removing any duplicates. This allows the
2084 * receiving side to ask for whatever name it kept. For incremental
2085 * recursion mode, the sender marks duplicate dirs so that it can
2086 * send them together in a single file-list. */
2087 if (need_unsorted_flist) {
2088 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
2089 out_of_memory("send_file_list");
2090 memcpy(flist->sorted, flist->files,
2091 flist->used * sizeof (struct file_struct*));
2092 } else
2093 flist->sorted = flist->files;
2094 flist_sort_and_clean(flist, 0);
2095 file_total += flist->used;
2096
2097 if (numeric_ids <= 0 && !inc_recurse)
2098 send_id_list(f);
2099
2100 /* send the io_error flag */
2101 if (protocol_version < 30)
2102 write_int(f, ignore_errors ? 0 : io_error);
2103 else if (io_error && !ignore_errors)
2104 send_msg_int(MSG_IO_ERROR, io_error);
2105
2106 if (disable_buffering)
2107 io_end_buffering_out();
2108
2109 stats.flist_size = stats.total_written - start_write;
2110 stats.num_files = flist->used;
2111
2112 if (verbose > 3)
2113 output_flist(flist);
2114
2115 if (verbose > 2)
2116 rprintf(FINFO, "send_file_list done\n");
2117
2118 if (inc_recurse) {
2119 send_dir_depth = 1;
2120 add_dirs_to_tree(-1, flist, dir_count);
2121 if (!file_total || strcmp(flist->sorted[0]->basename, ".") != 0)
2122 flist->parent_ndx = -1;
2123 flist_done_allocating(flist);
2124 if (send_dir_ndx < 0) {
2125 write_ndx(f, NDX_FLIST_EOF);
2126 flist_eof = 1;
2127 }
2128 else if (file_total == 1) {
2129 /* If we're creating incremental file-lists and there
2130 * was just 1 item in the first file-list, send 1 more
2131 * file-list to check if this is a 1-file xfer. */
2132 send_extra_file_list(f, 1);
2133 }
2134 }
2135
2136 return flist;
2137}
2138
2139struct file_list *recv_file_list(int f)
2140{
2141 struct file_list *flist;
2142 int dstart, flags;
2143 int64 start_read;
2144
2145 if (!first_flist)
2146 rprintf(FLOG, "receiving file list\n");
2147 if (show_filelist_p())
2148 start_filelist_progress("receiving file list");
2149 else if (inc_recurse && verbose && !am_server && !first_flist)
2150 rprintf(FCLIENT, "receiving incremental file list\n");
2151
2152 start_read = stats.total_read;
2153
2154#ifdef SUPPORT_HARD_LINKS
2155 if (preserve_hard_links && !first_flist)
2156 init_hard_links();
2157#endif
2158
2159 flist = flist_new(0, "recv_file_list");
2160
2161 if (inc_recurse) {
2162 if (flist->ndx_start == 1)
2163 dir_flist = flist_new(FLIST_TEMP, "recv_file_list");
2164 dstart = dir_flist->used;
2165 } else {
2166 dir_flist = flist;
2167 dstart = 0;
2168 }
2169
2170 while ((flags = read_byte(f)) != 0) {
2171 struct file_struct *file;
2172
2173 flist_expand(flist, 1);
2174
2175 if (protocol_version >= 28 && (flags & XMIT_EXTENDED_FLAGS))
2176 flags |= read_byte(f) << 8;
2177 file = recv_file_entry(flist, flags, f);
2178
2179 if (inc_recurse && S_ISDIR(file->mode)) {
2180 flist_expand(dir_flist, 1);
2181 dir_flist->files[dir_flist->used++] = file;
2182 }
2183
2184 flist->files[flist->used++] = file;
2185
2186 maybe_emit_filelist_progress(flist->used);
2187
2188 if (verbose > 2) {
2189 rprintf(FINFO, "recv_file_name(%s)\n",
2190 f_name(file, NULL));
2191 }
2192 }
2193 file_total += flist->used;
2194
2195 if (verbose > 2)
2196 rprintf(FINFO, "received %d names\n", flist->used);
2197
2198 if (show_filelist_p())
2199 finish_filelist_progress(flist);
2200
2201 if (need_unsorted_flist) {
2202 /* Create an extra array of index pointers that we can sort for
2203 * the generator's use (for wading through the files in sorted
2204 * order and for calling flist_find()). We keep the "files"
2205 * list unsorted for our exchange of index numbers with the
2206 * other side (since their names may not sort the same). */
2207 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
2208 out_of_memory("recv_file_list");
2209 memcpy(flist->sorted, flist->files,
2210 flist->used * sizeof (struct file_struct*));
2211 if (inc_recurse && dir_flist->used > dstart) {
2212 static int dir_flist_malloced = 0;
2213 if (dir_flist_malloced < dir_flist->malloced) {
2214 dir_flist->sorted = realloc_array(dir_flist->sorted,
2215 struct file_struct *,
2216 dir_flist->malloced);
2217 dir_flist_malloced = dir_flist->malloced;
2218 }
2219 memcpy(dir_flist->sorted + dstart, dir_flist->files + dstart,
2220 (dir_flist->used - dstart) * sizeof (struct file_struct*));
2221 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2222 }
2223 } else {
2224 flist->sorted = flist->files;
2225 if (inc_recurse && dir_flist->used > dstart) {
2226 dir_flist->sorted = dir_flist->files;
2227 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2228 }
2229 }
2230
2231 if (inc_recurse)
2232 flist_done_allocating(flist);
2233 else if (f >= 0)
2234 recv_id_list(f, flist);
2235
2236 flist_sort_and_clean(flist, relative_paths);
2237
2238 if (protocol_version < 30) {
2239 /* Recv the io_error flag */
2240 if (ignore_errors)
2241 read_int(f);
2242 else
2243 io_error |= read_int(f);
2244 } else if (inc_recurse && flist->ndx_start == 1) {
2245 if (!file_total || strcmp(flist->sorted[0]->basename, ".") != 0)
2246 flist->parent_ndx = -1;
2247 }
2248
2249 if (verbose > 3)
2250 output_flist(flist);
2251
2252 if (verbose > 2)
2253 rprintf(FINFO, "recv_file_list done\n");
2254
2255 stats.flist_size += stats.total_read - start_read;
2256 stats.num_files += flist->used;
2257
2258 return flist;
2259}
2260
2261/* This is only used once by the receiver if the very first file-list
2262 * has exactly one item in it. */
2263void recv_additional_file_list(int f)
2264{
2265 struct file_list *flist;
2266 int ndx = read_ndx(f);
2267 if (ndx == NDX_FLIST_EOF) {
2268 flist_eof = 1;
2269 change_local_filter_dir(NULL, 0, 0);
2270 } else {
2271 ndx = NDX_FLIST_OFFSET - ndx;
2272 if (ndx < 0 || ndx >= dir_flist->used) {
2273 ndx = NDX_FLIST_OFFSET - ndx;
2274 rprintf(FERROR,
2275 "[%s] Invalid dir index: %d (%d - %d)\n",
2276 who_am_i(), ndx, NDX_FLIST_OFFSET,
2277 NDX_FLIST_OFFSET - dir_flist->used + 1);
2278 exit_cleanup(RERR_PROTOCOL);
2279 }
2280 if (verbose > 3) {
2281 rprintf(FINFO, "[%s] receiving flist for dir %d\n",
2282 who_am_i(), ndx);
2283 }
2284 flist = recv_file_list(f);
2285 flist->parent_ndx = ndx;
2286 }
2287}
2288
2289/* Search for an identically-named item in the file list. Note that the
2290 * items must agree in their directory-ness, or no match is returned. */
2291int flist_find(struct file_list *flist, struct file_struct *f)
2292{
2293 int low = flist->low, high = flist->high;
2294 int diff, mid, mid_up;
2295
2296 while (low <= high) {
2297 mid = (low + high) / 2;
2298 if (F_IS_ACTIVE(flist->sorted[mid]))
2299 mid_up = mid;
2300 else {
2301 /* Scan for the next non-empty entry using the cached
2302 * distance values. If the value isn't fully up-to-
2303 * date, update it. */
2304 mid_up = mid + F_DEPTH(flist->sorted[mid]);
2305 if (!F_IS_ACTIVE(flist->sorted[mid_up])) {
2306 do {
2307 mid_up += F_DEPTH(flist->sorted[mid_up]);
2308 } while (!F_IS_ACTIVE(flist->sorted[mid_up]));
2309 F_DEPTH(flist->sorted[mid]) = mid_up - mid;
2310 }
2311 if (mid_up > high) {
2312 /* If there's nothing left above us, set high to
2313 * a non-empty entry below us and continue. */
2314 high = mid - (int)flist->sorted[mid]->len32;
2315 if (!F_IS_ACTIVE(flist->sorted[high])) {
2316 do {
2317 high -= (int)flist->sorted[high]->len32;
2318 } while (!F_IS_ACTIVE(flist->sorted[high]));
2319 flist->sorted[mid]->len32 = mid - high;
2320 }
2321 continue;
2322 }
2323 }
2324 diff = f_name_cmp(flist->sorted[mid_up], f);
2325 if (diff == 0) {
2326 if (protocol_version < 29
2327 && S_ISDIR(flist->sorted[mid_up]->mode)
2328 != S_ISDIR(f->mode))
2329 return -1;
2330 return mid_up;
2331 }
2332 if (diff < 0)
2333 low = mid_up + 1;
2334 else
2335 high = mid - 1;
2336 }
2337 return -1;
2338}
2339
2340/*
2341 * Free up any resources a file_struct has allocated
2342 * and clear the file.
2343 */
2344void clear_file(struct file_struct *file)
2345{
2346 /* The +1 zeros out the first char of the basename. */
2347 memset(file, 0, FILE_STRUCT_LEN + 1);
2348 /* In an empty entry, F_DEPTH() is an offset to the next non-empty
2349 * entry. Likewise for len32 in the opposite direction. We assume
2350 * that we're alone for now since flist_find() will adjust the counts
2351 * it runs into that aren't up-to-date. */
2352 file->len32 = F_DEPTH(file) = 1;
2353}
2354
2355/* Allocate a new file list. */
2356struct file_list *flist_new(int flags, char *msg)
2357{
2358 struct file_list *flist;
2359
2360 if (!(flist = new0(struct file_list)))
2361 out_of_memory(msg);
2362
2363 if (flags & FLIST_TEMP) {
2364 if (!(flist->file_pool = pool_create(SMALL_EXTENT, 0,
2365 out_of_memory, POOL_INTERN)))
2366 out_of_memory(msg);
2367 } else {
2368 /* This is a doubly linked list with prev looping back to
2369 * the end of the list, but the last next pointer is NULL. */
2370 if (!first_flist) {
2371 flist->file_pool = pool_create(NORMAL_EXTENT, 0,
2372 out_of_memory, POOL_INTERN);
2373 if (!flist->file_pool)
2374 out_of_memory(msg);
2375
2376 flist->ndx_start = flist->flist_num = inc_recurse ? 1 : 0;
2377
2378 first_flist = cur_flist = flist->prev = flist;
2379 } else {
2380 struct file_list *prev = first_flist->prev;
2381
2382 flist->file_pool = first_flist->file_pool;
2383
2384 flist->ndx_start = prev->ndx_start + prev->used + 1;
2385 flist->flist_num = prev->flist_num + 1;
2386
2387 flist->prev = prev;
2388 prev->next = first_flist->prev = flist;
2389 }
2390 flist->pool_boundary = pool_boundary(flist->file_pool, 0);
2391 flist_cnt++;
2392 }
2393
2394 return flist;
2395}
2396
2397/* Free up all elements in a flist. */
2398void flist_free(struct file_list *flist)
2399{
2400 if (!flist->prev) {
2401 /* Was FLIST_TEMP dir-list. */
2402 } else if (flist == flist->prev) {
2403 first_flist = cur_flist = NULL;
2404 file_total = 0;
2405 flist_cnt = 0;
2406 } else {
2407 if (flist == cur_flist)
2408 cur_flist = flist->next;
2409 if (flist == first_flist)
2410 first_flist = first_flist->next;
2411 else {
2412 flist->prev->next = flist->next;
2413 if (!flist->next)
2414 flist->next = first_flist;
2415 }
2416 flist->next->prev = flist->prev;
2417 file_total -= flist->used;
2418 flist_cnt--;
2419 }
2420
2421 if (!flist->prev || !flist_cnt)
2422 pool_destroy(flist->file_pool);
2423 else
2424 pool_free_old(flist->file_pool, flist->pool_boundary);
2425
2426 if (flist->sorted && flist->sorted != flist->files)
2427 free(flist->sorted);
2428 free(flist->files);
2429 free(flist);
2430}
2431
2432/* This routine ensures we don't have any duplicate names in our file list.
2433 * duplicate names can cause corruption because of the pipelining. */
2434static void flist_sort_and_clean(struct file_list *flist, int strip_root)
2435{
2436 char fbuf[MAXPATHLEN];
2437 int i, prev_i;
2438
2439 if (!flist)
2440 return;
2441 if (flist->used == 0) {
2442 flist->high = -1;
2443 flist->low = 0;
2444 return;
2445 }
2446
2447 fsort(flist->sorted, flist->used);
2448
2449 if (!am_sender || inc_recurse) {
2450 for (i = prev_i = 0; i < flist->used; i++) {
2451 if (F_IS_ACTIVE(flist->sorted[i])) {
2452 prev_i = i;
2453 break;
2454 }
2455 }
2456 flist->low = prev_i;
2457 } else {
2458 i = prev_i = flist->used - 1;
2459 flist->low = 0;
2460 }
2461
2462 while (++i < flist->used) {
2463 int j;
2464 struct file_struct *file = flist->sorted[i];
2465
2466 if (!F_IS_ACTIVE(file))
2467 continue;
2468 if (f_name_cmp(file, flist->sorted[prev_i]) == 0)
2469 j = prev_i;
2470 else if (protocol_version >= 29 && S_ISDIR(file->mode)) {
2471 int save_mode = file->mode;
2472 /* Make sure that this directory doesn't duplicate a
2473 * non-directory earlier in the list. */
2474 flist->high = prev_i;
2475 file->mode = S_IFREG;
2476 j = flist_find(flist, file);
2477 file->mode = save_mode;
2478 } else
2479 j = -1;
2480 if (j >= 0) {
2481 int keep, drop;
2482 /* If one is a dir and the other is not, we want to
2483 * keep the dir because it might have contents in the
2484 * list. Otherwise keep the first one. */
2485 if (S_ISDIR(file->mode)) {
2486 struct file_struct *fp = flist->sorted[j];
2487 if (!S_ISDIR(fp->mode))
2488 keep = i, drop = j;
2489 else {
2490 if (am_sender)
2491 file->flags |= FLAG_DUPLICATE;
2492 else { /* Make sure we merge our vital flags. */
2493 fp->flags |= file->flags & (FLAG_TOP_DIR|FLAG_CONTENT_DIR);
2494 fp->flags &= file->flags | ~FLAG_IMPLIED_DIR;
2495 }
2496 keep = j, drop = i;
2497 }
2498 } else
2499 keep = j, drop = i;
2500
2501 if (!am_sender) {
2502 if (verbose > 1) {
2503 rprintf(FINFO,
2504 "removing duplicate name %s from file list (%d)\n",
2505 f_name(file, fbuf), drop + flist->ndx_start);
2506 }
2507 clear_file(flist->sorted[drop]);
2508 }
2509
2510 if (keep == i) {
2511 if (flist->low == drop) {
2512 for (j = drop + 1;
2513 j < i && !F_IS_ACTIVE(flist->sorted[j]);
2514 j++) {}
2515 flist->low = j;
2516 }
2517 prev_i = i;
2518 }
2519 } else
2520 prev_i = i;
2521 }
2522 flist->high = prev_i;
2523
2524 if (strip_root) {
2525 /* We need to strip off the leading slashes for relative
2526 * paths, but this must be done _after_ the sorting phase. */
2527 for (i = flist->low; i <= flist->high; i++) {
2528 struct file_struct *file = flist->sorted[i];
2529
2530 if (!file->dirname)
2531 continue;
2532 while (*file->dirname == '/')
2533 file->dirname++;
2534 if (!*file->dirname)
2535 file->dirname = NULL;
2536 }
2537 }
2538
2539 if (prune_empty_dirs && !am_sender) {
2540 int j, prev_depth = 0;
2541
2542 prev_i = 0; /* It's OK that this isn't really true. */
2543
2544 for (i = flist->low; i <= flist->high; i++) {
2545 struct file_struct *fp, *file = flist->sorted[i];
2546
2547 /* This temporarily abuses the F_DEPTH() value for a
2548 * directory that is in a chain that might get pruned.
2549 * We restore the old value if it gets a reprieve. */
2550 if (S_ISDIR(file->mode) && F_DEPTH(file)) {
2551 /* Dump empty dirs when coming back down. */
2552 for (j = prev_depth; j >= F_DEPTH(file); j--) {
2553 fp = flist->sorted[prev_i];
2554 if (F_DEPTH(fp) >= 0)
2555 break;
2556 prev_i = -F_DEPTH(fp)-1;
2557 clear_file(fp);
2558 }
2559 prev_depth = F_DEPTH(file);
2560 if (is_excluded(f_name(file, fbuf), 1,
2561 ALL_FILTERS)) {
2562 /* Keep dirs through this dir. */
2563 for (j = prev_depth-1; ; j--) {
2564 fp = flist->sorted[prev_i];
2565 if (F_DEPTH(fp) >= 0)
2566 break;
2567 prev_i = -F_DEPTH(fp)-1;
2568 F_DEPTH(fp) = j;
2569 }
2570 } else
2571 F_DEPTH(file) = -prev_i-1;
2572 prev_i = i;
2573 } else {
2574 /* Keep dirs through this non-dir. */
2575 for (j = prev_depth; ; j--) {
2576 fp = flist->sorted[prev_i];
2577 if (F_DEPTH(fp) >= 0)
2578 break;
2579 prev_i = -F_DEPTH(fp)-1;
2580 F_DEPTH(fp) = j;
2581 }
2582 }
2583 }
2584 /* Dump all remaining empty dirs. */
2585 while (1) {
2586 struct file_struct *fp = flist->sorted[prev_i];
2587 if (F_DEPTH(fp) >= 0)
2588 break;
2589 prev_i = -F_DEPTH(fp)-1;
2590 clear_file(fp);
2591 }
2592
2593 for (i = flist->low; i <= flist->high; i++) {
2594 if (F_IS_ACTIVE(flist->sorted[i]))
2595 break;
2596 }
2597 flist->low = i;
2598 for (i = flist->high; i >= flist->low; i--) {
2599 if (F_IS_ACTIVE(flist->sorted[i]))
2600 break;
2601 }
2602 flist->high = i;
2603 }
2604}
2605
2606static void output_flist(struct file_list *flist)
2607{
2608 char uidbuf[16], gidbuf[16], depthbuf[16];
2609 struct file_struct *file;
2610 const char *root, *dir, *slash, *name, *trail;
2611 const char *who = who_am_i();
2612 int i;
2613
2614 rprintf(FINFO, "[%s] flist start=%d, used=%d, low=%d, high=%d\n",
2615 who, flist->ndx_start, flist->used, flist->low, flist->high);
2616 for (i = 0; i < flist->used; i++) {
2617 file = flist->files[i];
2618 if ((am_root || am_sender) && uid_ndx) {
2619 snprintf(uidbuf, sizeof uidbuf, " uid=%u",
2620 F_OWNER(file));
2621 } else
2622 *uidbuf = '\0';
2623 if (gid_ndx) {
2624 static char parens[] = "(\0)\0\0\0";
2625 char *pp = parens + (file->flags & FLAG_SKIP_GROUP ? 0 : 3);
2626 snprintf(gidbuf, sizeof gidbuf, " gid=%s%u%s",
2627 pp, F_GROUP(file), pp + 2);
2628 } else
2629 *gidbuf = '\0';
2630 if (!am_sender)
2631 snprintf(depthbuf, sizeof depthbuf, "%d", F_DEPTH(file));
2632 if (F_IS_ACTIVE(file)) {
2633 root = am_sender ? NS(F_PATHNAME(file)) : depthbuf;
2634 if ((dir = file->dirname) == NULL)
2635 dir = slash = "";
2636 else
2637 slash = "/";
2638 name = file->basename;
2639 trail = S_ISDIR(file->mode) ? "/" : "";
2640 } else
2641 root = dir = slash = name = trail = "";
2642 rprintf(FINFO,
2643 "[%s] i=%d %s %s%s%s%s mode=0%o len=%.0f%s%s flags=%x\n",
2644 who, i + flist->ndx_start,
2645 root, dir, slash, name, trail,
2646 (int)file->mode, (double)F_LENGTH(file),
2647 uidbuf, gidbuf, file->flags);
2648 }
2649}
2650
2651enum fnc_state { s_DIR, s_SLASH, s_BASE, s_TRAILING };
2652enum fnc_type { t_PATH, t_ITEM };
2653
2654static int found_prefix;
2655
2656/* Compare the names of two file_struct entities, similar to how strcmp()
2657 * would do if it were operating on the joined strings.
2658 *
2659 * Some differences beginning with protocol_version 29: (1) directory names
2660 * are compared with an assumed trailing slash so that they compare in a
2661 * way that would cause them to sort immediately prior to any content they
2662 * may have; (2) a directory of any name compares after a non-directory of
2663 * any name at the same depth; (3) a directory with name "." compares prior
2664 * to anything else. These changes mean that a directory and a non-dir
2665 * with the same name will not compare as equal (protocol_version >= 29).
2666 *
2667 * The dirname component can be an empty string, but the basename component
2668 * cannot (and never is in the current codebase). The basename component
2669 * may be NULL (for a removed item), in which case it is considered to be
2670 * after any existing item. */
2671int f_name_cmp(const struct file_struct *f1, const struct file_struct *f2)
2672{
2673 int dif;
2674 const uchar *c1, *c2;
2675 enum fnc_state state1, state2;
2676 enum fnc_type type1, type2;
2677 enum fnc_type t_path = protocol_version >= 29 ? t_PATH : t_ITEM;
2678
2679 if (!f1 || !F_IS_ACTIVE(f1)) {
2680 if (!f2 || !F_IS_ACTIVE(f2))
2681 return 0;
2682 return -1;
2683 }
2684 if (!f2 || !F_IS_ACTIVE(f2))
2685 return 1;
2686
2687 c1 = (uchar*)f1->dirname;
2688 c2 = (uchar*)f2->dirname;
2689 if (c1 == c2)
2690 c1 = c2 = NULL;
2691 if (!c1) {
2692 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2693 c1 = (const uchar*)f1->basename;
2694 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2695 type1 = t_ITEM;
2696 state1 = s_TRAILING;
2697 c1 = (uchar*)"";
2698 } else
2699 state1 = s_BASE;
2700 } else {
2701 type1 = t_path;
2702 state1 = s_DIR;
2703 }
2704 if (!c2) {
2705 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2706 c2 = (const uchar*)f2->basename;
2707 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2708 type2 = t_ITEM;
2709 state2 = s_TRAILING;
2710 c2 = (uchar*)"";
2711 } else
2712 state2 = s_BASE;
2713 } else {
2714 type2 = t_path;
2715 state2 = s_DIR;
2716 }
2717
2718 if (type1 != type2)
2719 return type1 == t_PATH ? 1 : -1;
2720
2721 do {
2722 if (!*c1) {
2723 switch (state1) {
2724 case s_DIR:
2725 state1 = s_SLASH;
2726 c1 = (uchar*)"/";
2727 break;
2728 case s_SLASH:
2729 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2730 c1 = (const uchar*)f1->basename;
2731 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2732 type1 = t_ITEM;
2733 state1 = s_TRAILING;
2734 c1 = (uchar*)"";
2735 } else
2736 state1 = s_BASE;
2737 break;
2738 case s_BASE:
2739 state1 = s_TRAILING;
2740 if (type1 == t_PATH) {
2741 c1 = (uchar*)"/";
2742 break;
2743 }
2744 /* FALL THROUGH */
2745 case s_TRAILING:
2746 type1 = t_ITEM;
2747 break;
2748 }
2749 if (*c2 && type1 != type2)
2750 return type1 == t_PATH ? 1 : -1;
2751 }
2752 if (!*c2) {
2753 switch (state2) {
2754 case s_DIR:
2755 state2 = s_SLASH;
2756 c2 = (uchar*)"/";
2757 break;
2758 case s_SLASH:
2759 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2760 c2 = (const uchar*)f2->basename;
2761 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2762 type2 = t_ITEM;
2763 state2 = s_TRAILING;
2764 c2 = (uchar*)"";
2765 } else
2766 state2 = s_BASE;
2767 break;
2768 case s_BASE:
2769 state2 = s_TRAILING;
2770 if (type2 == t_PATH) {
2771 c2 = (uchar*)"/";
2772 break;
2773 }
2774 /* FALL THROUGH */
2775 case s_TRAILING:
2776 found_prefix = 1;
2777 if (!*c1)
2778 return 0;
2779 type2 = t_ITEM;
2780 break;
2781 }
2782 if (type1 != type2)
2783 return type1 == t_PATH ? 1 : -1;
2784 }
2785 } while ((dif = (int)*c1++ - (int)*c2++) == 0);
2786
2787 return dif;
2788}
2789
2790/* Returns 1 if f1's filename has all of f2's filename as a prefix. This does
2791 * not match if f2's basename is not an exact match of a path element in f1.
2792 * E.g. /path/foo is not a prefix of /path/foobar/baz, but /path/foobar is. */
2793int f_name_has_prefix(const struct file_struct *f1, const struct file_struct *f2)
2794{
2795 found_prefix = 0;
2796 f_name_cmp(f1, f2);
2797 return found_prefix;
2798}
2799
2800char *f_name_buf(void)
2801{
2802 static char names[5][MAXPATHLEN];
2803 static unsigned int n;
2804
2805 n = (n + 1) % (sizeof names / sizeof names[0]);
2806
2807 return names[n];
2808}
2809
2810/* Return a copy of the full filename of a flist entry, using the indicated
2811 * buffer or one of 5 static buffers if fbuf is NULL. No size-checking is
2812 * done because we checked the size when creating the file_struct entry.
2813 */
2814char *f_name(const struct file_struct *f, char *fbuf)
2815{
2816 if (!f || !F_IS_ACTIVE(f))
2817 return NULL;
2818
2819 if (!fbuf)
2820 fbuf = f_name_buf();
2821
2822 if (f->dirname) {
2823 int len = strlen(f->dirname);
2824 memcpy(fbuf, f->dirname, len);
2825 fbuf[len] = '/';
2826 strlcpy(fbuf + len + 1, f->basename, MAXPATHLEN - (len + 1));
2827 } else
2828 strlcpy(fbuf, f->basename, MAXPATHLEN);
2829
2830 return fbuf;
2831}
2832
2833/* Do a non-recursive scan of the named directory, possibly ignoring all
2834 * exclude rules except for the daemon's. If "dlen" is >=0, it is the length
2835 * of the dirname string, and also indicates that "dirname" is a MAXPATHLEN
2836 * buffer (the functions we call will append names onto the end, but the old
2837 * dir value will be restored on exit). */
2838struct file_list *get_dirlist(char *dirname, int dlen, int ignore_filter_rules)
2839{
2840 struct file_list *dirlist;
2841 char dirbuf[MAXPATHLEN];
2842 int save_recurse = recurse;
2843 int save_xfer_dirs = xfer_dirs;
2844 int save_prune_empty_dirs = prune_empty_dirs;
2845
2846 if (dlen < 0) {
2847 dlen = strlcpy(dirbuf, dirname, MAXPATHLEN);
2848 if (dlen >= MAXPATHLEN)
2849 return NULL;
2850 dirname = dirbuf;
2851 }
2852
2853 dirlist = flist_new(FLIST_TEMP, "get_dirlist");
2854
2855 recurse = 0;
2856 xfer_dirs = 1;
2857 send_directory(ignore_filter_rules ? -2 : -1, dirlist, dirname, dlen, 0);
2858 xfer_dirs = save_xfer_dirs;
2859 recurse = save_recurse;
2860 if (do_progress)
2861 flist_count_offset += dirlist->used;
2862
2863 prune_empty_dirs = 0;
2864 dirlist->sorted = dirlist->files;
2865 flist_sort_and_clean(dirlist, 0);
2866 prune_empty_dirs = save_prune_empty_dirs;
2867
2868 if (verbose > 3)
2869 output_flist(dirlist);
2870
2871 return dirlist;
2872}