Commit | Line | Data |
---|---|---|
dbda5fbf | 1 | /* |
c627d613 AT |
2 | Copyright (C) Andrew Tridgell 1996 |
3 | Copyright (C) Paul Mackerras 1996 | |
736a6a29 | 4 | Copyright (C) 2001, 2002 by Martin Pool <mbp@samba.org> |
dbda5fbf | 5 | |
c627d613 AT |
6 | This program is free software; you can redistribute it and/or modify |
7 | it under the terms of the GNU General Public License as published by | |
8 | the Free Software Foundation; either version 2 of the License, or | |
9 | (at your option) any later version. | |
dbda5fbf | 10 | |
c627d613 AT |
11 | This program is distributed in the hope that it will be useful, |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
dbda5fbf | 15 | |
c627d613 AT |
16 | You should have received a copy of the GNU General Public License |
17 | along with this program; if not, write to the Free Software | |
18 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. | |
19 | */ | |
20 | ||
736a6a29 MP |
21 | /** @file flist.c |
22 | * Generate and receive file lists | |
23 | * | |
24 | * @todo Get rid of the string_area optimization. Efficiently | |
25 | * allocating blocks is the responsibility of the system's malloc | |
26 | * library, not of rsync. | |
27 | * | |
172875cf MP |
28 | * @sa http://lists.samba.org/pipermail/rsync/2000-June/002351.html |
29 | * | |
736a6a29 | 30 | **/ |
c627d613 AT |
31 | |
32 | #include "rsync.h" | |
33 | ||
a800434a AT |
34 | extern struct stats stats; |
35 | ||
c627d613 | 36 | extern int verbose; |
1bbd10fe | 37 | extern int do_progress; |
c627d613 AT |
38 | extern int am_server; |
39 | extern int always_checksum; | |
c627d613 AT |
40 | |
41 | extern int cvs_exclude; | |
42 | ||
a06d19e3 | 43 | extern int recurse; |
24d0fcde WD |
44 | extern char *files_from; |
45 | extern int filesfrom_fd; | |
a06d19e3 | 46 | |
c627d613 AT |
47 | extern int one_file_system; |
48 | extern int make_backups; | |
49 | extern int preserve_links; | |
dc5ddbcc | 50 | extern int preserve_hard_links; |
c627d613 AT |
51 | extern int preserve_perms; |
52 | extern int preserve_devices; | |
53 | extern int preserve_uid; | |
54 | extern int preserve_gid; | |
55 | extern int preserve_times; | |
6574b4f7 | 56 | extern int relative_paths; |
24d0fcde | 57 | extern int implied_dirs; |
82306bf6 | 58 | extern int copy_links; |
b5313607 | 59 | extern int copy_unsafe_links; |
f6c34742 | 60 | extern int remote_version; |
6ba9279f | 61 | extern int io_error; |
cb13abfe | 62 | extern int sanitize_paths; |
c627d613 | 63 | |
6902ed17 MP |
64 | extern int read_batch; |
65 | extern int write_batch; | |
66 | ||
429f9828 WD |
67 | extern struct exclude_struct **exclude_list; |
68 | extern struct exclude_struct **server_exclude_list; | |
69 | extern struct exclude_struct **local_exclude_list; | |
c627d613 | 70 | |
3d382777 AT |
71 | static struct file_struct null_file; |
72 | ||
827c37f6 | 73 | static void clean_flist(struct file_list *flist, int strip_root, int no_dups); |
0199b05f | 74 | |
58225000 | 75 | |
1bbd10fe | 76 | static int show_filelist_p(void) |
58225000 | 77 | { |
24d0fcde | 78 | return verbose && (recurse || files_from) && !am_server; |
1bbd10fe | 79 | } |
ebed4c3a | 80 | |
1bbd10fe DD |
81 | static void start_filelist_progress(char *kind) |
82 | { | |
83 | rprintf(FINFO, "%s ... ", kind); | |
84 | if ((verbose > 1) || do_progress) | |
85 | rprintf(FINFO, "\n"); | |
86 | rflush(FINFO); | |
58225000 MP |
87 | } |
88 | ||
db719fb0 | 89 | |
d27cbec5 | 90 | static void emit_filelist_progress(const struct file_list *flist) |
db719fb0 | 91 | { |
d27cbec5 | 92 | rprintf(FINFO, " %d files...\r", flist->count); |
db719fb0 MP |
93 | } |
94 | ||
95 | ||
d27cbec5 | 96 | static void maybe_emit_filelist_progress(const struct file_list *flist) |
58225000 | 97 | { |
d27cbec5 DD |
98 | if (do_progress && show_filelist_p() && ((flist->count % 100) == 0)) |
99 | emit_filelist_progress(flist); | |
58225000 MP |
100 | } |
101 | ||
102 | ||
1bbd10fe | 103 | static void finish_filelist_progress(const struct file_list *flist) |
58225000 | 104 | { |
1bbd10fe DD |
105 | if (do_progress) { |
106 | /* This overwrites the progress line */ | |
c7b562be MP |
107 | rprintf(FINFO, "%d file%sto consider\n", |
108 | flist->count, flist->count == 1 ? " " : "s "); | |
109 | } else { | |
1bbd10fe | 110 | rprintf(FINFO, "done\n"); |
c7b562be | 111 | } |
58225000 MP |
112 | } |
113 | ||
86943126 MP |
114 | void show_flist_stats(void) |
115 | { | |
116 | /* Nothing yet */ | |
117 | } | |
118 | ||
119 | ||
5c66303a | 120 | static struct string_area *string_area_new(int size) |
3d382777 AT |
121 | { |
122 | struct string_area *a; | |
123 | ||
ebed4c3a MP |
124 | if (size <= 0) |
125 | size = ARENA_SIZE; | |
3d382777 | 126 | a = malloc(sizeof(*a)); |
ebed4c3a MP |
127 | if (!a) |
128 | out_of_memory("string_area_new"); | |
3d382777 | 129 | a->current = a->base = malloc(size); |
ebed4c3a MP |
130 | if (!a->current) |
131 | out_of_memory("string_area_new buffer"); | |
3d382777 | 132 | a->end = a->base + size; |
5c66303a | 133 | a->next = NULL; |
3d382777 AT |
134 | |
135 | return a; | |
136 | } | |
137 | ||
5c66303a | 138 | static void string_area_free(struct string_area *a) |
3d382777 AT |
139 | { |
140 | struct string_area *next; | |
141 | ||
ebed4c3a | 142 | for (; a; a = next) { |
3d382777 AT |
143 | next = a->next; |
144 | free(a->base); | |
145 | } | |
146 | } | |
147 | ||
5c66303a | 148 | static char *string_area_malloc(struct string_area **ap, int size) |
3d382777 AT |
149 | { |
150 | char *p; | |
151 | struct string_area *a; | |
152 | ||
153 | /* does the request fit into the current space? */ | |
154 | a = *ap; | |
155 | if (a->current + size >= a->end) { | |
156 | /* no; get space, move new string_area to front of the list */ | |
157 | a = string_area_new(size > ARENA_SIZE ? size : ARENA_SIZE); | |
158 | a->next = *ap; | |
159 | *ap = a; | |
160 | } | |
161 | ||
162 | /* have space; do the "allocation." */ | |
163 | p = a->current; | |
164 | a->current += size; | |
165 | return p; | |
166 | } | |
167 | ||
5c66303a | 168 | static char *string_area_strdup(struct string_area **ap, const char *src) |
3d382777 | 169 | { |
ebed4c3a | 170 | char *dest = string_area_malloc(ap, strlen(src) + 1); |
3d382777 AT |
171 | return strcpy(dest, src); |
172 | } | |
f7632fc6 AT |
173 | |
174 | static void list_file_entry(struct file_struct *f) | |
175 | { | |
740819ef | 176 | char perms[11]; |
f7632fc6 | 177 | |
7212be92 DD |
178 | if (!f->basename) |
179 | /* this can happen if duplicate names were removed */ | |
180 | return; | |
181 | ||
740819ef MP |
182 | permstring(perms, f->mode); |
183 | ||
f7632fc6 | 184 | if (preserve_links && S_ISLNK(f->mode)) { |
ebed4c3a MP |
185 | rprintf(FINFO, "%s %11.0f %s %s -> %s\n", |
186 | perms, | |
187 | (double) f->length, timestring(f->modtime), | |
f7632fc6 AT |
188 | f_name(f), f->link); |
189 | } else { | |
ebed4c3a MP |
190 | rprintf(FINFO, "%s %11.0f %s %s\n", |
191 | perms, | |
192 | (double) f->length, timestring(f->modtime), | |
193 | f_name(f)); | |
f7632fc6 AT |
194 | } |
195 | } | |
196 | ||
197 | ||
bd9e9ecc MP |
198 | /** |
199 | * Stat either a symlink or its referent, depending on the settings of | |
200 | * copy_links, copy_unsafe_links, etc. | |
201 | * | |
4e5db0ad MP |
202 | * @retval -1 on error |
203 | * | |
204 | * @retval 0 for success | |
205 | * | |
206 | * @post If @p path is a symlink, then @p linkbuf (of size @c | |
bd9e9ecc | 207 | * MAXPATHLEN) contains the symlink target. |
4e5db0ad MP |
208 | * |
209 | * @post @p buffer contains information about the link or the | |
210 | * referrent as appropriate, if they exist. | |
bd9e9ecc | 211 | **/ |
6f2623fd | 212 | int readlink_stat(const char *path, STRUCT_STAT * buffer, char *linkbuf) |
b5313607 DD |
213 | { |
214 | #if SUPPORT_LINKS | |
215 | if (copy_links) { | |
6f2623fd | 216 | return do_stat(path, buffer); |
b5313607 | 217 | } |
6f2623fd | 218 | if (do_lstat(path, buffer) == -1) { |
b5313607 DD |
219 | return -1; |
220 | } | |
6f2623fd | 221 | if (S_ISLNK(buffer->st_mode)) { |
ab94af5c | 222 | int l; |
6f2623fd | 223 | l = readlink((char *) path, linkbuf, MAXPATHLEN - 1); |
dbda5fbf | 224 | if (l == -1) |
b5313607 | 225 | return -1; |
6f2623fd | 226 | linkbuf[l] = 0; |
fc638474 DD |
227 | if (copy_unsafe_links && unsafe_symlink(linkbuf, path)) { |
228 | if (verbose > 1) { | |
dbda5fbf | 229 | rprintf(FINFO,"copying unsafe symlink \"%s\" -> \"%s\"\n", |
fc638474 DD |
230 | path, linkbuf); |
231 | } | |
6f2623fd | 232 | return do_stat(path, buffer); |
b5313607 DD |
233 | } |
234 | } | |
235 | return 0; | |
236 | #else | |
6f2623fd | 237 | return do_stat(path, buffer); |
b5313607 DD |
238 | #endif |
239 | } | |
240 | ||
6f2623fd | 241 | int link_stat(const char *path, STRUCT_STAT * buffer) |
82306bf6 AT |
242 | { |
243 | #if SUPPORT_LINKS | |
ebed4c3a | 244 | if (copy_links) { |
6f2623fd | 245 | return do_stat(path, buffer); |
ebed4c3a | 246 | } else { |
6f2623fd | 247 | return do_lstat(path, buffer); |
ebed4c3a | 248 | } |
82306bf6 | 249 | #else |
6f2623fd | 250 | return do_stat(path, buffer); |
82306bf6 AT |
251 | #endif |
252 | } | |
253 | ||
c627d613 | 254 | /* |
429f9828 WD |
255 | * This function is used to check if a file should be included/excluded |
256 | * from the list of files based on its name and type etc. The value of | |
257 | * exclude_level is set to either SERVER_EXCLUDES or ALL_EXCLUDES. | |
c627d613 | 258 | */ |
429f9828 | 259 | static int check_exclude_file(char *fname, int is_dir, int exclude_level) |
c627d613 | 260 | { |
7d687932 | 261 | #if 0 /* This currently never happens, so avoid a useless compare. */ |
429f9828 WD |
262 | if (exclude_level == NO_EXCLUDES) |
263 | return 0; | |
264 | #endif | |
6931c138 | 265 | if (fname) { |
429f9828 | 266 | /* never exclude '.', even if somebody does --exclude '*' */ |
6931c138 WD |
267 | if (fname[0] == '.' && !fname[1]) |
268 | return 0; | |
269 | /* Handle the -R version of the '.' dir. */ | |
270 | if (fname[0] == '/') { | |
271 | int len = strlen(fname); | |
272 | if (fname[len-1] == '.' && fname[len-2] == '/') | |
273 | return 0; | |
274 | } | |
76e26e10 | 275 | } |
6931c138 WD |
276 | if (server_exclude_list |
277 | && check_exclude(server_exclude_list, fname, is_dir)) | |
429f9828 WD |
278 | return 1; |
279 | if (exclude_level != ALL_EXCLUDES) | |
280 | return 0; | |
281 | if (exclude_list && check_exclude(exclude_list, fname, is_dir)) | |
282 | return 1; | |
6931c138 WD |
283 | if (local_exclude_list |
284 | && check_exclude(local_exclude_list, fname, is_dir)) | |
76e26e10 | 285 | return 1; |
76e26e10 | 286 | return 0; |
c627d613 AT |
287 | } |
288 | ||
289 | /* used by the one_file_system code */ | |
290 | static dev_t filesystem_dev; | |
291 | ||
292 | static void set_filesystem(char *fname) | |
293 | { | |
ebed4c3a MP |
294 | STRUCT_STAT st; |
295 | if (link_stat(fname, &st) != 0) | |
296 | return; | |
297 | filesystem_dev = st.st_dev; | |
c627d613 AT |
298 | } |
299 | ||
300 | ||
b280a1f4 AT |
301 | static int to_wire_mode(mode_t mode) |
302 | { | |
efe3037c | 303 | if (S_ISLNK(mode) && (_S_IFLNK != 0120000)) { |
b280a1f4 AT |
304 | return (mode & ~(_S_IFMT)) | 0120000; |
305 | } | |
ebed4c3a | 306 | return (int) mode; |
b280a1f4 AT |
307 | } |
308 | ||
309 | static mode_t from_wire_mode(int mode) | |
310 | { | |
efe3037c AT |
311 | if ((mode & (_S_IFMT)) == 0120000 && (_S_IFLNK != 0120000)) { |
312 | return (mode & ~(_S_IFMT)) | _S_IFLNK; | |
b280a1f4 | 313 | } |
ebed4c3a | 314 | return (mode_t) mode; |
b280a1f4 AT |
315 | } |
316 | ||
317 | ||
ebed4c3a | 318 | static void send_directory(int f, struct file_list *flist, char *dir); |
c627d613 | 319 | |
3a6a366f | 320 | static char *flist_dir; |
c627d613 | 321 | |
3ec4dd97 | 322 | |
d9d6bc52 MP |
323 | /** |
324 | * Make sure @p flist is big enough to hold at least @p flist->count | |
325 | * entries. | |
326 | **/ | |
327 | static void flist_expand(struct file_list *flist) | |
328 | { | |
329 | if (flist->count >= flist->malloced) { | |
2e7d1994 MP |
330 | size_t new_bytes; |
331 | void *new_ptr; | |
dbda5fbf | 332 | |
d9d6bc52 MP |
333 | if (flist->malloced < 1000) |
334 | flist->malloced += 1000; | |
335 | else | |
336 | flist->malloced *= 2; | |
2e7d1994 MP |
337 | |
338 | new_bytes = sizeof(flist->files[0]) * flist->malloced; | |
dbda5fbf | 339 | |
f5be54d6 DD |
340 | if (flist->files) |
341 | new_ptr = realloc(flist->files, new_bytes); | |
342 | else | |
343 | new_ptr = malloc(new_bytes); | |
2e7d1994 | 344 | |
1d5a1da9 | 345 | if (verbose >= 2) { |
1bbd10fe | 346 | rprintf(FINFO, "expand file_list to %.0f bytes, did%s move\n", |
2e7d1994 MP |
347 | (double) new_bytes, |
348 | (new_ptr == flist->files) ? " not" : ""); | |
349 | } | |
dbda5fbf | 350 | |
2e7d1994 MP |
351 | flist->files = (struct file_struct **) new_ptr; |
352 | ||
d9d6bc52 MP |
353 | if (!flist->files) |
354 | out_of_memory("flist_expand"); | |
355 | } | |
356 | } | |
357 | ||
358 | ||
ebed4c3a MP |
359 | static void send_file_entry(struct file_struct *file, int f, |
360 | unsigned base_flags) | |
c627d613 | 361 | { |
72914a60 AT |
362 | unsigned char flags; |
363 | static time_t last_time; | |
364 | static mode_t last_mode; | |
2119a4c4 | 365 | static DEV64_T last_rdev; |
72914a60 AT |
366 | static uid_t last_uid; |
367 | static gid_t last_gid; | |
368 | static char lastname[MAXPATHLEN]; | |
369 | char *fname; | |
ebed4c3a | 370 | int l1, l2; |
72914a60 | 371 | |
ebed4c3a MP |
372 | if (f == -1) |
373 | return; | |
72914a60 AT |
374 | |
375 | if (!file) { | |
ebed4c3a | 376 | write_byte(f, 0); |
72914a60 AT |
377 | return; |
378 | } | |
379 | ||
eca2adb4 MP |
380 | io_write_phase = "send_file_entry"; |
381 | ||
72914a60 AT |
382 | fname = f_name(file); |
383 | ||
384 | flags = base_flags; | |
385 | ||
ebed4c3a MP |
386 | if (file->mode == last_mode) |
387 | flags |= SAME_MODE; | |
388 | if (file->rdev == last_rdev) | |
389 | flags |= SAME_RDEV; | |
390 | if (file->uid == last_uid) | |
391 | flags |= SAME_UID; | |
392 | if (file->gid == last_gid) | |
393 | flags |= SAME_GID; | |
394 | if (file->modtime == last_time) | |
395 | flags |= SAME_TIME; | |
396 | ||
397 | for (l1 = 0; | |
398 | lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255); | |
dbda5fbf | 399 | l1++) {} |
72914a60 AT |
400 | l2 = strlen(fname) - l1; |
401 | ||
ebed4c3a MP |
402 | if (l1 > 0) |
403 | flags |= SAME_NAME; | |
404 | if (l2 > 255) | |
405 | flags |= LONG_NAME; | |
72914a60 AT |
406 | |
407 | /* we must make sure we don't send a zero flags byte or the other | |
408 | end will terminate the flist transfer */ | |
ebed4c3a MP |
409 | if (flags == 0 && !S_ISDIR(file->mode)) |
410 | flags |= FLAG_DELETE; | |
411 | if (flags == 0) | |
412 | flags |= LONG_NAME; | |
72914a60 | 413 | |
ebed4c3a | 414 | write_byte(f, flags); |
72914a60 | 415 | if (flags & SAME_NAME) |
ebed4c3a | 416 | write_byte(f, l1); |
72914a60 | 417 | if (flags & LONG_NAME) |
ebed4c3a | 418 | write_int(f, l2); |
72914a60 | 419 | else |
ebed4c3a MP |
420 | write_byte(f, l2); |
421 | write_buf(f, fname + l1, l2); | |
72914a60 | 422 | |
ebed4c3a | 423 | write_longint(f, file->length); |
72914a60 | 424 | if (!(flags & SAME_TIME)) |
ebed4c3a | 425 | write_int(f, (int) file->modtime); |
72914a60 | 426 | if (!(flags & SAME_MODE)) |
ebed4c3a | 427 | write_int(f, to_wire_mode(file->mode)); |
72914a60 AT |
428 | if (preserve_uid && !(flags & SAME_UID)) { |
429 | add_uid(file->uid); | |
ebed4c3a | 430 | write_int(f, (int) file->uid); |
72914a60 AT |
431 | } |
432 | if (preserve_gid && !(flags & SAME_GID)) { | |
433 | add_gid(file->gid); | |
ebed4c3a | 434 | write_int(f, (int) file->gid); |
72914a60 | 435 | } |
ebed4c3a MP |
436 | if (preserve_devices && IS_DEVICE(file->mode) |
437 | && !(flags & SAME_RDEV)) | |
438 | write_int(f, (int) file->rdev); | |
c627d613 AT |
439 | |
440 | #if SUPPORT_LINKS | |
72914a60 | 441 | if (preserve_links && S_ISLNK(file->mode)) { |
ebed4c3a MP |
442 | write_int(f, strlen(file->link)); |
443 | write_buf(f, file->link, strlen(file->link)); | |
72914a60 | 444 | } |
c627d613 AT |
445 | #endif |
446 | ||
dc5ddbcc | 447 | #if SUPPORT_HARD_LINKS |
72914a60 | 448 | if (preserve_hard_links && S_ISREG(file->mode)) { |
736a6a29 MP |
449 | if (remote_version < 26) { |
450 | /* 32-bit dev_t and ino_t */ | |
ebed4c3a MP |
451 | write_int(f, (int) file->dev); |
452 | write_int(f, (int) file->inode); | |
736a6a29 MP |
453 | } else { |
454 | /* 64-bit dev_t and ino_t */ | |
6abd193f MP |
455 | write_longint(f, file->dev); |
456 | write_longint(f, file->inode); | |
736a6a29 | 457 | } |
72914a60 | 458 | } |
dc5ddbcc AT |
459 | #endif |
460 | ||
72914a60 | 461 | if (always_checksum) { |
f855a7d0 | 462 | if (remote_version < 21) { |
ebed4c3a | 463 | write_buf(f, file->sum, 2); |
f855a7d0 | 464 | } else { |
ebed4c3a | 465 | write_buf(f, file->sum, MD4_SUM_LENGTH); |
f855a7d0 | 466 | } |
ebed4c3a | 467 | } |
182dca5c | 468 | |
72914a60 AT |
469 | last_mode = file->mode; |
470 | last_rdev = file->rdev; | |
471 | last_uid = file->uid; | |
472 | last_gid = file->gid; | |
473 | last_time = file->modtime; | |
4fe159a8 | 474 | |
ebed4c3a MP |
475 | strlcpy(lastname, fname, MAXPATHLEN); |
476 | lastname[MAXPATHLEN - 1] = 0; | |
eca2adb4 MP |
477 | |
478 | io_write_phase = "unknown"; | |
182dca5c AT |
479 | } |
480 | ||
481 | ||
482 | ||
3333ffbd | 483 | static void receive_file_entry(struct file_struct **fptr, |
ebed4c3a | 484 | unsigned flags, int f) |
182dca5c | 485 | { |
72914a60 AT |
486 | static time_t last_time; |
487 | static mode_t last_mode; | |
2119a4c4 | 488 | static DEV64_T last_rdev; |
72914a60 AT |
489 | static uid_t last_uid; |
490 | static gid_t last_gid; | |
491 | static char lastname[MAXPATHLEN]; | |
492 | char thisname[MAXPATHLEN]; | |
ebed4c3a | 493 | unsigned int l1 = 0, l2 = 0; |
72914a60 AT |
494 | char *p; |
495 | struct file_struct *file; | |
496 | ||
497 | if (flags & SAME_NAME) | |
498 | l1 = read_byte(f); | |
ebed4c3a | 499 | |
72914a60 AT |
500 | if (flags & LONG_NAME) |
501 | l2 = read_int(f); | |
502 | else | |
503 | l2 = read_byte(f); | |
504 | ||
ebed4c3a MP |
505 | file = (struct file_struct *) malloc(sizeof(*file)); |
506 | if (!file) | |
507 | out_of_memory("receive_file_entry"); | |
508 | memset((char *) file, 0, sizeof(*file)); | |
72914a60 AT |
509 | (*fptr) = file; |
510 | ||
ebed4c3a MP |
511 | if (l2 >= MAXPATHLEN - l1) { |
512 | rprintf(FERROR, | |
513 | "overflow: flags=0x%x l1=%d l2=%d lastname=%s\n", | |
d0fd26aa AT |
514 | flags, l1, l2, lastname); |
515 | overflow("receive_file_entry"); | |
516 | } | |
72914a60 | 517 | |
ebed4c3a MP |
518 | strlcpy(thisname, lastname, l1 + 1); |
519 | read_sbuf(f, &thisname[l1], l2); | |
520 | thisname[l1 + l2] = 0; | |
72914a60 | 521 | |
ebed4c3a MP |
522 | strlcpy(lastname, thisname, MAXPATHLEN); |
523 | lastname[MAXPATHLEN - 1] = 0; | |
72914a60 AT |
524 | |
525 | clean_fname(thisname); | |
526 | ||
cb13abfe DD |
527 | if (sanitize_paths) { |
528 | sanitize_path(thisname, NULL); | |
529 | } | |
530 | ||
ebed4c3a | 531 | if ((p = strrchr(thisname, '/'))) { |
72914a60 AT |
532 | static char *lastdir; |
533 | *p = 0; | |
ebed4c3a | 534 | if (lastdir && strcmp(thisname, lastdir) == 0) { |
72914a60 AT |
535 | file->dirname = lastdir; |
536 | } else { | |
537 | file->dirname = strdup(thisname); | |
538 | lastdir = file->dirname; | |
539 | } | |
ebed4c3a | 540 | file->basename = strdup(p + 1); |
72914a60 AT |
541 | } else { |
542 | file->dirname = NULL; | |
543 | file->basename = strdup(thisname); | |
544 | } | |
545 | ||
ebed4c3a MP |
546 | if (!file->basename) |
547 | out_of_memory("receive_file_entry 1"); | |
72914a60 AT |
548 | |
549 | ||
550 | file->flags = flags; | |
551 | file->length = read_longint(f); | |
ebed4c3a MP |
552 | file->modtime = |
553 | (flags & SAME_TIME) ? last_time : (time_t) read_int(f); | |
554 | file->mode = | |
555 | (flags & SAME_MODE) ? last_mode : from_wire_mode(read_int(f)); | |
72914a60 | 556 | if (preserve_uid) |
ebed4c3a MP |
557 | file->uid = |
558 | (flags & SAME_UID) ? last_uid : (uid_t) read_int(f); | |
72914a60 | 559 | if (preserve_gid) |
ebed4c3a MP |
560 | file->gid = |
561 | (flags & SAME_GID) ? last_gid : (gid_t) read_int(f); | |
72914a60 | 562 | if (preserve_devices && IS_DEVICE(file->mode)) |
ebed4c3a | 563 | file->rdev = |
ca23c51a | 564 | (flags & SAME_RDEV) ? last_rdev : (DEV64_T) read_int(f); |
72914a60 AT |
565 | |
566 | if (preserve_links && S_ISLNK(file->mode)) { | |
567 | int l = read_int(f); | |
9dd891bb | 568 | if (l < 0) { |
ebed4c3a | 569 | rprintf(FERROR, "overflow: l=%d\n", l); |
9dd891bb MP |
570 | overflow("receive_file_entry"); |
571 | } | |
ebed4c3a MP |
572 | file->link = (char *) malloc(l + 1); |
573 | if (!file->link) | |
574 | out_of_memory("receive_file_entry 2"); | |
575 | read_sbuf(f, file->link, l); | |
cb13abfe DD |
576 | if (sanitize_paths) { |
577 | sanitize_path(file->link, file->dirname); | |
578 | } | |
72914a60 | 579 | } |
dc5ddbcc | 580 | #if SUPPORT_HARD_LINKS |
72914a60 | 581 | if (preserve_hard_links && S_ISREG(file->mode)) { |
736a6a29 MP |
582 | if (remote_version < 26) { |
583 | file->dev = read_int(f); | |
584 | file->inode = read_int(f); | |
585 | } else { | |
586 | file->dev = read_longint(f); | |
587 | file->inode = read_longint(f); | |
588 | } | |
72914a60 | 589 | } |
dc5ddbcc | 590 | #endif |
ebed4c3a | 591 | |
72914a60 | 592 | if (always_checksum) { |
ebed4c3a MP |
593 | file->sum = (char *) malloc(MD4_SUM_LENGTH); |
594 | if (!file->sum) | |
595 | out_of_memory("md4 sum"); | |
f855a7d0 | 596 | if (remote_version < 21) { |
ebed4c3a | 597 | read_buf(f, file->sum, 2); |
f855a7d0 | 598 | } else { |
ebed4c3a | 599 | read_buf(f, file->sum, MD4_SUM_LENGTH); |
f855a7d0 | 600 | } |
72914a60 | 601 | } |
ebed4c3a | 602 | |
72914a60 AT |
603 | last_mode = file->mode; |
604 | last_rdev = file->rdev; | |
605 | last_uid = file->uid; | |
606 | last_gid = file->gid; | |
607 | last_time = file->modtime; | |
608 | ||
609 | if (!preserve_perms) { | |
610 | extern int orig_umask; | |
611 | /* set an appropriate set of permissions based on original | |
612 | permissions and umask. This emulates what GNU cp does */ | |
613 | file->mode &= ~orig_umask; | |
614 | } | |
c627d613 AT |
615 | } |
616 | ||
617 | ||
0c5f37d9 AT |
618 | /* determine if a file in a different filesstem should be skipped |
619 | when one_file_system is set. We bascally only want to include | |
620 | the mount points - but they can be hard to find! */ | |
ebed4c3a | 621 | static int skip_filesystem(char *fname, STRUCT_STAT * st) |
0c5f37d9 | 622 | { |
bcacc18b | 623 | STRUCT_STAT st2; |
0c5f37d9 AT |
624 | char *p = strrchr(fname, '/'); |
625 | ||
626 | /* skip all but directories */ | |
ebed4c3a MP |
627 | if (!S_ISDIR(st->st_mode)) |
628 | return 1; | |
0c5f37d9 AT |
629 | |
630 | /* if its not a subdirectory then allow */ | |
ebed4c3a MP |
631 | if (!p) |
632 | return 0; | |
0c5f37d9 AT |
633 | |
634 | *p = 0; | |
635 | if (link_stat(fname, &st2)) { | |
636 | *p = '/'; | |
637 | return 0; | |
638 | } | |
639 | *p = '/'; | |
ebed4c3a | 640 | |
0c5f37d9 AT |
641 | return (st2.st_dev != filesystem_dev); |
642 | } | |
4fe159a8 | 643 | |
3d382777 | 644 | #define STRDUP(ap, p) (ap ? string_area_strdup(ap, p) : strdup(p)) |
87a819ed MP |
645 | /* IRIX cc cares that the operands to the ternary have the same type. */ |
646 | #define MALLOC(ap, i) (ap ? (void*) string_area_malloc(ap, i) : malloc(i)) | |
3d382777 | 647 | |
db719fb0 MP |
648 | /** |
649 | * Create a file_struct for a named file by reading its stat() | |
650 | * information and performing extensive checks against global | |
651 | * options. | |
652 | * | |
653 | * @return the new file, or NULL if there was an error or this file | |
654 | * should be excluded. | |
655 | * | |
656 | * @todo There is a small optimization opportunity here to avoid | |
657 | * stat()ing the file in some circumstances, which has a certain cost. | |
658 | * We are called immediately after doing readdir(), and so we may | |
659 | * already know the d_type of the file. We could for example avoid | |
660 | * statting directories if we're not recursing, but this is not a very | |
661 | * important case. Some systems may not have d_type. | |
662 | **/ | |
429f9828 WD |
663 | struct file_struct *make_file(char *fname, struct string_area **ap, |
664 | int exclude_level) | |
c627d613 | 665 | { |
3ec4dd97 | 666 | struct file_struct *file; |
bcacc18b | 667 | STRUCT_STAT st; |
3ec4dd97 AT |
668 | char sum[SUM_LENGTH]; |
669 | char *p; | |
670 | char cleaned_name[MAXPATHLEN]; | |
b5313607 | 671 | char linkbuf[MAXPATHLEN]; |
ac1a0994 | 672 | extern int module_id; |
3ec4dd97 | 673 | |
37f9805d | 674 | strlcpy(cleaned_name, fname, MAXPATHLEN); |
ebed4c3a | 675 | cleaned_name[MAXPATHLEN - 1] = 0; |
3ec4dd97 | 676 | clean_fname(cleaned_name); |
cb13abfe DD |
677 | if (sanitize_paths) { |
678 | sanitize_path(cleaned_name, NULL); | |
679 | } | |
3ec4dd97 AT |
680 | fname = cleaned_name; |
681 | ||
ebed4c3a | 682 | memset(sum, 0, SUM_LENGTH); |
3ec4dd97 | 683 | |
ebed4c3a | 684 | if (readlink_stat(fname, &st, linkbuf) != 0) { |
76e26e10 | 685 | int save_errno = errno; |
429f9828 | 686 | if (errno == ENOENT && exclude_level != NO_EXCLUDES) { |
dbda5fbf | 687 | /* either symlink pointing nowhere or file that |
1b85e3f1 DD |
688 | * was removed during rsync run; see if excluded |
689 | * before reporting an error */ | |
429f9828 | 690 | if (check_exclude_file(fname, 0, exclude_level)) { |
76e26e10 DD |
691 | /* file is excluded anyway, ignore silently */ |
692 | return NULL; | |
693 | } | |
694 | } | |
6ba9279f | 695 | io_error = 1; |
ebed4c3a MP |
696 | rprintf(FERROR, "readlink %s: %s\n", |
697 | fname, strerror(save_errno)); | |
3ec4dd97 AT |
698 | return NULL; |
699 | } | |
c627d613 | 700 | |
429f9828 WD |
701 | /* backup.c calls us with exclude_level set to NO_EXCLUDES. */ |
702 | if (exclude_level == NO_EXCLUDES) | |
ebed4c3a | 703 | goto skip_excludes; |
ac1a0994 | 704 | |
24d0fcde | 705 | if (S_ISDIR(st.st_mode) && !recurse && !files_from) { |
ebed4c3a | 706 | rprintf(FINFO, "skipping directory %s\n", fname); |
3ec4dd97 AT |
707 | return NULL; |
708 | } | |
ebed4c3a | 709 | |
0c5f37d9 AT |
710 | if (one_file_system && st.st_dev != filesystem_dev) { |
711 | if (skip_filesystem(fname, &st)) | |
712 | return NULL; | |
713 | } | |
ebed4c3a | 714 | |
429f9828 | 715 | if (check_exclude_file(fname, S_ISDIR(st.st_mode) != 0, exclude_level)) |
76e26e10 DD |
716 | return NULL; |
717 | ||
ebed4c3a | 718 | if (lp_ignore_nonreadable(module_id) && access(fname, R_OK) != 0) |
ac1a0994 AT |
719 | return NULL; |
720 | ||
ebed4c3a | 721 | skip_excludes: |
ac1a0994 | 722 | |
3ec4dd97 | 723 | if (verbose > 2) |
429f9828 | 724 | rprintf(FINFO, "make_file(%s,*,%d)\n", fname, exclude_level); |
ebed4c3a MP |
725 | |
726 | file = (struct file_struct *) malloc(sizeof(*file)); | |
727 | if (!file) | |
728 | out_of_memory("make_file"); | |
729 | memset((char *) file, 0, sizeof(*file)); | |
3ec4dd97 | 730 | |
ebed4c3a | 731 | if ((p = strrchr(fname, '/'))) { |
3ec4dd97 AT |
732 | static char *lastdir; |
733 | *p = 0; | |
ebed4c3a | 734 | if (lastdir && strcmp(fname, lastdir) == 0) { |
3ec4dd97 AT |
735 | file->dirname = lastdir; |
736 | } else { | |
a20aa42a | 737 | file->dirname = strdup(fname); |
3ec4dd97 AT |
738 | lastdir = file->dirname; |
739 | } | |
ebed4c3a | 740 | file->basename = STRDUP(ap, p + 1); |
3ec4dd97 AT |
741 | *p = '/'; |
742 | } else { | |
743 | file->dirname = NULL; | |
3d382777 | 744 | file->basename = STRDUP(ap, fname); |
3ec4dd97 | 745 | } |
c627d613 | 746 | |
3ec4dd97 AT |
747 | file->modtime = st.st_mtime; |
748 | file->length = st.st_size; | |
749 | file->mode = st.st_mode; | |
750 | file->uid = st.st_uid; | |
751 | file->gid = st.st_gid; | |
752 | file->dev = st.st_dev; | |
753 | file->inode = st.st_ino; | |
5f78da20 | 754 | #ifdef HAVE_STRUCT_STAT_ST_RDEV |
3ec4dd97 | 755 | file->rdev = st.st_rdev; |
c627d613 AT |
756 | #endif |
757 | ||
758 | #if SUPPORT_LINKS | |
3ec4dd97 | 759 | if (S_ISLNK(st.st_mode)) { |
3d382777 | 760 | file->link = STRDUP(ap, linkbuf); |
3ec4dd97 | 761 | } |
c627d613 AT |
762 | #endif |
763 | ||
1250f24e | 764 | if (always_checksum) { |
ebed4c3a MP |
765 | file->sum = (char *) MALLOC(ap, MD4_SUM_LENGTH); |
766 | if (!file->sum) | |
767 | out_of_memory("md4 sum"); | |
1250f24e AT |
768 | /* drat. we have to provide a null checksum for non-regular |
769 | files in order to be compatible with earlier versions | |
770 | of rsync */ | |
771 | if (S_ISREG(st.st_mode)) { | |
ebed4c3a | 772 | file_checksum(fname, file->sum, st.st_size); |
1250f24e AT |
773 | } else { |
774 | memset(file->sum, 0, MD4_SUM_LENGTH); | |
775 | } | |
ebed4c3a | 776 | } |
c627d613 | 777 | |
3ec4dd97 AT |
778 | if (flist_dir) { |
779 | static char *lastdir; | |
ebed4c3a | 780 | if (lastdir && strcmp(lastdir, flist_dir) == 0) { |
3ec4dd97 AT |
781 | file->basedir = lastdir; |
782 | } else { | |
a20aa42a | 783 | file->basedir = strdup(flist_dir); |
3ec4dd97 AT |
784 | lastdir = file->basedir; |
785 | } | |
786 | } else { | |
787 | file->basedir = NULL; | |
788 | } | |
c627d613 | 789 | |
3ec4dd97 | 790 | if (!S_ISDIR(st.st_mode)) |
a800434a | 791 | stats.total_size += st.st_size; |
c627d613 | 792 | |
3ec4dd97 | 793 | return file; |
c627d613 AT |
794 | } |
795 | ||
796 | ||
797 | ||
ebed4c3a MP |
798 | void send_file_name(int f, struct file_list *flist, char *fname, |
799 | int recursive, unsigned base_flags) | |
c627d613 | 800 | { |
ebed4c3a | 801 | struct file_struct *file; |
429f9828 | 802 | extern int delete_excluded; |
ebed4c3a | 803 | |
429f9828 WD |
804 | /* f is set to -1 when calculating deletion file list */ |
805 | file = make_file(fname, &flist->string_area, | |
806 | f == -1 && delete_excluded? SERVER_EXCLUDES | |
807 | : ALL_EXCLUDES); | |
ebed4c3a MP |
808 | |
809 | if (!file) | |
810 | return; | |
811 | ||
db719fb0 | 812 | maybe_emit_filelist_progress(flist); |
ebed4c3a | 813 | |
d9d6bc52 | 814 | flist_expand(flist); |
ebed4c3a MP |
815 | |
816 | if (write_batch) /* dw */ | |
817 | file->flags = FLAG_DELETE; | |
818 | ||
c120ff37 | 819 | if (file->basename[0]) { |
ebed4c3a MP |
820 | flist->files[flist->count++] = file; |
821 | send_file_entry(file, f, base_flags); | |
822 | } | |
823 | ||
824 | if (S_ISDIR(file->mode) && recursive) { | |
825 | struct exclude_struct **last_exclude_list = | |
826 | local_exclude_list; | |
827 | send_directory(f, flist, f_name(file)); | |
828 | local_exclude_list = last_exclude_list; | |
829 | return; | |
830 | } | |
c627d613 AT |
831 | } |
832 | ||
833 | ||
834 | ||
ebed4c3a | 835 | static void send_directory(int f, struct file_list *flist, char *dir) |
c627d613 | 836 | { |
3ec4dd97 AT |
837 | DIR *d; |
838 | struct dirent *di; | |
839 | char fname[MAXPATHLEN]; | |
840 | int l; | |
841 | char *p; | |
842 | ||
843 | d = opendir(dir); | |
844 | if (!d) { | |
6ba9279f | 845 | io_error = 1; |
ebed4c3a | 846 | rprintf(FERROR, "opendir(%s): %s\n", dir, strerror(errno)); |
3ec4dd97 AT |
847 | return; |
848 | } | |
c627d613 | 849 | |
ebed4c3a | 850 | strlcpy(fname, dir, MAXPATHLEN); |
3ec4dd97 | 851 | l = strlen(fname); |
ebed4c3a MP |
852 | if (fname[l - 1] != '/') { |
853 | if (l == MAXPATHLEN - 1) { | |
6ba9279f | 854 | io_error = 1; |
ebed4c3a MP |
855 | rprintf(FERROR, |
856 | "skipping long-named directory %s\n", | |
857 | fname); | |
3ec4dd97 AT |
858 | closedir(d); |
859 | return; | |
860 | } | |
ebed4c3a | 861 | strlcat(fname, "/", MAXPATHLEN); |
3ec4dd97 AT |
862 | l++; |
863 | } | |
864 | p = fname + strlen(fname); | |
c627d613 | 865 | |
3d913675 AT |
866 | local_exclude_list = NULL; |
867 | ||
3ec4dd97 | 868 | if (cvs_exclude) { |
ebed4c3a MP |
869 | if (strlen(fname) + strlen(".cvsignore") <= MAXPATHLEN - 1) { |
870 | strcpy(p, ".cvsignore"); | |
429f9828 | 871 | add_exclude_file(&exclude_list,fname,MISSING_OK,ADD_EXCLUDE); |
3ec4dd97 | 872 | } else { |
6ba9279f | 873 | io_error = 1; |
ebed4c3a MP |
874 | rprintf(FINFO, |
875 | "cannot cvs-exclude in long-named directory %s\n", | |
876 | fname); | |
3ec4dd97 | 877 | } |
ebed4c3a MP |
878 | } |
879 | ||
880 | for (di = readdir(d); di; di = readdir(d)) { | |
d6e6ecbd | 881 | char *dname = d_name(di); |
c120ff37 WD |
882 | if (dname[0] == '.' && (dname[1] == '\0' || |
883 | (dname[1] == '.' && dname[2] == '\0'))) | |
3ec4dd97 | 884 | continue; |
ebed4c3a MP |
885 | strlcpy(p, dname, MAXPATHLEN - l); |
886 | send_file_name(f, flist, fname, recurse, 0); | |
3ec4dd97 | 887 | } |
c627d613 | 888 | |
429f9828 WD |
889 | if (local_exclude_list) |
890 | free_exclude_list(&local_exclude_list); /* Zeros pointer too */ | |
3d913675 | 891 | |
3ec4dd97 | 892 | closedir(d); |
c627d613 AT |
893 | } |
894 | ||
895 | ||
c4fea82f | 896 | /** |
429f9828 WD |
897 | * The delete_files() function in receiver.c sets f to -1 so that we just |
898 | * construct the file list in memory without sending it over the wire. It | |
899 | * also has the side-effect of ignoring user-excludes if delete_excluded | |
900 | * is set (so that the delete list includes user-excluded files). | |
c4fea82f | 901 | **/ |
ebed4c3a | 902 | struct file_list *send_file_list(int f, int argc, char *argv[]) |
c627d613 | 903 | { |
24d0fcde | 904 | int l; |
bcacc18b | 905 | STRUCT_STAT st; |
ebed4c3a MP |
906 | char *p, *dir, *olddir; |
907 | char lastpath[MAXPATHLEN] = ""; | |
649d65ed | 908 | struct file_list *flist; |
a800434a | 909 | int64 start_write; |
24d0fcde | 910 | int use_ff_fd = 0; |
649d65ed | 911 | |
1bbd10fe DD |
912 | if (show_filelist_p() && f != -1) |
913 | start_filelist_progress("building file list"); | |
c627d613 | 914 | |
a800434a AT |
915 | start_write = stats.total_written; |
916 | ||
3d382777 | 917 | flist = flist_new(); |
c627d613 | 918 | |
d6dead6b AT |
919 | if (f != -1) { |
920 | io_start_buffering(f); | |
24d0fcde WD |
921 | if (filesfrom_fd >= 0) { |
922 | if (argv[0] && !push_dir(argv[0], 0)) { | |
923 | rprintf(FERROR, "push_dir %s : %s\n", | |
924 | argv[0], strerror(errno)); | |
925 | exit_cleanup(RERR_FILESELECT); | |
926 | } | |
927 | use_ff_fd = 1; | |
928 | } | |
d6dead6b AT |
929 | } |
930 | ||
24d0fcde | 931 | while (1) { |
fc638474 DD |
932 | char fname2[MAXPATHLEN]; |
933 | char *fname = fname2; | |
c627d613 | 934 | |
24d0fcde WD |
935 | if (use_ff_fd) { |
936 | if (read_filesfrom_line(filesfrom_fd, fname) == 0) | |
937 | break; | |
938 | sanitize_path(fname, NULL); | |
939 | } else { | |
940 | if (argc-- == 0) | |
941 | break; | |
942 | strlcpy(fname, *argv++, MAXPATHLEN); | |
943 | if (sanitize_paths) | |
944 | sanitize_path(fname, NULL); | |
945 | } | |
c627d613 | 946 | |
649d65ed | 947 | l = strlen(fname); |
6931c138 WD |
948 | if (fname[l - 1] == '/') { |
949 | if (l == 2 && fname[0] == '.') { | |
950 | /* Turn "./" into just "." rather than "./." */ | |
951 | fname[1] = '\0'; | |
53f821f1 | 952 | } else { |
ebed4c3a | 953 | strlcat(fname, ".", MAXPATHLEN); |
53f821f1 | 954 | } |
649d65ed | 955 | } |
c627d613 | 956 | |
ebed4c3a | 957 | if (link_stat(fname, &st) != 0) { |
f76933b1 | 958 | if (f != -1) { |
ebed4c3a MP |
959 | io_error = 1; |
960 | rprintf(FERROR, "link_stat %s : %s\n", | |
961 | fname, strerror(errno)); | |
f76933b1 | 962 | } |
649d65ed AT |
963 | continue; |
964 | } | |
c627d613 | 965 | |
24d0fcde | 966 | if (S_ISDIR(st.st_mode) && !recurse && !files_from) { |
ebed4c3a | 967 | rprintf(FINFO, "skipping directory %s\n", fname); |
649d65ed AT |
968 | continue; |
969 | } | |
c627d613 | 970 | |
649d65ed | 971 | dir = NULL; |
2bca43f6 | 972 | olddir = NULL; |
649d65ed AT |
973 | |
974 | if (!relative_paths) { | |
ebed4c3a | 975 | p = strrchr(fname, '/'); |
649d65ed AT |
976 | if (p) { |
977 | *p = 0; | |
ebed4c3a | 978 | if (p == fname) |
649d65ed AT |
979 | dir = "/"; |
980 | else | |
ebed4c3a MP |
981 | dir = fname; |
982 | fname = p + 1; | |
649d65ed | 983 | } |
24d0fcde | 984 | } else if (f != -1 && implied_dirs && (p=strrchr(fname,'/')) && p != fname) { |
649d65ed AT |
985 | /* this ensures we send the intermediate directories, |
986 | thus getting their permissions right */ | |
2154309a | 987 | char *lp = lastpath, *fn = fname, *slash = fname; |
649d65ed | 988 | *p = 0; |
2154309a WD |
989 | /* Skip any initial directories in our path that we |
990 | * have in common with lastpath. */ | |
991 | while (*fn && *lp == *fn) { | |
992 | if (*fn == '/') | |
993 | slash = fn; | |
994 | lp++, fn++; | |
995 | } | |
996 | *p = '/'; | |
997 | if (fn != p || (*lp && *lp != '/')) { | |
998 | int copy_links_saved = copy_links; | |
999 | int recurse_saved = recurse; | |
1000 | copy_links = copy_unsafe_links; | |
1001 | /* set recurse to 1 to prevent make_file | |
1002 | * from ignoring directory, but still | |
1003 | * turn off the recursive parameter to | |
1004 | * send_file_name */ | |
1005 | recurse = 1; | |
1006 | while ((slash = strchr(slash+1, '/')) != 0) { | |
1007 | *slash = 0; | |
1008 | send_file_name(f, flist, fname, 0, 0); | |
1009 | *slash = '/'; | |
649d65ed | 1010 | } |
2154309a WD |
1011 | copy_links = copy_links_saved; |
1012 | recurse = recurse_saved; | |
1013 | *p = 0; | |
1014 | strlcpy(lastpath, fname, sizeof lastpath); | |
649d65ed AT |
1015 | *p = '/'; |
1016 | } | |
1017 | } | |
ebed4c3a | 1018 | |
649d65ed AT |
1019 | if (!*fname) |
1020 | fname = "."; | |
ebed4c3a | 1021 | |
649d65ed | 1022 | if (dir && *dir) { |
2bca43f6 | 1023 | olddir = push_dir(dir, 1); |
5243c216 AT |
1024 | |
1025 | if (!olddir) { | |
ebed4c3a MP |
1026 | io_error = 1; |
1027 | rprintf(FERROR, "push_dir %s : %s\n", | |
1028 | dir, strerror(errno)); | |
649d65ed AT |
1029 | continue; |
1030 | } | |
5243c216 | 1031 | |
649d65ed | 1032 | flist_dir = dir; |
2bca43f6 | 1033 | } |
ebed4c3a | 1034 | |
2bca43f6 DD |
1035 | if (one_file_system) |
1036 | set_filesystem(fname); | |
1037 | ||
ebed4c3a | 1038 | send_file_name(f, flist, fname, recurse, FLAG_DELETE); |
2bca43f6 DD |
1039 | |
1040 | if (olddir != NULL) { | |
649d65ed | 1041 | flist_dir = NULL; |
5243c216 | 1042 | if (pop_dir(olddir) != 0) { |
ebed4c3a MP |
1043 | rprintf(FERROR, "pop_dir %s : %s\n", |
1044 | dir, strerror(errno)); | |
65417579 | 1045 | exit_cleanup(RERR_FILESELECT); |
649d65ed | 1046 | } |
649d65ed | 1047 | } |
649d65ed | 1048 | } |
dc5ddbcc | 1049 | |
649d65ed | 1050 | if (f != -1) { |
ebed4c3a | 1051 | send_file_entry(NULL, f, 0); |
649d65ed | 1052 | } |
c627d613 | 1053 | |
b23c2906 | 1054 | if (show_filelist_p() && f != -1) { |
1bbd10fe | 1055 | finish_filelist_progress(flist); |
b23c2906 | 1056 | } |
ebed4c3a | 1057 | |
827c37f6 | 1058 | clean_flist(flist, 0, 0); |
ebed4c3a | 1059 | |
649d65ed | 1060 | /* now send the uid/gid list. This was introduced in protocol |
ebed4c3a | 1061 | version 15 */ |
bc63ae3f | 1062 | if (f != -1) { |
649d65ed AT |
1063 | send_uid_list(f); |
1064 | } | |
f6c34742 | 1065 | |
91c4da3f S |
1066 | /* send the io_error flag */ |
1067 | if (f != -1) { | |
cda2ae84 | 1068 | extern int module_id; |
ebed4c3a | 1069 | write_int(f, lp_ignore_errors(module_id) ? 0 : io_error); |
6ba9279f AT |
1070 | } |
1071 | ||
d6dead6b | 1072 | if (f != -1) { |
a261989c | 1073 | io_end_buffering(); |
a800434a AT |
1074 | stats.flist_size = stats.total_written - start_write; |
1075 | stats.num_files = flist->count; | |
ebed4c3a MP |
1076 | if (write_batch) /* dw */ |
1077 | write_batch_flist_info(flist->count, flist->files); | |
d6dead6b AT |
1078 | } |
1079 | ||
17faa41c | 1080 | if (verbose > 2) |
ebed4c3a | 1081 | rprintf(FINFO, "send_file_list done\n"); |
17faa41c | 1082 | |
649d65ed | 1083 | return flist; |
c627d613 AT |
1084 | } |
1085 | ||
1086 | ||
1087 | struct file_list *recv_file_list(int f) | |
1088 | { | |
ebed4c3a MP |
1089 | struct file_list *flist; |
1090 | unsigned char flags; | |
1091 | int64 start_read; | |
1092 | extern int list_only; | |
c627d613 | 1093 | |
1bbd10fe DD |
1094 | if (show_filelist_p()) |
1095 | start_filelist_progress("receiving file list"); | |
c627d613 | 1096 | |
ebed4c3a | 1097 | start_read = stats.total_read; |
a800434a | 1098 | |
ebed4c3a MP |
1099 | flist = (struct file_list *) malloc(sizeof(flist[0])); |
1100 | if (!flist) | |
1101 | goto oom; | |
c627d613 | 1102 | |
ebed4c3a MP |
1103 | flist->count = 0; |
1104 | flist->malloced = 1000; | |
1105 | flist->files = | |
1106 | (struct file_struct **) malloc(sizeof(flist->files[0]) * | |
1107 | flist->malloced); | |
1108 | if (!flist->files) | |
1109 | goto oom; | |
c627d613 AT |
1110 | |
1111 | ||
ebed4c3a | 1112 | for (flags = read_byte(f); flags; flags = read_byte(f)) { |
5d2c5c4c | 1113 | int i = flist->count; |
dbda5fbf | 1114 | |
d9d6bc52 | 1115 | flist_expand(flist); |
c627d613 | 1116 | |
ebed4c3a | 1117 | receive_file_entry(&flist->files[i], flags, f); |
c627d613 | 1118 | |
ebed4c3a MP |
1119 | if (S_ISREG(flist->files[i]->mode)) |
1120 | stats.total_size += flist->files[i]->length; | |
c627d613 | 1121 | |
ebed4c3a | 1122 | flist->count++; |
c627d613 | 1123 | |
db719fb0 | 1124 | maybe_emit_filelist_progress(flist); |
1bbd10fe | 1125 | |
ebed4c3a MP |
1126 | if (verbose > 2) |
1127 | rprintf(FINFO, "recv_file_name(%s)\n", | |
1128 | f_name(flist->files[i])); | |
1129 | } | |
c627d613 AT |
1130 | |
1131 | ||
ebed4c3a MP |
1132 | if (verbose > 2) |
1133 | rprintf(FINFO, "received %d names\n", flist->count); | |
c627d613 | 1134 | |
827c37f6 | 1135 | clean_flist(flist, relative_paths, 1); |
c627d613 | 1136 | |
1bbd10fe DD |
1137 | if (show_filelist_p()) { |
1138 | finish_filelist_progress(flist); | |
ebed4c3a | 1139 | } |
a06d19e3 | 1140 | |
ebed4c3a | 1141 | /* now recv the uid/gid list. This was introduced in protocol version 15 */ |
bc63ae3f | 1142 | if (f != -1) { |
ebed4c3a MP |
1143 | recv_uid_list(f, flist); |
1144 | } | |
f6c34742 | 1145 | |
91c4da3f S |
1146 | /* recv the io_error flag */ |
1147 | if (f != -1 && !read_batch) { /* dw-added readbatch */ | |
ebed4c3a MP |
1148 | extern int module_id; |
1149 | extern int ignore_errors; | |
1150 | if (lp_ignore_errors(module_id) || ignore_errors) { | |
1151 | read_int(f); | |
1152 | } else { | |
1153 | io_error |= read_int(f); | |
1154 | } | |
1155 | } | |
6ba9279f | 1156 | |
ebed4c3a MP |
1157 | if (list_only) { |
1158 | int i; | |
1159 | for (i = 0; i < flist->count; i++) { | |
1160 | list_file_entry(flist->files[i]); | |
1161 | } | |
1162 | } | |
f7632fc6 AT |
1163 | |
1164 | ||
ebed4c3a MP |
1165 | if (verbose > 2) |
1166 | rprintf(FINFO, "recv_file_list done\n"); | |
17faa41c | 1167 | |
ebed4c3a MP |
1168 | stats.flist_size = stats.total_read - start_read; |
1169 | stats.num_files = flist->count; | |
a800434a | 1170 | |
ebed4c3a | 1171 | return flist; |
c627d613 | 1172 | |
ebed4c3a MP |
1173 | oom: |
1174 | out_of_memory("recv_file_list"); | |
1175 | return NULL; /* not reached */ | |
c627d613 AT |
1176 | } |
1177 | ||
1178 | ||
e03dfae5 MP |
1179 | /* |
1180 | * XXX: This is currently the hottest function while building the file | |
1181 | * list, because building f_name()s every time is expensive. | |
1182 | **/ | |
ebed4c3a | 1183 | int file_compare(struct file_struct **f1, struct file_struct **f2) |
c627d613 | 1184 | { |
ebed4c3a MP |
1185 | if (!(*f1)->basename && !(*f2)->basename) |
1186 | return 0; | |
1187 | if (!(*f1)->basename) | |
1188 | return -1; | |
1189 | if (!(*f2)->basename) | |
1190 | return 1; | |
3ec4dd97 | 1191 | if ((*f1)->dirname == (*f2)->dirname) |
aa9b77a5 | 1192 | return u_strcmp((*f1)->basename, (*f2)->basename); |
ebed4c3a | 1193 | return u_strcmp(f_name(*f1), f_name(*f2)); |
c627d613 AT |
1194 | } |
1195 | ||
1196 | ||
ebed4c3a | 1197 | int flist_find(struct file_list *flist, struct file_struct *f) |
c627d613 | 1198 | { |
ebed4c3a | 1199 | int low = 0, high = flist->count - 1; |
d966ee25 | 1200 | |
ca23c51a WD |
1201 | while (high >= 0 && !flist->files[high]->basename) high--; |
1202 | ||
1203 | if (high < 0) | |
ebed4c3a | 1204 | return -1; |
d966ee25 AT |
1205 | |
1206 | while (low != high) { | |
ebed4c3a MP |
1207 | int mid = (low + high) / 2; |
1208 | int ret = | |
1209 | file_compare(&flist->files[flist_up(flist, mid)], &f); | |
1210 | if (ret == 0) | |
1211 | return flist_up(flist, mid); | |
d966ee25 | 1212 | if (ret > 0) { |
ebed4c3a | 1213 | high = mid; |
d966ee25 | 1214 | } else { |
ebed4c3a | 1215 | low = mid + 1; |
d966ee25 AT |
1216 | } |
1217 | } | |
1218 | ||
ebed4c3a MP |
1219 | if (file_compare(&flist->files[flist_up(flist, low)], &f) == 0) |
1220 | return flist_up(flist, low); | |
d966ee25 | 1221 | return -1; |
c627d613 AT |
1222 | } |
1223 | ||
1224 | ||
3ec4dd97 AT |
1225 | /* |
1226 | * free up one file | |
1227 | */ | |
66203a98 | 1228 | void free_file(struct file_struct *file) |
c627d613 | 1229 | { |
ebed4c3a MP |
1230 | if (!file) |
1231 | return; | |
1232 | if (file->basename) | |
1233 | free(file->basename); | |
1234 | if (file->link) | |
1235 | free(file->link); | |
1236 | if (file->sum) | |
1237 | free(file->sum); | |
3d382777 | 1238 | *file = null_file; |
3ec4dd97 | 1239 | } |
c627d613 | 1240 | |
c627d613 | 1241 | |
3d382777 AT |
1242 | /* |
1243 | * allocate a new file list | |
1244 | */ | |
1e34e4b7 | 1245 | struct file_list *flist_new(void) |
3d382777 AT |
1246 | { |
1247 | struct file_list *flist; | |
1248 | ||
ebed4c3a MP |
1249 | flist = (struct file_list *) malloc(sizeof(flist[0])); |
1250 | if (!flist) | |
1251 | out_of_memory("send_file_list"); | |
3d382777 | 1252 | |
ebed4c3a | 1253 | flist->count = 0; |
d9d6bc52 MP |
1254 | flist->malloced = 0; |
1255 | flist->files = NULL; | |
1256 | ||
3d382777 AT |
1257 | #if ARENA_SIZE > 0 |
1258 | flist->string_area = string_area_new(0); | |
1259 | #else | |
5c66303a | 1260 | flist->string_area = NULL; |
3d382777 AT |
1261 | #endif |
1262 | return flist; | |
1263 | } | |
ebed4c3a | 1264 | |
3ec4dd97 AT |
1265 | /* |
1266 | * free up all elements in a flist | |
1267 | */ | |
1268 | void flist_free(struct file_list *flist) | |
1269 | { | |
1270 | int i; | |
ebed4c3a | 1271 | for (i = 1; i < flist->count; i++) { |
3d382777 AT |
1272 | if (!flist->string_area) |
1273 | free_file(flist->files[i]); | |
649d65ed | 1274 | free(flist->files[i]); |
ebed4c3a | 1275 | } |
d9d6bc52 MP |
1276 | /* FIXME: I don't think we generally need to blank the flist |
1277 | * since it's about to be freed. This will just cause more | |
1278 | * memory traffic. If you want a freed-memory debugger, you | |
1279 | * know where to get it. */ | |
ebed4c3a MP |
1280 | memset((char *) flist->files, 0, |
1281 | sizeof(flist->files[0]) * flist->count); | |
3ec4dd97 | 1282 | free(flist->files); |
3d382777 AT |
1283 | if (flist->string_area) |
1284 | string_area_free(flist->string_area); | |
ebed4c3a | 1285 | memset((char *) flist, 0, sizeof(*flist)); |
3ec4dd97 | 1286 | free(flist); |
c627d613 AT |
1287 | } |
1288 | ||
1289 | ||
1290 | /* | |
1291 | * This routine ensures we don't have any duplicate names in our file list. | |
dbda5fbf | 1292 | * duplicate names can cause corruption because of the pipelining |
c627d613 | 1293 | */ |
827c37f6 | 1294 | static void clean_flist(struct file_list *flist, int strip_root, int no_dups) |
c627d613 | 1295 | { |
6931c138 | 1296 | int i, prev_i = 0; |
b91b50c0 | 1297 | char *name, *prev_name = NULL; |
c627d613 | 1298 | |
ebed4c3a | 1299 | if (!flist || flist->count == 0) |
3ec4dd97 | 1300 | return; |
3ec4dd97 | 1301 | |
ebed4c3a MP |
1302 | qsort(flist->files, flist->count, |
1303 | sizeof(flist->files[0]), (int (*)()) file_compare); | |
1304 | ||
827c37f6 | 1305 | for (i = no_dups? 0 : flist->count; i < flist->count; i++) { |
b91b50c0 | 1306 | if (flist->files[i]->basename) { |
6931c138 | 1307 | prev_i = i; |
b91b50c0 WD |
1308 | prev_name = f_name(flist->files[i]); |
1309 | break; | |
1310 | } | |
1311 | } | |
1312 | while (++i < flist->count) { | |
1313 | if (!flist->files[i]->basename) | |
1314 | continue; | |
1315 | name = f_name(flist->files[i]); | |
1316 | if (strcmp(name, prev_name) == 0) { | |
1317 | if (verbose > 1 && !am_server) { | |
ebed4c3a MP |
1318 | rprintf(FINFO, |
1319 | "removing duplicate name %s from file list %d\n", | |
b91b50c0 WD |
1320 | name, i); |
1321 | } | |
6931c138 WD |
1322 | /* Make sure that if we unduplicate '.', that we don't |
1323 | * lose track of a user-specified starting point (or | |
1324 | * else deletions will mysteriously fail with -R). */ | |
1325 | if (flist->files[i]->flags & FLAG_DELETE) | |
1326 | flist->files[prev_i]->flags |= FLAG_DELETE; | |
b91b50c0 WD |
1327 | /* it's not great that the flist knows the semantics of |
1328 | * the file memory usage, but i'd rather not add a flag | |
1329 | * byte to that struct. | |
1330 | * XXX can i use a bit in the flags field? */ | |
3d382777 AT |
1331 | if (flist->string_area) |
1332 | flist->files[i][0] = null_file; | |
1333 | else | |
1334 | free_file(flist->files[i]); | |
ebed4c3a | 1335 | } |
6931c138 WD |
1336 | else |
1337 | prev_i = i; | |
1338 | /* We set prev_name every iteration to avoid it becoming | |
1339 | * invalid when names[][] in f_name() wraps around. */ | |
b91b50c0 | 1340 | prev_name = name; |
3ec4dd97 | 1341 | } |
0199b05f AT |
1342 | |
1343 | if (strip_root) { | |
1344 | /* we need to strip off the root directory in the case | |
1345 | of relative paths, but this must be done _after_ | |
1346 | the sorting phase */ | |
ebed4c3a | 1347 | for (i = 0; i < flist->count; i++) { |
0199b05f AT |
1348 | if (flist->files[i]->dirname && |
1349 | flist->files[i]->dirname[0] == '/') { | |
1350 | memmove(&flist->files[i]->dirname[0], | |
1351 | &flist->files[i]->dirname[1], | |
1352 | strlen(flist->files[i]->dirname)); | |
1353 | } | |
ebed4c3a MP |
1354 | |
1355 | if (flist->files[i]->dirname && | |
0199b05f AT |
1356 | !flist->files[i]->dirname[0]) { |
1357 | flist->files[i]->dirname = NULL; | |
1358 | } | |
1359 | } | |
1360 | } | |
1361 | ||
ebed4c3a MP |
1362 | if (verbose <= 3) |
1363 | return; | |
0199b05f | 1364 | |
ebed4c3a MP |
1365 | for (i = 0; i < flist->count; i++) { |
1366 | rprintf(FINFO, "[%d] i=%d %s %s mode=0%o len=%.0f\n", | |
1367 | (int) getpid(), i, | |
74e708d8 AT |
1368 | NS(flist->files[i]->dirname), |
1369 | NS(flist->files[i]->basename), | |
08a740ff | 1370 | (int) flist->files[i]->mode, |
ebed4c3a | 1371 | (double) flist->files[i]->length); |
0199b05f | 1372 | } |
3ec4dd97 AT |
1373 | } |
1374 | ||
1375 | ||
1376 | /* | |
1377 | * return the full filename of a flist entry | |
e03dfae5 MP |
1378 | * |
1379 | * This function is too expensive at the moment, because it copies | |
1380 | * strings when often we only want to compare them. In any case, | |
1381 | * using strlcat is silly because it will walk the string repeatedly. | |
3ec4dd97 AT |
1382 | */ |
1383 | char *f_name(struct file_struct *f) | |
1384 | { | |
1385 | static char names[10][MAXPATHLEN]; | |
1386 | static int n; | |
1387 | char *p = names[n]; | |
1388 | ||
ebed4c3a MP |
1389 | if (!f || !f->basename) |
1390 | return NULL; | |
3ec4dd97 | 1391 | |
ebed4c3a | 1392 | n = (n + 1) % 10; |
3ec4dd97 AT |
1393 | |
1394 | if (f->dirname) { | |
e03dfae5 MP |
1395 | int off; |
1396 | ||
1397 | off = strlcpy(p, f->dirname, MAXPATHLEN); | |
ebed4c3a MP |
1398 | off += strlcpy(p + off, "/", MAXPATHLEN - off); |
1399 | off += strlcpy(p + off, f->basename, MAXPATHLEN - off); | |
3ec4dd97 | 1400 | } else { |
37f9805d | 1401 | strlcpy(p, f->basename, MAXPATHLEN); |
3ec4dd97 AT |
1402 | } |
1403 | ||
1404 | return p; | |
c627d613 | 1405 | } |