Commit | Line | Data |
---|---|---|
6aae748e | 1 | /* |
0f78b815 WD |
2 | * Routines to support hard-linking. |
3 | * | |
4 | * Copyright (C) 1996 Andrew Tridgell | |
5 | * Copyright (C) 1996 Paul Mackerras | |
6 | * Copyright (C) 2002 Martin Pool <mbp@samba.org> | |
d3d07a5e | 7 | * Copyright (C) 2004-2008 Wayne Davison |
0f78b815 WD |
8 | * |
9 | * This program is free software; you can redistribute it and/or modify | |
8e41b68e WD |
10 | * it under the terms of the GNU General Public License as published by |
11 | * the Free Software Foundation; either version 3 of the License, or | |
12 | * (at your option) any later version. | |
0f78b815 WD |
13 | * |
14 | * This program is distributed in the hope that it will be useful, | |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | * GNU General Public License for more details. | |
18 | * | |
e7c67065 | 19 | * You should have received a copy of the GNU General Public License along |
4fd842f9 | 20 | * with this program; if not, visit the http://fsf.org website. |
0f78b815 | 21 | */ |
dc5ddbcc AT |
22 | |
23 | #include "rsync.h" | |
24 | ||
9a52223b | 25 | extern int verbose; |
82ad07c4 | 26 | extern int dry_run; |
eb67a690 | 27 | extern int list_only; |
d4d6646a WD |
28 | extern int am_sender; |
29 | extern int inc_recurse; | |
841d9436 | 30 | extern int do_xfers; |
541b23d1 | 31 | extern int link_dest; |
1c3344a1 | 32 | extern int preserve_acls; |
417c99f6 | 33 | extern int make_backups; |
c905bf37 | 34 | extern int protocol_version; |
47c11975 | 35 | extern int remove_source_files; |
20f90d5e | 36 | extern int stdout_format_has_i; |
aadc84d3 | 37 | extern int maybe_ATTRS_REPORT; |
f7a76b9c | 38 | extern int unsort_ndx; |
541b23d1 | 39 | extern char *basis_dir[]; |
3ac830b9 | 40 | extern struct file_list *cur_flist; |
dc5ddbcc | 41 | |
4f5b0756 | 42 | #ifdef SUPPORT_HARD_LINKS |
9f2e3c3f | 43 | |
c905bf37 WD |
44 | /* Starting with protocol 30, we use a simple hashtable on the sending side |
45 | * for hashing the st_dev and st_ino info. The receiving side gets told | |
46 | * (via flags and a "group index") which items are hard-linked together, so | |
d4d6646a WD |
47 | * we can avoid the pool of dev+inode data. For incremental recursion mode, |
48 | * the receiver will use a ndx hash to remember old pathnames. */ | |
c905bf37 | 49 | |
d4d6646a WD |
50 | static struct hashtable *dev_tbl; |
51 | ||
52 | static struct hashtable *prior_hlinks; | |
53 | ||
54 | static struct file_list *hlink_flist; | |
9f2e3c3f | 55 | |
aadc84d3 WD |
56 | void init_hard_links(void) |
57 | { | |
d4d6646a WD |
58 | if (am_sender || protocol_version < 30) |
59 | dev_tbl = hashtable_create(16, SIZEOF_INT64 == 8); | |
60 | else if (inc_recurse) | |
61 | prior_hlinks = hashtable_create(1024, 0); | |
c905bf37 WD |
62 | } |
63 | ||
62606570 | 64 | struct ht_int64_node *idev_find(int64 dev, int64 ino) |
c905bf37 | 65 | { |
62606570 WD |
66 | static struct ht_int64_node *dev_node = NULL; |
67 | struct hashtable *tbl; | |
c905bf37 WD |
68 | |
69 | if (!dev_node || dev_node->key != dev) { | |
70 | /* We keep a separate hash table of inodes for every device. */ | |
62606570 | 71 | dev_node = hashtable_find(dev_tbl, dev, 1); |
c905bf37 | 72 | if (!(tbl = dev_node->data)) |
62606570 | 73 | tbl = dev_node->data = hashtable_create(512, SIZEOF_INT64 == 8); |
c905bf37 WD |
74 | } else |
75 | tbl = dev_node->data; | |
76 | ||
62606570 | 77 | return hashtable_find(tbl, ino, 1); |
c905bf37 WD |
78 | } |
79 | ||
80 | void idev_destroy(void) | |
81 | { | |
82 | int i; | |
83 | ||
84 | for (i = 0; i < dev_tbl->size; i++) { | |
62606570 WD |
85 | struct ht_int32_node *node = HT_NODE(dev_tbl, dev_tbl->nodes, i); |
86 | if (node->data) | |
87 | hashtable_destroy(node->data); | |
c905bf37 WD |
88 | } |
89 | ||
62606570 | 90 | hashtable_destroy(dev_tbl); |
c905bf37 WD |
91 | } |
92 | ||
c905bf37 | 93 | static int hlink_compare_gnum(int *int1, int *int2) |
1d5cda22 | 94 | { |
d4d6646a WD |
95 | struct file_struct *f1 = hlink_flist->sorted[*int1]; |
96 | struct file_struct *f2 = hlink_flist->sorted[*int2]; | |
719985cb WD |
97 | int32 gnum1 = F_HL_GNUM(f1); |
98 | int32 gnum2 = F_HL_GNUM(f2); | |
1d5cda22 | 99 | |
c905bf37 WD |
100 | if (gnum1 != gnum2) |
101 | return gnum1 > gnum2 ? 1 : -1; | |
9935066b | 102 | |
c905bf37 WD |
103 | return *int1 > *int2 ? 1 : -1; |
104 | } | |
9935066b | 105 | |
c905bf37 WD |
106 | static void match_gnums(int32 *ndx_list, int ndx_count) |
107 | { | |
108 | int32 from, prev; | |
109 | struct file_struct *file, *file_next; | |
d4d6646a | 110 | struct ht_int32_node *node = NULL; |
719985cb | 111 | int32 gnum, gnum_next; |
c905bf37 WD |
112 | |
113 | qsort(ndx_list, ndx_count, sizeof ndx_list[0], | |
114 | (int (*)()) hlink_compare_gnum); | |
115 | ||
116 | for (from = 0; from < ndx_count; from++) { | |
d4d6646a WD |
117 | file = hlink_flist->sorted[ndx_list[from]]; |
118 | gnum = F_HL_GNUM(file); | |
119 | if (inc_recurse) { | |
120 | node = hashtable_find(prior_hlinks, gnum, 1); | |
121 | if (!node->data) { | |
122 | node->data = new_array0(char, 5); | |
123 | assert(gnum >= hlink_flist->ndx_start); | |
c980db5f WD |
124 | file->flags |= FLAG_HLINK_FIRST; |
125 | prev = -1; | |
126 | } else if (CVAL(node->data, 0) == 0) { | |
127 | struct file_list *flist; | |
c980db5f WD |
128 | prev = IVAL(node->data, 1); |
129 | flist = flist_for_ndx(prev); | |
c9b62cf3 WD |
130 | if (flist) |
131 | flist->files[prev - flist->ndx_start]->flags &= ~FLAG_HLINK_LAST; | |
132 | else { | |
133 | /* We skipped all prior files in this | |
134 | * group, so mark this as a "first". */ | |
135 | file->flags |= FLAG_HLINK_FIRST; | |
136 | prev = -1; | |
137 | } | |
c980db5f WD |
138 | } else |
139 | prev = -1; | |
140 | } else { | |
d4d6646a WD |
141 | file->flags |= FLAG_HLINK_FIRST; |
142 | prev = -1; | |
c980db5f | 143 | } |
d4d6646a WD |
144 | for ( ; from < ndx_count-1; file = file_next, gnum = gnum_next, from++) { /*SHARED ITERATOR*/ |
145 | file_next = hlink_flist->sorted[ndx_list[from+1]]; | |
c905bf37 WD |
146 | gnum_next = F_HL_GNUM(file_next); |
147 | if (gnum != gnum_next) | |
148 | break; | |
c905bf37 | 149 | F_HL_PREV(file) = prev; |
5288be3a | 150 | /* The linked list uses over-the-wire ndx values. */ |
f7a76b9c | 151 | if (unsort_ndx) |
332cf6df WD |
152 | prev = F_NDX(file); |
153 | else | |
d4d6646a | 154 | prev = ndx_list[from] + hlink_flist->ndx_start; |
c905bf37 | 155 | } |
d4d6646a | 156 | if (prev < 0 && !inc_recurse) { |
c980db5f WD |
157 | /* Disable hard-link bit and set DONE so that |
158 | * HLINK_BUMP()-dependent values are unaffected. */ | |
d4d6646a | 159 | file->flags &= ~(FLAG_HLINKED | FLAG_HLINK_FIRST); |
0eeb9f54 | 160 | file->flags |= FLAG_HLINK_DONE; |
d4d6646a WD |
161 | continue; |
162 | } | |
163 | ||
164 | file->flags |= FLAG_HLINK_LAST; | |
165 | F_HL_PREV(file) = prev; | |
166 | if (inc_recurse && CVAL(node->data, 0) == 0) { | |
f7a76b9c | 167 | if (unsort_ndx) |
d4d6646a WD |
168 | prev = F_NDX(file); |
169 | else | |
d4d6646a WD |
170 | prev = ndx_list[from] + hlink_flist->ndx_start; |
171 | SIVAL(node->data, 1, prev); | |
c905bf37 WD |
172 | } |
173 | } | |
174 | } | |
175 | ||
176 | /* Analyze the hard-links in the file-list by creating a list of all the | |
177 | * items that have hlink data, sorting them, and matching up identical | |
178 | * values into clusters. These will be a single linked list from last | |
179 | * to first when we're done. */ | |
d4d6646a | 180 | void match_hard_links(struct file_list *flist) |
c905bf37 | 181 | { |
eb67a690 WD |
182 | if (!list_only) { |
183 | int i, ndx_count = 0; | |
184 | int32 *ndx_list; | |
c905bf37 | 185 | |
eb67a690 WD |
186 | if (!(ndx_list = new_array(int32, flist->used))) |
187 | out_of_memory("match_hard_links"); | |
c905bf37 | 188 | |
eb67a690 WD |
189 | for (i = 0; i < flist->used; i++) { |
190 | if (F_IS_HLINKED(flist->sorted[i])) | |
191 | ndx_list[ndx_count++] = i; | |
192 | } | |
1d5cda22 | 193 | |
eb67a690 | 194 | hlink_flist = flist; |
d4d6646a | 195 | |
eb67a690 WD |
196 | if (ndx_count) |
197 | match_gnums(ndx_list, ndx_count); | |
007996b4 | 198 | |
eb67a690 WD |
199 | free(ndx_list); |
200 | } | |
007996b4 WD |
201 | if (protocol_version < 30) |
202 | idev_destroy(); | |
dc5ddbcc AT |
203 | } |
204 | ||
3cd5301f | 205 | static int maybe_hard_link(struct file_struct *file, int ndx, |
13710874 | 206 | const char *fname, int statret, stat_x *sxp, |
aadc84d3 WD |
207 | const char *oldname, STRUCT_STAT *old_stp, |
208 | const char *realname, int itemizing, enum logcode code) | |
3cd5301f WD |
209 | { |
210 | if (statret == 0) { | |
1c3344a1 WD |
211 | if (sxp->st.st_dev == old_stp->st_dev |
212 | && sxp->st.st_ino == old_stp->st_ino) { | |
3cd5301f | 213 | if (itemizing) { |
1c3344a1 | 214 | itemize(fname, file, ndx, statret, sxp, |
3cd5301f WD |
215 | ITEM_LOCAL_CHANGE | ITEM_XNAME_FOLLOWS, |
216 | 0, ""); | |
217 | } | |
aadc84d3 WD |
218 | if (verbose > 1 && maybe_ATTRS_REPORT) |
219 | rprintf(FCLIENT, "%s is uptodate\n", fname); | |
220 | file->flags |= FLAG_HLINK_DONE; | |
3cd5301f WD |
221 | return 0; |
222 | } | |
3ac830b9 | 223 | if (make_backups > 0) { |
3cd5301f WD |
224 | if (!make_backup(fname)) |
225 | return -1; | |
226 | } else if (robust_unlink(fname)) { | |
3f0211b6 | 227 | rsyserr(FERROR_XFER, errno, "unlink %s failed", |
3cd5301f WD |
228 | full_fname(fname)); |
229 | return -1; | |
230 | } | |
231 | } | |
aadc84d3 WD |
232 | |
233 | if (hard_link_one(file, fname, oldname, 0)) { | |
234 | if (itemizing) { | |
1c3344a1 | 235 | itemize(fname, file, ndx, statret, sxp, |
aadc84d3 WD |
236 | ITEM_LOCAL_CHANGE | ITEM_XNAME_FOLLOWS, 0, |
237 | realname); | |
238 | } | |
239 | if (code != FNONE && verbose) | |
240 | rprintf(code, "%s => %s\n", fname, realname); | |
241 | return 0; | |
242 | } | |
243 | return -1; | |
3cd5301f | 244 | } |
3cd5301f | 245 | |
d4d6646a | 246 | /* Figure out if a prior entry is still there or if we just have a |
c9b62cf3 WD |
247 | * cached name for it. */ |
248 | static char *check_prior(struct file_struct *file, int gnum, | |
249 | int *prev_ndx_p, struct file_list **flist_p) | |
d4d6646a | 250 | { |
c9b62cf3 WD |
251 | struct file_struct *fp; |
252 | struct file_list *flist; | |
d4d6646a | 253 | struct ht_int32_node *node; |
c9b62cf3 | 254 | int prev_ndx = F_HL_PREV(file); |
d4d6646a | 255 | |
c9b62cf3 WD |
256 | while (1) { |
257 | if (prev_ndx < 0) { | |
258 | *prev_ndx_p = prev_ndx; | |
259 | *flist_p = NULL; | |
260 | return NULL; | |
261 | } | |
262 | if ((flist = flist_for_ndx(prev_ndx)) == NULL) | |
263 | break; | |
264 | fp = flist->files[prev_ndx - flist->ndx_start]; | |
265 | if (!(fp->flags & FLAG_SKIP_HLINK)) { | |
266 | *prev_ndx_p = prev_ndx; | |
267 | *flist_p = flist; | |
268 | return NULL; | |
269 | } | |
270 | F_HL_PREV(file) = prev_ndx = F_HL_PREV(fp); | |
d4d6646a WD |
271 | } |
272 | ||
273 | node = hashtable_find(prior_hlinks, gnum, 0); | |
274 | assert(node != NULL && node->data); | |
c9b62cf3 WD |
275 | |
276 | if (CVAL(node->data, 0) == 0) { | |
277 | /* The prior file must have been skipped. */ | |
278 | F_HL_PREV(file) = prev_ndx = -1; | |
279 | *prev_ndx_p = prev_ndx; | |
280 | *flist_p = NULL; | |
281 | return NULL; | |
282 | } | |
283 | ||
284 | *prev_ndx_p = prev_ndx; | |
285 | *flist_p = flist; | |
d4d6646a WD |
286 | return node->data; |
287 | } | |
288 | ||
aadc84d3 WD |
289 | /* Only called if FLAG_HLINKED is set and FLAG_HLINK_FIRST is not. Returns: |
290 | * 0 = process the file, 1 = skip the file, -1 = error occurred. */ | |
a2ebbffc | 291 | int hard_link_check(struct file_struct *file, int ndx, const char *fname, |
13710874 | 292 | int statret, stat_x *sxp, int itemizing, |
aadc84d3 | 293 | enum logcode code) |
d38fc305 | 294 | { |
aadc84d3 | 295 | STRUCT_STAT prev_st; |
d4d6646a WD |
296 | char namebuf[MAXPATHLEN], altbuf[MAXPATHLEN]; |
297 | char *realname, *prev_name; | |
c980db5f WD |
298 | struct file_list *flist; |
299 | int gnum = inc_recurse ? F_HL_GNUM(file) : -1; | |
c9b62cf3 | 300 | int prev_ndx; |
d4d6646a | 301 | |
c9b62cf3 | 302 | prev_name = realname = check_prior(file, gnum, &prev_ndx, &flist); |
d4d6646a WD |
303 | |
304 | if (!prev_name) { | |
c9b62cf3 WD |
305 | struct file_struct *prev_file; |
306 | ||
307 | if (!flist) { | |
308 | /* The previous file was skipped, so this one is | |
309 | * treated as if it were the first in its group. */ | |
310 | return 0; | |
311 | } | |
312 | ||
313 | prev_file = flist->files[prev_ndx - flist->ndx_start]; | |
d4d6646a | 314 | |
5288be3a | 315 | /* Is the previous link not complete yet? */ |
d4d6646a WD |
316 | if (!(prev_file->flags & FLAG_HLINK_DONE)) { |
317 | /* Is the previous link being transferred? */ | |
318 | if (prev_file->flags & FLAG_FILE_SENT) { | |
5288be3a WD |
319 | /* Add ourselves to the list of files that will |
320 | * be updated when the transfer completes, and | |
321 | * mark ourself as waiting for the transfer. */ | |
d4d6646a WD |
322 | F_HL_PREV(file) = F_HL_PREV(prev_file); |
323 | F_HL_PREV(prev_file) = ndx; | |
324 | file->flags |= FLAG_FILE_SENT; | |
325 | cur_flist->in_progress++; | |
326 | return 1; | |
327 | } | |
328 | return 0; | |
6cbde57d | 329 | } |
aadc84d3 | 330 | |
d4d6646a WD |
331 | /* There is a finished file to link with! */ |
332 | if (!(prev_file->flags & FLAG_HLINK_FIRST)) { | |
c980db5f | 333 | /* The previous previous is FIRST when prev is not. */ |
c9b62cf3 WD |
334 | prev_name = realname = check_prior(prev_file, gnum, &prev_ndx, &flist); |
335 | assert(prev_name != NULL || flist != NULL); | |
c980db5f | 336 | /* Update our previous pointer to point to the FIRST. */ |
d4d6646a WD |
337 | F_HL_PREV(file) = prev_ndx; |
338 | } | |
c980db5f WD |
339 | |
340 | if (!prev_name) { | |
341 | int alt_dest; | |
342 | ||
343 | prev_file = flist->files[prev_ndx - flist->ndx_start]; | |
344 | /* F_HL_PREV() is alt_dest value when DONE && FIRST. */ | |
345 | alt_dest = F_HL_PREV(prev_file); | |
346 | ||
347 | if (alt_dest >= 0 && dry_run) { | |
348 | pathjoin(namebuf, MAXPATHLEN, basis_dir[alt_dest], | |
349 | f_name(prev_file, NULL)); | |
350 | prev_name = namebuf; | |
351 | realname = f_name(prev_file, altbuf); | |
352 | } else { | |
353 | prev_name = f_name(prev_file, namebuf); | |
354 | realname = prev_name; | |
355 | } | |
d4d6646a | 356 | } |
aadc84d3 WD |
357 | } |
358 | ||
359 | if (link_stat(prev_name, &prev_st, 0) < 0) { | |
3f0211b6 | 360 | rsyserr(FERROR_XFER, errno, "stat %s failed", |
aadc84d3 WD |
361 | full_fname(prev_name)); |
362 | return -1; | |
363 | } | |
364 | ||
365 | if (statret < 0 && basis_dir[0] != NULL) { | |
366 | /* If we match an alt-dest item, we don't output this as a change. */ | |
367 | char cmpbuf[MAXPATHLEN]; | |
13710874 | 368 | stat_x alt_sx; |
aadc84d3 | 369 | int j = 0; |
1c3344a1 WD |
370 | #ifdef SUPPORT_ACLS |
371 | alt_sx.acc_acl = alt_sx.def_acl = NULL; | |
372 | #endif | |
aadc84d3 WD |
373 | do { |
374 | pathjoin(cmpbuf, MAXPATHLEN, basis_dir[j], fname); | |
1c3344a1 | 375 | if (link_stat(cmpbuf, &alt_sx.st, 0) < 0) |
aadc84d3 WD |
376 | continue; |
377 | if (link_dest) { | |
1c3344a1 WD |
378 | if (prev_st.st_dev != alt_sx.st.st_dev |
379 | || prev_st.st_ino != alt_sx.st.st_ino) | |
aadc84d3 WD |
380 | continue; |
381 | statret = 1; | |
1aa343e8 WD |
382 | if (stdout_format_has_i == 0 |
383 | || (verbose < 2 && stdout_format_has_i < 2)) { | |
384 | itemizing = 0; | |
aadc84d3 WD |
385 | code = FNONE; |
386 | if (verbose > 1 && maybe_ATTRS_REPORT) | |
387 | rprintf(FCLIENT, "%s is uptodate\n", fname); | |
388 | } | |
389 | break; | |
541b23d1 | 390 | } |
1c3344a1 | 391 | if (!unchanged_file(cmpbuf, file, &alt_sx.st)) |
aadc84d3 WD |
392 | continue; |
393 | statret = 1; | |
1c3344a1 | 394 | if (unchanged_attrs(cmpbuf, file, &alt_sx)) |
aadc84d3 WD |
395 | break; |
396 | } while (basis_dir[++j] != NULL); | |
1c3344a1 WD |
397 | if (statret == 1) { |
398 | sxp->st = alt_sx.st; | |
399 | #ifdef SUPPORT_ACLS | |
400 | if (preserve_acls && !S_ISLNK(file->mode)) { | |
401 | if (!ACL_READY(*sxp)) | |
402 | get_acl(cmpbuf, sxp); | |
403 | else { | |
404 | sxp->acc_acl = alt_sx.acc_acl; | |
405 | sxp->def_acl = alt_sx.def_acl; | |
406 | } | |
407 | } | |
408 | #endif | |
409 | } | |
410 | #ifdef SUPPORT_ACLS | |
411 | else if (preserve_acls) | |
412 | free_acl(&alt_sx); | |
413 | #endif | |
d38fc305 | 414 | } |
aadc84d3 | 415 | |
1c3344a1 | 416 | if (maybe_hard_link(file, ndx, fname, statret, sxp, prev_name, &prev_st, |
aadc84d3 WD |
417 | realname, itemizing, code) < 0) |
418 | return -1; | |
419 | ||
420 | if (remove_source_files == 1 && do_xfers) | |
421 | send_msg_int(MSG_SUCCESS, ndx); | |
422 | ||
423 | return 1; | |
d38fc305 WD |
424 | } |
425 | ||
aadc84d3 WD |
426 | int hard_link_one(struct file_struct *file, const char *fname, |
427 | const char *oldname, int terse) | |
a16bbc39 | 428 | { |
aadc84d3 WD |
429 | if (do_link(oldname, fname) < 0) { |
430 | enum logcode code; | |
3cd5301f WD |
431 | if (terse) { |
432 | if (!verbose) | |
e96c7777 | 433 | return 0; |
3cd5301f WD |
434 | code = FINFO; |
435 | } else | |
3f0211b6 | 436 | code = FERROR_XFER; |
3cd5301f | 437 | rsyserr(code, errno, "link %s => %s failed", |
aadc84d3 WD |
438 | full_fname(fname), oldname); |
439 | return 0; | |
9f2e3c3f WD |
440 | } |
441 | ||
aadc84d3 WD |
442 | file->flags |= FLAG_HLINK_DONE; |
443 | ||
444 | return 1; | |
a16bbc39 | 445 | } |
fae5bb31 | 446 | |
c980db5f | 447 | void finish_hard_link(struct file_struct *file, const char *fname, int fin_ndx, |
aadc84d3 WD |
448 | STRUCT_STAT *stp, int itemizing, enum logcode code, |
449 | int alt_dest) | |
dc5ddbcc | 450 | { |
13710874 | 451 | stat_x prev_sx; |
1c3344a1 | 452 | STRUCT_STAT st; |
aadc84d3 WD |
453 | char alt_name[MAXPATHLEN], *prev_name; |
454 | const char *our_name; | |
d4d6646a | 455 | struct file_list *flist; |
aadc84d3 WD |
456 | int prev_statret, ndx, prev_ndx = F_HL_PREV(file); |
457 | ||
458 | if (stp == NULL && prev_ndx >= 0) { | |
459 | if (link_stat(fname, &st, 0) < 0) { | |
3f0211b6 | 460 | rsyserr(FERROR_XFER, errno, "stat %s failed", |
aadc84d3 WD |
461 | full_fname(fname)); |
462 | return; | |
9f2e3c3f | 463 | } |
aadc84d3 | 464 | stp = &st; |
9f2e3c3f | 465 | } |
aadc84d3 WD |
466 | |
467 | /* FIRST combined with DONE means we were the first to get done. */ | |
468 | file->flags |= FLAG_HLINK_FIRST | FLAG_HLINK_DONE; | |
469 | F_HL_PREV(file) = alt_dest; | |
470 | if (alt_dest >= 0 && dry_run) { | |
471 | pathjoin(alt_name, MAXPATHLEN, basis_dir[alt_dest], | |
472 | f_name(file, NULL)); | |
473 | our_name = alt_name; | |
474 | } else | |
475 | our_name = fname; | |
476 | ||
1c3344a1 WD |
477 | #ifdef SUPPORT_ACLS |
478 | prev_sx.acc_acl = prev_sx.def_acl = NULL; | |
479 | #endif | |
480 | ||
aadc84d3 | 481 | while ((ndx = prev_ndx) >= 0) { |
1c3344a1 | 482 | int val; |
d4d6646a WD |
483 | flist = flist_for_ndx(ndx); |
484 | assert(flist != NULL); | |
485 | file = flist->files[ndx - flist->ndx_start]; | |
aadc84d3 WD |
486 | file->flags = (file->flags & ~FLAG_HLINK_FIRST) | FLAG_HLINK_DONE; |
487 | prev_ndx = F_HL_PREV(file); | |
c980db5f | 488 | F_HL_PREV(file) = fin_ndx; |
aadc84d3 | 489 | prev_name = f_name(file, NULL); |
1c3344a1 WD |
490 | prev_statret = link_stat(prev_name, &prev_sx.st, 0); |
491 | val = maybe_hard_link(file, ndx, prev_name, prev_statret, &prev_sx, | |
492 | our_name, stp, fname, itemizing, code); | |
d4d6646a | 493 | flist->in_progress--; |
1c3344a1 WD |
494 | #ifdef SUPPORT_ACLS |
495 | if (preserve_acls) | |
496 | free_acl(&prev_sx); | |
497 | #endif | |
498 | if (val < 0) | |
1d5cda22 | 499 | continue; |
663b2857 WD |
500 | if (remove_source_files == 1 && do_xfers) |
501 | send_msg_int(MSG_SUCCESS, ndx); | |
aadc84d3 | 502 | } |
d4d6646a WD |
503 | |
504 | if (inc_recurse) { | |
505 | int gnum = F_HL_GNUM(file); | |
506 | struct ht_int32_node *node = hashtable_find(prior_hlinks, gnum, 0); | |
507 | assert(node != NULL && node->data != NULL); | |
508 | assert(CVAL(node->data, 0) == 0); | |
509 | free(node->data); | |
510 | if (!(node->data = strdup(our_name))) | |
511 | out_of_memory("finish_hard_link"); | |
512 | } | |
dc5ddbcc | 513 | } |
c9b62cf3 WD |
514 | |
515 | int skip_hard_link(struct file_struct *file, struct file_list **flist_p) | |
516 | { | |
517 | struct file_list *flist; | |
518 | int prev_ndx; | |
519 | ||
520 | file->flags |= FLAG_SKIP_HLINK; | |
521 | if (!(file->flags & FLAG_HLINK_LAST)) | |
522 | return -1; | |
523 | ||
524 | check_prior(file, F_HL_GNUM(file), &prev_ndx, &flist); | |
525 | if (prev_ndx >= 0) { | |
526 | file = flist->files[prev_ndx - flist->ndx_start]; | |
527 | if (file->flags & (FLAG_HLINK_DONE|FLAG_FILE_SENT)) | |
528 | return -1; | |
529 | file->flags |= FLAG_HLINK_LAST; | |
530 | *flist_p = flist; | |
531 | } | |
532 | ||
533 | return prev_ndx; | |
534 | } | |
a2ebbffc | 535 | #endif |