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