?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
Preparing for release of 3.0.7pre2
[rsync/qnx.git] / flist.c
blob7139b101bfb197a627096b654cea881ff7525b52
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, 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 != 0) {
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 != 0 && protocol_version < 30) {
602 if (protocol_version < 26) {
603 /* 32-bit dev_t and ino_t */
604 write_int(f, (int32)dev);
605 write_int(f, (int32)tmp_ino);
606 } else {
607 /* 64-bit dev_t and ino_t */
608 if (!(xflags & XMIT_SAME_DEV_pre30))
609 write_longint(f, dev);
610 write_longint(f, tmp_ino);
611 }
612 }
613 #endif
614
615 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
616 const char *sum;
617 if (S_ISREG(mode))
618 sum = tmp_sum;
619 else {
620 /* Prior to 28, we sent a useless set of nulls. */
621 sum = empty_sum;
622 }
623 write_buf(f, sum, checksum_len);
624 }
625
626 the_end:
627 strlcpy(lastname, fname, MAXPATHLEN);
628
629 if (S_ISREG(mode) || S_ISLNK(mode))
630 stats.total_size += F_LENGTH(file);
631 }
632
633 static struct file_struct *recv_file_entry(struct file_list *flist,
634 int xflags, int f)
635 {
636 static int64 modtime;
637 static mode_t mode;
638 #ifdef SUPPORT_HARD_LINKS
639 static int64 dev;
640 #endif
641 static dev_t rdev;
642 static uint32 rdev_major;
643 static uid_t uid;
644 static gid_t gid;
645 static uint16 gid_flags;
646 static char lastname[MAXPATHLEN], *lastdir;
647 static int lastdir_depth, lastdir_len = -1;
648 static unsigned int del_hier_name_len = 0;
649 static int in_del_hier = 0;
650 char thisname[MAXPATHLEN];
651 unsigned int l1 = 0, l2 = 0;
652 int alloc_len, basename_len, linkname_len;
653 int extra_len = file_extra_cnt * EXTRA_LEN;
654 int first_hlink_ndx = -1;
655 int64 file_length;
656 const char *basename;
657 struct file_struct *file;
658 alloc_pool_t *pool;
659 char *bp;
660
661 if (xflags & XMIT_SAME_NAME)
662 l1 = read_byte(f);
663
664 if (xflags & XMIT_LONG_NAME)
665 l2 = read_varint30(f);
666 else
667 l2 = read_byte(f);
668
669 if (l2 >= MAXPATHLEN - l1) {
670 rprintf(FERROR,
671 "overflow: xflags=0x%x l1=%d l2=%d lastname=%s [%s]\n",
672 xflags, l1, l2, lastname, who_am_i());
673 overflow_exit("recv_file_entry");
674 }
675
676 strlcpy(thisname, lastname, l1 + 1);
677 read_sbuf(f, &thisname[l1], l2);
678 thisname[l1 + l2] = 0;
679
680 /* Abuse basename_len for a moment... */
681 basename_len = strlcpy(lastname, thisname, MAXPATHLEN);
682
683 #ifdef ICONV_OPTION
684 if (ic_recv != (iconv_t)-1) {
685 xbuf outbuf, inbuf;
686
687 INIT_CONST_XBUF(outbuf, thisname);
688 INIT_XBUF(inbuf, lastname, basename_len, -1);
689
690 if (iconvbufs(ic_recv, &inbuf, &outbuf, 0) < 0) {
691 io_error |= IOERR_GENERAL;
692 rprintf(FERROR_UTF8,
693 "[%s] cannot convert filename: %s (%s)\n",
694 who_am_i(), lastname, strerror(errno));
695 outbuf.len = 0;
696 }
697 thisname[outbuf.len] = '\0';
698 }
699 #endif
700
701 if (*thisname)
702 clean_fname(thisname, 0);
703
704 if (sanitize_paths)
705 sanitize_path(thisname, thisname, "", 0, SP_DEFAULT);
706
707 if ((basename = strrchr(thisname, '/')) != NULL) {
708 int len = basename++ - thisname;
709 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
710 lastdir = new_array(char, len + 1);
711 memcpy(lastdir, thisname, len);
712 lastdir[len] = '\0';
713 lastdir_len = len;
714 lastdir_depth = count_dir_elements(lastdir);
715 }
716 } else
717 basename = thisname;
718 basename_len = strlen(basename) + 1; /* count the '\0' */
719
720 #ifdef SUPPORT_HARD_LINKS
721 if (protocol_version >= 30
722 && BITS_SETnUNSET(xflags, XMIT_HLINKED, XMIT_HLINK_FIRST)) {
723 first_hlink_ndx = read_varint(f);
724 if (first_hlink_ndx < 0 || first_hlink_ndx >= flist->ndx_start + flist->used) {
725 rprintf(FERROR,
726 "hard-link reference out of range: %d (%d)\n",
727 first_hlink_ndx, flist->ndx_start + flist->used);
728 exit_cleanup(RERR_PROTOCOL);
729 }
730 if (first_hlink_ndx >= flist->ndx_start) {
731 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
732 file_length = F_LENGTH(first);
733 modtime = first->modtime;
734 mode = first->mode;
735 if (preserve_uid)
736 uid = F_OWNER(first);
737 if (preserve_gid)
738 gid = F_GROUP(first);
739 if (preserve_devices && IS_DEVICE(mode)) {
740 uint32 *devp = F_RDEV_P(first);
741 rdev = MAKEDEV(DEV_MAJOR(devp), DEV_MINOR(devp));
742 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
743 }
744 if (preserve_links && S_ISLNK(mode))
745 linkname_len = strlen(F_SYMLINK(first)) + 1;
746 else
747 linkname_len = 0;
748 goto create_object;
749 }
750 }
751 #endif
752
753 file_length = read_varlong30(f, 3);
754 if (!(xflags & XMIT_SAME_TIME)) {
755 if (protocol_version >= 30) {
756 modtime = read_varlong(f, 4);
757 #if SIZEOF_TIME_T < SIZEOF_INT64
758 if (!am_generator && (int64)(time_t)modtime != modtime) {
759 rprintf(FERROR_XFER,
760 "Time value of %s truncated on receiver.\n",
761 lastname);
762 }
763 #endif
764 } else
765 modtime = read_int(f);
766 }
767 if (!(xflags & XMIT_SAME_MODE))
768 mode = from_wire_mode(read_int(f));
769
770 if (chmod_modes && !S_ISLNK(mode))
771 mode = tweak_mode(mode, chmod_modes);
772
773 if (preserve_uid && !(xflags & XMIT_SAME_UID)) {
774 if (protocol_version < 30)
775 uid = (uid_t)read_int(f);
776 else {
777 uid = (uid_t)read_varint(f);
778 if (xflags & XMIT_USER_NAME_FOLLOWS)
779 uid = recv_user_name(f, uid);
780 else if (inc_recurse && am_root && !numeric_ids)
781 uid = match_uid(uid);
782 }
783 }
784 if (preserve_gid && !(xflags & XMIT_SAME_GID)) {
785 if (protocol_version < 30)
786 gid = (gid_t)read_int(f);
787 else {
788 gid = (gid_t)read_varint(f);
789 gid_flags = 0;
790 if (xflags & XMIT_GROUP_NAME_FOLLOWS)
791 gid = recv_group_name(f, gid, &gid_flags);
792 else if (inc_recurse && (!am_root || !numeric_ids))
793 gid = match_gid(gid, &gid_flags);
794 }
795 }
796
797 if ((preserve_devices && IS_DEVICE(mode))
798 || (preserve_specials && IS_SPECIAL(mode))) {
799 if (protocol_version < 28) {
800 if (!(xflags & XMIT_SAME_RDEV_pre28))
801 rdev = (dev_t)read_int(f);
802 } else {
803 uint32 rdev_minor;
804 if (!(xflags & XMIT_SAME_RDEV_MAJOR))
805 rdev_major = read_varint30(f);
806 if (protocol_version >= 30)
807 rdev_minor = read_varint(f);
808 else if (xflags & XMIT_RDEV_MINOR_8_pre30)
809 rdev_minor = read_byte(f);
810 else
811 rdev_minor = read_int(f);
812 rdev = MAKEDEV(rdev_major, rdev_minor);
813 }
814 if (IS_DEVICE(mode))
815 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
816 file_length = 0;
817 } else if (protocol_version < 28)
818 rdev = MAKEDEV(0, 0);
819
820 #ifdef SUPPORT_LINKS
821 if (preserve_links && S_ISLNK(mode)) {
822 linkname_len = read_varint30(f) + 1; /* count the '\0' */
823 if (linkname_len <= 0 || linkname_len > MAXPATHLEN) {
824 rprintf(FERROR, "overflow: linkname_len=%d\n",
825 linkname_len - 1);
826 overflow_exit("recv_file_entry");
827 }
828 #ifdef ICONV_OPTION
829 /* We don't know how much extra room we need to convert
830 * the as-yet-unread symlink data, so let's hope that a
831 * double-size buffer is plenty. */
832 if (sender_symlink_iconv)
833 linkname_len *= 2;
834 #endif
835 if (munge_symlinks)
836 linkname_len += SYMLINK_PREFIX_LEN;
837 }
838 else
839 #endif
840 linkname_len = 0;
841
842 #ifdef SUPPORT_HARD_LINKS
843 create_object:
844 if (preserve_hard_links) {
845 if (protocol_version < 28 && S_ISREG(mode))
846 xflags |= XMIT_HLINKED;
847 if (xflags & XMIT_HLINKED)
848 extra_len += (inc_recurse+1) * EXTRA_LEN;
849 }
850 #endif
851
852 #ifdef SUPPORT_ACLS
853 /* Directories need an extra int32 for the default ACL. */
854 if (preserve_acls && S_ISDIR(mode))
855 extra_len += EXTRA_LEN;
856 #endif
857
858 if (always_checksum && S_ISREG(mode))
859 extra_len += SUM_EXTRA_CNT * EXTRA_LEN;
860
861 #if SIZEOF_INT64 >= 8
862 if (file_length > 0xFFFFFFFFu && S_ISREG(mode))
863 extra_len += EXTRA_LEN;
864 #endif
865 if (file_length < 0) {
866 rprintf(FERROR, "Offset underflow: file-length is negative\n");
867 exit_cleanup(RERR_UNSUPPORTED);
868 }
869
870 if (inc_recurse && S_ISDIR(mode)) {
871 if (one_file_system) {
872 /* Room to save the dir's device for -x */
873 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
874 }
875 pool = dir_flist->file_pool;
876 } else
877 pool = flist->file_pool;
878
879 #if EXTRA_ROUNDING > 0
880 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
881 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
882 #endif
883
884 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
885 + linkname_len;
886 bp = pool_alloc(pool, alloc_len, "recv_file_entry");
887
888 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
889 bp += extra_len;
890 file = (struct file_struct *)bp;
891 bp += FILE_STRUCT_LEN;
892
893 memcpy(bp, basename, basename_len);
894
895 #ifdef SUPPORT_HARD_LINKS
896 if (xflags & XMIT_HLINKED)
897 file->flags |= FLAG_HLINKED;
898 #endif
899 file->modtime = (time_t)modtime;
900 file->len32 = (uint32)file_length;
901 #if SIZEOF_INT64 >= 8
902 if (file_length > 0xFFFFFFFFu && S_ISREG(mode)) {
903 #if SIZEOF_CAPITAL_OFF_T < 8
904 rprintf(FERROR, "Offset overflow: attempted 64-bit file-length\n");
905 exit_cleanup(RERR_UNSUPPORTED);
906 #else
907 file->flags |= FLAG_LENGTH64;
908 OPT_EXTRA(file, 0)->unum = (uint32)(file_length >> 32);
909 #endif
910 }
911 #endif
912 file->mode = mode;
913 if (preserve_uid)
914 F_OWNER(file) = uid;
915 if (preserve_gid) {
916 F_GROUP(file) = gid;
917 file->flags |= gid_flags;
918 }
919 if (unsort_ndx)
920 F_NDX(file) = flist->used + flist->ndx_start;
921
922 if (basename != thisname) {
923 file->dirname = lastdir;
924 F_DEPTH(file) = lastdir_depth + 1;
925 } else
926 F_DEPTH(file) = 1;
927
928 if (S_ISDIR(mode)) {
929 if (basename_len == 1+1 && *basename == '.') /* +1 for '\0' */
930 F_DEPTH(file)--;
931 if (protocol_version >= 30) {
932 if (!(xflags & XMIT_NO_CONTENT_DIR)) {
933 if (xflags & XMIT_TOP_DIR)
934 file->flags |= FLAG_TOP_DIR;
935 file->flags |= FLAG_CONTENT_DIR;
936 } else if (xflags & XMIT_TOP_DIR)
937 file->flags |= FLAG_IMPLIED_DIR;
938 } else if (xflags & XMIT_TOP_DIR) {
939 in_del_hier = recurse;
940 del_hier_name_len = F_DEPTH(file) == 0 ? 0 : l1 + l2;
941 if (relative_paths && del_hier_name_len > 2
942 && lastname[del_hier_name_len-1] == '.'
943 && lastname[del_hier_name_len-2] == '/')
944 del_hier_name_len -= 2;
945 file->flags |= FLAG_TOP_DIR | FLAG_CONTENT_DIR;
946 } else if (in_del_hier) {
947 if (!relative_paths || !del_hier_name_len
948 || (l1 >= del_hier_name_len
949 && lastname[del_hier_name_len] == '/'))
950 file->flags |= FLAG_CONTENT_DIR;
951 else
952 in_del_hier = 0;
953 }
954 }
955
956 if (preserve_devices && IS_DEVICE(mode)) {
957 uint32 *devp = F_RDEV_P(file);
958 DEV_MAJOR(devp) = major(rdev);
959 DEV_MINOR(devp) = minor(rdev);
960 }
961
962 #ifdef SUPPORT_LINKS
963 if (linkname_len) {
964 bp += basename_len;
965 if (first_hlink_ndx >= flist->ndx_start) {
966 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
967 memcpy(bp, F_SYMLINK(first), linkname_len);
968 } else {
969 if (munge_symlinks) {
970 strlcpy(bp, SYMLINK_PREFIX, linkname_len);
971 bp += SYMLINK_PREFIX_LEN;
972 linkname_len -= SYMLINK_PREFIX_LEN;
973 }
974 #ifdef ICONV_OPTION
975 if (sender_symlink_iconv) {
976 xbuf outbuf, inbuf;
977
978 alloc_len = linkname_len;
979 linkname_len /= 2;
980
981 /* Read the symlink data into the end of our double-sized
982 * buffer and then convert it into the right spot. */
983 INIT_XBUF(inbuf, bp + alloc_len - linkname_len,
984 linkname_len - 1, (size_t)-1);
985 read_sbuf(f, inbuf.buf, inbuf.len);
986 INIT_XBUF(outbuf, bp, 0, alloc_len);
987
988 if (iconvbufs(ic_recv, &inbuf, &outbuf, 0) < 0) {
989 io_error |= IOERR_GENERAL;
990 rprintf(FERROR_XFER,
991 "[%s] cannot convert symlink data for: %s (%s)\n",
992 who_am_i(), full_fname(thisname), strerror(errno));
993 bp = (char*)file->basename;
994 *bp++ = '\0';
995 outbuf.len = 0;
996 }
997 bp[outbuf.len] = '\0';
998 } else
999 #endif
1000 read_sbuf(f, bp, linkname_len - 1);
1001 if (sanitize_paths && !munge_symlinks && *bp)
1002 sanitize_path(bp, bp, "", lastdir_depth, SP_DEFAULT);
1003 }
1004 }
1005 #endif
1006
1007 #ifdef SUPPORT_HARD_LINKS
1008 if (preserve_hard_links && xflags & XMIT_HLINKED) {
1009 if (protocol_version >= 30) {
1010 if (xflags & XMIT_HLINK_FIRST) {
1011 F_HL_GNUM(file) = flist->ndx_start + flist->used;
1012 } else
1013 F_HL_GNUM(file) = first_hlink_ndx;
1014 } else {
1015 static int32 cnt = 0;
1016 struct ht_int64_node *np;
1017 int64 ino;
1018 int32 ndx;
1019 if (protocol_version < 26) {
1020 dev = read_int(f);
1021 ino = read_int(f);
1022 } else {
1023 if (!(xflags & XMIT_SAME_DEV_pre30))
1024 dev = read_longint(f);
1025 ino = read_longint(f);
1026 }
1027 np = idev_find(dev, ino);
1028 ndx = (int32)(long)np->data - 1;
1029 if (ndx < 0) {
1030 ndx = cnt++;
1031 np->data = (void*)(long)cnt;
1032 }
1033 F_HL_GNUM(file) = ndx;
1034 }
1035 }
1036 #endif
1037
1038 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
1039 if (S_ISREG(mode))
1040 bp = F_SUM(file);
1041 else {
1042 /* Prior to 28, we get a useless set of nulls. */
1043 bp = tmp_sum;
1044 }
1045 if (first_hlink_ndx >= flist->ndx_start) {
1046 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
1047 memcpy(bp, F_SUM(first), checksum_len);
1048 } else
1049 read_buf(f, bp, checksum_len);
1050 }
1051
1052 #ifdef SUPPORT_ACLS
1053 if (preserve_acls && !S_ISLNK(mode))
1054 receive_acl(file, f);
1055 #endif
1056 #ifdef SUPPORT_XATTRS
1057 if (preserve_xattrs)
1058 receive_xattr(file, f );
1059 #endif
1060
1061 if (S_ISREG(mode) || S_ISLNK(mode))
1062 stats.total_size += file_length;
1063
1064 return file;
1065 }
1066
1067 /* Create a file_struct for a named file by reading its stat() information
1068 * and performing extensive checks against global options.
1069 *
1070 * Returns a pointer to the new file struct, or NULL if there was an error
1071 * or this file should be excluded.
1072 *
1073 * Note: Any error (here or in send_file_name) that results in the omission of
1074 * an existent source file from the file list should set
1075 * "io_error |= IOERR_GENERAL" to avoid deletion of the file from the
1076 * destination if --delete is on. */
1077 struct file_struct *make_file(const char *fname, struct file_list *flist,
1078 STRUCT_STAT *stp, int flags, int filter_level)
1079 {
1080 static char *lastdir;
1081 static int lastdir_len = -1;
1082 struct file_struct *file;
1083 char thisname[MAXPATHLEN];
1084 char linkname[MAXPATHLEN];
1085 int alloc_len, basename_len, linkname_len;
1086 int extra_len = file_extra_cnt * EXTRA_LEN;
1087 const char *basename;
1088 alloc_pool_t *pool;
1089 STRUCT_STAT st;
1090 char *bp;
1091
1092 if (strlcpy(thisname, fname, sizeof thisname) >= sizeof thisname) {
1093 io_error |= IOERR_GENERAL;
1094 rprintf(FERROR_XFER, "skipping overly long name: %s\n", fname);
1095 return NULL;
1096 }
1097 clean_fname(thisname, 0);
1098 if (sanitize_paths)
1099 sanitize_path(thisname, thisname, "", 0, SP_DEFAULT);
1100
1101 if (stp && S_ISDIR(stp->st_mode)) {
1102 st = *stp; /* Needed for "symlink/." with --relative. */
1103 *linkname = '\0'; /* make IBM code checker happy */
1104 } else if (readlink_stat(thisname, &st, linkname) != 0) {
1105 int save_errno = errno;
1106 /* See if file is excluded before reporting an error. */
1107 if (filter_level != NO_FILTERS
1108 && (is_excluded(thisname, 0, filter_level)
1109 || is_excluded(thisname, 1, filter_level))) {
1110 if (ignore_perishable && save_errno != ENOENT)
1111 non_perishable_cnt++;
1112 return NULL;
1113 }
1114 if (save_errno == ENOENT) {
1115 #ifdef SUPPORT_LINKS
1116 /* When our options tell us to follow a symlink that
1117 * points nowhere, tell the user about the symlink
1118 * instead of giving a "vanished" message. We only
1119 * dereference a symlink if one of the --copy*links
1120 * options was specified, so there's no need for the
1121 * extra lstat() if one of these options isn't on. */
1122 if ((copy_links || copy_unsafe_links || copy_dirlinks)
1123 && x_lstat(thisname, &st, NULL) == 0
1124 && S_ISLNK(st.st_mode)) {
1125 io_error |= IOERR_GENERAL;
1126 rprintf(FERROR_XFER, "symlink has no referent: %s\n",
1127 full_fname(thisname));
1128 } else
1129 #endif
1130 {
1131 enum logcode c = am_daemon && protocol_version < 28
1132 ? FERROR : FWARNING;
1133 io_error |= IOERR_VANISHED;
1134 rprintf(c, "file has vanished: %s\n",
1135 full_fname(thisname));
1136 }
1137 } else {
1138 io_error |= IOERR_GENERAL;
1139 rsyserr(FERROR_XFER, save_errno, "readlink_stat(%s) failed",
1140 full_fname(thisname));
1141 }
1142 return NULL;
1143 }
1144
1145 if (filter_level == NO_FILTERS)
1146 goto skip_filters;
1147
1148 if (S_ISDIR(st.st_mode)) {
1149 if (!xfer_dirs) {
1150 rprintf(FINFO, "skipping directory %s\n", thisname);
1151 return NULL;
1152 }
1153 /* -x only affects dirs because we need to avoid recursing
1154 * into a mount-point directory, not to avoid copying a
1155 * symlinked file if -L (or similar) was specified. */
1156 if (one_file_system && st.st_dev != filesystem_dev
1157 && BITS_SETnUNSET(flags, FLAG_CONTENT_DIR, FLAG_TOP_DIR)) {
1158 if (one_file_system > 1) {
1159 if (verbose > 1) {
1160 rprintf(FINFO,
1161 "[%s] skipping mount-point dir %s\n",
1162 who_am_i(), thisname);
1163 }
1164 return NULL;
1165 }
1166 flags |= FLAG_MOUNT_DIR;
1167 flags &= ~FLAG_CONTENT_DIR;
1168 }
1169 } else
1170 flags &= ~FLAG_CONTENT_DIR;
1171
1172 if (is_excluded(thisname, S_ISDIR(st.st_mode) != 0, filter_level)) {
1173 if (ignore_perishable)
1174 non_perishable_cnt++;
1175 return NULL;
1176 }
1177
1178 if (lp_ignore_nonreadable(module_id)) {
1179 #ifdef SUPPORT_LINKS
1180 if (!S_ISLNK(st.st_mode))
1181 #endif
1182 if (access(thisname, R_OK) != 0)
1183 return NULL;
1184 }
1185
1186 skip_filters:
1187
1188 /* Only divert a directory in the main transfer. */
1189 if (flist) {
1190 if (flist->prev && S_ISDIR(st.st_mode)
1191 && flags & FLAG_DIVERT_DIRS) {
1192 /* Room for parent/sibling/next-child info. */
1193 extra_len += DIRNODE_EXTRA_CNT * EXTRA_LEN;
1194 if (relative_paths)
1195 extra_len += PTR_EXTRA_CNT * EXTRA_LEN;
1196 pool = dir_flist->file_pool;
1197 } else
1198 pool = flist->file_pool;
1199 } else {
1200 #ifdef SUPPORT_ACLS
1201 /* Directories need an extra int32 for the default ACL. */
1202 if (preserve_acls && S_ISDIR(st.st_mode))
1203 extra_len += EXTRA_LEN;
1204 #endif
1205 pool = NULL;
1206 }
1207
1208 if (verbose > 2) {
1209 rprintf(FINFO, "[%s] make_file(%s,*,%d)\n",
1210 who_am_i(), thisname, filter_level);
1211 }
1212
1213 if ((basename = strrchr(thisname, '/')) != NULL) {
1214 int len = basename++ - thisname;
1215 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
1216 lastdir = new_array(char, len + 1);
1217 memcpy(lastdir, thisname, len);
1218 lastdir[len] = '\0';
1219 lastdir_len = len;
1220 }
1221 } else
1222 basename = thisname;
1223 basename_len = strlen(basename) + 1; /* count the '\0' */
1224
1225 #ifdef SUPPORT_LINKS
1226 linkname_len = S_ISLNK(st.st_mode) ? strlen(linkname) + 1 : 0;
1227 #else
1228 linkname_len = 0;
1229 #endif
1230
1231 #if SIZEOF_CAPITAL_OFF_T >= 8
1232 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode))
1233 extra_len += EXTRA_LEN;
1234 #endif
1235
1236 #if EXTRA_ROUNDING > 0
1237 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
1238 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
1239 #endif
1240
1241 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
1242 + linkname_len;
1243 if (pool)
1244 bp = pool_alloc(pool, alloc_len, "make_file");
1245 else {
1246 if (!(bp = new_array(char, alloc_len)))
1247 out_of_memory("make_file");
1248 }
1249
1250 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
1251 bp += extra_len;
1252 file = (struct file_struct *)bp;
1253 bp += FILE_STRUCT_LEN;
1254
1255 memcpy(bp, basename, basename_len);
1256
1257 #ifdef SUPPORT_HARD_LINKS
1258 if (preserve_hard_links && flist && flist->prev) {
1259 if (protocol_version >= 28
1260 ? (!S_ISDIR(st.st_mode) && st.st_nlink > 1)
1261 : S_ISREG(st.st_mode)) {
1262 tmp_dev = (int64)st.st_dev + 1;
1263 tmp_ino = (int64)st.st_ino;
1264 } else
1265 tmp_dev = 0;
1266 }
1267 #endif
1268
1269 #ifdef HAVE_STRUCT_STAT_ST_RDEV
1270 if (IS_DEVICE(st.st_mode)) {
1271 tmp_rdev = st.st_rdev;
1272 st.st_size = 0;
1273 } else if (IS_SPECIAL(st.st_mode))
1274 st.st_size = 0;
1275 #endif
1276
1277 file->flags = flags;
1278 file->modtime = st.st_mtime;
1279 file->len32 = (uint32)st.st_size;
1280 #if SIZEOF_CAPITAL_OFF_T >= 8
1281 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode)) {
1282 file->flags |= FLAG_LENGTH64;
1283 OPT_EXTRA(file, 0)->unum = (uint32)(st.st_size >> 32);
1284 }
1285 #endif
1286 file->mode = st.st_mode;
1287 if (uid_ndx) /* Check uid_ndx instead of preserve_uid for del support */
1288 F_OWNER(file) = st.st_uid;
1289 if (gid_ndx) /* Check gid_ndx instead of preserve_gid for del support */
1290 F_GROUP(file) = st.st_gid;
1291
1292 if (basename != thisname)
1293 file->dirname = lastdir;
1294
1295 #ifdef SUPPORT_LINKS
1296 if (linkname_len)
1297 memcpy(bp + basename_len, linkname, linkname_len);
1298 #endif
1299
1300 if (always_checksum && am_sender && S_ISREG(st.st_mode))
1301 file_checksum(thisname, tmp_sum, st.st_size);
1302
1303 if (am_sender)
1304 F_PATHNAME(file) = pathname;
1305 else if (!pool)
1306 F_DEPTH(file) = extra_len / EXTRA_LEN;
1307
1308 if (basename_len == 0+1) {
1309 if (!pool)
1310 unmake_file(file);
1311 return NULL;
1312 }
1313
1314 if (unsort_ndx)
1315 F_NDX(file) = dir_count;
1316
1317 return file;
1318 }
1319
1320 /* Only called for temporary file_struct entries created by make_file(). */
1321 void unmake_file(struct file_struct *file)
1322 {
1323 free(REQ_EXTRA(file, F_DEPTH(file)));
1324 }
1325
1326 static struct file_struct *send_file_name(int f, struct file_list *flist,
1327 const char *fname, STRUCT_STAT *stp,
1328 int flags, int filter_level)
1329 {
1330 struct file_struct *file;
1331
1332 file = make_file(fname, flist, stp, flags, filter_level);
1333 if (!file)
1334 return NULL;
1335
1336 if (chmod_modes && !S_ISLNK(file->mode))
1337 file->mode = tweak_mode(file->mode, chmod_modes);
1338
1339 if (f >= 0) {
1340 char fbuf[MAXPATHLEN];
1341 #ifdef SUPPORT_LINKS
1342 const char *symlink_name;
1343 int symlink_len;
1344 #ifdef ICONV_OPTION
1345 char symlink_buf[MAXPATHLEN];
1346 #endif
1347 #endif
1348 #if defined SUPPORT_ACLS || defined SUPPORT_XATTRS
1349 stat_x sx;
1350 #endif
1351
1352 #ifdef SUPPORT_LINKS
1353 if (preserve_links && S_ISLNK(file->mode)) {
1354 symlink_name = F_SYMLINK(file);
1355 symlink_len = strlen(symlink_name);
1356 if (symlink_len == 0) {
1357 io_error |= IOERR_GENERAL;
1358 f_name(file, fbuf);
1359 rprintf(FERROR_XFER,
1360 "skipping symlink with 0-length value: %s\n",
1361 full_fname(fbuf));
1362 return NULL;
1363 }
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 static void interpret_stat_error(const char *fname, int is_dir)
1601 {
1602 if (errno == ENOENT) {
1603 io_error |= IOERR_VANISHED;
1604 rprintf(FWARNING, "%s has vanished: %s\n",
1605 is_dir ? "directory" : "file", full_fname(fname));
1606 } else {
1607 io_error |= IOERR_GENERAL;
1608 rsyserr(FERROR_XFER, errno, "link_stat %s failed",
1609 full_fname(fname));
1610 }
1611 }
1612
1613 /* This function is normally called by the sender, but the receiving side also
1614 * calls it from get_dirlist() with f set to -1 so that we just construct the
1615 * file list in memory without sending it over the wire. Also, get_dirlist()
1616 * might call this with f set to -2, which also indicates that local filter
1617 * rules should be ignored. */
1618 static void send_directory(int f, struct file_list *flist, char *fbuf, int len,
1619 int flags)
1620 {
1621 struct dirent *di;
1622 unsigned remainder;
1623 char *p;
1624 DIR *d;
1625 int divert_dirs = (flags & FLAG_DIVERT_DIRS) != 0;
1626 int start = flist->used;
1627 int filter_level = f == -2 ? SERVER_FILTERS : ALL_FILTERS;
1628
1629 assert(flist != NULL);
1630
1631 if (!(d = opendir(fbuf))) {
1632 if (errno == ENOENT) {
1633 if (am_sender) /* Can abuse this for vanished error w/ENOENT: */
1634 interpret_stat_error(fbuf, True);
1635 return;
1636 }
1637 io_error |= IOERR_GENERAL;
1638 rsyserr(FERROR_XFER, errno, "opendir %s failed", full_fname(fbuf));
1639 return;
1640 }
1641
1642 p = fbuf + len;
1643 if (len != 1 || *fbuf != '/')
1644 *p++ = '/';
1645 *p = '\0';
1646 remainder = MAXPATHLEN - (p - fbuf);
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 if (strlcpy(p, dname, remainder) >= remainder) {
1654 io_error |= IOERR_GENERAL;
1655 rprintf(FERROR_XFER,
1656 "cannot send long-named file %s\n",
1657 full_fname(fbuf));
1658 continue;
1659 }
1660 if (dname[0] == '\0') {
1661 io_error |= IOERR_GENERAL;
1662 rprintf(FERROR_XFER,
1663 "cannot send file with empty name in %s\n",
1664 full_fname(fbuf));
1665 continue;
1666 }
1667
1668 send_file_name(f, flist, fbuf, NULL, flags, filter_level);
1669 }
1670
1671 fbuf[len] = '\0';
1672
1673 if (errno) {
1674 io_error |= IOERR_GENERAL;
1675 rsyserr(FERROR_XFER, errno, "readdir(%s)", full_fname(fbuf));
1676 }
1677
1678 closedir(d);
1679
1680 if (f >= 0 && recurse && !divert_dirs) {
1681 int i, end = flist->used - 1;
1682 /* send_if_directory() bumps flist->used, so use "end". */
1683 for (i = start; i <= end; i++)
1684 send_if_directory(f, flist, flist->files[i], fbuf, len, flags);
1685 }
1686 }
1687
1688 static void send_implied_dirs(int f, struct file_list *flist, char *fname,
1689 char *start, char *limit, int flags, char name_type)
1690 {
1691 static char lastpath[MAXPATHLEN] = "";
1692 static int lastpath_len = 0;
1693 static struct file_struct *lastpath_struct = NULL;
1694 struct file_struct *file;
1695 item_list *relname_list;
1696 relnamecache **rnpp;
1697 int len, need_new_dir, depth = 0;
1698 struct filter_list_struct save_filter_list = filter_list;
1699
1700 flags = (flags | FLAG_IMPLIED_DIR) & ~(FLAG_TOP_DIR | FLAG_CONTENT_DIR);
1701 filter_list.head = filter_list.tail = NULL; /* Don't filter implied dirs. */
1702
1703 if (inc_recurse) {
1704 if (lastpath_struct && F_PATHNAME(lastpath_struct) == pathname
1705 && lastpath_len == limit - fname
1706 && strncmp(lastpath, fname, lastpath_len) == 0)
1707 need_new_dir = 0;
1708 else
1709 need_new_dir = 1;
1710 } else {
1711 char *tp = fname, *lp = lastpath;
1712 /* Skip any initial directories in our path that we
1713 * have in common with lastpath. */
1714 assert(start == fname);
1715 for ( ; ; tp++, lp++) {
1716 if (tp == limit) {
1717 if (*lp == '/' || *lp == '\0')
1718 goto done;
1719 break;
1720 }
1721 if (*lp != *tp)
1722 break;
1723 if (*tp == '/') {
1724 start = tp;
1725 depth++;
1726 }
1727 }
1728 need_new_dir = 1;
1729 }
1730
1731 if (need_new_dir) {
1732 int save_copy_links = copy_links;
1733 int save_xfer_dirs = xfer_dirs;
1734 char *slash;
1735
1736 copy_links = xfer_dirs = 1;
1737
1738 *limit = '\0';
1739
1740 for (slash = start; (slash = strchr(slash+1, '/')) != NULL; ) {
1741 *slash = '\0';
1742 file = send_file_name(f, flist, fname, NULL, flags, ALL_FILTERS);
1743 depth++;
1744 if (!inc_recurse && file && S_ISDIR(file->mode))
1745 change_local_filter_dir(fname, strlen(fname), depth);
1746 *slash = '/';
1747 }
1748
1749 file = send_file_name(f, flist, fname, NULL, flags, ALL_FILTERS);
1750 if (inc_recurse) {
1751 if (file && !S_ISDIR(file->mode))
1752 file = NULL;
1753 lastpath_struct = file;
1754 } else if (file && S_ISDIR(file->mode))
1755 change_local_filter_dir(fname, strlen(fname), ++depth);
1756
1757 strlcpy(lastpath, fname, sizeof lastpath);
1758 lastpath_len = limit - fname;
1759
1760 *limit = '/';
1761
1762 copy_links = save_copy_links;
1763 xfer_dirs = save_xfer_dirs;
1764
1765 if (!inc_recurse)
1766 goto done;
1767 }
1768
1769 if (!lastpath_struct)
1770 goto done; /* dir must have vanished */
1771
1772 len = strlen(limit+1);
1773 memcpy(&relname_list, F_DIR_RELNAMES_P(lastpath_struct), sizeof relname_list);
1774 if (!relname_list) {
1775 if (!(relname_list = new0(item_list)))
1776 out_of_memory("send_implied_dirs");
1777 memcpy(F_DIR_RELNAMES_P(lastpath_struct), &relname_list, sizeof relname_list);
1778 }
1779 rnpp = EXPAND_ITEM_LIST(relname_list, relnamecache *, 32);
1780 if (!(*rnpp = (relnamecache*)new_array(char, sizeof (relnamecache) + len)))
1781 out_of_memory("send_implied_dirs");
1782 (*rnpp)->name_type = name_type;
1783 strlcpy((*rnpp)->fname, limit+1, len + 1);
1784
1785 done:
1786 filter_list = save_filter_list;
1787 }
1788
1789 static NORETURN void fatal_unsafe_io_error(void)
1790 {
1791 /* This (sadly) can only happen when pushing data because
1792 * the sender does not know about what kind of delete
1793 * is in effect on the receiving side when pulling. */
1794 rprintf(FERROR_XFER, "FATAL I/O ERROR: dying to avoid a --delete-during issue with a pre-3.0.7 receiver.\n");
1795 exit_cleanup(RERR_UNSUPPORTED);
1796 }
1797
1798 static void send1extra(int f, struct file_struct *file, struct file_list *flist)
1799 {
1800 char fbuf[MAXPATHLEN];
1801 item_list *relname_list;
1802 int len, dlen, flags = FLAG_DIVERT_DIRS | FLAG_CONTENT_DIR;
1803 size_t j;
1804
1805 f_name(file, fbuf);
1806 dlen = strlen(fbuf);
1807
1808 if (!change_pathname(file, NULL, 0))
1809 exit_cleanup(RERR_FILESELECT);
1810
1811 change_local_filter_dir(fbuf, dlen, send_dir_depth);
1812
1813 if (file->flags & FLAG_CONTENT_DIR) {
1814 if (one_file_system) {
1815 STRUCT_STAT st;
1816 if (link_stat(fbuf, &st, copy_dirlinks) != 0) {
1817 interpret_stat_error(fbuf, True);
1818 return;
1819 }
1820 filesystem_dev = st.st_dev;
1821 }
1822 send_directory(f, flist, fbuf, dlen, flags);
1823 }
1824
1825 if (!relative_paths)
1826 return;
1827
1828 memcpy(&relname_list, F_DIR_RELNAMES_P(file), sizeof relname_list);
1829 if (!relname_list)
1830 return;
1831
1832 for (j = 0; j < relname_list->count; j++) {
1833 char *slash;
1834 relnamecache *rnp = ((relnamecache**)relname_list->items)[j];
1835 char name_type = rnp->name_type;
1836
1837 fbuf[dlen] = '/';
1838 len = strlcpy(fbuf + dlen + 1, rnp->fname, sizeof fbuf - dlen - 1);
1839 free(rnp);
1840 if (len >= (int)sizeof fbuf)
1841 continue; /* Impossible... */
1842
1843 slash = strchr(fbuf+dlen+1, '/');
1844 if (slash) {
1845 send_implied_dirs(f, flist, fbuf, fbuf+dlen+1, slash, flags, name_type);
1846 continue;
1847 }
1848
1849 if (name_type != NORMAL_NAME) {
1850 STRUCT_STAT st;
1851 if (link_stat(fbuf, &st, 1) != 0) {
1852 interpret_stat_error(fbuf, True);
1853 continue;
1854 }
1855 send_file_name(f, flist, fbuf, &st, FLAG_TOP_DIR | flags, ALL_FILTERS);
1856 } else
1857 send_file_name(f, flist, fbuf, NULL, FLAG_TOP_DIR | flags, ALL_FILTERS);
1858 }
1859
1860 free(relname_list);
1861 }
1862
1863 void send_extra_file_list(int f, int at_least)
1864 {
1865 struct file_list *flist;
1866 int64 start_write;
1867 uint16 prev_flags;
1868 int old_cnt, save_io_error = io_error;
1869
1870 if (flist_eof)
1871 return;
1872
1873 /* Keep sending data until we have the requested number of
1874 * files in the upcoming file-lists. */
1875 old_cnt = cur_flist->used;
1876 for (flist = first_flist; flist != cur_flist; flist = flist->next)
1877 old_cnt += flist->used;
1878 while (file_total - old_cnt < at_least) {
1879 struct file_struct *file = dir_flist->sorted[send_dir_ndx];
1880 int dir_ndx, dstart = dir_count;
1881 const char *pathname = F_PATHNAME(file);
1882 int32 *dp;
1883
1884 flist = flist_new(0, "send_extra_file_list");
1885 start_write = stats.total_written;
1886
1887 if (unsort_ndx)
1888 dir_ndx = F_NDX(file);
1889 else
1890 dir_ndx = send_dir_ndx;
1891 write_ndx(f, NDX_FLIST_OFFSET - dir_ndx);
1892 flist->parent_ndx = dir_ndx;
1893
1894 send1extra(f, file, flist);
1895 prev_flags = file->flags;
1896 dp = F_DIR_NODE_P(file);
1897
1898 /* If there are any duplicate directory names that follow, we
1899 * send all the dirs together in one file-list. The dir_flist
1900 * tree links all the child subdirs onto the last dup dir. */
1901 while ((dir_ndx = DIR_NEXT_SIBLING(dp)) >= 0
1902 && dir_flist->sorted[dir_ndx]->flags & FLAG_DUPLICATE) {
1903 send_dir_ndx = dir_ndx;
1904 file = dir_flist->sorted[dir_ndx];
1905 /* Try to avoid some duplicate scanning of identical dirs. */
1906 if (F_PATHNAME(file) == pathname && prev_flags & FLAG_CONTENT_DIR)
1907 file->flags &= ~FLAG_CONTENT_DIR;
1908 send1extra(f, file, flist);
1909 prev_flags = file->flags;
1910 dp = F_DIR_NODE_P(file);
1911 }
1912
1913 if (io_error == save_io_error || ignore_errors)
1914 write_byte(f, 0);
1915 else if (use_safe_inc_flist) {
1916 write_shortint(f, XMIT_EXTENDED_FLAGS|XMIT_IO_ERROR_ENDLIST);
1917 write_varint(f, io_error);
1918 } else {
1919 if (delete_during)
1920 fatal_unsafe_io_error();
1921 write_byte(f, 0);
1922 }
1923
1924 if (need_unsorted_flist) {
1925 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
1926 out_of_memory("send_extra_file_list");
1927 memcpy(flist->sorted, flist->files,
1928 flist->used * sizeof (struct file_struct*));
1929 } else
1930 flist->sorted = flist->files;
1931
1932 flist_sort_and_clean(flist, 0);
1933
1934 add_dirs_to_tree(send_dir_ndx, flist, dir_count - dstart);
1935 flist_done_allocating(flist);
1936
1937 file_total += flist->used;
1938 stats.flist_size += stats.total_written - start_write;
1939 stats.num_files += flist->used;
1940 if (verbose > 3)
1941 output_flist(flist);
1942
1943 if (DIR_FIRST_CHILD(dp) >= 0) {
1944 send_dir_ndx = DIR_FIRST_CHILD(dp);
1945 send_dir_depth++;
1946 } else {
1947 while (DIR_NEXT_SIBLING(dp) < 0) {
1948 if ((send_dir_ndx = DIR_PARENT(dp)) < 0) {
1949 write_ndx(f, NDX_FLIST_EOF);
1950 flist_eof = 1;
1951 change_local_filter_dir(NULL, 0, 0);
1952 goto finish;
1953 }
1954 send_dir_depth--;
1955 file = dir_flist->sorted[send_dir_ndx];
1956 dp = F_DIR_NODE_P(file);
1957 }
1958 send_dir_ndx = DIR_NEXT_SIBLING(dp);
1959 }
1960 }
1961
1962 finish:
1963 if (io_error != save_io_error && !ignore_errors)
1964 send_msg_int(MSG_IO_ERROR, io_error);
1965 }
1966
1967 struct file_list *send_file_list(int f, int argc, char *argv[])
1968 {
1969 static const char *lastdir;
1970 static int lastdir_len = -1;
1971 int len, dirlen;
1972 STRUCT_STAT st;
1973 char *p, *dir;
1974 struct file_list *flist;
1975 struct timeval start_tv, end_tv;
1976 int64 start_write;
1977 int use_ff_fd = 0;
1978 int disable_buffering;
1979 int flags = recurse ? FLAG_CONTENT_DIR : 0;
1980 int reading_remotely = filesfrom_host != NULL;
1981 int rl_flags = (reading_remotely ? 0 : RL_DUMP_COMMENTS)
1982 #ifdef ICONV_OPTION
1983 | (filesfrom_convert ? RL_CONVERT : 0)
1984 #endif
1985 | (eol_nulls || reading_remotely ? RL_EOL_NULLS : 0);
1986 int implied_dot_dir = 0;
1987
1988 rprintf(FLOG, "building file list\n");
1989 if (show_filelist_p())
1990 start_filelist_progress("building file list");
1991 else if (inc_recurse && verbose && !am_server)
1992 rprintf(FCLIENT, "sending incremental file list\n");
1993
1994 start_write = stats.total_written;
1995 gettimeofday(&start_tv, NULL);
1996
1997 if (relative_paths && protocol_version >= 30)
1998 implied_dirs = 1; /* We send flagged implied dirs */
1999
2000 #ifdef SUPPORT_HARD_LINKS
2001 if (preserve_hard_links && protocol_version >= 30 && !cur_flist)
2002 init_hard_links();
2003 #endif
2004
2005 flist = cur_flist = flist_new(0, "send_file_list");
2006 if (inc_recurse) {
2007 dir_flist = flist_new(FLIST_TEMP, "send_file_list");
2008 flags |= FLAG_DIVERT_DIRS;
2009 } else
2010 dir_flist = cur_flist;
2011
2012 disable_buffering = io_start_buffering_out(f);
2013 if (filesfrom_fd >= 0) {
2014 if (argv[0] && !change_dir(argv[0], CD_NORMAL)) {
2015 rsyserr(FERROR_XFER, errno, "change_dir %s failed",
2016 full_fname(argv[0]));
2017 exit_cleanup(RERR_FILESELECT);
2018 }
2019 use_ff_fd = 1;
2020 }
2021
2022 if (!orig_dir)
2023 orig_dir = strdup(curr_dir);
2024
2025 while (1) {
2026 char fbuf[MAXPATHLEN], *fn, name_type;
2027
2028 if (use_ff_fd) {
2029 if (read_line(filesfrom_fd, fbuf, sizeof fbuf, rl_flags) == 0)
2030 break;
2031 sanitize_path(fbuf, fbuf, "", 0, SP_KEEP_DOT_DIRS);
2032 } else {
2033 if (argc-- == 0)
2034 break;
2035 strlcpy(fbuf, *argv++, MAXPATHLEN);
2036 if (sanitize_paths)
2037 sanitize_path(fbuf, fbuf, "", 0, SP_KEEP_DOT_DIRS);
2038 }
2039
2040 len = strlen(fbuf);
2041 if (relative_paths) {
2042 /* We clean up fbuf below. */
2043 name_type = NORMAL_NAME;
2044 } else if (!len || fbuf[len - 1] == '/') {
2045 if (len == 2 && fbuf[0] == '.') {
2046 /* Turn "./" into just "." rather than "./." */
2047 fbuf[--len] = '\0';
2048 } else {
2049 if (len + 1 >= MAXPATHLEN)
2050 overflow_exit("send_file_list");
2051 fbuf[len++] = '.';
2052 fbuf[len] = '\0';
2053 }
2054 name_type = DOTDIR_NAME;
2055 } else if (len > 1 && fbuf[len-1] == '.' && fbuf[len-2] == '.'
2056 && (len == 2 || fbuf[len-3] == '/')) {
2057 if (len + 2 >= MAXPATHLEN)
2058 overflow_exit("send_file_list");
2059 fbuf[len++] = '/';
2060 fbuf[len++] = '.';
2061 fbuf[len] = '\0';
2062 name_type = DOTDIR_NAME;
2063 } else if (fbuf[len-1] == '.' && (len == 1 || fbuf[len-2] == '/'))
2064 name_type = DOTDIR_NAME;
2065 else
2066 name_type = NORMAL_NAME;
2067
2068 dir = NULL;
2069
2070 if (!relative_paths) {
2071 p = strrchr(fbuf, '/');
2072 if (p) {
2073 *p = '\0';
2074 if (p == fbuf)
2075 dir = "/";
2076 else
2077 dir = fbuf;
2078 len -= p - fbuf + 1;
2079 fn = p + 1;
2080 } else
2081 fn = fbuf;
2082 } else {
2083 if ((p = strstr(fbuf, "/./")) != NULL) {
2084 *p = '\0';
2085 if (p == fbuf)
2086 dir = "/";
2087 else {
2088 dir = fbuf;
2089 clean_fname(dir, 0);
2090 }
2091 fn = p + 3;
2092 while (*fn == '/')
2093 fn++;
2094 if (!*fn)
2095 *--fn = '\0'; /* ensure room for '.' */
2096 } else
2097 fn = fbuf;
2098 /* A leading ./ can be used in relative mode to affect
2099 * the dest dir without its name being in the path. */
2100 if (*fn == '.' && fn[1] == '/' && !implied_dot_dir) {
2101 send_file_name(f, flist, ".", NULL,
2102 (flags | FLAG_IMPLIED_DIR) & ~FLAG_CONTENT_DIR,
2103 ALL_FILTERS);
2104 implied_dot_dir = 1;
2105 }
2106 len = clean_fname(fn, CFN_KEEP_TRAILING_SLASH
2107 | CFN_DROP_TRAILING_DOT_DIR);
2108 if (len == 1) {
2109 if (fn[0] == '/') {
2110 fn = "/.";
2111 len = 2;
2112 name_type = DOTDIR_NAME;
2113 } else if (fn[0] == '.')
2114 name_type = DOTDIR_NAME;
2115 } else if (fn[len-1] == '/') {
2116 fn[--len] = '\0';
2117 if (len == 1 && *fn == '.')
2118 name_type = DOTDIR_NAME;
2119 else
2120 name_type = SLASH_ENDING_NAME;
2121 }
2122 /* Reject a ".." dir in the active part of the path. */
2123 for (p = fn; (p = strstr(p, "..")) != NULL; p += 2) {
2124 if ((p[2] == '/' || p[2] == '\0')
2125 && (p == fn || p[-1] == '/')) {
2126 rprintf(FERROR,
2127 "found \"..\" dir in relative path: %s\n",
2128 fn);
2129 exit_cleanup(RERR_SYNTAX);
2130 }
2131 }
2132 }
2133
2134 if (!*fn) {
2135 len = 1;
2136 fn = ".";
2137 name_type = DOTDIR_NAME;
2138 }
2139
2140 dirlen = dir ? strlen(dir) : 0;
2141 if (dirlen != lastdir_len || memcmp(lastdir, dir, dirlen) != 0) {
2142 if (!change_pathname(NULL, dir, -dirlen))
2143 continue;
2144 lastdir = pathname;
2145 lastdir_len = pathname_len;
2146 } else if (!change_pathname(NULL, lastdir, lastdir_len))
2147 continue;
2148
2149 if (fn != fbuf)
2150 memmove(fbuf, fn, len + 1);
2151
2152 if (link_stat(fbuf, &st, copy_dirlinks || name_type != NORMAL_NAME) != 0
2153 || (name_type != DOTDIR_NAME && is_daemon_excluded(fbuf, S_ISDIR(st.st_mode)))
2154 || (relative_paths && path_is_daemon_excluded(fbuf, 1))) {
2155 io_error |= IOERR_GENERAL;
2156 rsyserr(FERROR_XFER, errno, "link_stat %s failed",
2157 full_fname(fbuf));
2158 continue;
2159 }
2160
2161 /* A dot-dir should not be excluded! */
2162 if (name_type != DOTDIR_NAME
2163 && is_excluded(fbuf, S_ISDIR(st.st_mode) != 0, ALL_FILTERS))
2164 continue;
2165
2166 if (S_ISDIR(st.st_mode) && !xfer_dirs) {
2167 rprintf(FINFO, "skipping directory %s\n", fbuf);
2168 continue;
2169 }
2170
2171 if (inc_recurse && relative_paths && *fbuf) {
2172 if ((p = strchr(fbuf+1, '/')) != NULL) {
2173 if (p - fbuf == 1 && *fbuf == '.') {
2174 if ((fn = strchr(p+1, '/')) != NULL)
2175 p = fn;
2176 } else
2177 fn = p;
2178 send_implied_dirs(f, flist, fbuf, fbuf, p, flags, name_type);
2179 if (fn == p)
2180 continue;
2181 }
2182 } else if (implied_dirs && (p=strrchr(fbuf,'/')) && p != fbuf) {
2183 /* Send the implied directories at the start of the
2184 * source spec, so we get their permissions right. */
2185 send_implied_dirs(f, flist, fbuf, fbuf, p, flags, 0);
2186 }
2187
2188 if (one_file_system)
2189 filesystem_dev = st.st_dev;
2190
2191 if (recurse || (xfer_dirs && name_type != NORMAL_NAME)) {
2192 struct file_struct *file;
2193 file = send_file_name(f, flist, fbuf, &st,
2194 FLAG_TOP_DIR | FLAG_CONTENT_DIR | flags,
2195 NO_FILTERS);
2196 if (!file)
2197 continue;
2198 if (inc_recurse) {
2199 if (name_type == DOTDIR_NAME) {
2200 if (send_dir_depth < 0) {
2201 send_dir_depth = 0;
2202 change_local_filter_dir(fbuf, len, send_dir_depth);
2203 }
2204 send_directory(f, flist, fbuf, len, flags);
2205 }
2206 } else
2207 send_if_directory(f, flist, file, fbuf, len, flags);
2208 } else
2209 send_file_name(f, flist, fbuf, &st, flags, NO_FILTERS);
2210 }
2211
2212 gettimeofday(&end_tv, NULL);
2213 stats.flist_buildtime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
2214 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
2215 if (stats.flist_buildtime == 0)
2216 stats.flist_buildtime = 1;
2217 start_tv = end_tv;
2218
2219 /* Indicate end of file list */
2220 if (io_error == 0 || ignore_errors)
2221 write_byte(f, 0);
2222 else if (use_safe_inc_flist) {
2223 write_shortint(f, XMIT_EXTENDED_FLAGS|XMIT_IO_ERROR_ENDLIST);
2224 write_varint(f, io_error);
2225 } else {
2226 if (delete_during && inc_recurse)
2227 fatal_unsafe_io_error();
2228 write_byte(f, 0);
2229 }
2230
2231 #ifdef SUPPORT_HARD_LINKS
2232 if (preserve_hard_links && protocol_version >= 30 && !inc_recurse)
2233 idev_destroy();
2234 #endif
2235
2236 if (show_filelist_p())
2237 finish_filelist_progress(flist);
2238
2239 gettimeofday(&end_tv, NULL);
2240 stats.flist_xfertime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
2241 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
2242
2243 /* When converting names, both sides keep an unsorted file-list array
2244 * because the names will differ on the sending and receiving sides
2245 * (both sides will use the unsorted index number for each item). */
2246
2247 /* Sort the list without removing any duplicates. This allows the
2248 * receiving side to ask for whatever name it kept. For incremental
2249 * recursion mode, the sender marks duplicate dirs so that it can
2250 * send them together in a single file-list. */
2251 if (need_unsorted_flist) {
2252 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
2253 out_of_memory("send_file_list");
2254 memcpy(flist->sorted, flist->files,
2255 flist->used * sizeof (struct file_struct*));
2256 } else
2257 flist->sorted = flist->files;
2258 flist_sort_and_clean(flist, 0);
2259 file_total += flist->used;
2260
2261 if (numeric_ids <= 0 && !inc_recurse)
2262 send_id_list(f);
2263
2264 set_msg_fd_in(-1);
2265
2266 /* send the io_error flag */
2267 if (protocol_version < 30)
2268 write_int(f, ignore_errors ? 0 : io_error);
2269 else if (!use_safe_inc_flist && io_error && !ignore_errors)
2270 send_msg_int(MSG_IO_ERROR, io_error);
2271
2272 if (disable_buffering)
2273 io_end_buffering_out();
2274
2275 stats.flist_size = stats.total_written - start_write;
2276 stats.num_files = flist->used;
2277
2278 if (verbose > 3)
2279 output_flist(flist);
2280
2281 if (verbose > 2)
2282 rprintf(FINFO, "send_file_list done\n");
2283
2284 if (inc_recurse) {
2285 send_dir_depth = 1;
2286 add_dirs_to_tree(-1, flist, dir_count);
2287 if (!file_total || strcmp(flist->sorted[flist->low]->basename, ".") != 0)
2288 flist->parent_ndx = -1;
2289 flist_done_allocating(flist);
2290 if (send_dir_ndx < 0) {
2291 write_ndx(f, NDX_FLIST_EOF);
2292 flist_eof = 1;
2293 }
2294 else if (file_total == 1) {
2295 /* If we're creating incremental file-lists and there
2296 * was just 1 item in the first file-list, send 1 more
2297 * file-list to check if this is a 1-file xfer. */
2298 send_extra_file_list(f, 1);
2299 }
2300 }
2301
2302 return flist;
2303 }
2304
2305 struct file_list *recv_file_list(int f)
2306 {
2307 struct file_list *flist;
2308 int dstart, flags;
2309 int64 start_read;
2310 int save_verbose = verbose;
2311
2312 if (!first_flist)
2313 rprintf(FLOG, "receiving file list\n");
2314 if (show_filelist_p())
2315 start_filelist_progress("receiving file list");
2316 else if (inc_recurse && verbose && !am_server && !first_flist)
2317 rprintf(FCLIENT, "receiving incremental file list\n");
2318
2319 start_read = stats.total_read;
2320
2321 #ifdef SUPPORT_HARD_LINKS
2322 if (preserve_hard_links && !first_flist)
2323 init_hard_links();
2324 #endif
2325
2326 flist = flist_new(0, "recv_file_list");
2327
2328 if (inc_recurse) {
2329 if (flist->ndx_start == 1)
2330 dir_flist = flist_new(FLIST_TEMP, "recv_file_list");
2331 dstart = dir_flist->used;
2332 } else {
2333 dir_flist = flist;
2334 dstart = 0;
2335 }
2336
2337 if (am_server && verbose > 2)
2338 verbose = 2;
2339 while ((flags = read_byte(f)) != 0) {
2340 struct file_struct *file;
2341
2342 if (protocol_version >= 28 && (flags & XMIT_EXTENDED_FLAGS))
2343 flags |= read_byte(f) << 8;
2344
2345 if (flags == (XMIT_EXTENDED_FLAGS|XMIT_IO_ERROR_ENDLIST)) {
2346 int err;
2347 if (!use_safe_inc_flist) {
2348 rprintf(FERROR, "Invalid flist flag: %x\n", flags);
2349 exit_cleanup(RERR_PROTOCOL);
2350 }
2351 err = read_varint(f);
2352 if (!ignore_errors)
2353 io_error |= err;
2354 break;
2355 }
2356
2357 flist_expand(flist, 1);
2358 file = recv_file_entry(flist, flags, f);
2359
2360 if (inc_recurse && S_ISDIR(file->mode)) {
2361 flist_expand(dir_flist, 1);
2362 dir_flist->files[dir_flist->used++] = file;
2363 }
2364
2365 flist->files[flist->used++] = file;
2366
2367 maybe_emit_filelist_progress(flist->used);
2368
2369 if (verbose > 2) {
2370 char *name = f_name(file, NULL);
2371 rprintf(FINFO, "recv_file_name(%s)\n", NS(name));
2372 }
2373 }
2374 file_total += flist->used;
2375 verbose = save_verbose;
2376
2377 if (verbose > 2)
2378 rprintf(FINFO, "received %d names\n", flist->used);
2379
2380 if (show_filelist_p())
2381 finish_filelist_progress(flist);
2382
2383 if (need_unsorted_flist) {
2384 /* Create an extra array of index pointers that we can sort for
2385 * the generator's use (for wading through the files in sorted
2386 * order and for calling flist_find()). We keep the "files"
2387 * list unsorted for our exchange of index numbers with the
2388 * other side (since their names may not sort the same). */
2389 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
2390 out_of_memory("recv_file_list");
2391 memcpy(flist->sorted, flist->files,
2392 flist->used * sizeof (struct file_struct*));
2393 if (inc_recurse && dir_flist->used > dstart) {
2394 static int dir_flist_malloced = 0;
2395 if (dir_flist_malloced < dir_flist->malloced) {
2396 dir_flist->sorted = realloc_array(dir_flist->sorted,
2397 struct file_struct *,
2398 dir_flist->malloced);
2399 dir_flist_malloced = dir_flist->malloced;
2400 }
2401 memcpy(dir_flist->sorted + dstart, dir_flist->files + dstart,
2402 (dir_flist->used - dstart) * sizeof (struct file_struct*));
2403 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2404 }
2405 } else {
2406 flist->sorted = flist->files;
2407 if (inc_recurse && dir_flist->used > dstart) {
2408 dir_flist->sorted = dir_flist->files;
2409 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2410 }
2411 }
2412
2413 if (inc_recurse)
2414 flist_done_allocating(flist);
2415 else if (f >= 0)
2416 recv_id_list(f, flist);
2417
2418 flist_sort_and_clean(flist, relative_paths);
2419
2420 if (protocol_version < 30) {
2421 /* Recv the io_error flag */
2422 if (ignore_errors)
2423 read_int(f);
2424 else
2425 io_error |= read_int(f);
2426 } else if (inc_recurse && flist->ndx_start == 1) {
2427 if (!file_total || strcmp(flist->sorted[flist->low]->basename, ".") != 0)
2428 flist->parent_ndx = -1;
2429 }
2430
2431 if (verbose > 3)
2432 output_flist(flist);
2433
2434 if (verbose > 2)
2435 rprintf(FINFO, "recv_file_list done\n");
2436
2437 stats.flist_size += stats.total_read - start_read;
2438 stats.num_files += flist->used;
2439
2440 return flist;
2441 }
2442
2443 /* This is only used once by the receiver if the very first file-list
2444 * has exactly one item in it. */
2445 void recv_additional_file_list(int f)
2446 {
2447 struct file_list *flist;
2448 int ndx = read_ndx(f);
2449 if (ndx == NDX_FLIST_EOF) {
2450 flist_eof = 1;
2451 change_local_filter_dir(NULL, 0, 0);
2452 } else {
2453 ndx = NDX_FLIST_OFFSET - ndx;
2454 if (ndx < 0 || ndx >= dir_flist->used) {
2455 ndx = NDX_FLIST_OFFSET - ndx;
2456 rprintf(FERROR,
2457 "[%s] Invalid dir index: %d (%d - %d)\n",
2458 who_am_i(), ndx, NDX_FLIST_OFFSET,
2459 NDX_FLIST_OFFSET - dir_flist->used + 1);
2460 exit_cleanup(RERR_PROTOCOL);
2461 }
2462 if (verbose > 3) {
2463 rprintf(FINFO, "[%s] receiving flist for dir %d\n",
2464 who_am_i(), ndx);
2465 }
2466 flist = recv_file_list(f);
2467 flist->parent_ndx = ndx;
2468 }
2469 }
2470
2471 /* Search for an identically-named item in the file list. Note that the
2472 * items must agree in their directory-ness, or no match is returned. */
2473 int flist_find(struct file_list *flist, struct file_struct *f)
2474 {
2475 int low = flist->low, high = flist->high;
2476 int diff, mid, mid_up;
2477
2478 while (low <= high) {
2479 mid = (low + high) / 2;
2480 if (F_IS_ACTIVE(flist->sorted[mid]))
2481 mid_up = mid;
2482 else {
2483 /* Scan for the next non-empty entry using the cached
2484 * distance values. If the value isn't fully up-to-
2485 * date, update it. */
2486 mid_up = mid + F_DEPTH(flist->sorted[mid]);
2487 if (!F_IS_ACTIVE(flist->sorted[mid_up])) {
2488 do {
2489 mid_up += F_DEPTH(flist->sorted[mid_up]);
2490 } while (!F_IS_ACTIVE(flist->sorted[mid_up]));
2491 F_DEPTH(flist->sorted[mid]) = mid_up - mid;
2492 }
2493 if (mid_up > high) {
2494 /* If there's nothing left above us, set high to
2495 * a non-empty entry below us and continue. */
2496 high = mid - (int)flist->sorted[mid]->len32;
2497 if (!F_IS_ACTIVE(flist->sorted[high])) {
2498 do {
2499 high -= (int)flist->sorted[high]->len32;
2500 } while (!F_IS_ACTIVE(flist->sorted[high]));
2501 flist->sorted[mid]->len32 = mid - high;
2502 }
2503 continue;
2504 }
2505 }
2506 diff = f_name_cmp(flist->sorted[mid_up], f);
2507 if (diff == 0) {
2508 if (protocol_version < 29
2509 && S_ISDIR(flist->sorted[mid_up]->mode)
2510 != S_ISDIR(f->mode))
2511 return -1;
2512 return mid_up;
2513 }
2514 if (diff < 0)
2515 low = mid_up + 1;
2516 else
2517 high = mid - 1;
2518 }
2519 return -1;
2520 }
2521
2522 /* Search for an identically-named item in the file list. Differs from
2523 * flist_find in that an item that agrees with "f" in directory-ness is
2524 * preferred but one that does not is still found. */
2525 int flist_find_ignore_dirness(struct file_list *flist, struct file_struct *f)
2526 {
2527 mode_t save_mode;
2528 int ndx;
2529
2530 /* First look for an item that agrees in directory-ness. */
2531 ndx = flist_find(flist, f);
2532 if (ndx >= 0)
2533 return ndx;
2534
2535 /* Temporarily flip f->mode to look for an item of opposite
2536 * directory-ness. */
2537 save_mode = f->mode;
2538 f->mode = S_ISDIR(f->mode) ? S_IFREG : S_IFDIR;
2539 ndx = flist_find(flist, f);
2540 f->mode = save_mode;
2541 return ndx;
2542 }
2543
2544 /*
2545 * Free up any resources a file_struct has allocated
2546 * and clear the file.
2547 */
2548 void clear_file(struct file_struct *file)
2549 {
2550 /* The +1 zeros out the first char of the basename. */
2551 memset(file, 0, FILE_STRUCT_LEN + 1);
2552 /* In an empty entry, F_DEPTH() is an offset to the next non-empty
2553 * entry. Likewise for len32 in the opposite direction. We assume
2554 * that we're alone for now since flist_find() will adjust the counts
2555 * it runs into that aren't up-to-date. */
2556 file->len32 = F_DEPTH(file) = 1;
2557 }
2558
2559 /* Allocate a new file list. */
2560 struct file_list *flist_new(int flags, char *msg)
2561 {
2562 struct file_list *flist;
2563
2564 if (!(flist = new0(struct file_list)))
2565 out_of_memory(msg);
2566
2567 if (flags & FLIST_TEMP) {
2568 if (!(flist->file_pool = pool_create(SMALL_EXTENT, 0,
2569 out_of_memory, POOL_INTERN)))
2570 out_of_memory(msg);
2571 } else {
2572 /* This is a doubly linked list with prev looping back to
2573 * the end of the list, but the last next pointer is NULL. */
2574 if (!first_flist) {
2575 flist->file_pool = pool_create(NORMAL_EXTENT, 0,
2576 out_of_memory, POOL_INTERN);
2577 if (!flist->file_pool)
2578 out_of_memory(msg);
2579
2580 flist->ndx_start = flist->flist_num = inc_recurse ? 1 : 0;
2581
2582 first_flist = cur_flist = flist->prev = flist;
2583 } else {
2584 struct file_list *prev = first_flist->prev;
2585
2586 flist->file_pool = first_flist->file_pool;
2587
2588 flist->ndx_start = prev->ndx_start + prev->used + 1;
2589 flist->flist_num = prev->flist_num + 1;
2590
2591 flist->prev = prev;
2592 prev->next = first_flist->prev = flist;
2593 }
2594 flist->pool_boundary = pool_boundary(flist->file_pool, 0);
2595 flist_cnt++;
2596 }
2597
2598 return flist;
2599 }
2600
2601 /* Free up all elements in a flist. */
2602 void flist_free(struct file_list *flist)
2603 {
2604 if (!flist->prev) {
2605 /* Was FLIST_TEMP dir-list. */
2606 } else if (flist == flist->prev) {
2607 first_flist = cur_flist = NULL;
2608 file_total = 0;
2609 flist_cnt = 0;
2610 } else {
2611 if (flist == cur_flist)
2612 cur_flist = flist->next;
2613 if (flist == first_flist)
2614 first_flist = first_flist->next;
2615 else {
2616 flist->prev->next = flist->next;
2617 if (!flist->next)
2618 flist->next = first_flist;
2619 }
2620 flist->next->prev = flist->prev;
2621 file_total -= flist->used;
2622 flist_cnt--;
2623 }
2624
2625 if (!flist->prev || !flist_cnt)
2626 pool_destroy(flist->file_pool);
2627 else
2628 pool_free_old(flist->file_pool, flist->pool_boundary);
2629
2630 if (flist->sorted && flist->sorted != flist->files)
2631 free(flist->sorted);
2632 free(flist->files);
2633 free(flist);
2634 }
2635
2636 /* This routine ensures we don't have any duplicate names in our file list.
2637 * duplicate names can cause corruption because of the pipelining. */
2638 static void flist_sort_and_clean(struct file_list *flist, int strip_root)
2639 {
2640 char fbuf[MAXPATHLEN];
2641 int i, prev_i;
2642
2643 if (!flist)
2644 return;
2645 if (flist->used == 0) {
2646 flist->high = -1;
2647 flist->low = 0;
2648 return;
2649 }
2650
2651 fsort(flist->sorted, flist->used);
2652
2653 if (!am_sender || inc_recurse) {
2654 for (i = prev_i = 0; i < flist->used; i++) {
2655 if (F_IS_ACTIVE(flist->sorted[i])) {
2656 prev_i = i;
2657 break;
2658 }
2659 }
2660 flist->low = prev_i;
2661 } else {
2662 i = prev_i = flist->used - 1;
2663 flist->low = 0;
2664 }
2665
2666 while (++i < flist->used) {
2667 int j;
2668 struct file_struct *file = flist->sorted[i];
2669
2670 if (!F_IS_ACTIVE(file))
2671 continue;
2672 if (f_name_cmp(file, flist->sorted[prev_i]) == 0)
2673 j = prev_i;
2674 else if (protocol_version >= 29 && S_ISDIR(file->mode)) {
2675 int save_mode = file->mode;
2676 /* Make sure that this directory doesn't duplicate a
2677 * non-directory earlier in the list. */
2678 flist->high = prev_i;
2679 file->mode = S_IFREG;
2680 j = flist_find(flist, file);
2681 file->mode = save_mode;
2682 } else
2683 j = -1;
2684 if (j >= 0) {
2685 int keep, drop;
2686 /* If one is a dir and the other is not, we want to
2687 * keep the dir because it might have contents in the
2688 * list. Otherwise keep the first one. */
2689 if (S_ISDIR(file->mode)) {
2690 struct file_struct *fp = flist->sorted[j];
2691 if (!S_ISDIR(fp->mode))
2692 keep = i, drop = j;
2693 else {
2694 if (am_sender)
2695 file->flags |= FLAG_DUPLICATE;
2696 else { /* Make sure we merge our vital flags. */
2697 fp->flags |= file->flags & (FLAG_TOP_DIR|FLAG_CONTENT_DIR);
2698 fp->flags &= file->flags | ~FLAG_IMPLIED_DIR;
2699 }
2700 keep = j, drop = i;
2701 }
2702 } else
2703 keep = j, drop = i;
2704
2705 if (!am_sender) {
2706 if (verbose > 1) {
2707 rprintf(FINFO,
2708 "removing duplicate name %s from file list (%d)\n",
2709 f_name(file, fbuf), drop + flist->ndx_start);
2710 }
2711 clear_file(flist->sorted[drop]);
2712 }
2713
2714 if (keep == i) {
2715 if (flist->low == drop) {
2716 for (j = drop + 1;
2717 j < i && !F_IS_ACTIVE(flist->sorted[j]);
2718 j++) {}
2719 flist->low = j;
2720 }
2721 prev_i = i;
2722 }
2723 } else
2724 prev_i = i;
2725 }
2726 flist->high = prev_i;
2727
2728 if (strip_root) {
2729 /* We need to strip off the leading slashes for relative
2730 * paths, but this must be done _after_ the sorting phase. */
2731 for (i = flist->low; i <= flist->high; i++) {
2732 struct file_struct *file = flist->sorted[i];
2733
2734 if (!file->dirname)
2735 continue;
2736 while (*file->dirname == '/')
2737 file->dirname++;
2738 if (!*file->dirname)
2739 file->dirname = NULL;
2740 }
2741 }
2742
2743 if (prune_empty_dirs && !am_sender) {
2744 int j, prev_depth = 0;
2745
2746 prev_i = 0; /* It's OK that this isn't really true. */
2747
2748 for (i = flist->low; i <= flist->high; i++) {
2749 struct file_struct *fp, *file = flist->sorted[i];
2750
2751 /* This temporarily abuses the F_DEPTH() value for a
2752 * directory that is in a chain that might get pruned.
2753 * We restore the old value if it gets a reprieve. */
2754 if (S_ISDIR(file->mode) && F_DEPTH(file)) {
2755 /* Dump empty dirs when coming back down. */
2756 for (j = prev_depth; j >= F_DEPTH(file); j--) {
2757 fp = flist->sorted[prev_i];
2758 if (F_DEPTH(fp) >= 0)
2759 break;
2760 prev_i = -F_DEPTH(fp)-1;
2761 clear_file(fp);
2762 }
2763 prev_depth = F_DEPTH(file);
2764 if (is_excluded(f_name(file, fbuf), 1,
2765 ALL_FILTERS)) {
2766 /* Keep dirs through this dir. */
2767 for (j = prev_depth-1; ; j--) {
2768 fp = flist->sorted[prev_i];
2769 if (F_DEPTH(fp) >= 0)
2770 break;
2771 prev_i = -F_DEPTH(fp)-1;
2772 F_DEPTH(fp) = j;
2773 }
2774 } else
2775 F_DEPTH(file) = -prev_i-1;
2776 prev_i = i;
2777 } else {
2778 /* Keep dirs through this non-dir. */
2779 for (j = prev_depth; ; j--) {
2780 fp = flist->sorted[prev_i];
2781 if (F_DEPTH(fp) >= 0)
2782 break;
2783 prev_i = -F_DEPTH(fp)-1;
2784 F_DEPTH(fp) = j;
2785 }
2786 }
2787 }
2788 /* Dump all remaining empty dirs. */
2789 while (1) {
2790 struct file_struct *fp = flist->sorted[prev_i];
2791 if (F_DEPTH(fp) >= 0)
2792 break;
2793 prev_i = -F_DEPTH(fp)-1;
2794 clear_file(fp);
2795 }
2796
2797 for (i = flist->low; i <= flist->high; i++) {
2798 if (F_IS_ACTIVE(flist->sorted[i]))
2799 break;
2800 }
2801 flist->low = i;
2802 for (i = flist->high; i >= flist->low; i--) {
2803 if (F_IS_ACTIVE(flist->sorted[i]))
2804 break;
2805 }
2806 flist->high = i;
2807 }
2808 }
2809
2810 static void output_flist(struct file_list *flist)
2811 {
2812 char uidbuf[16], gidbuf[16], depthbuf[16];
2813 struct file_struct *file;
2814 const char *root, *dir, *slash, *name, *trail;
2815 const char *who = who_am_i();
2816 int i;
2817
2818 rprintf(FINFO, "[%s] flist start=%d, used=%d, low=%d, high=%d\n",
2819 who, flist->ndx_start, flist->used, flist->low, flist->high);
2820 for (i = 0; i < flist->used; i++) {
2821 file = flist->files[i];
2822 if ((am_root || am_sender) && uid_ndx) {
2823 snprintf(uidbuf, sizeof uidbuf, " uid=%u",
2824 F_OWNER(file));
2825 } else
2826 *uidbuf = '\0';
2827 if (gid_ndx) {
2828 static char parens[] = "(\0)\0\0\0";
2829 char *pp = parens + (file->flags & FLAG_SKIP_GROUP ? 0 : 3);
2830 snprintf(gidbuf, sizeof gidbuf, " gid=%s%u%s",
2831 pp, F_GROUP(file), pp + 2);
2832 } else
2833 *gidbuf = '\0';
2834 if (!am_sender)
2835 snprintf(depthbuf, sizeof depthbuf, "%d", F_DEPTH(file));
2836 if (F_IS_ACTIVE(file)) {
2837 root = am_sender ? NS(F_PATHNAME(file)) : depthbuf;
2838 if ((dir = file->dirname) == NULL)
2839 dir = slash = "";
2840 else
2841 slash = "/";
2842 name = file->basename;
2843 trail = S_ISDIR(file->mode) ? "/" : "";
2844 } else
2845 root = dir = slash = name = trail = "";
2846 rprintf(FINFO,
2847 "[%s] i=%d %s %s%s%s%s mode=0%o len=%.0f%s%s flags=%x\n",
2848 who, i + flist->ndx_start,
2849 root, dir, slash, name, trail,
2850 (int)file->mode, (double)F_LENGTH(file),
2851 uidbuf, gidbuf, file->flags);
2852 }
2853 }
2854
2855 enum fnc_state { s_DIR, s_SLASH, s_BASE, s_TRAILING };
2856 enum fnc_type { t_PATH, t_ITEM };
2857
2858 static int found_prefix;
2859
2860 /* Compare the names of two file_struct entities, similar to how strcmp()
2861 * would do if it were operating on the joined strings.
2862 *
2863 * Some differences beginning with protocol_version 29: (1) directory names
2864 * are compared with an assumed trailing slash so that they compare in a
2865 * way that would cause them to sort immediately prior to any content they
2866 * may have; (2) a directory of any name compares after a non-directory of
2867 * any name at the same depth; (3) a directory with name "." compares prior
2868 * to anything else. These changes mean that a directory and a non-dir
2869 * with the same name will not compare as equal (protocol_version >= 29).
2870 *
2871 * The dirname component can be an empty string, but the basename component
2872 * cannot (and never is in the current codebase). The basename component
2873 * may be NULL (for a removed item), in which case it is considered to be
2874 * after any existing item. */
2875 int f_name_cmp(const struct file_struct *f1, const struct file_struct *f2)
2876 {
2877 int dif;
2878 const uchar *c1, *c2;
2879 enum fnc_state state1, state2;
2880 enum fnc_type type1, type2;
2881 enum fnc_type t_path = protocol_version >= 29 ? t_PATH : t_ITEM;
2882
2883 if (!f1 || !F_IS_ACTIVE(f1)) {
2884 if (!f2 || !F_IS_ACTIVE(f2))
2885 return 0;
2886 return -1;
2887 }
2888 if (!f2 || !F_IS_ACTIVE(f2))
2889 return 1;
2890
2891 c1 = (uchar*)f1->dirname;
2892 c2 = (uchar*)f2->dirname;
2893 if (c1 == c2)
2894 c1 = c2 = NULL;
2895 if (!c1) {
2896 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2897 c1 = (const uchar*)f1->basename;
2898 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2899 type1 = t_ITEM;
2900 state1 = s_TRAILING;
2901 c1 = (uchar*)"";
2902 } else
2903 state1 = s_BASE;
2904 } else {
2905 type1 = t_path;
2906 state1 = s_DIR;
2907 }
2908 if (!c2) {
2909 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2910 c2 = (const uchar*)f2->basename;
2911 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2912 type2 = t_ITEM;
2913 state2 = s_TRAILING;
2914 c2 = (uchar*)"";
2915 } else
2916 state2 = s_BASE;
2917 } else {
2918 type2 = t_path;
2919 state2 = s_DIR;
2920 }
2921
2922 if (type1 != type2)
2923 return type1 == t_PATH ? 1 : -1;
2924
2925 do {
2926 if (!*c1) {
2927 switch (state1) {
2928 case s_DIR:
2929 state1 = s_SLASH;
2930 c1 = (uchar*)"/";
2931 break;
2932 case s_SLASH:
2933 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2934 c1 = (const uchar*)f1->basename;
2935 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2936 type1 = t_ITEM;
2937 state1 = s_TRAILING;
2938 c1 = (uchar*)"";
2939 } else
2940 state1 = s_BASE;
2941 break;
2942 case s_BASE:
2943 state1 = s_TRAILING;
2944 if (type1 == t_PATH) {
2945 c1 = (uchar*)"/";
2946 break;
2947 }
2948 /* FALL THROUGH */
2949 case s_TRAILING:
2950 type1 = t_ITEM;
2951 break;
2952 }
2953 if (*c2 && type1 != type2)
2954 return type1 == t_PATH ? 1 : -1;
2955 }
2956 if (!*c2) {
2957 switch (state2) {
2958 case s_DIR:
2959 state2 = s_SLASH;
2960 c2 = (uchar*)"/";
2961 break;
2962 case s_SLASH:
2963 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2964 c2 = (const uchar*)f2->basename;
2965 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2966 type2 = t_ITEM;
2967 state2 = s_TRAILING;
2968 c2 = (uchar*)"";
2969 } else
2970 state2 = s_BASE;
2971 break;
2972 case s_BASE:
2973 state2 = s_TRAILING;
2974 if (type2 == t_PATH) {
2975 c2 = (uchar*)"/";
2976 break;
2977 }
2978 /* FALL THROUGH */
2979 case s_TRAILING:
2980 found_prefix = 1;
2981 if (!*c1)
2982 return 0;
2983 type2 = t_ITEM;
2984 break;
2985 }
2986 if (type1 != type2)
2987 return type1 == t_PATH ? 1 : -1;
2988 }
2989 } while ((dif = (int)*c1++ - (int)*c2++) == 0);
2990
2991 return dif;
2992 }
2993
2994 /* Returns 1 if f1's filename has all of f2's filename as a prefix. This does
2995 * not match if f2's basename is not an exact match of a path element in f1.
2996 * E.g. /path/foo is not a prefix of /path/foobar/baz, but /path/foobar is. */
2997 int f_name_has_prefix(const struct file_struct *f1, const struct file_struct *f2)
2998 {
2999 found_prefix = 0;
3000 f_name_cmp(f1, f2);
3001 return found_prefix;
3002 }
3003
3004 char *f_name_buf(void)
3005 {
3006 static char names[5][MAXPATHLEN];
3007 static unsigned int n;
3008
3009 n = (n + 1) % (sizeof names / sizeof names[0]);
3010
3011 return names[n];
3012 }
3013
3014 /* Return a copy of the full filename of a flist entry, using the indicated
3015 * buffer or one of 5 static buffers if fbuf is NULL. No size-checking is
3016 * done because we checked the size when creating the file_struct entry.
3017 */
3018 char *f_name(const struct file_struct *f, char *fbuf)
3019 {
3020 if (!f || !F_IS_ACTIVE(f))
3021 return NULL;
3022
3023 if (!fbuf)
3024 fbuf = f_name_buf();
3025
3026 if (f->dirname) {
3027 int len = strlen(f->dirname);
3028 memcpy(fbuf, f->dirname, len);
3029 fbuf[len] = '/';
3030 strlcpy(fbuf + len + 1, f->basename, MAXPATHLEN - (len + 1));
3031 } else
3032 strlcpy(fbuf, f->basename, MAXPATHLEN);
3033
3034 return fbuf;
3035 }
3036
3037 /* Do a non-recursive scan of the named directory, possibly ignoring all
3038 * exclude rules except for the daemon's. If "dlen" is >=0, it is the length
3039 * of the dirname string, and also indicates that "dirname" is a MAXPATHLEN
3040 * buffer (the functions we call will append names onto the end, but the old
3041 * dir value will be restored on exit). */
3042 struct file_list *get_dirlist(char *dirname, int dlen, int ignore_filter_rules)
3043 {
3044 struct file_list *dirlist;
3045 char dirbuf[MAXPATHLEN];
3046 int save_recurse = recurse;
3047 int save_xfer_dirs = xfer_dirs;
3048 int save_prune_empty_dirs = prune_empty_dirs;
3049
3050 if (dlen < 0) {
3051 dlen = strlcpy(dirbuf, dirname, MAXPATHLEN);
3052 if (dlen >= MAXPATHLEN)
3053 return NULL;
3054 dirname = dirbuf;
3055 }
3056
3057 dirlist = flist_new(FLIST_TEMP, "get_dirlist");
3058
3059 recurse = 0;
3060 xfer_dirs = 1;
3061 send_directory(ignore_filter_rules ? -2 : -1, dirlist, dirname, dlen, FLAG_CONTENT_DIR);
3062 xfer_dirs = save_xfer_dirs;
3063 recurse = save_recurse;
3064 if (do_progress)
3065 flist_count_offset += dirlist->used;
3066
3067 prune_empty_dirs = 0;
3068 dirlist->sorted = dirlist->files;
3069 flist_sort_and_clean(dirlist, 0);
3070 prune_empty_dirs = save_prune_empty_dirs;
3071
3072 if (verbose > 3)
3073 output_flist(dirlist);
3074
3075 return dirlist;
3076 }