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