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