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