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