Add dummy show_flist_stats().
[rsync/rsync.git] / flist.c
CommitLineData
c627d613
AT
1/*
2 Copyright (C) Andrew Tridgell 1996
3 Copyright (C) Paul Mackerras 1996
736a6a29 4 Copyright (C) 2001, 2002 by Martin Pool <mbp@samba.org>
c627d613
AT
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
736a6a29
MP
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 *
172875cf
MP
28 * @sa http://lists.samba.org/pipermail/rsync/2000-June/002351.html
29 *
736a6a29 30 **/
c627d613
AT
31
32#include "rsync.h"
33
a800434a
AT
34extern struct stats stats;
35
c627d613
AT
36extern int verbose;
37extern int am_server;
38extern int always_checksum;
c627d613
AT
39
40extern int cvs_exclude;
41
a06d19e3
AT
42extern int recurse;
43
c627d613
AT
44extern int one_file_system;
45extern int make_backups;
46extern int preserve_links;
dc5ddbcc 47extern int preserve_hard_links;
c627d613
AT
48extern int preserve_perms;
49extern int preserve_devices;
50extern int preserve_uid;
51extern int preserve_gid;
52extern int preserve_times;
6574b4f7 53extern int relative_paths;
82306bf6 54extern int copy_links;
b5313607 55extern int copy_unsafe_links;
f6c34742 56extern int remote_version;
6ba9279f 57extern int io_error;
cb13abfe 58extern int sanitize_paths;
c627d613 59
6902ed17
MP
60extern int read_batch;
61extern int write_batch;
62
b5313607
DD
63static char topsrcname[MAXPATHLEN];
64
2b6b4d53 65static struct exclude_struct **local_exclude_list;
c627d613 66
3d382777
AT
67static struct file_struct null_file;
68
0199b05f
AT
69static void clean_flist(struct file_list *flist, int strip_root);
70
58225000
MP
71
72static int show_build_progress_p(void)
73{
74 extern int do_progress;
ebed4c3a 75
58225000
MP
76 return do_progress && verbose && recurse && !am_server;
77}
78
79/**
80 * True if we're local, etc, and should emit progress emssages.
81 **/
82static void emit_build_progress(const struct file_list *flist)
83{
ebed4c3a 84 rprintf(FINFO, " %d files...\r", flist->count);
58225000
MP
85}
86
87
88static void finish_build_progress(const struct file_list *flist)
89{
90 if (verbose && recurse && !am_server) {
91 /* This overwrites the progress line, if any. */
92 rprintf(FINFO, RSYNC_NAME ": %d files to consider.\n",
93 flist->count);
94 }
95}
96
97
86943126
MP
98void show_flist_stats(void)
99{
100 /* Nothing yet */
101}
102
103
5c66303a 104static struct string_area *string_area_new(int size)
3d382777
AT
105{
106 struct string_area *a;
107
ebed4c3a
MP
108 if (size <= 0)
109 size = ARENA_SIZE;
3d382777 110 a = malloc(sizeof(*a));
ebed4c3a
MP
111 if (!a)
112 out_of_memory("string_area_new");
3d382777 113 a->current = a->base = malloc(size);
ebed4c3a
MP
114 if (!a->current)
115 out_of_memory("string_area_new buffer");
3d382777 116 a->end = a->base + size;
5c66303a 117 a->next = NULL;
3d382777
AT
118
119 return a;
120}
121
5c66303a 122static void string_area_free(struct string_area *a)
3d382777
AT
123{
124 struct string_area *next;
125
ebed4c3a 126 for (; a; a = next) {
3d382777
AT
127 next = a->next;
128 free(a->base);
129 }
130}
131
5c66303a 132static char *string_area_malloc(struct string_area **ap, int size)
3d382777
AT
133{
134 char *p;
135 struct string_area *a;
136
137 /* does the request fit into the current space? */
138 a = *ap;
139 if (a->current + size >= a->end) {
140 /* no; get space, move new string_area to front of the list */
141 a = string_area_new(size > ARENA_SIZE ? size : ARENA_SIZE);
142 a->next = *ap;
143 *ap = a;
144 }
145
146 /* have space; do the "allocation." */
147 p = a->current;
148 a->current += size;
149 return p;
150}
151
5c66303a 152static char *string_area_strdup(struct string_area **ap, const char *src)
3d382777 153{
ebed4c3a 154 char *dest = string_area_malloc(ap, strlen(src) + 1);
3d382777
AT
155 return strcpy(dest, src);
156}
f7632fc6
AT
157
158static void list_file_entry(struct file_struct *f)
159{
740819ef 160 char perms[11];
f7632fc6 161
7212be92
DD
162 if (!f->basename)
163 /* this can happen if duplicate names were removed */
164 return;
165
740819ef
MP
166 permstring(perms, f->mode);
167
f7632fc6 168 if (preserve_links && S_ISLNK(f->mode)) {
ebed4c3a
MP
169 rprintf(FINFO, "%s %11.0f %s %s -> %s\n",
170 perms,
171 (double) f->length, timestring(f->modtime),
f7632fc6
AT
172 f_name(f), f->link);
173 } else {
ebed4c3a
MP
174 rprintf(FINFO, "%s %11.0f %s %s\n",
175 perms,
176 (double) f->length, timestring(f->modtime),
177 f_name(f));
f7632fc6
AT
178 }
179}
180
181
ebed4c3a 182int readlink_stat(const char *Path, STRUCT_STAT * Buffer, char *Linkbuf)
b5313607
DD
183{
184#if SUPPORT_LINKS
185 if (copy_links) {
186 return do_stat(Path, Buffer);
187 }
188 if (do_lstat(Path, Buffer) == -1) {
189 return -1;
190 }
191 if (S_ISLNK(Buffer->st_mode)) {
ab94af5c 192 int l;
ebed4c3a
MP
193 if ((l =
194 readlink((char *) Path, Linkbuf,
195 MAXPATHLEN - 1)) == -1) {
b5313607
DD
196 return -1;
197 }
198 Linkbuf[l] = 0;
199 if (copy_unsafe_links && (topsrcname[0] != '\0') &&
ebed4c3a 200 unsafe_symlink(Linkbuf, topsrcname)) {
b5313607
DD
201 return do_stat(Path, Buffer);
202 }
203 }
204 return 0;
205#else
206 return do_stat(Path, Buffer);
207#endif
208}
209
ebed4c3a 210int link_stat(const char *Path, STRUCT_STAT * Buffer)
82306bf6
AT
211{
212#if SUPPORT_LINKS
ebed4c3a
MP
213 if (copy_links) {
214 return do_stat(Path, Buffer);
215 } else {
216 return do_lstat(Path, Buffer);
217 }
82306bf6 218#else
ebed4c3a 219 return do_stat(Path, Buffer);
82306bf6
AT
220#endif
221}
222
c627d613
AT
223/*
224 This function is used to check if a file should be included/excluded
225 from the list of files based on its name and type etc
226 */
ebed4c3a 227static int check_exclude_file(int f, char *fname, STRUCT_STAT * st)
c627d613 228{
76e26e10
DD
229 extern int delete_excluded;
230
231 /* f is set to -1 when calculating deletion file list */
232 if ((f == -1) && delete_excluded) {
233 return 0;
234 }
ebed4c3a 235 if (check_exclude(fname, local_exclude_list, st)) {
76e26e10
DD
236 return 1;
237 }
238 return 0;
c627d613
AT
239}
240
241/* used by the one_file_system code */
242static dev_t filesystem_dev;
243
244static void set_filesystem(char *fname)
245{
ebed4c3a
MP
246 STRUCT_STAT st;
247 if (link_stat(fname, &st) != 0)
248 return;
249 filesystem_dev = st.st_dev;
c627d613
AT
250}
251
252
b280a1f4
AT
253static int to_wire_mode(mode_t mode)
254{
efe3037c 255 if (S_ISLNK(mode) && (_S_IFLNK != 0120000)) {
b280a1f4
AT
256 return (mode & ~(_S_IFMT)) | 0120000;
257 }
ebed4c3a 258 return (int) mode;
b280a1f4
AT
259}
260
261static mode_t from_wire_mode(int mode)
262{
efe3037c
AT
263 if ((mode & (_S_IFMT)) == 0120000 && (_S_IFLNK != 0120000)) {
264 return (mode & ~(_S_IFMT)) | _S_IFLNK;
b280a1f4 265 }
ebed4c3a 266 return (mode_t) mode;
b280a1f4
AT
267}
268
269
ebed4c3a 270static void send_directory(int f, struct file_list *flist, char *dir);
c627d613 271
3a6a366f 272static char *flist_dir;
c627d613 273
3ec4dd97 274
d9d6bc52
MP
275/**
276 * Make sure @p flist is big enough to hold at least @p flist->count
277 * entries.
278 **/
279static void flist_expand(struct file_list *flist)
280{
281 if (flist->count >= flist->malloced) {
282 if (flist->malloced < 1000)
283 flist->malloced += 1000;
284 else
285 flist->malloced *= 2;
286 flist->files = (struct file_struct **)
287 realloc(flist->files,
288 sizeof(flist->files[0]) * flist->malloced);
289 if (!flist->files)
290 out_of_memory("flist_expand");
291 }
292}
293
294
ebed4c3a
MP
295static void send_file_entry(struct file_struct *file, int f,
296 unsigned base_flags)
c627d613 297{
72914a60
AT
298 unsigned char flags;
299 static time_t last_time;
300 static mode_t last_mode;
301 static dev_t last_rdev;
302 static uid_t last_uid;
303 static gid_t last_gid;
304 static char lastname[MAXPATHLEN];
305 char *fname;
ebed4c3a 306 int l1, l2;
72914a60 307
ebed4c3a
MP
308 if (f == -1)
309 return;
72914a60
AT
310
311 if (!file) {
ebed4c3a 312 write_byte(f, 0);
72914a60
AT
313 return;
314 }
315
316 fname = f_name(file);
317
318 flags = base_flags;
319
ebed4c3a
MP
320 if (file->mode == last_mode)
321 flags |= SAME_MODE;
322 if (file->rdev == last_rdev)
323 flags |= SAME_RDEV;
324 if (file->uid == last_uid)
325 flags |= SAME_UID;
326 if (file->gid == last_gid)
327 flags |= SAME_GID;
328 if (file->modtime == last_time)
329 flags |= SAME_TIME;
330
331 for (l1 = 0;
332 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
333 l1++);
72914a60
AT
334 l2 = strlen(fname) - l1;
335
ebed4c3a
MP
336 if (l1 > 0)
337 flags |= SAME_NAME;
338 if (l2 > 255)
339 flags |= LONG_NAME;
72914a60
AT
340
341 /* we must make sure we don't send a zero flags byte or the other
342 end will terminate the flist transfer */
ebed4c3a
MP
343 if (flags == 0 && !S_ISDIR(file->mode))
344 flags |= FLAG_DELETE;
345 if (flags == 0)
346 flags |= LONG_NAME;
72914a60 347
ebed4c3a 348 write_byte(f, flags);
72914a60 349 if (flags & SAME_NAME)
ebed4c3a 350 write_byte(f, l1);
72914a60 351 if (flags & LONG_NAME)
ebed4c3a 352 write_int(f, l2);
72914a60 353 else
ebed4c3a
MP
354 write_byte(f, l2);
355 write_buf(f, fname + l1, l2);
72914a60 356
ebed4c3a 357 write_longint(f, file->length);
72914a60 358 if (!(flags & SAME_TIME))
ebed4c3a 359 write_int(f, (int) file->modtime);
72914a60 360 if (!(flags & SAME_MODE))
ebed4c3a 361 write_int(f, to_wire_mode(file->mode));
72914a60
AT
362 if (preserve_uid && !(flags & SAME_UID)) {
363 add_uid(file->uid);
ebed4c3a 364 write_int(f, (int) file->uid);
72914a60
AT
365 }
366 if (preserve_gid && !(flags & SAME_GID)) {
367 add_gid(file->gid);
ebed4c3a 368 write_int(f, (int) file->gid);
72914a60 369 }
ebed4c3a
MP
370 if (preserve_devices && IS_DEVICE(file->mode)
371 && !(flags & SAME_RDEV))
372 write_int(f, (int) file->rdev);
c627d613
AT
373
374#if SUPPORT_LINKS
72914a60 375 if (preserve_links && S_ISLNK(file->mode)) {
ebed4c3a
MP
376 write_int(f, strlen(file->link));
377 write_buf(f, file->link, strlen(file->link));
72914a60 378 }
c627d613
AT
379#endif
380
dc5ddbcc 381#if SUPPORT_HARD_LINKS
72914a60 382 if (preserve_hard_links && S_ISREG(file->mode)) {
736a6a29
MP
383 if (remote_version < 26) {
384 /* 32-bit dev_t and ino_t */
ebed4c3a
MP
385 write_int(f, (int) file->dev);
386 write_int(f, (int) file->inode);
736a6a29
MP
387 } else {
388 /* 64-bit dev_t and ino_t */
6abd193f
MP
389 write_longint(f, file->dev);
390 write_longint(f, file->inode);
736a6a29 391 }
72914a60 392 }
dc5ddbcc
AT
393#endif
394
72914a60 395 if (always_checksum) {
f855a7d0 396 if (remote_version < 21) {
ebed4c3a 397 write_buf(f, file->sum, 2);
f855a7d0 398 } else {
ebed4c3a 399 write_buf(f, file->sum, MD4_SUM_LENGTH);
f855a7d0 400 }
ebed4c3a 401 }
182dca5c 402
72914a60
AT
403 last_mode = file->mode;
404 last_rdev = file->rdev;
405 last_uid = file->uid;
406 last_gid = file->gid;
407 last_time = file->modtime;
4fe159a8 408
ebed4c3a
MP
409 strlcpy(lastname, fname, MAXPATHLEN);
410 lastname[MAXPATHLEN - 1] = 0;
182dca5c
AT
411}
412
413
414
3333ffbd 415static void receive_file_entry(struct file_struct **fptr,
ebed4c3a 416 unsigned flags, int f)
182dca5c 417{
72914a60
AT
418 static time_t last_time;
419 static mode_t last_mode;
420 static dev_t last_rdev;
421 static uid_t last_uid;
422 static gid_t last_gid;
423 static char lastname[MAXPATHLEN];
424 char thisname[MAXPATHLEN];
ebed4c3a 425 unsigned int l1 = 0, l2 = 0;
72914a60
AT
426 char *p;
427 struct file_struct *file;
428
429 if (flags & SAME_NAME)
430 l1 = read_byte(f);
ebed4c3a 431
72914a60
AT
432 if (flags & LONG_NAME)
433 l2 = read_int(f);
434 else
435 l2 = read_byte(f);
436
ebed4c3a
MP
437 file = (struct file_struct *) malloc(sizeof(*file));
438 if (!file)
439 out_of_memory("receive_file_entry");
440 memset((char *) file, 0, sizeof(*file));
72914a60
AT
441 (*fptr) = file;
442
ebed4c3a
MP
443 if (l2 >= MAXPATHLEN - l1) {
444 rprintf(FERROR,
445 "overflow: flags=0x%x l1=%d l2=%d lastname=%s\n",
d0fd26aa
AT
446 flags, l1, l2, lastname);
447 overflow("receive_file_entry");
448 }
72914a60 449
ebed4c3a
MP
450 strlcpy(thisname, lastname, l1 + 1);
451 read_sbuf(f, &thisname[l1], l2);
452 thisname[l1 + l2] = 0;
72914a60 453
ebed4c3a
MP
454 strlcpy(lastname, thisname, MAXPATHLEN);
455 lastname[MAXPATHLEN - 1] = 0;
72914a60
AT
456
457 clean_fname(thisname);
458
cb13abfe
DD
459 if (sanitize_paths) {
460 sanitize_path(thisname, NULL);
461 }
462
ebed4c3a 463 if ((p = strrchr(thisname, '/'))) {
72914a60
AT
464 static char *lastdir;
465 *p = 0;
ebed4c3a 466 if (lastdir && strcmp(thisname, lastdir) == 0) {
72914a60
AT
467 file->dirname = lastdir;
468 } else {
469 file->dirname = strdup(thisname);
470 lastdir = file->dirname;
471 }
ebed4c3a 472 file->basename = strdup(p + 1);
72914a60
AT
473 } else {
474 file->dirname = NULL;
475 file->basename = strdup(thisname);
476 }
477
ebed4c3a
MP
478 if (!file->basename)
479 out_of_memory("receive_file_entry 1");
72914a60
AT
480
481
482 file->flags = flags;
483 file->length = read_longint(f);
ebed4c3a
MP
484 file->modtime =
485 (flags & SAME_TIME) ? last_time : (time_t) read_int(f);
486 file->mode =
487 (flags & SAME_MODE) ? last_mode : from_wire_mode(read_int(f));
72914a60 488 if (preserve_uid)
ebed4c3a
MP
489 file->uid =
490 (flags & SAME_UID) ? last_uid : (uid_t) read_int(f);
72914a60 491 if (preserve_gid)
ebed4c3a
MP
492 file->gid =
493 (flags & SAME_GID) ? last_gid : (gid_t) read_int(f);
72914a60 494 if (preserve_devices && IS_DEVICE(file->mode))
ebed4c3a
MP
495 file->rdev =
496 (flags & SAME_RDEV) ? last_rdev : (dev_t) read_int(f);
72914a60
AT
497
498 if (preserve_links && S_ISLNK(file->mode)) {
499 int l = read_int(f);
9dd891bb 500 if (l < 0) {
ebed4c3a 501 rprintf(FERROR, "overflow: l=%d\n", l);
9dd891bb
MP
502 overflow("receive_file_entry");
503 }
ebed4c3a
MP
504 file->link = (char *) malloc(l + 1);
505 if (!file->link)
506 out_of_memory("receive_file_entry 2");
507 read_sbuf(f, file->link, l);
cb13abfe
DD
508 if (sanitize_paths) {
509 sanitize_path(file->link, file->dirname);
510 }
72914a60 511 }
dc5ddbcc 512#if SUPPORT_HARD_LINKS
72914a60 513 if (preserve_hard_links && S_ISREG(file->mode)) {
736a6a29
MP
514 if (remote_version < 26) {
515 file->dev = read_int(f);
516 file->inode = read_int(f);
517 } else {
518 file->dev = read_longint(f);
519 file->inode = read_longint(f);
520 }
72914a60 521 }
dc5ddbcc 522#endif
ebed4c3a 523
72914a60 524 if (always_checksum) {
ebed4c3a
MP
525 file->sum = (char *) malloc(MD4_SUM_LENGTH);
526 if (!file->sum)
527 out_of_memory("md4 sum");
f855a7d0 528 if (remote_version < 21) {
ebed4c3a 529 read_buf(f, file->sum, 2);
f855a7d0 530 } else {
ebed4c3a 531 read_buf(f, file->sum, MD4_SUM_LENGTH);
f855a7d0 532 }
72914a60 533 }
ebed4c3a 534
72914a60
AT
535 last_mode = file->mode;
536 last_rdev = file->rdev;
537 last_uid = file->uid;
538 last_gid = file->gid;
539 last_time = file->modtime;
540
541 if (!preserve_perms) {
542 extern int orig_umask;
543 /* set an appropriate set of permissions based on original
544 permissions and umask. This emulates what GNU cp does */
545 file->mode &= ~orig_umask;
546 }
c627d613
AT
547}
548
549
0c5f37d9
AT
550/* determine if a file in a different filesstem should be skipped
551 when one_file_system is set. We bascally only want to include
552 the mount points - but they can be hard to find! */
ebed4c3a 553static int skip_filesystem(char *fname, STRUCT_STAT * st)
0c5f37d9 554{
bcacc18b 555 STRUCT_STAT st2;
0c5f37d9
AT
556 char *p = strrchr(fname, '/');
557
558 /* skip all but directories */
ebed4c3a
MP
559 if (!S_ISDIR(st->st_mode))
560 return 1;
0c5f37d9
AT
561
562 /* if its not a subdirectory then allow */
ebed4c3a
MP
563 if (!p)
564 return 0;
0c5f37d9
AT
565
566 *p = 0;
567 if (link_stat(fname, &st2)) {
568 *p = '/';
569 return 0;
570 }
571 *p = '/';
ebed4c3a 572
0c5f37d9
AT
573 return (st2.st_dev != filesystem_dev);
574}
4fe159a8 575
3d382777 576#define STRDUP(ap, p) (ap ? string_area_strdup(ap, p) : strdup(p))
87a819ed
MP
577/* IRIX cc cares that the operands to the ternary have the same type. */
578#define MALLOC(ap, i) (ap ? (void*) string_area_malloc(ap, i) : malloc(i))
3d382777 579
66203a98 580/* create a file_struct for a named file */
ac1a0994
AT
581struct file_struct *make_file(int f, char *fname, struct string_area **ap,
582 int noexcludes)
c627d613 583{
3ec4dd97 584 struct file_struct *file;
bcacc18b 585 STRUCT_STAT st;
3ec4dd97
AT
586 char sum[SUM_LENGTH];
587 char *p;
588 char cleaned_name[MAXPATHLEN];
b5313607 589 char linkbuf[MAXPATHLEN];
ac1a0994 590 extern int module_id;
3ec4dd97 591
37f9805d 592 strlcpy(cleaned_name, fname, MAXPATHLEN);
ebed4c3a 593 cleaned_name[MAXPATHLEN - 1] = 0;
3ec4dd97 594 clean_fname(cleaned_name);
cb13abfe
DD
595 if (sanitize_paths) {
596 sanitize_path(cleaned_name, NULL);
597 }
3ec4dd97
AT
598 fname = cleaned_name;
599
ebed4c3a 600 memset(sum, 0, SUM_LENGTH);
3ec4dd97 601
ebed4c3a 602 if (readlink_stat(fname, &st, linkbuf) != 0) {
76e26e10
DD
603 int save_errno = errno;
604 if ((errno == ENOENT) && copy_links && !noexcludes) {
605 /* symlink pointing nowhere, see if excluded */
ebed4c3a
MP
606 memset((char *) &st, 0, sizeof(st));
607 if (check_exclude_file(f, fname, &st)) {
76e26e10
DD
608 /* file is excluded anyway, ignore silently */
609 return NULL;
610 }
611 }
6ba9279f 612 io_error = 1;
ebed4c3a
MP
613 rprintf(FERROR, "readlink %s: %s\n",
614 fname, strerror(save_errno));
3ec4dd97
AT
615 return NULL;
616 }
c627d613 617
ac1a0994 618 /* we use noexcludes from backup.c */
ebed4c3a
MP
619 if (noexcludes)
620 goto skip_excludes;
ac1a0994 621
3ec4dd97 622 if (S_ISDIR(st.st_mode) && !recurse) {
ebed4c3a 623 rprintf(FINFO, "skipping directory %s\n", fname);
3ec4dd97
AT
624 return NULL;
625 }
ebed4c3a 626
0c5f37d9
AT
627 if (one_file_system && st.st_dev != filesystem_dev) {
628 if (skip_filesystem(fname, &st))
629 return NULL;
630 }
ebed4c3a
MP
631
632 if (check_exclude_file(f, fname, &st))
76e26e10
DD
633 return NULL;
634
ac1a0994 635
ebed4c3a 636 if (lp_ignore_nonreadable(module_id) && access(fname, R_OK) != 0)
ac1a0994
AT
637 return NULL;
638
ebed4c3a 639 skip_excludes:
ac1a0994 640
3ec4dd97 641 if (verbose > 2)
ebed4c3a
MP
642 rprintf(FINFO, "make_file(%d,%s)\n", f, fname);
643
644 file = (struct file_struct *) malloc(sizeof(*file));
645 if (!file)
646 out_of_memory("make_file");
647 memset((char *) file, 0, sizeof(*file));
3ec4dd97 648
ebed4c3a 649 if ((p = strrchr(fname, '/'))) {
3ec4dd97
AT
650 static char *lastdir;
651 *p = 0;
ebed4c3a 652 if (lastdir && strcmp(fname, lastdir) == 0) {
3ec4dd97
AT
653 file->dirname = lastdir;
654 } else {
a20aa42a 655 file->dirname = strdup(fname);
3ec4dd97
AT
656 lastdir = file->dirname;
657 }
ebed4c3a 658 file->basename = STRDUP(ap, p + 1);
3ec4dd97
AT
659 *p = '/';
660 } else {
661 file->dirname = NULL;
3d382777 662 file->basename = STRDUP(ap, fname);
3ec4dd97 663 }
c627d613 664
3ec4dd97
AT
665 file->modtime = st.st_mtime;
666 file->length = st.st_size;
667 file->mode = st.st_mode;
668 file->uid = st.st_uid;
669 file->gid = st.st_gid;
670 file->dev = st.st_dev;
671 file->inode = st.st_ino;
c627d613 672#ifdef HAVE_ST_RDEV
3ec4dd97 673 file->rdev = st.st_rdev;
c627d613
AT
674#endif
675
676#if SUPPORT_LINKS
3ec4dd97 677 if (S_ISLNK(st.st_mode)) {
3d382777 678 file->link = STRDUP(ap, linkbuf);
3ec4dd97 679 }
c627d613
AT
680#endif
681
1250f24e 682 if (always_checksum) {
ebed4c3a
MP
683 file->sum = (char *) MALLOC(ap, MD4_SUM_LENGTH);
684 if (!file->sum)
685 out_of_memory("md4 sum");
1250f24e
AT
686 /* drat. we have to provide a null checksum for non-regular
687 files in order to be compatible with earlier versions
688 of rsync */
689 if (S_ISREG(st.st_mode)) {
ebed4c3a 690 file_checksum(fname, file->sum, st.st_size);
1250f24e
AT
691 } else {
692 memset(file->sum, 0, MD4_SUM_LENGTH);
693 }
ebed4c3a 694 }
c627d613 695
3ec4dd97
AT
696 if (flist_dir) {
697 static char *lastdir;
ebed4c3a 698 if (lastdir && strcmp(lastdir, flist_dir) == 0) {
3ec4dd97
AT
699 file->basedir = lastdir;
700 } else {
a20aa42a 701 file->basedir = strdup(flist_dir);
3ec4dd97
AT
702 lastdir = file->basedir;
703 }
704 } else {
705 file->basedir = NULL;
706 }
c627d613 707
3ec4dd97 708 if (!S_ISDIR(st.st_mode))
a800434a 709 stats.total_size += st.st_size;
c627d613 710
3ec4dd97 711 return file;
c627d613
AT
712}
713
714
715
ebed4c3a
MP
716void send_file_name(int f, struct file_list *flist, char *fname,
717 int recursive, unsigned base_flags)
c627d613 718{
ebed4c3a
MP
719 struct file_struct *file;
720
721 file = make_file(f, fname, &flist->string_area, 0);
722
723 if (!file)
724 return;
725
726 if (show_build_progress_p() & !(flist->count % 100))
727 emit_build_progress(flist);
728
d9d6bc52 729 flist_expand(flist);
ebed4c3a
MP
730
731 if (write_batch) /* dw */
732 file->flags = FLAG_DELETE;
733
734 if (strcmp(file->basename, "")) {
735 flist->files[flist->count++] = file;
736 send_file_entry(file, f, base_flags);
737 }
738
739 if (S_ISDIR(file->mode) && recursive) {
740 struct exclude_struct **last_exclude_list =
741 local_exclude_list;
742 send_directory(f, flist, f_name(file));
743 local_exclude_list = last_exclude_list;
744 return;
745 }
c627d613
AT
746}
747
748
749
ebed4c3a 750static void send_directory(int f, struct file_list *flist, char *dir)
c627d613 751{
3ec4dd97
AT
752 DIR *d;
753 struct dirent *di;
754 char fname[MAXPATHLEN];
755 int l;
756 char *p;
757
758 d = opendir(dir);
759 if (!d) {
6ba9279f 760 io_error = 1;
ebed4c3a 761 rprintf(FERROR, "opendir(%s): %s\n", dir, strerror(errno));
3ec4dd97
AT
762 return;
763 }
c627d613 764
ebed4c3a 765 strlcpy(fname, dir, MAXPATHLEN);
3ec4dd97 766 l = strlen(fname);
ebed4c3a
MP
767 if (fname[l - 1] != '/') {
768 if (l == MAXPATHLEN - 1) {
6ba9279f 769 io_error = 1;
ebed4c3a
MP
770 rprintf(FERROR,
771 "skipping long-named directory %s\n",
772 fname);
3ec4dd97
AT
773 closedir(d);
774 return;
775 }
ebed4c3a 776 strlcat(fname, "/", MAXPATHLEN);
3ec4dd97
AT
777 l++;
778 }
779 p = fname + strlen(fname);
c627d613 780
3d913675
AT
781 local_exclude_list = NULL;
782
3ec4dd97 783 if (cvs_exclude) {
ebed4c3a
MP
784 if (strlen(fname) + strlen(".cvsignore") <= MAXPATHLEN - 1) {
785 strcpy(p, ".cvsignore");
786 local_exclude_list =
787 make_exclude_list(fname, NULL, 0, 0);
3ec4dd97 788 } else {
6ba9279f 789 io_error = 1;
ebed4c3a
MP
790 rprintf(FINFO,
791 "cannot cvs-exclude in long-named directory %s\n",
792 fname);
3ec4dd97 793 }
ebed4c3a
MP
794 }
795
796 for (di = readdir(d); di; di = readdir(d)) {
d6e6ecbd 797 char *dname = d_name(di);
ebed4c3a 798 if (strcmp(dname, ".") == 0 || strcmp(dname, "..") == 0)
3ec4dd97 799 continue;
ebed4c3a
MP
800 strlcpy(p, dname, MAXPATHLEN - l);
801 send_file_name(f, flist, fname, recurse, 0);
3ec4dd97 802 }
c627d613 803
3d913675
AT
804 if (local_exclude_list) {
805 add_exclude_list("!", &local_exclude_list, 0);
806 }
807
3ec4dd97 808 closedir(d);
c627d613
AT
809}
810
811
58225000
MP
812/*
813 *
814 * I *think* f==-1 means that the list should just be built in memory
815 * and not transmitted. But who can tell? -- mbp
816 */
ebed4c3a 817struct file_list *send_file_list(int f, int argc, char *argv[])
c627d613 818{
ebed4c3a 819 int i, l;
bcacc18b 820 STRUCT_STAT st;
ebed4c3a
MP
821 char *p, *dir, *olddir;
822 char lastpath[MAXPATHLEN] = "";
649d65ed 823 struct file_list *flist;
a800434a 824 int64 start_write;
649d65ed
AT
825
826 if (verbose && recurse && !am_server && f != -1) {
58225000 827 rprintf(FINFO, RSYNC_NAME ": building file list...\n");
ebed4c3a
MP
828 if (verbose > 1)
829 rprintf(FINFO, "\n");
9486289c 830 rflush(FINFO);
649d65ed 831 }
c627d613 832
a800434a
AT
833 start_write = stats.total_written;
834
3d382777 835 flist = flist_new();
c627d613 836
d6dead6b
AT
837 if (f != -1) {
838 io_start_buffering(f);
839 }
840
ebed4c3a 841 for (i = 0; i < argc; i++) {
b5313607 842 char *fname = topsrcname;
c627d613 843
ebed4c3a 844 strlcpy(fname, argv[i], MAXPATHLEN);
c627d613 845
649d65ed 846 l = strlen(fname);
ebed4c3a 847 if (l != 1 && fname[l - 1] == '/') {
53f821f1
DD
848 if ((l == 2) && (fname[0] == '.')) {
849 /* Turn ./ into just . rather than ./.
ebed4c3a
MP
850 This was put in to avoid a problem with
851 rsync -aR --delete from ./
852 The send_file_name() below of ./ was
853 mysteriously preventing deletes */
53f821f1
DD
854 fname[1] = 0;
855 } else {
ebed4c3a 856 strlcat(fname, ".", MAXPATHLEN);
53f821f1 857 }
649d65ed 858 }
c627d613 859
ebed4c3a 860 if (link_stat(fname, &st) != 0) {
f76933b1 861 if (f != -1) {
ebed4c3a
MP
862 io_error = 1;
863 rprintf(FERROR, "link_stat %s : %s\n",
864 fname, strerror(errno));
f76933b1 865 }
649d65ed
AT
866 continue;
867 }
c627d613 868
649d65ed 869 if (S_ISDIR(st.st_mode) && !recurse) {
ebed4c3a 870 rprintf(FINFO, "skipping directory %s\n", fname);
649d65ed
AT
871 continue;
872 }
c627d613 873
649d65ed 874 dir = NULL;
2bca43f6 875 olddir = NULL;
649d65ed
AT
876
877 if (!relative_paths) {
ebed4c3a 878 p = strrchr(fname, '/');
649d65ed
AT
879 if (p) {
880 *p = 0;
ebed4c3a 881 if (p == fname)
649d65ed
AT
882 dir = "/";
883 else
ebed4c3a
MP
884 dir = fname;
885 fname = p + 1;
649d65ed 886 }
ebed4c3a 887 } else if (f != -1 && (p = strrchr(fname, '/'))) {
649d65ed
AT
888 /* this ensures we send the intermediate directories,
889 thus getting their permissions right */
890 *p = 0;
ebed4c3a 891 if (strcmp(lastpath, fname)) {
37f9805d 892 strlcpy(lastpath, fname, sizeof(lastpath));
649d65ed 893 *p = '/';
ebed4c3a
MP
894 for (p = fname + 1; (p = strchr(p, '/'));
895 p++) {
6c82f74b 896 int copy_links_saved = copy_links;
245fbb51 897 int recurse_saved = recurse;
649d65ed 898 *p = 0;
b5313607 899 copy_links = copy_unsafe_links;
245fbb51
DD
900 /* set recurse to 1 to prevent make_file
901 from ignoring directory, but still
902 turn off the recursive parameter to
903 send_file_name */
904 recurse = 1;
ebed4c3a
MP
905 send_file_name(f, flist, fname, 0,
906 0);
6c82f74b 907 copy_links = copy_links_saved;
245fbb51 908 recurse = recurse_saved;
649d65ed
AT
909 *p = '/';
910 }
911 } else {
912 *p = '/';
913 }
914 }
ebed4c3a 915
649d65ed
AT
916 if (!*fname)
917 fname = ".";
ebed4c3a 918
649d65ed 919 if (dir && *dir) {
2bca43f6 920 olddir = push_dir(dir, 1);
5243c216
AT
921
922 if (!olddir) {
ebed4c3a
MP
923 io_error = 1;
924 rprintf(FERROR, "push_dir %s : %s\n",
925 dir, strerror(errno));
649d65ed
AT
926 continue;
927 }
5243c216 928
649d65ed 929 flist_dir = dir;
2bca43f6 930 }
ebed4c3a 931
2bca43f6
DD
932 if (one_file_system)
933 set_filesystem(fname);
934
ebed4c3a 935 send_file_name(f, flist, fname, recurse, FLAG_DELETE);
2bca43f6
DD
936
937 if (olddir != NULL) {
649d65ed 938 flist_dir = NULL;
5243c216 939 if (pop_dir(olddir) != 0) {
ebed4c3a
MP
940 rprintf(FERROR, "pop_dir %s : %s\n",
941 dir, strerror(errno));
65417579 942 exit_cleanup(RERR_FILESELECT);
649d65ed 943 }
649d65ed 944 }
649d65ed 945 }
dc5ddbcc 946
b5313607
DD
947 topsrcname[0] = '\0';
948
649d65ed 949 if (f != -1) {
ebed4c3a 950 send_file_entry(NULL, f, 0);
649d65ed 951 }
c627d613 952
58225000 953 finish_build_progress(flist);
ebed4c3a 954
0199b05f 955 clean_flist(flist, 0);
ebed4c3a 956
649d65ed 957 /* now send the uid/gid list. This was introduced in protocol
ebed4c3a 958 version 15 */
649d65ed
AT
959 if (f != -1 && remote_version >= 15) {
960 send_uid_list(f);
961 }
f6c34742 962
6ba9279f
AT
963 /* if protocol version is >= 17 then send the io_error flag */
964 if (f != -1 && remote_version >= 17) {
cda2ae84 965 extern int module_id;
ebed4c3a 966 write_int(f, lp_ignore_errors(module_id) ? 0 : io_error);
6ba9279f
AT
967 }
968
d6dead6b
AT
969 if (f != -1) {
970 io_end_buffering(f);
a800434a
AT
971 stats.flist_size = stats.total_written - start_write;
972 stats.num_files = flist->count;
ebed4c3a
MP
973 if (write_batch) /* dw */
974 write_batch_flist_info(flist->count, flist->files);
d6dead6b
AT
975 }
976
17faa41c 977 if (verbose > 2)
ebed4c3a 978 rprintf(FINFO, "send_file_list done\n");
17faa41c 979
649d65ed 980 return flist;
c627d613
AT
981}
982
983
984struct file_list *recv_file_list(int f)
985{
ebed4c3a
MP
986 struct file_list *flist;
987 unsigned char flags;
988 int64 start_read;
989 extern int list_only;
c627d613 990
ebed4c3a
MP
991 if (verbose && recurse && !am_server) {
992 rprintf(FINFO, "receiving file list ... ");
993 rflush(FINFO);
994 }
c627d613 995
ebed4c3a 996 start_read = stats.total_read;
a800434a 997
ebed4c3a
MP
998 flist = (struct file_list *) malloc(sizeof(flist[0]));
999 if (!flist)
1000 goto oom;
c627d613 1001
ebed4c3a
MP
1002 flist->count = 0;
1003 flist->malloced = 1000;
1004 flist->files =
1005 (struct file_struct **) malloc(sizeof(flist->files[0]) *
1006 flist->malloced);
1007 if (!flist->files)
1008 goto oom;
c627d613
AT
1009
1010
ebed4c3a 1011 for (flags = read_byte(f); flags; flags = read_byte(f)) {
d9d6bc52 1012 flist_expand(flist);
c627d613 1013
ebed4c3a 1014 receive_file_entry(&flist->files[i], flags, f);
c627d613 1015
ebed4c3a
MP
1016 if (S_ISREG(flist->files[i]->mode))
1017 stats.total_size += flist->files[i]->length;
c627d613 1018
ebed4c3a 1019 flist->count++;
c627d613 1020
ebed4c3a
MP
1021 if (verbose > 2)
1022 rprintf(FINFO, "recv_file_name(%s)\n",
1023 f_name(flist->files[i]));
1024 }
c627d613
AT
1025
1026
ebed4c3a
MP
1027 if (verbose > 2)
1028 rprintf(FINFO, "received %d names\n", flist->count);
c627d613 1029
ebed4c3a 1030 clean_flist(flist, relative_paths);
c627d613 1031
ebed4c3a
MP
1032 if (verbose && recurse && !am_server) {
1033 rprintf(FINFO, "done\n");
1034 }
a06d19e3 1035
ebed4c3a
MP
1036 /* now recv the uid/gid list. This was introduced in protocol version 15 */
1037 if (f != -1 && remote_version >= 15) {
1038 recv_uid_list(f, flist);
1039 }
f6c34742 1040
ebed4c3a
MP
1041 /* if protocol version is >= 17 then recv the io_error flag */
1042 if (f != -1 && remote_version >= 17 && !read_batch) { /* dw-added readbatch */
1043 extern int module_id;
1044 extern int ignore_errors;
1045 if (lp_ignore_errors(module_id) || ignore_errors) {
1046 read_int(f);
1047 } else {
1048 io_error |= read_int(f);
1049 }
1050 }
6ba9279f 1051
ebed4c3a
MP
1052 if (list_only) {
1053 int i;
1054 for (i = 0; i < flist->count; i++) {
1055 list_file_entry(flist->files[i]);
1056 }
1057 }
f7632fc6
AT
1058
1059
ebed4c3a
MP
1060 if (verbose > 2)
1061 rprintf(FINFO, "recv_file_list done\n");
17faa41c 1062
ebed4c3a
MP
1063 stats.flist_size = stats.total_read - start_read;
1064 stats.num_files = flist->count;
a800434a 1065
ebed4c3a 1066 return flist;
c627d613 1067
ebed4c3a
MP
1068 oom:
1069 out_of_memory("recv_file_list");
1070 return NULL; /* not reached */
c627d613
AT
1071}
1072
1073
e03dfae5
MP
1074/*
1075 * XXX: This is currently the hottest function while building the file
1076 * list, because building f_name()s every time is expensive.
1077 **/
ebed4c3a 1078int file_compare(struct file_struct **f1, struct file_struct **f2)
c627d613 1079{
ebed4c3a
MP
1080 if (!(*f1)->basename && !(*f2)->basename)
1081 return 0;
1082 if (!(*f1)->basename)
1083 return -1;
1084 if (!(*f2)->basename)
1085 return 1;
3ec4dd97 1086 if ((*f1)->dirname == (*f2)->dirname)
aa9b77a5 1087 return u_strcmp((*f1)->basename, (*f2)->basename);
ebed4c3a 1088 return u_strcmp(f_name(*f1), f_name(*f2));
c627d613
AT
1089}
1090
1091
ebed4c3a 1092int flist_find(struct file_list *flist, struct file_struct *f)
c627d613 1093{
ebed4c3a 1094 int low = 0, high = flist->count - 1;
d966ee25 1095
ebed4c3a
MP
1096 if (flist->count <= 0)
1097 return -1;
d966ee25
AT
1098
1099 while (low != high) {
ebed4c3a
MP
1100 int mid = (low + high) / 2;
1101 int ret =
1102 file_compare(&flist->files[flist_up(flist, mid)], &f);
1103 if (ret == 0)
1104 return flist_up(flist, mid);
d966ee25 1105 if (ret > 0) {
ebed4c3a 1106 high = mid;
d966ee25 1107 } else {
ebed4c3a 1108 low = mid + 1;
d966ee25
AT
1109 }
1110 }
1111
ebed4c3a
MP
1112 if (file_compare(&flist->files[flist_up(flist, low)], &f) == 0)
1113 return flist_up(flist, low);
d966ee25 1114 return -1;
c627d613
AT
1115}
1116
1117
3ec4dd97
AT
1118/*
1119 * free up one file
1120 */
66203a98 1121void free_file(struct file_struct *file)
c627d613 1122{
ebed4c3a
MP
1123 if (!file)
1124 return;
1125 if (file->basename)
1126 free(file->basename);
1127 if (file->link)
1128 free(file->link);
1129 if (file->sum)
1130 free(file->sum);
3d382777 1131 *file = null_file;
3ec4dd97 1132}
c627d613 1133
c627d613 1134
3d382777
AT
1135/*
1136 * allocate a new file list
1137 */
1138struct file_list *flist_new()
1139{
1140 struct file_list *flist;
1141
ebed4c3a
MP
1142 flist = (struct file_list *) malloc(sizeof(flist[0]));
1143 if (!flist)
1144 out_of_memory("send_file_list");
3d382777 1145
ebed4c3a 1146 flist->count = 0;
d9d6bc52
MP
1147 flist->malloced = 0;
1148 flist->files = NULL;
1149
3d382777
AT
1150#if ARENA_SIZE > 0
1151 flist->string_area = string_area_new(0);
1152#else
5c66303a 1153 flist->string_area = NULL;
3d382777
AT
1154#endif
1155 return flist;
1156}
ebed4c3a 1157
3ec4dd97
AT
1158/*
1159 * free up all elements in a flist
1160 */
1161void flist_free(struct file_list *flist)
1162{
1163 int i;
ebed4c3a 1164 for (i = 1; i < flist->count; i++) {
3d382777
AT
1165 if (!flist->string_area)
1166 free_file(flist->files[i]);
649d65ed 1167 free(flist->files[i]);
ebed4c3a 1168 }
d9d6bc52
MP
1169 /* FIXME: I don't think we generally need to blank the flist
1170 * since it's about to be freed. This will just cause more
1171 * memory traffic. If you want a freed-memory debugger, you
1172 * know where to get it. */
ebed4c3a
MP
1173 memset((char *) flist->files, 0,
1174 sizeof(flist->files[0]) * flist->count);
3ec4dd97 1175 free(flist->files);
3d382777
AT
1176 if (flist->string_area)
1177 string_area_free(flist->string_area);
ebed4c3a 1178 memset((char *) flist, 0, sizeof(*flist));
3ec4dd97 1179 free(flist);
c627d613
AT
1180}
1181
1182
1183/*
1184 * This routine ensures we don't have any duplicate names in our file list.
1185 * duplicate names can cause corruption because of the pipelining
1186 */
0199b05f 1187static void clean_flist(struct file_list *flist, int strip_root)
c627d613 1188{
3ec4dd97 1189 int i;
c627d613 1190
ebed4c3a 1191 if (!flist || flist->count == 0)
3ec4dd97 1192 return;
3ec4dd97 1193
ebed4c3a
MP
1194 qsort(flist->files, flist->count,
1195 sizeof(flist->files[0]), (int (*)()) file_compare);
1196
1197 for (i = 1; i < flist->count; i++) {
3ec4dd97 1198 if (flist->files[i]->basename &&
ebed4c3a 1199 flist->files[i - 1]->basename &&
3ec4dd97 1200 strcmp(f_name(flist->files[i]),
ebed4c3a 1201 f_name(flist->files[i - 1])) == 0) {
3ec4dd97 1202 if (verbose > 1 && !am_server)
ebed4c3a
MP
1203 rprintf(FINFO,
1204 "removing duplicate name %s from file list %d\n",
1205 f_name(flist->files[i - 1]),
1206 i - 1);
3d382777
AT
1207 /* it's not great that the flist knows the semantics of the
1208 * file memory usage, but i'd rather not add a flag byte
1209 * to that struct. XXX can i use a bit in the flags field? */
1210 if (flist->string_area)
1211 flist->files[i][0] = null_file;
1212 else
1213 free_file(flist->files[i]);
ebed4c3a 1214 }
3ec4dd97 1215 }
0199b05f 1216
736a6a29
MP
1217 /* FIXME: There is a bug here when filenames are repeated more
1218 * than once, because we don't handle freed files when doing
1219 * the comparison. */
1220
0199b05f
AT
1221 if (strip_root) {
1222 /* we need to strip off the root directory in the case
1223 of relative paths, but this must be done _after_
1224 the sorting phase */
ebed4c3a 1225 for (i = 0; i < flist->count; i++) {
0199b05f
AT
1226 if (flist->files[i]->dirname &&
1227 flist->files[i]->dirname[0] == '/') {
1228 memmove(&flist->files[i]->dirname[0],
1229 &flist->files[i]->dirname[1],
1230 strlen(flist->files[i]->dirname));
1231 }
ebed4c3a
MP
1232
1233 if (flist->files[i]->dirname &&
0199b05f
AT
1234 !flist->files[i]->dirname[0]) {
1235 flist->files[i]->dirname = NULL;
1236 }
1237 }
1238 }
1239
1240
ebed4c3a
MP
1241 if (verbose <= 3)
1242 return;
0199b05f 1243
ebed4c3a
MP
1244 for (i = 0; i < flist->count; i++) {
1245 rprintf(FINFO, "[%d] i=%d %s %s mode=0%o len=%.0f\n",
1246 (int) getpid(), i,
74e708d8
AT
1247 NS(flist->files[i]->dirname),
1248 NS(flist->files[i]->basename),
08a740ff 1249 (int) flist->files[i]->mode,
ebed4c3a 1250 (double) flist->files[i]->length);
0199b05f 1251 }
3ec4dd97
AT
1252}
1253
1254
1255/*
1256 * return the full filename of a flist entry
e03dfae5
MP
1257 *
1258 * This function is too expensive at the moment, because it copies
1259 * strings when often we only want to compare them. In any case,
1260 * using strlcat is silly because it will walk the string repeatedly.
3ec4dd97
AT
1261 */
1262char *f_name(struct file_struct *f)
1263{
1264 static char names[10][MAXPATHLEN];
1265 static int n;
1266 char *p = names[n];
1267
ebed4c3a
MP
1268 if (!f || !f->basename)
1269 return NULL;
3ec4dd97 1270
ebed4c3a 1271 n = (n + 1) % 10;
3ec4dd97
AT
1272
1273 if (f->dirname) {
e03dfae5
MP
1274 int off;
1275
1276 off = strlcpy(p, f->dirname, MAXPATHLEN);
ebed4c3a
MP
1277 off += strlcpy(p + off, "/", MAXPATHLEN - off);
1278 off += strlcpy(p + off, f->basename, MAXPATHLEN - off);
3ec4dd97 1279 } else {
37f9805d 1280 strlcpy(p, f->basename, MAXPATHLEN);
3ec4dd97
AT
1281 }
1282
1283 return p;
c627d613 1284}