Commit | Line | Data |
---|---|---|
e327acec MP |
1 | /* -*- c-file-style: "linux" -*- |
2 | ||
3 | Copyright (C) 1996-2000 by Andrew Tridgell | |
2f03f956 AT |
4 | Copyright (C) Paul Mackerras 1996 |
5 | ||
6 | This program is free software; you can redistribute it and/or modify | |
7 | it under the terms of the GNU General Public License as published by | |
8 | the Free Software Foundation; either version 2 of the License, or | |
9 | (at your option) any later version. | |
10 | ||
11 | This program is distributed in the hope that it will be useful, | |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
17 | along with this program; if not, write to the Free Software | |
18 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. | |
19 | */ | |
20 | ||
21 | #include "rsync.h" | |
22 | ||
23 | extern int verbose; | |
24 | extern int recurse; | |
25 | extern int delete_mode; | |
d04e9c51 | 26 | extern int protocol_version; |
2f03f956 AT |
27 | extern int csum_length; |
28 | extern struct stats stats; | |
29 | extern int dry_run; | |
30 | extern int am_server; | |
31 | extern int relative_paths; | |
32 | extern int preserve_hard_links; | |
33 | extern int cvs_exclude; | |
34 | extern int io_error; | |
35 | extern char *tmpdir; | |
375a4556 | 36 | extern char *compare_dest; |
53dd3135 | 37 | extern int make_backups; |
16417f8b | 38 | extern int do_progress; |
d74a2e3e | 39 | extern char *backup_dir; |
53dd3135 | 40 | extern char *backup_suffix; |
d74a2e3e | 41 | extern int backup_suffix_len; |
2f03f956 | 42 | |
2f03f956 | 43 | static struct delete_list { |
6abd193f MP |
44 | DEV64_T dev; |
45 | INO64_T inode; | |
2f03f956 AT |
46 | } *delete_list; |
47 | static int dlist_len, dlist_alloc_len; | |
48 | ||
2f03f956 AT |
49 | /* yuck! This function wouldn't have been necessary if I had the sorting |
50 | algorithm right. Unfortunately fixing the sorting algorithm would introduce | |
51 | a backward incompatibility as file list indexes are sent over the link. | |
52 | */ | |
53 | static int delete_already_done(struct file_list *flist,int j) | |
54 | { | |
55 | int i; | |
56 | STRUCT_STAT st; | |
57 | ||
58 | if (link_stat(f_name(flist->files[j]), &st)) return 1; | |
59 | ||
60 | for (i=0;i<dlist_len;i++) { | |
61 | if (st.st_ino == delete_list[i].inode && | |
d01350a8 | 62 | (DEV64_T)st.st_dev == delete_list[i].dev) |
2f03f956 AT |
63 | return 1; |
64 | } | |
65 | ||
66 | return 0; | |
67 | } | |
68 | ||
69 | static void add_delete_entry(struct file_struct *file) | |
70 | { | |
71 | if (dlist_len == dlist_alloc_len) { | |
72 | dlist_alloc_len += 1024; | |
73 | delete_list = (struct delete_list *)Realloc(delete_list, sizeof(delete_list[0])*dlist_alloc_len); | |
74 | if (!delete_list) out_of_memory("add_delete_entry"); | |
75 | } | |
76 | ||
77 | delete_list[dlist_len].dev = file->dev; | |
78 | delete_list[dlist_len].inode = file->inode; | |
79 | dlist_len++; | |
80 | ||
81 | if (verbose > 3) | |
82 | rprintf(FINFO,"added %s to delete list\n", f_name(file)); | |
83 | } | |
84 | ||
d74a2e3e | 85 | static void delete_one(char *fn, int is_dir) |
2f03f956 | 86 | { |
d74a2e3e WD |
87 | if (!is_dir) { |
88 | if (robust_unlink(fn) != 0) { | |
ea42541f WD |
89 | rprintf(FERROR, "delete_one: unlink %s failed: %s\n", |
90 | full_fname(fn), strerror(errno)); | |
2f03f956 | 91 | } else if (verbose) { |
d74a2e3e | 92 | rprintf(FINFO, "deleting %s\n", fn); |
2f03f956 AT |
93 | } |
94 | } else { | |
d74a2e3e WD |
95 | if (do_rmdir(fn) != 0) { |
96 | if (errno != ENOTEMPTY && errno != EEXIST) { | |
ea42541f WD |
97 | rprintf(FERROR, "delete_one: rmdir %s failed: %s\n", |
98 | full_fname(fn), strerror(errno)); | |
d74a2e3e | 99 | } |
2f03f956 | 100 | } else if (verbose) { |
d74a2e3e | 101 | rprintf(FINFO, "deleting directory %s\n", fn); |
2f03f956 AT |
102 | } |
103 | } | |
104 | } | |
105 | ||
106 | ||
d74a2e3e WD |
107 | static int is_backup_file(char *fn) |
108 | { | |
109 | int k = strlen(fn) - backup_suffix_len; | |
110 | return k > 0 && strcmp(fn+k, backup_suffix) == 0; | |
111 | } | |
2f03f956 AT |
112 | |
113 | ||
114 | /* this deletes any files on the receiving side that are not present | |
115 | on the sending side. For version 1.6.4 I have changed the behaviour | |
116 | to match more closely what most people seem to expect of this option */ | |
6957ae33 | 117 | void delete_files(struct file_list *flist) |
2f03f956 AT |
118 | { |
119 | struct file_list *local_file_list; | |
120 | int i, j; | |
121 | char *name; | |
cda2ae84 | 122 | extern int module_id; |
ef55c686 | 123 | extern int ignore_errors; |
0b73ca12 AT |
124 | extern int max_delete; |
125 | static int deletion_count; | |
2f03f956 AT |
126 | |
127 | if (cvs_exclude) | |
128 | add_cvs_excludes(); | |
129 | ||
ef55c686 | 130 | if (io_error && !(lp_ignore_errors(module_id) || ignore_errors)) { |
2f03f956 AT |
131 | rprintf(FINFO,"IO error encountered - skipping file deletion\n"); |
132 | return; | |
133 | } | |
134 | ||
135 | for (j=0;j<flist->count;j++) { | |
136 | if (!S_ISDIR(flist->files[j]->mode) || | |
137 | !(flist->files[j]->flags & FLAG_DELETE)) continue; | |
138 | ||
d04e9c51 | 139 | if (protocol_version < 19 && |
2f03f956 AT |
140 | delete_already_done(flist, j)) continue; |
141 | ||
142 | name = strdup(f_name(flist->files[j])); | |
143 | ||
144 | if (!(local_file_list = send_file_list(-1,1,&name))) { | |
145 | free(name); | |
146 | continue; | |
147 | } | |
148 | ||
149 | if (verbose > 1) | |
150 | rprintf(FINFO,"deleting in %s\n", name); | |
151 | ||
152 | for (i=local_file_list->count-1;i>=0;i--) { | |
0b73ca12 | 153 | if (max_delete && deletion_count > max_delete) break; |
2f03f956 | 154 | if (!local_file_list->files[i]->basename) continue; |
d04e9c51 | 155 | if (protocol_version < 19 && |
2f03f956 AT |
156 | S_ISDIR(local_file_list->files[i]->mode)) |
157 | add_delete_entry(local_file_list->files[i]); | |
158 | if (-1 == flist_find(flist,local_file_list->files[i])) { | |
53dd3135 | 159 | char *f = f_name(local_file_list->files[i]); |
d74a2e3e | 160 | if (make_backups && (backup_dir || !is_backup_file(f))) { |
53dd3135 | 161 | (void) make_backup(f); |
d74a2e3e WD |
162 | if (verbose) |
163 | rprintf(FINFO, "deleting %s\n", f); | |
53dd3135 | 164 | } else { |
d74a2e3e WD |
165 | int mode = local_file_list->files[i]->mode; |
166 | delete_one(f, S_ISDIR(mode) != 0); | |
53dd3135 | 167 | } |
31f3b68a | 168 | deletion_count++; |
53dd3135 | 169 | } |
2f03f956 AT |
170 | } |
171 | flist_free(local_file_list); | |
172 | free(name); | |
173 | } | |
174 | } | |
175 | ||
176 | ||
52d3e106 S |
177 | /* |
178 | * get_tmpname() - create a tmp filename for a given filename | |
179 | * | |
180 | * If a tmpdir is defined, use that as the directory to | |
181 | * put it in. Otherwise, the tmp filename is in the same | |
182 | * directory as the given name. Note that there may be no | |
183 | * directory at all in the given name! | |
184 | * | |
185 | * The tmp filename is basically the given filename with a | |
186 | * dot prepended, and .XXXXXX appended (for mkstemp() to | |
187 | * put its unique gunk in). Take care to not exceed | |
188 | * either the MAXPATHLEN or NAME_MAX, esp. the last, as | |
189 | * the basename basically becomes 8 chars longer. In that | |
190 | * case, the original name is shortened sufficiently to | |
191 | * make it all fit. | |
192 | * | |
193 | * Of course, there's no real reason for the tmp name to | |
194 | * look like the original, except to satisfy us humans. | |
195 | * As long as it's unique, rsync will work. | |
196 | */ | |
197 | ||
2f03f956 AT |
198 | static int get_tmpname(char *fnametmp, char *fname) |
199 | { | |
200 | char *f; | |
52d3e106 S |
201 | int length = 0; |
202 | int maxname; | |
2f03f956 | 203 | |
2f03f956 | 204 | if (tmpdir) { |
52d3e106 S |
205 | strlcpy(fnametmp, tmpdir, MAXPATHLEN - 2); |
206 | length = strlen(fnametmp); | |
207 | fnametmp[length++] = '/'; | |
208 | fnametmp[length] = '\0'; /* always NULL terminated */ | |
0c2ef5f4 | 209 | } |
52d3e106 | 210 | |
0c2ef5f4 | 211 | if ((f = strrchr(fname, '/')) != NULL) { |
52d3e106 S |
212 | ++f; |
213 | if (!tmpdir) { | |
214 | length = f - fname; | |
0c2ef5f4 | 215 | /* copy up to and including the slash */ |
52d3e106 | 216 | strlcpy(fnametmp, fname, length + 1); |
0c2ef5f4 | 217 | } |
52d3e106 S |
218 | } else { |
219 | f = fname; | |
2f03f956 | 220 | } |
52d3e106 S |
221 | fnametmp[length++] = '.'; |
222 | fnametmp[length] = '\0'; /* always NULL terminated */ | |
2f03f956 | 223 | |
52d3e106 | 224 | maxname = MIN(MAXPATHLEN - 7 - length, NAME_MAX - 8); |
2f03f956 | 225 | |
0c2ef5f4 | 226 | if (maxname < 1) { |
52d3e106 S |
227 | rprintf(FERROR, "temporary filename too long: %s\n", fname); |
228 | fnametmp[0] = '\0'; | |
2f03f956 AT |
229 | return 0; |
230 | } | |
231 | ||
52d3e106 S |
232 | strlcpy(fnametmp + length, f, maxname); |
233 | strcat(fnametmp + length, ".XXXXXX"); | |
2f03f956 AT |
234 | |
235 | return 1; | |
236 | } | |
237 | ||
238 | ||
239 | static int receive_data(int f_in,struct map_struct *buf,int fd,char *fname, | |
240 | OFF_T total_size) | |
241 | { | |
9dd891bb | 242 | int i; |
fc0257c9 S |
243 | struct sum_struct sum; |
244 | unsigned int len; | |
2f03f956 AT |
245 | OFF_T offset = 0; |
246 | OFF_T offset2; | |
247 | char *data; | |
248 | static char file_sum1[MD4_SUM_LENGTH]; | |
249 | static char file_sum2[MD4_SUM_LENGTH]; | |
250 | char *map=NULL; | |
251 | ||
fc0257c9 | 252 | read_sum_head(f_in, &sum); |
2f03f956 AT |
253 | |
254 | sum_init(); | |
255 | ||
256 | for (i=recv_token(f_in,&data); i != 0; i=recv_token(f_in,&data)) { | |
16417f8b WD |
257 | if (do_progress) |
258 | show_progress(offset, total_size); | |
2f03f956 AT |
259 | |
260 | if (i > 0) { | |
261 | extern int cleanup_got_literal; | |
262 | ||
263 | if (verbose > 3) { | |
5f808dfb AT |
264 | rprintf(FINFO,"data recv %d at %.0f\n", |
265 | i,(double)offset); | |
2f03f956 AT |
266 | } |
267 | ||
268 | stats.literal_data += i; | |
269 | cleanup_got_literal = 1; | |
270 | ||
271 | sum_update(data,i); | |
272 | ||
273 | if (fd != -1 && write_file(fd,data,i) != i) { | |
ea42541f WD |
274 | rprintf(FERROR, "write failed on %s: %s\n", |
275 | full_fname(fname), strerror(errno)); | |
65417579 | 276 | exit_cleanup(RERR_FILEIO); |
2f03f956 AT |
277 | } |
278 | offset += i; | |
279 | continue; | |
280 | } | |
281 | ||
282 | i = -(i+1); | |
fc0257c9 S |
283 | offset2 = i*(OFF_T)sum.blength; |
284 | len = sum.blength; | |
285 | if (i == (int) sum.count-1 && sum.remainder != 0) | |
286 | len = sum.remainder; | |
2f03f956 AT |
287 | |
288 | stats.matched_data += len; | |
289 | ||
290 | if (verbose > 3) | |
5f808dfb AT |
291 | rprintf(FINFO,"chunk[%d] of size %d at %.0f offset=%.0f\n", |
292 | i,len,(double)offset2,(double)offset); | |
2f03f956 | 293 | |
c55f7021 AT |
294 | if (buf) { |
295 | map = map_ptr(buf,offset2,len); | |
2f03f956 | 296 | |
c55f7021 AT |
297 | see_token(map, len); |
298 | sum_update(map,len); | |
299 | } | |
2f03f956 | 300 | |
a261989c | 301 | if (fd != -1 && write_file(fd,map,len) != (int) len) { |
ea42541f WD |
302 | rprintf(FERROR, "write failed on %s: %s\n", |
303 | full_fname(fname), strerror(errno)); | |
65417579 | 304 | exit_cleanup(RERR_FILEIO); |
2f03f956 AT |
305 | } |
306 | offset += len; | |
307 | } | |
308 | ||
16417f8b WD |
309 | if (do_progress) |
310 | end_progress(total_size); | |
2f03f956 AT |
311 | |
312 | if (fd != -1 && offset > 0 && sparse_end(fd) != 0) { | |
ea42541f WD |
313 | rprintf(FERROR, "write failed on %s: %s\n", |
314 | full_fname(fname), strerror(errno)); | |
65417579 | 315 | exit_cleanup(RERR_FILEIO); |
2f03f956 AT |
316 | } |
317 | ||
318 | sum_end(file_sum1); | |
319 | ||
bc63ae3f S |
320 | read_buf(f_in,file_sum2,MD4_SUM_LENGTH); |
321 | if (verbose > 2) { | |
322 | rprintf(FINFO,"got file_sum\n"); | |
323 | } | |
324 | if (fd != -1 | |
325 | && memcmp(file_sum1,file_sum2,MD4_SUM_LENGTH) != 0) { | |
326 | return 0; | |
2f03f956 AT |
327 | } |
328 | return 1; | |
329 | } | |
330 | ||
331 | ||
b35d0d8e MP |
332 | /** |
333 | * main routine for receiver process. | |
334 | * | |
335 | * Receiver process runs on the same host as the generator process. */ | |
2f03f956 AT |
336 | int recv_files(int f_in,struct file_list *flist,char *local_name,int f_gen) |
337 | { | |
338 | int fd1,fd2; | |
339 | STRUCT_STAT st; | |
340 | char *fname; | |
f62c17e3 | 341 | char template[MAXPATHLEN]; |
2f03f956 | 342 | char fnametmp[MAXPATHLEN]; |
375a4556 DD |
343 | char *fnamecmp; |
344 | char fnamecmpbuf[MAXPATHLEN]; | |
2f03f956 AT |
345 | struct map_struct *buf; |
346 | int i; | |
347 | struct file_struct *file; | |
348 | int phase=0; | |
349 | int recv_ok; | |
1b7c47cb | 350 | extern struct stats stats; |
4df9f368 | 351 | extern int preserve_perms; |
57df171b | 352 | extern int delete_after; |
b35d0d8e | 353 | extern int orig_umask; |
1b7c47cb | 354 | struct stats initial_stats; |
11a5a3c7 | 355 | |
2f03f956 AT |
356 | if (verbose > 2) { |
357 | rprintf(FINFO,"recv_files(%d) starting\n",flist->count); | |
358 | } | |
359 | ||
2f03f956 AT |
360 | while (1) { |
361 | cleanup_disable(); | |
362 | ||
363 | i = read_int(f_in); | |
364 | if (i == -1) { | |
bc63ae3f | 365 | if (phase==0) { |
2f03f956 AT |
366 | phase++; |
367 | csum_length = SUM_LENGTH; | |
368 | if (verbose > 2) | |
369 | rprintf(FINFO,"recv_files phase=%d\n",phase); | |
370 | write_int(f_gen,-1); | |
371 | continue; | |
372 | } | |
373 | break; | |
374 | } | |
375 | ||
376 | if (i < 0 || i >= flist->count) { | |
377 | rprintf(FERROR,"Invalid file index %d in recv_files (count=%d)\n", | |
378 | i, flist->count); | |
65417579 | 379 | exit_cleanup(RERR_PROTOCOL); |
2f03f956 AT |
380 | } |
381 | ||
382 | file = flist->files[i]; | |
383 | fname = f_name(file); | |
384 | ||
385 | stats.num_transferred_files++; | |
386 | stats.total_transferred_size += file->length; | |
387 | ||
388 | if (local_name) | |
389 | fname = local_name; | |
390 | ||
391 | if (dry_run) { | |
42d4edc0 S |
392 | if (!am_server && verbose) { /* log transfer */ |
393 | rprintf(FINFO, "%s\n", fname); | |
11a5a3c7 | 394 | } |
2f03f956 AT |
395 | continue; |
396 | } | |
397 | ||
1b7c47cb AT |
398 | initial_stats = stats; |
399 | ||
2f03f956 AT |
400 | if (verbose > 2) |
401 | rprintf(FINFO,"recv_files(%s)\n",fname); | |
402 | ||
375a4556 DD |
403 | fnamecmp = fname; |
404 | ||
2f03f956 | 405 | /* open the file */ |
8c9fd200 | 406 | fd1 = do_open(fnamecmp, O_RDONLY, 0); |
375a4556 DD |
407 | |
408 | if ((fd1 == -1) && (compare_dest != NULL)) { | |
409 | /* try the file at compare_dest instead */ | |
8950ac03 | 410 | snprintf(fnamecmpbuf,MAXPATHLEN,"%s/%s", |
375a4556 DD |
411 | compare_dest,fname); |
412 | fnamecmp = fnamecmpbuf; | |
8c9fd200 | 413 | fd1 = do_open(fnamecmp, O_RDONLY, 0); |
375a4556 | 414 | } |
2f03f956 AT |
415 | |
416 | if (fd1 != -1 && do_fstat(fd1,&st) != 0) { | |
ea42541f WD |
417 | rprintf(FERROR, "fstat %s failed: %s\n", |
418 | full_fname(fnamecmp), strerror(errno)); | |
2f03f956 AT |
419 | receive_data(f_in,NULL,-1,NULL,file->length); |
420 | close(fd1); | |
421 | continue; | |
422 | } | |
423 | ||
350e4e4d S |
424 | if (fd1 != -1 && S_ISDIR(st.st_mode) && fnamecmp == fname) { |
425 | /* this special handling for directories | |
426 | * wouldn't be necessary if robust_rename() | |
427 | * and the underlying robust_unlink could cope | |
428 | * with directories | |
429 | */ | |
ea42541f WD |
430 | rprintf(FERROR,"recv_files: %s is a directory\n", |
431 | full_fname(fnamecmp)); | |
350e4e4d | 432 | receive_data(f_in, NULL, -1, NULL, file->length); |
2f03f956 AT |
433 | close(fd1); |
434 | continue; | |
435 | } | |
436 | ||
350e4e4d S |
437 | if (fd1 != -1 && !S_ISREG(st.st_mode)) { |
438 | close(fd1); | |
439 | fd1 = -1; | |
440 | buf = NULL; | |
441 | } | |
442 | ||
4df9f368 | 443 | if (fd1 != -1 && !preserve_perms) { |
85ed0aa3 S |
444 | /* if the file exists already and we aren't preserving |
445 | permissions then act as though the remote end sent | |
4df9f368 AT |
446 | us the file permissions we already have */ |
447 | file->mode = st.st_mode; | |
448 | } | |
449 | ||
2f03f956 AT |
450 | if (fd1 != -1 && st.st_size > 0) { |
451 | buf = map_file(fd1,st.st_size); | |
452 | if (verbose > 2) | |
5f808dfb | 453 | rprintf(FINFO,"recv mapped %s of size %.0f\n",fnamecmp,(double)st.st_size); |
2f03f956 AT |
454 | } else { |
455 | buf = NULL; | |
456 | } | |
457 | ||
458 | if (!get_tmpname(fnametmp,fname)) { | |
459 | if (buf) unmap_file(buf); | |
460 | if (fd1 != -1) close(fd1); | |
461 | continue; | |
462 | } | |
463 | ||
f62c17e3 | 464 | strlcpy(template, fnametmp, sizeof(template)); |
2f03f956 AT |
465 | |
466 | /* we initially set the perms without the | |
467 | setuid/setgid bits to ensure that there is no race | |
468 | condition. They are then correctly updated after | |
469 | the lchown. Thanks to snabb@epipe.fi for pointing | |
972a3619 DD |
470 | this out. We also set it initially without group |
471 | access because of a similar race condition. */ | |
f62c17e3 | 472 | fd2 = do_mkstemp(fnametmp, file->mode & INITACCESSPERMS); |
2f03f956 | 473 | |
752eaba4 DD |
474 | /* in most cases parent directories will already exist |
475 | because their information should have been previously | |
476 | transferred, but that may not be the case with -R */ | |
477 | if (fd2 == -1 && relative_paths && errno == ENOENT && | |
b35d0d8e | 478 | create_directory_path(fnametmp, orig_umask) == 0) { |
f62c17e3 AT |
479 | strlcpy(fnametmp, template, sizeof(fnametmp)); |
480 | fd2 = do_mkstemp(fnametmp, file->mode & INITACCESSPERMS); | |
2f03f956 AT |
481 | } |
482 | if (fd2 == -1) { | |
ea42541f WD |
483 | rprintf(FERROR, "mkstemp %s failed: %s\n", |
484 | full_fname(fnametmp), strerror(errno)); | |
2f03f956 AT |
485 | receive_data(f_in,buf,-1,NULL,file->length); |
486 | if (buf) unmap_file(buf); | |
487 | if (fd1 != -1) close(fd1); | |
488 | continue; | |
489 | } | |
490 | ||
c6b81a98 | 491 | cleanup_set(fnametmp, fname, file, buf, fd1, fd2); |
2f03f956 | 492 | |
42d4edc0 S |
493 | if (!am_server && verbose) { /* log transfer */ |
494 | rprintf(FINFO, "%s\n", fname); | |
11a5a3c7 AT |
495 | } |
496 | ||
2f03f956 AT |
497 | /* recv file data */ |
498 | recv_ok = receive_data(f_in,buf,fd2,fname,file->length); | |
1b7c47cb AT |
499 | |
500 | log_recv(file, &initial_stats); | |
2f03f956 AT |
501 | |
502 | if (buf) unmap_file(buf); | |
503 | if (fd1 != -1) { | |
504 | close(fd1); | |
505 | } | |
506 | close(fd2); | |
507 | ||
508 | if (verbose > 2) | |
509 | rprintf(FINFO,"renaming %s to %s\n",fnametmp,fname); | |
510 | ||
511 | finish_transfer(fname, fnametmp, file); | |
c6b81a98 | 512 | |
2f03f956 | 513 | cleanup_disable(); |
554e0a8d | 514 | |
2f03f956 AT |
515 | if (!recv_ok) { |
516 | if (csum_length == SUM_LENGTH) { | |
517 | rprintf(FERROR,"ERROR: file corruption in %s. File changed during transfer?\n", | |
ea42541f | 518 | full_fname(fname)); |
2f03f956 AT |
519 | } else { |
520 | if (verbose > 1) | |
521 | rprintf(FINFO,"redoing %s(%d)\n",fname,i); | |
522 | write_int(f_gen,i); | |
523 | } | |
524 | } | |
525 | } | |
526 | ||
57df171b AT |
527 | if (delete_after) { |
528 | if (recurse && delete_mode && !local_name && flist->count>0) { | |
529 | delete_files(flist); | |
530 | } | |
531 | } | |
532 | ||
2f03f956 | 533 | if (preserve_hard_links) |
fae5bb31 | 534 | do_hard_links(); |
2f03f956 AT |
535 | |
536 | /* now we need to fix any directory permissions that were | |
537 | modified during the transfer */ | |
538 | for (i = 0; i < flist->count; i++) { | |
539 | file = flist->files[i]; | |
540 | if (!file->basename || !S_ISDIR(file->mode)) continue; | |
e78733d9 | 541 | recv_generator(local_name?local_name:f_name(file),flist,i,-1); |
2f03f956 AT |
542 | } |
543 | ||
544 | if (verbose > 2) | |
545 | rprintf(FINFO,"recv_files finished\n"); | |
546 | ||
547 | return 0; | |
548 | } | |
549 |