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