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