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