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