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