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