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