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