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