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