Moved a function.
[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;
39
40extern int cvs_exclude;
41
42extern int recurse;
43extern char curr_dir[MAXPATHLEN];
44extern char *files_from;
45extern int filesfrom_fd;
46
47extern int one_file_system;
48extern int make_backups;
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 min_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
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 min_file_struct_len = ((char*)&f.flags - (char*)&f) + 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 **/
281static void flist_expand(struct file_list *flist)
282{
283 if (flist->count >= flist->malloced) {
284 void *new_ptr;
285
286 if (flist->malloced < 1000)
287 flist->malloced += 1000;
288 else
289 flist->malloced *= 2;
290
291 if (flist->files) {
292 new_ptr = realloc_array(flist->files,
293 struct file_struct *,
294 flist->malloced);
295 } else {
296 new_ptr = new_array(struct file_struct *,
297 flist->malloced);
298 }
299
300 if (verbose >= 2) {
301 rprintf(FINFO, "[%s] expand file_list to %.0f bytes, did%s move\n",
302 who_am_i(),
303 (double) sizeof flist->files[0] * flist->malloced,
304 (new_ptr == flist->files) ? " not" : "");
305 }
306
307 flist->files = (struct file_struct **) new_ptr;
308
309 if (!flist->files)
310 out_of_memory("flist_expand");
311 }
312}
313
314void send_file_entry(struct file_struct *file, int f, unsigned short base_flags)
315{
316 unsigned short flags;
317 static time_t modtime;
318 static mode_t mode;
319 static DEV64_T rdev, rdev_high;
320 static DEV64_T dev;
321 static uid_t uid;
322 static gid_t gid;
323 static char lastname[MAXPATHLEN];
324 char *fname, fbuf[MAXPATHLEN];
325 int l1, l2;
326
327 if (f == -1)
328 return;
329
330 if (!file) {
331 write_byte(f, 0);
332 modtime = 0, mode = 0;
333 rdev = 0, rdev_high = 0, dev = 0;
334 uid = 0, gid = 0;
335 *lastname = '\0';
336 return;
337 }
338
339 io_write_phase = "send_file_entry";
340
341 fname = f_name_to(file, fbuf);
342
343 flags = base_flags;
344
345 if (file->mode == mode)
346 flags |= XMIT_SAME_MODE;
347 else
348 mode = file->mode;
349 if (preserve_devices) {
350 if (protocol_version < 28) {
351 if (IS_DEVICE(mode)) {
352 if (file->u.rdev == rdev) {
353 /* Set both flags to simplify the test
354 * when writing the data. */
355 flags |= XMIT_SAME_RDEV_pre28
356 | XMIT_SAME_HIGH_RDEV;
357 } else
358 rdev = file->u.rdev;
359 } else
360 rdev = 0;
361 } else if (IS_DEVICE(mode)) {
362 if ((file->u.rdev & ~0xFF) == rdev_high)
363 flags |= XMIT_SAME_HIGH_RDEV;
364 else {
365 rdev = file->u.rdev;
366 rdev_high = rdev & ~0xFF;
367 }
368 }
369 }
370 if (file->uid == uid)
371 flags |= XMIT_SAME_UID;
372 else
373 uid = file->uid;
374 if (file->gid == gid)
375 flags |= XMIT_SAME_GID;
376 else
377 gid = file->gid;
378 if (file->modtime == modtime)
379 flags |= XMIT_SAME_TIME;
380 else
381 modtime = file->modtime;
382
383#if SUPPORT_HARD_LINKS
384 if (file->link_u.idev) {
385 if (file->F_DEV == dev) {
386 if (protocol_version >= 28)
387 flags |= XMIT_SAME_DEV;
388 } else
389 dev = file->F_DEV;
390 flags |= XMIT_HAS_IDEV_DATA;
391 }
392#endif
393
394 for (l1 = 0;
395 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
396 l1++) {}
397 l2 = strlen(fname+l1);
398
399 if (l1 > 0)
400 flags |= XMIT_SAME_NAME;
401 if (l2 > 255)
402 flags |= XMIT_LONG_NAME;
403
404 /* We must make sure we don't send a zero flag byte or the
405 * other end will terminate the flist transfer. Note that
406 * the use of XMIT_TOP_DIR on a non-dir has no meaning, so
407 * it's harmless way to add a bit to the first flag byte. */
408 if (protocol_version >= 28) {
409 if (!flags && !S_ISDIR(mode))
410 flags |= XMIT_TOP_DIR;
411 if ((flags & 0xFF00) || !flags) {
412 flags |= XMIT_EXTENDED_FLAGS;
413 write_byte(f, flags);
414 write_byte(f, flags >> 8);
415 } else
416 write_byte(f, flags);
417 } else {
418 if (!(flags & 0xFF) && !S_ISDIR(mode))
419 flags |= XMIT_TOP_DIR;
420 if (!(flags & 0xFF))
421 flags |= XMIT_LONG_NAME;
422 write_byte(f, flags);
423 }
424 if (flags & XMIT_SAME_NAME)
425 write_byte(f, l1);
426 if (flags & XMIT_LONG_NAME)
427 write_int(f, l2);
428 else
429 write_byte(f, l2);
430 write_buf(f, fname + l1, l2);
431
432 write_longint(f, file->length);
433 if (!(flags & XMIT_SAME_TIME))
434 write_int(f, modtime);
435 if (!(flags & XMIT_SAME_MODE))
436 write_int(f, to_wire_mode(mode));
437 if (preserve_uid && !(flags & XMIT_SAME_UID)) {
438 add_uid(uid);
439 write_int(f, uid);
440 }
441 if (preserve_gid && !(flags & XMIT_SAME_GID)) {
442 add_gid(gid);
443 write_int(f, gid);
444 }
445 if (preserve_devices && IS_DEVICE(mode)) {
446 /* If XMIT_SAME_HIGH_RDEV is off, XMIT_SAME_RDEV_pre28 is
447 * also off. */
448 if (!(flags & XMIT_SAME_HIGH_RDEV))
449 write_int(f, rdev);
450 else if (protocol_version >= 28)
451 write_byte(f, rdev);
452 }
453
454#if SUPPORT_LINKS
455 if (preserve_links && S_ISLNK(mode)) {
456 int len = strlen(file->u.link);
457 write_int(f, len);
458 write_buf(f, file->u.link, len);
459 }
460#endif
461
462#if SUPPORT_HARD_LINKS
463 if (flags & XMIT_HAS_IDEV_DATA) {
464 if (protocol_version < 26) {
465 /* 32-bit dev_t and ino_t */
466 write_int(f, dev);
467 write_int(f, file->F_INODE);
468 } else {
469 /* 64-bit dev_t and ino_t */
470 if (!(flags & XMIT_SAME_DEV))
471 write_longint(f, dev);
472 write_longint(f, file->F_INODE);
473 }
474 }
475#endif
476
477 if (always_checksum) {
478 char *sum;
479 if (S_ISREG(mode))
480 sum = file->u.sum;
481 else if (protocol_version < 28) {
482 /* Prior to 28, we sent a useless set of nulls. */
483 sum = empty_sum;
484 } else
485 sum = NULL;
486 if (sum) {
487 write_buf(f, sum, protocol_version < 21? 2
488 : MD4_SUM_LENGTH);
489 }
490 }
491
492 strlcpy(lastname, fname, MAXPATHLEN);
493
494 io_write_phase = "unknown";
495}
496
497
498
499void receive_file_entry(struct file_struct **fptr, unsigned short flags, int f)
500{
501 static time_t modtime;
502 static mode_t mode;
503 static DEV64_T rdev, rdev_high;
504 static DEV64_T dev;
505 static uid_t uid;
506 static gid_t gid;
507 static char lastname[MAXPATHLEN], *lastdir;
508 static int lastdir_len = -1;
509 char thisname[MAXPATHLEN];
510 unsigned int l1 = 0, l2 = 0;
511 int alloc_len, basename_len, dirname_len, linkname_len, sum_len;
512 int file_struct_len, idev_len;
513 OFF_T file_length;
514 char *basename, *dirname, *bp;
515 struct file_struct *file;
516
517 if (!fptr) {
518 modtime = 0, mode = 0;
519 rdev = 0, rdev_high = 0, dev = 0;
520 uid = 0, gid = 0;
521 *lastname = '\0';
522 return;
523 }
524
525 if (flags & XMIT_SAME_NAME)
526 l1 = read_byte(f);
527
528 if (flags & XMIT_LONG_NAME)
529 l2 = read_int(f);
530 else
531 l2 = read_byte(f);
532
533 if (l2 >= MAXPATHLEN - l1) {
534 rprintf(FERROR,
535 "overflow: flags=0x%x l1=%d l2=%d lastname=%s\n",
536 flags, l1, l2, lastname);
537 overflow("receive_file_entry");
538 }
539
540 strlcpy(thisname, lastname, l1 + 1);
541 read_sbuf(f, &thisname[l1], l2);
542 thisname[l1 + l2] = 0;
543
544 strlcpy(lastname, thisname, MAXPATHLEN);
545
546 clean_fname(thisname);
547
548 if (sanitize_paths)
549 sanitize_path(thisname, NULL);
550
551 if ((basename = strrchr(thisname, '/')) != NULL) {
552 dirname_len = ++basename - thisname; /* counts future '\0' */
553 if (lastdir_len == dirname_len - 1
554 && strncmp(thisname, lastdir, lastdir_len) == 0) {
555 dirname = lastdir;
556 dirname_len = 0; /* indicates no copy is needed */
557 } else
558 dirname = thisname;
559 } else {
560 basename = thisname;
561 dirname = NULL;
562 dirname_len = 0;
563 }
564 basename_len = strlen(basename) + 1; /* count the '\0' */
565
566 file_length = read_longint(f);
567 if (!(flags & XMIT_SAME_TIME))
568 modtime = (time_t)read_int(f);
569 if (!(flags & XMIT_SAME_MODE))
570 mode = from_wire_mode(read_int(f));
571
572 if (preserve_uid && !(flags & XMIT_SAME_UID))
573 uid = (uid_t)read_int(f);
574 if (preserve_gid && !(flags & XMIT_SAME_GID))
575 gid = (gid_t)read_int(f);
576
577 if (preserve_devices) {
578 if (protocol_version < 28) {
579 if (IS_DEVICE(mode)) {
580 if (!(flags & XMIT_SAME_RDEV_pre28))
581 rdev = (DEV64_T)read_int(f);
582 } else
583 rdev = 0;
584 } else if (IS_DEVICE(mode)) {
585 if (!(flags & XMIT_SAME_HIGH_RDEV)) {
586 rdev = (DEV64_T)read_int(f);
587 rdev_high = rdev & ~0xFF;
588 } else
589 rdev = rdev_high | (DEV64_T)read_byte(f);
590 }
591 }
592
593#if SUPPORT_LINKS
594 if (preserve_links && S_ISLNK(mode)) {
595 linkname_len = read_int(f) + 1; /* count the '\0' */
596 if (linkname_len <= 0 || linkname_len > MAXPATHLEN) {
597 rprintf(FERROR, "overflow: linkname_len=%d\n",
598 linkname_len - 1);
599 overflow("receive_file_entry");
600 }
601 }
602 else
603#endif
604 linkname_len = 0;
605
606#if SUPPORT_HARD_LINKS
607 if (preserve_hard_links && protocol_version < 28 && S_ISREG(mode))
608 flags |= XMIT_HAS_IDEV_DATA;
609 if (flags & XMIT_HAS_IDEV_DATA)
610 idev_len = sizeof (struct idev);
611 else
612#endif
613 idev_len = 0;
614
615 sum_len = always_checksum && S_ISREG(mode) ? MD4_SUM_LENGTH : 0;
616 file_struct_len = idev_len? sizeof file[0] : min_file_struct_len;
617
618 alloc_len = file_struct_len + dirname_len + basename_len
619 + linkname_len + sum_len + idev_len;
620 if (!(bp = new_array(char, alloc_len)))
621 out_of_memory("receive_file_entry");
622 file = *fptr = (struct file_struct *)bp;
623 memset(bp, 0, min_file_struct_len);
624 bp += file_struct_len;
625
626 file->flags = flags & XMIT_TOP_DIR ? FLAG_TOP_DIR : 0;
627 file->modtime = modtime;
628 file->length = file_length;
629 file->mode = mode;
630 file->uid = uid;
631 file->gid = gid;
632
633#if SUPPORT_HARD_LINKS
634 if (idev_len) {
635 file->link_u.idev = (struct idev *)bp;
636 bp += idev_len;
637 }
638#endif
639
640 if (dirname_len) {
641 file->dirname = lastdir = bp;
642 lastdir_len = dirname_len - 1;
643 memcpy(bp, dirname, dirname_len - 1);
644 bp += dirname_len;
645 bp[-1] = '\0';
646 } else if (dirname)
647 file->dirname = dirname;
648
649 file->basename = bp;
650 memcpy(bp, basename, basename_len);
651 bp += basename_len;
652
653 if (preserve_devices && IS_DEVICE(mode))
654 file->u.rdev = rdev;
655
656#if SUPPORT_LINKS
657 if (linkname_len) {
658 file->u.link = bp;
659 read_sbuf(f, bp, linkname_len - 1);
660 if (sanitize_paths)
661 sanitize_path(bp, lastdir);
662 bp += linkname_len;
663 }
664#endif
665
666#if SUPPORT_HARD_LINKS
667 if (idev_len) {
668 if (protocol_version < 26) {
669 dev = read_int(f);
670 file->F_INODE = read_int(f);
671 } else {
672 if (!(flags & XMIT_SAME_DEV))
673 dev = read_longint(f);
674 file->F_INODE = read_longint(f);
675 }
676 file->F_DEV = dev;
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, protocol_version < 21? 2
692 : 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, int exclude_level)
721{
722 static char *lastdir;
723 static int lastdir_len = -1;
724 struct file_struct *file;
725 STRUCT_STAT st;
726 char sum[SUM_LENGTH];
727 char thisname[MAXPATHLEN];
728 char linkname[MAXPATHLEN];
729 int alloc_len, basename_len, dirname_len, linkname_len, sum_len;
730 int file_struct_len, idev_len;
731 char *basename, *dirname, *bp;
732 unsigned short flags = 0;
733
734 if (strlcpy(thisname, fname, sizeof thisname)
735 >= sizeof thisname - flist_dir_len) {
736 rprintf(FINFO, "skipping overly long name: %s\n", fname);
737 return NULL;
738 }
739 clean_fname(thisname);
740 if (sanitize_paths)
741 sanitize_path(thisname, NULL);
742
743 memset(sum, 0, SUM_LENGTH);
744
745 if (readlink_stat(thisname, &st, linkname) != 0) {
746 int save_errno = errno;
747 if (errno == ENOENT && exclude_level != NO_EXCLUDES) {
748 /* either symlink pointing nowhere or file that
749 * was removed during rsync run; see if excluded
750 * before reporting an error */
751 if (check_exclude_file(thisname, 0, exclude_level)) {
752 /* file is excluded anyway, ignore silently */
753 return NULL;
754 }
755 }
756 io_error |= IOERR_GENERAL;
757 rprintf(FERROR, "readlink %s failed: %s\n",
758 full_fname(thisname), strerror(save_errno));
759 return NULL;
760 }
761
762 /* backup.c calls us with exclude_level set to NO_EXCLUDES. */
763 if (exclude_level == NO_EXCLUDES)
764 goto skip_excludes;
765
766 if (S_ISDIR(st.st_mode) && !recurse && !files_from) {
767 rprintf(FINFO, "skipping directory %s\n", thisname);
768 return NULL;
769 }
770
771 /* We only care about directories because we need to avoid recursing
772 * into a mount-point directory, not to avoid copying a symlinked
773 * file if -L (or similar) was specified. */
774 if (one_file_system && st.st_dev != filesystem_dev
775 && S_ISDIR(st.st_mode))
776 flags |= FLAG_MOUNT_POINT;
777
778 if (check_exclude_file(thisname, S_ISDIR(st.st_mode) != 0, exclude_level))
779 return NULL;
780
781 if (lp_ignore_nonreadable(module_id) && access(thisname, R_OK) != 0)
782 return NULL;
783
784 skip_excludes:
785
786 if (verbose > 2) {
787 rprintf(FINFO, "[%s] make_file(%s,*,%d)\n",
788 who_am_i(), thisname, exclude_level);
789 }
790
791 if ((basename = strrchr(thisname, '/')) != NULL) {
792 dirname_len = ++basename - thisname; /* counts future '\0' */
793 if (lastdir_len == dirname_len - 1
794 && strncmp(thisname, lastdir, lastdir_len) == 0) {
795 dirname = lastdir;
796 dirname_len = 0; /* indicates no copy is needed */
797 } else
798 dirname = thisname;
799 } else {
800 basename = thisname;
801 dirname = NULL;
802 dirname_len = 0;
803 }
804 basename_len = strlen(basename) + 1; /* count the '\0' */
805
806#if SUPPORT_LINKS
807 linkname_len = S_ISLNK(st.st_mode) ? strlen(linkname) + 1 : 0;
808#else
809 linkname_len = 0;
810#endif
811
812#if SUPPORT_HARD_LINKS
813 if (preserve_hard_links) {
814 if (protocol_version < 28) {
815 if (S_ISREG(st.st_mode))
816 idev_len = sizeof (struct idev);
817 else
818 idev_len = 0;
819 } else {
820 if (!S_ISDIR(st.st_mode) && st.st_nlink > 1)
821 idev_len = sizeof (struct idev);
822 else
823 idev_len = 0;
824 }
825 } else
826#endif
827 idev_len = 0;
828
829 sum_len = always_checksum && S_ISREG(st.st_mode) ? MD4_SUM_LENGTH : 0;
830 file_struct_len = idev_len? sizeof file[0] : min_file_struct_len;
831
832 alloc_len = file_struct_len + dirname_len + basename_len
833 + linkname_len + sum_len + idev_len;
834 if (!(bp = new_array(char, alloc_len)))
835 out_of_memory("receive_file_entry");
836 file = (struct file_struct *)bp;
837 memset(bp, 0, min_file_struct_len);
838 bp += file_struct_len;
839
840 file->flags = flags;
841 file->modtime = st.st_mtime;
842 file->length = st.st_size;
843 file->mode = st.st_mode;
844 file->uid = st.st_uid;
845 file->gid = st.st_gid;
846
847#if SUPPORT_HARD_LINKS
848 if (idev_len) {
849 file->link_u.idev = (struct idev *)bp;
850 bp += idev_len;
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,
906 f == -1 && delete_excluded? SERVER_EXCLUDES
907 : ALL_EXCLUDES);
908
909 if (!file)
910 return;
911
912 maybe_emit_filelist_progress(flist);
913
914 flist_expand(flist);
915
916 if (write_batch)
917 file->flags |= FLAG_TOP_DIR;
918
919 if (file->basename[0]) {
920 flist->files[flist->count++] = file;
921 send_file_entry(file, f, base_flags);
922 }
923
924 if (recursive && S_ISDIR(file->mode)
925 && !(file->flags & FLAG_MOUNT_POINT)) {
926 struct exclude_struct **last_exclude_list = local_exclude_list;
927 send_directory(f, flist, f_name_to(file, fbuf));
928 local_exclude_list = last_exclude_list;
929 return;
930 }
931}
932
933
934static void send_directory(int f, struct file_list *flist, char *dir)
935{
936 DIR *d;
937 struct dirent *di;
938 char fname[MAXPATHLEN];
939 unsigned int offset;
940 char *p;
941
942 d = opendir(dir);
943 if (!d) {
944 io_error |= IOERR_GENERAL;
945 rprintf(FERROR, "opendir %s failed: %s\n",
946 full_fname(dir), strerror(errno));
947 return;
948 }
949
950 offset = strlcpy(fname, dir, MAXPATHLEN);
951 p = fname + offset;
952 if (offset >= MAXPATHLEN || p[-1] != '/') {
953 if (offset >= MAXPATHLEN - 1) {
954 io_error |= IOERR_GENERAL;
955 rprintf(FERROR, "skipping long-named directory: %s\n",
956 full_fname(fname));
957 closedir(d);
958 return;
959 }
960 *p++ = '/';
961 offset++;
962 }
963
964 local_exclude_list = NULL;
965
966 if (cvs_exclude) {
967 if (strlcpy(p, ".cvsignore", MAXPATHLEN - offset)
968 < MAXPATHLEN - offset)
969 add_exclude_file(&local_exclude_list,fname,MISSING_OK,ADD_EXCLUDE);
970 else {
971 io_error |= IOERR_GENERAL;
972 rprintf(FINFO,
973 "cannot cvs-exclude in long-named directory %s\n",
974 full_fname(fname));
975 }
976 }
977
978 for (errno = 0, di = readdir(d); di; errno = 0, di = readdir(d)) {
979 char *dname = d_name(di);
980 if (dname[0] == '.' && (dname[1] == '\0'
981 || (dname[1] == '.' && dname[2] == '\0')))
982 continue;
983 if (strlcpy(p, dname, MAXPATHLEN - offset) < MAXPATHLEN - offset)
984 send_file_name(f, flist, fname, recurse, 0);
985 else {
986 io_error |= IOERR_GENERAL;
987 rprintf(FINFO,
988 "cannot send long-named file %s\n",
989 full_fname(fname));
990 }
991 }
992 if (errno) {
993 io_error |= IOERR_GENERAL;
994 rprintf(FERROR, "readdir(%s): (%d) %s\n",
995 dir, errno, strerror(errno));
996 }
997
998 if (local_exclude_list)
999 free_exclude_list(&local_exclude_list); /* Zeros pointer too */
1000
1001 closedir(d);
1002}
1003
1004
1005/**
1006 * The delete_files() function in receiver.c sets f to -1 so that we just
1007 * construct the file list in memory without sending it over the wire. It
1008 * also has the side-effect of ignoring user-excludes if delete_excluded
1009 * is set (so that the delete list includes user-excluded files).
1010 **/
1011struct file_list *send_file_list(int f, int argc, char *argv[])
1012{
1013 int l;
1014 STRUCT_STAT st;
1015 char *p, *dir, olddir[sizeof curr_dir];
1016 char lastpath[MAXPATHLEN] = "";
1017 struct file_list *flist;
1018 int64 start_write;
1019 int use_ff_fd = 0;
1020
1021 if (show_filelist_p() && f != -1)
1022 start_filelist_progress("building file list");
1023
1024 start_write = stats.total_written;
1025
1026 flist = flist_new();
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 clean_flist(flist, 0, 0);
1178
1179 if (f != -1) {
1180 /* Now send the uid/gid list. This was introduced in
1181 * protocol version 15 */
1182 send_uid_list(f);
1183
1184 /* send the io_error flag */
1185 write_int(f, lp_ignore_errors(module_id) ? 0 : io_error);
1186
1187 io_end_buffering();
1188 stats.flist_size = stats.total_written - start_write;
1189 stats.num_files = flist->count;
1190 if (write_batch)
1191 write_batch_flist_info(flist->count, flist->files);
1192 }
1193
1194 if (verbose > 3)
1195 output_flist(flist);
1196
1197 if (verbose > 2)
1198 rprintf(FINFO, "send_file_list done\n");
1199
1200 return flist;
1201}
1202
1203
1204struct file_list *recv_file_list(int f)
1205{
1206 struct file_list *flist;
1207 unsigned short flags;
1208 int64 start_read;
1209 extern int list_only;
1210
1211 if (show_filelist_p())
1212 start_filelist_progress("receiving file list");
1213
1214 start_read = stats.total_read;
1215
1216 flist = new(struct file_list);
1217 if (!flist)
1218 goto oom;
1219
1220 flist->count = 0;
1221 flist->malloced = 1000;
1222 flist->files = new_array(struct file_struct *, flist->malloced);
1223 if (!flist->files)
1224 goto oom;
1225
1226
1227 while ((flags = read_byte(f)) != 0) {
1228 int i = flist->count;
1229
1230 flist_expand(flist);
1231
1232 if (protocol_version >= 28 && (flags & XMIT_EXTENDED_FLAGS))
1233 flags |= read_byte(f) << 8;
1234 receive_file_entry(&flist->files[i], flags, f);
1235
1236 if (S_ISREG(flist->files[i]->mode))
1237 stats.total_size += flist->files[i]->length;
1238
1239 flist->count++;
1240
1241 maybe_emit_filelist_progress(flist);
1242
1243 if (verbose > 2) {
1244 rprintf(FINFO, "recv_file_name(%s)\n",
1245 f_name(flist->files[i]));
1246 }
1247 }
1248 receive_file_entry(NULL, 0, 0); /* Signal that we're done. */
1249
1250 if (verbose > 2)
1251 rprintf(FINFO, "received %d names\n", flist->count);
1252
1253 if (show_filelist_p())
1254 finish_filelist_progress(flist);
1255
1256 clean_flist(flist, relative_paths, 1);
1257
1258 if (f != -1) {
1259 /* Now send the uid/gid list. This was introduced in
1260 * protocol version 15 */
1261 recv_uid_list(f, flist);
1262
1263 if (!read_batch) {
1264 /* Recv the io_error flag */
1265 if (lp_ignore_errors(module_id) || ignore_errors)
1266 read_int(f);
1267 else
1268 io_error |= read_int(f);
1269 }
1270 }
1271
1272 if (verbose > 3)
1273 output_flist(flist);
1274
1275 if (list_only) {
1276 int i;
1277 for (i = 0; i < flist->count; i++)
1278 list_file_entry(flist->files[i]);
1279 }
1280
1281 if (verbose > 2)
1282 rprintf(FINFO, "recv_file_list done\n");
1283
1284 stats.flist_size = stats.total_read - start_read;
1285 stats.num_files = flist->count;
1286
1287 return flist;
1288
1289 oom:
1290 out_of_memory("recv_file_list");
1291 return NULL; /* not reached */
1292}
1293
1294
1295int file_compare(struct file_struct **file1, struct file_struct **file2)
1296{
1297 struct file_struct *f1 = *file1;
1298 struct file_struct *f2 = *file2;
1299
1300 if (!f1->basename && !f2->basename)
1301 return 0;
1302 if (!f1->basename)
1303 return -1;
1304 if (!f2->basename)
1305 return 1;
1306 if (f1->dirname == f2->dirname)
1307 return u_strcmp(f1->basename, f2->basename);
1308 return f_name_cmp(f1, f2);
1309}
1310
1311
1312int flist_find(struct file_list *flist, struct file_struct *f)
1313{
1314 int low = 0, high = flist->count - 1;
1315
1316 while (high >= 0 && !flist->files[high]->basename) high--;
1317
1318 if (high < 0)
1319 return -1;
1320
1321 while (low != high) {
1322 int mid = (low + high) / 2;
1323 int ret = file_compare(&flist->files[flist_up(flist, mid)],&f);
1324 if (ret == 0)
1325 return flist_up(flist, mid);
1326 if (ret > 0)
1327 high = mid;
1328 else
1329 low = mid + 1;
1330 }
1331
1332 if (file_compare(&flist->files[flist_up(flist, low)], &f) == 0)
1333 return flist_up(flist, low);
1334 return -1;
1335}
1336
1337
1338/*
1339 * Free up any resources a file_struct has allocated, and optionally free
1340 * it up as well.
1341 */
1342void free_file(struct file_struct *file, int free_the_struct)
1343{
1344 if (free_the_struct)
1345 free(file);
1346 else
1347 memset(file, 0, min_file_struct_len);
1348}
1349
1350
1351/*
1352 * allocate a new file list
1353 */
1354struct file_list *flist_new(void)
1355{
1356 struct file_list *flist;
1357
1358 flist = new(struct file_list);
1359 if (!flist)
1360 out_of_memory("send_file_list");
1361
1362 flist->count = 0;
1363 flist->malloced = 0;
1364 flist->files = NULL;
1365
1366 return flist;
1367}
1368
1369/*
1370 * free up all elements in a flist
1371 */
1372void flist_free(struct file_list *flist)
1373{
1374 int i;
1375 for (i = 1; i < flist->count; i++)
1376 free_file(flist->files[i], FREE_STRUCT);
1377 free(flist->files);
1378 free(flist);
1379}
1380
1381
1382/*
1383 * This routine ensures we don't have any duplicate names in our file list.
1384 * duplicate names can cause corruption because of the pipelining
1385 */
1386static void clean_flist(struct file_list *flist, int strip_root, int no_dups)
1387{
1388 int i, prev_i = 0;
1389
1390 if (!flist || flist->count == 0)
1391 return;
1392
1393 qsort(flist->files, flist->count,
1394 sizeof flist->files[0], (int (*)()) file_compare);
1395
1396 for (i = no_dups? 0 : flist->count; i < flist->count; i++) {
1397 if (flist->files[i]->basename) {
1398 prev_i = i;
1399 break;
1400 }
1401 }
1402 while (++i < flist->count) {
1403 if (!flist->files[i]->basename)
1404 continue;
1405 if (f_name_cmp(flist->files[i], flist->files[prev_i]) == 0) {
1406 if (verbose > 1 && !am_server) {
1407 rprintf(FINFO,
1408 "removing duplicate name %s from file list %d\n",
1409 f_name(flist->files[i]), i);
1410 }
1411 /* Make sure that if we unduplicate '.', that we don't
1412 * lose track of a user-specified starting point (or
1413 * else deletions will mysteriously fail with -R). */
1414 if (flist->files[i]->flags & FLAG_TOP_DIR)
1415 flist->files[prev_i]->flags |= FLAG_TOP_DIR;
1416 free_file(flist->files[i], CLEAR_STRUCT);
1417 } else
1418 prev_i = i;
1419 }
1420
1421 if (strip_root) {
1422 /* we need to strip off the root directory in the case
1423 of relative paths, but this must be done _after_
1424 the sorting phase */
1425 for (i = 0; i < flist->count; i++) {
1426 if (flist->files[i]->dirname &&
1427 flist->files[i]->dirname[0] == '/') {
1428 memmove(&flist->files[i]->dirname[0],
1429 &flist->files[i]->dirname[1],
1430 strlen(flist->files[i]->dirname));
1431 }
1432
1433 if (flist->files[i]->dirname &&
1434 !flist->files[i]->dirname[0]) {
1435 flist->files[i]->dirname = NULL;
1436 }
1437 }
1438 }
1439}
1440
1441static void output_flist(struct file_list *flist)
1442{
1443 char uidbuf[16], gidbuf[16];
1444 struct file_struct *file;
1445 int i;
1446
1447 for (i = 0; i < flist->count; i++) {
1448 file = flist->files[i];
1449 if (am_root && preserve_uid)
1450 sprintf(uidbuf, " uid=%ld", (long)file->uid);
1451 else
1452 *uidbuf = '\0';
1453 if (preserve_gid && file->gid != GID_NONE)
1454 sprintf(gidbuf, " gid=%ld", (long)file->gid);
1455 else
1456 *gidbuf = '\0';
1457 rprintf(FINFO, "[%s] i=%d %s %s %s mode=0%o len=%.0f%s%s\n",
1458 who_am_i(), i, NS(file->basedir), NS(file->dirname),
1459 NS(file->basename), (int) file->mode,
1460 (double) file->length, uidbuf, gidbuf);
1461 }
1462}
1463
1464
1465enum fnc_state { fnc_DIR, fnc_SLASH, fnc_BASE };
1466
1467/* Compare the names of two file_struct entities, just like strcmp()
1468 * would do if it were operating on the joined strings. We assume
1469 * that there are no 0-length strings.
1470 */
1471int f_name_cmp(struct file_struct *f1, struct file_struct *f2)
1472{
1473 int dif;
1474 const uchar *c1, *c2;
1475 enum fnc_state state1, state2;
1476
1477 if (!f1 || !f1->basename) {
1478 if (!f2 || !f2->basename)
1479 return 0;
1480 return -1;
1481 }
1482 if (!f2 || !f2->basename)
1483 return 1;
1484
1485 if (!(c1 = (uchar*)f1->dirname)) {
1486 state1 = fnc_BASE;
1487 c1 = (uchar*)f1->basename;
1488 } else
1489 state1 = fnc_DIR;
1490 if (!(c2 = (uchar*)f2->dirname)) {
1491 state2 = fnc_BASE;
1492 c2 = (uchar*)f2->basename;
1493 } else
1494 state2 = fnc_DIR;
1495
1496 while (1) {
1497 if ((dif = (int)*c1 - (int)*c2) != 0)
1498 break;
1499 if (!*++c1) {
1500 switch (state1) {
1501 case fnc_DIR:
1502 state1 = fnc_SLASH;
1503 c1 = (uchar*)"/";
1504 break;
1505 case fnc_SLASH:
1506 state1 = fnc_BASE;
1507 c1 = (uchar*)f1->basename;
1508 break;
1509 case fnc_BASE:
1510 break;
1511 }
1512 }
1513 if (!*++c2) {
1514 switch (state2) {
1515 case fnc_DIR:
1516 state2 = fnc_SLASH;
1517 c2 = (uchar*)"/";
1518 break;
1519 case fnc_SLASH:
1520 state2 = fnc_BASE;
1521 c2 = (uchar*)f2->basename;
1522 break;
1523 case fnc_BASE:
1524 if (!*c1)
1525 return 0;
1526 break;
1527 }
1528 }
1529 }
1530
1531 return dif;
1532}
1533
1534
1535/* Return a copy of the full filename of a flist entry, using the indicated
1536 * buffer. No size-checking is done because we checked the size when creating
1537 * the file_struct entry.
1538 */
1539char *f_name_to(struct file_struct *f, char *fbuf)
1540{
1541 if (!f || !f->basename)
1542 return NULL;
1543
1544 if (f->dirname) {
1545 int len = strlen(f->dirname);
1546 memcpy(fbuf, f->dirname, len);
1547 fbuf[len] = '/';
1548 strcpy(fbuf + len + 1, f->basename);
1549 } else
1550 strcpy(fbuf, f->basename);
1551 return fbuf;
1552}
1553
1554
1555/* Like f_name_to(), but we rotate through 5 static buffers of our own.
1556 */
1557char *f_name(struct file_struct *f)
1558{
1559 static char names[5][MAXPATHLEN];
1560 static unsigned int n;
1561
1562 n = (n + 1) % (sizeof names / sizeof names[0]);
1563
1564 return f_name_to(f, names[n]);
1565}