?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
Fixed a bug in the truncating of daemon-excluded paths.
[rsync.git] / flist.c
blob8eaebd1a4f1b6923703eda1de1d3ce0ebaccde6d
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 server_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 DOT_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 (server_filter_list.head
238 && check_filter(&server_filter_list, fname, is_dir) < 0) {
239 errno = ENOENT;
240 return 1;
241 }
242 return 0;
243 }
244
245 /* This function is used to check if a file should be included/excluded
246 * from the list of files based on its name and type etc. The value of
247 * filter_level is set to either SERVER_FILTERS or ALL_FILTERS. */
248 static int is_excluded(const char *fname, int is_dir, int filter_level)
249 {
250 #if 0 /* This currently never happens, so avoid a useless compare. */
251 if (filter_level == NO_FILTERS)
252 return 0;
253 #endif
254 if (fname) {
255 /* never exclude '.', even if somebody does --exclude '*' */
256 if (fname[0] == '.' && !fname[1])
257 return 0;
258 /* Handle the -R version of the '.' dir. */
259 if (fname[0] == '/') {
260 int len = strlen(fname);
261 if (fname[len-1] == '.' && fname[len-2] == '/')
262 return 0;
263 }
264 }
265 if (is_daemon_excluded(fname, is_dir))
266 return 1;
267 if (filter_level != ALL_FILTERS)
268 return 0;
269 if (filter_list.head
270 && check_filter(&filter_list, fname, is_dir) < 0)
271 return 1;
272 return 0;
273 }
274
275 static void send_directory(int f, struct file_list *flist,
276 char *fbuf, int len, int flags);
277
278 static const char *pathname, *orig_dir;
279 static int pathname_len;
280
281
282 /* Make sure flist can hold at least flist->used + extra entries. */
283 static void flist_expand(struct file_list *flist, int extra)
284 {
285 struct file_struct **new_ptr;
286
287 if (flist->used + extra <= flist->malloced)
288 return;
289
290 if (flist->malloced < FLIST_START)
291 flist->malloced = FLIST_START;
292 else if (flist->malloced >= FLIST_LINEAR)
293 flist->malloced += FLIST_LINEAR;
294 else
295 flist->malloced *= 2;
296
297 /* In case count jumped or we are starting the list
298 * with a known size just set it. */
299 if (flist->malloced < flist->used + extra)
300 flist->malloced = flist->used + extra;
301
302 new_ptr = realloc_array(flist->files, struct file_struct *,
303 flist->malloced);
304
305 if (verbose >= 2 && flist->malloced != FLIST_START) {
306 rprintf(FCLIENT, "[%s] expand file_list pointer array to %.0f bytes, did%s move\n",
307 who_am_i(),
308 (double)sizeof flist->files[0] * flist->malloced,
309 (new_ptr == flist->files) ? " not" : "");
310 }
311
312 flist->files = new_ptr;
313
314 if (!flist->files)
315 out_of_memory("flist_expand");
316 }
317
318 static void flist_done_allocating(struct file_list *flist)
319 {
320 void *ptr = pool_boundary(flist->file_pool, 8*1024);
321 if (flist->pool_boundary == ptr)
322 flist->pool_boundary = NULL; /* list didn't use any pool memory */
323 else
324 flist->pool_boundary = ptr;
325 }
326
327 int push_pathname(const char *dir, int len)
328 {
329 if (dir == pathname)
330 return 1;
331
332 if (!orig_dir)
333 orig_dir = strdup(curr_dir);
334
335 if (pathname && !pop_dir(orig_dir)) {
336 rsyserr(FERROR, errno, "pop_dir %s failed",
337 full_fname(orig_dir));
338 exit_cleanup(RERR_FILESELECT);
339 }
340
341 if (dir && !push_dir(dir, 0)) {
342 io_error |= IOERR_GENERAL;
343 rsyserr(FERROR, errno, "push_dir %s failed in %s",
344 full_fname(dir), curr_dir);
345 return 0;
346 }
347
348 pathname = dir;
349 pathname_len = len >= 0 ? len : dir ? (int)strlen(dir) : 0;
350
351 return 1;
352 }
353
354 static void send_file_entry(int f, struct file_struct *file, int ndx, int first_ndx)
355 {
356 static time_t modtime;
357 static mode_t mode;
358 #ifdef SUPPORT_HARD_LINKS
359 static int64 dev;
360 #endif
361 static dev_t rdev;
362 static uint32 rdev_major;
363 static uid_t uid;
364 static gid_t gid;
365 static const char *user_name, *group_name;
366 static char lastname[MAXPATHLEN];
367 char fname[MAXPATHLEN];
368 int first_hlink_ndx = -1;
369 int l1, l2;
370 int xflags;
371
372 #ifdef ICONV_OPTION
373 if (ic_send != (iconv_t)-1) {
374 xbuf outbuf, inbuf;
375
376 INIT_CONST_XBUF(outbuf, fname);
377
378 if (file->dirname) {
379 INIT_XBUF_STRLEN(inbuf, (char*)file->dirname);
380 outbuf.size -= 2; /* Reserve room for '/' & 1 more char. */
381 if (iconvbufs(ic_send, &inbuf, &outbuf, 0) < 0)
382 goto convert_error;
383 outbuf.size += 2;
384 outbuf.buf[outbuf.len++] = '/';
385 }
386
387 INIT_XBUF_STRLEN(inbuf, (char*)file->basename);
388 if (iconvbufs(ic_send, &inbuf, &outbuf, 0) < 0) {
389 convert_error:
390 io_error |= IOERR_GENERAL;
391 rprintf(FINFO,
392 "[%s] cannot convert filename: %s (%s)\n",
393 who_am_i(), f_name(file, fname), strerror(errno));
394 return;
395 }
396 outbuf.buf[outbuf.len] = '\0';
397 } else
398 #endif
399 f_name(file, fname);
400
401 /* Initialize starting value of xflags. */
402 if (protocol_version >= 30 && S_ISDIR(file->mode)) {
403 dir_count++;
404 if (file->flags & FLAG_CONTENT_DIR)
405 xflags = file->flags & FLAG_TOP_DIR;
406 else if (file->flags & FLAG_IMPLIED_DIR)
407 xflags = XMIT_TOP_DIR | XMIT_NO_CONTENT_DIR;
408 else
409 xflags = XMIT_NO_CONTENT_DIR;
410 } else
411 xflags = file->flags & FLAG_TOP_DIR; /* FLAG_TOP_DIR == XMIT_TOP_DIR */
412
413 if (file->mode == mode)
414 xflags |= XMIT_SAME_MODE;
415 else
416 mode = file->mode;
417
418 if ((preserve_devices && IS_DEVICE(mode))
419 || (preserve_specials && IS_SPECIAL(mode))) {
420 if (protocol_version < 28) {
421 if (tmp_rdev == rdev)
422 xflags |= XMIT_SAME_RDEV_pre28;
423 else
424 rdev = tmp_rdev;
425 } else {
426 rdev = tmp_rdev;
427 if ((uint32)major(rdev) == rdev_major)
428 xflags |= XMIT_SAME_RDEV_MAJOR;
429 else
430 rdev_major = major(rdev);
431 if (protocol_version < 30 && (uint32)minor(rdev) <= 0xFFu)
432 xflags |= XMIT_RDEV_MINOR_8_pre30;
433 }
434 } else if (protocol_version < 28)
435 rdev = MAKEDEV(0, 0);
436 if (preserve_uid) {
437 if ((uid_t)F_OWNER(file) == uid && *lastname)
438 xflags |= XMIT_SAME_UID;
439 else {
440 uid = F_OWNER(file);
441 if (!numeric_ids) {
442 user_name = add_uid(uid);
443 if (inc_recurse && user_name)
444 xflags |= XMIT_USER_NAME_FOLLOWS;
445 }
446 }
447 }
448 if (preserve_gid) {
449 if ((gid_t)F_GROUP(file) == gid && *lastname)
450 xflags |= XMIT_SAME_GID;
451 else {
452 gid = F_GROUP(file);
453 if (!numeric_ids) {
454 group_name = add_gid(gid);
455 if (inc_recurse && group_name)
456 xflags |= XMIT_GROUP_NAME_FOLLOWS;
457 }
458 }
459 }
460 if (file->modtime == modtime)
461 xflags |= XMIT_SAME_TIME;
462 else
463 modtime = file->modtime;
464
465 #ifdef SUPPORT_HARD_LINKS
466 if (tmp_dev != 0) {
467 if (protocol_version >= 30) {
468 struct ht_int64_node *np = idev_find(tmp_dev, tmp_ino);
469 first_hlink_ndx = (int32)(long)np->data - 1;
470 if (first_hlink_ndx < 0) {
471 np->data = (void*)(long)(first_ndx + ndx + 1);
472 xflags |= XMIT_HLINK_FIRST;
473 }
474 xflags |= XMIT_HLINKED;
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 xflags |= XMIT_HLINKED;
482 }
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 clean_fname(thisname, 0);
688
689 if (sanitize_paths)
690 sanitize_path(thisname, thisname, "", 0);
691
692 if ((basename = strrchr(thisname, '/')) != NULL) {
693 int len = basename++ - thisname;
694 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
695 lastdir = new_array(char, len + 1);
696 memcpy(lastdir, thisname, len);
697 lastdir[len] = '\0';
698 lastdir_len = len;
699 lastdir_depth = count_dir_elements(lastdir);
700 }
701 } else
702 basename = thisname;
703 basename_len = strlen(basename) + 1; /* count the '\0' */
704
705 #ifdef SUPPORT_HARD_LINKS
706 if (protocol_version >= 30
707 && BITS_SETnUNSET(xflags, XMIT_HLINKED, XMIT_HLINK_FIRST)) {
708 first_hlink_ndx = read_varint(f);
709 if (first_hlink_ndx < 0 || first_hlink_ndx >= flist->ndx_start + flist->used) {
710 rprintf(FERROR,
711 "hard-link reference out of range: %d (%d)\n",
712 first_hlink_ndx, flist->ndx_start + flist->used);
713 exit_cleanup(RERR_PROTOCOL);
714 }
715 if (first_hlink_ndx >= flist->ndx_start) {
716 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
717 file_length = F_LENGTH(first);
718 modtime = first->modtime;
719 mode = first->mode;
720 if (preserve_uid)
721 uid = F_OWNER(first);
722 if (preserve_gid)
723 gid = F_GROUP(first);
724 if ((preserve_devices && IS_DEVICE(mode))
725 || (preserve_specials && IS_SPECIAL(mode))) {
726 uint32 *devp = F_RDEV_P(first);
727 rdev = MAKEDEV(DEV_MAJOR(devp), DEV_MINOR(devp));
728 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
729 }
730 if (preserve_links && S_ISLNK(mode))
731 linkname_len = strlen(F_SYMLINK(first)) + 1;
732 else
733 linkname_len = 0;
734 goto create_object;
735 }
736 }
737 #endif
738
739 file_length = read_varlong30(f, 3);
740 if (!(xflags & XMIT_SAME_TIME)) {
741 if (protocol_version >= 30) {
742 modtime = read_varlong(f, 4);
743 #if SIZEOF_TIME_T < SIZEOF_INT64
744 if (!am_generator && (int64)(time_t)modtime != modtime) {
745 rprintf(FERROR_XFER,
746 "Time value of %s truncated on receiver.\n",
747 lastname);
748 }
749 #endif
750 } else
751 modtime = read_int(f);
752 }
753 if (!(xflags & XMIT_SAME_MODE))
754 mode = from_wire_mode(read_int(f));
755
756 if (chmod_modes && !S_ISLNK(mode))
757 mode = tweak_mode(mode, chmod_modes);
758
759 if (preserve_uid && !(xflags & XMIT_SAME_UID)) {
760 if (protocol_version < 30)
761 uid = (uid_t)read_int(f);
762 else {
763 uid = (uid_t)read_varint(f);
764 if (xflags & XMIT_USER_NAME_FOLLOWS)
765 uid = recv_user_name(f, uid);
766 else if (inc_recurse && am_root && !numeric_ids)
767 uid = match_uid(uid);
768 }
769 }
770 if (preserve_gid && !(xflags & XMIT_SAME_GID)) {
771 if (protocol_version < 30)
772 gid = (gid_t)read_int(f);
773 else {
774 gid = (gid_t)read_varint(f);
775 gid_flags = 0;
776 if (xflags & XMIT_GROUP_NAME_FOLLOWS)
777 gid = recv_group_name(f, gid, &gid_flags);
778 else if (inc_recurse && (!am_root || !numeric_ids))
779 gid = match_gid(gid, &gid_flags);
780 }
781 }
782
783 if ((preserve_devices && IS_DEVICE(mode))
784 || (preserve_specials && IS_SPECIAL(mode))) {
785 if (protocol_version < 28) {
786 if (!(xflags & XMIT_SAME_RDEV_pre28))
787 rdev = (dev_t)read_int(f);
788 } else {
789 uint32 rdev_minor;
790 if (!(xflags & XMIT_SAME_RDEV_MAJOR))
791 rdev_major = read_varint30(f);
792 if (protocol_version >= 30)
793 rdev_minor = read_varint(f);
794 else if (xflags & XMIT_RDEV_MINOR_8_pre30)
795 rdev_minor = read_byte(f);
796 else
797 rdev_minor = read_int(f);
798 rdev = MAKEDEV(rdev_major, rdev_minor);
799 }
800 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
801 file_length = 0;
802 } else if (protocol_version < 28)
803 rdev = MAKEDEV(0, 0);
804
805 #ifdef SUPPORT_LINKS
806 if (preserve_links && S_ISLNK(mode)) {
807 linkname_len = read_varint30(f) + 1; /* count the '\0' */
808 if (linkname_len <= 0 || linkname_len > MAXPATHLEN) {
809 rprintf(FERROR, "overflow: linkname_len=%d\n",
810 linkname_len - 1);
811 overflow_exit("recv_file_entry");
812 }
813 if (munge_symlinks)
814 linkname_len += SYMLINK_PREFIX_LEN;
815 }
816 else
817 #endif
818 linkname_len = 0;
819
820 #ifdef SUPPORT_HARD_LINKS
821 create_object:
822 if (preserve_hard_links) {
823 if (protocol_version < 28 && S_ISREG(mode))
824 xflags |= XMIT_HLINKED;
825 if (xflags & XMIT_HLINKED)
826 extra_len += (inc_recurse+1) * EXTRA_LEN;
827 }
828 #endif
829
830 #ifdef SUPPORT_ACLS
831 /* Directories need an extra int32 for the default ACL. */
832 if (preserve_acls && S_ISDIR(mode))
833 extra_len += EXTRA_LEN;
834 #endif
835
836 if (always_checksum && S_ISREG(mode))
837 extra_len += SUM_EXTRA_CNT * EXTRA_LEN;
838
839 if (file_length > 0xFFFFFFFFu && S_ISREG(mode))
840 extra_len += EXTRA_LEN;
841
842 if (inc_recurse && S_ISDIR(mode)) {
843 if (one_file_system) {
844 /* Room to save the dir's device for -x */
845 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
846 }
847 pool = dir_flist->file_pool;
848 } else
849 pool = flist->file_pool;
850
851 #if EXTRA_ROUNDING > 0
852 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
853 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
854 #endif
855
856 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
857 + linkname_len;
858 bp = pool_alloc(pool, alloc_len, "recv_file_entry");
859
860 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
861 bp += extra_len;
862 file = (struct file_struct *)bp;
863 bp += FILE_STRUCT_LEN;
864
865 memcpy(bp, basename, basename_len);
866
867 #ifdef SUPPORT_HARD_LINKS
868 if (xflags & XMIT_HLINKED)
869 file->flags |= FLAG_HLINKED;
870 #endif
871 file->modtime = (time_t)modtime;
872 file->len32 = (uint32)file_length;
873 if (file_length > 0xFFFFFFFFu && S_ISREG(mode)) {
874 file->flags |= FLAG_LENGTH64;
875 OPT_EXTRA(file, 0)->unum = (uint32)(file_length >> 32);
876 }
877 file->mode = mode;
878 if (preserve_uid)
879 F_OWNER(file) = uid;
880 if (preserve_gid) {
881 F_GROUP(file) = gid;
882 file->flags |= gid_flags;
883 }
884 if (unsort_ndx)
885 F_NDX(file) = flist->used + flist->ndx_start;
886
887 if (basename != thisname) {
888 file->dirname = lastdir;
889 F_DEPTH(file) = lastdir_depth + 1;
890 } else
891 F_DEPTH(file) = 1;
892
893 if (S_ISDIR(mode)) {
894 if (basename_len == 1+1 && *basename == '.') /* +1 for '\0' */
895 F_DEPTH(file)--;
896 if (protocol_version >= 30) {
897 if (!(xflags & XMIT_NO_CONTENT_DIR)) {
898 if (xflags & XMIT_TOP_DIR)
899 file->flags |= FLAG_TOP_DIR;
900 file->flags |= FLAG_CONTENT_DIR;
901 } else if (xflags & XMIT_TOP_DIR)
902 file->flags |= FLAG_IMPLIED_DIR;
903 } else if (xflags & XMIT_TOP_DIR) {
904 in_del_hier = recurse;
905 del_hier_name_len = F_DEPTH(file) == 0 ? 0 : l1 + l2;
906 if (relative_paths && del_hier_name_len > 2
907 && lastname[del_hier_name_len-1] == '.'
908 && lastname[del_hier_name_len-2] == '/')
909 del_hier_name_len -= 2;
910 file->flags |= FLAG_TOP_DIR | FLAG_CONTENT_DIR;
911 } else if (in_del_hier) {
912 if (!relative_paths || !del_hier_name_len
913 || (l1 >= del_hier_name_len
914 && lastname[del_hier_name_len] == '/'))
915 file->flags |= FLAG_CONTENT_DIR;
916 else
917 in_del_hier = 0;
918 }
919 }
920
921 if ((preserve_devices && IS_DEVICE(mode))
922 || (preserve_specials && IS_SPECIAL(mode))) {
923 uint32 *devp = F_RDEV_P(file);
924 DEV_MAJOR(devp) = major(rdev);
925 DEV_MINOR(devp) = minor(rdev);
926 }
927
928 #ifdef SUPPORT_LINKS
929 if (linkname_len) {
930 bp += basename_len;
931 if (first_hlink_ndx >= flist->ndx_start) {
932 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
933 memcpy(bp, F_SYMLINK(first), linkname_len);
934 } else if (munge_symlinks) {
935 strlcpy(bp, SYMLINK_PREFIX, linkname_len);
936 bp += SYMLINK_PREFIX_LEN;
937 linkname_len -= SYMLINK_PREFIX_LEN;
938 read_sbuf(f, bp, linkname_len - 1);
939 } else {
940 read_sbuf(f, bp, linkname_len - 1);
941 if (sanitize_paths)
942 sanitize_path(bp, bp, "", lastdir_depth);
943 }
944 }
945 #endif
946
947 #ifdef SUPPORT_HARD_LINKS
948 if (preserve_hard_links && xflags & XMIT_HLINKED) {
949 if (protocol_version >= 30) {
950 if (xflags & XMIT_HLINK_FIRST) {
951 F_HL_GNUM(file) = flist->ndx_start + flist->used;
952 } else
953 F_HL_GNUM(file) = first_hlink_ndx;
954 } else {
955 static int32 cnt = 0;
956 struct ht_int64_node *np;
957 int64 ino;
958 int32 ndx;
959 if (protocol_version < 26) {
960 dev = read_int(f);
961 ino = read_int(f);
962 } else {
963 if (!(xflags & XMIT_SAME_DEV_pre30))
964 dev = read_longint(f);
965 ino = read_longint(f);
966 }
967 np = idev_find(dev, ino);
968 ndx = (int32)(long)np->data - 1;
969 if (ndx < 0) {
970 ndx = cnt++;
971 np->data = (void*)(long)cnt;
972 }
973 F_HL_GNUM(file) = ndx;
974 }
975 }
976 #endif
977
978 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
979 if (S_ISREG(mode))
980 bp = F_SUM(file);
981 else {
982 /* Prior to 28, we get a useless set of nulls. */
983 bp = tmp_sum;
984 }
985 if (first_hlink_ndx >= flist->ndx_start) {
986 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
987 memcpy(bp, F_SUM(first), checksum_len);
988 } else
989 read_buf(f, bp, checksum_len);
990 }
991
992 #ifdef SUPPORT_ACLS
993 if (preserve_acls && !S_ISLNK(mode))
994 receive_acl(file, f);
995 #endif
996 #ifdef SUPPORT_XATTRS
997 if (preserve_xattrs)
998 receive_xattr(file, f );
999 #endif
1000
1001 if (S_ISREG(mode) || S_ISLNK(mode))
1002 stats.total_size += file_length;
1003
1004 return file;
1005 }
1006
1007 /* Create a file_struct for a named file by reading its stat() information
1008 * and performing extensive checks against global options.
1009 *
1010 * Returns a pointer to the new file struct, or NULL if there was an error
1011 * or this file should be excluded. */
1012 struct file_struct *make_file(const char *fname, struct file_list *flist,
1013 STRUCT_STAT *stp, int flags, int filter_level)
1014 {
1015 static char *lastdir;
1016 static int lastdir_len = -1;
1017 struct file_struct *file;
1018 char thisname[MAXPATHLEN];
1019 char linkname[MAXPATHLEN];
1020 int alloc_len, basename_len, linkname_len;
1021 int extra_len = file_extra_cnt * EXTRA_LEN;
1022 const char *basename;
1023 alloc_pool_t *pool;
1024 STRUCT_STAT st;
1025 char *bp;
1026
1027 if (strlcpy(thisname, fname, sizeof thisname) >= sizeof thisname) {
1028 rprintf(FINFO, "skipping overly long name: %s\n", fname);
1029 return NULL;
1030 }
1031 clean_fname(thisname, 0);
1032 if (sanitize_paths)
1033 sanitize_path(thisname, thisname, "", 0);
1034
1035 if (stp && S_ISDIR(stp->st_mode)) {
1036 st = *stp; /* Needed for "symlink/." with --relative. */
1037 *linkname = '\0'; /* make IBM code checker happy */
1038 } else if (readlink_stat(thisname, &st, linkname) != 0) {
1039 int save_errno = errno;
1040 /* See if file is excluded before reporting an error. */
1041 if (filter_level != NO_FILTERS
1042 && (is_excluded(thisname, 0, filter_level)
1043 || is_excluded(thisname, 1, filter_level))) {
1044 if (ignore_perishable && save_errno != ENOENT)
1045 non_perishable_cnt++;
1046 return NULL;
1047 }
1048 if (save_errno == ENOENT) {
1049 #ifdef SUPPORT_LINKS
1050 /* When our options tell us to follow a symlink that
1051 * points nowhere, tell the user about the symlink
1052 * instead of giving a "vanished" message. We only
1053 * dereference a symlink if one of the --copy*links
1054 * options was specified, so there's no need for the
1055 * extra lstat() if one of these options isn't on. */
1056 if ((copy_links || copy_unsafe_links || copy_dirlinks)
1057 && x_lstat(thisname, &st, NULL) == 0
1058 && S_ISLNK(st.st_mode)) {
1059 io_error |= IOERR_GENERAL;
1060 rprintf(FERROR_XFER, "symlink has no referent: %s\n",
1061 full_fname(thisname));
1062 } else
1063 #endif
1064 {
1065 enum logcode c = am_daemon && protocol_version < 28
1066 ? FERROR : FWARNING;
1067 io_error |= IOERR_VANISHED;
1068 rprintf(c, "file has vanished: %s\n",
1069 full_fname(thisname));
1070 }
1071 } else {
1072 io_error |= IOERR_GENERAL;
1073 rsyserr(FERROR_XFER, save_errno, "readlink %s failed",
1074 full_fname(thisname));
1075 }
1076 return NULL;
1077 }
1078
1079 /* backup.c calls us with filter_level set to NO_FILTERS. */
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 char *fname, STRUCT_STAT *stp,
1277 int flags, int filter_level)
1278 {
1279 struct file_struct *file;
1280 #if defined SUPPORT_ACLS || defined SUPPORT_XATTRS
1281 stat_x sx;
1282 #endif
1283
1284 file = make_file(fname, flist, stp, flags, filter_level);
1285 if (!file)
1286 return NULL;
1287
1288 if (chmod_modes && !S_ISLNK(file->mode))
1289 file->mode = tweak_mode(file->mode, chmod_modes);
1290
1291 #ifdef SUPPORT_ACLS
1292 if (preserve_acls && !S_ISLNK(file->mode) && f >= 0) {
1293 sx.st.st_mode = file->mode;
1294 sx.acc_acl = sx.def_acl = NULL;
1295 if (get_acl(fname, &sx) < 0)
1296 return NULL;
1297 }
1298 #endif
1299 #ifdef SUPPORT_XATTRS
1300 if (preserve_xattrs && f >= 0) {
1301 sx.xattr = NULL;
1302 if (get_xattr(fname, &sx) < 0)
1303 return NULL;
1304 }
1305 #endif
1306
1307 maybe_emit_filelist_progress(flist->used + flist_count_offset);
1308
1309 flist_expand(flist, 1);
1310 flist->files[flist->used++] = file;
1311 if (f >= 0) {
1312 send_file_entry(f, file, flist->used - 1, flist->ndx_start);
1313 #ifdef SUPPORT_ACLS
1314 if (preserve_acls && !S_ISLNK(file->mode)) {
1315 send_acl(&sx, f);
1316 free_acl(&sx);
1317 }
1318 #endif
1319 #ifdef SUPPORT_XATTRS
1320 if (preserve_xattrs) {
1321 F_XATTR(file) = send_xattr(&sx, f);
1322 free_xattr(&sx);
1323 }
1324 #endif
1325 }
1326 return file;
1327 }
1328
1329 static void send_if_directory(int f, struct file_list *flist,
1330 struct file_struct *file,
1331 char *fbuf, unsigned int ol,
1332 int flags)
1333 {
1334 char is_dot_dir = fbuf[ol-1] == '.' && (ol == 1 || fbuf[ol-2] == '/');
1335
1336 if (S_ISDIR(file->mode)
1337 && !(file->flags & FLAG_MOUNT_DIR) && f_name(file, fbuf)) {
1338 void *save_filters;
1339 unsigned int len = strlen(fbuf);
1340 if (len > 1 && fbuf[len-1] == '/')
1341 fbuf[--len] = '\0';
1342 if (len >= MAXPATHLEN - 1) {
1343 io_error |= IOERR_GENERAL;
1344 rprintf(FERROR_XFER, "skipping long-named directory: %s\n",
1345 full_fname(fbuf));
1346 return;
1347 }
1348 save_filters = push_local_filters(fbuf, len);
1349 send_directory(f, flist, fbuf, len, flags);
1350 pop_local_filters(save_filters);
1351 fbuf[ol] = '\0';
1352 if (is_dot_dir)
1353 fbuf[ol-1] = '.';
1354 }
1355 }
1356
1357 static int file_compare(const void *file1, const void *file2)
1358 {
1359 return f_name_cmp(*(struct file_struct **)file1,
1360 *(struct file_struct **)file2);
1361 }
1362
1363 /* The guts of a merge-sort algorithm. This was derived from the glibc
1364 * version, but I (Wayne) changed the merge code to do less copying and
1365 * to require only half the amount of temporary memory. */
1366 static void fsort_tmp(struct file_struct **fp, size_t num,
1367 struct file_struct **tmp)
1368 {
1369 struct file_struct **f1, **f2, **t;
1370 size_t n1, n2;
1371
1372 n1 = num / 2;
1373 n2 = num - n1;
1374 f1 = fp;
1375 f2 = fp + n1;
1376
1377 if (n1 > 1)
1378 fsort_tmp(f1, n1, tmp);
1379 if (n2 > 1)
1380 fsort_tmp(f2, n2, tmp);
1381
1382 while (f_name_cmp(*f1, *f2) <= 0) {
1383 if (!--n1)
1384 return;
1385 f1++;
1386 }
1387
1388 t = tmp;
1389 memcpy(t, f1, n1 * PTR_SIZE);
1390
1391 *f1++ = *f2++, n2--;
1392
1393 while (n1 > 0 && n2 > 0) {
1394 if (f_name_cmp(*t, *f2) <= 0)
1395 *f1++ = *t++, n1--;
1396 else
1397 *f1++ = *f2++, n2--;
1398 }
1399
1400 if (n1 > 0)
1401 memcpy(f1, t, n1 * PTR_SIZE);
1402 }
1403
1404 /* This file-struct sorting routine makes sure that any identical names in
1405 * the file list stay in the same order as they were in the original list.
1406 * This is particularly vital in inc_recurse mode where we expect a sort
1407 * on the flist to match the exact order of a sort on the dir_flist. */
1408 static void fsort(struct file_struct **fp, size_t num)
1409 {
1410 if (num <= 1)
1411 return;
1412
1413 if (use_qsort)
1414 qsort(fp, num, PTR_SIZE, file_compare);
1415 else {
1416 struct file_struct **tmp = new_array(struct file_struct *,
1417 (num+1) / 2);
1418 fsort_tmp(fp, num, tmp);
1419 free(tmp);
1420 }
1421 }
1422
1423 /* We take an entire set of sibling dirs from the sorted flist and link them
1424 * into the tree, setting the appropriate parent/child/sibling pointers. */
1425 static void add_dirs_to_tree(int parent_ndx, struct file_list *from_flist,
1426 int dir_cnt)
1427 {
1428 int i;
1429 int32 *dp = NULL;
1430 int32 *parent_dp = parent_ndx < 0 ? NULL
1431 : F_DIR_NODE_P(dir_flist->sorted[parent_ndx]);
1432
1433 flist_expand(dir_flist, dir_cnt);
1434 dir_flist->sorted = dir_flist->files;
1435
1436 for (i = 0; dir_cnt; i++) {
1437 struct file_struct *file = from_flist->sorted[i];
1438
1439 if (!S_ISDIR(file->mode))
1440 continue;
1441
1442 dir_flist->files[dir_flist->used++] = file;
1443 dir_cnt--;
1444
1445 if (file->basename[0] == '.' && file->basename[1] == '\0')
1446 continue;
1447
1448 if (dp)
1449 DIR_NEXT_SIBLING(dp) = dir_flist->used - 1;
1450 else if (parent_dp)
1451 DIR_FIRST_CHILD(parent_dp) = dir_flist->used - 1;
1452 else
1453 send_dir_ndx = dir_flist->used - 1;
1454
1455 dp = F_DIR_NODE_P(file);
1456 DIR_PARENT(dp) = parent_ndx;
1457 DIR_FIRST_CHILD(dp) = -1;
1458 }
1459 if (dp)
1460 DIR_NEXT_SIBLING(dp) = -1;
1461 }
1462
1463 /* This function is normally called by the sender, but the receiving side also
1464 * calls it from get_dirlist() with f set to -1 so that we just construct the
1465 * file list in memory without sending it over the wire. Also, get_dirlist()
1466 * might call this with f set to -2, which also indicates that local filter
1467 * rules should be ignored. */
1468 static void send_directory(int f, struct file_list *flist, char *fbuf, int len,
1469 int flags)
1470 {
1471 struct dirent *di;
1472 unsigned remainder;
1473 char *p;
1474 DIR *d;
1475 int divert_dirs = (flags & FLAG_DIVERT_DIRS) != 0;
1476 int start = flist->used;
1477 int filter_level = f == -2 ? SERVER_FILTERS : ALL_FILTERS;
1478
1479 assert(flist != NULL);
1480
1481 if (!(d = opendir(fbuf))) {
1482 io_error |= IOERR_GENERAL;
1483 rsyserr(FERROR_XFER, errno, "opendir %s failed", full_fname(fbuf));
1484 return;
1485 }
1486
1487 p = fbuf + len;
1488 if (len != 1 || *fbuf != '/')
1489 *p++ = '/';
1490 *p = '\0';
1491 remainder = MAXPATHLEN - (p - fbuf);
1492
1493 for (errno = 0, di = readdir(d); di; errno = 0, di = readdir(d)) {
1494 char *dname = d_name(di);
1495 if (dname[0] == '.' && (dname[1] == '\0'
1496 || (dname[1] == '.' && dname[2] == '\0')))
1497 continue;
1498 if (strlcpy(p, dname, remainder) >= remainder) {
1499 io_error |= IOERR_GENERAL;
1500 rprintf(FINFO,
1501 "cannot send long-named file %s\n",
1502 full_fname(fbuf));
1503 continue;
1504 }
1505 if (dname[0] == '\0') {
1506 io_error |= IOERR_GENERAL;
1507 rprintf(FINFO,
1508 "cannot send file with empty name in %s\n",
1509 full_fname(fbuf));
1510 continue;
1511 }
1512
1513 send_file_name(f, flist, fbuf, NULL, flags, filter_level);
1514 }
1515
1516 fbuf[len] = '\0';
1517
1518 if (errno) {
1519 io_error |= IOERR_GENERAL;
1520 rsyserr(FERROR_XFER, errno, "readdir(%s)", full_fname(fbuf));
1521 }
1522
1523 closedir(d);
1524
1525 if (f >= 0 && recurse && !divert_dirs) {
1526 int i, end = flist->used - 1;
1527 /* send_if_directory() bumps flist->used, so use "end". */
1528 for (i = start; i <= end; i++)
1529 send_if_directory(f, flist, flist->files[i], fbuf, len, flags);
1530 }
1531 }
1532
1533 static char lastpath[MAXPATHLEN] = "";
1534 static int lastpath_len = 0;
1535 static struct file_struct *lastpath_struct;
1536
1537 static void send_implied_dirs(int f, struct file_list *flist, char *fname,
1538 char *start, char *limit, int flags, char name_type)
1539 {
1540 struct file_struct *file;
1541 item_list *relname_list;
1542 relnamecache **rnpp;
1543 char *slash;
1544 int len, need_new_dir;
1545 struct filter_list_struct save_filter_list = filter_list;
1546
1547 flags = (flags | FLAG_IMPLIED_DIR) & ~(FLAG_TOP_DIR | FLAG_CONTENT_DIR);
1548 filter_list.head = filter_list.tail = NULL; /* Don't filter implied dirs. */
1549
1550 if (inc_recurse) {
1551 if (lastpath_struct && F_PATHNAME(lastpath_struct) == pathname
1552 && lastpath_len == limit - fname
1553 && strncmp(lastpath, fname, lastpath_len) == 0)
1554 need_new_dir = 0;
1555 else
1556 need_new_dir = 1;
1557 } else
1558 need_new_dir = 1;
1559
1560 if (need_new_dir) {
1561 int save_copy_links = copy_links;
1562 int save_xfer_dirs = xfer_dirs;
1563
1564 copy_links = xfer_dirs = 1;
1565
1566 *limit = '\0';
1567
1568 for (slash = start; (slash = strchr(slash+1, '/')) != NULL; ) {
1569 *slash = '\0';
1570 send_file_name(f, flist, fname, NULL, flags, ALL_FILTERS);
1571 *slash = '/';
1572 }
1573
1574 file = send_file_name(f, flist, fname, NULL, flags, ALL_FILTERS);
1575 if (inc_recurse) {
1576 if (file && !S_ISDIR(file->mode))
1577 file = NULL;
1578 lastpath_struct = file;
1579 }
1580
1581 strlcpy(lastpath, fname, sizeof lastpath);
1582 lastpath_len = limit - fname;
1583
1584 *limit = '/';
1585
1586 copy_links = save_copy_links;
1587 xfer_dirs = save_xfer_dirs;
1588
1589 if (!inc_recurse)
1590 goto done;
1591 }
1592
1593 if (!lastpath_struct)
1594 goto done; /* dir must have vanished */
1595
1596 len = strlen(limit+1);
1597 memcpy(&relname_list, F_DIR_RELNAMES_P(lastpath_struct), sizeof relname_list);
1598 if (!relname_list) {
1599 if (!(relname_list = new0(item_list)))
1600 out_of_memory("send_implied_dirs");
1601 memcpy(F_DIR_RELNAMES_P(lastpath_struct), &relname_list, sizeof relname_list);
1602 }
1603 rnpp = EXPAND_ITEM_LIST(relname_list, relnamecache *, 32);
1604 if (!(*rnpp = (relnamecache*)new_array(char, sizeof (relnamecache) + len)))
1605 out_of_memory("send_implied_dirs");
1606 (*rnpp)->name_type = name_type;
1607 strlcpy((*rnpp)->fname, limit+1, len + 1);
1608
1609 done:
1610 filter_list = save_filter_list;
1611 }
1612
1613 static void send1extra(int f, struct file_struct *file, struct file_list *flist)
1614 {
1615 char fbuf[MAXPATHLEN];
1616 item_list *relname_list;
1617 int len, dlen, flags = FLAG_DIVERT_DIRS | FLAG_CONTENT_DIR;
1618 size_t j;
1619
1620 f_name(file, fbuf);
1621 dlen = strlen(fbuf);
1622
1623 if (F_PATHNAME(file) != pathname) {
1624 if (!push_pathname(F_PATHNAME(file), -1))
1625 exit_cleanup(RERR_FILESELECT);
1626 }
1627
1628 change_local_filter_dir(fbuf, dlen, send_dir_depth);
1629
1630 if (file->flags & FLAG_CONTENT_DIR) {
1631 if (one_file_system) {
1632 STRUCT_STAT st;
1633 if (link_stat(fbuf, &st, copy_dirlinks) != 0) {
1634 io_error |= IOERR_GENERAL;
1635 rsyserr(FERROR_XFER, errno, "link_stat %s failed",
1636 full_fname(fbuf));
1637 return;
1638 }
1639 filesystem_dev = st.st_dev;
1640 }
1641 send_directory(f, flist, fbuf, dlen, flags);
1642 }
1643
1644 if (!relative_paths)
1645 return;
1646
1647 memcpy(&relname_list, F_DIR_RELNAMES_P(file), sizeof relname_list);
1648 if (!relname_list)
1649 return;
1650
1651 for (j = 0; j < relname_list->count; j++) {
1652 char *slash;
1653 relnamecache *rnp = ((relnamecache**)relname_list->items)[j];
1654 char name_type = rnp->name_type;
1655
1656 fbuf[dlen] = '/';
1657 len = strlcpy(fbuf + dlen + 1, rnp->fname, sizeof fbuf - dlen - 1);
1658 free(rnp);
1659 if (len >= (int)sizeof fbuf)
1660 continue; /* Impossible... */
1661
1662 slash = strchr(fbuf+dlen+1, '/');
1663 if (slash) {
1664 send_implied_dirs(f, flist, fbuf, fbuf+dlen+1, slash, flags, name_type);
1665 continue;
1666 }
1667
1668 if (name_type != NORMAL_NAME) {
1669 STRUCT_STAT st;
1670 if (link_stat(fbuf, &st, 1) != 0) {
1671 io_error |= IOERR_GENERAL;
1672 rsyserr(FERROR_XFER, errno, "link_stat %s failed",
1673 full_fname(fbuf));
1674 continue;
1675 }
1676 send_file_name(f, flist, fbuf, &st, FLAG_TOP_DIR | flags, ALL_FILTERS);
1677 } else
1678 send_file_name(f, flist, fbuf, NULL, FLAG_TOP_DIR | flags, ALL_FILTERS);
1679 }
1680
1681 free(relname_list);
1682 }
1683
1684 void send_extra_file_list(int f, int at_least)
1685 {
1686 struct file_list *flist;
1687 int64 start_write;
1688 uint16 prev_flags;
1689 int old_cnt, save_io_error = io_error;
1690
1691 if (flist_eof)
1692 return;
1693
1694 /* Keep sending data until we have the requested number of
1695 * files in the upcoming file-lists. */
1696 old_cnt = cur_flist->used;
1697 for (flist = first_flist; flist != cur_flist; flist = flist->next)
1698 old_cnt += flist->used;
1699 while (file_total - old_cnt < at_least) {
1700 struct file_struct *file = dir_flist->sorted[send_dir_ndx];
1701 int dir_ndx, dstart = dir_count;
1702 const char *pathname = F_PATHNAME(file);
1703 int32 *dp;
1704
1705 flist = flist_new(0, "send_extra_file_list");
1706 start_write = stats.total_written;
1707
1708 if (unsort_ndx)
1709 dir_ndx = F_NDX(file);
1710 else
1711 dir_ndx = send_dir_ndx;
1712 write_ndx(f, NDX_FLIST_OFFSET - dir_ndx);
1713 flist->parent_ndx = dir_ndx;
1714
1715 send1extra(f, file, flist);
1716 prev_flags = file->flags;
1717 dp = F_DIR_NODE_P(file);
1718
1719 /* If there are any duplicate directory names that follow, we
1720 * send all the dirs together in one file-list. The dir_flist
1721 * tree links all the child subdirs onto the last dup dir. */
1722 while ((dir_ndx = DIR_NEXT_SIBLING(dp)) >= 0
1723 && dir_flist->sorted[dir_ndx]->flags & FLAG_DUPLICATE) {
1724 send_dir_ndx = dir_ndx;
1725 file = dir_flist->sorted[dir_ndx];
1726 /* Try to avoid some duplicate scanning of identical dirs. */
1727 if (F_PATHNAME(file) == pathname && prev_flags & FLAG_CONTENT_DIR)
1728 file->flags &= ~FLAG_CONTENT_DIR;
1729 send1extra(f, file, flist);
1730 prev_flags = file->flags;
1731 dp = F_DIR_NODE_P(file);
1732 }
1733
1734 write_byte(f, 0);
1735
1736 if (need_unsorted_flist) {
1737 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
1738 out_of_memory("send_extra_file_list");
1739 memcpy(flist->sorted, flist->files,
1740 flist->used * sizeof (struct file_struct*));
1741 } else
1742 flist->sorted = flist->files;
1743
1744 flist_sort_and_clean(flist, 0);
1745
1746 add_dirs_to_tree(send_dir_ndx, flist, dir_count - dstart);
1747 flist_done_allocating(flist);
1748
1749 file_total += flist->used;
1750 stats.flist_size += stats.total_written - start_write;
1751 stats.num_files += flist->used;
1752 if (verbose > 3)
1753 output_flist(flist);
1754
1755 if (DIR_FIRST_CHILD(dp) >= 0) {
1756 send_dir_ndx = DIR_FIRST_CHILD(dp);
1757 send_dir_depth++;
1758 } else {
1759 while (DIR_NEXT_SIBLING(dp) < 0) {
1760 if ((send_dir_ndx = DIR_PARENT(dp)) < 0) {
1761 write_ndx(f, NDX_FLIST_EOF);
1762 flist_eof = 1;
1763 change_local_filter_dir(NULL, 0, 0);
1764 goto finish;
1765 }
1766 send_dir_depth--;
1767 file = dir_flist->sorted[send_dir_ndx];
1768 dp = F_DIR_NODE_P(file);
1769 }
1770 send_dir_ndx = DIR_NEXT_SIBLING(dp);
1771 }
1772 }
1773
1774 finish:
1775 if (io_error != save_io_error && !ignore_errors)
1776 send_msg_int(MSG_IO_ERROR, io_error);
1777 }
1778
1779 struct file_list *send_file_list(int f, int argc, char *argv[])
1780 {
1781 static const char *lastdir;
1782 static int lastdir_len = -1;
1783 int len, dirlen;
1784 STRUCT_STAT st;
1785 char *p, *dir;
1786 struct file_list *flist;
1787 struct timeval start_tv, end_tv;
1788 int64 start_write;
1789 int use_ff_fd = 0;
1790 int disable_buffering;
1791 int flags = recurse ? FLAG_CONTENT_DIR : 0;
1792 int reading_remotely = filesfrom_host != NULL;
1793 int rl_flags = (reading_remotely ? 0 : RL_DUMP_COMMENTS)
1794 #ifdef ICONV_OPTION
1795 | (filesfrom_convert ? RL_CONVERT : 0)
1796 #endif
1797 | (eol_nulls || reading_remotely ? RL_EOL_NULLS : 0);
1798
1799 rprintf(FLOG, "building file list\n");
1800 if (show_filelist_p())
1801 start_filelist_progress("building file list");
1802 else if (inc_recurse && verbose && !am_server)
1803 rprintf(FCLIENT, "sending incremental file list\n");
1804
1805 start_write = stats.total_written;
1806 gettimeofday(&start_tv, NULL);
1807
1808 if (relative_paths && protocol_version >= 30)
1809 implied_dirs = 1; /* We send flagged implied dirs */
1810
1811 #ifdef SUPPORT_HARD_LINKS
1812 if (preserve_hard_links && protocol_version >= 30 && !cur_flist)
1813 init_hard_links();
1814 #endif
1815
1816 flist = cur_flist = flist_new(0, "send_file_list");
1817 if (inc_recurse) {
1818 dir_flist = flist_new(FLIST_TEMP, "send_file_list");
1819 flags |= FLAG_DIVERT_DIRS;
1820 } else
1821 dir_flist = cur_flist;
1822
1823 disable_buffering = io_start_buffering_out(f);
1824 if (filesfrom_fd >= 0) {
1825 if (argv[0] && !push_dir(argv[0], 0)) {
1826 rsyserr(FERROR_XFER, errno, "push_dir %s failed in %s",
1827 full_fname(argv[0]), curr_dir);
1828 exit_cleanup(RERR_FILESELECT);
1829 }
1830 use_ff_fd = 1;
1831 }
1832
1833 while (1) {
1834 char fbuf[MAXPATHLEN], *fn, name_type;
1835
1836 if (use_ff_fd) {
1837 if (read_line(filesfrom_fd, fbuf, sizeof fbuf, rl_flags) == 0)
1838 break;
1839 sanitize_path(fbuf, fbuf, "", 0);
1840 } else {
1841 if (argc-- == 0)
1842 break;
1843 strlcpy(fbuf, *argv++, MAXPATHLEN);
1844 if (sanitize_paths)
1845 sanitize_path(fbuf, fbuf, "", 0);
1846 }
1847
1848 len = strlen(fbuf);
1849 if (relative_paths) {
1850 /* We clean up fbuf below. */
1851 name_type = NORMAL_NAME;
1852 } else if (!len || fbuf[len - 1] == '/') {
1853 if (len == 2 && fbuf[0] == '.') {
1854 /* Turn "./" into just "." rather than "./." */
1855 fbuf[--len] = '\0';
1856 } else {
1857 if (len + 1 >= MAXPATHLEN)
1858 overflow_exit("send_file_list");
1859 fbuf[len++] = '.';
1860 fbuf[len] = '\0';
1861 }
1862 name_type = DOT_NAME;
1863 } else if (len > 1 && fbuf[len-1] == '.' && fbuf[len-2] == '.'
1864 && (len == 2 || fbuf[len-3] == '/')) {
1865 if (len + 2 >= MAXPATHLEN)
1866 overflow_exit("send_file_list");
1867 fbuf[len++] = '/';
1868 fbuf[len++] = '.';
1869 fbuf[len] = '\0';
1870 name_type = DOT_NAME;
1871 } else if (fbuf[len-1] == '.' && (len == 1 || fbuf[len-2] == '/'))
1872 name_type = DOT_NAME;
1873 else
1874 name_type = NORMAL_NAME;
1875
1876 dir = NULL;
1877
1878 if (!relative_paths) {
1879 p = strrchr(fbuf, '/');
1880 if (p) {
1881 *p = '\0';
1882 if (p == fbuf)
1883 dir = "/";
1884 else
1885 dir = fbuf;
1886 len -= p - fbuf + 1;
1887 fn = p + 1;
1888 } else
1889 fn = fbuf;
1890 } else {
1891 if ((p = strstr(fbuf, "/./")) != NULL) {
1892 *p = '\0';
1893 if (p == fbuf)
1894 dir = "/";
1895 else
1896 dir = fbuf;
1897 fn = p + 3;
1898 while (*fn == '/')
1899 fn++;
1900 if (!*fn)
1901 *--fn = '\0'; /* ensure room for '.' */
1902 } else
1903 fn = fbuf;
1904 len = clean_fname(fn, CFN_KEEP_LEADING_DOT_DIR
1905 | CFN_KEEP_TRAILING_SLASH
1906 | CFN_DROP_TRAILING_DOT_DIR);
1907 if (len == 1) {
1908 if (fn[0] == '/') {
1909 fn = "/.";
1910 len = 2;
1911 name_type = DOT_NAME;
1912 } else if (fn[0] == '.')
1913 name_type = DOT_NAME;
1914 } else if (fn[len-1] == '/') {
1915 fn[--len] = '\0';
1916 if (len == 1 && *fn == '.')
1917 name_type = DOT_NAME;
1918 else
1919 name_type = SLASH_ENDING_NAME;
1920 }
1921 /* Reject a ".." dir in the active part of the path. */
1922 for (p = fn; (p = strstr(p, "..")) != NULL; p += 2) {
1923 if ((p[2] == '/' || p[2] == '\0')
1924 && (p == fn || p[-1] == '/')) {
1925 rprintf(FERROR,
1926 "found \"..\" dir in relative path: %s\n",
1927 fn);
1928 exit_cleanup(RERR_SYNTAX);
1929 }
1930 }
1931 }
1932
1933 if (!*fn) {
1934 len = 1;
1935 fn = ".";
1936 name_type = DOT_NAME;
1937 }
1938
1939 dirlen = dir ? strlen(dir) : 0;
1940 if (dirlen != lastdir_len || memcmp(lastdir, dir, dirlen) != 0) {
1941 if (!push_pathname(dir ? strdup(dir) : NULL, dirlen))
1942 continue;
1943 lastdir = pathname;
1944 lastdir_len = pathname_len;
1945 } else if (!push_pathname(lastdir, lastdir_len))
1946 continue;
1947
1948 if (fn != fbuf)
1949 memmove(fbuf, fn, len + 1);
1950
1951 if (link_stat(fbuf, &st, copy_dirlinks || name_type != NORMAL_NAME) != 0
1952 || is_daemon_excluded(fbuf, S_ISDIR(st.st_mode) != 0)) {
1953 io_error |= IOERR_GENERAL;
1954 rsyserr(FERROR_XFER, errno, "link_stat %s failed",
1955 full_fname(fbuf));
1956 continue;
1957 }
1958
1959 if (S_ISDIR(st.st_mode) && !xfer_dirs) {
1960 rprintf(FINFO, "skipping directory %s\n", fbuf);
1961 continue;
1962 }
1963
1964 if (inc_recurse && relative_paths && *fbuf) {
1965 if ((p = strchr(fbuf+1, '/')) != NULL) {
1966 if (p - fbuf == 1 && *fbuf == '.') {
1967 if ((fn = strchr(p+1, '/')) != NULL)
1968 p = fn;
1969 } else
1970 fn = p;
1971 send_implied_dirs(f, flist, fbuf, fbuf, p, flags, name_type);
1972 if (fn == p)
1973 continue;
1974 }
1975 } else if (implied_dirs && (p=strrchr(fbuf,'/')) && p != fbuf) {
1976 /* Send the implied directories at the start of the
1977 * source spec, so we get their permissions right. */
1978 char *lp = lastpath, *slash = fbuf;
1979 *p = '\0';
1980 /* Skip any initial directories in our path that we
1981 * have in common with lastpath. */
1982 for (fn = fbuf; *fn && *lp == *fn; lp++, fn++) {
1983 if (*fn == '/')
1984 slash = fn;
1985 }
1986 *p = '/';
1987 if (fn != p || (*lp && *lp != '/'))
1988 send_implied_dirs(f, flist, fbuf, slash, p, flags, 0);
1989 }
1990
1991 if (one_file_system)
1992 filesystem_dev = st.st_dev;
1993
1994 if (recurse || (xfer_dirs && name_type != NORMAL_NAME)) {
1995 struct file_struct *file;
1996 int top_flags = FLAG_TOP_DIR | FLAG_CONTENT_DIR | flags;
1997 file = send_file_name(f, flist, fbuf, &st,
1998 top_flags, ALL_FILTERS);
1999 if (inc_recurse) {
2000 if (name_type == DOT_NAME && file) {
2001 if (send_dir_depth < 0) {
2002 send_dir_depth = 0;
2003 change_local_filter_dir(fbuf, len, send_dir_depth);
2004 }
2005 send_directory(f, flist, fbuf, len, flags);
2006 }
2007 } else if (file)
2008 send_if_directory(f, flist, file, fbuf, len, flags);
2009 } else
2010 send_file_name(f, flist, fbuf, &st, flags, ALL_FILTERS);
2011 }
2012
2013 gettimeofday(&end_tv, NULL);
2014 stats.flist_buildtime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
2015 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
2016 if (stats.flist_buildtime == 0)
2017 stats.flist_buildtime = 1;
2018 start_tv = end_tv;
2019
2020 write_byte(f, 0); /* Indicate end of file list */
2021
2022 #ifdef SUPPORT_HARD_LINKS
2023 if (preserve_hard_links && protocol_version >= 30 && !inc_recurse)
2024 idev_destroy();
2025 #endif
2026
2027 if (show_filelist_p())
2028 finish_filelist_progress(flist);
2029
2030 gettimeofday(&end_tv, NULL);
2031 stats.flist_xfertime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
2032 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
2033
2034 /* When converting names, both sides keep an unsorted file-list array
2035 * because the names will differ on the sending and receiving sides
2036 * (both sides will use the unsorted index number for each item). */
2037
2038 /* Sort the list without removing any duplicates. This allows the
2039 * receiving side to ask for whatever name it kept. For incremental
2040 * recursion mode, the sender marks duplicate dirs so that it can
2041 * send them together in a single file-list. */
2042 if (need_unsorted_flist) {
2043 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
2044 out_of_memory("send_file_list");
2045 memcpy(flist->sorted, flist->files,
2046 flist->used * sizeof (struct file_struct*));
2047 } else
2048 flist->sorted = flist->files;
2049 flist_sort_and_clean(flist, 0);
2050 file_total += flist->used;
2051
2052 if (numeric_ids <= 0 && !inc_recurse)
2053 send_id_list(f);
2054
2055 /* send the io_error flag */
2056 if (protocol_version < 30)
2057 write_int(f, ignore_errors ? 0 : io_error);
2058 else if (io_error && !ignore_errors)
2059 send_msg_int(MSG_IO_ERROR, io_error);
2060
2061 if (disable_buffering)
2062 io_end_buffering_out();
2063
2064 stats.flist_size = stats.total_written - start_write;
2065 stats.num_files = flist->used;
2066
2067 if (verbose > 3)
2068 output_flist(flist);
2069
2070 if (verbose > 2)
2071 rprintf(FINFO, "send_file_list done\n");
2072
2073 if (inc_recurse) {
2074 send_dir_depth = 1;
2075 add_dirs_to_tree(-1, flist, dir_count);
2076 if (!file_total || strcmp(flist->sorted[0]->basename, ".") != 0)
2077 flist->parent_ndx = -1;
2078 flist_done_allocating(flist);
2079 if (send_dir_ndx < 0) {
2080 write_ndx(f, NDX_FLIST_EOF);
2081 flist_eof = 1;
2082 }
2083 else if (file_total == 1) {
2084 /* If we're creating incremental file-lists and there
2085 * was just 1 item in the first file-list, send 1 more
2086 * file-list to check if this is a 1-file xfer. */
2087 send_extra_file_list(f, 1);
2088 }
2089 }
2090
2091 return flist;
2092 }
2093
2094 struct file_list *recv_file_list(int f)
2095 {
2096 struct file_list *flist;
2097 int dstart, flags;
2098 int64 start_read;
2099
2100 if (!first_flist)
2101 rprintf(FLOG, "receiving file list\n");
2102 if (show_filelist_p())
2103 start_filelist_progress("receiving file list");
2104 else if (inc_recurse && verbose && !am_server && !first_flist)
2105 rprintf(FCLIENT, "receiving incremental file list\n");
2106
2107 start_read = stats.total_read;
2108
2109 #ifdef SUPPORT_HARD_LINKS
2110 if (preserve_hard_links && !first_flist)
2111 init_hard_links();
2112 #endif
2113
2114 flist = flist_new(0, "recv_file_list");
2115
2116 if (inc_recurse) {
2117 if (flist->ndx_start == 1)
2118 dir_flist = flist_new(FLIST_TEMP, "recv_file_list");
2119 dstart = dir_flist->used;
2120 } else {
2121 dir_flist = flist;
2122 dstart = 0;
2123 }
2124
2125 while ((flags = read_byte(f)) != 0) {
2126 struct file_struct *file;
2127
2128 flist_expand(flist, 1);
2129
2130 if (protocol_version >= 28 && (flags & XMIT_EXTENDED_FLAGS))
2131 flags |= read_byte(f) << 8;
2132 file = recv_file_entry(flist, flags, f);
2133
2134 if (inc_recurse && S_ISDIR(file->mode)) {
2135 flist_expand(dir_flist, 1);
2136 dir_flist->files[dir_flist->used++] = file;
2137 }
2138
2139 flist->files[flist->used++] = file;
2140
2141 maybe_emit_filelist_progress(flist->used);
2142
2143 if (verbose > 2) {
2144 rprintf(FINFO, "recv_file_name(%s)\n",
2145 f_name(file, NULL));
2146 }
2147 }
2148 file_total += flist->used;
2149
2150 if (verbose > 2)
2151 rprintf(FINFO, "received %d names\n", flist->used);
2152
2153 if (show_filelist_p())
2154 finish_filelist_progress(flist);
2155
2156 if (need_unsorted_flist) {
2157 /* Create an extra array of index pointers that we can sort for
2158 * the generator's use (for wading through the files in sorted
2159 * order and for calling flist_find()). We keep the "files"
2160 * list unsorted for our exchange of index numbers with the
2161 * other side (since their names may not sort the same). */
2162 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
2163 out_of_memory("recv_file_list");
2164 memcpy(flist->sorted, flist->files,
2165 flist->used * sizeof (struct file_struct*));
2166 if (inc_recurse && dir_flist->used > dstart) {
2167 static int dir_flist_malloced = 0;
2168 if (dir_flist_malloced < dir_flist->malloced) {
2169 dir_flist->sorted = realloc_array(dir_flist->sorted,
2170 struct file_struct *,
2171 dir_flist->malloced);
2172 dir_flist_malloced = dir_flist->malloced;
2173 }
2174 memcpy(dir_flist->sorted + dstart, dir_flist->files + dstart,
2175 (dir_flist->used - dstart) * sizeof (struct file_struct*));
2176 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2177 }
2178 } else {
2179 flist->sorted = flist->files;
2180 if (inc_recurse && dir_flist->used > dstart) {
2181 dir_flist->sorted = dir_flist->files;
2182 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2183 }
2184 }
2185
2186 if (inc_recurse)
2187 flist_done_allocating(flist);
2188 else if (f >= 0)
2189 recv_id_list(f, flist);
2190
2191 flist_sort_and_clean(flist, relative_paths);
2192
2193 if (protocol_version < 30) {
2194 /* Recv the io_error flag */
2195 if (ignore_errors)
2196 read_int(f);
2197 else
2198 io_error |= read_int(f);
2199 } else if (inc_recurse && flist->ndx_start == 1) {
2200 if (!file_total || strcmp(flist->sorted[0]->basename, ".") != 0)
2201 flist->parent_ndx = -1;
2202 }
2203
2204 if (verbose > 3)
2205 output_flist(flist);
2206
2207 if (verbose > 2)
2208 rprintf(FINFO, "recv_file_list done\n");
2209
2210 stats.flist_size += stats.total_read - start_read;
2211 stats.num_files += flist->used;
2212
2213 return flist;
2214 }
2215
2216 /* This is only used once by the receiver if the very first file-list
2217 * has exactly one item in it. */
2218 void recv_additional_file_list(int f)
2219 {
2220 struct file_list *flist;
2221 int ndx = read_ndx(f);
2222 if (ndx == NDX_FLIST_EOF) {
2223 flist_eof = 1;
2224 change_local_filter_dir(NULL, 0, 0);
2225 } else {
2226 ndx = NDX_FLIST_OFFSET - ndx;
2227 if (ndx < 0 || ndx >= dir_flist->used) {
2228 ndx = NDX_FLIST_OFFSET - ndx;
2229 rprintf(FERROR,
2230 "[%s] Invalid dir index: %d (%d - %d)\n",
2231 who_am_i(), ndx, NDX_FLIST_OFFSET,
2232 NDX_FLIST_OFFSET - dir_flist->used + 1);
2233 exit_cleanup(RERR_PROTOCOL);
2234 }
2235 if (verbose > 3) {
2236 rprintf(FINFO, "[%s] receiving flist for dir %d\n",
2237 who_am_i(), ndx);
2238 }
2239 flist = recv_file_list(f);
2240 flist->parent_ndx = ndx;
2241 }
2242 }
2243
2244 /* Search for an identically-named item in the file list. Note that the
2245 * items must agree in their directory-ness, or no match is returned. */
2246 int flist_find(struct file_list *flist, struct file_struct *f)
2247 {
2248 int low = flist->low, high = flist->high;
2249 int diff, mid, mid_up;
2250
2251 while (low <= high) {
2252 mid = (low + high) / 2;
2253 if (F_IS_ACTIVE(flist->sorted[mid]))
2254 mid_up = mid;
2255 else {
2256 /* Scan for the next non-empty entry using the cached
2257 * distance values. If the value isn't fully up-to-
2258 * date, update it. */
2259 mid_up = mid + F_DEPTH(flist->sorted[mid]);
2260 if (!F_IS_ACTIVE(flist->sorted[mid_up])) {
2261 do {
2262 mid_up += F_DEPTH(flist->sorted[mid_up]);
2263 } while (!F_IS_ACTIVE(flist->sorted[mid_up]));
2264 F_DEPTH(flist->sorted[mid]) = mid_up - mid;
2265 }
2266 if (mid_up > high) {
2267 /* If there's nothing left above us, set high to
2268 * a non-empty entry below us and continue. */
2269 high = mid - (int)flist->sorted[mid]->len32;
2270 if (!F_IS_ACTIVE(flist->sorted[high])) {
2271 do {
2272 high -= (int)flist->sorted[high]->len32;
2273 } while (!F_IS_ACTIVE(flist->sorted[high]));
2274 flist->sorted[mid]->len32 = mid - high;
2275 }
2276 continue;
2277 }
2278 }
2279 diff = f_name_cmp(flist->sorted[mid_up], f);
2280 if (diff == 0) {
2281 if (protocol_version < 29
2282 && S_ISDIR(flist->sorted[mid_up]->mode)
2283 != S_ISDIR(f->mode))
2284 return -1;
2285 return mid_up;
2286 }
2287 if (diff < 0)
2288 low = mid_up + 1;
2289 else
2290 high = mid - 1;
2291 }
2292 return -1;
2293 }
2294
2295 /*
2296 * Free up any resources a file_struct has allocated
2297 * and clear the file.
2298 */
2299 void clear_file(struct file_struct *file)
2300 {
2301 /* The +1 zeros out the first char of the basename. */
2302 memset(file, 0, FILE_STRUCT_LEN + 1);
2303 /* In an empty entry, F_DEPTH() is an offset to the next non-empty
2304 * entry. Likewise for len32 in the opposite direction. We assume
2305 * that we're alone for now since flist_find() will adjust the counts
2306 * it runs into that aren't up-to-date. */
2307 file->len32 = F_DEPTH(file) = 1;
2308 }
2309
2310 /* Allocate a new file list. */
2311 struct file_list *flist_new(int flags, char *msg)
2312 {
2313 struct file_list *flist;
2314
2315 if (!(flist = new0(struct file_list)))
2316 out_of_memory(msg);
2317
2318 if (flags & FLIST_TEMP) {
2319 if (!(flist->file_pool = pool_create(SMALL_EXTENT, 0,
2320 out_of_memory, POOL_INTERN)))
2321 out_of_memory(msg);
2322 } else {
2323 /* This is a doubly linked list with prev looping back to
2324 * the end of the list, but the last next pointer is NULL. */
2325 if (!first_flist) {
2326 flist->file_pool = pool_create(NORMAL_EXTENT, 0,
2327 out_of_memory, POOL_INTERN);
2328 if (!flist->file_pool)
2329 out_of_memory(msg);
2330
2331 flist->ndx_start = flist->flist_num = inc_recurse ? 1 : 0;
2332
2333 first_flist = cur_flist = flist->prev = flist;
2334 } else {
2335 struct file_list *prev = first_flist->prev;
2336
2337 flist->file_pool = first_flist->file_pool;
2338
2339 flist->ndx_start = prev->ndx_start + prev->used + 1;
2340 flist->flist_num = prev->flist_num + 1;
2341
2342 flist->prev = prev;
2343 prev->next = first_flist->prev = flist;
2344 }
2345 flist->pool_boundary = pool_boundary(flist->file_pool, 0);
2346 flist_cnt++;
2347 }
2348
2349 return flist;
2350 }
2351
2352 /* Free up all elements in a flist. */
2353 void flist_free(struct file_list *flist)
2354 {
2355 if (!flist->prev) {
2356 /* Was FLIST_TEMP dir-list. */
2357 } else if (flist == flist->prev) {
2358 first_flist = cur_flist = NULL;
2359 file_total = 0;
2360 flist_cnt = 0;
2361 } else {
2362 if (flist == cur_flist)
2363 cur_flist = flist->next;
2364 if (flist == first_flist)
2365 first_flist = first_flist->next;
2366 else {
2367 flist->prev->next = flist->next;
2368 if (!flist->next)
2369 flist->next = first_flist;
2370 }
2371 flist->next->prev = flist->prev;
2372 file_total -= flist->used;
2373 flist_cnt--;
2374 }
2375
2376 if (!flist->prev || !flist_cnt)
2377 pool_destroy(flist->file_pool);
2378 else
2379 pool_free_old(flist->file_pool, flist->pool_boundary);
2380
2381 if (flist->sorted && flist->sorted != flist->files)
2382 free(flist->sorted);
2383 free(flist->files);
2384 free(flist);
2385 }
2386
2387 /* This routine ensures we don't have any duplicate names in our file list.
2388 * duplicate names can cause corruption because of the pipelining. */
2389 static void flist_sort_and_clean(struct file_list *flist, int strip_root)
2390 {
2391 char fbuf[MAXPATHLEN];
2392 int i, prev_i;
2393
2394 if (!flist)
2395 return;
2396 if (flist->used == 0) {
2397 flist->high = -1;
2398 flist->low = 0;
2399 return;
2400 }
2401
2402 fsort(flist->sorted, flist->used);
2403
2404 if (!am_sender || inc_recurse) {
2405 for (i = prev_i = 0; i < flist->used; i++) {
2406 if (F_IS_ACTIVE(flist->sorted[i])) {
2407 prev_i = i;
2408 break;
2409 }
2410 }
2411 flist->low = prev_i;
2412 } else {
2413 i = prev_i = flist->used - 1;
2414 flist->low = 0;
2415 }
2416
2417 while (++i < flist->used) {
2418 int j;
2419 struct file_struct *file = flist->sorted[i];
2420
2421 if (!F_IS_ACTIVE(file))
2422 continue;
2423 if (f_name_cmp(file, flist->sorted[prev_i]) == 0)
2424 j = prev_i;
2425 else if (protocol_version >= 29 && S_ISDIR(file->mode)) {
2426 int save_mode = file->mode;
2427 /* Make sure that this directory doesn't duplicate a
2428 * non-directory earlier in the list. */
2429 flist->high = prev_i;
2430 file->mode = S_IFREG;
2431 j = flist_find(flist, file);
2432 file->mode = save_mode;
2433 } else
2434 j = -1;
2435 if (j >= 0) {
2436 int keep, drop;
2437 /* If one is a dir and the other is not, we want to
2438 * keep the dir because it might have contents in the
2439 * list. Otherwise keep the first one. */
2440 if (S_ISDIR(file->mode)) {
2441 struct file_struct *fp = flist->sorted[j];
2442 if (!S_ISDIR(fp->mode))
2443 keep = i, drop = j;
2444 else {
2445 if (am_sender)
2446 file->flags |= FLAG_DUPLICATE;
2447 else { /* Make sure we merge our vital flags. */
2448 fp->flags |= file->flags & (FLAG_TOP_DIR|FLAG_CONTENT_DIR);
2449 fp->flags &= file->flags | ~FLAG_IMPLIED_DIR;
2450 }
2451 keep = j, drop = i;
2452 }
2453 } else
2454 keep = j, drop = i;
2455
2456 if (!am_sender) {
2457 if (verbose > 1) {
2458 rprintf(FINFO,
2459 "removing duplicate name %s from file list (%d)\n",
2460 f_name(file, fbuf), drop + flist->ndx_start);
2461 }
2462 clear_file(flist->sorted[drop]);
2463 }
2464
2465 if (keep == i) {
2466 if (flist->low == drop) {
2467 for (j = drop + 1;
2468 j < i && !F_IS_ACTIVE(flist->sorted[j]);
2469 j++) {}
2470 flist->low = j;
2471 }
2472 prev_i = i;
2473 }
2474 } else
2475 prev_i = i;
2476 }
2477 flist->high = prev_i;
2478
2479 if (strip_root) {
2480 /* We need to strip off the leading slashes for relative
2481 * paths, but this must be done _after_ the sorting phase. */
2482 for (i = flist->low; i <= flist->high; i++) {
2483 struct file_struct *file = flist->sorted[i];
2484
2485 if (!file->dirname)
2486 continue;
2487 while (*file->dirname == '/')
2488 file->dirname++;
2489 if (!*file->dirname)
2490 file->dirname = NULL;
2491 }
2492 }
2493
2494 if (prune_empty_dirs && !am_sender) {
2495 int j, prev_depth = 0;
2496
2497 prev_i = 0; /* It's OK that this isn't really true. */
2498
2499 for (i = flist->low; i <= flist->high; i++) {
2500 struct file_struct *fp, *file = flist->sorted[i];
2501
2502 /* This temporarily abuses the F_DEPTH() value for a
2503 * directory that is in a chain that might get pruned.
2504 * We restore the old value if it gets a reprieve. */
2505 if (S_ISDIR(file->mode) && F_DEPTH(file)) {
2506 /* Dump empty dirs when coming back down. */
2507 for (j = prev_depth; j >= F_DEPTH(file); j--) {
2508 fp = flist->sorted[prev_i];
2509 if (F_DEPTH(fp) >= 0)
2510 break;
2511 prev_i = -F_DEPTH(fp)-1;
2512 clear_file(fp);
2513 }
2514 prev_depth = F_DEPTH(file);
2515 if (is_excluded(f_name(file, fbuf), 1,
2516 ALL_FILTERS)) {
2517 /* Keep dirs through this dir. */
2518 for (j = prev_depth-1; ; j--) {
2519 fp = flist->sorted[prev_i];
2520 if (F_DEPTH(fp) >= 0)
2521 break;
2522 prev_i = -F_DEPTH(fp)-1;
2523 F_DEPTH(fp) = j;
2524 }
2525 } else
2526 F_DEPTH(file) = -prev_i-1;
2527 prev_i = i;
2528 } else {
2529 /* Keep dirs through this non-dir. */
2530 for (j = prev_depth; ; j--) {
2531 fp = flist->sorted[prev_i];
2532 if (F_DEPTH(fp) >= 0)
2533 break;
2534 prev_i = -F_DEPTH(fp)-1;
2535 F_DEPTH(fp) = j;
2536 }
2537 }
2538 }
2539 /* Dump all remaining empty dirs. */
2540 while (1) {
2541 struct file_struct *fp = flist->sorted[prev_i];
2542 if (F_DEPTH(fp) >= 0)
2543 break;
2544 prev_i = -F_DEPTH(fp)-1;
2545 clear_file(fp);
2546 }
2547
2548 for (i = flist->low; i <= flist->high; i++) {
2549 if (F_IS_ACTIVE(flist->sorted[i]))
2550 break;
2551 }
2552 flist->low = i;
2553 for (i = flist->high; i >= flist->low; i--) {
2554 if (F_IS_ACTIVE(flist->sorted[i]))
2555 break;
2556 }
2557 flist->high = i;
2558 }
2559 }
2560
2561 static void output_flist(struct file_list *flist)
2562 {
2563 char uidbuf[16], gidbuf[16], depthbuf[16];
2564 struct file_struct *file;
2565 const char *root, *dir, *slash, *name, *trail;
2566 const char *who = who_am_i();
2567 int i;
2568
2569 rprintf(FINFO, "[%s] flist start=%d, used=%d, low=%d, high=%d\n",
2570 who, flist->ndx_start, flist->used, flist->low, flist->high);
2571 for (i = 0; i < flist->used; i++) {
2572 file = flist->files[i];
2573 if ((am_root || am_sender) && uid_ndx) {
2574 snprintf(uidbuf, sizeof uidbuf, " uid=%u",
2575 F_OWNER(file));
2576 } else
2577 *uidbuf = '\0';
2578 if (gid_ndx) {
2579 static char parens[] = "(\0)\0\0\0";
2580 char *pp = parens + (file->flags & FLAG_SKIP_GROUP ? 0 : 3);
2581 snprintf(gidbuf, sizeof gidbuf, " gid=%s%u%s",
2582 pp, F_GROUP(file), pp + 2);
2583 } else
2584 *gidbuf = '\0';
2585 if (!am_sender)
2586 snprintf(depthbuf, sizeof depthbuf, "%d", F_DEPTH(file));
2587 if (F_IS_ACTIVE(file)) {
2588 root = am_sender ? NS(F_PATHNAME(file)) : depthbuf;
2589 if ((dir = file->dirname) == NULL)
2590 dir = slash = "";
2591 else
2592 slash = "/";
2593 name = file->basename;
2594 trail = S_ISDIR(file->mode) ? "/" : "";
2595 } else
2596 root = dir = slash = name = trail = "";
2597 rprintf(FINFO,
2598 "[%s] i=%d %s %s%s%s%s mode=0%o len=%.0f%s%s flags=%x\n",
2599 who, i + flist->ndx_start,
2600 root, dir, slash, name, trail,
2601 (int)file->mode, (double)F_LENGTH(file),
2602 uidbuf, gidbuf, file->flags);
2603 }
2604 }
2605
2606 enum fnc_state { s_DIR, s_SLASH, s_BASE, s_TRAILING };
2607 enum fnc_type { t_PATH, t_ITEM };
2608
2609 static int found_prefix;
2610
2611 /* Compare the names of two file_struct entities, similar to how strcmp()
2612 * would do if it were operating on the joined strings.
2613 *
2614 * Some differences beginning with protocol_version 29: (1) directory names
2615 * are compared with an assumed trailing slash so that they compare in a
2616 * way that would cause them to sort immediately prior to any content they
2617 * may have; (2) a directory of any name compares after a non-directory of
2618 * any name at the same depth; (3) a directory with name "." compares prior
2619 * to anything else. These changes mean that a directory and a non-dir
2620 * with the same name will not compare as equal (protocol_version >= 29).
2621 *
2622 * The dirname component can be an empty string, but the basename component
2623 * cannot (and never is in the current codebase). The basename component
2624 * may be NULL (for a removed item), in which case it is considered to be
2625 * after any existing item. */
2626 int f_name_cmp(const struct file_struct *f1, const struct file_struct *f2)
2627 {
2628 int dif;
2629 const uchar *c1, *c2;
2630 enum fnc_state state1, state2;
2631 enum fnc_type type1, type2;
2632 enum fnc_type t_path = protocol_version >= 29 ? t_PATH : t_ITEM;
2633
2634 if (!f1 || !F_IS_ACTIVE(f1)) {
2635 if (!f2 || !F_IS_ACTIVE(f2))
2636 return 0;
2637 return -1;
2638 }
2639 if (!f2 || !F_IS_ACTIVE(f2))
2640 return 1;
2641
2642 c1 = (uchar*)f1->dirname;
2643 c2 = (uchar*)f2->dirname;
2644 if (c1 == c2)
2645 c1 = c2 = NULL;
2646 if (!c1) {
2647 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2648 c1 = (const uchar*)f1->basename;
2649 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2650 type1 = t_ITEM;
2651 state1 = s_TRAILING;
2652 c1 = (uchar*)"";
2653 } else
2654 state1 = s_BASE;
2655 } else {
2656 type1 = t_path;
2657 state1 = s_DIR;
2658 }
2659 if (!c2) {
2660 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2661 c2 = (const uchar*)f2->basename;
2662 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2663 type2 = t_ITEM;
2664 state2 = s_TRAILING;
2665 c2 = (uchar*)"";
2666 } else
2667 state2 = s_BASE;
2668 } else {
2669 type2 = t_path;
2670 state2 = s_DIR;
2671 }
2672
2673 if (type1 != type2)
2674 return type1 == t_PATH ? 1 : -1;
2675
2676 do {
2677 if (!*c1) {
2678 switch (state1) {
2679 case s_DIR:
2680 state1 = s_SLASH;
2681 c1 = (uchar*)"/";
2682 break;
2683 case s_SLASH:
2684 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2685 c1 = (const uchar*)f1->basename;
2686 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2687 type1 = t_ITEM;
2688 state1 = s_TRAILING;
2689 c1 = (uchar*)"";
2690 } else
2691 state1 = s_BASE;
2692 break;
2693 case s_BASE:
2694 state1 = s_TRAILING;
2695 if (type1 == t_PATH) {
2696 c1 = (uchar*)"/";
2697 break;
2698 }
2699 /* FALL THROUGH */
2700 case s_TRAILING:
2701 type1 = t_ITEM;
2702 break;
2703 }
2704 if (*c2 && type1 != type2)
2705 return type1 == t_PATH ? 1 : -1;
2706 }
2707 if (!*c2) {
2708 switch (state2) {
2709 case s_DIR:
2710 state2 = s_SLASH;
2711 c2 = (uchar*)"/";
2712 break;
2713 case s_SLASH:
2714 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2715 c2 = (const uchar*)f2->basename;
2716 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2717 type2 = t_ITEM;
2718 state2 = s_TRAILING;
2719 c2 = (uchar*)"";
2720 } else
2721 state2 = s_BASE;
2722 break;
2723 case s_BASE:
2724 state2 = s_TRAILING;
2725 if (type2 == t_PATH) {
2726 c2 = (uchar*)"/";
2727 break;
2728 }
2729 /* FALL THROUGH */
2730 case s_TRAILING:
2731 found_prefix = 1;
2732 if (!*c1)
2733 return 0;
2734 type2 = t_ITEM;
2735 break;
2736 }
2737 if (type1 != type2)
2738 return type1 == t_PATH ? 1 : -1;
2739 }
2740 } while ((dif = (int)*c1++ - (int)*c2++) == 0);
2741
2742 return dif;
2743 }
2744
2745 /* Returns 1 if f1's filename has all of f2's filename as a prefix. This does
2746 * not match if f2's basename is not an exact match of a path element in f1.
2747 * E.g. /path/foo is not a prefix of /path/foobar/baz, but /path/foobar is. */
2748 int f_name_has_prefix(const struct file_struct *f1, const struct file_struct *f2)
2749 {
2750 found_prefix = 0;
2751 f_name_cmp(f1, f2);
2752 return found_prefix;
2753 }
2754
2755 char *f_name_buf(void)
2756 {
2757 static char names[5][MAXPATHLEN];
2758 static unsigned int n;
2759
2760 n = (n + 1) % (sizeof names / sizeof names[0]);
2761
2762 return names[n];
2763 }
2764
2765 /* Return a copy of the full filename of a flist entry, using the indicated
2766 * buffer or one of 5 static buffers if fbuf is NULL. No size-checking is
2767 * done because we checked the size when creating the file_struct entry.
2768 */
2769 char *f_name(const struct file_struct *f, char *fbuf)
2770 {
2771 if (!f || !F_IS_ACTIVE(f))
2772 return NULL;
2773
2774 if (!fbuf)
2775 fbuf = f_name_buf();
2776
2777 if (f->dirname) {
2778 int len = strlen(f->dirname);
2779 memcpy(fbuf, f->dirname, len);
2780 fbuf[len] = '/';
2781 strlcpy(fbuf + len + 1, f->basename, MAXPATHLEN - (len + 1));
2782 } else
2783 strlcpy(fbuf, f->basename, MAXPATHLEN);
2784
2785 return fbuf;
2786 }
2787
2788 /* Do a non-recursive scan of the named directory, possibly ignoring all
2789 * exclude rules except for the daemon's. If "dlen" is >=0, it is the length
2790 * of the dirname string, and also indicates that "dirname" is a MAXPATHLEN
2791 * buffer (the functions we call will append names onto the end, but the old
2792 * dir value will be restored on exit). */
2793 struct file_list *get_dirlist(char *dirname, int dlen, int ignore_filter_rules)
2794 {
2795 struct file_list *dirlist;
2796 char dirbuf[MAXPATHLEN];
2797 int save_recurse = recurse;
2798 int save_xfer_dirs = xfer_dirs;
2799 int save_prune_empty_dirs = prune_empty_dirs;
2800
2801 if (dlen < 0) {
2802 dlen = strlcpy(dirbuf, dirname, MAXPATHLEN);
2803 if (dlen >= MAXPATHLEN)
2804 return NULL;
2805 dirname = dirbuf;
2806 }
2807
2808 dirlist = flist_new(FLIST_TEMP, "get_dirlist");
2809
2810 recurse = 0;
2811 xfer_dirs = 1;
2812 send_directory(ignore_filter_rules ? -2 : -1, dirlist, dirname, dlen, 0);
2813 xfer_dirs = save_xfer_dirs;
2814 recurse = save_recurse;
2815 if (do_progress)
2816 flist_count_offset += dirlist->used;
2817
2818 prune_empty_dirs = 0;
2819 dirlist->sorted = dirlist->files;
2820 flist_sort_and_clean(dirlist, 0);
2821 prune_empty_dirs = save_prune_empty_dirs;
2822
2823 if (verbose > 3)
2824 output_flist(dirlist);
2825
2826 return dirlist;
2827 }
rsync: a fast, versatile, remote (and local) file-copying tool