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