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