fixed a bug in the handling of the new --relative option. The file was
[rsync/rsync.git] / flist.c
CommitLineData
c627d613
AT
1/*
2 Copyright (C) Andrew Tridgell 1996
3 Copyright (C) Paul Mackerras 1996
4
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 2 of the License, or
8 (at your option) any later version.
9
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
14
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
18*/
19
20/* generate and receive file lists */
21
22#include "rsync.h"
23
43a481dc
AT
24extern int csum_length;
25
c627d613
AT
26extern int verbose;
27extern int am_server;
28extern int always_checksum;
29extern off_t total_size;
30
31extern int cvs_exclude;
32
a06d19e3
AT
33extern int recurse;
34
c627d613
AT
35extern int one_file_system;
36extern int make_backups;
37extern int preserve_links;
dc5ddbcc 38extern int preserve_hard_links;
c627d613
AT
39extern int preserve_perms;
40extern int preserve_devices;
41extern int preserve_uid;
42extern int preserve_gid;
43extern int preserve_times;
6574b4f7 44extern int relative_paths;
c627d613
AT
45
46static char **local_exclude_list = NULL;
47
48static void clean_fname(char *name);
49
50
51/*
52 This function is used to check if a file should be included/excluded
53 from the list of files based on its name and type etc
54 */
55static int match_file_name(char *fname,struct stat *st)
56{
57 if (check_exclude(fname,local_exclude_list)) {
58 if (verbose > 2)
dc5ddbcc 59 fprintf(FERROR,"excluding file %s\n",fname);
c627d613
AT
60 return 0;
61 }
62 return 1;
63}
64
65/* used by the one_file_system code */
66static dev_t filesystem_dev;
67
68static void set_filesystem(char *fname)
69{
70 struct stat st;
71 if (lstat(fname,&st) != 0) return;
72 filesystem_dev = st.st_dev;
73}
74
75
76static void send_directory(int f,struct file_list *flist,char *dir);
77
78static char *flist_dir = NULL;
79
4fe159a8
AT
80extern void (*send_file_entry)(struct file_struct *file,int f);
81extern void (*receive_file_entry)(struct file_struct *file,
82 unsigned char flags,int f);
83
84
85void send_file_entry_v11(struct file_struct *file,int f)
c627d613 86{
182dca5c 87 unsigned char flags;
4fe159a8 88 static time_t last_time=0;
182dca5c 89 static mode_t last_mode=0;
dc5ddbcc 90 static dev_t last_rdev=0;
182dca5c
AT
91 static uid_t last_uid=0;
92 static gid_t last_gid=0;
4fe159a8
AT
93 static char lastname[MAXPATHLEN]="";
94 int l1,l2;
182dca5c 95
c627d613
AT
96 if (f == -1) return;
97
182dca5c
AT
98 if (!file) {
99 write_byte(f,0);
100 return;
101 }
102
103 flags = FILE_VALID;
104
105 if (file->mode == last_mode) flags |= SAME_MODE;
dc5ddbcc 106 if (file->rdev == last_rdev) flags |= SAME_RDEV;
182dca5c
AT
107 if (file->uid == last_uid) flags |= SAME_UID;
108 if (file->gid == last_gid) flags |= SAME_GID;
4fe159a8 109 if (file->modtime == last_time) flags |= SAME_TIME;
182dca5c 110
4fe159a8
AT
111 for (l1=0;lastname[l1] && file->name[l1] == lastname[l1];l1++) ;
112 l2 = strlen(file->name) - l1;
113
114 if (l1 > 0) flags |= SAME_NAME;
115 if (l2 > 255) flags |= LONG_NAME;
d89322c4 116
4fe159a8
AT
117 write_byte(f,flags);
118 if (flags & SAME_NAME)
119 write_byte(f,l1);
120 if (flags & LONG_NAME)
121 write_int(f,l2);
9f3541e6 122 else
4fe159a8
AT
123 write_byte(f,l2);
124 write_buf(f,file->name+l1,l2);
125
c627d613 126 write_int(f,(int)file->length);
4fe159a8
AT
127 if (!(flags & SAME_TIME))
128 write_int(f,(int)file->modtime);
182dca5c
AT
129 if (!(flags & SAME_MODE))
130 write_int(f,(int)file->mode);
131 if (preserve_uid && !(flags & SAME_UID))
c627d613 132 write_int(f,(int)file->uid);
182dca5c 133 if (preserve_gid && !(flags & SAME_GID))
c627d613 134 write_int(f,(int)file->gid);
dc5ddbcc
AT
135 if (preserve_devices && IS_DEVICE(file->mode) && !(flags & SAME_RDEV))
136 write_int(f,(int)file->rdev);
c627d613
AT
137
138#if SUPPORT_LINKS
139 if (preserve_links && S_ISLNK(file->mode)) {
140 write_int(f,strlen(file->link));
141 write_buf(f,file->link,strlen(file->link));
142 }
143#endif
144
dc5ddbcc
AT
145#if SUPPORT_HARD_LINKS
146 if (preserve_hard_links && S_ISREG(file->mode)) {
147 write_int(f,file->dev);
148 write_int(f,file->inode);
149 }
150#endif
151
c627d613 152 if (always_checksum) {
43a481dc 153 write_buf(f,file->sum,csum_length);
c627d613 154 }
182dca5c
AT
155
156 last_mode = file->mode;
dc5ddbcc 157 last_rdev = file->rdev;
182dca5c
AT
158 last_uid = file->uid;
159 last_gid = file->gid;
4fe159a8
AT
160 last_time = file->modtime;
161
13a1f792
AT
162 strncpy(lastname,file->name,MAXPATHLEN-1);
163 lastname[MAXPATHLEN-1] = 0;
182dca5c
AT
164}
165
166
167
4fe159a8
AT
168void receive_file_entry_v11(struct file_struct *file,
169 unsigned char flags,int f)
182dca5c 170{
d89322c4 171 static time_t last_time=0;
182dca5c 172 static mode_t last_mode=0;
dc5ddbcc 173 static dev_t last_rdev=0;
182dca5c
AT
174 static uid_t last_uid=0;
175 static gid_t last_gid=0;
4fe159a8
AT
176 static char lastname[MAXPATHLEN]="";
177 int l1=0,l2=0;
182dca5c 178
4fe159a8 179 if (flags & SAME_NAME)
9f3541e6 180 l1 = read_byte(f);
4fe159a8
AT
181
182 if (flags & LONG_NAME)
183 l2 = read_int(f);
184 else
185 l2 = read_byte(f);
182dca5c 186
dc5ddbcc
AT
187 bzero((char *)file,sizeof(*file));
188
182dca5c
AT
189 file->name = (char *)malloc(l1+l2+1);
190 if (!file->name) out_of_memory("receive_file_entry");
191
4fe159a8
AT
192 strncpy(file->name,lastname,l1);
193 read_buf(f,file->name+l1,l2);
182dca5c
AT
194 file->name[l1+l2] = 0;
195
182dca5c 196 file->length = (off_t)read_int(f);
4fe159a8 197 file->modtime = (flags & SAME_TIME) ? last_time : (time_t)read_int(f);
182dca5c
AT
198 file->mode = (flags & SAME_MODE) ? last_mode : (mode_t)read_int(f);
199 if (preserve_uid)
200 file->uid = (flags & SAME_UID) ? last_uid : (uid_t)read_int(f);
201 if (preserve_gid)
202 file->gid = (flags & SAME_GID) ? last_gid : (gid_t)read_int(f);
203 if (preserve_devices && IS_DEVICE(file->mode))
dc5ddbcc 204 file->rdev = (flags & SAME_RDEV) ? last_rdev : (dev_t)read_int(f);
182dca5c
AT
205
206#if SUPPORT_LINKS
207 if (preserve_links && S_ISLNK(file->mode)) {
208 int l = read_int(f);
209 file->link = (char *)malloc(l+1);
210 if (!file->link) out_of_memory("receive_file_entry");
211 read_buf(f,file->link,l);
212 file->link[l] = 0;
213 }
214#endif
dc5ddbcc
AT
215
216#if SUPPORT_HARD_LINKS
217 if (preserve_hard_links && S_ISREG(file->mode)) {
218 file->dev = read_int(f);
219 file->inode = read_int(f);
220 }
221#endif
182dca5c
AT
222
223 if (always_checksum)
43a481dc 224 read_buf(f,file->sum,csum_length);
182dca5c
AT
225
226 last_mode = file->mode;
dc5ddbcc 227 last_rdev = file->rdev;
182dca5c
AT
228 last_uid = file->uid;
229 last_gid = file->gid;
4fe159a8
AT
230 last_time = file->modtime;
231
13a1f792
AT
232 strncpy(lastname,file->name,MAXPATHLEN-1);
233 lastname[MAXPATHLEN-1] = 0;
c627d613
AT
234}
235
236
4fe159a8 237
a06d19e3 238static struct file_struct *make_file(char *fname)
c627d613
AT
239{
240 static struct file_struct file;
241 struct stat st;
242 char sum[SUM_LENGTH];
243
244 bzero(sum,SUM_LENGTH);
245
246 if (lstat(fname,&st) != 0) {
dc5ddbcc 247 fprintf(FERROR,"%s: %s\n",
c627d613
AT
248 fname,strerror(errno));
249 return NULL;
250 }
251
252 if (S_ISDIR(st.st_mode) && !recurse) {
dc5ddbcc 253 fprintf(FERROR,"skipping directory %s\n",fname);
c627d613
AT
254 return NULL;
255 }
256
257 if (one_file_system && st.st_dev != filesystem_dev)
258 return NULL;
259
260 if (!match_file_name(fname,&st))
261 return NULL;
262
263 if (verbose > 2)
dc5ddbcc
AT
264 fprintf(FERROR,"make_file(%s)\n",fname);
265
266 bzero((char *)&file,sizeof(file));
c627d613
AT
267
268 file.name = strdup(fname);
269 file.modtime = st.st_mtime;
270 file.length = st.st_size;
271 file.mode = st.st_mode;
272 file.uid = st.st_uid;
273 file.gid = st.st_gid;
dc5ddbcc
AT
274 file.dev = st.st_dev;
275 file.inode = st.st_ino;
c627d613 276#ifdef HAVE_ST_RDEV
dc5ddbcc 277 file.rdev = st.st_rdev;
c627d613
AT
278#endif
279
280#if SUPPORT_LINKS
281 if (S_ISLNK(st.st_mode)) {
282 int l;
283 char lnk[MAXPATHLEN];
284 if ((l=readlink(fname,lnk,MAXPATHLEN-1)) == -1) {
dc5ddbcc 285 fprintf(FERROR,"readlink %s : %s\n",fname,strerror(errno));
c627d613
AT
286 return NULL;
287 }
288 lnk[l] = 0;
289 file.link = strdup(lnk);
290 }
291#endif
292
293 if (always_checksum && S_ISREG(st.st_mode)) {
294 file_checksum(fname,file.sum,st.st_size);
295 }
296
297 if (flist_dir)
298 file.dir = strdup(flist_dir);
299 else
300 file.dir = NULL;
301
302 if (!S_ISDIR(st.st_mode))
303 total_size += st.st_size;
304
305 return &file;
306}
307
308
309
a06d19e3 310static void send_file_name(int f,struct file_list *flist,char *fname)
c627d613
AT
311{
312 struct file_struct *file;
313
a06d19e3 314 file = make_file(fname);
c627d613
AT
315
316 if (!file) return;
317
318 if (flist->count >= flist->malloced) {
f9c51620
AT
319 if (flist->malloced < 100)
320 flist->malloced += 100;
321 else
322 flist->malloced *= 1.8;
323 flist->files = (struct file_struct *)realloc(flist->files,
324 sizeof(flist->files[0])*
325 flist->malloced);
326 if (!flist->files)
327 out_of_memory("send_file_name");
c627d613
AT
328 }
329
e9d4e304 330 if (strcmp(file->name,"/")) {
c627d613
AT
331 flist->files[flist->count++] = *file;
332 send_file_entry(file,f);
333 }
334
335 if (S_ISDIR(file->mode) && recurse) {
336 char **last_exclude_list = local_exclude_list;
337 send_directory(f,flist,file->name);
338 local_exclude_list = last_exclude_list;
339 return;
340 }
341}
342
343
344
345static void send_directory(int f,struct file_list *flist,char *dir)
346{
347 DIR *d;
348 struct dirent *di;
349 char fname[MAXPATHLEN];
350 int l;
351 char *p;
352
353 d = opendir(dir);
354 if (!d) {
dc5ddbcc 355 fprintf(FERROR,"%s: %s\n",
c627d613
AT
356 dir,strerror(errno));
357 return;
358 }
359
13a1f792
AT
360 strncpy(fname,dir,MAXPATHLEN-1);
361 fname[MAXPATHLEN-1]=0;
c627d613 362 l = strlen(fname);
9a52223b
AT
363 if (fname[l-1] != '/') {
364 strcat(fname,"/");
365 l++;
366 }
c627d613
AT
367 p = fname + strlen(fname);
368
369 if (cvs_exclude) {
370 strcpy(p,".cvsignore");
371 local_exclude_list = make_exclude_list(fname,NULL,0);
372 }
373
374 for (di=readdir(d); di; di=readdir(d)) {
375 if (strcmp(di->d_name,".")==0 ||
376 strcmp(di->d_name,"..")==0)
377 continue;
9a52223b 378 strncpy(p,di->d_name,MAXPATHLEN-(l+1));
a06d19e3 379 send_file_name(f,flist,fname);
c627d613
AT
380 }
381
382 closedir(d);
383}
384
385
386
a06d19e3 387struct file_list *send_file_list(int f,int argc,char *argv[])
c627d613
AT
388{
389 int i,l;
390 struct stat st;
391 char *p,*dir;
392 char dbuf[MAXPATHLEN];
393 struct file_list *flist;
394
a06d19e3 395 if (verbose && recurse && !am_server) {
dc5ddbcc
AT
396 fprintf(FINFO,"building file list ... ");
397 fflush(FINFO);
c627d613
AT
398 }
399
400 flist = (struct file_list *)malloc(sizeof(flist[0]));
401 if (!flist) out_of_memory("send_file_list");
402
403 flist->count=0;
404 flist->malloced = 100;
405 flist->files = (struct file_struct *)malloc(sizeof(flist->files[0])*
406 flist->malloced);
407 if (!flist->files) out_of_memory("send_file_list");
408
409 for (i=0;i<argc;i++) {
410 char fname2[MAXPATHLEN];
411 char *fname = fname2;
412
13a1f792
AT
413 strncpy(fname,argv[i],MAXPATHLEN-1);
414 fname[MAXPATHLEN-1] = 0;
c627d613
AT
415
416 l = strlen(fname);
417 if (l != 1 && fname[l-1] == '/') {
418 strcat(fname,".");
419 }
420
421 if (lstat(fname,&st) != 0) {
dc5ddbcc 422 fprintf(FERROR,"%s : %s\n",fname,strerror(errno));
c627d613
AT
423 continue;
424 }
425
426 if (S_ISDIR(st.st_mode) && !recurse) {
dc5ddbcc 427 fprintf(FERROR,"skipping directory %s\n",fname);
c627d613
AT
428 continue;
429 }
430
431 dir = NULL;
6574b4f7
AT
432
433 if (!relative_paths) {
434 p = strrchr(fname,'/');
435 if (p) {
436 *p = 0;
437 if (p == fname)
438 dir = "/";
439 else
440 dir = fname;
441 fname = p+1;
442 }
c627d613 443 }
6574b4f7 444
c627d613
AT
445 if (!*fname)
446 fname = ".";
447
448 if (dir && *dir) {
449 if (getcwd(dbuf,MAXPATHLEN-1) == NULL) {
dc5ddbcc 450 fprintf(FERROR,"getwd : %s\n",strerror(errno));
34ccb63e 451 exit_cleanup(1);
c627d613
AT
452 }
453 if (chdir(dir) != 0) {
dc5ddbcc 454 fprintf(FERROR,"chdir %s : %s\n",dir,strerror(errno));
c627d613
AT
455 continue;
456 }
457 flist_dir = dir;
458 if (one_file_system)
459 set_filesystem(fname);
a06d19e3 460 send_file_name(f,flist,fname);
c627d613
AT
461 flist_dir = NULL;
462 if (chdir(dbuf) != 0) {
dc5ddbcc 463 fprintf(FERROR,"chdir %s : %s\n",dbuf,strerror(errno));
34ccb63e 464 exit_cleanup(1);
c627d613
AT
465 }
466 continue;
467 }
468
469 if (one_file_system)
470 set_filesystem(fname);
a06d19e3 471 send_file_name(f,flist,fname);
c627d613
AT
472 }
473
474 if (f != -1) {
182dca5c 475 send_file_entry(NULL,f);
c627d613
AT
476 write_flush(f);
477 }
478
a06d19e3 479 if (verbose && recurse && !am_server)
dc5ddbcc
AT
480 fprintf(FINFO,"done\n");
481
482 clean_flist(flist);
c627d613
AT
483
484 return flist;
485}
486
487
488struct file_list *recv_file_list(int f)
489{
c627d613 490 struct file_list *flist;
182dca5c 491 unsigned char flags;
c627d613 492
a06d19e3
AT
493 if (verbose && recurse && !am_server) {
494 fprintf(FINFO,"receiving file list ... ");
495 fflush(FINFO);
496 }
c627d613
AT
497
498 flist = (struct file_list *)malloc(sizeof(flist[0]));
499 if (!flist)
500 goto oom;
501
502 flist->count=0;
503 flist->malloced=100;
504 flist->files = (struct file_struct *)malloc(sizeof(flist->files[0])*
505 flist->malloced);
506 if (!flist->files)
507 goto oom;
508
509
182dca5c 510 for (flags=read_byte(f); flags; flags=read_byte(f)) {
c627d613
AT
511 int i = flist->count;
512
513 if (i >= flist->malloced) {
f9c51620
AT
514 if (flist->malloced < 100)
515 flist->malloced += 100;
516 else
517 flist->malloced *= 1.8;
518 flist->files =(struct file_struct *)realloc(flist->files,
519 sizeof(flist->files[0])*
520 flist->malloced);
521 if (!flist->files)
522 goto oom;
c627d613
AT
523 }
524
182dca5c 525 receive_file_entry(&flist->files[i],flags,f);
c627d613
AT
526
527 if (S_ISREG(flist->files[i].mode))
528 total_size += flist->files[i].length;
529
530 flist->count++;
531
532 if (verbose > 2)
dc5ddbcc 533 fprintf(FERROR,"recv_file_name(%s)\n",flist->files[i].name);
c627d613
AT
534 }
535
536
537 if (verbose > 2)
dc5ddbcc 538 fprintf(FERROR,"received %d names\n",flist->count);
c627d613
AT
539
540 clean_flist(flist);
541
a06d19e3
AT
542 if (verbose && recurse && !am_server) {
543 fprintf(FINFO,"done\n");
544 }
545
c627d613
AT
546 return flist;
547
548oom:
549 out_of_memory("recv_file_list");
550 return NULL; /* not reached */
551}
552
553
dc5ddbcc 554int file_compare(struct file_struct *f1,struct file_struct *f2)
c627d613
AT
555{
556 if (!f1->name && !f2->name) return 0;
557 if (!f1->name) return -1;
558 if (!f2->name) return 1;
559 return strcmp(f1->name,f2->name);
560}
561
562
d966ee25
AT
563/* we need this function because of the silly way in which duplicate
564 entries are handled in the file lists - we can't change this
565 without breaking existing versions */
566static int flist_up(struct file_list *flist, int i)
567{
568 while (!flist->files[i].name) i++;
569 return i;
570}
571
572
c627d613
AT
573int flist_find(struct file_list *flist,struct file_struct *f)
574{
d966ee25
AT
575 int low=0,high=flist->count-1;
576
577 if (flist->count <= 0) return -1;
578
579 while (low != high) {
580 int mid = (low+high)/2;
581 int ret = file_compare(&flist->files[flist_up(flist, mid)],f);
582 if (ret == 0) return flist_up(flist, mid);
583 if (ret > 0) {
584 high=mid;
585 } else {
586 low=mid+1;
587 }
588 }
589
590 if (file_compare(&flist->files[flist_up(flist,low)],f) == 0)
591 return flist_up(flist,low);
592 return -1;
c627d613
AT
593}
594
595
596static void clean_fname(char *name)
597{
598 char *p;
599 int l;
600 int modified = 1;
601
602 if (!name) return;
603
604 while (modified) {
605 modified = 0;
606
607 if ((p=strstr(name,"/./"))) {
608 modified = 1;
609 while (*p) {
610 p[0] = p[2];
611 p++;
612 }
613 }
614
615 if ((p=strstr(name,"//"))) {
616 modified = 1;
617 while (*p) {
618 p[0] = p[1];
619 p++;
620 }
621 }
622
623 if (strncmp(p=name,"./",2) == 0) {
624 modified = 1;
625 while (*p) {
626 p[0] = p[2];
627 p++;
628 }
629 }
630
631 l = strlen(p=name);
632 if (l > 1 && p[l-1] == '/') {
633 modified = 1;
634 p[l-1] = 0;
635 }
636 }
637}
638
639
640/*
641 * This routine ensures we don't have any duplicate names in our file list.
642 * duplicate names can cause corruption because of the pipelining
643 */
644void clean_flist(struct file_list *flist)
645{
646 int i;
647
648 if (!flist || flist->count == 0)
649 return;
650
651 for (i=0;i<flist->count;i++) {
652 clean_fname(flist->files[i].name);
653 }
654
655 qsort(flist->files,flist->count,
656 sizeof(flist->files[0]),
dc5ddbcc 657 (int (*)())file_compare);
c627d613
AT
658
659 for (i=1;i<flist->count;i++) {
660 if (flist->files[i].name &&
661 strcmp(flist->files[i].name,flist->files[i-1].name) == 0) {
662 if (verbose > 1 && !am_server)
dc5ddbcc
AT
663 fprintf(FERROR,"removing duplicate name %s from file list %d\n",
664 flist->files[i-1].name,i-1);
c627d613 665 free(flist->files[i-1].name);
dc5ddbcc
AT
666 bzero((char *)&flist->files[i-1],sizeof(flist->files[i-1]));
667 }
c627d613
AT
668 }
669}
670