?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
A couple xattr fixes for --fake-super.
[rsync.git] / flist.c
blob9b69d9211a4233a175e90e020d308767648d4514
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 int64 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 SIZEOF_INT64 >= 8
841 if (file_length > 0xFFFFFFFFu && S_ISREG(mode))
842 extra_len += EXTRA_LEN;
843 #endif
844 if (file_length < 0) {
845 rprintf(FERROR, "Offset underflow: file-length is negative\n");
846 exit_cleanup(RERR_UNSUPPORTED);
847 }
848
849 if (inc_recurse && S_ISDIR(mode)) {
850 if (one_file_system) {
851 /* Room to save the dir's device for -x */
852 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
853 }
854 pool = dir_flist->file_pool;
855 } else
856 pool = flist->file_pool;
857
858 #if EXTRA_ROUNDING > 0
859 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
860 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
861 #endif
862
863 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
864 + linkname_len;
865 bp = pool_alloc(pool, alloc_len, "recv_file_entry");
866
867 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
868 bp += extra_len;
869 file = (struct file_struct *)bp;
870 bp += FILE_STRUCT_LEN;
871
872 memcpy(bp, basename, basename_len);
873
874 #ifdef SUPPORT_HARD_LINKS
875 if (xflags & XMIT_HLINKED)
876 file->flags |= FLAG_HLINKED;
877 #endif
878 file->modtime = (time_t)modtime;
879 file->len32 = (uint32)file_length;
880 #if SIZEOF_INT64 >= 8
881 if (file_length > 0xFFFFFFFFu && S_ISREG(mode)) {
882 #if SIZEOF_CAPITAL_OFF_T < 8
883 rprintf(FERROR, "Offset overflow: attempted 64-bit file-length\n");
884 exit_cleanup(RERR_UNSUPPORTED);
885 #else
886 file->flags |= FLAG_LENGTH64;
887 OPT_EXTRA(file, 0)->unum = (uint32)(file_length >> 32);
888 #endif
889 }
890 #endif
891 file->mode = mode;
892 if (preserve_uid)
893 F_OWNER(file) = uid;
894 if (preserve_gid) {
895 F_GROUP(file) = gid;
896 file->flags |= gid_flags;
897 }
898 if (unsort_ndx)
899 F_NDX(file) = flist->used + flist->ndx_start;
900
901 if (basename != thisname) {
902 file->dirname = lastdir;
903 F_DEPTH(file) = lastdir_depth + 1;
904 } else
905 F_DEPTH(file) = 1;
906
907 if (S_ISDIR(mode)) {
908 if (basename_len == 1+1 && *basename == '.') /* +1 for '\0' */
909 F_DEPTH(file)--;
910 if (protocol_version >= 30) {
911 if (!(xflags & XMIT_NO_CONTENT_DIR)) {
912 if (xflags & XMIT_TOP_DIR)
913 file->flags |= FLAG_TOP_DIR;
914 file->flags |= FLAG_CONTENT_DIR;
915 } else if (xflags & XMIT_TOP_DIR)
916 file->flags |= FLAG_IMPLIED_DIR;
917 } else if (xflags & XMIT_TOP_DIR) {
918 in_del_hier = recurse;
919 del_hier_name_len = F_DEPTH(file) == 0 ? 0 : l1 + l2;
920 if (relative_paths && del_hier_name_len > 2
921 && lastname[del_hier_name_len-1] == '.'
922 && lastname[del_hier_name_len-2] == '/')
923 del_hier_name_len -= 2;
924 file->flags |= FLAG_TOP_DIR | FLAG_CONTENT_DIR;
925 } else if (in_del_hier) {
926 if (!relative_paths || !del_hier_name_len
927 || (l1 >= del_hier_name_len
928 && lastname[del_hier_name_len] == '/'))
929 file->flags |= FLAG_CONTENT_DIR;
930 else
931 in_del_hier = 0;
932 }
933 }
934
935 if ((preserve_devices && IS_DEVICE(mode))
936 || (preserve_specials && IS_SPECIAL(mode))) {
937 uint32 *devp = F_RDEV_P(file);
938 DEV_MAJOR(devp) = major(rdev);
939 DEV_MINOR(devp) = minor(rdev);
940 }
941
942 #ifdef SUPPORT_LINKS
943 if (linkname_len) {
944 bp += basename_len;
945 if (first_hlink_ndx >= flist->ndx_start) {
946 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
947 memcpy(bp, F_SYMLINK(first), linkname_len);
948 } else if (munge_symlinks) {
949 strlcpy(bp, SYMLINK_PREFIX, linkname_len);
950 bp += SYMLINK_PREFIX_LEN;
951 linkname_len -= SYMLINK_PREFIX_LEN;
952 read_sbuf(f, bp, linkname_len - 1);
953 } else {
954 read_sbuf(f, bp, linkname_len - 1);
955 if (sanitize_paths)
956 sanitize_path(bp, bp, "", lastdir_depth, SP_DEFAULT);
957 }
958 }
959 #endif
960
961 #ifdef SUPPORT_HARD_LINKS
962 if (preserve_hard_links && xflags & XMIT_HLINKED) {
963 if (protocol_version >= 30) {
964 if (xflags & XMIT_HLINK_FIRST) {
965 F_HL_GNUM(file) = flist->ndx_start + flist->used;
966 } else
967 F_HL_GNUM(file) = first_hlink_ndx;
968 } else {
969 static int32 cnt = 0;
970 struct ht_int64_node *np;
971 int64 ino;
972 int32 ndx;
973 if (protocol_version < 26) {
974 dev = read_int(f);
975 ino = read_int(f);
976 } else {
977 if (!(xflags & XMIT_SAME_DEV_pre30))
978 dev = read_longint(f);
979 ino = read_longint(f);
980 }
981 np = idev_find(dev, ino);
982 ndx = (int32)(long)np->data - 1;
983 if (ndx < 0) {
984 ndx = cnt++;
985 np->data = (void*)(long)cnt;
986 }
987 F_HL_GNUM(file) = ndx;
988 }
989 }
990 #endif
991
992 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
993 if (S_ISREG(mode))
994 bp = F_SUM(file);
995 else {
996 /* Prior to 28, we get a useless set of nulls. */
997 bp = tmp_sum;
998 }
999 if (first_hlink_ndx >= flist->ndx_start) {
1000 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
1001 memcpy(bp, F_SUM(first), checksum_len);
1002 } else
1003 read_buf(f, bp, checksum_len);
1004 }
1005
1006 #ifdef SUPPORT_ACLS
1007 if (preserve_acls && !S_ISLNK(mode))
1008 receive_acl(file, f);
1009 #endif
1010 #ifdef SUPPORT_XATTRS
1011 if (preserve_xattrs)
1012 receive_xattr(file, f );
1013 #endif
1014
1015 if (S_ISREG(mode) || S_ISLNK(mode))
1016 stats.total_size += file_length;
1017
1018 return file;
1019 }
1020
1021 /* Create a file_struct for a named file by reading its stat() information
1022 * and performing extensive checks against global options.
1023 *
1024 * Returns a pointer to the new file struct, or NULL if there was an error
1025 * or this file should be excluded.
1026 *
1027 * Note: Any error (here or in send_file_name) that results in the omission of
1028 * an existent source file from the file list should set
1029 * "io_error |= IOERR_GENERAL" to avoid deletion of the file from the
1030 * destination if --delete is on. */
1031 struct file_struct *make_file(const char *fname, struct file_list *flist,
1032 STRUCT_STAT *stp, int flags, int filter_level)
1033 {
1034 static char *lastdir;
1035 static int lastdir_len = -1;
1036 struct file_struct *file;
1037 char thisname[MAXPATHLEN];
1038 char linkname[MAXPATHLEN];
1039 int alloc_len, basename_len, linkname_len;
1040 int extra_len = file_extra_cnt * EXTRA_LEN;
1041 const char *basename;
1042 alloc_pool_t *pool;
1043 STRUCT_STAT st;
1044 char *bp;
1045
1046 if (strlcpy(thisname, fname, sizeof thisname) >= sizeof thisname) {
1047 io_error |= IOERR_GENERAL;
1048 rprintf(FINFO, "skipping overly long name: %s\n", fname);
1049 return NULL;
1050 }
1051 clean_fname(thisname, 0);
1052 if (sanitize_paths)
1053 sanitize_path(thisname, thisname, "", 0, SP_DEFAULT);
1054
1055 if (stp && S_ISDIR(stp->st_mode)) {
1056 st = *stp; /* Needed for "symlink/." with --relative. */
1057 *linkname = '\0'; /* make IBM code checker happy */
1058 } else if (readlink_stat(thisname, &st, linkname) != 0) {
1059 int save_errno = errno;
1060 /* See if file is excluded before reporting an error. */
1061 if (filter_level != NO_FILTERS
1062 && (is_excluded(thisname, 0, filter_level)
1063 || is_excluded(thisname, 1, filter_level))) {
1064 if (ignore_perishable && save_errno != ENOENT)
1065 non_perishable_cnt++;
1066 return NULL;
1067 }
1068 if (save_errno == ENOENT) {
1069 #ifdef SUPPORT_LINKS
1070 /* When our options tell us to follow a symlink that
1071 * points nowhere, tell the user about the symlink
1072 * instead of giving a "vanished" message. We only
1073 * dereference a symlink if one of the --copy*links
1074 * options was specified, so there's no need for the
1075 * extra lstat() if one of these options isn't on. */
1076 if ((copy_links || copy_unsafe_links || copy_dirlinks)
1077 && x_lstat(thisname, &st, NULL) == 0
1078 && S_ISLNK(st.st_mode)) {
1079 io_error |= IOERR_GENERAL;
1080 rprintf(FERROR_XFER, "symlink has no referent: %s\n",
1081 full_fname(thisname));
1082 } else
1083 #endif
1084 {
1085 enum logcode c = am_daemon && protocol_version < 28
1086 ? FERROR : FWARNING;
1087 io_error |= IOERR_VANISHED;
1088 rprintf(c, "file has vanished: %s\n",
1089 full_fname(thisname));
1090 }
1091 } else {
1092 io_error |= IOERR_GENERAL;
1093 rsyserr(FERROR_XFER, save_errno, "readlink %s failed",
1094 full_fname(thisname));
1095 }
1096 return NULL;
1097 }
1098
1099 if (filter_level == NO_FILTERS)
1100 goto skip_filters;
1101
1102 if (S_ISDIR(st.st_mode)) {
1103 if (!xfer_dirs) {
1104 rprintf(FINFO, "skipping directory %s\n", thisname);
1105 return NULL;
1106 }
1107 /* -x only affects dirs because we need to avoid recursing
1108 * into a mount-point directory, not to avoid copying a
1109 * symlinked file if -L (or similar) was specified. */
1110 if (one_file_system && st.st_dev != filesystem_dev
1111 && BITS_SETnUNSET(flags, FLAG_CONTENT_DIR, FLAG_TOP_DIR)) {
1112 if (one_file_system > 1) {
1113 if (verbose > 1) {
1114 rprintf(FINFO,
1115 "[%s] skipping mount-point dir %s\n",
1116 who_am_i(), thisname);
1117 }
1118 return NULL;
1119 }
1120 flags |= FLAG_MOUNT_DIR;
1121 flags &= ~FLAG_CONTENT_DIR;
1122 }
1123 } else
1124 flags &= ~FLAG_CONTENT_DIR;
1125
1126 if (is_excluded(thisname, S_ISDIR(st.st_mode) != 0, filter_level)) {
1127 if (ignore_perishable)
1128 non_perishable_cnt++;
1129 return NULL;
1130 }
1131
1132 if (lp_ignore_nonreadable(module_id)) {
1133 #ifdef SUPPORT_LINKS
1134 if (!S_ISLNK(st.st_mode))
1135 #endif
1136 if (access(thisname, R_OK) != 0)
1137 return NULL;
1138 }
1139
1140 skip_filters:
1141
1142 /* Only divert a directory in the main transfer. */
1143 if (flist) {
1144 if (flist->prev && S_ISDIR(st.st_mode)
1145 && flags & FLAG_DIVERT_DIRS) {
1146 /* Room for parent/sibling/next-child info. */
1147 extra_len += DIRNODE_EXTRA_CNT * EXTRA_LEN;
1148 if (relative_paths)
1149 extra_len += PTR_EXTRA_CNT * EXTRA_LEN;
1150 pool = dir_flist->file_pool;
1151 } else
1152 pool = flist->file_pool;
1153 } else {
1154 #ifdef SUPPORT_ACLS
1155 /* Directories need an extra int32 for the default ACL. */
1156 if (preserve_acls && S_ISDIR(st.st_mode))
1157 extra_len += EXTRA_LEN;
1158 #endif
1159 pool = NULL;
1160 }
1161
1162 if (verbose > 2) {
1163 rprintf(FINFO, "[%s] make_file(%s,*,%d)\n",
1164 who_am_i(), thisname, filter_level);
1165 }
1166
1167 if ((basename = strrchr(thisname, '/')) != NULL) {
1168 int len = basename++ - thisname;
1169 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
1170 lastdir = new_array(char, len + 1);
1171 memcpy(lastdir, thisname, len);
1172 lastdir[len] = '\0';
1173 lastdir_len = len;
1174 }
1175 } else
1176 basename = thisname;
1177 basename_len = strlen(basename) + 1; /* count the '\0' */
1178
1179 #ifdef SUPPORT_LINKS
1180 linkname_len = S_ISLNK(st.st_mode) ? strlen(linkname) + 1 : 0;
1181 #else
1182 linkname_len = 0;
1183 #endif
1184
1185 #if SIZEOF_CAPITAL_OFF_T >= 8
1186 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode))
1187 extra_len += EXTRA_LEN;
1188 #endif
1189
1190 #if EXTRA_ROUNDING > 0
1191 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
1192 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
1193 #endif
1194
1195 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
1196 + linkname_len;
1197 if (pool)
1198 bp = pool_alloc(pool, alloc_len, "make_file");
1199 else {
1200 if (!(bp = new_array(char, alloc_len)))
1201 out_of_memory("make_file");
1202 }
1203
1204 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
1205 bp += extra_len;
1206 file = (struct file_struct *)bp;
1207 bp += FILE_STRUCT_LEN;
1208
1209 memcpy(bp, basename, basename_len);
1210
1211 #ifdef SUPPORT_HARD_LINKS
1212 if (preserve_hard_links && flist && flist->prev) {
1213 if (protocol_version >= 28
1214 ? (!S_ISDIR(st.st_mode) && st.st_nlink > 1)
1215 : S_ISREG(st.st_mode)) {
1216 tmp_dev = st.st_dev;
1217 tmp_ino = st.st_ino;
1218 } else
1219 tmp_dev = 0;
1220 }
1221 #endif
1222
1223 #ifdef HAVE_STRUCT_STAT_ST_RDEV
1224 if (IS_DEVICE(st.st_mode) || IS_SPECIAL(st.st_mode)) {
1225 tmp_rdev = st.st_rdev;
1226 st.st_size = 0;
1227 }
1228 #endif
1229
1230 file->flags = flags;
1231 file->modtime = st.st_mtime;
1232 file->len32 = (uint32)st.st_size;
1233 #if SIZEOF_CAPITAL_OFF_T >= 8
1234 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode)) {
1235 file->flags |= FLAG_LENGTH64;
1236 OPT_EXTRA(file, 0)->unum = (uint32)(st.st_size >> 32);
1237 }
1238 #endif
1239 file->mode = st.st_mode;
1240 if (uid_ndx) /* Check uid_ndx instead of preserve_uid for del support */
1241 F_OWNER(file) = st.st_uid;
1242 if (gid_ndx) /* Check gid_ndx instead of preserve_gid for del support */
1243 F_GROUP(file) = st.st_gid;
1244
1245 if (basename != thisname)
1246 file->dirname = lastdir;
1247
1248 #ifdef SUPPORT_LINKS
1249 if (linkname_len)
1250 memcpy(bp + basename_len, linkname, linkname_len);
1251 #endif
1252
1253 if (always_checksum && am_sender && S_ISREG(st.st_mode))
1254 file_checksum(thisname, tmp_sum, st.st_size);
1255
1256 if (am_sender)
1257 F_PATHNAME(file) = pathname;
1258 else if (!pool)
1259 F_DEPTH(file) = extra_len / EXTRA_LEN;
1260
1261 /* This code is only used by the receiver when it is building
1262 * a list of files for a delete pass. */
1263 if (keep_dirlinks && linkname_len && flist) {
1264 STRUCT_STAT st2;
1265 int save_mode = file->mode;
1266 file->mode = S_IFDIR; /* Find a directory with our name. */
1267 if (flist_find(dir_flist, file) >= 0
1268 && x_stat(thisname, &st2, NULL) == 0 && S_ISDIR(st2.st_mode)) {
1269 file->modtime = st2.st_mtime;
1270 file->len32 = 0;
1271 file->mode = st2.st_mode;
1272 if (uid_ndx)
1273 F_OWNER(file) = st2.st_uid;
1274 if (gid_ndx)
1275 F_GROUP(file) = st2.st_gid;
1276 } else
1277 file->mode = save_mode;
1278 }
1279
1280 if (basename_len == 0+1) {
1281 if (!pool)
1282 unmake_file(file);
1283 return NULL;
1284 }
1285
1286 if (unsort_ndx)
1287 F_NDX(file) = dir_count;
1288
1289 return file;
1290 }
1291
1292 /* Only called for temporary file_struct entries created by make_file(). */
1293 void unmake_file(struct file_struct *file)
1294 {
1295 free(REQ_EXTRA(file, F_DEPTH(file)));
1296 }
1297
1298 static struct file_struct *send_file_name(int f, struct file_list *flist,
1299 const char *fname, STRUCT_STAT *stp,
1300 int flags, int filter_level)
1301 {
1302 struct file_struct *file;
1303
1304 file = make_file(fname, flist, stp, flags, filter_level);
1305 if (!file)
1306 return NULL;
1307
1308 if (chmod_modes && !S_ISLNK(file->mode))
1309 file->mode = tweak_mode(file->mode, chmod_modes);
1310
1311 if (f >= 0) {
1312 char fbuf[MAXPATHLEN];
1313 #if defined SUPPORT_ACLS || defined SUPPORT_XATTRS
1314 stat_x sx;
1315 #endif
1316
1317 #ifdef ICONV_OPTION
1318 if (ic_send != (iconv_t)-1) {
1319 xbuf outbuf, inbuf;
1320
1321 INIT_CONST_XBUF(outbuf, fbuf);
1322
1323 if (file->dirname) {
1324 INIT_XBUF_STRLEN(inbuf, (char*)file->dirname);
1325 outbuf.size -= 2; /* Reserve room for '/' & 1 more char. */
1326 if (iconvbufs(ic_send, &inbuf, &outbuf, 0) < 0)
1327 goto convert_error;
1328 outbuf.size += 2;
1329 outbuf.buf[outbuf.len++] = '/';
1330 }
1331
1332 INIT_XBUF_STRLEN(inbuf, (char*)file->basename);
1333 if (iconvbufs(ic_send, &inbuf, &outbuf, 0) < 0) {
1334 convert_error:
1335 io_error |= IOERR_GENERAL;
1336 rprintf(FINFO,
1337 "[%s] cannot convert filename: %s (%s)\n",
1338 who_am_i(), f_name(file, fbuf), strerror(errno));
1339 return NULL;
1340 }
1341 outbuf.buf[outbuf.len] = '\0';
1342 } else
1343 #endif
1344 f_name(file, fbuf);
1345
1346 #ifdef SUPPORT_ACLS
1347 if (preserve_acls && !S_ISLNK(file->mode)) {
1348 sx.st.st_mode = file->mode;
1349 sx.acc_acl = sx.def_acl = NULL;
1350 if (get_acl(fname, &sx) < 0) {
1351 io_error |= IOERR_GENERAL;
1352 return NULL;
1353 }
1354 }
1355 #endif
1356 #ifdef SUPPORT_XATTRS
1357 if (preserve_xattrs) {
1358 sx.xattr = NULL;
1359 if (get_xattr(fname, &sx) < 0) {
1360 io_error |= IOERR_GENERAL;
1361 return NULL;
1362 }
1363 }
1364 #endif
1365
1366 send_file_entry(f, fbuf, file, flist->used, flist->ndx_start);
1367
1368 #ifdef SUPPORT_ACLS
1369 if (preserve_acls && !S_ISLNK(file->mode)) {
1370 send_acl(&sx, f);
1371 free_acl(&sx);
1372 }
1373 #endif
1374 #ifdef SUPPORT_XATTRS
1375 if (preserve_xattrs) {
1376 F_XATTR(file) = send_xattr(&sx, f);
1377 free_xattr(&sx);
1378 }
1379 #endif
1380 }
1381
1382 maybe_emit_filelist_progress(flist->used + flist_count_offset);
1383
1384 flist_expand(flist, 1);
1385 flist->files[flist->used++] = file;
1386
1387 return file;
1388 }
1389
1390 static void send_if_directory(int f, struct file_list *flist,
1391 struct file_struct *file,
1392 char *fbuf, unsigned int ol,
1393 int flags)
1394 {
1395 char is_dot_dir = fbuf[ol-1] == '.' && (ol == 1 || fbuf[ol-2] == '/');
1396
1397 if (S_ISDIR(file->mode)
1398 && !(file->flags & FLAG_MOUNT_DIR) && f_name(file, fbuf)) {
1399 void *save_filters;
1400 unsigned int len = strlen(fbuf);
1401 if (len > 1 && fbuf[len-1] == '/')
1402 fbuf[--len] = '\0';
1403 if (len >= MAXPATHLEN - 1) {
1404 io_error |= IOERR_GENERAL;
1405 rprintf(FERROR_XFER, "skipping long-named directory: %s\n",
1406 full_fname(fbuf));
1407 return;
1408 }
1409 save_filters = push_local_filters(fbuf, len);
1410 send_directory(f, flist, fbuf, len, flags);
1411 pop_local_filters(save_filters);
1412 fbuf[ol] = '\0';
1413 if (is_dot_dir)
1414 fbuf[ol-1] = '.';
1415 }
1416 }
1417
1418 static int file_compare(const void *file1, const void *file2)
1419 {
1420 return f_name_cmp(*(struct file_struct **)file1,
1421 *(struct file_struct **)file2);
1422 }
1423
1424 /* The guts of a merge-sort algorithm. This was derived from the glibc
1425 * version, but I (Wayne) changed the merge code to do less copying and
1426 * to require only half the amount of temporary memory. */
1427 static void fsort_tmp(struct file_struct **fp, size_t num,
1428 struct file_struct **tmp)
1429 {
1430 struct file_struct **f1, **f2, **t;
1431 size_t n1, n2;
1432
1433 n1 = num / 2;
1434 n2 = num - n1;
1435 f1 = fp;
1436 f2 = fp + n1;
1437
1438 if (n1 > 1)
1439 fsort_tmp(f1, n1, tmp);
1440 if (n2 > 1)
1441 fsort_tmp(f2, n2, tmp);
1442
1443 while (f_name_cmp(*f1, *f2) <= 0) {
1444 if (!--n1)
1445 return;
1446 f1++;
1447 }
1448
1449 t = tmp;
1450 memcpy(t, f1, n1 * PTR_SIZE);
1451
1452 *f1++ = *f2++, n2--;
1453
1454 while (n1 > 0 && n2 > 0) {
1455 if (f_name_cmp(*t, *f2) <= 0)
1456 *f1++ = *t++, n1--;
1457 else
1458 *f1++ = *f2++, n2--;
1459 }
1460
1461 if (n1 > 0)
1462 memcpy(f1, t, n1 * PTR_SIZE);
1463 }
1464
1465 /* This file-struct sorting routine makes sure that any identical names in
1466 * the file list stay in the same order as they were in the original list.
1467 * This is particularly vital in inc_recurse mode where we expect a sort
1468 * on the flist to match the exact order of a sort on the dir_flist. */
1469 static void fsort(struct file_struct **fp, size_t num)
1470 {
1471 if (num <= 1)
1472 return;
1473
1474 if (use_qsort)
1475 qsort(fp, num, PTR_SIZE, file_compare);
1476 else {
1477 struct file_struct **tmp = new_array(struct file_struct *,
1478 (num+1) / 2);
1479 fsort_tmp(fp, num, tmp);
1480 free(tmp);
1481 }
1482 }
1483
1484 /* We take an entire set of sibling dirs from the sorted flist and link them
1485 * into the tree, setting the appropriate parent/child/sibling pointers. */
1486 static void add_dirs_to_tree(int parent_ndx, struct file_list *from_flist,
1487 int dir_cnt)
1488 {
1489 int i;
1490 int32 *dp = NULL;
1491 int32 *parent_dp = parent_ndx < 0 ? NULL
1492 : F_DIR_NODE_P(dir_flist->sorted[parent_ndx]);
1493
1494 flist_expand(dir_flist, dir_cnt);
1495 dir_flist->sorted = dir_flist->files;
1496
1497 for (i = 0; dir_cnt; i++) {
1498 struct file_struct *file = from_flist->sorted[i];
1499
1500 if (!S_ISDIR(file->mode))
1501 continue;
1502
1503 dir_flist->files[dir_flist->used++] = file;
1504 dir_cnt--;
1505
1506 if (file->basename[0] == '.' && file->basename[1] == '\0')
1507 continue;
1508
1509 if (dp)
1510 DIR_NEXT_SIBLING(dp) = dir_flist->used - 1;
1511 else if (parent_dp)
1512 DIR_FIRST_CHILD(parent_dp) = dir_flist->used - 1;
1513 else
1514 send_dir_ndx = dir_flist->used - 1;
1515
1516 dp = F_DIR_NODE_P(file);
1517 DIR_PARENT(dp) = parent_ndx;
1518 DIR_FIRST_CHILD(dp) = -1;
1519 }
1520 if (dp)
1521 DIR_NEXT_SIBLING(dp) = -1;
1522 }
1523
1524 /* This function is normally called by the sender, but the receiving side also
1525 * calls it from get_dirlist() with f set to -1 so that we just construct the
1526 * file list in memory without sending it over the wire. Also, get_dirlist()
1527 * might call this with f set to -2, which also indicates that local filter
1528 * rules should be ignored. */
1529 static void send_directory(int f, struct file_list *flist, char *fbuf, int len,
1530 int flags)
1531 {
1532 struct dirent *di;
1533 unsigned remainder;
1534 char *p;
1535 DIR *d;
1536 int divert_dirs = (flags & FLAG_DIVERT_DIRS) != 0;
1537 int start = flist->used;
1538 int filter_level = f == -2 ? SERVER_FILTERS : ALL_FILTERS;
1539
1540 assert(flist != NULL);
1541
1542 if (!(d = opendir(fbuf))) {
1543 io_error |= IOERR_GENERAL;
1544 rsyserr(FERROR_XFER, errno, "opendir %s failed", full_fname(fbuf));
1545 return;
1546 }
1547
1548 p = fbuf + len;
1549 if (len != 1 || *fbuf != '/')
1550 *p++ = '/';
1551 *p = '\0';
1552 remainder = MAXPATHLEN - (p - fbuf);
1553
1554 for (errno = 0, di = readdir(d); di; errno = 0, di = readdir(d)) {
1555 char *dname = d_name(di);
1556 if (dname[0] == '.' && (dname[1] == '\0'
1557 || (dname[1] == '.' && dname[2] == '\0')))
1558 continue;
1559 if (strlcpy(p, dname, remainder) >= remainder) {
1560 io_error |= IOERR_GENERAL;
1561 rprintf(FINFO,
1562 "cannot send long-named file %s\n",
1563 full_fname(fbuf));
1564 continue;
1565 }
1566 if (dname[0] == '\0') {
1567 io_error |= IOERR_GENERAL;
1568 rprintf(FINFO,
1569 "cannot send file with empty name in %s\n",
1570 full_fname(fbuf));
1571 continue;
1572 }
1573
1574 send_file_name(f, flist, fbuf, NULL, flags, filter_level);
1575 }
1576
1577 fbuf[len] = '\0';
1578
1579 if (errno) {
1580 io_error |= IOERR_GENERAL;
1581 rsyserr(FERROR_XFER, errno, "readdir(%s)", full_fname(fbuf));
1582 }
1583
1584 closedir(d);
1585
1586 if (f >= 0 && recurse && !divert_dirs) {
1587 int i, end = flist->used - 1;
1588 /* send_if_directory() bumps flist->used, so use "end". */
1589 for (i = start; i <= end; i++)
1590 send_if_directory(f, flist, flist->files[i], fbuf, len, flags);
1591 }
1592 }
1593
1594 static void send_implied_dirs(int f, struct file_list *flist, char *fname,
1595 char *start, char *limit, int flags, char name_type)
1596 {
1597 static char lastpath[MAXPATHLEN] = "";
1598 static int lastpath_len = 0;
1599 static struct file_struct *lastpath_struct = NULL;
1600 struct file_struct *file;
1601 item_list *relname_list;
1602 relnamecache **rnpp;
1603 int len, need_new_dir, depth = 0;
1604 struct filter_list_struct save_filter_list = filter_list;
1605
1606 flags = (flags | FLAG_IMPLIED_DIR) & ~(FLAG_TOP_DIR | FLAG_CONTENT_DIR);
1607 filter_list.head = filter_list.tail = NULL; /* Don't filter implied dirs. */
1608
1609 if (inc_recurse) {
1610 if (lastpath_struct && F_PATHNAME(lastpath_struct) == pathname
1611 && lastpath_len == limit - fname
1612 && strncmp(lastpath, fname, lastpath_len) == 0)
1613 need_new_dir = 0;
1614 else
1615 need_new_dir = 1;
1616 } else {
1617 char *tp = fname, *lp = lastpath;
1618 /* Skip any initial directories in our path that we
1619 * have in common with lastpath. */
1620 assert(start == fname);
1621 for ( ; ; tp++, lp++) {
1622 if (tp == limit) {
1623 if (*lp == '/' || *lp == '\0')
1624 goto done;
1625 break;
1626 }
1627 if (*lp != *tp)
1628 break;
1629 if (*tp == '/') {
1630 start = tp;
1631 depth++;
1632 }
1633 }
1634 need_new_dir = 1;
1635 }
1636
1637 if (need_new_dir) {
1638 int save_copy_links = copy_links;
1639 int save_xfer_dirs = xfer_dirs;
1640 char *slash;
1641
1642 copy_links = xfer_dirs = 1;
1643
1644 *limit = '\0';
1645
1646 for (slash = start; (slash = strchr(slash+1, '/')) != NULL; ) {
1647 *slash = '\0';
1648 file = send_file_name(f, flist, fname, NULL, flags, ALL_FILTERS);
1649 depth++;
1650 if (!inc_recurse && file && S_ISDIR(file->mode))
1651 change_local_filter_dir(fname, strlen(fname), depth);
1652 *slash = '/';
1653 }
1654
1655 file = send_file_name(f, flist, fname, NULL, flags, ALL_FILTERS);
1656 if (inc_recurse) {
1657 if (file && !S_ISDIR(file->mode))
1658 file = NULL;
1659 lastpath_struct = file;
1660 } else if (file && S_ISDIR(file->mode))
1661 change_local_filter_dir(fname, strlen(fname), ++depth);
1662
1663 strlcpy(lastpath, fname, sizeof lastpath);
1664 lastpath_len = limit - fname;
1665
1666 *limit = '/';
1667
1668 copy_links = save_copy_links;
1669 xfer_dirs = save_xfer_dirs;
1670
1671 if (!inc_recurse)
1672 goto done;
1673 }
1674
1675 if (!lastpath_struct)
1676 goto done; /* dir must have vanished */
1677
1678 len = strlen(limit+1);
1679 memcpy(&relname_list, F_DIR_RELNAMES_P(lastpath_struct), sizeof relname_list);
1680 if (!relname_list) {
1681 if (!(relname_list = new0(item_list)))
1682 out_of_memory("send_implied_dirs");
1683 memcpy(F_DIR_RELNAMES_P(lastpath_struct), &relname_list, sizeof relname_list);
1684 }
1685 rnpp = EXPAND_ITEM_LIST(relname_list, relnamecache *, 32);
1686 if (!(*rnpp = (relnamecache*)new_array(char, sizeof (relnamecache) + len)))
1687 out_of_memory("send_implied_dirs");
1688 (*rnpp)->name_type = name_type;
1689 strlcpy((*rnpp)->fname, limit+1, len + 1);
1690
1691 done:
1692 filter_list = save_filter_list;
1693 }
1694
1695 static void send1extra(int f, struct file_struct *file, struct file_list *flist)
1696 {
1697 char fbuf[MAXPATHLEN];
1698 item_list *relname_list;
1699 int len, dlen, flags = FLAG_DIVERT_DIRS | FLAG_CONTENT_DIR;
1700 size_t j;
1701
1702 f_name(file, fbuf);
1703 dlen = strlen(fbuf);
1704
1705 if (!change_pathname(file, NULL, 0))
1706 exit_cleanup(RERR_FILESELECT);
1707
1708 change_local_filter_dir(fbuf, dlen, send_dir_depth);
1709
1710 if (file->flags & FLAG_CONTENT_DIR) {
1711 if (one_file_system) {
1712 STRUCT_STAT st;
1713 if (link_stat(fbuf, &st, copy_dirlinks) != 0) {
1714 io_error |= IOERR_GENERAL;
1715 rsyserr(FERROR_XFER, errno, "link_stat %s failed",
1716 full_fname(fbuf));
1717 return;
1718 }
1719 filesystem_dev = st.st_dev;
1720 }
1721 send_directory(f, flist, fbuf, dlen, flags);
1722 }
1723
1724 if (!relative_paths)
1725 return;
1726
1727 memcpy(&relname_list, F_DIR_RELNAMES_P(file), sizeof relname_list);
1728 if (!relname_list)
1729 return;
1730
1731 for (j = 0; j < relname_list->count; j++) {
1732 char *slash;
1733 relnamecache *rnp = ((relnamecache**)relname_list->items)[j];
1734 char name_type = rnp->name_type;
1735
1736 fbuf[dlen] = '/';
1737 len = strlcpy(fbuf + dlen + 1, rnp->fname, sizeof fbuf - dlen - 1);
1738 free(rnp);
1739 if (len >= (int)sizeof fbuf)
1740 continue; /* Impossible... */
1741
1742 slash = strchr(fbuf+dlen+1, '/');
1743 if (slash) {
1744 send_implied_dirs(f, flist, fbuf, fbuf+dlen+1, slash, flags, name_type);
1745 continue;
1746 }
1747
1748 if (name_type != NORMAL_NAME) {
1749 STRUCT_STAT st;
1750 if (link_stat(fbuf, &st, 1) != 0) {
1751 io_error |= IOERR_GENERAL;
1752 rsyserr(FERROR_XFER, errno, "link_stat %s failed",
1753 full_fname(fbuf));
1754 continue;
1755 }
1756 send_file_name(f, flist, fbuf, &st, FLAG_TOP_DIR | flags, ALL_FILTERS);
1757 } else
1758 send_file_name(f, flist, fbuf, NULL, FLAG_TOP_DIR | flags, ALL_FILTERS);
1759 }
1760
1761 free(relname_list);
1762 }
1763
1764 void send_extra_file_list(int f, int at_least)
1765 {
1766 struct file_list *flist;
1767 int64 start_write;
1768 uint16 prev_flags;
1769 int old_cnt, save_io_error = io_error;
1770
1771 if (flist_eof)
1772 return;
1773
1774 /* Keep sending data until we have the requested number of
1775 * files in the upcoming file-lists. */
1776 old_cnt = cur_flist->used;
1777 for (flist = first_flist; flist != cur_flist; flist = flist->next)
1778 old_cnt += flist->used;
1779 while (file_total - old_cnt < at_least) {
1780 struct file_struct *file = dir_flist->sorted[send_dir_ndx];
1781 int dir_ndx, dstart = dir_count;
1782 const char *pathname = F_PATHNAME(file);
1783 int32 *dp;
1784
1785 flist = flist_new(0, "send_extra_file_list");
1786 start_write = stats.total_written;
1787
1788 if (unsort_ndx)
1789 dir_ndx = F_NDX(file);
1790 else
1791 dir_ndx = send_dir_ndx;
1792 write_ndx(f, NDX_FLIST_OFFSET - dir_ndx);
1793 flist->parent_ndx = dir_ndx;
1794
1795 send1extra(f, file, flist);
1796 prev_flags = file->flags;
1797 dp = F_DIR_NODE_P(file);
1798
1799 /* If there are any duplicate directory names that follow, we
1800 * send all the dirs together in one file-list. The dir_flist
1801 * tree links all the child subdirs onto the last dup dir. */
1802 while ((dir_ndx = DIR_NEXT_SIBLING(dp)) >= 0
1803 && dir_flist->sorted[dir_ndx]->flags & FLAG_DUPLICATE) {
1804 send_dir_ndx = dir_ndx;
1805 file = dir_flist->sorted[dir_ndx];
1806 /* Try to avoid some duplicate scanning of identical dirs. */
1807 if (F_PATHNAME(file) == pathname && prev_flags & FLAG_CONTENT_DIR)
1808 file->flags &= ~FLAG_CONTENT_DIR;
1809 send1extra(f, file, flist);
1810 prev_flags = file->flags;
1811 dp = F_DIR_NODE_P(file);
1812 }
1813
1814 write_byte(f, 0);
1815
1816 if (need_unsorted_flist) {
1817 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
1818 out_of_memory("send_extra_file_list");
1819 memcpy(flist->sorted, flist->files,
1820 flist->used * sizeof (struct file_struct*));
1821 } else
1822 flist->sorted = flist->files;
1823
1824 flist_sort_and_clean(flist, 0);
1825
1826 add_dirs_to_tree(send_dir_ndx, flist, dir_count - dstart);
1827 flist_done_allocating(flist);
1828
1829 file_total += flist->used;
1830 stats.flist_size += stats.total_written - start_write;
1831 stats.num_files += flist->used;
1832 if (verbose > 3)
1833 output_flist(flist);
1834
1835 if (DIR_FIRST_CHILD(dp) >= 0) {
1836 send_dir_ndx = DIR_FIRST_CHILD(dp);
1837 send_dir_depth++;
1838 } else {
1839 while (DIR_NEXT_SIBLING(dp) < 0) {
1840 if ((send_dir_ndx = DIR_PARENT(dp)) < 0) {
1841 write_ndx(f, NDX_FLIST_EOF);
1842 flist_eof = 1;
1843 change_local_filter_dir(NULL, 0, 0);
1844 goto finish;
1845 }
1846 send_dir_depth--;
1847 file = dir_flist->sorted[send_dir_ndx];
1848 dp = F_DIR_NODE_P(file);
1849 }
1850 send_dir_ndx = DIR_NEXT_SIBLING(dp);
1851 }
1852 }
1853
1854 finish:
1855 if (io_error != save_io_error && !ignore_errors)
1856 send_msg_int(MSG_IO_ERROR, io_error);
1857 }
1858
1859 struct file_list *send_file_list(int f, int argc, char *argv[])
1860 {
1861 static const char *lastdir;
1862 static int lastdir_len = -1;
1863 int len, dirlen;
1864 STRUCT_STAT st;
1865 char *p, *dir;
1866 struct file_list *flist;
1867 struct timeval start_tv, end_tv;
1868 int64 start_write;
1869 int use_ff_fd = 0;
1870 int disable_buffering;
1871 int flags = recurse ? FLAG_CONTENT_DIR : 0;
1872 int reading_remotely = filesfrom_host != NULL;
1873 int rl_flags = (reading_remotely ? 0 : RL_DUMP_COMMENTS)
1874 #ifdef ICONV_OPTION
1875 | (filesfrom_convert ? RL_CONVERT : 0)
1876 #endif
1877 | (eol_nulls || reading_remotely ? RL_EOL_NULLS : 0);
1878 int implied_dot_dir = 0;
1879
1880 rprintf(FLOG, "building file list\n");
1881 if (show_filelist_p())
1882 start_filelist_progress("building file list");
1883 else if (inc_recurse && verbose && !am_server)
1884 rprintf(FCLIENT, "sending incremental file list\n");
1885
1886 start_write = stats.total_written;
1887 gettimeofday(&start_tv, NULL);
1888
1889 if (!orig_dir)
1890 orig_dir = strdup(curr_dir);
1891
1892 if (relative_paths && protocol_version >= 30)
1893 implied_dirs = 1; /* We send flagged implied dirs */
1894
1895 #ifdef SUPPORT_HARD_LINKS
1896 if (preserve_hard_links && protocol_version >= 30 && !cur_flist)
1897 init_hard_links();
1898 #endif
1899
1900 flist = cur_flist = flist_new(0, "send_file_list");
1901 if (inc_recurse) {
1902 dir_flist = flist_new(FLIST_TEMP, "send_file_list");
1903 flags |= FLAG_DIVERT_DIRS;
1904 } else
1905 dir_flist = cur_flist;
1906
1907 disable_buffering = io_start_buffering_out(f);
1908 if (filesfrom_fd >= 0) {
1909 if (argv[0] && !change_dir(argv[0], CD_NORMAL)) {
1910 rsyserr(FERROR_XFER, errno, "change_dir %s failed",
1911 full_fname(argv[0]));
1912 exit_cleanup(RERR_FILESELECT);
1913 }
1914 use_ff_fd = 1;
1915 }
1916
1917 while (1) {
1918 char fbuf[MAXPATHLEN], *fn, name_type;
1919
1920 if (use_ff_fd) {
1921 if (read_line(filesfrom_fd, fbuf, sizeof fbuf, rl_flags) == 0)
1922 break;
1923 sanitize_path(fbuf, fbuf, "", 0, SP_KEEP_DOT_DIRS);
1924 } else {
1925 if (argc-- == 0)
1926 break;
1927 strlcpy(fbuf, *argv++, MAXPATHLEN);
1928 if (sanitize_paths)
1929 sanitize_path(fbuf, fbuf, "", 0, SP_KEEP_DOT_DIRS);
1930 }
1931
1932 len = strlen(fbuf);
1933 if (relative_paths) {
1934 /* We clean up fbuf below. */
1935 name_type = NORMAL_NAME;
1936 } else if (!len || fbuf[len - 1] == '/') {
1937 if (len == 2 && fbuf[0] == '.') {
1938 /* Turn "./" into just "." rather than "./." */
1939 fbuf[--len] = '\0';
1940 } else {
1941 if (len + 1 >= MAXPATHLEN)
1942 overflow_exit("send_file_list");
1943 fbuf[len++] = '.';
1944 fbuf[len] = '\0';
1945 }
1946 name_type = DOTDIR_NAME;
1947 } else if (len > 1 && fbuf[len-1] == '.' && fbuf[len-2] == '.'
1948 && (len == 2 || fbuf[len-3] == '/')) {
1949 if (len + 2 >= MAXPATHLEN)
1950 overflow_exit("send_file_list");
1951 fbuf[len++] = '/';
1952 fbuf[len++] = '.';
1953 fbuf[len] = '\0';
1954 name_type = DOTDIR_NAME;
1955 } else if (fbuf[len-1] == '.' && (len == 1 || fbuf[len-2] == '/'))
1956 name_type = DOTDIR_NAME;
1957 else
1958 name_type = NORMAL_NAME;
1959
1960 dir = NULL;
1961
1962 if (!relative_paths) {
1963 p = strrchr(fbuf, '/');
1964 if (p) {
1965 *p = '\0';
1966 if (p == fbuf)
1967 dir = "/";
1968 else
1969 dir = fbuf;
1970 len -= p - fbuf + 1;
1971 fn = p + 1;
1972 } else
1973 fn = fbuf;
1974 } else {
1975 if ((p = strstr(fbuf, "/./")) != NULL) {
1976 *p = '\0';
1977 if (p == fbuf)
1978 dir = "/";
1979 else {
1980 dir = fbuf;
1981 clean_fname(dir, 0);
1982 }
1983 fn = p + 3;
1984 while (*fn == '/')
1985 fn++;
1986 if (!*fn)
1987 *--fn = '\0'; /* ensure room for '.' */
1988 } else
1989 fn = fbuf;
1990 /* A leading ./ can be used in relative mode to affect
1991 * the dest dir without its name being in the path. */
1992 if (*fn == '.' && fn[1] == '/' && !implied_dot_dir) {
1993 send_file_name(f, flist, ".", NULL,
1994 (flags | FLAG_IMPLIED_DIR) & ~FLAG_CONTENT_DIR,
1995 ALL_FILTERS);
1996 implied_dot_dir = 1;
1997 }
1998 len = clean_fname(fn, CFN_KEEP_TRAILING_SLASH
1999 | CFN_DROP_TRAILING_DOT_DIR);
2000 if (len == 1) {
2001 if (fn[0] == '/') {
2002 fn = "/.";
2003 len = 2;
2004 name_type = DOTDIR_NAME;
2005 } else if (fn[0] == '.')
2006 name_type = DOTDIR_NAME;
2007 } else if (fn[len-1] == '/') {
2008 fn[--len] = '\0';
2009 if (len == 1 && *fn == '.')
2010 name_type = DOTDIR_NAME;
2011 else
2012 name_type = SLASH_ENDING_NAME;
2013 }
2014 /* Reject a ".." dir in the active part of the path. */
2015 for (p = fn; (p = strstr(p, "..")) != NULL; p += 2) {
2016 if ((p[2] == '/' || p[2] == '\0')
2017 && (p == fn || p[-1] == '/')) {
2018 rprintf(FERROR,
2019 "found \"..\" dir in relative path: %s\n",
2020 fn);
2021 exit_cleanup(RERR_SYNTAX);
2022 }
2023 }
2024 }
2025
2026 if (!*fn) {
2027 len = 1;
2028 fn = ".";
2029 name_type = DOTDIR_NAME;
2030 }
2031
2032 dirlen = dir ? strlen(dir) : 0;
2033 if (dirlen != lastdir_len || memcmp(lastdir, dir, dirlen) != 0) {
2034 if (!change_pathname(NULL, dir, -dirlen))
2035 continue;
2036 lastdir = pathname;
2037 lastdir_len = pathname_len;
2038 } else if (!change_pathname(NULL, lastdir, lastdir_len))
2039 continue;
2040
2041 if (fn != fbuf)
2042 memmove(fbuf, fn, len + 1);
2043
2044 if (link_stat(fbuf, &st, copy_dirlinks || name_type != NORMAL_NAME) != 0
2045 || (name_type != DOTDIR_NAME && is_daemon_excluded(fbuf, S_ISDIR(st.st_mode)))
2046 || (relative_paths && path_is_daemon_excluded(fbuf, 1))) {
2047 io_error |= IOERR_GENERAL;
2048 rsyserr(FERROR_XFER, errno, "link_stat %s failed",
2049 full_fname(fbuf));
2050 continue;
2051 }
2052
2053 /* A dot-dir should not be excluded! */
2054 if (name_type != DOTDIR_NAME
2055 && is_excluded(fbuf, S_ISDIR(st.st_mode) != 0, ALL_FILTERS))
2056 continue;
2057
2058 if (S_ISDIR(st.st_mode) && !xfer_dirs) {
2059 rprintf(FINFO, "skipping directory %s\n", fbuf);
2060 continue;
2061 }
2062
2063 if (inc_recurse && relative_paths && *fbuf) {
2064 if ((p = strchr(fbuf+1, '/')) != NULL) {
2065 if (p - fbuf == 1 && *fbuf == '.') {
2066 if ((fn = strchr(p+1, '/')) != NULL)
2067 p = fn;
2068 } else
2069 fn = p;
2070 send_implied_dirs(f, flist, fbuf, fbuf, p, flags, name_type);
2071 if (fn == p)
2072 continue;
2073 }
2074 } else if (implied_dirs && (p=strrchr(fbuf,'/')) && p != fbuf) {
2075 /* Send the implied directories at the start of the
2076 * source spec, so we get their permissions right. */
2077 send_implied_dirs(f, flist, fbuf, fbuf, p, flags, 0);
2078 }
2079
2080 if (one_file_system)
2081 filesystem_dev = st.st_dev;
2082
2083 if (recurse || (xfer_dirs && name_type != NORMAL_NAME)) {
2084 struct file_struct *file;
2085 file = send_file_name(f, flist, fbuf, &st,
2086 FLAG_TOP_DIR | FLAG_CONTENT_DIR | flags,
2087 NO_FILTERS);
2088 if (!file)
2089 continue;
2090 if (inc_recurse) {
2091 if (name_type == DOTDIR_NAME) {
2092 if (send_dir_depth < 0) {
2093 send_dir_depth = 0;
2094 change_local_filter_dir(fbuf, len, send_dir_depth);
2095 }
2096 send_directory(f, flist, fbuf, len, flags);
2097 }
2098 } else
2099 send_if_directory(f, flist, file, fbuf, len, flags);
2100 } else
2101 send_file_name(f, flist, fbuf, &st, flags, NO_FILTERS);
2102 }
2103
2104 gettimeofday(&end_tv, NULL);
2105 stats.flist_buildtime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
2106 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
2107 if (stats.flist_buildtime == 0)
2108 stats.flist_buildtime = 1;
2109 start_tv = end_tv;
2110
2111 write_byte(f, 0); /* Indicate end of file list */
2112
2113 #ifdef SUPPORT_HARD_LINKS
2114 if (preserve_hard_links && protocol_version >= 30 && !inc_recurse)
2115 idev_destroy();
2116 #endif
2117
2118 if (show_filelist_p())
2119 finish_filelist_progress(flist);
2120
2121 gettimeofday(&end_tv, NULL);
2122 stats.flist_xfertime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
2123 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
2124
2125 /* When converting names, both sides keep an unsorted file-list array
2126 * because the names will differ on the sending and receiving sides
2127 * (both sides will use the unsorted index number for each item). */
2128
2129 /* Sort the list without removing any duplicates. This allows the
2130 * receiving side to ask for whatever name it kept. For incremental
2131 * recursion mode, the sender marks duplicate dirs so that it can
2132 * send them together in a single file-list. */
2133 if (need_unsorted_flist) {
2134 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
2135 out_of_memory("send_file_list");
2136 memcpy(flist->sorted, flist->files,
2137 flist->used * sizeof (struct file_struct*));
2138 } else
2139 flist->sorted = flist->files;
2140 flist_sort_and_clean(flist, 0);
2141 file_total += flist->used;
2142
2143 if (numeric_ids <= 0 && !inc_recurse)
2144 send_id_list(f);
2145
2146 /* send the io_error flag */
2147 if (protocol_version < 30)
2148 write_int(f, ignore_errors ? 0 : io_error);
2149 else if (io_error && !ignore_errors)
2150 send_msg_int(MSG_IO_ERROR, io_error);
2151
2152 if (disable_buffering)
2153 io_end_buffering_out();
2154
2155 stats.flist_size = stats.total_written - start_write;
2156 stats.num_files = flist->used;
2157
2158 if (verbose > 3)
2159 output_flist(flist);
2160
2161 if (verbose > 2)
2162 rprintf(FINFO, "send_file_list done\n");
2163
2164 if (inc_recurse) {
2165 send_dir_depth = 1;
2166 add_dirs_to_tree(-1, flist, dir_count);
2167 if (!file_total || strcmp(flist->sorted[0]->basename, ".") != 0)
2168 flist->parent_ndx = -1;
2169 flist_done_allocating(flist);
2170 if (send_dir_ndx < 0) {
2171 write_ndx(f, NDX_FLIST_EOF);
2172 flist_eof = 1;
2173 }
2174 else if (file_total == 1) {
2175 /* If we're creating incremental file-lists and there
2176 * was just 1 item in the first file-list, send 1 more
2177 * file-list to check if this is a 1-file xfer. */
2178 send_extra_file_list(f, 1);
2179 }
2180 }
2181
2182 return flist;
2183 }
2184
2185 struct file_list *recv_file_list(int f)
2186 {
2187 struct file_list *flist;
2188 int dstart, flags;
2189 int64 start_read;
2190
2191 if (!first_flist)
2192 rprintf(FLOG, "receiving file list\n");
2193 if (show_filelist_p())
2194 start_filelist_progress("receiving file list");
2195 else if (inc_recurse && verbose && !am_server && !first_flist)
2196 rprintf(FCLIENT, "receiving incremental file list\n");
2197
2198 start_read = stats.total_read;
2199
2200 #ifdef SUPPORT_HARD_LINKS
2201 if (preserve_hard_links && !first_flist)
2202 init_hard_links();
2203 #endif
2204
2205 flist = flist_new(0, "recv_file_list");
2206
2207 if (inc_recurse) {
2208 if (flist->ndx_start == 1)
2209 dir_flist = flist_new(FLIST_TEMP, "recv_file_list");
2210 dstart = dir_flist->used;
2211 } else {
2212 dir_flist = flist;
2213 dstart = 0;
2214 }
2215
2216 while ((flags = read_byte(f)) != 0) {
2217 struct file_struct *file;
2218
2219 flist_expand(flist, 1);
2220
2221 if (protocol_version >= 28 && (flags & XMIT_EXTENDED_FLAGS))
2222 flags |= read_byte(f) << 8;
2223 file = recv_file_entry(flist, flags, f);
2224
2225 if (inc_recurse && S_ISDIR(file->mode)) {
2226 flist_expand(dir_flist, 1);
2227 dir_flist->files[dir_flist->used++] = file;
2228 }
2229
2230 flist->files[flist->used++] = file;
2231
2232 maybe_emit_filelist_progress(flist->used);
2233
2234 if (verbose > 2) {
2235 rprintf(FINFO, "recv_file_name(%s)\n",
2236 f_name(file, NULL));
2237 }
2238 }
2239 file_total += flist->used;
2240
2241 if (verbose > 2)
2242 rprintf(FINFO, "received %d names\n", flist->used);
2243
2244 if (show_filelist_p())
2245 finish_filelist_progress(flist);
2246
2247 if (need_unsorted_flist) {
2248 /* Create an extra array of index pointers that we can sort for
2249 * the generator's use (for wading through the files in sorted
2250 * order and for calling flist_find()). We keep the "files"
2251 * list unsorted for our exchange of index numbers with the
2252 * other side (since their names may not sort the same). */
2253 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
2254 out_of_memory("recv_file_list");
2255 memcpy(flist->sorted, flist->files,
2256 flist->used * sizeof (struct file_struct*));
2257 if (inc_recurse && dir_flist->used > dstart) {
2258 static int dir_flist_malloced = 0;
2259 if (dir_flist_malloced < dir_flist->malloced) {
2260 dir_flist->sorted = realloc_array(dir_flist->sorted,
2261 struct file_struct *,
2262 dir_flist->malloced);
2263 dir_flist_malloced = dir_flist->malloced;
2264 }
2265 memcpy(dir_flist->sorted + dstart, dir_flist->files + dstart,
2266 (dir_flist->used - dstart) * sizeof (struct file_struct*));
2267 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2268 }
2269 } else {
2270 flist->sorted = flist->files;
2271 if (inc_recurse && dir_flist->used > dstart) {
2272 dir_flist->sorted = dir_flist->files;
2273 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2274 }
2275 }
2276
2277 if (inc_recurse)
2278 flist_done_allocating(flist);
2279 else if (f >= 0)
2280 recv_id_list(f, flist);
2281
2282 flist_sort_and_clean(flist, relative_paths);
2283
2284 if (protocol_version < 30) {
2285 /* Recv the io_error flag */
2286 if (ignore_errors)
2287 read_int(f);
2288 else
2289 io_error |= read_int(f);
2290 } else if (inc_recurse && flist->ndx_start == 1) {
2291 if (!file_total || strcmp(flist->sorted[0]->basename, ".") != 0)
2292 flist->parent_ndx = -1;
2293 }
2294
2295 if (verbose > 3)
2296 output_flist(flist);
2297
2298 if (verbose > 2)
2299 rprintf(FINFO, "recv_file_list done\n");
2300
2301 stats.flist_size += stats.total_read - start_read;
2302 stats.num_files += flist->used;
2303
2304 return flist;
2305 }
2306
2307 /* This is only used once by the receiver if the very first file-list
2308 * has exactly one item in it. */
2309 void recv_additional_file_list(int f)
2310 {
2311 struct file_list *flist;
2312 int ndx = read_ndx(f);
2313 if (ndx == NDX_FLIST_EOF) {
2314 flist_eof = 1;
2315 change_local_filter_dir(NULL, 0, 0);
2316 } else {
2317 ndx = NDX_FLIST_OFFSET - ndx;
2318 if (ndx < 0 || ndx >= dir_flist->used) {
2319 ndx = NDX_FLIST_OFFSET - ndx;
2320 rprintf(FERROR,
2321 "[%s] Invalid dir index: %d (%d - %d)\n",
2322 who_am_i(), ndx, NDX_FLIST_OFFSET,
2323 NDX_FLIST_OFFSET - dir_flist->used + 1);
2324 exit_cleanup(RERR_PROTOCOL);
2325 }
2326 if (verbose > 3) {
2327 rprintf(FINFO, "[%s] receiving flist for dir %d\n",
2328 who_am_i(), ndx);
2329 }
2330 flist = recv_file_list(f);
2331 flist->parent_ndx = ndx;
2332 }
2333 }
2334
2335 /* Search for an identically-named item in the file list. Note that the
2336 * items must agree in their directory-ness, or no match is returned. */
2337 int flist_find(struct file_list *flist, struct file_struct *f)
2338 {
2339 int low = flist->low, high = flist->high;
2340 int diff, mid, mid_up;
2341
2342 while (low <= high) {
2343 mid = (low + high) / 2;
2344 if (F_IS_ACTIVE(flist->sorted[mid]))
2345 mid_up = mid;
2346 else {
2347 /* Scan for the next non-empty entry using the cached
2348 * distance values. If the value isn't fully up-to-
2349 * date, update it. */
2350 mid_up = mid + F_DEPTH(flist->sorted[mid]);
2351 if (!F_IS_ACTIVE(flist->sorted[mid_up])) {
2352 do {
2353 mid_up += F_DEPTH(flist->sorted[mid_up]);
2354 } while (!F_IS_ACTIVE(flist->sorted[mid_up]));
2355 F_DEPTH(flist->sorted[mid]) = mid_up - mid;
2356 }
2357 if (mid_up > high) {
2358 /* If there's nothing left above us, set high to
2359 * a non-empty entry below us and continue. */
2360 high = mid - (int)flist->sorted[mid]->len32;
2361 if (!F_IS_ACTIVE(flist->sorted[high])) {
2362 do {
2363 high -= (int)flist->sorted[high]->len32;
2364 } while (!F_IS_ACTIVE(flist->sorted[high]));
2365 flist->sorted[mid]->len32 = mid - high;
2366 }
2367 continue;
2368 }
2369 }
2370 diff = f_name_cmp(flist->sorted[mid_up], f);
2371 if (diff == 0) {
2372 if (protocol_version < 29
2373 && S_ISDIR(flist->sorted[mid_up]->mode)
2374 != S_ISDIR(f->mode))
2375 return -1;
2376 return mid_up;
2377 }
2378 if (diff < 0)
2379 low = mid_up + 1;
2380 else
2381 high = mid - 1;
2382 }
2383 return -1;
2384 }
2385
2386 /*
2387 * Free up any resources a file_struct has allocated
2388 * and clear the file.
2389 */
2390 void clear_file(struct file_struct *file)
2391 {
2392 /* The +1 zeros out the first char of the basename. */
2393 memset(file, 0, FILE_STRUCT_LEN + 1);
2394 /* In an empty entry, F_DEPTH() is an offset to the next non-empty
2395 * entry. Likewise for len32 in the opposite direction. We assume
2396 * that we're alone for now since flist_find() will adjust the counts
2397 * it runs into that aren't up-to-date. */
2398 file->len32 = F_DEPTH(file) = 1;
2399 }
2400
2401 /* Allocate a new file list. */
2402 struct file_list *flist_new(int flags, char *msg)
2403 {
2404 struct file_list *flist;
2405
2406 if (!(flist = new0(struct file_list)))
2407 out_of_memory(msg);
2408
2409 if (flags & FLIST_TEMP) {
2410 if (!(flist->file_pool = pool_create(SMALL_EXTENT, 0,
2411 out_of_memory, POOL_INTERN)))
2412 out_of_memory(msg);
2413 } else {
2414 /* This is a doubly linked list with prev looping back to
2415 * the end of the list, but the last next pointer is NULL. */
2416 if (!first_flist) {
2417 flist->file_pool = pool_create(NORMAL_EXTENT, 0,
2418 out_of_memory, POOL_INTERN);
2419 if (!flist->file_pool)
2420 out_of_memory(msg);
2421
2422 flist->ndx_start = flist->flist_num = inc_recurse ? 1 : 0;
2423
2424 first_flist = cur_flist = flist->prev = flist;
2425 } else {
2426 struct file_list *prev = first_flist->prev;
2427
2428 flist->file_pool = first_flist->file_pool;
2429
2430 flist->ndx_start = prev->ndx_start + prev->used + 1;
2431 flist->flist_num = prev->flist_num + 1;
2432
2433 flist->prev = prev;
2434 prev->next = first_flist->prev = flist;
2435 }
2436 flist->pool_boundary = pool_boundary(flist->file_pool, 0);
2437 flist_cnt++;
2438 }
2439
2440 return flist;
2441 }
2442
2443 /* Free up all elements in a flist. */
2444 void flist_free(struct file_list *flist)
2445 {
2446 if (!flist->prev) {
2447 /* Was FLIST_TEMP dir-list. */
2448 } else if (flist == flist->prev) {
2449 first_flist = cur_flist = NULL;
2450 file_total = 0;
2451 flist_cnt = 0;
2452 } else {
2453 if (flist == cur_flist)
2454 cur_flist = flist->next;
2455 if (flist == first_flist)
2456 first_flist = first_flist->next;
2457 else {
2458 flist->prev->next = flist->next;
2459 if (!flist->next)
2460 flist->next = first_flist;
2461 }
2462 flist->next->prev = flist->prev;
2463 file_total -= flist->used;
2464 flist_cnt--;
2465 }
2466
2467 if (!flist->prev || !flist_cnt)
2468 pool_destroy(flist->file_pool);
2469 else
2470 pool_free_old(flist->file_pool, flist->pool_boundary);
2471
2472 if (flist->sorted && flist->sorted != flist->files)
2473 free(flist->sorted);
2474 free(flist->files);
2475 free(flist);
2476 }
2477
2478 /* This routine ensures we don't have any duplicate names in our file list.
2479 * duplicate names can cause corruption because of the pipelining. */
2480 static void flist_sort_and_clean(struct file_list *flist, int strip_root)
2481 {
2482 char fbuf[MAXPATHLEN];
2483 int i, prev_i;
2484
2485 if (!flist)
2486 return;
2487 if (flist->used == 0) {
2488 flist->high = -1;
2489 flist->low = 0;
2490 return;
2491 }
2492
2493 fsort(flist->sorted, flist->used);
2494
2495 if (!am_sender || inc_recurse) {
2496 for (i = prev_i = 0; i < flist->used; i++) {
2497 if (F_IS_ACTIVE(flist->sorted[i])) {
2498 prev_i = i;
2499 break;
2500 }
2501 }
2502 flist->low = prev_i;
2503 } else {
2504 i = prev_i = flist->used - 1;
2505 flist->low = 0;
2506 }
2507
2508 while (++i < flist->used) {
2509 int j;
2510 struct file_struct *file = flist->sorted[i];
2511
2512 if (!F_IS_ACTIVE(file))
2513 continue;
2514 if (f_name_cmp(file, flist->sorted[prev_i]) == 0)
2515 j = prev_i;
2516 else if (protocol_version >= 29 && S_ISDIR(file->mode)) {
2517 int save_mode = file->mode;
2518 /* Make sure that this directory doesn't duplicate a
2519 * non-directory earlier in the list. */
2520 flist->high = prev_i;
2521 file->mode = S_IFREG;
2522 j = flist_find(flist, file);
2523 file->mode = save_mode;
2524 } else
2525 j = -1;
2526 if (j >= 0) {
2527 int keep, drop;
2528 /* If one is a dir and the other is not, we want to
2529 * keep the dir because it might have contents in the
2530 * list. Otherwise keep the first one. */
2531 if (S_ISDIR(file->mode)) {
2532 struct file_struct *fp = flist->sorted[j];
2533 if (!S_ISDIR(fp->mode))
2534 keep = i, drop = j;
2535 else {
2536 if (am_sender)
2537 file->flags |= FLAG_DUPLICATE;
2538 else { /* Make sure we merge our vital flags. */
2539 fp->flags |= file->flags & (FLAG_TOP_DIR|FLAG_CONTENT_DIR);
2540 fp->flags &= file->flags | ~FLAG_IMPLIED_DIR;
2541 }
2542 keep = j, drop = i;
2543 }
2544 } else
2545 keep = j, drop = i;
2546
2547 if (!am_sender) {
2548 if (verbose > 1) {
2549 rprintf(FINFO,
2550 "removing duplicate name %s from file list (%d)\n",
2551 f_name(file, fbuf), drop + flist->ndx_start);
2552 }
2553 clear_file(flist->sorted[drop]);
2554 }
2555
2556 if (keep == i) {
2557 if (flist->low == drop) {
2558 for (j = drop + 1;
2559 j < i && !F_IS_ACTIVE(flist->sorted[j]);
2560 j++) {}
2561 flist->low = j;
2562 }
2563 prev_i = i;
2564 }
2565 } else
2566 prev_i = i;
2567 }
2568 flist->high = prev_i;
2569
2570 if (strip_root) {
2571 /* We need to strip off the leading slashes for relative
2572 * paths, but this must be done _after_ the sorting phase. */
2573 for (i = flist->low; i <= flist->high; i++) {
2574 struct file_struct *file = flist->sorted[i];
2575
2576 if (!file->dirname)
2577 continue;
2578 while (*file->dirname == '/')
2579 file->dirname++;
2580 if (!*file->dirname)
2581 file->dirname = NULL;
2582 }
2583 }
2584
2585 if (prune_empty_dirs && !am_sender) {
2586 int j, prev_depth = 0;
2587
2588 prev_i = 0; /* It's OK that this isn't really true. */
2589
2590 for (i = flist->low; i <= flist->high; i++) {
2591 struct file_struct *fp, *file = flist->sorted[i];
2592
2593 /* This temporarily abuses the F_DEPTH() value for a
2594 * directory that is in a chain that might get pruned.
2595 * We restore the old value if it gets a reprieve. */
2596 if (S_ISDIR(file->mode) && F_DEPTH(file)) {
2597 /* Dump empty dirs when coming back down. */
2598 for (j = prev_depth; j >= F_DEPTH(file); j--) {
2599 fp = flist->sorted[prev_i];
2600 if (F_DEPTH(fp) >= 0)
2601 break;
2602 prev_i = -F_DEPTH(fp)-1;
2603 clear_file(fp);
2604 }
2605 prev_depth = F_DEPTH(file);
2606 if (is_excluded(f_name(file, fbuf), 1,
2607 ALL_FILTERS)) {
2608 /* Keep dirs through this dir. */
2609 for (j = prev_depth-1; ; j--) {
2610 fp = flist->sorted[prev_i];
2611 if (F_DEPTH(fp) >= 0)
2612 break;
2613 prev_i = -F_DEPTH(fp)-1;
2614 F_DEPTH(fp) = j;
2615 }
2616 } else
2617 F_DEPTH(file) = -prev_i-1;
2618 prev_i = i;
2619 } else {
2620 /* Keep dirs through this non-dir. */
2621 for (j = prev_depth; ; j--) {
2622 fp = flist->sorted[prev_i];
2623 if (F_DEPTH(fp) >= 0)
2624 break;
2625 prev_i = -F_DEPTH(fp)-1;
2626 F_DEPTH(fp) = j;
2627 }
2628 }
2629 }
2630 /* Dump all remaining empty dirs. */
2631 while (1) {
2632 struct file_struct *fp = flist->sorted[prev_i];
2633 if (F_DEPTH(fp) >= 0)
2634 break;
2635 prev_i = -F_DEPTH(fp)-1;
2636 clear_file(fp);
2637 }
2638
2639 for (i = flist->low; i <= flist->high; i++) {
2640 if (F_IS_ACTIVE(flist->sorted[i]))
2641 break;
2642 }
2643 flist->low = i;
2644 for (i = flist->high; i >= flist->low; i--) {
2645 if (F_IS_ACTIVE(flist->sorted[i]))
2646 break;
2647 }
2648 flist->high = i;
2649 }
2650 }
2651
2652 static void output_flist(struct file_list *flist)
2653 {
2654 char uidbuf[16], gidbuf[16], depthbuf[16];
2655 struct file_struct *file;
2656 const char *root, *dir, *slash, *name, *trail;
2657 const char *who = who_am_i();
2658 int i;
2659
2660 rprintf(FINFO, "[%s] flist start=%d, used=%d, low=%d, high=%d\n",
2661 who, flist->ndx_start, flist->used, flist->low, flist->high);
2662 for (i = 0; i < flist->used; i++) {
2663 file = flist->files[i];
2664 if ((am_root || am_sender) && uid_ndx) {
2665 snprintf(uidbuf, sizeof uidbuf, " uid=%u",
2666 F_OWNER(file));
2667 } else
2668 *uidbuf = '\0';
2669 if (gid_ndx) {
2670 static char parens[] = "(\0)\0\0\0";
2671 char *pp = parens + (file->flags & FLAG_SKIP_GROUP ? 0 : 3);
2672 snprintf(gidbuf, sizeof gidbuf, " gid=%s%u%s",
2673 pp, F_GROUP(file), pp + 2);
2674 } else
2675 *gidbuf = '\0';
2676 if (!am_sender)
2677 snprintf(depthbuf, sizeof depthbuf, "%d", F_DEPTH(file));
2678 if (F_IS_ACTIVE(file)) {
2679 root = am_sender ? NS(F_PATHNAME(file)) : depthbuf;
2680 if ((dir = file->dirname) == NULL)
2681 dir = slash = "";
2682 else
2683 slash = "/";
2684 name = file->basename;
2685 trail = S_ISDIR(file->mode) ? "/" : "";
2686 } else
2687 root = dir = slash = name = trail = "";
2688 rprintf(FINFO,
2689 "[%s] i=%d %s %s%s%s%s mode=0%o len=%.0f%s%s flags=%x\n",
2690 who, i + flist->ndx_start,
2691 root, dir, slash, name, trail,
2692 (int)file->mode, (double)F_LENGTH(file),
2693 uidbuf, gidbuf, file->flags);
2694 }
2695 }
2696
2697 enum fnc_state { s_DIR, s_SLASH, s_BASE, s_TRAILING };
2698 enum fnc_type { t_PATH, t_ITEM };
2699
2700 static int found_prefix;
2701
2702 /* Compare the names of two file_struct entities, similar to how strcmp()
2703 * would do if it were operating on the joined strings.
2704 *
2705 * Some differences beginning with protocol_version 29: (1) directory names
2706 * are compared with an assumed trailing slash so that they compare in a
2707 * way that would cause them to sort immediately prior to any content they
2708 * may have; (2) a directory of any name compares after a non-directory of
2709 * any name at the same depth; (3) a directory with name "." compares prior
2710 * to anything else. These changes mean that a directory and a non-dir
2711 * with the same name will not compare as equal (protocol_version >= 29).
2712 *
2713 * The dirname component can be an empty string, but the basename component
2714 * cannot (and never is in the current codebase). The basename component
2715 * may be NULL (for a removed item), in which case it is considered to be
2716 * after any existing item. */
2717 int f_name_cmp(const struct file_struct *f1, const struct file_struct *f2)
2718 {
2719 int dif;
2720 const uchar *c1, *c2;
2721 enum fnc_state state1, state2;
2722 enum fnc_type type1, type2;
2723 enum fnc_type t_path = protocol_version >= 29 ? t_PATH : t_ITEM;
2724
2725 if (!f1 || !F_IS_ACTIVE(f1)) {
2726 if (!f2 || !F_IS_ACTIVE(f2))
2727 return 0;
2728 return -1;
2729 }
2730 if (!f2 || !F_IS_ACTIVE(f2))
2731 return 1;
2732
2733 c1 = (uchar*)f1->dirname;
2734 c2 = (uchar*)f2->dirname;
2735 if (c1 == c2)
2736 c1 = c2 = NULL;
2737 if (!c1) {
2738 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2739 c1 = (const uchar*)f1->basename;
2740 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2741 type1 = t_ITEM;
2742 state1 = s_TRAILING;
2743 c1 = (uchar*)"";
2744 } else
2745 state1 = s_BASE;
2746 } else {
2747 type1 = t_path;
2748 state1 = s_DIR;
2749 }
2750 if (!c2) {
2751 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2752 c2 = (const uchar*)f2->basename;
2753 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2754 type2 = t_ITEM;
2755 state2 = s_TRAILING;
2756 c2 = (uchar*)"";
2757 } else
2758 state2 = s_BASE;
2759 } else {
2760 type2 = t_path;
2761 state2 = s_DIR;
2762 }
2763
2764 if (type1 != type2)
2765 return type1 == t_PATH ? 1 : -1;
2766
2767 do {
2768 if (!*c1) {
2769 switch (state1) {
2770 case s_DIR:
2771 state1 = s_SLASH;
2772 c1 = (uchar*)"/";
2773 break;
2774 case s_SLASH:
2775 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2776 c1 = (const uchar*)f1->basename;
2777 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2778 type1 = t_ITEM;
2779 state1 = s_TRAILING;
2780 c1 = (uchar*)"";
2781 } else
2782 state1 = s_BASE;
2783 break;
2784 case s_BASE:
2785 state1 = s_TRAILING;
2786 if (type1 == t_PATH) {
2787 c1 = (uchar*)"/";
2788 break;
2789 }
2790 /* FALL THROUGH */
2791 case s_TRAILING:
2792 type1 = t_ITEM;
2793 break;
2794 }
2795 if (*c2 && type1 != type2)
2796 return type1 == t_PATH ? 1 : -1;
2797 }
2798 if (!*c2) {
2799 switch (state2) {
2800 case s_DIR:
2801 state2 = s_SLASH;
2802 c2 = (uchar*)"/";
2803 break;
2804 case s_SLASH:
2805 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2806 c2 = (const uchar*)f2->basename;
2807 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2808 type2 = t_ITEM;
2809 state2 = s_TRAILING;
2810 c2 = (uchar*)"";
2811 } else
2812 state2 = s_BASE;
2813 break;
2814 case s_BASE:
2815 state2 = s_TRAILING;
2816 if (type2 == t_PATH) {
2817 c2 = (uchar*)"/";
2818 break;
2819 }
2820 /* FALL THROUGH */
2821 case s_TRAILING:
2822 found_prefix = 1;
2823 if (!*c1)
2824 return 0;
2825 type2 = t_ITEM;
2826 break;
2827 }
2828 if (type1 != type2)
2829 return type1 == t_PATH ? 1 : -1;
2830 }
2831 } while ((dif = (int)*c1++ - (int)*c2++) == 0);
2832
2833 return dif;
2834 }
2835
2836 /* Returns 1 if f1's filename has all of f2's filename as a prefix. This does
2837 * not match if f2's basename is not an exact match of a path element in f1.
2838 * E.g. /path/foo is not a prefix of /path/foobar/baz, but /path/foobar is. */
2839 int f_name_has_prefix(const struct file_struct *f1, const struct file_struct *f2)
2840 {
2841 found_prefix = 0;
2842 f_name_cmp(f1, f2);
2843 return found_prefix;
2844 }
2845
2846 char *f_name_buf(void)
2847 {
2848 static char names[5][MAXPATHLEN];
2849 static unsigned int n;
2850
2851 n = (n + 1) % (sizeof names / sizeof names[0]);
2852
2853 return names[n];
2854 }
2855
2856 /* Return a copy of the full filename of a flist entry, using the indicated
2857 * buffer or one of 5 static buffers if fbuf is NULL. No size-checking is
2858 * done because we checked the size when creating the file_struct entry.
2859 */
2860 char *f_name(const struct file_struct *f, char *fbuf)
2861 {
2862 if (!f || !F_IS_ACTIVE(f))
2863 return NULL;
2864
2865 if (!fbuf)
2866 fbuf = f_name_buf();
2867
2868 if (f->dirname) {
2869 int len = strlen(f->dirname);
2870 memcpy(fbuf, f->dirname, len);
2871 fbuf[len] = '/';
2872 strlcpy(fbuf + len + 1, f->basename, MAXPATHLEN - (len + 1));
2873 } else
2874 strlcpy(fbuf, f->basename, MAXPATHLEN);
2875
2876 return fbuf;
2877 }
2878
2879 /* Do a non-recursive scan of the named directory, possibly ignoring all
2880 * exclude rules except for the daemon's. If "dlen" is >=0, it is the length
2881 * of the dirname string, and also indicates that "dirname" is a MAXPATHLEN
2882 * buffer (the functions we call will append names onto the end, but the old
2883 * dir value will be restored on exit). */
2884 struct file_list *get_dirlist(char *dirname, int dlen, int ignore_filter_rules)
2885 {
2886 struct file_list *dirlist;
2887 char dirbuf[MAXPATHLEN];
2888 int save_recurse = recurse;
2889 int save_xfer_dirs = xfer_dirs;
2890 int save_prune_empty_dirs = prune_empty_dirs;
2891
2892 if (dlen < 0) {
2893 dlen = strlcpy(dirbuf, dirname, MAXPATHLEN);
2894 if (dlen >= MAXPATHLEN)
2895 return NULL;
2896 dirname = dirbuf;
2897 }
2898
2899 dirlist = flist_new(FLIST_TEMP, "get_dirlist");
2900
2901 recurse = 0;
2902 xfer_dirs = 1;
2903 send_directory(ignore_filter_rules ? -2 : -1, dirlist, dirname, dlen, 0);
2904 xfer_dirs = save_xfer_dirs;
2905 recurse = save_recurse;
2906 if (do_progress)
2907 flist_count_offset += dirlist->used;
2908
2909 prune_empty_dirs = 0;
2910 dirlist->sorted = dirlist->files;
2911 flist_sort_and_clean(dirlist, 0);
2912 prune_empty_dirs = save_prune_empty_dirs;
2913
2914 if (verbose > 3)
2915 output_flist(dirlist);
2916
2917 return dirlist;
2918 }
rsync: a fast, versatile, remote (and local) file-copying tool