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