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) { |
1bbd10fe | 345 | rprintf(FINFO, "expand file_list to %.0f bytes, did%s move\n", |
58cadc86 WD |
346 | (double)sizeof(flist->files[0]) |
347 | * flist->malloced, | |
2e7d1994 MP |
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 | ||
7b1a0c19 | 358 | void send_file_entry(struct file_struct *file, int f, unsigned short base_flags) |
c627d613 | 359 | { |
1ef00d20 | 360 | unsigned short flags; |
5911fee5 WD |
361 | static time_t modtime; |
362 | static mode_t mode; | |
363 | static DEV64_T rdev; /* just high bytes in p28 onward */ | |
364 | static DEV64_T dev; | |
365 | static uid_t uid; | |
366 | static gid_t gid; | |
367 | static char lastname[MAXPATHLEN]; | |
b7736c79 | 368 | char *fname, fbuf[MAXPATHLEN]; |
ebed4c3a | 369 | int l1, l2; |
72914a60 | 370 | |
ebed4c3a MP |
371 | if (f == -1) |
372 | return; | |
72914a60 AT |
373 | |
374 | if (!file) { | |
ebed4c3a | 375 | write_byte(f, 0); |
5911fee5 WD |
376 | modtime = 0, mode = 0; |
377 | rdev = 0, dev = 0; | |
378 | uid = 0, gid = 0; | |
379 | *lastname = '\0'; | |
72914a60 AT |
380 | return; |
381 | } | |
382 | ||
eca2adb4 MP |
383 | io_write_phase = "send_file_entry"; |
384 | ||
882e6893 | 385 | fname = f_name_to(file, fbuf); |
72914a60 AT |
386 | |
387 | flags = base_flags; | |
388 | ||
30f337c9 | 389 | if (file->mode == mode) |
d01d15e0 | 390 | flags |= XMIT_SAME_MODE; |
1ef00d20 | 391 | else |
30f337c9 | 392 | mode = file->mode; |
75bc8600 WD |
393 | if (preserve_devices) { |
394 | if (protocol_version < 28) { | |
728d0922 WD |
395 | if (IS_DEVICE(mode)) { |
396 | if (file->u.rdev == rdev) { | |
d01d15e0 WD |
397 | /* Set both flags to simplify the test |
398 | * when writing the data. */ | |
399 | flags |= XMIT_SAME_RDEV_pre28 | |
400 | | XMIT_SAME_HIGH_RDEV; | |
728d0922 WD |
401 | } else |
402 | rdev = file->u.rdev; | |
403 | } else | |
404 | rdev = 0; | |
405 | } else if (IS_DEVICE(mode)) { | |
406 | if ((file->u.rdev & ~0xFF) == rdev) | |
d01d15e0 | 407 | flags |= XMIT_SAME_HIGH_RDEV; |
30f337c9 | 408 | else |
728d0922 | 409 | rdev = file->u.rdev & ~0xFF; |
75bc8600 WD |
410 | } |
411 | } | |
30f337c9 | 412 | if (file->uid == uid) |
d01d15e0 | 413 | flags |= XMIT_SAME_UID; |
1ef00d20 | 414 | else |
30f337c9 WD |
415 | uid = file->uid; |
416 | if (file->gid == gid) | |
d01d15e0 | 417 | flags |= XMIT_SAME_GID; |
1ef00d20 | 418 | else |
30f337c9 WD |
419 | gid = file->gid; |
420 | if (file->modtime == modtime) | |
d01d15e0 | 421 | flags |= XMIT_SAME_TIME; |
1ef00d20 | 422 | else |
30f337c9 | 423 | modtime = file->modtime; |
92cc9dd7 WD |
424 | if (file->link_u.idev) { |
425 | if (file->F_DEV == dev) { | |
c4b4df4f | 426 | if (protocol_version >= 28) |
d01d15e0 | 427 | flags |= XMIT_SAME_DEV; |
728d0922 | 428 | } else |
92cc9dd7 | 429 | dev = file->F_DEV; |
d01d15e0 | 430 | flags |= XMIT_HAS_IDEV_DATA; |
c4b4df4f | 431 | } |
ebed4c3a MP |
432 | |
433 | for (l1 = 0; | |
434 | lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255); | |
dbda5fbf | 435 | l1++) {} |
eddd5d12 | 436 | l2 = strlen(fname+l1); |
72914a60 | 437 | |
ebed4c3a | 438 | if (l1 > 0) |
d01d15e0 | 439 | flags |= XMIT_SAME_NAME; |
ebed4c3a | 440 | if (l2 > 255) |
d01d15e0 | 441 | flags |= XMIT_LONG_NAME; |
72914a60 | 442 | |
75bc8600 WD |
443 | /* We must make sure we don't send a zero flags byte or |
444 | * the other end will terminate the flist transfer. */ | |
30f337c9 | 445 | if (flags == 0 && !S_ISDIR(mode)) |
9e4c32ea | 446 | flags |= XMIT_TOP_DIR; /* NOTE: no meaning for non-dir */ |
75bc8600 WD |
447 | if (protocol_version >= 28) { |
448 | if ((flags & 0xFF00) || flags == 0) { | |
d01d15e0 | 449 | flags |= XMIT_EXTENDED_FLAGS; |
75bc8600 WD |
450 | write_byte(f, flags); |
451 | write_byte(f, flags >> 8); | |
452 | } else | |
453 | write_byte(f, flags); | |
454 | } else { | |
455 | if (flags == 0) | |
d01d15e0 | 456 | flags |= XMIT_LONG_NAME; |
75bc8600 WD |
457 | write_byte(f, flags); |
458 | } | |
d01d15e0 | 459 | if (flags & XMIT_SAME_NAME) |
ebed4c3a | 460 | write_byte(f, l1); |
d01d15e0 | 461 | if (flags & XMIT_LONG_NAME) |
ebed4c3a | 462 | write_int(f, l2); |
72914a60 | 463 | else |
ebed4c3a MP |
464 | write_byte(f, l2); |
465 | write_buf(f, fname + l1, l2); | |
72914a60 | 466 | |
ebed4c3a | 467 | write_longint(f, file->length); |
d01d15e0 | 468 | if (!(flags & XMIT_SAME_TIME)) |
30f337c9 | 469 | write_int(f, modtime); |
d01d15e0 | 470 | if (!(flags & XMIT_SAME_MODE)) |
30f337c9 | 471 | write_int(f, to_wire_mode(mode)); |
d01d15e0 | 472 | if (preserve_uid && !(flags & XMIT_SAME_UID)) { |
30f337c9 WD |
473 | add_uid(uid); |
474 | write_int(f, uid); | |
72914a60 | 475 | } |
d01d15e0 | 476 | if (preserve_gid && !(flags & XMIT_SAME_GID)) { |
30f337c9 WD |
477 | add_gid(gid); |
478 | write_int(f, gid); | |
72914a60 | 479 | } |
30f337c9 | 480 | if (preserve_devices && IS_DEVICE(mode)) { |
d01d15e0 WD |
481 | /* If XMIT_SAME_HIGH_RDEV is off, XMIT_SAME_RDEV_pre28 is |
482 | * also off. Also, avoid using "rdev" because it may be | |
483 | * incomplete. */ | |
484 | if (!(flags & XMIT_SAME_HIGH_RDEV)) | |
728d0922 | 485 | write_int(f, file->u.rdev); |
75bc8600 | 486 | else if (protocol_version >= 28) |
728d0922 | 487 | write_byte(f, file->u.rdev); |
75bc8600 | 488 | } |
c627d613 AT |
489 | |
490 | #if SUPPORT_LINKS | |
30f337c9 | 491 | if (preserve_links && S_ISLNK(mode)) { |
728d0922 WD |
492 | write_int(f, strlen(file->u.link)); |
493 | write_buf(f, file->u.link, strlen(file->u.link)); | |
72914a60 | 494 | } |
c627d613 AT |
495 | #endif |
496 | ||
dc5ddbcc | 497 | #if SUPPORT_HARD_LINKS |
d01d15e0 | 498 | if (flags & XMIT_HAS_IDEV_DATA) { |
d04e9c51 | 499 | if (protocol_version < 26) { |
736a6a29 | 500 | /* 32-bit dev_t and ino_t */ |
30f337c9 | 501 | write_int(f, dev); |
92cc9dd7 | 502 | write_int(f, file->F_INODE); |
736a6a29 MP |
503 | } else { |
504 | /* 64-bit dev_t and ino_t */ | |
d01d15e0 | 505 | if (!(flags & XMIT_SAME_DEV)) |
30f337c9 | 506 | write_longint(f, dev); |
92cc9dd7 | 507 | write_longint(f, file->F_INODE); |
736a6a29 | 508 | } |
72914a60 | 509 | } |
dc5ddbcc AT |
510 | #endif |
511 | ||
728d0922 WD |
512 | if (always_checksum) { |
513 | char *sum; | |
514 | if (S_ISREG(mode)) | |
515 | sum = file->u.sum; | |
516 | else if (protocol_version < 28) { | |
517 | /* Prior to 28, we sent a useless set of nulls. */ | |
518 | sum = empty_sum; | |
519 | } else | |
520 | sum = NULL; | |
521 | if (sum) { | |
522 | write_buf(f, sum, protocol_version < 21? 2 | |
523 | : MD4_SUM_LENGTH); | |
524 | } | |
ebed4c3a | 525 | } |
182dca5c | 526 | |
ebed4c3a | 527 | strlcpy(lastname, fname, MAXPATHLEN); |
eca2adb4 MP |
528 | |
529 | io_write_phase = "unknown"; | |
182dca5c AT |
530 | } |
531 | ||
532 | ||
533 | ||
7b1a0c19 | 534 | void receive_file_entry(struct file_struct **fptr, unsigned short flags, int f) |
182dca5c | 535 | { |
5911fee5 WD |
536 | static time_t modtime; |
537 | static mode_t mode; | |
538 | static DEV64_T rdev; /* just high bytes in p28 onward */ | |
539 | static DEV64_T dev; | |
540 | static uid_t uid; | |
541 | static gid_t gid; | |
542 | static char lastname[MAXPATHLEN]; | |
72914a60 | 543 | char thisname[MAXPATHLEN]; |
ebed4c3a | 544 | unsigned int l1 = 0, l2 = 0; |
72914a60 AT |
545 | char *p; |
546 | struct file_struct *file; | |
547 | ||
5911fee5 WD |
548 | if (!fptr) { |
549 | modtime = 0, mode = 0; | |
550 | rdev = 0, dev = 0; | |
551 | uid = 0, gid = 0; | |
552 | *lastname = '\0'; | |
553 | return; | |
554 | } | |
555 | ||
d01d15e0 | 556 | if (flags & XMIT_SAME_NAME) |
72914a60 | 557 | l1 = read_byte(f); |
ebed4c3a | 558 | |
d01d15e0 | 559 | if (flags & XMIT_LONG_NAME) |
72914a60 AT |
560 | l2 = read_int(f); |
561 | else | |
562 | l2 = read_byte(f); | |
563 | ||
58cadc86 | 564 | file = new(struct file_struct); |
ebed4c3a MP |
565 | if (!file) |
566 | out_of_memory("receive_file_entry"); | |
567 | memset((char *) file, 0, sizeof(*file)); | |
72914a60 AT |
568 | (*fptr) = file; |
569 | ||
ebed4c3a MP |
570 | if (l2 >= MAXPATHLEN - l1) { |
571 | rprintf(FERROR, | |
572 | "overflow: flags=0x%x l1=%d l2=%d lastname=%s\n", | |
d0fd26aa AT |
573 | flags, l1, l2, lastname); |
574 | overflow("receive_file_entry"); | |
575 | } | |
72914a60 | 576 | |
ebed4c3a MP |
577 | strlcpy(thisname, lastname, l1 + 1); |
578 | read_sbuf(f, &thisname[l1], l2); | |
579 | thisname[l1 + l2] = 0; | |
72914a60 | 580 | |
ebed4c3a MP |
581 | strlcpy(lastname, thisname, MAXPATHLEN); |
582 | lastname[MAXPATHLEN - 1] = 0; | |
72914a60 AT |
583 | |
584 | clean_fname(thisname); | |
585 | ||
cb13abfe DD |
586 | if (sanitize_paths) { |
587 | sanitize_path(thisname, NULL); | |
588 | } | |
589 | ||
ebed4c3a | 590 | if ((p = strrchr(thisname, '/'))) { |
72914a60 AT |
591 | static char *lastdir; |
592 | *p = 0; | |
b7736c79 | 593 | if (lastdir && strcmp(thisname, lastdir) == 0) |
72914a60 | 594 | file->dirname = lastdir; |
b7736c79 | 595 | else { |
72914a60 AT |
596 | file->dirname = strdup(thisname); |
597 | lastdir = file->dirname; | |
598 | } | |
ebed4c3a | 599 | file->basename = strdup(p + 1); |
72914a60 AT |
600 | } else { |
601 | file->dirname = NULL; | |
602 | file->basename = strdup(thisname); | |
603 | } | |
604 | ||
ebed4c3a MP |
605 | if (!file->basename) |
606 | out_of_memory("receive_file_entry 1"); | |
72914a60 | 607 | |
d01d15e0 | 608 | file->flags = flags & XMIT_TOP_DIR ? FLAG_TOP_DIR : 0; |
72914a60 | 609 | file->length = read_longint(f); |
d01d15e0 | 610 | if (!(flags & XMIT_SAME_TIME)) |
30f337c9 WD |
611 | modtime = (time_t)read_int(f); |
612 | file->modtime = modtime; | |
d01d15e0 | 613 | if (!(flags & XMIT_SAME_MODE)) |
30f337c9 WD |
614 | mode = from_wire_mode(read_int(f)); |
615 | file->mode = mode; | |
1ef00d20 WD |
616 | |
617 | if (preserve_uid) { | |
d01d15e0 | 618 | if (!(flags & XMIT_SAME_UID)) |
30f337c9 WD |
619 | uid = (uid_t)read_int(f); |
620 | file->uid = uid; | |
1ef00d20 WD |
621 | } |
622 | if (preserve_gid) { | |
d01d15e0 | 623 | if (!(flags & XMIT_SAME_GID)) |
30f337c9 WD |
624 | gid = (gid_t)read_int(f); |
625 | file->gid = gid; | |
1ef00d20 WD |
626 | } |
627 | if (preserve_devices) { | |
75bc8600 | 628 | if (protocol_version < 28) { |
30f337c9 | 629 | if (IS_DEVICE(mode)) { |
d01d15e0 | 630 | if (!(flags & XMIT_SAME_RDEV_pre28)) |
30f337c9 | 631 | rdev = (DEV64_T)read_int(f); |
728d0922 | 632 | file->u.rdev = rdev; |
75bc8600 | 633 | } else |
30f337c9 WD |
634 | rdev = 0; |
635 | } else if (IS_DEVICE(mode)) { | |
d01d15e0 | 636 | if (!(flags & XMIT_SAME_HIGH_RDEV)) { |
728d0922 WD |
637 | file->u.rdev = (DEV64_T)read_int(f); |
638 | rdev = file->u.rdev & ~0xFF; | |
30f337c9 | 639 | } else |
728d0922 | 640 | file->u.rdev = rdev | (DEV64_T)read_byte(f); |
1ef00d20 | 641 | } |
b7736c79 | 642 | } |
72914a60 | 643 | |
30f337c9 | 644 | if (preserve_links && S_ISLNK(mode)) { |
72914a60 | 645 | int l = read_int(f); |
9dd891bb | 646 | if (l < 0) { |
ebed4c3a | 647 | rprintf(FERROR, "overflow: l=%d\n", l); |
9dd891bb MP |
648 | overflow("receive_file_entry"); |
649 | } | |
728d0922 | 650 | if (!(file->u.link = new_array(char, l + 1))) |
ebed4c3a | 651 | out_of_memory("receive_file_entry 2"); |
728d0922 | 652 | read_sbuf(f, file->u.link, l); |
b7736c79 | 653 | if (sanitize_paths) |
728d0922 | 654 | sanitize_path(file->u.link, file->dirname); |
72914a60 | 655 | } |
dc5ddbcc | 656 | #if SUPPORT_HARD_LINKS |
92cc9dd7 | 657 | if (preserve_hard_links && protocol_version < 28 && S_ISREG(mode)) |
d01d15e0 WD |
658 | flags |= XMIT_HAS_IDEV_DATA; |
659 | if (flags & XMIT_HAS_IDEV_DATA) { | |
92cc9dd7 WD |
660 | if (!(file->link_u.idev = new(struct idev))) |
661 | out_of_memory("file inode data"); | |
d04e9c51 | 662 | if (protocol_version < 26) { |
30f337c9 | 663 | dev = read_int(f); |
92cc9dd7 | 664 | file->F_INODE = read_int(f); |
736a6a29 | 665 | } else { |
d01d15e0 | 666 | if (!(flags & XMIT_SAME_DEV)) |
30f337c9 | 667 | dev = read_longint(f); |
92cc9dd7 | 668 | file->F_INODE = read_longint(f); |
736a6a29 | 669 | } |
92cc9dd7 | 670 | file->F_DEV = dev; |
72914a60 | 671 | } |
dc5ddbcc | 672 | #endif |
ebed4c3a | 673 | |
72914a60 | 674 | if (always_checksum) { |
7c4f063b | 675 | char *sum; |
fea4db62 | 676 | if (S_ISREG(mode)) { |
728d0922 | 677 | sum = file->u.sum = new_array(char, MD4_SUM_LENGTH); |
fea4db62 WD |
678 | if (!sum) |
679 | out_of_memory("md4 sum"); | |
680 | } else if (protocol_version < 28) { | |
681 | /* Prior to 28, we get a useless set of nulls. */ | |
7c4f063b | 682 | sum = empty_sum; |
fea4db62 WD |
683 | } else |
684 | sum = NULL; | |
685 | if (sum) { | |
686 | read_buf(f, sum, protocol_version < 21? 2 | |
687 | : MD4_SUM_LENGTH); | |
688 | } | |
72914a60 | 689 | } |
ebed4c3a | 690 | |
72914a60 AT |
691 | if (!preserve_perms) { |
692 | extern int orig_umask; | |
693 | /* set an appropriate set of permissions based on original | |
fea4db62 | 694 | * permissions and umask. This emulates what GNU cp does */ |
72914a60 AT |
695 | file->mode &= ~orig_umask; |
696 | } | |
c627d613 AT |
697 | } |
698 | ||
699 | ||
3d382777 | 700 | #define STRDUP(ap, p) (ap ? string_area_strdup(ap, p) : strdup(p)) |
87a819ed MP |
701 | /* IRIX cc cares that the operands to the ternary have the same type. */ |
702 | #define MALLOC(ap, i) (ap ? (void*) string_area_malloc(ap, i) : malloc(i)) | |
3d382777 | 703 | |
db719fb0 MP |
704 | /** |
705 | * Create a file_struct for a named file by reading its stat() | |
706 | * information and performing extensive checks against global | |
707 | * options. | |
708 | * | |
709 | * @return the new file, or NULL if there was an error or this file | |
710 | * should be excluded. | |
711 | * | |
712 | * @todo There is a small optimization opportunity here to avoid | |
713 | * stat()ing the file in some circumstances, which has a certain cost. | |
714 | * We are called immediately after doing readdir(), and so we may | |
715 | * already know the d_type of the file. We could for example avoid | |
716 | * statting directories if we're not recursing, but this is not a very | |
717 | * important case. Some systems may not have d_type. | |
718 | **/ | |
429f9828 WD |
719 | struct file_struct *make_file(char *fname, struct string_area **ap, |
720 | int exclude_level) | |
c627d613 | 721 | { |
3ec4dd97 | 722 | struct file_struct *file; |
bcacc18b | 723 | STRUCT_STAT st; |
3ec4dd97 AT |
724 | char sum[SUM_LENGTH]; |
725 | char *p; | |
726 | char cleaned_name[MAXPATHLEN]; | |
b5313607 | 727 | char linkbuf[MAXPATHLEN]; |
4844449a | 728 | unsigned short flags = 0; |
3ec4dd97 | 729 | |
882e6893 WD |
730 | if (strlcpy(cleaned_name, fname, sizeof cleaned_name) |
731 | >= sizeof cleaned_name - flist_dir_len) { | |
732 | rprintf(FINFO, "skipping overly long name: %s\n", fname); | |
733 | return NULL; | |
734 | } | |
3ec4dd97 | 735 | clean_fname(cleaned_name); |
b7736c79 | 736 | if (sanitize_paths) |
cb13abfe | 737 | sanitize_path(cleaned_name, NULL); |
3ec4dd97 AT |
738 | fname = cleaned_name; |
739 | ||
ebed4c3a | 740 | memset(sum, 0, SUM_LENGTH); |
3ec4dd97 | 741 | |
ebed4c3a | 742 | if (readlink_stat(fname, &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 */ | |
429f9828 | 748 | if (check_exclude_file(fname, 0, exclude_level)) { |
76e26e10 DD |
749 | /* file is excluded anyway, ignore silently */ |
750 | return NULL; | |
751 | } | |
752 | } | |
06c28400 | 753 | io_error |= IOERR_GENERAL; |
ea42541f WD |
754 | rprintf(FERROR, "readlink %s failed: %s\n", |
755 | full_fname(fname), 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) { |
ebed4c3a | 764 | rprintf(FINFO, "skipping directory %s\n", fname); |
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 | |
429f9828 | 776 | if (check_exclude_file(fname, S_ISDIR(st.st_mode) != 0, exclude_level)) |
76e26e10 DD |
777 | return NULL; |
778 | ||
ebed4c3a | 779 | if (lp_ignore_nonreadable(module_id) && access(fname, R_OK) != 0) |
ac1a0994 AT |
780 | return NULL; |
781 | ||
ebed4c3a | 782 | skip_excludes: |
ac1a0994 | 783 | |
3ec4dd97 | 784 | if (verbose > 2) |
429f9828 | 785 | rprintf(FINFO, "make_file(%s,*,%d)\n", fname, exclude_level); |
ebed4c3a | 786 | |
58cadc86 | 787 | file = new(struct file_struct); |
ebed4c3a MP |
788 | if (!file) |
789 | out_of_memory("make_file"); | |
790 | memset((char *) file, 0, sizeof(*file)); | |
4844449a | 791 | file->flags = flags; |
3ec4dd97 | 792 | |
ebed4c3a | 793 | if ((p = strrchr(fname, '/'))) { |
3ec4dd97 AT |
794 | static char *lastdir; |
795 | *p = 0; | |
b7736c79 | 796 | if (lastdir && strcmp(fname, lastdir) == 0) |
3ec4dd97 | 797 | file->dirname = lastdir; |
b7736c79 | 798 | else { |
a20aa42a | 799 | file->dirname = strdup(fname); |
3ec4dd97 AT |
800 | lastdir = file->dirname; |
801 | } | |
ebed4c3a | 802 | file->basename = STRDUP(ap, p + 1); |
3ec4dd97 AT |
803 | *p = '/'; |
804 | } else { | |
805 | file->dirname = NULL; | |
3d382777 | 806 | file->basename = STRDUP(ap, fname); |
3ec4dd97 | 807 | } |
c627d613 | 808 | |
3ec4dd97 AT |
809 | file->modtime = st.st_mtime; |
810 | file->length = st.st_size; | |
811 | file->mode = st.st_mode; | |
812 | file->uid = st.st_uid; | |
813 | file->gid = st.st_gid; | |
c4b4df4f | 814 | if (preserve_hard_links) { |
92cc9dd7 | 815 | if (protocol_version < 28 ? S_ISREG(st.st_mode) |
c4b4df4f | 816 | : !S_ISDIR(st.st_mode) && st.st_nlink > 1) { |
92cc9dd7 WD |
817 | if (!(file->link_u.idev = new(struct idev))) |
818 | out_of_memory("file inode data"); | |
819 | file->F_DEV = st.st_dev; | |
820 | file->F_INODE = st.st_ino; | |
c4b4df4f WD |
821 | } |
822 | } | |
5f78da20 | 823 | #ifdef HAVE_STRUCT_STAT_ST_RDEV |
728d0922 WD |
824 | if (IS_DEVICE(st.st_mode)) |
825 | file->u.rdev = st.st_rdev; | |
c627d613 AT |
826 | #endif |
827 | ||
828 | #if SUPPORT_LINKS | |
b7736c79 | 829 | if (S_ISLNK(st.st_mode)) |
728d0922 | 830 | file->u.link = STRDUP(ap, linkbuf); |
c627d613 AT |
831 | #endif |
832 | ||
fea4db62 | 833 | if (always_checksum && S_ISREG(st.st_mode)) { |
728d0922 | 834 | if (!(file->u.sum = (char*)MALLOC(ap, MD4_SUM_LENGTH))) |
ebed4c3a | 835 | out_of_memory("md4 sum"); |
728d0922 | 836 | file_checksum(fname, file->u.sum, st.st_size); |
ebed4c3a | 837 | } |
c627d613 | 838 | |
882e6893 | 839 | file->basedir = flist_dir; |
c627d613 | 840 | |
3ec4dd97 | 841 | if (!S_ISDIR(st.st_mode)) |
a800434a | 842 | stats.total_size += st.st_size; |
c627d613 | 843 | |
3ec4dd97 | 844 | return file; |
c627d613 AT |
845 | } |
846 | ||
847 | ||
ebed4c3a | 848 | void send_file_name(int f, struct file_list *flist, char *fname, |
1ef00d20 | 849 | int recursive, unsigned short base_flags) |
c627d613 | 850 | { |
ebed4c3a | 851 | struct file_struct *file; |
b7736c79 | 852 | char fbuf[MAXPATHLEN]; |
429f9828 | 853 | extern int delete_excluded; |
ebed4c3a | 854 | |
429f9828 WD |
855 | /* f is set to -1 when calculating deletion file list */ |
856 | file = make_file(fname, &flist->string_area, | |
857 | f == -1 && delete_excluded? SERVER_EXCLUDES | |
858 | : ALL_EXCLUDES); | |
ebed4c3a MP |
859 | |
860 | if (!file) | |
861 | return; | |
862 | ||
db719fb0 | 863 | maybe_emit_filelist_progress(flist); |
ebed4c3a | 864 | |
d9d6bc52 | 865 | flist_expand(flist); |
ebed4c3a | 866 | |
64c3523a | 867 | if (write_batch) |
d01d15e0 | 868 | file->flags |= FLAG_TOP_DIR; |
ebed4c3a | 869 | |
c120ff37 | 870 | if (file->basename[0]) { |
ebed4c3a MP |
871 | flist->files[flist->count++] = file; |
872 | send_file_entry(file, f, base_flags); | |
873 | } | |
874 | ||
4844449a WD |
875 | if (recursive && S_ISDIR(file->mode) |
876 | && !(file->flags & FLAG_MOUNT_POINT)) { | |
d01d15e0 | 877 | struct exclude_struct **last_exclude_list = local_exclude_list; |
882e6893 | 878 | send_directory(f, flist, f_name_to(file, fbuf)); |
ebed4c3a MP |
879 | local_exclude_list = last_exclude_list; |
880 | return; | |
881 | } | |
c627d613 AT |
882 | } |
883 | ||
884 | ||
ebed4c3a | 885 | static void send_directory(int f, struct file_list *flist, char *dir) |
c627d613 | 886 | { |
3ec4dd97 AT |
887 | DIR *d; |
888 | struct dirent *di; | |
889 | char fname[MAXPATHLEN]; | |
eddd5d12 | 890 | unsigned int offset; |
3ec4dd97 AT |
891 | char *p; |
892 | ||
893 | d = opendir(dir); | |
894 | if (!d) { | |
06c28400 | 895 | io_error |= IOERR_GENERAL; |
ea42541f WD |
896 | rprintf(FERROR, "opendir %s failed: %s\n", |
897 | full_fname(dir), strerror(errno)); | |
3ec4dd97 AT |
898 | return; |
899 | } | |
c627d613 | 900 | |
eddd5d12 WD |
901 | offset = strlcpy(fname, dir, MAXPATHLEN); |
902 | p = fname + offset; | |
903 | if (offset >= MAXPATHLEN || p[-1] != '/') { | |
904 | if (offset >= MAXPATHLEN - 1) { | |
06c28400 | 905 | io_error |= IOERR_GENERAL; |
ea42541f WD |
906 | rprintf(FERROR, "skipping long-named directory: %s\n", |
907 | full_fname(fname)); | |
3ec4dd97 AT |
908 | closedir(d); |
909 | return; | |
910 | } | |
eddd5d12 WD |
911 | *p++ = '/'; |
912 | offset++; | |
3ec4dd97 | 913 | } |
c627d613 | 914 | |
3d913675 AT |
915 | local_exclude_list = NULL; |
916 | ||
3ec4dd97 | 917 | if (cvs_exclude) { |
eddd5d12 WD |
918 | if (strlcpy(p, ".cvsignore", MAXPATHLEN - offset) |
919 | < MAXPATHLEN - offset) | |
57469f6c | 920 | add_exclude_file(&local_exclude_list,fname,MISSING_OK,ADD_EXCLUDE); |
eddd5d12 | 921 | else { |
06c28400 | 922 | io_error |= IOERR_GENERAL; |
ebed4c3a MP |
923 | rprintf(FINFO, |
924 | "cannot cvs-exclude in long-named directory %s\n", | |
ea42541f | 925 | full_fname(fname)); |
3ec4dd97 | 926 | } |
ebed4c3a MP |
927 | } |
928 | ||
6a7cc46c | 929 | for (errno = 0, di = readdir(d); di; errno = 0, di = readdir(d)) { |
d6e6ecbd | 930 | char *dname = d_name(di); |
6a7cc46c S |
931 | if (dname[0] == '.' && (dname[1] == '\0' |
932 | || (dname[1] == '.' && dname[2] == '\0'))) | |
3ec4dd97 | 933 | continue; |
eddd5d12 WD |
934 | if (strlcpy(p, dname, MAXPATHLEN - offset) < MAXPATHLEN - offset) |
935 | send_file_name(f, flist, fname, recurse, 0); | |
936 | else { | |
937 | io_error |= IOERR_GENERAL; | |
938 | rprintf(FINFO, | |
939 | "cannot send long-named file %s\n", | |
940 | full_fname(fname)); | |
941 | } | |
3ec4dd97 | 942 | } |
6a7cc46c | 943 | if (errno) { |
06c28400 | 944 | io_error |= IOERR_GENERAL; |
6a7cc46c | 945 | rprintf(FERROR, "readdir(%s): (%d) %s\n", |
eddd5d12 | 946 | dir, errno, strerror(errno)); |
6a7cc46c | 947 | } |
c627d613 | 948 | |
429f9828 WD |
949 | if (local_exclude_list) |
950 | free_exclude_list(&local_exclude_list); /* Zeros pointer too */ | |
3d913675 | 951 | |
3ec4dd97 | 952 | closedir(d); |
c627d613 AT |
953 | } |
954 | ||
955 | ||
c4fea82f | 956 | /** |
429f9828 WD |
957 | * The delete_files() function in receiver.c sets f to -1 so that we just |
958 | * construct the file list in memory without sending it over the wire. It | |
959 | * also has the side-effect of ignoring user-excludes if delete_excluded | |
960 | * is set (so that the delete list includes user-excluded files). | |
c4fea82f | 961 | **/ |
ebed4c3a | 962 | struct file_list *send_file_list(int f, int argc, char *argv[]) |
c627d613 | 963 | { |
24d0fcde | 964 | int l; |
bcacc18b | 965 | STRUCT_STAT st; |
808c57c3 | 966 | char *p, *dir, olddir[sizeof curr_dir]; |
ebed4c3a | 967 | char lastpath[MAXPATHLEN] = ""; |
649d65ed | 968 | struct file_list *flist; |
a800434a | 969 | int64 start_write; |
24d0fcde | 970 | int use_ff_fd = 0; |
649d65ed | 971 | |
1bbd10fe DD |
972 | if (show_filelist_p() && f != -1) |
973 | start_filelist_progress("building file list"); | |
c627d613 | 974 | |
a800434a AT |
975 | start_write = stats.total_written; |
976 | ||
3d382777 | 977 | flist = flist_new(); |
c627d613 | 978 | |
d6dead6b | 979 | if (f != -1) { |
76c21947 | 980 | io_start_buffering_out(f); |
24d0fcde | 981 | if (filesfrom_fd >= 0) { |
808c57c3 | 982 | if (argv[0] && !push_dir(argv[0])) { |
ea42541f WD |
983 | rprintf(FERROR, "push_dir %s failed: %s\n", |
984 | full_fname(argv[0]), strerror(errno)); | |
24d0fcde WD |
985 | exit_cleanup(RERR_FILESELECT); |
986 | } | |
987 | use_ff_fd = 1; | |
988 | } | |
d6dead6b AT |
989 | } |
990 | ||
24d0fcde | 991 | while (1) { |
fc638474 DD |
992 | char fname2[MAXPATHLEN]; |
993 | char *fname = fname2; | |
c627d613 | 994 | |
24d0fcde WD |
995 | if (use_ff_fd) { |
996 | if (read_filesfrom_line(filesfrom_fd, fname) == 0) | |
997 | break; | |
998 | sanitize_path(fname, NULL); | |
999 | } else { | |
1000 | if (argc-- == 0) | |
1001 | break; | |
1002 | strlcpy(fname, *argv++, MAXPATHLEN); | |
1003 | if (sanitize_paths) | |
1004 | sanitize_path(fname, NULL); | |
1005 | } | |
c627d613 | 1006 | |
649d65ed | 1007 | l = strlen(fname); |
6931c138 WD |
1008 | if (fname[l - 1] == '/') { |
1009 | if (l == 2 && fname[0] == '.') { | |
1010 | /* Turn "./" into just "." rather than "./." */ | |
1011 | fname[1] = '\0'; | |
eddd5d12 WD |
1012 | } else if (l < MAXPATHLEN) { |
1013 | fname[l++] = '.'; | |
1014 | fname[l] = '\0'; | |
53f821f1 | 1015 | } |
649d65ed | 1016 | } |
c627d613 | 1017 | |
ebed4c3a | 1018 | if (link_stat(fname, &st) != 0) { |
f76933b1 | 1019 | if (f != -1) { |
06c28400 | 1020 | io_error |= IOERR_GENERAL; |
ea42541f WD |
1021 | rprintf(FERROR, "link_stat %s failed: %s\n", |
1022 | full_fname(fname), strerror(errno)); | |
f76933b1 | 1023 | } |
649d65ed AT |
1024 | continue; |
1025 | } | |
c627d613 | 1026 | |
24d0fcde | 1027 | if (S_ISDIR(st.st_mode) && !recurse && !files_from) { |
ebed4c3a | 1028 | rprintf(FINFO, "skipping directory %s\n", fname); |
649d65ed AT |
1029 | continue; |
1030 | } | |
c627d613 | 1031 | |
649d65ed | 1032 | dir = NULL; |
808c57c3 | 1033 | olddir[0] = '\0'; |
649d65ed AT |
1034 | |
1035 | if (!relative_paths) { | |
ebed4c3a | 1036 | p = strrchr(fname, '/'); |
649d65ed AT |
1037 | if (p) { |
1038 | *p = 0; | |
ebed4c3a | 1039 | if (p == fname) |
649d65ed AT |
1040 | dir = "/"; |
1041 | else | |
ebed4c3a MP |
1042 | dir = fname; |
1043 | fname = p + 1; | |
649d65ed | 1044 | } |
24d0fcde | 1045 | } else if (f != -1 && implied_dirs && (p=strrchr(fname,'/')) && p != fname) { |
649d65ed AT |
1046 | /* this ensures we send the intermediate directories, |
1047 | thus getting their permissions right */ | |
2154309a | 1048 | char *lp = lastpath, *fn = fname, *slash = fname; |
649d65ed | 1049 | *p = 0; |
2154309a WD |
1050 | /* Skip any initial directories in our path that we |
1051 | * have in common with lastpath. */ | |
1052 | while (*fn && *lp == *fn) { | |
1053 | if (*fn == '/') | |
1054 | slash = fn; | |
1055 | lp++, fn++; | |
1056 | } | |
1057 | *p = '/'; | |
1058 | if (fn != p || (*lp && *lp != '/')) { | |
1059 | int copy_links_saved = copy_links; | |
1060 | int recurse_saved = recurse; | |
1061 | copy_links = copy_unsafe_links; | |
1062 | /* set recurse to 1 to prevent make_file | |
1063 | * from ignoring directory, but still | |
1064 | * turn off the recursive parameter to | |
1065 | * send_file_name */ | |
1066 | recurse = 1; | |
1067 | while ((slash = strchr(slash+1, '/')) != 0) { | |
1068 | *slash = 0; | |
1069 | send_file_name(f, flist, fname, 0, 0); | |
1070 | *slash = '/'; | |
649d65ed | 1071 | } |
2154309a WD |
1072 | copy_links = copy_links_saved; |
1073 | recurse = recurse_saved; | |
1074 | *p = 0; | |
1075 | strlcpy(lastpath, fname, sizeof lastpath); | |
649d65ed AT |
1076 | *p = '/'; |
1077 | } | |
1078 | } | |
ebed4c3a | 1079 | |
649d65ed AT |
1080 | if (!*fname) |
1081 | fname = "."; | |
ebed4c3a | 1082 | |
649d65ed | 1083 | if (dir && *dir) { |
882e6893 WD |
1084 | static char *lastdir; |
1085 | static int lastdir_len; | |
1086 | ||
808c57c3 | 1087 | strcpy(olddir, curr_dir); /* can't overflow */ |
5243c216 | 1088 | |
808c57c3 | 1089 | if (!push_dir(dir)) { |
06c28400 | 1090 | io_error |= IOERR_GENERAL; |
ea42541f WD |
1091 | rprintf(FERROR, "push_dir %s failed: %s\n", |
1092 | full_fname(dir), strerror(errno)); | |
649d65ed AT |
1093 | continue; |
1094 | } | |
5243c216 | 1095 | |
882e6893 WD |
1096 | if (lastdir && strcmp(lastdir, dir) == 0) { |
1097 | flist_dir = lastdir; | |
1098 | flist_dir_len = lastdir_len; | |
1099 | } else { | |
1100 | if (lastdir) | |
1101 | free(lastdir); | |
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++) { |
1ef00d20 WD |
1419 | rprintf(FINFO, "[%ld] i=%d %s %s mode=0%o len=%.0f\n", |
1420 | (long) getpid(), i, | |
74e708d8 AT |
1421 | NS(flist->files[i]->dirname), |
1422 | NS(flist->files[i]->basename), | |
08a740ff | 1423 | (int) flist->files[i]->mode, |
ebed4c3a | 1424 | (double) flist->files[i]->length); |
0199b05f | 1425 | } |
3ec4dd97 AT |
1426 | } |
1427 | ||
1428 | ||
8018edd3 WD |
1429 | enum fnc_state { fnc_DIR, fnc_SLASH, fnc_BASE }; |
1430 | ||
1431 | /* Compare the names of two file_struct entities, just like strcmp() | |
1432 | * would do if it were operating on the joined strings. We assume | |
1433 | * that there are no 0-length strings. | |
3ec4dd97 | 1434 | */ |
8018edd3 | 1435 | int f_name_cmp(struct file_struct *f1, struct file_struct *f2) |
3ec4dd97 | 1436 | { |
8018edd3 WD |
1437 | int dif; |
1438 | const uchar *c1, *c2; | |
1ef00d20 | 1439 | enum fnc_state state1, state2; |
8018edd3 WD |
1440 | |
1441 | if (!f1 || !f1->basename) { | |
1442 | if (!f2 || !f2->basename) | |
1443 | return 0; | |
1444 | return -1; | |
1445 | } | |
1446 | if (!f2 || !f2->basename) | |
1447 | return 1; | |
1448 | ||
e90b8ace | 1449 | if (!(c1 = (uchar*)f1->dirname)) { |
8018edd3 | 1450 | state1 = fnc_BASE; |
e90b8ace | 1451 | c1 = (uchar*)f1->basename; |
728d0922 | 1452 | } else |
1ef00d20 | 1453 | state1 = fnc_DIR; |
e90b8ace | 1454 | if (!(c2 = (uchar*)f2->dirname)) { |
8018edd3 | 1455 | state2 = fnc_BASE; |
e90b8ace | 1456 | c2 = (uchar*)f2->basename; |
728d0922 | 1457 | } else |
1ef00d20 | 1458 | state2 = fnc_DIR; |
8018edd3 WD |
1459 | |
1460 | while (1) { | |
1461 | if ((dif = (int)*c1 - (int)*c2) != 0) | |
1462 | break; | |
1463 | if (!*++c1) { | |
1464 | switch (state1) { | |
1465 | case fnc_DIR: | |
1466 | state1 = fnc_SLASH; | |
e90b8ace | 1467 | c1 = (uchar*)"/"; |
8018edd3 WD |
1468 | break; |
1469 | case fnc_SLASH: | |
1470 | state1 = fnc_BASE; | |
e90b8ace | 1471 | c1 = (uchar*)f1->basename; |
8018edd3 WD |
1472 | break; |
1473 | case fnc_BASE: | |
1474 | break; | |
1475 | } | |
1476 | } | |
1477 | if (!*++c2) { | |
1478 | switch (state2) { | |
1479 | case fnc_DIR: | |
1480 | state2 = fnc_SLASH; | |
e90b8ace | 1481 | c2 = (uchar*)"/"; |
8018edd3 WD |
1482 | break; |
1483 | case fnc_SLASH: | |
1484 | state2 = fnc_BASE; | |
e90b8ace | 1485 | c2 = (uchar*)f2->basename; |
8018edd3 WD |
1486 | break; |
1487 | case fnc_BASE: | |
1488 | if (!*c1) | |
1489 | return 0; | |
1490 | break; | |
1491 | } | |
1492 | } | |
1493 | } | |
1494 | ||
1495 | return dif; | |
1496 | } | |
1497 | ||
3ec4dd97 | 1498 | |
8018edd3 | 1499 | /* Return a copy of the full filename of a flist entry, using the indicated |
882e6893 WD |
1500 | * buffer. No size-checking is done because we checked the size when creating |
1501 | * the file_struct entry. | |
8018edd3 | 1502 | */ |
882e6893 | 1503 | char *f_name_to(struct file_struct *f, char *fbuf) |
8018edd3 | 1504 | { |
ebed4c3a MP |
1505 | if (!f || !f->basename) |
1506 | return NULL; | |
3ec4dd97 | 1507 | |
3ec4dd97 | 1508 | if (f->dirname) { |
882e6893 WD |
1509 | int len = strlen(f->dirname); |
1510 | memcpy(fbuf, f->dirname, len); | |
1511 | fbuf[len] = '/'; | |
1512 | strcpy(fbuf + len + 1, f->basename); | |
8018edd3 | 1513 | } else |
882e6893 | 1514 | strcpy(fbuf, f->basename); |
b7736c79 | 1515 | return fbuf; |
8018edd3 | 1516 | } |
e03dfae5 | 1517 | |
3ec4dd97 | 1518 | |
8018edd3 WD |
1519 | /* Like f_name_to(), but we rotate through 5 static buffers of our own. |
1520 | */ | |
1521 | char *f_name(struct file_struct *f) | |
1522 | { | |
1523 | static char names[5][MAXPATHLEN]; | |
1524 | static unsigned int n; | |
1525 | ||
1526 | n = (n + 1) % (sizeof names / sizeof names[0]); | |
1527 | ||
882e6893 | 1528 | return f_name_to(f, names[n]); |
c627d613 | 1529 | } |