git.sesse.net Git - bcachefs-tools-debian/blob - libbcachefs/reflink.c

   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 "error.h"
   7 #include "extents.h"
   8 #include "inode.h"
   9 #include "io_misc.h"
  10 #include "io_write.h"
  11 #include "rebalance.h"
  12 #include "reflink.h"
  13 #include "subvolume.h"
  14 #include "super-io.h"
  15
  16 #include <linux/sched/signal.h>
  17
  18 static inline unsigned bkey_type_to_indirect(const struct bkey *k)
  19 {
  20         switch (k->type) {
  21         case KEY_TYPE_extent:
  22                 return KEY_TYPE_reflink_v;
  23         case KEY_TYPE_inline_data:
  24                 return KEY_TYPE_indirect_inline_data;
  25         default:
  26                 return 0;
  27         }
  28 }
  29
  30 /* reflink pointers */
  31
  32 int bch2_reflink_p_invalid(struct bch_fs *c, struct bkey_s_c k,
  33                            enum bkey_invalid_flags flags,
  34                            struct printbuf *err)
  35 {
  36         struct bkey_s_c_reflink_p p = bkey_s_c_to_reflink_p(k);
  37
  38         if (c->sb.version >= bcachefs_metadata_version_reflink_p_fix &&
  39             le64_to_cpu(p.v->idx) < le32_to_cpu(p.v->front_pad)) {
  40                 prt_printf(err, "idx < front_pad (%llu < %u)",
  41                        le64_to_cpu(p.v->idx), le32_to_cpu(p.v->front_pad));
  42                 return -EINVAL;
  43         }
  44
  45         return 0;
  46 }
  47
  48 void bch2_reflink_p_to_text(struct printbuf *out, struct bch_fs *c,
  49                             struct bkey_s_c k)
  50 {
  51         struct bkey_s_c_reflink_p p = bkey_s_c_to_reflink_p(k);
  52
  53         prt_printf(out, "idx %llu front_pad %u back_pad %u",
  54                le64_to_cpu(p.v->idx),
  55                le32_to_cpu(p.v->front_pad),
  56                le32_to_cpu(p.v->back_pad));
  57 }
  58
  59 bool bch2_reflink_p_merge(struct bch_fs *c, struct bkey_s _l, struct bkey_s_c _r)
  60 {
  61         struct bkey_s_reflink_p l = bkey_s_to_reflink_p(_l);
  62         struct bkey_s_c_reflink_p r = bkey_s_c_to_reflink_p(_r);
  63
  64         /*
  65          * Disabled for now, the triggers code needs to be reworked for merging
  66          * of reflink pointers to work:
  67          */
  68         return false;
  69
  70         if (le64_to_cpu(l.v->idx) + l.k->size != le64_to_cpu(r.v->idx))
  71                 return false;
  72
  73         bch2_key_resize(l.k, l.k->size + r.k->size);
  74         return true;
  75 }
  76
  77 static int trans_mark_reflink_p_segment(struct btree_trans *trans,
  78                         struct bkey_s_c_reflink_p p,
  79                         u64 *idx, unsigned flags)
  80 {
  81         struct bch_fs *c = trans->c;
  82         struct btree_iter iter;
  83         struct bkey_i *k;
  84         __le64 *refcount;
  85         int add = !(flags & BTREE_TRIGGER_OVERWRITE) ? 1 : -1;
  86         struct printbuf buf = PRINTBUF;
  87         int ret;
  88
  89         k = bch2_bkey_get_mut_noupdate(trans, &iter,
  90                         BTREE_ID_reflink, POS(0, *idx),
  91                         BTREE_ITER_WITH_UPDATES);
  92         ret = PTR_ERR_OR_ZERO(k);
  93         if (ret)
  94                 goto err;
  95
  96         refcount = bkey_refcount(k);
  97         if (!refcount) {
  98                 bch2_bkey_val_to_text(&buf, c, p.s_c);
  99                 bch2_trans_inconsistent(trans,
 100                         "nonexistent indirect extent at %llu while marking\n  %s",
 101                         *idx, buf.buf);
 102                 ret = -EIO;
 103                 goto err;
 104         }
 105
 106         if (!*refcount && (flags & BTREE_TRIGGER_OVERWRITE)) {
 107                 bch2_bkey_val_to_text(&buf, c, p.s_c);
 108                 bch2_trans_inconsistent(trans,
 109                         "indirect extent refcount underflow at %llu while marking\n  %s",
 110                         *idx, buf.buf);
 111                 ret = -EIO;
 112                 goto err;
 113         }
 114
 115         if (flags & BTREE_TRIGGER_INSERT) {
 116                 struct bch_reflink_p *v = (struct bch_reflink_p *) p.v;
 117                 u64 pad;
 118
 119                 pad = max_t(s64, le32_to_cpu(v->front_pad),
 120                             le64_to_cpu(v->idx) - bkey_start_offset(&k->k));
 121                 BUG_ON(pad > U32_MAX);
 122                 v->front_pad = cpu_to_le32(pad);
 123
 124                 pad = max_t(s64, le32_to_cpu(v->back_pad),
 125                             k->k.p.offset - p.k->size - le64_to_cpu(v->idx));
 126                 BUG_ON(pad > U32_MAX);
 127                 v->back_pad = cpu_to_le32(pad);
 128         }
 129
 130         le64_add_cpu(refcount, add);
 131
 132         bch2_btree_iter_set_pos_to_extent_start(&iter);
 133         ret = bch2_trans_update(trans, &iter, k, 0);
 134         if (ret)
 135                 goto err;
 136
 137         *idx = k->k.p.offset;
 138 err:
 139         bch2_trans_iter_exit(trans, &iter);
 140         printbuf_exit(&buf);
 141         return ret;
 142 }
 143
 144 static int __trans_mark_reflink_p(struct btree_trans *trans,
 145                                 enum btree_id btree_id, unsigned level,
 146                                 struct bkey_s_c k, unsigned flags)
 147 {
 148         struct bkey_s_c_reflink_p p = bkey_s_c_to_reflink_p(k);
 149         u64 idx, end_idx;
 150         int ret = 0;
 151
 152         idx     = le64_to_cpu(p.v->idx) - le32_to_cpu(p.v->front_pad);
 153         end_idx = le64_to_cpu(p.v->idx) + p.k->size +
 154                 le32_to_cpu(p.v->back_pad);
 155
 156         while (idx < end_idx && !ret)
 157                 ret = trans_mark_reflink_p_segment(trans, p, &idx, flags);
 158         return ret;
 159 }
 160
 161 int bch2_trans_mark_reflink_p(struct btree_trans *trans,
 162                               enum btree_id btree_id, unsigned level,
 163                               struct bkey_s_c old,
 164                               struct bkey_i *new,
 165                               unsigned flags)
 166 {
 167         if (flags & BTREE_TRIGGER_INSERT) {
 168                 struct bch_reflink_p *v = &bkey_i_to_reflink_p(new)->v;
 169
 170                 v->front_pad = v->back_pad = 0;
 171         }
 172
 173         return trigger_run_overwrite_then_insert(__trans_mark_reflink_p, trans, btree_id, level, old, new, flags);
 174 }
 175
 176 static s64 __bch2_mark_reflink_p(struct btree_trans *trans,
 177                                  struct bkey_s_c_reflink_p p,
 178                                  u64 start, u64 end,
 179                                  u64 *idx, unsigned flags, size_t r_idx)
 180 {
 181         struct bch_fs *c = trans->c;
 182         struct reflink_gc *r;
 183         int add = !(flags & BTREE_TRIGGER_OVERWRITE) ? 1 : -1;
 184         u64 next_idx = end;
 185         s64 ret = 0;
 186         struct printbuf buf = PRINTBUF;
 187
 188         if (r_idx >= c->reflink_gc_nr)
 189                 goto not_found;
 190
 191         r = genradix_ptr(&c->reflink_gc_table, r_idx);
 192         next_idx = min(next_idx, r->offset - r->size);
 193         if (*idx < next_idx)
 194                 goto not_found;
 195
 196         BUG_ON((s64) r->refcount + add < 0);
 197
 198         r->refcount += add;
 199         *idx = r->offset;
 200         return 0;
 201 not_found:
 202         if (fsck_err(c, reflink_p_to_missing_reflink_v,
 203                      "pointer to missing indirect extent\n"
 204                      "  %s\n"
 205                      "  missing range %llu-%llu",
 206                      (bch2_bkey_val_to_text(&buf, c, p.s_c), buf.buf),
 207                      *idx, next_idx)) {
 208                 struct bkey_i_error *new;
 209
 210                 new = bch2_trans_kmalloc(trans, sizeof(*new));
 211                 ret = PTR_ERR_OR_ZERO(new);
 212                 if (ret)
 213                         goto err;
 214
 215                 bkey_init(&new->k);
 216                 new->k.type     = KEY_TYPE_error;
 217                 new->k.p                = bkey_start_pos(p.k);
 218                 new->k.p.offset += *idx - start;
 219                 bch2_key_resize(&new->k, next_idx - *idx);
 220                 ret = bch2_btree_insert_trans(trans, BTREE_ID_extents, &new->k_i,
 221                                           BTREE_TRIGGER_NORUN);
 222         }
 223
 224         *idx = next_idx;
 225 err:
 226 fsck_err:
 227         printbuf_exit(&buf);
 228         return ret;
 229 }
 230
 231 static int __mark_reflink_p(struct btree_trans *trans,
 232                             enum btree_id btree_id, unsigned level,
 233                             struct bkey_s_c k, unsigned flags)
 234 {
 235         struct bch_fs *c = trans->c;
 236         struct bkey_s_c_reflink_p p = bkey_s_c_to_reflink_p(k);
 237         struct reflink_gc *ref;
 238         size_t l, r, m;
 239         u64 idx = le64_to_cpu(p.v->idx), start = idx;
 240         u64 end = le64_to_cpu(p.v->idx) + p.k->size;
 241         int ret = 0;
 242
 243         BUG_ON(!(flags & BTREE_TRIGGER_GC));
 244
 245         if (c->sb.version_upgrade_complete >= bcachefs_metadata_version_reflink_p_fix) {
 246                 idx -= le32_to_cpu(p.v->front_pad);
 247                 end += le32_to_cpu(p.v->back_pad);
 248         }
 249
 250         l = 0;
 251         r = c->reflink_gc_nr;
 252         while (l < r) {
 253                 m = l + (r - l) / 2;
 254
 255                 ref = genradix_ptr(&c->reflink_gc_table, m);
 256                 if (ref->offset <= idx)
 257                         l = m + 1;
 258                 else
 259                         r = m;
 260         }
 261
 262         while (idx < end && !ret)
 263                 ret = __bch2_mark_reflink_p(trans, p, start, end,
 264                                             &idx, flags, l++);
 265
 266         return ret;
 267 }
 268
 269 int bch2_mark_reflink_p(struct btree_trans *trans,
 270                         enum btree_id btree_id, unsigned level,
 271                         struct bkey_s_c old, struct bkey_s_c new,
 272                         unsigned flags)
 273 {
 274         return mem_trigger_run_overwrite_then_insert(__mark_reflink_p, trans, btree_id, level, old, new, flags);
 275 }
 276
 277 /* indirect extents */
 278
 279 int bch2_reflink_v_invalid(struct bch_fs *c, struct bkey_s_c k,
 280                            enum bkey_invalid_flags flags,
 281                            struct printbuf *err)
 282 {
 283         return bch2_bkey_ptrs_invalid(c, k, flags, err);
 284 }
 285
 286 void bch2_reflink_v_to_text(struct printbuf *out, struct bch_fs *c,
 287                             struct bkey_s_c k)
 288 {
 289         struct bkey_s_c_reflink_v r = bkey_s_c_to_reflink_v(k);
 290
 291         prt_printf(out, "refcount: %llu ", le64_to_cpu(r.v->refcount));
 292
 293         bch2_bkey_ptrs_to_text(out, c, k);
 294 }
 295
 296 #if 0
 297 Currently disabled, needs to be debugged:
 298
 299 bool bch2_reflink_v_merge(struct bch_fs *c, struct bkey_s _l, struct bkey_s_c _r)
 300 {
 301         struct bkey_s_reflink_v   l = bkey_s_to_reflink_v(_l);
 302         struct bkey_s_c_reflink_v r = bkey_s_c_to_reflink_v(_r);
 303
 304         return l.v->refcount == r.v->refcount && bch2_extent_merge(c, _l, _r);
 305 }
 306 #endif
 307
 308 static inline void check_indirect_extent_deleting(struct bkey_i *new, unsigned *flags)
 309 {
 310         if ((*flags & BTREE_TRIGGER_INSERT) && !*bkey_refcount(new)) {
 311                 new->k.type = KEY_TYPE_deleted;
 312                 new->k.size = 0;
 313                 set_bkey_val_u64s(&new->k, 0);
 314                 *flags &= ~BTREE_TRIGGER_INSERT;
 315         }
 316 }
 317
 318 int bch2_trans_mark_reflink_v(struct btree_trans *trans,
 319                               enum btree_id btree_id, unsigned level,
 320                               struct bkey_s_c old, struct bkey_i *new,
 321                               unsigned flags)
 322 {
 323         check_indirect_extent_deleting(new, &flags);
 324
 325         if (old.k->type == KEY_TYPE_reflink_v &&
 326             new->k.type == KEY_TYPE_reflink_v &&
 327             old.k->u64s == new->k.u64s &&
 328             !memcmp(bkey_s_c_to_reflink_v(old).v->start,
 329                     bkey_i_to_reflink_v(new)->v.start,
 330                     bkey_val_bytes(&new->k) - 8))
 331                 return 0;
 332
 333         return bch2_trans_mark_extent(trans, btree_id, level, old, new, flags);
 334 }
 335
 336 /* indirect inline data */
 337
 338 int bch2_indirect_inline_data_invalid(struct bch_fs *c, struct bkey_s_c k,
 339                                       enum bkey_invalid_flags flags,
 340                                       struct printbuf *err)
 341 {
 342         return 0;
 343 }
 344
 345 void bch2_indirect_inline_data_to_text(struct printbuf *out,
 346                                        struct bch_fs *c, struct bkey_s_c k)
 347 {
 348         struct bkey_s_c_indirect_inline_data d = bkey_s_c_to_indirect_inline_data(k);
 349         unsigned datalen = bkey_inline_data_bytes(k.k);
 350
 351         prt_printf(out, "refcount %llu datalen %u: %*phN",
 352                le64_to_cpu(d.v->refcount), datalen,
 353                min(datalen, 32U), d.v->data);
 354 }
 355
 356 int bch2_trans_mark_indirect_inline_data(struct btree_trans *trans,
 357                               enum btree_id btree_id, unsigned level,
 358                               struct bkey_s_c old, struct bkey_i *new,
 359                               unsigned flags)
 360 {
 361         check_indirect_extent_deleting(new, &flags);
 362
 363         return 0;
 364 }
 365
 366 static int bch2_make_extent_indirect(struct btree_trans *trans,
 367                                      struct btree_iter *extent_iter,
 368                                      struct bkey_i *orig)
 369 {
 370         struct bch_fs *c = trans->c;
 371         struct btree_iter reflink_iter = { NULL };
 372         struct bkey_s_c k;
 373         struct bkey_i *r_v;
 374         struct bkey_i_reflink_p *r_p;
 375         __le64 *refcount;
 376         int ret;
 377
 378         if (orig->k.type == KEY_TYPE_inline_data)
 379                 bch2_check_set_feature(c, BCH_FEATURE_reflink_inline_data);
 380
 381         bch2_trans_iter_init(trans, &reflink_iter, BTREE_ID_reflink, POS_MAX,
 382                              BTREE_ITER_INTENT);
 383         k = bch2_btree_iter_peek_prev(&reflink_iter);
 384         ret = bkey_err(k);
 385         if (ret)
 386                 goto err;
 387
 388         r_v = bch2_trans_kmalloc(trans, sizeof(__le64) + bkey_bytes(&orig->k));
 389         ret = PTR_ERR_OR_ZERO(r_v);
 390         if (ret)
 391                 goto err;
 392
 393         bkey_init(&r_v->k);
 394         r_v->k.type     = bkey_type_to_indirect(&orig->k);
 395         r_v->k.p        = reflink_iter.pos;
 396         bch2_key_resize(&r_v->k, orig->k.size);
 397         r_v->k.version  = orig->k.version;
 398
 399         set_bkey_val_bytes(&r_v->k, sizeof(__le64) + bkey_val_bytes(&orig->k));
 400
 401         refcount        = bkey_refcount(r_v);
 402         *refcount       = 0;
 403         memcpy(refcount + 1, &orig->v, bkey_val_bytes(&orig->k));
 404
 405         ret = bch2_trans_update(trans, &reflink_iter, r_v, 0);
 406         if (ret)
 407                 goto err;
 408
 409         /*
 410          * orig is in a bkey_buf which statically allocates 5 64s for the val,
 411          * so we know it will be big enough:
 412          */
 413         orig->k.type = KEY_TYPE_reflink_p;
 414         r_p = bkey_i_to_reflink_p(orig);
 415         set_bkey_val_bytes(&r_p->k, sizeof(r_p->v));
 416
 417         /* FORTIFY_SOURCE is broken here, and doesn't provide unsafe_memset() */
 418 #if !defined(__NO_FORTIFY) && defined(__OPTIMIZE__) && defined(CONFIG_FORTIFY_SOURCE)
 419         __underlying_memset(&r_p->v, 0, sizeof(r_p->v));
 420 #else
 421         memset(&r_p->v, 0, sizeof(r_p->v));
 422 #endif
 423
 424         r_p->v.idx = cpu_to_le64(bkey_start_offset(&r_v->k));
 425
 426         ret = bch2_trans_update(trans, extent_iter, &r_p->k_i,
 427                                 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE);
 428 err:
 429         bch2_trans_iter_exit(trans, &reflink_iter);
 430
 431         return ret;
 432 }
 433
 434 static struct bkey_s_c get_next_src(struct btree_iter *iter, struct bpos end)
 435 {
 436         struct bkey_s_c k;
 437         int ret;
 438
 439         for_each_btree_key_upto_continue_norestart(*iter, end, 0, k, ret) {
 440                 if (bkey_extent_is_unwritten(k))
 441                         continue;
 442
 443                 if (bkey_extent_is_data(k.k))
 444                         return k;
 445         }
 446
 447         if (bkey_ge(iter->pos, end))
 448                 bch2_btree_iter_set_pos(iter, end);
 449         return ret ? bkey_s_c_err(ret) : bkey_s_c_null;
 450 }
 451
 452 s64 bch2_remap_range(struct bch_fs *c,
 453                      subvol_inum dst_inum, u64 dst_offset,
 454                      subvol_inum src_inum, u64 src_offset,
 455                      u64 remap_sectors,
 456                      u64 new_i_size, s64 *i_sectors_delta)
 457 {
 458         struct btree_trans *trans;
 459         struct btree_iter dst_iter, src_iter;
 460         struct bkey_s_c src_k;
 461         struct bkey_buf new_dst, new_src;
 462         struct bpos dst_start = POS(dst_inum.inum, dst_offset);
 463         struct bpos src_start = POS(src_inum.inum, src_offset);
 464         struct bpos dst_end = dst_start, src_end = src_start;
 465         struct bch_io_opts opts;
 466         struct bpos src_want;
 467         u64 dst_done = 0;
 468         u32 dst_snapshot, src_snapshot;
 469         int ret = 0, ret2 = 0;
 470
 471         if (!bch2_write_ref_tryget(c, BCH_WRITE_REF_reflink))
 472                 return -BCH_ERR_erofs_no_writes;
 473
 474         bch2_check_set_feature(c, BCH_FEATURE_reflink);
 475
 476         dst_end.offset += remap_sectors;
 477         src_end.offset += remap_sectors;
 478
 479         bch2_bkey_buf_init(&new_dst);
 480         bch2_bkey_buf_init(&new_src);
 481         trans = bch2_trans_get(c);
 482
 483         ret = bch2_inum_opts_get(trans, src_inum, &opts);
 484         if (ret)
 485                 goto err;
 486
 487         bch2_trans_iter_init(trans, &src_iter, BTREE_ID_extents, src_start,
 488                              BTREE_ITER_INTENT);
 489         bch2_trans_iter_init(trans, &dst_iter, BTREE_ID_extents, dst_start,
 490                              BTREE_ITER_INTENT);
 491
 492         while ((ret == 0 ||
 493                 bch2_err_matches(ret, BCH_ERR_transaction_restart)) &&
 494                bkey_lt(dst_iter.pos, dst_end)) {
 495                 struct disk_reservation disk_res = { 0 };
 496
 497                 bch2_trans_begin(trans);
 498
 499                 if (fatal_signal_pending(current)) {
 500                         ret = -EINTR;
 501                         break;
 502                 }
 503
 504                 ret = bch2_subvolume_get_snapshot(trans, src_inum.subvol,
 505                                                   &src_snapshot);
 506                 if (ret)
 507                         continue;
 508
 509                 bch2_btree_iter_set_snapshot(&src_iter, src_snapshot);
 510
 511                 ret = bch2_subvolume_get_snapshot(trans, dst_inum.subvol,
 512                                                   &dst_snapshot);
 513                 if (ret)
 514                         continue;
 515
 516                 bch2_btree_iter_set_snapshot(&dst_iter, dst_snapshot);
 517
 518                 dst_done = dst_iter.pos.offset - dst_start.offset;
 519                 src_want = POS(src_start.inode, src_start.offset + dst_done);
 520                 bch2_btree_iter_set_pos(&src_iter, src_want);
 521
 522                 src_k = get_next_src(&src_iter, src_end);
 523                 ret = bkey_err(src_k);
 524                 if (ret)
 525                         continue;
 526
 527                 if (bkey_lt(src_want, src_iter.pos)) {
 528                         ret = bch2_fpunch_at(trans, &dst_iter, dst_inum,
 529                                         min(dst_end.offset,
 530                                             dst_iter.pos.offset +
 531                                             src_iter.pos.offset - src_want.offset),
 532                                         i_sectors_delta);
 533                         continue;
 534                 }
 535
 536                 if (src_k.k->type != KEY_TYPE_reflink_p) {
 537                         bch2_btree_iter_set_pos_to_extent_start(&src_iter);
 538
 539                         bch2_bkey_buf_reassemble(&new_src, c, src_k);
 540                         src_k = bkey_i_to_s_c(new_src.k);
 541
 542                         ret = bch2_make_extent_indirect(trans, &src_iter,
 543                                                 new_src.k);
 544                         if (ret)
 545                                 continue;
 546
 547                         BUG_ON(src_k.k->type != KEY_TYPE_reflink_p);
 548                 }
 549
 550                 if (src_k.k->type == KEY_TYPE_reflink_p) {
 551                         struct bkey_s_c_reflink_p src_p =
 552                                 bkey_s_c_to_reflink_p(src_k);
 553                         struct bkey_i_reflink_p *dst_p =
 554                                 bkey_reflink_p_init(new_dst.k);
 555
 556                         u64 offset = le64_to_cpu(src_p.v->idx) +
 557                                 (src_want.offset -
 558                                  bkey_start_offset(src_k.k));
 559
 560                         dst_p->v.idx = cpu_to_le64(offset);
 561                 } else {
 562                         BUG();
 563                 }
 564
 565                 new_dst.k->k.p = dst_iter.pos;
 566                 bch2_key_resize(&new_dst.k->k,
 567                                 min(src_k.k->p.offset - src_want.offset,
 568                                     dst_end.offset - dst_iter.pos.offset));
 569
 570                 ret =   bch2_bkey_set_needs_rebalance(c, new_dst.k,
 571                                         opts.background_target,
 572                                         opts.background_compression) ?:
 573                         bch2_extent_update(trans, dst_inum, &dst_iter,
 574                                         new_dst.k, &disk_res,
 575                                         new_i_size, i_sectors_delta,
 576                                         true);
 577                 bch2_disk_reservation_put(c, &disk_res);
 578         }
 579         bch2_trans_iter_exit(trans, &dst_iter);
 580         bch2_trans_iter_exit(trans, &src_iter);
 581
 582         BUG_ON(!ret && !bkey_eq(dst_iter.pos, dst_end));
 583         BUG_ON(bkey_gt(dst_iter.pos, dst_end));
 584
 585         dst_done = dst_iter.pos.offset - dst_start.offset;
 586         new_i_size = min(dst_iter.pos.offset << 9, new_i_size);
 587
 588         do {
 589                 struct bch_inode_unpacked inode_u;
 590                 struct btree_iter inode_iter = { NULL };
 591
 592                 bch2_trans_begin(trans);
 593
 594                 ret2 = bch2_inode_peek(trans, &inode_iter, &inode_u,
 595                                        dst_inum, BTREE_ITER_INTENT);
 596
 597                 if (!ret2 &&
 598                     inode_u.bi_size < new_i_size) {
 599                         inode_u.bi_size = new_i_size;
 600                         ret2  = bch2_inode_write(trans, &inode_iter, &inode_u) ?:
 601                                 bch2_trans_commit(trans, NULL, NULL,
 602                                                   BCH_TRANS_COMMIT_no_enospc);
 603                 }
 604
 605                 bch2_trans_iter_exit(trans, &inode_iter);
 606         } while (bch2_err_matches(ret2, BCH_ERR_transaction_restart));
 607 err:
 608         bch2_trans_put(trans);
 609         bch2_bkey_buf_exit(&new_src, c);
 610         bch2_bkey_buf_exit(&new_dst, c);
 611
 612         bch2_write_ref_put(c, BCH_WRITE_REF_reflink);
 613
 614         return dst_done ?: ret ?: ret2;
 615 }