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 "extents.h"
   7 #include "inode.h"
   8 #include "io.h"
   9 #include "reflink.h"
  10 #include "subvolume.h"
  11
  12 #include <linux/sched/signal.h>
  13
  14 static inline unsigned bkey_type_to_indirect(const struct bkey *k)
  15 {
  16         switch (k->type) {
  17         case KEY_TYPE_extent:
  18                 return KEY_TYPE_reflink_v;
  19         case KEY_TYPE_inline_data:
  20                 return KEY_TYPE_indirect_inline_data;
  21         default:
  22                 return 0;
  23         }
  24 }
  25
  26 /* reflink pointers */
  27
  28 int bch2_reflink_p_invalid(const struct bch_fs *c, struct bkey_s_c k,
  29                            unsigned flags, struct printbuf *err)
  30 {
  31         struct bkey_s_c_reflink_p p = bkey_s_c_to_reflink_p(k);
  32
  33         if (bkey_val_bytes(p.k) != sizeof(*p.v)) {
  34                 prt_printf(err, "incorrect value size (%zu != %zu)",
  35                        bkey_val_bytes(p.k), sizeof(*p.v));
  36                 return -EINVAL;
  37         }
  38
  39         if (c->sb.version >= bcachefs_metadata_version_reflink_p_fix &&
  40             le64_to_cpu(p.v->idx) < le32_to_cpu(p.v->front_pad)) {
  41                 prt_printf(err, "idx < front_pad (%llu < %u)",
  42                        le64_to_cpu(p.v->idx), le32_to_cpu(p.v->front_pad));
  43                 return -EINVAL;
  44         }
  45
  46         return 0;
  47 }
  48
  49 void bch2_reflink_p_to_text(struct printbuf *out, struct bch_fs *c,
  50                             struct bkey_s_c k)
  51 {
  52         struct bkey_s_c_reflink_p p = bkey_s_c_to_reflink_p(k);
  53
  54         prt_printf(out, "idx %llu front_pad %u back_pad %u",
  55                le64_to_cpu(p.v->idx),
  56                le32_to_cpu(p.v->front_pad),
  57                le32_to_cpu(p.v->back_pad));
  58 }
  59
  60 bool bch2_reflink_p_merge(struct bch_fs *c, struct bkey_s _l, struct bkey_s_c _r)
  61 {
  62         struct bkey_s_reflink_p l = bkey_s_to_reflink_p(_l);
  63         struct bkey_s_c_reflink_p r = bkey_s_c_to_reflink_p(_r);
  64
  65         /*
  66          * Disabled for now, the triggers code needs to be reworked for merging
  67          * of reflink pointers to work:
  68          */
  69         return false;
  70
  71         if (le64_to_cpu(l.v->idx) + l.k->size != le64_to_cpu(r.v->idx))
  72                 return false;
  73
  74         bch2_key_resize(l.k, l.k->size + r.k->size);
  75         return true;
  76 }
  77
  78 /* indirect extents */
  79
  80 int bch2_reflink_v_invalid(const struct bch_fs *c, struct bkey_s_c k,
  81                            unsigned flags, struct printbuf *err)
  82 {
  83         struct bkey_s_c_reflink_v r = bkey_s_c_to_reflink_v(k);
  84
  85         if (bkey_val_bytes(r.k) < sizeof(*r.v)) {
  86                 prt_printf(err, "incorrect value size (%zu < %zu)",
  87                        bkey_val_bytes(r.k), sizeof(*r.v));
  88                 return -BCH_ERR_invalid_bkey;
  89         }
  90
  91         return bch2_bkey_ptrs_invalid(c, k, flags, err);
  92 }
  93
  94 void bch2_reflink_v_to_text(struct printbuf *out, struct bch_fs *c,
  95                             struct bkey_s_c k)
  96 {
  97         struct bkey_s_c_reflink_v r = bkey_s_c_to_reflink_v(k);
  98
  99         prt_printf(out, "refcount: %llu ", le64_to_cpu(r.v->refcount));
 100
 101         bch2_bkey_ptrs_to_text(out, c, k);
 102 }
 103
 104 bool bch2_reflink_v_merge(struct bch_fs *c, struct bkey_s _l, struct bkey_s_c _r)
 105 {
 106         struct bkey_s_reflink_v   l = bkey_s_to_reflink_v(_l);
 107         struct bkey_s_c_reflink_v r = bkey_s_c_to_reflink_v(_r);
 108
 109         return l.v->refcount == r.v->refcount && bch2_extent_merge(c, _l, _r);
 110 }
 111
 112 int bch2_trans_mark_reflink_v(struct btree_trans *trans,
 113                               enum btree_id btree_id, unsigned level,
 114                               struct bkey_s_c old, struct bkey_i *new,
 115                               unsigned flags)
 116 {
 117         if (!(flags & BTREE_TRIGGER_OVERWRITE)) {
 118                 struct bkey_i_reflink_v *r = bkey_i_to_reflink_v(new);
 119
 120                 if (!r->v.refcount) {
 121                         r->k.type = KEY_TYPE_deleted;
 122                         r->k.size = 0;
 123                         set_bkey_val_u64s(&r->k, 0);
 124                         return 0;
 125                 }
 126         }
 127
 128         return bch2_trans_mark_extent(trans, btree_id, level, old, new, flags);
 129 }
 130
 131 /* indirect inline data */
 132
 133 int bch2_indirect_inline_data_invalid(const struct bch_fs *c, struct bkey_s_c k,
 134                                       unsigned flags, struct printbuf *err)
 135 {
 136         if (bkey_val_bytes(k.k) < sizeof(struct bch_indirect_inline_data)) {
 137                 prt_printf(err, "incorrect value size (%zu < %zu)",
 138                        bkey_val_bytes(k.k), sizeof(struct bch_indirect_inline_data));
 139                 return -BCH_ERR_invalid_bkey;
 140         }
 141
 142         return 0;
 143 }
 144
 145 void bch2_indirect_inline_data_to_text(struct printbuf *out,
 146                                         struct bch_fs *c, struct bkey_s_c k)
 147 {
 148         struct bkey_s_c_indirect_inline_data d = bkey_s_c_to_indirect_inline_data(k);
 149         unsigned datalen = bkey_inline_data_bytes(k.k);
 150
 151         prt_printf(out, "refcount %llu datalen %u: %*phN",
 152                le64_to_cpu(d.v->refcount), datalen,
 153                min(datalen, 32U), d.v->data);
 154 }
 155
 156 int bch2_trans_mark_indirect_inline_data(struct btree_trans *trans,
 157                               enum btree_id btree_id, unsigned level,
 158                               struct bkey_s_c old, struct bkey_i *new,
 159                               unsigned flags)
 160 {
 161         if (!(flags & BTREE_TRIGGER_OVERWRITE)) {
 162                 struct bkey_i_indirect_inline_data *r =
 163                         bkey_i_to_indirect_inline_data(new);
 164
 165                 if (!r->v.refcount) {
 166                         r->k.type = KEY_TYPE_deleted;
 167                         r->k.size = 0;
 168                         set_bkey_val_u64s(&r->k, 0);
 169                 }
 170         }
 171
 172         return 0;
 173 }
 174
 175 static int bch2_make_extent_indirect(struct btree_trans *trans,
 176                                      struct btree_iter *extent_iter,
 177                                      struct bkey_i *orig)
 178 {
 179         struct bch_fs *c = trans->c;
 180         struct btree_iter reflink_iter = { NULL };
 181         struct bkey_s_c k;
 182         struct bkey_i *r_v;
 183         struct bkey_i_reflink_p *r_p;
 184         __le64 *refcount;
 185         int ret;
 186
 187         if (orig->k.type == KEY_TYPE_inline_data)
 188                 bch2_check_set_feature(c, BCH_FEATURE_reflink_inline_data);
 189
 190         for_each_btree_key_norestart(trans, reflink_iter, BTREE_ID_reflink,
 191                            POS(0, c->reflink_hint),
 192                            BTREE_ITER_SLOTS, k, ret) {
 193                 if (reflink_iter.pos.inode) {
 194                         bch2_btree_iter_set_pos(&reflink_iter, POS_MIN);
 195                         continue;
 196                 }
 197
 198                 if (bkey_deleted(k.k) && orig->k.size <= k.k->size)
 199                         break;
 200         }
 201
 202         if (ret)
 203                 goto err;
 204
 205         /* rewind iter to start of hole, if necessary: */
 206         bch2_btree_iter_set_pos_to_extent_start(&reflink_iter);
 207
 208         r_v = bch2_trans_kmalloc(trans, sizeof(__le64) + bkey_bytes(&orig->k));
 209         ret = PTR_ERR_OR_ZERO(r_v);
 210         if (ret)
 211                 goto err;
 212
 213         bkey_init(&r_v->k);
 214         r_v->k.type     = bkey_type_to_indirect(&orig->k);
 215         r_v->k.p        = reflink_iter.pos;
 216         bch2_key_resize(&r_v->k, orig->k.size);
 217         r_v->k.version  = orig->k.version;
 218
 219         set_bkey_val_bytes(&r_v->k, sizeof(__le64) + bkey_val_bytes(&orig->k));
 220
 221         refcount        = bkey_refcount(r_v);
 222         *refcount       = 0;
 223         memcpy(refcount + 1, &orig->v, bkey_val_bytes(&orig->k));
 224
 225         ret = bch2_trans_update(trans, &reflink_iter, r_v, 0);
 226         if (ret)
 227                 goto err;
 228
 229         /*
 230          * orig is in a bkey_buf which statically allocates 5 64s for the val,
 231          * so we know it will be big enough:
 232          */
 233         orig->k.type = KEY_TYPE_reflink_p;
 234         r_p = bkey_i_to_reflink_p(orig);
 235         set_bkey_val_bytes(&r_p->k, sizeof(r_p->v));
 236
 237         /* FORTIFY_SOURCE is broken here, and doesn't provide unsafe_memset() */
 238 #if !defined(__NO_FORTIFY) && defined(__OPTIMIZE__) && defined(CONFIG_FORTIFY_SOURCE)
 239         __underlying_memset(&r_p->v, 0, sizeof(r_p->v));
 240 #else
 241         memset(&r_p->v, 0, sizeof(r_p->v));
 242 #endif
 243
 244         r_p->v.idx = cpu_to_le64(bkey_start_offset(&r_v->k));
 245
 246         ret = bch2_trans_update(trans, extent_iter, &r_p->k_i,
 247                                 BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE);
 248 err:
 249         c->reflink_hint = reflink_iter.pos.offset;
 250         bch2_trans_iter_exit(trans, &reflink_iter);
 251
 252         return ret;
 253 }
 254
 255 static struct bkey_s_c get_next_src(struct btree_iter *iter, struct bpos end)
 256 {
 257         struct bkey_s_c k;
 258         int ret;
 259
 260         for_each_btree_key_upto_continue_norestart(*iter, end, 0, k, ret) {
 261                 if (bkey_extent_is_unwritten(k))
 262                         continue;
 263
 264                 if (bkey_extent_is_data(k.k))
 265                         return k;
 266         }
 267
 268         if (bkey_ge(iter->pos, end))
 269                 bch2_btree_iter_set_pos(iter, end);
 270         return ret ? bkey_s_c_err(ret) : bkey_s_c_null;
 271 }
 272
 273 s64 bch2_remap_range(struct bch_fs *c,
 274                      subvol_inum dst_inum, u64 dst_offset,
 275                      subvol_inum src_inum, u64 src_offset,
 276                      u64 remap_sectors,
 277                      u64 new_i_size, s64 *i_sectors_delta)
 278 {
 279         struct btree_trans trans;
 280         struct btree_iter dst_iter, src_iter;
 281         struct bkey_s_c src_k;
 282         struct bkey_buf new_dst, new_src;
 283         struct bpos dst_start = POS(dst_inum.inum, dst_offset);
 284         struct bpos src_start = POS(src_inum.inum, src_offset);
 285         struct bpos dst_end = dst_start, src_end = src_start;
 286         struct bpos src_want;
 287         u64 dst_done;
 288         u32 dst_snapshot, src_snapshot;
 289         int ret = 0, ret2 = 0;
 290
 291         if (!bch2_write_ref_tryget(c, BCH_WRITE_REF_reflink))
 292                 return -BCH_ERR_erofs_no_writes;
 293
 294         bch2_check_set_feature(c, BCH_FEATURE_reflink);
 295
 296         dst_end.offset += remap_sectors;
 297         src_end.offset += remap_sectors;
 298
 299         bch2_bkey_buf_init(&new_dst);
 300         bch2_bkey_buf_init(&new_src);
 301         bch2_trans_init(&trans, c, BTREE_ITER_MAX, 4096);
 302
 303         bch2_trans_iter_init(&trans, &src_iter, BTREE_ID_extents, src_start,
 304                              BTREE_ITER_INTENT);
 305         bch2_trans_iter_init(&trans, &dst_iter, BTREE_ID_extents, dst_start,
 306                              BTREE_ITER_INTENT);
 307
 308         while ((ret == 0 ||
 309                 bch2_err_matches(ret, BCH_ERR_transaction_restart)) &&
 310                bkey_lt(dst_iter.pos, dst_end)) {
 311                 struct disk_reservation disk_res = { 0 };
 312
 313                 bch2_trans_begin(&trans);
 314
 315                 if (fatal_signal_pending(current)) {
 316                         ret = -EINTR;
 317                         break;
 318                 }
 319
 320                 ret = bch2_subvolume_get_snapshot(&trans, src_inum.subvol,
 321                                                   &src_snapshot);
 322                 if (ret)
 323                         continue;
 324
 325                 bch2_btree_iter_set_snapshot(&src_iter, src_snapshot);
 326
 327                 ret = bch2_subvolume_get_snapshot(&trans, dst_inum.subvol,
 328                                                   &dst_snapshot);
 329                 if (ret)
 330                         continue;
 331
 332                 bch2_btree_iter_set_snapshot(&dst_iter, dst_snapshot);
 333
 334                 dst_done = dst_iter.pos.offset - dst_start.offset;
 335                 src_want = POS(src_start.inode, src_start.offset + dst_done);
 336                 bch2_btree_iter_set_pos(&src_iter, src_want);
 337
 338                 src_k = get_next_src(&src_iter, src_end);
 339                 ret = bkey_err(src_k);
 340                 if (ret)
 341                         continue;
 342
 343                 if (bkey_lt(src_want, src_iter.pos)) {
 344                         ret = bch2_fpunch_at(&trans, &dst_iter, dst_inum,
 345                                         min(dst_end.offset,
 346                                             dst_iter.pos.offset +
 347                                             src_iter.pos.offset - src_want.offset),
 348                                         i_sectors_delta);
 349                         continue;
 350                 }
 351
 352                 if (src_k.k->type != KEY_TYPE_reflink_p) {
 353                         bch2_btree_iter_set_pos_to_extent_start(&src_iter);
 354
 355                         bch2_bkey_buf_reassemble(&new_src, c, src_k);
 356                         src_k = bkey_i_to_s_c(new_src.k);
 357
 358                         ret = bch2_make_extent_indirect(&trans, &src_iter,
 359                                                 new_src.k);
 360                         if (ret)
 361                                 continue;
 362
 363                         BUG_ON(src_k.k->type != KEY_TYPE_reflink_p);
 364                 }
 365
 366                 if (src_k.k->type == KEY_TYPE_reflink_p) {
 367                         struct bkey_s_c_reflink_p src_p =
 368                                 bkey_s_c_to_reflink_p(src_k);
 369                         struct bkey_i_reflink_p *dst_p =
 370                                 bkey_reflink_p_init(new_dst.k);
 371
 372                         u64 offset = le64_to_cpu(src_p.v->idx) +
 373                                 (src_want.offset -
 374                                  bkey_start_offset(src_k.k));
 375
 376                         dst_p->v.idx = cpu_to_le64(offset);
 377                 } else {
 378                         BUG();
 379                 }
 380
 381                 new_dst.k->k.p = dst_iter.pos;
 382                 bch2_key_resize(&new_dst.k->k,
 383                                 min(src_k.k->p.offset - src_want.offset,
 384                                     dst_end.offset - dst_iter.pos.offset));
 385
 386                 ret = bch2_extent_update(&trans, dst_inum, &dst_iter,
 387                                          new_dst.k, &disk_res,
 388                                          new_i_size, i_sectors_delta,
 389                                          true);
 390                 bch2_disk_reservation_put(c, &disk_res);
 391         }
 392         bch2_trans_iter_exit(&trans, &dst_iter);
 393         bch2_trans_iter_exit(&trans, &src_iter);
 394
 395         BUG_ON(!ret && !bkey_eq(dst_iter.pos, dst_end));
 396         BUG_ON(bkey_gt(dst_iter.pos, dst_end));
 397
 398         dst_done = dst_iter.pos.offset - dst_start.offset;
 399         new_i_size = min(dst_iter.pos.offset << 9, new_i_size);
 400
 401         do {
 402                 struct bch_inode_unpacked inode_u;
 403                 struct btree_iter inode_iter = { NULL };
 404
 405                 bch2_trans_begin(&trans);
 406
 407                 ret2 = bch2_inode_peek(&trans, &inode_iter, &inode_u,
 408                                        dst_inum, BTREE_ITER_INTENT);
 409
 410                 if (!ret2 &&
 411                     inode_u.bi_size < new_i_size) {
 412                         inode_u.bi_size = new_i_size;
 413                         ret2  = bch2_inode_write(&trans, &inode_iter, &inode_u) ?:
 414                                 bch2_trans_commit(&trans, NULL, NULL,
 415                                                   BTREE_INSERT_NOFAIL);
 416                 }
 417
 418                 bch2_trans_iter_exit(&trans, &inode_iter);
 419         } while (bch2_err_matches(ret2, BCH_ERR_transaction_restart));
 420
 421         bch2_trans_exit(&trans);
 422         bch2_bkey_buf_exit(&new_src, c);
 423         bch2_bkey_buf_exit(&new_dst, c);
 424
 425         bch2_write_ref_put(c, BCH_WRITE_REF_reflink);
 426
 427         return dst_done ?: ret ?: ret2;
 428 }