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