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