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