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