1 // SPDX-License-Identifier: GPL-2.0 2 #include "bcachefs.h" 3 #include "bkey_buf.h" 4 #include "btree_update.h" 5 #include "buckets.h" 6 #include "enumerated_ref.h" 7 #include "error.h" 8 #include "extents.h" 9 #include "inode.h" 10 #include "io_misc.h" 11 #include "io_write.h" 12 #include "rebalance.h" 13 #include "reflink.h" 14 #include "subvolume.h" 15 #include "super-io.h" 16 17 #include <linux/sched/signal.h> 18 19 static inline bool bkey_extent_is_reflink_data(const struct bkey *k) 20 { 21 switch (k->type) { 22 case KEY_TYPE_reflink_v: 23 case KEY_TYPE_indirect_inline_data: 24 return true; 25 default: 26 return false; 27 } 28 } 29 30 static inline unsigned bkey_type_to_indirect(const struct bkey *k) 31 { 32 switch (k->type) { 33 case KEY_TYPE_extent: 34 return KEY_TYPE_reflink_v; 35 case KEY_TYPE_inline_data: 36 return KEY_TYPE_indirect_inline_data; 37 default: 38 return 0; 39 } 40 } 41 42 /* reflink pointers */ 43 44 int bch2_reflink_p_validate(struct bch_fs *c, struct bkey_s_c k, 45 struct bkey_validate_context from) 46 { 47 struct bkey_s_c_reflink_p p = bkey_s_c_to_reflink_p(k); 48 int ret = 0; 49 50 bkey_fsck_err_on(REFLINK_P_IDX(p.v) < le32_to_cpu(p.v->front_pad), 51 c, reflink_p_front_pad_bad, 52 "idx < front_pad (%llu < %u)", 53 REFLINK_P_IDX(p.v), le32_to_cpu(p.v->front_pad)); 54 fsck_err: 55 return ret; 56 } 57 58 void bch2_reflink_p_to_text(struct printbuf *out, struct bch_fs *c, 59 struct bkey_s_c k) 60 { 61 struct bkey_s_c_reflink_p p = bkey_s_c_to_reflink_p(k); 62 63 prt_printf(out, "idx %llu front_pad %u back_pad %u", 64 REFLINK_P_IDX(p.v), 65 le32_to_cpu(p.v->front_pad), 66 le32_to_cpu(p.v->back_pad)); 67 68 if (REFLINK_P_ERROR(p.v)) 69 prt_str(out, " error"); 70 } 71 72 bool bch2_reflink_p_merge(struct bch_fs *c, struct bkey_s _l, struct bkey_s_c _r) 73 { 74 struct bkey_s_reflink_p l = bkey_s_to_reflink_p(_l); 75 struct bkey_s_c_reflink_p r = bkey_s_c_to_reflink_p(_r); 76 77 /* 78 * Disabled for now, the triggers code needs to be reworked for merging 79 * of reflink pointers to work: 80 */ 81 return false; 82 83 if (REFLINK_P_IDX(l.v) + l.k->size != REFLINK_P_IDX(r.v)) 84 return false; 85 86 if (REFLINK_P_ERROR(l.v) != REFLINK_P_ERROR(r.v)) 87 return false; 88 89 bch2_key_resize(l.k, l.k->size + r.k->size); 90 return true; 91 } 92 93 /* indirect extents */ 94 95 int bch2_reflink_v_validate(struct bch_fs *c, struct bkey_s_c k, 96 struct bkey_validate_context from) 97 { 98 int ret = 0; 99 100 bkey_fsck_err_on(bkey_gt(k.k->p, POS(0, REFLINK_P_IDX_MAX)), 101 c, reflink_v_pos_bad, 102 "indirect extent above maximum position 0:%llu", 103 REFLINK_P_IDX_MAX); 104 105 ret = bch2_bkey_ptrs_validate(c, k, from); 106 fsck_err: 107 return ret; 108 } 109 110 void bch2_reflink_v_to_text(struct printbuf *out, struct bch_fs *c, 111 struct bkey_s_c k) 112 { 113 struct bkey_s_c_reflink_v r = bkey_s_c_to_reflink_v(k); 114 115 prt_printf(out, "refcount: %llu ", le64_to_cpu(r.v->refcount)); 116 117 bch2_bkey_ptrs_to_text(out, c, k); 118 } 119 120 #if 0 121 Currently disabled, needs to be debugged: 122 123 bool bch2_reflink_v_merge(struct bch_fs *c, struct bkey_s _l, struct bkey_s_c _r) 124 { 125 struct bkey_s_reflink_v l = bkey_s_to_reflink_v(_l); 126 struct bkey_s_c_reflink_v r = bkey_s_c_to_reflink_v(_r); 127 128 return l.v->refcount == r.v->refcount && bch2_extent_merge(c, _l, _r); 129 } 130 #endif 131 132 /* indirect inline data */ 133 134 int bch2_indirect_inline_data_validate(struct bch_fs *c, struct bkey_s_c k, 135 struct bkey_validate_context from) 136 { 137 return 0; 138 } 139 140 void bch2_indirect_inline_data_to_text(struct printbuf *out, 141 struct bch_fs *c, struct bkey_s_c k) 142 { 143 struct bkey_s_c_indirect_inline_data d = bkey_s_c_to_indirect_inline_data(k); 144 unsigned datalen = bkey_inline_data_bytes(k.k); 145 146 prt_printf(out, "refcount %llu datalen %u: %*phN", 147 le64_to_cpu(d.v->refcount), datalen, 148 min(datalen, 32U), d.v->data); 149 } 150 151 /* lookup */ 152 153 static int bch2_indirect_extent_not_missing(struct btree_trans *trans, struct bkey_s_c_reflink_p p, 154 bool should_commit) 155 { 156 struct bkey_i_reflink_p *new = bch2_bkey_make_mut_noupdate_typed(trans, p.s_c, reflink_p); 157 int ret = PTR_ERR_OR_ZERO(new); 158 if (ret) 159 return ret; 160 161 SET_REFLINK_P_ERROR(&new->v, false); 162 ret = bch2_btree_insert_trans(trans, BTREE_ID_extents, &new->k_i, BTREE_TRIGGER_norun); 163 if (ret) 164 return ret; 165 166 if (!should_commit) 167 return 0; 168 169 return bch2_trans_commit(trans, NULL, NULL, BCH_TRANS_COMMIT_no_enospc) ?: 170 -BCH_ERR_transaction_restart_nested; 171 } 172 173 static int bch2_indirect_extent_missing_error(struct btree_trans *trans, 174 struct bkey_s_c_reflink_p p, 175 u64 missing_start, u64 missing_end, 176 bool should_commit) 177 { 178 if (REFLINK_P_ERROR(p.v)) 179 return 0; 180 181 struct bch_fs *c = trans->c; 182 u64 live_start = REFLINK_P_IDX(p.v); 183 u64 live_end = REFLINK_P_IDX(p.v) + p.k->size; 184 u64 refd_start = live_start - le32_to_cpu(p.v->front_pad); 185 u64 refd_end = live_end + le32_to_cpu(p.v->back_pad); 186 struct printbuf buf = PRINTBUF; 187 int ret = 0; 188 189 BUG_ON(missing_start < refd_start); 190 BUG_ON(missing_end > refd_end); 191 192 struct bpos missing_pos = bkey_start_pos(p.k); 193 missing_pos.offset += missing_start - live_start; 194 195 prt_printf(&buf, "pointer to missing indirect extent in "); 196 ret = bch2_inum_snap_offset_err_msg_trans(trans, &buf, missing_pos); 197 if (ret) 198 goto err; 199 200 prt_printf(&buf, "-%llu\n", (missing_pos.offset + (missing_end - missing_start)) << 9); 201 bch2_bkey_val_to_text(&buf, c, p.s_c); 202 203 prt_printf(&buf, "\nmissing reflink btree range %llu-%llu", 204 missing_start, missing_end); 205 206 if (fsck_err(trans, reflink_p_to_missing_reflink_v, "%s", buf.buf)) { 207 struct bkey_i_reflink_p *new = bch2_bkey_make_mut_noupdate_typed(trans, p.s_c, reflink_p); 208 ret = PTR_ERR_OR_ZERO(new); 209 if (ret) 210 goto err; 211 212 /* 213 * Is the missing range not actually needed? 214 * 215 * p.v->idx refers to the data that we actually want, but if the 216 * indirect extent we point to was bigger, front_pad and back_pad 217 * indicate the range we took a reference on. 218 */ 219 220 if (missing_end <= live_start) { 221 new->v.front_pad = cpu_to_le32(live_start - missing_end); 222 } else if (missing_start >= live_end) { 223 new->v.back_pad = cpu_to_le32(missing_start - live_end); 224 } else { 225 struct bpos new_start = bkey_start_pos(&new->k); 226 struct bpos new_end = new->k.p; 227 228 if (missing_start > live_start) 229 new_start.offset += missing_start - live_start; 230 if (missing_end < live_end) 231 new_end.offset -= live_end - missing_end; 232 233 bch2_cut_front(new_start, &new->k_i); 234 bch2_cut_back(new_end, &new->k_i); 235 236 SET_REFLINK_P_ERROR(&new->v, true); 237 } 238 239 ret = bch2_btree_insert_trans(trans, BTREE_ID_extents, &new->k_i, BTREE_TRIGGER_norun); 240 if (ret) 241 goto err; 242 243 if (should_commit) 244 ret = bch2_trans_commit(trans, NULL, NULL, BCH_TRANS_COMMIT_no_enospc) ?: 245 -BCH_ERR_transaction_restart_nested; 246 } 247 err: 248 fsck_err: 249 printbuf_exit(&buf); 250 return ret; 251 } 252 253 /* 254 * This is used from the read path, which doesn't expect to have to do a 255 * transaction commit, and from triggers, which should not be doing a commit: 256 */ 257 struct bkey_s_c bch2_lookup_indirect_extent(struct btree_trans *trans, 258 struct btree_iter *iter, 259 s64 *offset_into_extent, 260 struct bkey_s_c_reflink_p p, 261 bool should_commit, 262 unsigned iter_flags) 263 { 264 BUG_ON(*offset_into_extent < -((s64) le32_to_cpu(p.v->front_pad))); 265 BUG_ON(*offset_into_extent >= p.k->size + le32_to_cpu(p.v->back_pad)); 266 267 u64 reflink_offset = REFLINK_P_IDX(p.v) + *offset_into_extent; 268 269 struct bkey_s_c k = bch2_bkey_get_iter(trans, iter, BTREE_ID_reflink, 270 POS(0, reflink_offset), iter_flags); 271 if (bkey_err(k)) 272 return k; 273 274 if (unlikely(!bkey_extent_is_reflink_data(k.k))) { 275 u64 missing_end = min(k.k->p.offset, 276 REFLINK_P_IDX(p.v) + p.k->size + le32_to_cpu(p.v->back_pad)); 277 BUG_ON(reflink_offset == missing_end); 278 279 int ret = bch2_indirect_extent_missing_error(trans, p, reflink_offset, 280 missing_end, should_commit); 281 if (ret) { 282 bch2_trans_iter_exit(trans, iter); 283 return bkey_s_c_err(ret); 284 } 285 } else if (unlikely(REFLINK_P_ERROR(p.v))) { 286 int ret = bch2_indirect_extent_not_missing(trans, p, should_commit); 287 if (ret) { 288 bch2_trans_iter_exit(trans, iter); 289 return bkey_s_c_err(ret); 290 } 291 } 292 293 *offset_into_extent = reflink_offset - bkey_start_offset(k.k); 294 return k; 295 } 296 297 /* reflink pointer trigger */ 298 299 static int trans_trigger_reflink_p_segment(struct btree_trans *trans, 300 struct bkey_s_c_reflink_p p, u64 *idx, 301 enum btree_iter_update_trigger_flags flags) 302 { 303 struct bch_fs *c = trans->c; 304 struct printbuf buf = PRINTBUF; 305 306 s64 offset_into_extent = *idx - REFLINK_P_IDX(p.v); 307 struct btree_iter iter; 308 struct bkey_s_c k = bch2_lookup_indirect_extent(trans, &iter, &offset_into_extent, p, false, 309 BTREE_ITER_intent| 310 BTREE_ITER_with_updates); 311 int ret = bkey_err(k); 312 if (ret) 313 return ret; 314 315 if (!bkey_refcount_c(k)) { 316 if (!(flags & BTREE_TRIGGER_overwrite)) 317 ret = bch_err_throw(c, missing_indirect_extent); 318 goto next; 319 } 320 321 struct bkey_i *new = bch2_bkey_make_mut_noupdate(trans, k); 322 ret = PTR_ERR_OR_ZERO(new); 323 if (ret) 324 goto err; 325 326 __le64 *refcount = bkey_refcount(bkey_i_to_s(new)); 327 if (!*refcount && (flags & BTREE_TRIGGER_overwrite)) { 328 bch2_bkey_val_to_text(&buf, c, p.s_c); 329 prt_newline(&buf); 330 bch2_bkey_val_to_text(&buf, c, k); 331 log_fsck_err(trans, reflink_refcount_underflow, 332 "indirect extent refcount underflow while marking\n%s", 333 buf.buf); 334 goto next; 335 } 336 337 if (flags & BTREE_TRIGGER_insert) { 338 struct bch_reflink_p *v = (struct bch_reflink_p *) p.v; 339 u64 pad; 340 341 pad = max_t(s64, le32_to_cpu(v->front_pad), 342 REFLINK_P_IDX(v) - bkey_start_offset(&new->k)); 343 BUG_ON(pad > U32_MAX); 344 v->front_pad = cpu_to_le32(pad); 345 346 pad = max_t(s64, le32_to_cpu(v->back_pad), 347 new->k.p.offset - p.k->size - REFLINK_P_IDX(v)); 348 BUG_ON(pad > U32_MAX); 349 v->back_pad = cpu_to_le32(pad); 350 } 351 352 le64_add_cpu(refcount, !(flags & BTREE_TRIGGER_overwrite) ? 1 : -1); 353 354 bch2_btree_iter_set_pos_to_extent_start(&iter); 355 ret = bch2_trans_update(trans, &iter, new, 0); 356 if (ret) 357 goto err; 358 next: 359 *idx = k.k->p.offset; 360 err: 361 fsck_err: 362 bch2_trans_iter_exit(trans, &iter); 363 printbuf_exit(&buf); 364 return ret; 365 } 366 367 static s64 gc_trigger_reflink_p_segment(struct btree_trans *trans, 368 struct bkey_s_c_reflink_p p, u64 *idx, 369 enum btree_iter_update_trigger_flags flags, 370 size_t r_idx) 371 { 372 struct bch_fs *c = trans->c; 373 struct reflink_gc *r; 374 int add = !(flags & BTREE_TRIGGER_overwrite) ? 1 : -1; 375 u64 next_idx = REFLINK_P_IDX(p.v) + p.k->size + le32_to_cpu(p.v->back_pad); 376 s64 ret = 0; 377 struct printbuf buf = PRINTBUF; 378 379 if (r_idx >= c->reflink_gc_nr) 380 goto not_found; 381 382 r = genradix_ptr(&c->reflink_gc_table, r_idx); 383 next_idx = min(next_idx, r->offset - r->size); 384 if (*idx < next_idx) 385 goto not_found; 386 387 BUG_ON((s64) r->refcount + add < 0); 388 389 if (flags & BTREE_TRIGGER_gc) 390 r->refcount += add; 391 *idx = r->offset; 392 return 0; 393 not_found: 394 if (flags & BTREE_TRIGGER_check_repair) { 395 ret = bch2_indirect_extent_missing_error(trans, p, *idx, next_idx, false); 396 if (ret) 397 goto err; 398 } 399 400 *idx = next_idx; 401 err: 402 printbuf_exit(&buf); 403 return ret; 404 } 405 406 static int __trigger_reflink_p(struct btree_trans *trans, 407 enum btree_id btree_id, unsigned level, struct bkey_s_c k, 408 enum btree_iter_update_trigger_flags flags) 409 { 410 struct bch_fs *c = trans->c; 411 struct bkey_s_c_reflink_p p = bkey_s_c_to_reflink_p(k); 412 int ret = 0; 413 414 u64 idx = REFLINK_P_IDX(p.v) - le32_to_cpu(p.v->front_pad); 415 u64 end = REFLINK_P_IDX(p.v) + p.k->size + le32_to_cpu(p.v->back_pad); 416 417 if (flags & BTREE_TRIGGER_transactional) { 418 while (idx < end && !ret) 419 ret = trans_trigger_reflink_p_segment(trans, p, &idx, flags); 420 } 421 422 if (flags & (BTREE_TRIGGER_check_repair|BTREE_TRIGGER_gc)) { 423 size_t l = 0, r = c->reflink_gc_nr; 424 425 while (l < r) { 426 size_t m = l + (r - l) / 2; 427 struct reflink_gc *ref = genradix_ptr(&c->reflink_gc_table, m); 428 if (ref->offset <= idx) 429 l = m + 1; 430 else 431 r = m; 432 } 433 434 while (idx < end && !ret) 435 ret = gc_trigger_reflink_p_segment(trans, p, &idx, flags, l++); 436 } 437 438 return ret; 439 } 440 441 int bch2_trigger_reflink_p(struct btree_trans *trans, 442 enum btree_id btree_id, unsigned level, 443 struct bkey_s_c old, 444 struct bkey_s new, 445 enum btree_iter_update_trigger_flags flags) 446 { 447 if ((flags & BTREE_TRIGGER_transactional) && 448 (flags & BTREE_TRIGGER_insert)) { 449 struct bch_reflink_p *v = bkey_s_to_reflink_p(new).v; 450 451 v->front_pad = v->back_pad = 0; 452 } 453 454 return trigger_run_overwrite_then_insert(__trigger_reflink_p, trans, btree_id, level, old, new, flags); 455 } 456 457 /* indirect extent trigger */ 458 459 static inline void 460 check_indirect_extent_deleting(struct bkey_s new, 461 enum btree_iter_update_trigger_flags *flags) 462 { 463 if ((*flags & BTREE_TRIGGER_insert) && !*bkey_refcount(new)) { 464 new.k->type = KEY_TYPE_deleted; 465 new.k->size = 0; 466 set_bkey_val_u64s(new.k, 0); 467 *flags &= ~BTREE_TRIGGER_insert; 468 } 469 } 470 471 int bch2_trigger_reflink_v(struct btree_trans *trans, 472 enum btree_id btree_id, unsigned level, 473 struct bkey_s_c old, struct bkey_s new, 474 enum btree_iter_update_trigger_flags flags) 475 { 476 if ((flags & BTREE_TRIGGER_transactional) && 477 (flags & BTREE_TRIGGER_insert)) 478 check_indirect_extent_deleting(new, &flags); 479 480 return bch2_trigger_extent(trans, btree_id, level, old, new, flags); 481 } 482 483 int bch2_trigger_indirect_inline_data(struct btree_trans *trans, 484 enum btree_id btree_id, unsigned level, 485 struct bkey_s_c old, struct bkey_s new, 486 enum btree_iter_update_trigger_flags flags) 487 { 488 check_indirect_extent_deleting(new, &flags); 489 490 return 0; 491 } 492 493 /* create */ 494 495 static int bch2_make_extent_indirect(struct btree_trans *trans, 496 struct btree_iter *extent_iter, 497 struct bkey_i *orig, 498 bool reflink_p_may_update_opts_field) 499 { 500 struct bch_fs *c = trans->c; 501 struct btree_iter reflink_iter = {}; 502 struct bkey_s_c k; 503 struct bkey_i *r_v; 504 struct bkey_i_reflink_p *r_p; 505 __le64 *refcount; 506 int ret; 507 508 if (orig->k.type == KEY_TYPE_inline_data) 509 bch2_check_set_feature(c, BCH_FEATURE_reflink_inline_data); 510 511 bch2_trans_iter_init(trans, &reflink_iter, BTREE_ID_reflink, POS_MAX, 512 BTREE_ITER_intent); 513 k = bch2_btree_iter_peek_prev(trans, &reflink_iter); 514 ret = bkey_err(k); 515 if (ret) 516 goto err; 517 518 /* 519 * XXX: we're assuming that 56 bits will be enough for the life of the 520 * filesystem: we need to implement wraparound, with a cursor in the 521 * logged ops btree: 522 */ 523 if (bkey_ge(reflink_iter.pos, POS(0, REFLINK_P_IDX_MAX - orig->k.size))) 524 return -ENOSPC; 525 526 r_v = bch2_trans_kmalloc(trans, sizeof(__le64) + bkey_bytes(&orig->k)); 527 ret = PTR_ERR_OR_ZERO(r_v); 528 if (ret) 529 goto err; 530 531 bkey_init(&r_v->k); 532 r_v->k.type = bkey_type_to_indirect(&orig->k); 533 r_v->k.p = reflink_iter.pos; 534 bch2_key_resize(&r_v->k, orig->k.size); 535 r_v->k.bversion = orig->k.bversion; 536 537 set_bkey_val_bytes(&r_v->k, sizeof(__le64) + bkey_val_bytes(&orig->k)); 538 539 refcount = bkey_refcount(bkey_i_to_s(r_v)); 540 *refcount = 0; 541 memcpy(refcount + 1, &orig->v, bkey_val_bytes(&orig->k)); 542 543 ret = bch2_trans_update(trans, &reflink_iter, r_v, 0); 544 if (ret) 545 goto err; 546 547 /* 548 * orig is in a bkey_buf which statically allocates 5 64s for the val, 549 * so we know it will be big enough: 550 */ 551 orig->k.type = KEY_TYPE_reflink_p; 552 r_p = bkey_i_to_reflink_p(orig); 553 set_bkey_val_bytes(&r_p->k, sizeof(r_p->v)); 554 555 /* FORTIFY_SOURCE is broken here, and doesn't provide unsafe_memset() */ 556 #if !defined(__NO_FORTIFY) && defined(__OPTIMIZE__) && defined(CONFIG_FORTIFY_SOURCE) 557 __underlying_memset(&r_p->v, 0, sizeof(r_p->v)); 558 #else 559 memset(&r_p->v, 0, sizeof(r_p->v)); 560 #endif 561 562 SET_REFLINK_P_IDX(&r_p->v, bkey_start_offset(&r_v->k)); 563 564 if (reflink_p_may_update_opts_field) 565 SET_REFLINK_P_MAY_UPDATE_OPTIONS(&r_p->v, true); 566 567 ret = bch2_trans_update(trans, extent_iter, &r_p->k_i, 568 BTREE_UPDATE_internal_snapshot_node); 569 err: 570 bch2_trans_iter_exit(trans, &reflink_iter); 571 572 return ret; 573 } 574 575 static struct bkey_s_c get_next_src(struct btree_trans *trans, 576 struct btree_iter *iter, struct bpos end) 577 { 578 struct bkey_s_c k; 579 int ret; 580 581 for_each_btree_key_max_continue_norestart(trans, *iter, end, 0, k, ret) { 582 if (bkey_extent_is_unwritten(k)) 583 continue; 584 585 if (bkey_extent_is_data(k.k)) 586 return k; 587 } 588 589 if (bkey_ge(iter->pos, end)) 590 bch2_btree_iter_set_pos(trans, iter, end); 591 return ret ? bkey_s_c_err(ret) : bkey_s_c_null; 592 } 593 594 s64 bch2_remap_range(struct bch_fs *c, 595 subvol_inum dst_inum, u64 dst_offset, 596 subvol_inum src_inum, u64 src_offset, 597 u64 remap_sectors, 598 u64 new_i_size, s64 *i_sectors_delta, 599 bool may_change_src_io_path_opts) 600 { 601 struct btree_trans *trans; 602 struct btree_iter dst_iter, src_iter; 603 struct bkey_s_c src_k; 604 struct bkey_buf new_dst, new_src; 605 struct bpos dst_start = POS(dst_inum.inum, dst_offset); 606 struct bpos src_start = POS(src_inum.inum, src_offset); 607 struct bpos dst_end = dst_start, src_end = src_start; 608 struct bch_io_opts opts; 609 struct bpos src_want; 610 u64 dst_done = 0; 611 u32 dst_snapshot, src_snapshot; 612 bool reflink_p_may_update_opts_field = 613 !bch2_request_incompat_feature(c, bcachefs_metadata_version_reflink_p_may_update_opts); 614 int ret = 0, ret2 = 0; 615 616 if (!enumerated_ref_tryget(&c->writes, BCH_WRITE_REF_reflink)) 617 return bch_err_throw(c, erofs_no_writes); 618 619 bch2_check_set_feature(c, BCH_FEATURE_reflink); 620 621 dst_end.offset += remap_sectors; 622 src_end.offset += remap_sectors; 623 624 bch2_bkey_buf_init(&new_dst); 625 bch2_bkey_buf_init(&new_src); 626 trans = bch2_trans_get(c); 627 628 ret = bch2_inum_opts_get(trans, src_inum, &opts); 629 if (ret) 630 goto err; 631 632 bch2_trans_iter_init(trans, &src_iter, BTREE_ID_extents, src_start, 633 BTREE_ITER_intent); 634 bch2_trans_iter_init(trans, &dst_iter, BTREE_ID_extents, dst_start, 635 BTREE_ITER_intent); 636 637 while ((ret == 0 || 638 bch2_err_matches(ret, BCH_ERR_transaction_restart)) && 639 bkey_lt(dst_iter.pos, dst_end)) { 640 struct disk_reservation disk_res = { 0 }; 641 642 bch2_trans_begin(trans); 643 644 if (fatal_signal_pending(current)) { 645 ret = -EINTR; 646 break; 647 } 648 649 ret = bch2_subvolume_get_snapshot(trans, src_inum.subvol, 650 &src_snapshot); 651 if (ret) 652 continue; 653 654 bch2_btree_iter_set_snapshot(trans, &src_iter, src_snapshot); 655 656 ret = bch2_subvolume_get_snapshot(trans, dst_inum.subvol, 657 &dst_snapshot); 658 if (ret) 659 continue; 660 661 bch2_btree_iter_set_snapshot(trans, &dst_iter, dst_snapshot); 662 663 if (dst_inum.inum < src_inum.inum) { 664 /* Avoid some lock cycle transaction restarts */ 665 ret = bch2_btree_iter_traverse(trans, &dst_iter); 666 if (ret) 667 continue; 668 } 669 670 dst_done = dst_iter.pos.offset - dst_start.offset; 671 src_want = POS(src_start.inode, src_start.offset + dst_done); 672 bch2_btree_iter_set_pos(trans, &src_iter, src_want); 673 674 src_k = get_next_src(trans, &src_iter, src_end); 675 ret = bkey_err(src_k); 676 if (ret) 677 continue; 678 679 if (bkey_lt(src_want, src_iter.pos)) { 680 ret = bch2_fpunch_at(trans, &dst_iter, dst_inum, 681 min(dst_end.offset, 682 dst_iter.pos.offset + 683 src_iter.pos.offset - src_want.offset), 684 i_sectors_delta); 685 continue; 686 } 687 688 if (src_k.k->type != KEY_TYPE_reflink_p) { 689 bch2_btree_iter_set_pos_to_extent_start(&src_iter); 690 691 bch2_bkey_buf_reassemble(&new_src, c, src_k); 692 src_k = bkey_i_to_s_c(new_src.k); 693 694 ret = bch2_make_extent_indirect(trans, &src_iter, 695 new_src.k, 696 reflink_p_may_update_opts_field); 697 if (ret) 698 continue; 699 700 BUG_ON(src_k.k->type != KEY_TYPE_reflink_p); 701 } 702 703 if (src_k.k->type == KEY_TYPE_reflink_p) { 704 struct bkey_s_c_reflink_p src_p = 705 bkey_s_c_to_reflink_p(src_k); 706 struct bkey_i_reflink_p *dst_p = 707 bkey_reflink_p_init(new_dst.k); 708 709 u64 offset = REFLINK_P_IDX(src_p.v) + 710 (src_want.offset - 711 bkey_start_offset(src_k.k)); 712 713 SET_REFLINK_P_IDX(&dst_p->v, offset); 714 715 if (reflink_p_may_update_opts_field && 716 may_change_src_io_path_opts && 717 REFLINK_P_MAY_UPDATE_OPTIONS(src_p.v)) 718 SET_REFLINK_P_MAY_UPDATE_OPTIONS(&dst_p->v, true); 719 } else { 720 BUG(); 721 } 722 723 new_dst.k->k.p = dst_iter.pos; 724 bch2_key_resize(&new_dst.k->k, 725 min(src_k.k->p.offset - src_want.offset, 726 dst_end.offset - dst_iter.pos.offset)); 727 728 ret = bch2_bkey_set_needs_rebalance(c, &opts, new_dst.k) ?: 729 bch2_extent_update(trans, dst_inum, &dst_iter, 730 new_dst.k, &disk_res, 731 new_i_size, i_sectors_delta, 732 true); 733 bch2_disk_reservation_put(c, &disk_res); 734 } 735 bch2_trans_iter_exit(trans, &dst_iter); 736 bch2_trans_iter_exit(trans, &src_iter); 737 738 BUG_ON(!ret && !bkey_eq(dst_iter.pos, dst_end)); 739 BUG_ON(bkey_gt(dst_iter.pos, dst_end)); 740 741 dst_done = dst_iter.pos.offset - dst_start.offset; 742 new_i_size = min(dst_iter.pos.offset << 9, new_i_size); 743 744 do { 745 struct bch_inode_unpacked inode_u; 746 struct btree_iter inode_iter = {}; 747 748 bch2_trans_begin(trans); 749 750 ret2 = bch2_inode_peek(trans, &inode_iter, &inode_u, 751 dst_inum, BTREE_ITER_intent); 752 753 if (!ret2 && 754 inode_u.bi_size < new_i_size) { 755 inode_u.bi_size = new_i_size; 756 ret2 = bch2_inode_write(trans, &inode_iter, &inode_u) ?: 757 bch2_trans_commit(trans, NULL, NULL, 758 BCH_TRANS_COMMIT_no_enospc); 759 } 760 761 bch2_trans_iter_exit(trans, &inode_iter); 762 } while (bch2_err_matches(ret2, BCH_ERR_transaction_restart)); 763 err: 764 bch2_trans_put(trans); 765 bch2_bkey_buf_exit(&new_src, c); 766 bch2_bkey_buf_exit(&new_dst, c); 767 768 enumerated_ref_put(&c->writes, BCH_WRITE_REF_reflink); 769 770 return dst_done ?: ret ?: ret2; 771 } 772 773 /* fsck */ 774 775 static int bch2_gc_write_reflink_key(struct btree_trans *trans, 776 struct btree_iter *iter, 777 struct bkey_s_c k, 778 size_t *idx) 779 { 780 struct bch_fs *c = trans->c; 781 const __le64 *refcount = bkey_refcount_c(k); 782 struct printbuf buf = PRINTBUF; 783 struct reflink_gc *r; 784 int ret = 0; 785 786 if (!refcount) 787 return 0; 788 789 while ((r = genradix_ptr(&c->reflink_gc_table, *idx)) && 790 r->offset < k.k->p.offset) 791 ++*idx; 792 793 if (!r || 794 r->offset != k.k->p.offset || 795 r->size != k.k->size) { 796 bch_err(c, "unexpected inconsistency walking reflink table at gc finish"); 797 return -EINVAL; 798 } 799 800 if (fsck_err_on(r->refcount != le64_to_cpu(*refcount), 801 trans, reflink_v_refcount_wrong, 802 "reflink key has wrong refcount:\n" 803 "%s\n" 804 "should be %u", 805 (bch2_bkey_val_to_text(&buf, c, k), buf.buf), 806 r->refcount)) { 807 struct bkey_i *new = bch2_bkey_make_mut_noupdate(trans, k); 808 ret = PTR_ERR_OR_ZERO(new); 809 if (ret) 810 goto out; 811 812 if (!r->refcount) 813 new->k.type = KEY_TYPE_deleted; 814 else 815 *bkey_refcount(bkey_i_to_s(new)) = cpu_to_le64(r->refcount); 816 ret = bch2_trans_update(trans, iter, new, 0); 817 } 818 out: 819 fsck_err: 820 printbuf_exit(&buf); 821 return ret; 822 } 823 824 int bch2_gc_reflink_done(struct bch_fs *c) 825 { 826 size_t idx = 0; 827 828 int ret = bch2_trans_run(c, 829 for_each_btree_key_commit(trans, iter, 830 BTREE_ID_reflink, POS_MIN, 831 BTREE_ITER_prefetch, k, 832 NULL, NULL, BCH_TRANS_COMMIT_no_enospc, 833 bch2_gc_write_reflink_key(trans, &iter, k, &idx))); 834 c->reflink_gc_nr = 0; 835 return ret; 836 } 837 838 int bch2_gc_reflink_start(struct bch_fs *c) 839 { 840 c->reflink_gc_nr = 0; 841 842 int ret = bch2_trans_run(c, 843 for_each_btree_key(trans, iter, BTREE_ID_reflink, POS_MIN, 844 BTREE_ITER_prefetch, k, ({ 845 const __le64 *refcount = bkey_refcount_c(k); 846 847 if (!refcount) 848 continue; 849 850 struct reflink_gc *r = genradix_ptr_alloc(&c->reflink_gc_table, 851 c->reflink_gc_nr++, GFP_KERNEL); 852 if (!r) { 853 ret = bch_err_throw(c, ENOMEM_gc_reflink_start); 854 break; 855 } 856 857 r->offset = k.k->p.offset; 858 r->size = k.k->size; 859 r->refcount = 0; 860 0; 861 }))); 862 863 bch_err_fn(c, ret); 864 return ret; 865 } 866