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