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