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

   1 // SPDX-License-Identifier: GPL-2.0
   2
   3 #include "bcachefs.h"
   4 #include "btree_update.h"
   5 #include "btree_update_interior.h"
   6 #include "btree_gc.h"
   7 #include "btree_io.h"
   8 #include "btree_iter.h"
   9 #include "btree_key_cache.h"
  10 #include "btree_locking.h"
  11 #include "buckets.h"
  12 #include "debug.h"
  13 #include "error.h"
  14 #include "extent_update.h"
  15 #include "journal.h"
  16 #include "journal_reclaim.h"
  17 #include "keylist.h"
  18 #include "recovery.h"
  19 #include "subvolume.h"
  20 #include "replicas.h"
  21
  22 #include <linux/prefetch.h>
  23 #include <linux/sort.h>
  24 #include <trace/events/bcachefs.h>
  25
  26 static int __must_check
  27 bch2_trans_update_by_path(struct btree_trans *, struct btree_path *,
  28                           struct bkey_i *, enum btree_update_flags);
  29
  30 static inline int btree_insert_entry_cmp(const struct btree_insert_entry *l,
  31                                          const struct btree_insert_entry *r)
  32 {
  33         return   cmp_int(l->btree_id,   r->btree_id) ?:
  34                  -cmp_int(l->level,     r->level) ?:
  35                  bpos_cmp(l->k->k.p,    r->k->k.p);
  36 }
  37
  38 static inline struct btree_path_level *insert_l(struct btree_insert_entry *i)
  39 {
  40         return i->path->l + i->level;
  41 }
  42
  43 static inline bool same_leaf_as_prev(struct btree_trans *trans,
  44                                      struct btree_insert_entry *i)
  45 {
  46         return i != trans->updates &&
  47                 insert_l(&i[0])->b == insert_l(&i[-1])->b;
  48 }
  49
  50 static inline bool same_leaf_as_next(struct btree_trans *trans,
  51                                      struct btree_insert_entry *i)
  52 {
  53         return i + 1 < trans->updates + trans->nr_updates &&
  54                 insert_l(&i[0])->b == insert_l(&i[1])->b;
  55 }
  56
  57 static inline void bch2_btree_node_prep_for_write(struct btree_trans *trans,
  58                                                   struct btree_path *path,
  59                                                   struct btree *b)
  60 {
  61         struct bch_fs *c = trans->c;
  62
  63         if (path->cached)
  64                 return;
  65
  66         if (unlikely(btree_node_just_written(b)) &&
  67             bch2_btree_post_write_cleanup(c, b))
  68                 bch2_trans_node_reinit_iter(trans, b);
  69
  70         /*
  71          * If the last bset has been written, or if it's gotten too big - start
  72          * a new bset to insert into:
  73          */
  74         if (want_new_bset(c, b))
  75                 bch2_btree_init_next(trans, b);
  76 }
  77
  78 void bch2_btree_node_lock_for_insert(struct btree_trans *trans,
  79                                      struct btree_path *path,
  80                                      struct btree *b)
  81 {
  82         bch2_btree_node_lock_write(trans, path, b);
  83         bch2_btree_node_prep_for_write(trans, path, b);
  84 }
  85
  86 /* Inserting into a given leaf node (last stage of insert): */
  87
  88 /* Handle overwrites and do insert, for non extents: */
  89 bool bch2_btree_bset_insert_key(struct btree_trans *trans,
  90                                 struct btree_path *path,
  91                                 struct btree *b,
  92                                 struct btree_node_iter *node_iter,
  93                                 struct bkey_i *insert)
  94 {
  95         struct bkey_packed *k;
  96         unsigned clobber_u64s = 0, new_u64s = 0;
  97
  98         EBUG_ON(btree_node_just_written(b));
  99         EBUG_ON(bset_written(b, btree_bset_last(b)));
 100         EBUG_ON(bkey_deleted(&insert->k) && bkey_val_u64s(&insert->k));
 101         EBUG_ON(bpos_cmp(insert->k.p, b->data->min_key) < 0);
 102         EBUG_ON(bpos_cmp(insert->k.p, b->data->max_key) > 0);
 103         EBUG_ON(insert->k.u64s >
 104                 bch_btree_keys_u64s_remaining(trans->c, b));
 105
 106         k = bch2_btree_node_iter_peek_all(node_iter, b);
 107         if (k && bkey_cmp_left_packed(b, k, &insert->k.p))
 108                 k = NULL;
 109
 110         /* @k is the key being overwritten/deleted, if any: */
 111         EBUG_ON(k && bkey_deleted(k));
 112
 113         /* Deleting, but not found? nothing to do: */
 114         if (bkey_deleted(&insert->k) && !k)
 115                 return false;
 116
 117         if (bkey_deleted(&insert->k)) {
 118                 /* Deleting: */
 119                 btree_account_key_drop(b, k);
 120                 k->type = KEY_TYPE_deleted;
 121
 122                 if (k->needs_whiteout)
 123                         push_whiteout(trans->c, b, insert->k.p);
 124                 k->needs_whiteout = false;
 125
 126                 if (k >= btree_bset_last(b)->start) {
 127                         clobber_u64s = k->u64s;
 128                         bch2_bset_delete(b, k, clobber_u64s);
 129                         goto fix_iter;
 130                 } else {
 131                         bch2_btree_path_fix_key_modified(trans, b, k);
 132                 }
 133
 134                 return true;
 135         }
 136
 137         if (k) {
 138                 /* Overwriting: */
 139                 btree_account_key_drop(b, k);
 140                 k->type = KEY_TYPE_deleted;
 141
 142                 insert->k.needs_whiteout = k->needs_whiteout;
 143                 k->needs_whiteout = false;
 144
 145                 if (k >= btree_bset_last(b)->start) {
 146                         clobber_u64s = k->u64s;
 147                         goto overwrite;
 148                 } else {
 149                         bch2_btree_path_fix_key_modified(trans, b, k);
 150                 }
 151         }
 152
 153         k = bch2_btree_node_iter_bset_pos(node_iter, b, bset_tree_last(b));
 154 overwrite:
 155         bch2_bset_insert(b, node_iter, k, insert, clobber_u64s);
 156         new_u64s = k->u64s;
 157 fix_iter:
 158         if (clobber_u64s != new_u64s)
 159                 bch2_btree_node_iter_fix(trans, path, b, node_iter, k,
 160                                          clobber_u64s, new_u64s);
 161         return true;
 162 }
 163
 164 static int __btree_node_flush(struct journal *j, struct journal_entry_pin *pin,
 165                                unsigned i, u64 seq)
 166 {
 167         struct bch_fs *c = container_of(j, struct bch_fs, journal);
 168         struct btree_write *w = container_of(pin, struct btree_write, journal);
 169         struct btree *b = container_of(w, struct btree, writes[i]);
 170         unsigned long old, new, v;
 171         unsigned idx = w - b->writes;
 172
 173         six_lock_read(&b->c.lock, NULL, NULL);
 174         v = READ_ONCE(b->flags);
 175
 176         do {
 177                 old = new = v;
 178
 179                 if (!(old & (1 << BTREE_NODE_dirty)) ||
 180                     !!(old & (1 << BTREE_NODE_write_idx)) != idx ||
 181                     w->journal.seq != seq)
 182                         break;
 183
 184                 new |= 1 << BTREE_NODE_need_write;
 185         } while ((v = cmpxchg(&b->flags, old, new)) != old);
 186
 187         btree_node_write_if_need(c, b, SIX_LOCK_read);
 188         six_unlock_read(&b->c.lock);
 189         return 0;
 190 }
 191
 192 static int btree_node_flush0(struct journal *j, struct journal_entry_pin *pin, u64 seq)
 193 {
 194         return __btree_node_flush(j, pin, 0, seq);
 195 }
 196
 197 static int btree_node_flush1(struct journal *j, struct journal_entry_pin *pin, u64 seq)
 198 {
 199         return __btree_node_flush(j, pin, 1, seq);
 200 }
 201
 202 inline void bch2_btree_add_journal_pin(struct bch_fs *c,
 203                                        struct btree *b, u64 seq)
 204 {
 205         struct btree_write *w = btree_current_write(b);
 206
 207         bch2_journal_pin_add(&c->journal, seq, &w->journal,
 208                              btree_node_write_idx(b) == 0
 209                              ? btree_node_flush0
 210                              : btree_node_flush1);
 211 }
 212
 213 /**
 214  * btree_insert_key - insert a key one key into a leaf node
 215  */
 216 static void btree_insert_key_leaf(struct btree_trans *trans,
 217                                   struct btree_insert_entry *insert)
 218 {
 219         struct bch_fs *c = trans->c;
 220         struct btree *b = insert_l(insert)->b;
 221         struct bset_tree *t = bset_tree_last(b);
 222         struct bset *i = bset(b, t);
 223         int old_u64s = bset_u64s(t);
 224         int old_live_u64s = b->nr.live_u64s;
 225         int live_u64s_added, u64s_added;
 226
 227         if (unlikely(!bch2_btree_bset_insert_key(trans, insert->path, b,
 228                                         &insert_l(insert)->iter, insert->k)))
 229                 return;
 230
 231         i->journal_seq = cpu_to_le64(max(trans->journal_res.seq,
 232                                          le64_to_cpu(i->journal_seq)));
 233
 234         bch2_btree_add_journal_pin(c, b, trans->journal_res.seq);
 235
 236         if (unlikely(!btree_node_dirty(b)))
 237                 set_btree_node_dirty_acct(c, b);
 238
 239         live_u64s_added = (int) b->nr.live_u64s - old_live_u64s;
 240         u64s_added = (int) bset_u64s(t) - old_u64s;
 241
 242         if (b->sib_u64s[0] != U16_MAX && live_u64s_added < 0)
 243                 b->sib_u64s[0] = max(0, (int) b->sib_u64s[0] + live_u64s_added);
 244         if (b->sib_u64s[1] != U16_MAX && live_u64s_added < 0)
 245                 b->sib_u64s[1] = max(0, (int) b->sib_u64s[1] + live_u64s_added);
 246
 247         if (u64s_added > live_u64s_added &&
 248             bch2_maybe_compact_whiteouts(c, b))
 249                 bch2_trans_node_reinit_iter(trans, b);
 250 }
 251
 252 /* Cached btree updates: */
 253
 254 /* Normal update interface: */
 255
 256 static inline void btree_insert_entry_checks(struct btree_trans *trans,
 257                                              struct btree_insert_entry *i)
 258 {
 259         BUG_ON(bpos_cmp(i->k->k.p, i->path->pos));
 260         BUG_ON(i->cached        != i->path->cached);
 261         BUG_ON(i->level         != i->path->level);
 262         BUG_ON(i->btree_id      != i->path->btree_id);
 263         EBUG_ON(!i->level &&
 264                 !(i->flags & BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE) &&
 265                 test_bit(JOURNAL_REPLAY_DONE, &trans->c->journal.flags) &&
 266                 i->k->k.p.snapshot &&
 267                 bch2_snapshot_internal_node(trans->c, i->k->k.p.snapshot));
 268 }
 269
 270 static noinline int
 271 bch2_trans_journal_preres_get_cold(struct btree_trans *trans, unsigned u64s,
 272                                    unsigned long trace_ip)
 273 {
 274         struct bch_fs *c = trans->c;
 275         int ret;
 276
 277         bch2_trans_unlock(trans);
 278
 279         ret = bch2_journal_preres_get(&c->journal,
 280                         &trans->journal_preres, u64s, 0);
 281         if (ret)
 282                 return ret;
 283
 284         if (!bch2_trans_relock(trans)) {
 285                 trace_trans_restart_journal_preres_get(trans->fn, trace_ip);
 286                 return -EINTR;
 287         }
 288
 289         return 0;
 290 }
 291
 292 static inline int bch2_trans_journal_res_get(struct btree_trans *trans,
 293                                              unsigned flags)
 294 {
 295         struct bch_fs *c = trans->c;
 296         int ret;
 297
 298         ret = bch2_journal_res_get(&c->journal, &trans->journal_res,
 299                                    trans->journal_u64s,
 300                                    flags|
 301                                    (trans->flags & JOURNAL_WATERMARK_MASK));
 302
 303         return ret == -EAGAIN ? BTREE_INSERT_NEED_JOURNAL_RES : ret;
 304 }
 305
 306 #define JSET_ENTRY_LOG_U64s             4
 307
 308 static noinline void journal_transaction_name(struct btree_trans *trans)
 309 {
 310         struct bch_fs *c = trans->c;
 311         struct jset_entry *entry = journal_res_entry(&c->journal, &trans->journal_res);
 312         struct jset_entry_log *l = container_of(entry, struct jset_entry_log, entry);
 313         unsigned u64s = JSET_ENTRY_LOG_U64s - 1;
 314         unsigned b, buflen = u64s * sizeof(u64);
 315
 316         l->entry.u64s           = cpu_to_le16(u64s);
 317         l->entry.btree_id       = 0;
 318         l->entry.level          = 0;
 319         l->entry.type           = BCH_JSET_ENTRY_log;
 320         l->entry.pad[0]         = 0;
 321         l->entry.pad[1]         = 0;
 322         l->entry.pad[2]         = 0;
 323         b = min_t(unsigned, strlen(trans->fn), buflen);
 324         memcpy(l->d, trans->fn, b);
 325         while (b < buflen)
 326                 l->d[b++] = '\0';
 327
 328         trans->journal_res.offset       += JSET_ENTRY_LOG_U64s;
 329         trans->journal_res.u64s         -= JSET_ENTRY_LOG_U64s;
 330 }
 331
 332 static inline enum btree_insert_ret
 333 btree_key_can_insert(struct btree_trans *trans,
 334                      struct btree *b,
 335                      unsigned u64s)
 336 {
 337         struct bch_fs *c = trans->c;
 338
 339         if (!bch2_btree_node_insert_fits(c, b, u64s))
 340                 return BTREE_INSERT_BTREE_NODE_FULL;
 341
 342         return BTREE_INSERT_OK;
 343 }
 344
 345 static enum btree_insert_ret
 346 btree_key_can_insert_cached(struct btree_trans *trans,
 347                             struct btree_path *path,
 348                             unsigned u64s)
 349 {
 350         struct bch_fs *c = trans->c;
 351         struct bkey_cached *ck = (void *) path->l[0].b;
 352         unsigned old_u64s = ck->u64s, new_u64s;
 353         struct bkey_i *new_k;
 354
 355         EBUG_ON(path->level);
 356
 357         if (!test_bit(BKEY_CACHED_DIRTY, &ck->flags) &&
 358             bch2_btree_key_cache_must_wait(c) &&
 359             !(trans->flags & BTREE_INSERT_JOURNAL_RECLAIM))
 360                 return BTREE_INSERT_NEED_JOURNAL_RECLAIM;
 361
 362         /*
 363          * bch2_varint_decode can read past the end of the buffer by at most 7
 364          * bytes (it won't be used):
 365          */
 366         u64s += 1;
 367
 368         if (u64s <= ck->u64s)
 369                 return BTREE_INSERT_OK;
 370
 371         new_u64s        = roundup_pow_of_two(u64s);
 372         new_k           = krealloc(ck->k, new_u64s * sizeof(u64), GFP_NOFS);
 373         if (!new_k) {
 374                 bch_err(c, "error allocating memory for key cache key, btree %s u64s %u",
 375                         bch2_btree_ids[path->btree_id], new_u64s);
 376                 return -ENOMEM;
 377         }
 378
 379         ck->u64s        = new_u64s;
 380         ck->k           = new_k;
 381         /*
 382          * Keys returned by peek() are no longer valid pointers, so we need a
 383          * transaction restart:
 384          */
 385         trace_trans_restart_key_cache_key_realloced(trans->fn, _RET_IP_,
 386                                              path->btree_id, &path->pos,
 387                                              old_u64s, new_u64s);
 388         /*
 389          * Not using btree_trans_restart() because we can't unlock here, we have
 390          * write locks held:
 391          */
 392         trans->restarted = true;
 393         return -EINTR;
 394 }
 395
 396 static inline void do_btree_insert_one(struct btree_trans *trans,
 397                                        struct btree_insert_entry *i)
 398 {
 399         struct bch_fs *c = trans->c;
 400         struct journal *j = &c->journal;
 401
 402         EBUG_ON(trans->journal_res.ref !=
 403                 !(trans->flags & BTREE_INSERT_JOURNAL_REPLAY));
 404
 405         i->k->k.needs_whiteout = false;
 406
 407         if (!i->cached)
 408                 btree_insert_key_leaf(trans, i);
 409         else
 410                 bch2_btree_insert_key_cached(trans, i->path, i->k);
 411
 412         if (likely(!(trans->flags & BTREE_INSERT_JOURNAL_REPLAY))) {
 413                 bch2_journal_add_keys(j, &trans->journal_res,
 414                                       i->btree_id,
 415                                       i->level,
 416                                       i->k);
 417
 418                 if (trans->journal_seq)
 419                         *trans->journal_seq = trans->journal_res.seq;
 420         }
 421 }
 422
 423 /* Triggers: */
 424
 425 static int run_one_mem_trigger(struct btree_trans *trans,
 426                                struct btree_insert_entry *i,
 427                                unsigned flags)
 428 {
 429         struct bkey_s_c old = { &i->old_k, i->old_v };
 430         struct bkey_i *new = i->k;
 431         int ret;
 432
 433         if (unlikely(flags & BTREE_TRIGGER_NORUN))
 434                 return 0;
 435
 436         if (!btree_node_type_needs_gc(i->btree_id))
 437                 return 0;
 438
 439         if (bch2_bkey_ops[old.k->type].atomic_trigger ==
 440             bch2_bkey_ops[i->k->k.type].atomic_trigger &&
 441             ((1U << old.k->type) & BTREE_TRIGGER_WANTS_OLD_AND_NEW)) {
 442                 ret   = bch2_mark_key(trans, old, bkey_i_to_s_c(new),
 443                                 BTREE_TRIGGER_INSERT|BTREE_TRIGGER_OVERWRITE|flags);
 444         } else {
 445                 struct bkey             _deleted = KEY(0, 0, 0);
 446                 struct bkey_s_c         deleted = (struct bkey_s_c) { &_deleted, NULL };
 447
 448                 _deleted.p = i->path->pos;
 449
 450                 ret   = bch2_mark_key(trans, deleted, bkey_i_to_s_c(new),
 451                                 BTREE_TRIGGER_INSERT|flags) ?:
 452                         bch2_mark_key(trans, old, deleted,
 453                                 BTREE_TRIGGER_OVERWRITE|flags);
 454         }
 455
 456         return ret;
 457 }
 458
 459 static int run_one_trans_trigger(struct btree_trans *trans, struct btree_insert_entry *i,
 460                                  bool overwrite)
 461 {
 462         /*
 463          * Transactional triggers create new btree_insert_entries, so we can't
 464          * pass them a pointer to a btree_insert_entry, that memory is going to
 465          * move:
 466          */
 467         struct bkey old_k = i->old_k;
 468         struct bkey_s_c old = { &old_k, i->old_v };
 469
 470         if ((i->flags & BTREE_TRIGGER_NORUN) ||
 471             !(BTREE_NODE_TYPE_HAS_TRANS_TRIGGERS & (1U << i->bkey_type)))
 472                 return 0;
 473
 474         if (!i->insert_trigger_run &&
 475             !i->overwrite_trigger_run &&
 476             bch2_bkey_ops[old.k->type].trans_trigger ==
 477             bch2_bkey_ops[i->k->k.type].trans_trigger &&
 478             ((1U << old.k->type) & BTREE_TRIGGER_WANTS_OLD_AND_NEW)) {
 479                 i->overwrite_trigger_run = true;
 480                 i->insert_trigger_run = true;
 481                 return bch2_trans_mark_key(trans, old, i->k,
 482                                            BTREE_TRIGGER_INSERT|
 483                                            BTREE_TRIGGER_OVERWRITE|
 484                                            i->flags) ?: 1;
 485         } else if (overwrite && !i->overwrite_trigger_run) {
 486                 i->overwrite_trigger_run = true;
 487                 return bch2_trans_mark_old(trans, old, i->flags) ?: 1;
 488         } else if (!i->insert_trigger_run) {
 489                 i->insert_trigger_run = true;
 490                 return bch2_trans_mark_new(trans, i->k, i->flags) ?: 1;
 491         } else {
 492                 return 0;
 493         }
 494 }
 495
 496 static int run_btree_triggers(struct btree_trans *trans, enum btree_id btree_id,
 497                               struct btree_insert_entry *btree_id_start)
 498 {
 499         struct btree_insert_entry *i;
 500         bool trans_trigger_run;
 501         int ret, overwrite;
 502
 503         for (overwrite = 1; overwrite >= 0; --overwrite) {
 504
 505                 /*
 506                  * Running triggers will append more updates to the list of updates as
 507                  * we're walking it:
 508                  */
 509                 do {
 510                         trans_trigger_run = false;
 511
 512                         for (i = btree_id_start;
 513                              i < trans->updates + trans->nr_updates && i->btree_id <= btree_id;
 514                              i++) {
 515                                 if (i->btree_id != btree_id)
 516                                         continue;
 517
 518                                 ret = run_one_trans_trigger(trans, i, overwrite);
 519                                 if (ret < 0)
 520                                         return ret;
 521                                 if (ret)
 522                                         trans_trigger_run = true;
 523                         }
 524                 } while (trans_trigger_run);
 525         }
 526
 527         return 0;
 528 }
 529
 530 static int bch2_trans_commit_run_triggers(struct btree_trans *trans)
 531 {
 532         struct btree_insert_entry *i = NULL, *btree_id_start = trans->updates;
 533         unsigned btree_id = 0;
 534         int ret = 0;
 535
 536         /*
 537          *
 538          * For a given btree, this algorithm runs insert triggers before
 539          * overwrite triggers: this is so that when extents are being moved
 540          * (e.g. by FALLOCATE_FL_INSERT_RANGE), we don't drop references before
 541          * they are re-added.
 542          */
 543         for (btree_id = 0; btree_id < BTREE_ID_NR; btree_id++) {
 544                 if (btree_id == BTREE_ID_alloc)
 545                         continue;
 546
 547                 while (btree_id_start < trans->updates + trans->nr_updates &&
 548                        btree_id_start->btree_id < btree_id)
 549                         btree_id_start++;
 550
 551                 ret = run_btree_triggers(trans, btree_id, btree_id_start);
 552                 if (ret)
 553                         return ret;
 554         }
 555
 556         trans_for_each_update(trans, i) {
 557                 if (i->btree_id > BTREE_ID_alloc)
 558                         break;
 559                 if (i->btree_id == BTREE_ID_alloc) {
 560                         ret = run_btree_triggers(trans, BTREE_ID_alloc, i);
 561                         if (ret)
 562                                 return ret;
 563                         break;
 564                 }
 565         }
 566
 567         trans_for_each_update(trans, i)
 568                 BUG_ON(!(i->flags & BTREE_TRIGGER_NORUN) &&
 569                        (BTREE_NODE_TYPE_HAS_TRANS_TRIGGERS & (1U << i->bkey_type)) &&
 570                        (!i->insert_trigger_run || !i->overwrite_trigger_run));
 571
 572         return 0;
 573 }
 574
 575 static noinline int bch2_trans_commit_run_gc_triggers(struct btree_trans *trans)
 576 {
 577         struct bch_fs *c = trans->c;
 578         struct btree_insert_entry *i;
 579         int ret = 0;
 580
 581         trans_for_each_update(trans, i) {
 582                 /*
 583                  * XXX: synchronization of cached update triggers with gc
 584                  * XXX: synchronization of interior node updates with gc
 585                  */
 586                 BUG_ON(i->cached || i->level);
 587
 588                 if (gc_visited(c, gc_pos_btree_node(insert_l(i)->b))) {
 589                         ret = run_one_mem_trigger(trans, i, i->flags|BTREE_TRIGGER_GC);
 590                         if (ret)
 591                                 break;
 592                 }
 593         }
 594
 595         return ret;
 596 }
 597
 598 static inline int
 599 bch2_trans_commit_write_locked(struct btree_trans *trans,
 600                                struct btree_insert_entry **stopped_at,
 601                                unsigned long trace_ip)
 602 {
 603         struct bch_fs *c = trans->c;
 604         struct btree_insert_entry *i;
 605         struct btree_trans_commit_hook *h;
 606         unsigned u64s = 0;
 607         bool marking = false;
 608         int ret;
 609
 610         if (race_fault()) {
 611                 trace_trans_restart_fault_inject(trans->fn, trace_ip);
 612                 trans->restarted = true;
 613                 return -EINTR;
 614         }
 615
 616         /*
 617          * Check if the insert will fit in the leaf node with the write lock
 618          * held, otherwise another thread could write the node changing the
 619          * amount of space available:
 620          */
 621
 622         prefetch(&trans->c->journal.flags);
 623
 624         h = trans->hooks;
 625         while (h) {
 626                 ret = h->fn(trans, h);
 627                 if (ret)
 628                         return ret;
 629                 h = h->next;
 630         }
 631
 632         trans_for_each_update(trans, i) {
 633                 /* Multiple inserts might go to same leaf: */
 634                 if (!same_leaf_as_prev(trans, i))
 635                         u64s = 0;
 636
 637                 u64s += i->k->k.u64s;
 638                 ret = !i->cached
 639                         ? btree_key_can_insert(trans, insert_l(i)->b, u64s)
 640                         : btree_key_can_insert_cached(trans, i->path, u64s);
 641                 if (ret) {
 642                         *stopped_at = i;
 643                         return ret;
 644                 }
 645
 646                 if (btree_node_type_needs_gc(i->bkey_type))
 647                         marking = true;
 648
 649                 /*
 650                  * Revalidate before calling mem triggers - XXX, ugly:
 651                  *
 652                  * - successful btree node splits don't cause transaction
 653                  *   restarts and will have invalidated the pointer to the bkey
 654                  *   value
 655                  * - btree_node_lock_for_insert() -> btree_node_prep_for_write()
 656                  *   when it has to resort
 657                  * - btree_key_can_insert_cached() when it has to reallocate
 658                  *
 659                  *   Ugly because we currently have no way to tell if the
 660                  *   pointer's been invalidated, which means it's debatabale
 661                  *   whether we should be stashing the old key at all.
 662                  */
 663                 i->old_v = bch2_btree_path_peek_slot(i->path, &i->old_k).v;
 664
 665                 if (unlikely(!test_bit(JOURNAL_REPLAY_DONE, &c->journal.flags))) {
 666                         struct bkey_i *j_k =
 667                                 bch2_journal_keys_peek(c, i->btree_id, i->level, i->k->k.p);
 668
 669                         if (j_k && !bpos_cmp(j_k->k.p, i->k->k.p)) {
 670                                 i->old_k = j_k->k;
 671                                 i->old_v = &j_k->v;
 672                         }
 673                 }
 674         }
 675
 676         /*
 677          * Don't get journal reservation until after we know insert will
 678          * succeed:
 679          */
 680         if (likely(!(trans->flags & BTREE_INSERT_JOURNAL_REPLAY))) {
 681                 ret = bch2_trans_journal_res_get(trans,
 682                                 JOURNAL_RES_GET_NONBLOCK);
 683                 if (ret)
 684                         return ret;
 685
 686                 if (unlikely(trans->journal_transaction_names))
 687                         journal_transaction_name(trans);
 688         } else {
 689                 trans->journal_res.seq = c->journal.replay_journal_seq;
 690         }
 691
 692         if (unlikely(trans->extra_journal_entries.nr)) {
 693                 memcpy_u64s_small(journal_res_entry(&c->journal, &trans->journal_res),
 694                                   trans->extra_journal_entries.data,
 695                                   trans->extra_journal_entries.nr);
 696
 697                 trans->journal_res.offset       += trans->extra_journal_entries.nr;
 698                 trans->journal_res.u64s         -= trans->extra_journal_entries.nr;
 699         }
 700
 701         /*
 702          * Not allowed to fail after we've gotten our journal reservation - we
 703          * have to use it:
 704          */
 705
 706         if (!(trans->flags & BTREE_INSERT_JOURNAL_REPLAY)) {
 707                 if (bch2_journal_seq_verify)
 708                         trans_for_each_update(trans, i)
 709                                 i->k->k.version.lo = trans->journal_res.seq;
 710                 else if (bch2_inject_invalid_keys)
 711                         trans_for_each_update(trans, i)
 712                                 i->k->k.version = MAX_VERSION;
 713         }
 714
 715         if (trans->fs_usage_deltas &&
 716             bch2_trans_fs_usage_apply(trans, trans->fs_usage_deltas))
 717                 return BTREE_INSERT_NEED_MARK_REPLICAS;
 718
 719         trans_for_each_update(trans, i)
 720                 if (BTREE_NODE_TYPE_HAS_MEM_TRIGGERS & (1U << i->bkey_type)) {
 721                         ret = run_one_mem_trigger(trans, i, i->flags);
 722                         if (ret)
 723                                 return ret;
 724                 }
 725
 726         if (unlikely(c->gc_pos.phase)) {
 727                 ret = bch2_trans_commit_run_gc_triggers(trans);
 728                 if  (ret)
 729                         return ret;
 730         }
 731
 732         trans_for_each_update(trans, i)
 733                 do_btree_insert_one(trans, i);
 734
 735         return ret;
 736 }
 737
 738 static inline void path_upgrade_readers(struct btree_trans *trans, struct btree_path *path)
 739 {
 740         unsigned l;
 741
 742         for (l = 0; l < BTREE_MAX_DEPTH; l++)
 743                 if (btree_node_read_locked(path, l))
 744                         BUG_ON(!bch2_btree_node_upgrade(trans, path, l));
 745 }
 746
 747 static inline void upgrade_readers(struct btree_trans *trans, struct btree_path *path)
 748 {
 749         struct btree *b = path_l(path)->b;
 750
 751         do {
 752                 if (path->nodes_locked &&
 753                     path->nodes_locked != path->nodes_intent_locked)
 754                         path_upgrade_readers(trans, path);
 755         } while ((path = prev_btree_path(trans, path)) &&
 756                  path_l(path)->b == b);
 757 }
 758
 759 /*
 760  * Check for nodes that we have both read and intent locks on, and upgrade the
 761  * readers to intent:
 762  */
 763 static inline void normalize_read_intent_locks(struct btree_trans *trans)
 764 {
 765         struct btree_path *path;
 766         unsigned i, nr_read = 0, nr_intent = 0;
 767
 768         trans_for_each_path_inorder(trans, path, i) {
 769                 struct btree_path *next = i + 1 < trans->nr_sorted
 770                         ? trans->paths + trans->sorted[i + 1]
 771                         : NULL;
 772
 773                 if (path->nodes_locked) {
 774                         if (path->nodes_intent_locked)
 775                                 nr_intent++;
 776                         else
 777                                 nr_read++;
 778                 }
 779
 780                 if (!next || path_l(path)->b != path_l(next)->b) {
 781                         if (nr_read && nr_intent)
 782                                 upgrade_readers(trans, path);
 783
 784                         nr_read = nr_intent = 0;
 785                 }
 786         }
 787
 788         bch2_trans_verify_locks(trans);
 789 }
 790
 791 static inline bool have_conflicting_read_lock(struct btree_trans *trans, struct btree_path *pos)
 792 {
 793         struct btree_path *path;
 794         unsigned i;
 795
 796         trans_for_each_path_inorder(trans, path, i) {
 797                 //if (path == pos)
 798                 //      break;
 799
 800                 if (path->nodes_locked != path->nodes_intent_locked &&
 801                     !bch2_btree_path_upgrade(trans, path, path->level + 1))
 802                         return true;
 803         }
 804
 805         return false;
 806 }
 807
 808 static inline int trans_lock_write(struct btree_trans *trans)
 809 {
 810         struct btree_insert_entry *i;
 811
 812         trans_for_each_update(trans, i) {
 813                 if (same_leaf_as_prev(trans, i))
 814                         continue;
 815
 816                 if (!six_trylock_write(&insert_l(i)->b->c.lock)) {
 817                         if (have_conflicting_read_lock(trans, i->path))
 818                                 goto fail;
 819
 820                         btree_node_lock_type(trans, i->path,
 821                                              insert_l(i)->b,
 822                                              i->path->pos, i->level,
 823                                              SIX_LOCK_write, NULL, NULL);
 824                 }
 825
 826                 bch2_btree_node_prep_for_write(trans, i->path, insert_l(i)->b);
 827         }
 828
 829         return 0;
 830 fail:
 831         while (--i >= trans->updates) {
 832                 if (same_leaf_as_prev(trans, i))
 833                         continue;
 834
 835                 bch2_btree_node_unlock_write_inlined(trans, i->path, insert_l(i)->b);
 836         }
 837
 838         trace_trans_restart_would_deadlock_write(trans->fn);
 839         return btree_trans_restart(trans);
 840 }
 841
 842 static noinline void bch2_drop_overwrites_from_journal(struct btree_trans *trans)
 843 {
 844         struct btree_insert_entry *i;
 845
 846         trans_for_each_update(trans, i)
 847                 bch2_journal_key_overwritten(trans->c, i->btree_id, i->level, i->k->k.p);
 848 }
 849
 850 /*
 851  * Get journal reservation, take write locks, and attempt to do btree update(s):
 852  */
 853 static inline int do_bch2_trans_commit(struct btree_trans *trans,
 854                                        struct btree_insert_entry **stopped_at,
 855                                        unsigned long trace_ip)
 856 {
 857         struct bch_fs *c = trans->c;
 858         struct btree_insert_entry *i;
 859         struct printbuf buf = PRINTBUF;
 860         int ret, u64s_delta = 0;
 861
 862         trans_for_each_update(trans, i) {
 863                 if (bch2_bkey_invalid(c, bkey_i_to_s_c(i->k),
 864                                       i->bkey_type, WRITE, &buf)) {
 865                         printbuf_reset(&buf);
 866                         pr_buf(&buf, "invalid bkey on insert from %s -> %ps",
 867                                trans->fn, (void *) i->ip_allocated);
 868                         pr_newline(&buf);
 869                         pr_indent_push(&buf, 2);
 870
 871                         bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(i->k));
 872                         pr_newline(&buf);
 873
 874                         bch2_bkey_invalid(c, bkey_i_to_s_c(i->k),
 875                                           i->bkey_type, WRITE, &buf);
 876
 877                         bch2_trans_inconsistent(trans, "%s", buf.buf);
 878                         printbuf_exit(&buf);
 879                         return -EINVAL;
 880                 }
 881                 btree_insert_entry_checks(trans, i);
 882         }
 883
 884         printbuf_exit(&buf);
 885
 886         trans_for_each_update(trans, i) {
 887                 if (i->cached)
 888                         continue;
 889
 890                 u64s_delta += !bkey_deleted(&i->k->k) ? i->k->k.u64s : 0;
 891                 u64s_delta -= i->old_btree_u64s;
 892
 893                 if (!same_leaf_as_next(trans, i)) {
 894                         if (u64s_delta <= 0) {
 895                                 ret = bch2_foreground_maybe_merge(trans, i->path,
 896                                                         i->level, trans->flags);
 897                                 if (unlikely(ret))
 898                                         return ret;
 899                         }
 900
 901                         u64s_delta = 0;
 902                 }
 903         }
 904
 905         ret = bch2_journal_preres_get(&c->journal,
 906                         &trans->journal_preres, trans->journal_preres_u64s,
 907                         JOURNAL_RES_GET_NONBLOCK|
 908                         (trans->flags & JOURNAL_WATERMARK_MASK));
 909         if (unlikely(ret == -EAGAIN))
 910                 ret = bch2_trans_journal_preres_get_cold(trans,
 911                                                 trans->journal_preres_u64s, trace_ip);
 912         if (unlikely(ret))
 913                 return ret;
 914
 915         normalize_read_intent_locks(trans);
 916
 917         ret = trans_lock_write(trans);
 918         if (unlikely(ret))
 919                 return ret;
 920
 921         ret = bch2_trans_commit_write_locked(trans, stopped_at, trace_ip);
 922
 923         if (!ret && unlikely(!test_bit(JOURNAL_REPLAY_DONE, &c->journal.flags)))
 924                 bch2_drop_overwrites_from_journal(trans);
 925
 926         trans_for_each_update(trans, i)
 927                 if (!same_leaf_as_prev(trans, i))
 928                         bch2_btree_node_unlock_write_inlined(trans, i->path,
 929                                                         insert_l(i)->b);
 930
 931         if (!ret && trans->journal_pin)
 932                 bch2_journal_pin_add(&c->journal, trans->journal_res.seq,
 933                                      trans->journal_pin, NULL);
 934
 935         /*
 936          * Drop journal reservation after dropping write locks, since dropping
 937          * the journal reservation may kick off a journal write:
 938          */
 939         bch2_journal_res_put(&c->journal, &trans->journal_res);
 940
 941         if (unlikely(ret))
 942                 return ret;
 943
 944         bch2_trans_downgrade(trans);
 945
 946         return 0;
 947 }
 948
 949 static int journal_reclaim_wait_done(struct bch_fs *c)
 950 {
 951         int ret = bch2_journal_error(&c->journal) ?:
 952                 !bch2_btree_key_cache_must_wait(c);
 953
 954         if (!ret)
 955                 journal_reclaim_kick(&c->journal);
 956         return ret;
 957 }
 958
 959 static noinline
 960 int bch2_trans_commit_error(struct btree_trans *trans,
 961                             struct btree_insert_entry *i,
 962                             int ret, unsigned long trace_ip)
 963 {
 964         struct bch_fs *c = trans->c;
 965
 966         switch (ret) {
 967         case BTREE_INSERT_BTREE_NODE_FULL:
 968                 ret = bch2_btree_split_leaf(trans, i->path, trans->flags);
 969                 if (!ret)
 970                         return 0;
 971
 972                 if (ret == -EINTR)
 973                         trace_trans_restart_btree_node_split(trans->fn, trace_ip,
 974                                                 i->btree_id, &i->path->pos);
 975                 break;
 976         case BTREE_INSERT_NEED_MARK_REPLICAS:
 977                 bch2_trans_unlock(trans);
 978
 979                 ret = bch2_replicas_delta_list_mark(c, trans->fs_usage_deltas);
 980                 if (ret)
 981                         break;
 982
 983                 if (bch2_trans_relock(trans))
 984                         return 0;
 985
 986                 trace_trans_restart_mark_replicas(trans->fn, trace_ip);
 987                 ret = -EINTR;
 988                 break;
 989         case BTREE_INSERT_NEED_JOURNAL_RES:
 990                 bch2_trans_unlock(trans);
 991
 992                 if ((trans->flags & BTREE_INSERT_JOURNAL_RECLAIM) &&
 993                     !(trans->flags & JOURNAL_WATERMARK_reserved)) {
 994                         trans->restarted = true;
 995                         ret = -EAGAIN;
 996                         break;
 997                 }
 998
 999                 ret = bch2_trans_journal_res_get(trans, JOURNAL_RES_GET_CHECK);
1000                 if (ret)
1001                         break;
1002
1003                 if (bch2_trans_relock(trans))
1004                         return 0;
1005
1006                 trace_trans_restart_journal_res_get(trans->fn, trace_ip);
1007                 ret = -EINTR;
1008                 break;
1009         case BTREE_INSERT_NEED_JOURNAL_RECLAIM:
1010                 bch2_trans_unlock(trans);
1011
1012                 trace_trans_blocked_journal_reclaim(trans->fn, trace_ip);
1013
1014                 wait_event_freezable(c->journal.reclaim_wait,
1015                                      (ret = journal_reclaim_wait_done(c)));
1016                 if (ret < 0)
1017                         break;
1018
1019                 if (bch2_trans_relock(trans))
1020                         return 0;
1021
1022                 trace_trans_restart_journal_reclaim(trans->fn, trace_ip);
1023                 ret = -EINTR;
1024                 break;
1025         default:
1026                 BUG_ON(ret >= 0);
1027                 break;
1028         }
1029
1030         BUG_ON((ret == EINTR || ret == -EAGAIN) && !trans->restarted);
1031         BUG_ON(ret == -ENOSPC &&
1032                !(trans->flags & BTREE_INSERT_NOWAIT) &&
1033                (trans->flags & BTREE_INSERT_NOFAIL));
1034
1035         return ret;
1036 }
1037
1038 static noinline int
1039 bch2_trans_commit_get_rw_cold(struct btree_trans *trans)
1040 {
1041         struct bch_fs *c = trans->c;
1042         int ret;
1043
1044         if (likely(!(trans->flags & BTREE_INSERT_LAZY_RW)) ||
1045             test_bit(BCH_FS_STARTED, &c->flags))
1046                 return -EROFS;
1047
1048         bch2_trans_unlock(trans);
1049
1050         ret = bch2_fs_read_write_early(c);
1051         if (ret)
1052                 return ret;
1053
1054         if (!bch2_trans_relock(trans))
1055                 return -EINTR;
1056
1057         percpu_ref_get(&c->writes);
1058         return 0;
1059 }
1060
1061 /*
1062  * This is for updates done in the early part of fsck - btree_gc - before we've
1063  * gone RW. we only add the new key to the list of keys for journal replay to
1064  * do.
1065  */
1066 static noinline int
1067 do_bch2_trans_commit_to_journal_replay(struct btree_trans *trans)
1068 {
1069         struct bch_fs *c = trans->c;
1070         struct btree_insert_entry *i;
1071         int ret = 0;
1072
1073         trans_for_each_update(trans, i) {
1074                 ret = bch2_journal_key_insert(c, i->btree_id, i->level, i->k);
1075                 if (ret)
1076                         break;
1077         }
1078
1079         return ret;
1080 }
1081
1082 int __bch2_trans_commit(struct btree_trans *trans)
1083 {
1084         struct bch_fs *c = trans->c;
1085         struct btree_insert_entry *i = NULL;
1086         unsigned u64s;
1087         int ret = 0;
1088
1089         if (!trans->nr_updates &&
1090             !trans->extra_journal_entries.nr)
1091                 goto out_reset;
1092
1093         if (trans->flags & BTREE_INSERT_GC_LOCK_HELD)
1094                 lockdep_assert_held(&c->gc_lock);
1095
1096         ret = bch2_trans_commit_run_triggers(trans);
1097         if (ret)
1098                 goto out_reset;
1099
1100         if (unlikely(!test_bit(BCH_FS_MAY_GO_RW, &c->flags))) {
1101                 ret = do_bch2_trans_commit_to_journal_replay(trans);
1102                 goto out_reset;
1103         }
1104
1105         if (!(trans->flags & BTREE_INSERT_NOCHECK_RW) &&
1106             unlikely(!percpu_ref_tryget(&c->writes))) {
1107                 ret = bch2_trans_commit_get_rw_cold(trans);
1108                 if (ret)
1109                         goto out_reset;
1110         }
1111
1112         memset(&trans->journal_preres, 0, sizeof(trans->journal_preres));
1113
1114         trans->journal_u64s             = trans->extra_journal_entries.nr;
1115         trans->journal_preres_u64s      = 0;
1116
1117         trans->journal_transaction_names = READ_ONCE(c->opts.journal_transaction_names);
1118
1119         if (trans->journal_transaction_names)
1120                 trans->journal_u64s += JSET_ENTRY_LOG_U64s;
1121
1122         trans_for_each_update(trans, i) {
1123                 BUG_ON(!i->path->should_be_locked);
1124
1125                 if (unlikely(!bch2_btree_path_upgrade(trans, i->path, i->level + 1))) {
1126                         trace_trans_restart_upgrade(trans->fn, _RET_IP_,
1127                                                     i->btree_id, &i->path->pos);
1128                         ret = btree_trans_restart(trans);
1129                         goto out;
1130                 }
1131
1132                 BUG_ON(!btree_node_intent_locked(i->path, i->level));
1133
1134                 u64s = jset_u64s(i->k->k.u64s);
1135                 if (i->cached &&
1136                     likely(!(trans->flags & BTREE_INSERT_JOURNAL_REPLAY)))
1137                         trans->journal_preres_u64s += u64s;
1138                 trans->journal_u64s += u64s;
1139         }
1140
1141         if (trans->extra_journal_res) {
1142                 ret = bch2_disk_reservation_add(c, trans->disk_res,
1143                                 trans->extra_journal_res,
1144                                 (trans->flags & BTREE_INSERT_NOFAIL)
1145                                 ? BCH_DISK_RESERVATION_NOFAIL : 0);
1146                 if (ret)
1147                         goto err;
1148         }
1149 retry:
1150         BUG_ON(trans->restarted);
1151         memset(&trans->journal_res, 0, sizeof(trans->journal_res));
1152
1153         ret = do_bch2_trans_commit(trans, &i, _RET_IP_);
1154
1155         /* make sure we didn't drop or screw up locks: */
1156         bch2_trans_verify_locks(trans);
1157
1158         if (ret)
1159                 goto err;
1160 out:
1161         bch2_journal_preres_put(&c->journal, &trans->journal_preres);
1162
1163         if (likely(!(trans->flags & BTREE_INSERT_NOCHECK_RW)))
1164                 percpu_ref_put(&c->writes);
1165 out_reset:
1166         trans_for_each_update(trans, i)
1167                 bch2_path_put(trans, i->path, true);
1168
1169         trans->extra_journal_res        = 0;
1170         trans->nr_updates               = 0;
1171         trans->hooks                    = NULL;
1172         trans->extra_journal_entries.nr = 0;
1173
1174         if (trans->fs_usage_deltas) {
1175                 trans->fs_usage_deltas->used = 0;
1176                 memset(&trans->fs_usage_deltas->memset_start, 0,
1177                        (void *) &trans->fs_usage_deltas->memset_end -
1178                        (void *) &trans->fs_usage_deltas->memset_start);
1179         }
1180
1181         return ret;
1182 err:
1183         ret = bch2_trans_commit_error(trans, i, ret, _RET_IP_);
1184         if (ret)
1185                 goto out;
1186
1187         goto retry;
1188 }
1189
1190 static int check_pos_snapshot_overwritten(struct btree_trans *trans,
1191                                           enum btree_id id,
1192                                           struct bpos pos)
1193 {
1194         struct bch_fs *c = trans->c;
1195         struct btree_iter iter;
1196         struct bkey_s_c k;
1197         int ret;
1198
1199         if (!btree_type_has_snapshots(id))
1200                 return 0;
1201
1202         if (!snapshot_t(c, pos.snapshot)->children[0])
1203                 return 0;
1204
1205         bch2_trans_iter_init(trans, &iter, id, pos,
1206                              BTREE_ITER_NOT_EXTENTS|
1207                              BTREE_ITER_ALL_SNAPSHOTS);
1208         while (1) {
1209                 k = bch2_btree_iter_prev(&iter);
1210                 ret = bkey_err(k);
1211                 if (ret)
1212                         break;
1213
1214                 if (!k.k)
1215                         break;
1216
1217                 if (bkey_cmp(pos, k.k->p))
1218                         break;
1219
1220                 if (bch2_snapshot_is_ancestor(c, k.k->p.snapshot, pos.snapshot)) {
1221                         ret = 1;
1222                         break;
1223                 }
1224         }
1225         bch2_trans_iter_exit(trans, &iter);
1226
1227         return ret;
1228 }
1229
1230 int bch2_trans_update_extent(struct btree_trans *trans,
1231                              struct btree_iter *orig_iter,
1232                              struct bkey_i *insert,
1233                              enum btree_update_flags flags)
1234 {
1235         struct bch_fs *c = trans->c;
1236         struct btree_iter iter, update_iter;
1237         struct bpos start = bkey_start_pos(&insert->k);
1238         struct bkey_i *update;
1239         struct bkey_s_c k;
1240         enum btree_id btree_id = orig_iter->btree_id;
1241         int ret = 0, compressed_sectors;
1242
1243         bch2_trans_iter_init(trans, &iter, btree_id, start,
1244                              BTREE_ITER_INTENT|
1245                              BTREE_ITER_WITH_UPDATES|
1246                              BTREE_ITER_NOT_EXTENTS);
1247         k = bch2_btree_iter_peek_upto(&iter, POS(insert->k.p.inode, U64_MAX));
1248         if ((ret = bkey_err(k)))
1249                 goto err;
1250         if (!k.k)
1251                 goto out;
1252
1253         if (bch2_bkey_maybe_mergable(k.k, &insert->k)) {
1254                 /*
1255                  * We can't merge extents if they belong to interior snapshot
1256                  * tree nodes, and there's a snapshot in which one extent is
1257                  * visible and the other is not - i.e. if visibility is
1258                  * different.
1259                  *
1260                  * Instead of checking if visibilitiy of the two extents is
1261                  * different, for now we just check if either has been
1262                  * overwritten:
1263                  */
1264                 ret = check_pos_snapshot_overwritten(trans, btree_id, insert->k.p);
1265                 if (ret < 0)
1266                         goto err;
1267                 if (ret)
1268                         goto nomerge1;
1269
1270                 ret = check_pos_snapshot_overwritten(trans, btree_id, k.k->p);
1271                 if (ret < 0)
1272                         goto err;
1273                 if (ret)
1274                         goto nomerge1;
1275
1276                 update = bch2_trans_kmalloc(trans, bkey_bytes(k.k));
1277                 if ((ret = PTR_ERR_OR_ZERO(update)))
1278                         goto err;
1279
1280                 bkey_reassemble(update, k);
1281
1282                 if (bch2_bkey_merge(c, bkey_i_to_s(update), bkey_i_to_s_c(insert))) {
1283                         ret = bch2_btree_delete_at(trans, &iter, flags);
1284                         if (ret)
1285                                 goto err;
1286
1287                         insert = update;
1288                         goto next;
1289                 }
1290         }
1291 nomerge1:
1292         ret = 0;
1293         if (!bkey_cmp(k.k->p, start))
1294                 goto next;
1295
1296         while (bkey_cmp(insert->k.p, bkey_start_pos(k.k)) > 0) {
1297                 bool front_split = bkey_cmp(bkey_start_pos(k.k), start) < 0;
1298                 bool back_split  = bkey_cmp(k.k->p, insert->k.p) > 0;
1299
1300                 /*
1301                  * If we're going to be splitting a compressed extent, note it
1302                  * so that __bch2_trans_commit() can increase our disk
1303                  * reservation:
1304                  */
1305                 if (((front_split && back_split) ||
1306                      ((front_split || back_split) && k.k->p.snapshot != insert->k.p.snapshot)) &&
1307                     (compressed_sectors = bch2_bkey_sectors_compressed(k)))
1308                         trans->extra_journal_res += compressed_sectors;
1309
1310                 if (front_split) {
1311                         update = bch2_trans_kmalloc(trans, bkey_bytes(k.k));
1312                         if ((ret = PTR_ERR_OR_ZERO(update)))
1313                                 goto err;
1314
1315                         bkey_reassemble(update, k);
1316
1317                         bch2_cut_back(start, update);
1318
1319                         bch2_trans_iter_init(trans, &update_iter, btree_id, update->k.p,
1320                                              BTREE_ITER_NOT_EXTENTS|
1321                                              BTREE_ITER_ALL_SNAPSHOTS|
1322                                              BTREE_ITER_INTENT);
1323                         ret   = bch2_btree_iter_traverse(&update_iter) ?:
1324                                 bch2_trans_update(trans, &update_iter, update,
1325                                                   BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE|
1326                                                   flags);
1327                         bch2_trans_iter_exit(trans, &update_iter);
1328
1329                         if (ret)
1330                                 goto err;
1331                 }
1332
1333                 if (k.k->p.snapshot != insert->k.p.snapshot &&
1334                     (front_split || back_split)) {
1335                         update = bch2_trans_kmalloc(trans, bkey_bytes(k.k));
1336                         if ((ret = PTR_ERR_OR_ZERO(update)))
1337                                 goto err;
1338
1339                         bkey_reassemble(update, k);
1340
1341                         bch2_cut_front(start, update);
1342                         bch2_cut_back(insert->k.p, update);
1343
1344                         bch2_trans_iter_init(trans, &update_iter, btree_id, update->k.p,
1345                                              BTREE_ITER_NOT_EXTENTS|
1346                                              BTREE_ITER_ALL_SNAPSHOTS|
1347                                              BTREE_ITER_INTENT);
1348                         ret   = bch2_btree_iter_traverse(&update_iter) ?:
1349                                 bch2_trans_update(trans, &update_iter, update,
1350                                                   BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE|
1351                                                   flags);
1352                         bch2_trans_iter_exit(trans, &update_iter);
1353                         if (ret)
1354                                 goto err;
1355                 }
1356
1357                 if (bkey_cmp(k.k->p, insert->k.p) <= 0) {
1358                         update = bch2_trans_kmalloc(trans, sizeof(*update));
1359                         if ((ret = PTR_ERR_OR_ZERO(update)))
1360                                 goto err;
1361
1362                         bkey_init(&update->k);
1363                         update->k.p = k.k->p;
1364
1365                         if (insert->k.p.snapshot != k.k->p.snapshot) {
1366                                 update->k.p.snapshot = insert->k.p.snapshot;
1367                                 update->k.type = KEY_TYPE_whiteout;
1368                         }
1369
1370                         bch2_trans_iter_init(trans, &update_iter, btree_id, update->k.p,
1371                                              BTREE_ITER_NOT_EXTENTS|
1372                                              BTREE_ITER_INTENT);
1373                         ret   = bch2_btree_iter_traverse(&update_iter) ?:
1374                                 bch2_trans_update(trans, &update_iter, update,
1375                                                   BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE|
1376                                                   flags);
1377                         bch2_trans_iter_exit(trans, &update_iter);
1378
1379                         if (ret)
1380                                 goto err;
1381                 }
1382
1383                 if (back_split) {
1384                         update = bch2_trans_kmalloc(trans, bkey_bytes(k.k));
1385                         if ((ret = PTR_ERR_OR_ZERO(update)))
1386                                 goto err;
1387
1388                         bkey_reassemble(update, k);
1389                         bch2_cut_front(insert->k.p, update);
1390
1391                         ret = bch2_trans_update_by_path(trans, iter.path, update,
1392                                                   BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE|
1393                                                   flags);
1394                         if (ret)
1395                                 goto err;
1396                         goto out;
1397                 }
1398 next:
1399                 bch2_btree_iter_advance(&iter);
1400                 k = bch2_btree_iter_peek_upto(&iter, POS(insert->k.p.inode, U64_MAX));
1401                 if ((ret = bkey_err(k)))
1402                         goto err;
1403                 if (!k.k)
1404                         goto out;
1405         }
1406
1407         if (bch2_bkey_maybe_mergable(&insert->k, k.k)) {
1408                 ret = check_pos_snapshot_overwritten(trans, btree_id, insert->k.p);
1409                 if (ret < 0)
1410                         goto err;
1411                 if (ret)
1412                         goto nomerge2;
1413
1414                 ret = check_pos_snapshot_overwritten(trans, btree_id, k.k->p);
1415                 if (ret < 0)
1416                         goto err;
1417                 if (ret)
1418                         goto nomerge2;
1419
1420                 bch2_bkey_merge(c, bkey_i_to_s(insert), k);
1421         }
1422 nomerge2:
1423         ret = 0;
1424 out:
1425         if (!bkey_deleted(&insert->k)) {
1426                 /*
1427                  * Rewinding iterators is expensive: get a new one and the one
1428                  * that points to the start of insert will be cloned from:
1429                  */
1430                 bch2_trans_iter_exit(trans, &iter);
1431                 bch2_trans_iter_init(trans, &iter, btree_id, insert->k.p,
1432                                      BTREE_ITER_NOT_EXTENTS|
1433                                      BTREE_ITER_INTENT);
1434                 ret   = bch2_btree_iter_traverse(&iter) ?:
1435                         bch2_trans_update(trans, &iter, insert, flags);
1436         }
1437 err:
1438         bch2_trans_iter_exit(trans, &iter);
1439
1440         return ret;
1441 }
1442
1443 /*
1444  * When deleting, check if we need to emit a whiteout (because we're overwriting
1445  * something in an ancestor snapshot)
1446  */
1447 static int need_whiteout_for_snapshot(struct btree_trans *trans,
1448                                       enum btree_id btree_id, struct bpos pos)
1449 {
1450         struct btree_iter iter;
1451         struct bkey_s_c k;
1452         u32 snapshot = pos.snapshot;
1453         int ret;
1454
1455         if (!bch2_snapshot_parent(trans->c, pos.snapshot))
1456                 return 0;
1457
1458         pos.snapshot++;
1459
1460         for_each_btree_key_norestart(trans, iter, btree_id, pos,
1461                            BTREE_ITER_ALL_SNAPSHOTS|
1462                            BTREE_ITER_NOPRESERVE, k, ret) {
1463                 if (bkey_cmp(k.k->p, pos))
1464                         break;
1465
1466                 if (bch2_snapshot_is_ancestor(trans->c, snapshot,
1467                                               k.k->p.snapshot)) {
1468                         ret = !bkey_whiteout(k.k);
1469                         break;
1470                 }
1471         }
1472         bch2_trans_iter_exit(trans, &iter);
1473
1474         return ret;
1475 }
1476
1477 static int __must_check
1478 bch2_trans_update_by_path(struct btree_trans *trans, struct btree_path *path,
1479                           struct bkey_i *k, enum btree_update_flags flags)
1480 {
1481         struct bch_fs *c = trans->c;
1482         struct btree_insert_entry *i, n;
1483
1484         BUG_ON(!path->should_be_locked);
1485
1486         BUG_ON(trans->nr_updates >= BTREE_ITER_MAX);
1487         BUG_ON(bpos_cmp(k->k.p, path->pos));
1488
1489         n = (struct btree_insert_entry) {
1490                 .flags          = flags,
1491                 .bkey_type      = __btree_node_type(path->level, path->btree_id),
1492                 .btree_id       = path->btree_id,
1493                 .level          = path->level,
1494                 .cached         = path->cached,
1495                 .path           = path,
1496                 .k              = k,
1497                 .ip_allocated   = _RET_IP_,
1498         };
1499
1500 #ifdef CONFIG_BCACHEFS_DEBUG
1501         trans_for_each_update(trans, i)
1502                 BUG_ON(i != trans->updates &&
1503                        btree_insert_entry_cmp(i - 1, i) >= 0);
1504 #endif
1505
1506         /*
1507          * Pending updates are kept sorted: first, find position of new update,
1508          * then delete/trim any updates the new update overwrites:
1509          */
1510         trans_for_each_update(trans, i)
1511                 if (btree_insert_entry_cmp(&n, i) <= 0)
1512                         break;
1513
1514         if (i < trans->updates + trans->nr_updates &&
1515             !btree_insert_entry_cmp(&n, i)) {
1516                 BUG_ON(i->insert_trigger_run || i->overwrite_trigger_run);
1517
1518                 bch2_path_put(trans, i->path, true);
1519                 i->flags        = n.flags;
1520                 i->cached       = n.cached;
1521                 i->k            = n.k;
1522                 i->path         = n.path;
1523                 i->ip_allocated = n.ip_allocated;
1524         } else {
1525                 array_insert_item(trans->updates, trans->nr_updates,
1526                                   i - trans->updates, n);
1527
1528                 i->old_v = bch2_btree_path_peek_slot(path, &i->old_k).v;
1529                 i->old_btree_u64s = !bkey_deleted(&i->old_k) ? i->old_k.u64s : 0;
1530
1531                 if (unlikely(!test_bit(JOURNAL_REPLAY_DONE, &c->journal.flags))) {
1532                         struct bkey_i *j_k =
1533                                 bch2_journal_keys_peek(c, n.btree_id, n.level, k->k.p);
1534
1535                         if (j_k && !bpos_cmp(j_k->k.p, i->k->k.p)) {
1536                                 i->old_k = j_k->k;
1537                                 i->old_v = &j_k->v;
1538                         }
1539                 }
1540         }
1541
1542         __btree_path_get(n.path, true);
1543         return 0;
1544 }
1545
1546 int __must_check bch2_trans_update(struct btree_trans *trans, struct btree_iter *iter,
1547                                    struct bkey_i *k, enum btree_update_flags flags)
1548 {
1549         struct btree_path *path = iter->update_path ?: iter->path;
1550         struct bkey_cached *ck;
1551         int ret;
1552
1553         if (iter->flags & BTREE_ITER_IS_EXTENTS)
1554                 return bch2_trans_update_extent(trans, iter, k, flags);
1555
1556         if (bkey_deleted(&k->k) &&
1557             !(flags & BTREE_UPDATE_KEY_CACHE_RECLAIM) &&
1558             (iter->flags & BTREE_ITER_FILTER_SNAPSHOTS)) {
1559                 ret = need_whiteout_for_snapshot(trans, iter->btree_id, k->k.p);
1560                 if (unlikely(ret < 0))
1561                         return ret;
1562
1563                 if (ret)
1564                         k->k.type = KEY_TYPE_whiteout;
1565         }
1566
1567         if (!(flags & BTREE_UPDATE_KEY_CACHE_RECLAIM) &&
1568             !path->cached &&
1569             !path->level &&
1570             btree_id_cached(trans->c, path->btree_id)) {
1571                 if (!iter->key_cache_path ||
1572                     !iter->key_cache_path->should_be_locked ||
1573                     bpos_cmp(iter->key_cache_path->pos, k->k.p)) {
1574                         if (!iter->key_cache_path)
1575                                 iter->key_cache_path =
1576                                         bch2_path_get(trans, path->btree_id, path->pos, 1, 0,
1577                                                       BTREE_ITER_INTENT|
1578                                                       BTREE_ITER_CACHED, _THIS_IP_);
1579
1580                         iter->key_cache_path =
1581                                 bch2_btree_path_set_pos(trans, iter->key_cache_path, path->pos,
1582                                                         iter->flags & BTREE_ITER_INTENT,
1583                                                         _THIS_IP_);
1584
1585                         ret = bch2_btree_path_traverse(trans, iter->key_cache_path,
1586                                                        BTREE_ITER_CACHED);
1587                         if (unlikely(ret))
1588                                 return ret;
1589
1590                         ck = (void *) iter->key_cache_path->l[0].b;
1591
1592                         if (test_bit(BKEY_CACHED_DIRTY, &ck->flags)) {
1593                                 trace_trans_restart_key_cache_raced(trans->fn, _RET_IP_);
1594                                 btree_trans_restart(trans);
1595                                 return -EINTR;
1596                         }
1597
1598                         iter->key_cache_path->should_be_locked = true;
1599                 }
1600
1601                 path = iter->key_cache_path;
1602         }
1603
1604         return bch2_trans_update_by_path(trans, path, k, flags);
1605 }
1606
1607 void bch2_trans_commit_hook(struct btree_trans *trans,
1608                             struct btree_trans_commit_hook *h)
1609 {
1610         h->next = trans->hooks;
1611         trans->hooks = h;
1612 }
1613
1614 int __bch2_btree_insert(struct btree_trans *trans,
1615                         enum btree_id id, struct bkey_i *k)
1616 {
1617         struct btree_iter iter;
1618         int ret;
1619
1620         bch2_trans_iter_init(trans, &iter, id, bkey_start_pos(&k->k),
1621                              BTREE_ITER_INTENT);
1622         ret   = bch2_btree_iter_traverse(&iter) ?:
1623                 bch2_trans_update(trans, &iter, k, 0);
1624         bch2_trans_iter_exit(trans, &iter);
1625         return ret;
1626 }
1627
1628 /**
1629  * bch2_btree_insert - insert keys into the extent btree
1630  * @c:                  pointer to struct bch_fs
1631  * @id:                 btree to insert into
1632  * @insert_keys:        list of keys to insert
1633  * @hook:               insert callback
1634  */
1635 int bch2_btree_insert(struct bch_fs *c, enum btree_id id,
1636                       struct bkey_i *k,
1637                       struct disk_reservation *disk_res,
1638                       u64 *journal_seq, int flags)
1639 {
1640         return bch2_trans_do(c, disk_res, journal_seq, flags,
1641                              __bch2_btree_insert(&trans, id, k));
1642 }
1643
1644 int bch2_btree_delete_at(struct btree_trans *trans,
1645                          struct btree_iter *iter, unsigned update_flags)
1646 {
1647         struct bkey_i *k;
1648
1649         k = bch2_trans_kmalloc(trans, sizeof(*k));
1650         if (IS_ERR(k))
1651                 return PTR_ERR(k);
1652
1653         bkey_init(&k->k);
1654         k->k.p = iter->pos;
1655         return bch2_trans_update(trans, iter, k, update_flags);
1656 }
1657
1658 int bch2_btree_delete_range_trans(struct btree_trans *trans, enum btree_id id,
1659                                   struct bpos start, struct bpos end,
1660                                   unsigned update_flags,
1661                                   u64 *journal_seq)
1662 {
1663         struct btree_iter iter;
1664         struct bkey_s_c k;
1665         int ret = 0;
1666
1667         bch2_trans_iter_init(trans, &iter, id, start, BTREE_ITER_INTENT);
1668 retry:
1669         while ((bch2_trans_begin(trans),
1670                (k = bch2_btree_iter_peek(&iter)).k) &&
1671                !(ret = bkey_err(k)) &&
1672                bkey_cmp(iter.pos, end) < 0) {
1673                 struct disk_reservation disk_res =
1674                         bch2_disk_reservation_init(trans->c, 0);
1675                 struct bkey_i delete;
1676
1677                 bkey_init(&delete.k);
1678
1679                 /*
1680                  * This could probably be more efficient for extents:
1681                  */
1682
1683                 /*
1684                  * For extents, iter.pos won't necessarily be the same as
1685                  * bkey_start_pos(k.k) (for non extents they always will be the
1686                  * same). It's important that we delete starting from iter.pos
1687                  * because the range we want to delete could start in the middle
1688                  * of k.
1689                  *
1690                  * (bch2_btree_iter_peek() does guarantee that iter.pos >=
1691                  * bkey_start_pos(k.k)).
1692                  */
1693                 delete.k.p = iter.pos;
1694
1695                 if (iter.flags & BTREE_ITER_IS_EXTENTS) {
1696                         unsigned max_sectors =
1697                                 KEY_SIZE_MAX & (~0 << trans->c->block_bits);
1698
1699                         /* create the biggest key we can */
1700                         bch2_key_resize(&delete.k, max_sectors);
1701                         bch2_cut_back(end, &delete);
1702
1703                         ret = bch2_extent_trim_atomic(trans, &iter, &delete);
1704                         if (ret)
1705                                 break;
1706                 }
1707
1708                 ret   = bch2_trans_update(trans, &iter, &delete, update_flags) ?:
1709                         bch2_trans_commit(trans, &disk_res, journal_seq,
1710                                           BTREE_INSERT_NOFAIL);
1711                 bch2_disk_reservation_put(trans->c, &disk_res);
1712                 if (ret)
1713                         break;
1714         }
1715
1716         if (ret == -EINTR) {
1717                 ret = 0;
1718                 goto retry;
1719         }
1720
1721         bch2_trans_iter_exit(trans, &iter);
1722         return ret;
1723 }
1724
1725 /*
1726  * bch_btree_delete_range - delete everything within a given range
1727  *
1728  * Range is a half open interval - [start, end)
1729  */
1730 int bch2_btree_delete_range(struct bch_fs *c, enum btree_id id,
1731                             struct bpos start, struct bpos end,
1732                             unsigned update_flags,
1733                             u64 *journal_seq)
1734 {
1735         return bch2_trans_do(c, NULL, journal_seq, 0,
1736                              bch2_btree_delete_range_trans(&trans, id, start, end,
1737                                                            update_flags, journal_seq));
1738 }
1739
1740 int bch2_trans_log_msg(struct btree_trans *trans, const char *msg)
1741 {
1742         unsigned len = strlen(msg);
1743         unsigned u64s = DIV_ROUND_UP(len, sizeof(u64));
1744         struct jset_entry_log *l;
1745         int ret;
1746
1747         ret = darray_make_room(trans->extra_journal_entries, jset_u64s(u64s));
1748         if (ret)
1749                 return ret;
1750
1751         l = (void *) &darray_top(trans->extra_journal_entries);
1752         l->entry.u64s           = cpu_to_le16(u64s);
1753         l->entry.btree_id       = 0;
1754         l->entry.level          = 1;
1755         l->entry.type           = BCH_JSET_ENTRY_log;
1756         l->entry.pad[0]         = 0;
1757         l->entry.pad[1]         = 0;
1758         l->entry.pad[2]         = 0;
1759         memcpy(l->d, msg, len);
1760         while (len & 7)
1761                 l->d[len++] = '\0';
1762
1763         trans->extra_journal_entries.nr += jset_u64s(u64s);
1764         return 0;
1765 }