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