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