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