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