git.sesse.net Git - bcachefs-tools-debian/blob - libbcachefs/btree_types.h

   1 /* SPDX-License-Identifier: GPL-2.0 */
   2 #ifndef _BCACHEFS_BTREE_TYPES_H
   3 #define _BCACHEFS_BTREE_TYPES_H
   4
   5 #include <linux/list.h>
   6 #include <linux/rhashtable.h>
   7 #include <linux/six.h>
   8
   9 #include "bkey_methods.h"
  10 #include "buckets_types.h"
  11 #include "journal_types.h"
  12
  13 struct open_bucket;
  14 struct btree_update;
  15 struct btree_trans;
  16
  17 #define MAX_BSETS               3U
  18
  19 struct btree_nr_keys {
  20
  21         /*
  22          * Amount of live metadata (i.e. size of node after a compaction) in
  23          * units of u64s
  24          */
  25         u16                     live_u64s;
  26         u16                     bset_u64s[MAX_BSETS];
  27
  28         /* live keys only: */
  29         u16                     packed_keys;
  30         u16                     unpacked_keys;
  31 };
  32
  33 struct bset_tree {
  34         /*
  35          * We construct a binary tree in an array as if the array
  36          * started at 1, so that things line up on the same cachelines
  37          * better: see comments in bset.c at cacheline_to_bkey() for
  38          * details
  39          */
  40
  41         /* size of the binary tree and prev array */
  42         u16                     size;
  43
  44         /* function of size - precalculated for to_inorder() */
  45         u16                     extra;
  46
  47         u16                     data_offset;
  48         u16                     aux_data_offset;
  49         u16                     end_offset;
  50 };
  51
  52 struct btree_write {
  53         struct journal_entry_pin        journal;
  54 };
  55
  56 struct btree_alloc {
  57         struct open_buckets     ob;
  58         __BKEY_PADDED(k, BKEY_BTREE_PTR_VAL_U64s_MAX);
  59 };
  60
  61 struct btree_bkey_cached_common {
  62         struct six_lock         lock;
  63         u8                      level;
  64         u8                      btree_id;
  65 };
  66
  67 struct btree {
  68         struct btree_bkey_cached_common c;
  69
  70         struct rhash_head       hash;
  71         u64                     hash_val;
  72
  73         unsigned long           flags;
  74         u16                     written;
  75         u8                      nsets;
  76         u8                      nr_key_bits;
  77         u16                     version_ondisk;
  78
  79         struct bkey_format      format;
  80
  81         struct btree_node       *data;
  82         void                    *aux_data;
  83
  84         /*
  85          * Sets of sorted keys - the real btree node - plus a binary search tree
  86          *
  87          * set[0] is special; set[0]->tree, set[0]->prev and set[0]->data point
  88          * to the memory we have allocated for this btree node. Additionally,
  89          * set[0]->data points to the entire btree node as it exists on disk.
  90          */
  91         struct bset_tree        set[MAX_BSETS];
  92
  93         struct btree_nr_keys    nr;
  94         u16                     sib_u64s[2];
  95         u16                     whiteout_u64s;
  96         u8                      byte_order;
  97         u8                      unpack_fn_len;
  98
  99         struct btree_write      writes[2];
 100
 101         /* Key/pointer for this btree node */
 102         __BKEY_PADDED(key, BKEY_BTREE_PTR_VAL_U64s_MAX);
 103
 104         /*
 105          * XXX: add a delete sequence number, so when bch2_btree_node_relock()
 106          * fails because the lock sequence number has changed - i.e. the
 107          * contents were modified - we can still relock the node if it's still
 108          * the one we want, without redoing the traversal
 109          */
 110
 111         /*
 112          * For asynchronous splits/interior node updates:
 113          * When we do a split, we allocate new child nodes and update the parent
 114          * node to point to them: we update the parent in memory immediately,
 115          * but then we must wait until the children have been written out before
 116          * the update to the parent can be written - this is a list of the
 117          * btree_updates that are blocking this node from being
 118          * written:
 119          */
 120         struct list_head        write_blocked;
 121
 122         /*
 123          * Also for asynchronous splits/interior node updates:
 124          * If a btree node isn't reachable yet, we don't want to kick off
 125          * another write - because that write also won't yet be reachable and
 126          * marking it as completed before it's reachable would be incorrect:
 127          */
 128         unsigned long           will_make_reachable;
 129
 130         struct open_buckets     ob;
 131
 132         /* lru list */
 133         struct list_head        list;
 134 };
 135
 136 struct btree_cache {
 137         struct rhashtable       table;
 138         bool                    table_init_done;
 139         /*
 140          * We never free a struct btree, except on shutdown - we just put it on
 141          * the btree_cache_freed list and reuse it later. This simplifies the
 142          * code, and it doesn't cost us much memory as the memory usage is
 143          * dominated by buffers that hold the actual btree node data and those
 144          * can be freed - and the number of struct btrees allocated is
 145          * effectively bounded.
 146          *
 147          * btree_cache_freeable effectively is a small cache - we use it because
 148          * high order page allocations can be rather expensive, and it's quite
 149          * common to delete and allocate btree nodes in quick succession. It
 150          * should never grow past ~2-3 nodes in practice.
 151          */
 152         struct mutex            lock;
 153         struct list_head        live;
 154         struct list_head        freeable;
 155         struct list_head        freed;
 156
 157         /* Number of elements in live + freeable lists */
 158         unsigned                used;
 159         unsigned                reserve;
 160         atomic_t                dirty;
 161         struct shrinker         shrink;
 162
 163         /*
 164          * If we need to allocate memory for a new btree node and that
 165          * allocation fails, we can cannibalize another node in the btree cache
 166          * to satisfy the allocation - lock to guarantee only one thread does
 167          * this at a time:
 168          */
 169         struct task_struct      *alloc_lock;
 170         struct closure_waitlist alloc_wait;
 171 };
 172
 173 struct btree_node_iter {
 174         struct btree_node_iter_set {
 175                 u16     k, end;
 176         } data[MAX_BSETS];
 177 };
 178
 179 /*
 180  * Iterate over all possible positions, synthesizing deleted keys for holes:
 181  */
 182 #define BTREE_ITER_SLOTS                (1 << 0)
 183 /*
 184  * Indicates that intent locks should be taken on leaf nodes, because we expect
 185  * to be doing updates:
 186  */
 187 #define BTREE_ITER_INTENT               (1 << 1)
 188 /*
 189  * Causes the btree iterator code to prefetch additional btree nodes from disk:
 190  */
 191 #define BTREE_ITER_PREFETCH             (1 << 2)
 192 /*
 193  * Indicates that this iterator should not be reused until transaction commit,
 194  * either because a pending update references it or because the update depends
 195  * on that particular key being locked (e.g. by the str_hash code, for hash
 196  * table consistency)
 197  */
 198 #define BTREE_ITER_KEEP_UNTIL_COMMIT    (1 << 3)
 199 /*
 200  * Used in bch2_btree_iter_traverse(), to indicate whether we're searching for
 201  * @pos or the first key strictly greater than @pos
 202  */
 203 #define BTREE_ITER_IS_EXTENTS           (1 << 4)
 204 #define BTREE_ITER_NOT_EXTENTS          (1 << 5)
 205 #define BTREE_ITER_ERROR                (1 << 6)
 206 #define BTREE_ITER_CACHED               (1 << 7)
 207 #define BTREE_ITER_CACHED_NOFILL        (1 << 8)
 208 #define BTREE_ITER_CACHED_NOCREATE      (1 << 9)
 209 #define BTREE_ITER_WITH_UPDATES         (1 << 10)
 210 #define __BTREE_ITER_ALL_SNAPSHOTS      (1 << 11)
 211 #define BTREE_ITER_ALL_SNAPSHOTS        (1 << 12)
 212 #define BTREE_ITER_FILTER_SNAPSHOTS     (1 << 13)
 213 #define BTREE_ITER_NOPRESERVE           (1 << 14)
 214
 215 enum btree_path_uptodate {
 216         BTREE_ITER_UPTODATE             = 0,
 217         BTREE_ITER_NEED_RELOCK          = 1,
 218         BTREE_ITER_NEED_TRAVERSE        = 2,
 219 };
 220
 221 #define BTREE_ITER_NO_NODE_GET_LOCKS    ((struct btree *) 1)
 222 #define BTREE_ITER_NO_NODE_DROP         ((struct btree *) 2)
 223 #define BTREE_ITER_NO_NODE_LOCK_ROOT    ((struct btree *) 3)
 224 #define BTREE_ITER_NO_NODE_UP           ((struct btree *) 4)
 225 #define BTREE_ITER_NO_NODE_DOWN         ((struct btree *) 5)
 226 #define BTREE_ITER_NO_NODE_INIT         ((struct btree *) 6)
 227 #define BTREE_ITER_NO_NODE_ERROR        ((struct btree *) 7)
 228 #define BTREE_ITER_NO_NODE_CACHED       ((struct btree *) 8)
 229
 230 struct btree_path {
 231         u8                      idx;
 232         u8                      sorted_idx;
 233         u8                      ref;
 234         u8                      intent_ref;
 235
 236         /* btree_iter_copy starts here: */
 237         struct bpos             pos;
 238
 239         enum btree_id           btree_id:4;
 240         bool                    cached:1;
 241         bool                    preserve:1;
 242         enum btree_path_uptodate uptodate:2;
 243         /*
 244          * When true, failing to relock this path will cause the transaction to
 245          * restart:
 246          */
 247         bool                    should_be_locked:1;
 248         unsigned                level:3,
 249                                 locks_want:4,
 250                                 nodes_locked:4,
 251                                 nodes_intent_locked:4;
 252
 253         struct btree_path_level {
 254                 struct btree    *b;
 255                 struct btree_node_iter iter;
 256                 u32             lock_seq;
 257         }                       l[BTREE_MAX_DEPTH];
 258 #ifdef CONFIG_BCACHEFS_DEBUG
 259         unsigned long           ip_allocated;
 260 #endif
 261 };
 262
 263 static inline struct btree_path_level *path_l(struct btree_path *path)
 264 {
 265         return path->l + path->level;
 266 }
 267
 268 /*
 269  * @pos                 - iterator's current position
 270  * @level               - current btree depth
 271  * @locks_want          - btree level below which we start taking intent locks
 272  * @nodes_locked        - bitmask indicating which nodes in @nodes are locked
 273  * @nodes_intent_locked - bitmask indicating which locks are intent locks
 274  */
 275 struct btree_iter {
 276         struct btree_trans      *trans;
 277         struct btree_path       *path;
 278
 279         enum btree_id           btree_id:4;
 280         unsigned                min_depth:4;
 281
 282         /* btree_iter_copy starts here: */
 283         u16                     flags;
 284
 285         /* When we're filtering by snapshot, the snapshot ID we're looking for: */
 286         unsigned                snapshot;
 287
 288         struct bpos             pos;
 289         struct bpos             pos_after_commit;
 290         /*
 291          * Current unpacked key - so that bch2_btree_iter_next()/
 292          * bch2_btree_iter_next_slot() can correctly advance pos.
 293          */
 294         struct bkey             k;
 295 #ifdef CONFIG_BCACHEFS_DEBUG
 296         unsigned long           ip_allocated;
 297 #endif
 298 };
 299
 300 struct btree_key_cache {
 301         struct mutex            lock;
 302         struct rhashtable       table;
 303         bool                    table_init_done;
 304         struct list_head        freed;
 305         struct shrinker         shrink;
 306         unsigned                shrink_iter;
 307
 308         size_t                  nr_freed;
 309         atomic_long_t           nr_keys;
 310         atomic_long_t           nr_dirty;
 311 };
 312
 313 struct bkey_cached_key {
 314         u32                     btree_id;
 315         struct bpos             pos;
 316 } __attribute__((packed, aligned(4)));
 317
 318 #define BKEY_CACHED_ACCESSED            0
 319 #define BKEY_CACHED_DIRTY               1
 320
 321 struct bkey_cached {
 322         struct btree_bkey_cached_common c;
 323
 324         unsigned long           flags;
 325         u8                      u64s;
 326         bool                    valid;
 327         u32                     btree_trans_barrier_seq;
 328         struct bkey_cached_key  key;
 329
 330         struct rhash_head       hash;
 331         struct list_head        list;
 332
 333         struct journal_preres   res;
 334         struct journal_entry_pin journal;
 335
 336         struct bkey_i           *k;
 337 };
 338
 339 struct btree_insert_entry {
 340         unsigned                flags;
 341         u8                      bkey_type;
 342         enum btree_id           btree_id:8;
 343         u8                      level;
 344         bool                    cached:1;
 345         bool                    insert_trigger_run:1;
 346         bool                    overwrite_trigger_run:1;
 347         struct bkey_i           *k;
 348         struct btree_path       *path;
 349         unsigned long           ip_allocated;
 350 };
 351
 352 #ifndef CONFIG_LOCKDEP
 353 #define BTREE_ITER_MAX          64
 354 #else
 355 #define BTREE_ITER_MAX          32
 356 #endif
 357
 358 struct btree_trans_commit_hook;
 359 typedef int (btree_trans_commit_hook_fn)(struct btree_trans *, struct btree_trans_commit_hook *);
 360
 361 struct btree_trans_commit_hook {
 362         btree_trans_commit_hook_fn      *fn;
 363         struct btree_trans_commit_hook  *next;
 364 };
 365
 366 #define BTREE_TRANS_MEM_MAX     (1U << 14)
 367
 368 struct btree_trans {
 369         struct bch_fs           *c;
 370         struct list_head        list;
 371         struct btree            *locking;
 372         unsigned                locking_path_idx;
 373         struct bpos             locking_pos;
 374         u8                      locking_btree_id;
 375         u8                      locking_level;
 376         pid_t                   pid;
 377         unsigned long           ip;
 378         int                     srcu_idx;
 379
 380         u8                      nr_sorted;
 381         u8                      nr_updates;
 382         bool                    used_mempool:1;
 383         bool                    in_traverse_all:1;
 384         bool                    restarted:1;
 385         /*
 386          * For when bch2_trans_update notices we'll be splitting a compressed
 387          * extent:
 388          */
 389         unsigned                extra_journal_res;
 390
 391         u64                     paths_allocated;
 392
 393         unsigned                mem_top;
 394         unsigned                mem_bytes;
 395         void                    *mem;
 396
 397         u8                      sorted[BTREE_ITER_MAX];
 398         struct btree_path       *paths;
 399         struct btree_insert_entry *updates;
 400
 401         /* update path: */
 402         struct btree_trans_commit_hook *hooks;
 403         struct jset_entry       *extra_journal_entries;
 404         unsigned                extra_journal_entry_u64s;
 405         struct journal_entry_pin *journal_pin;
 406
 407         struct journal_res      journal_res;
 408         struct journal_preres   journal_preres;
 409         u64                     *journal_seq;
 410         struct disk_reservation *disk_res;
 411         unsigned                flags;
 412         unsigned                journal_u64s;
 413         unsigned                journal_preres_u64s;
 414         struct replicas_delta_list *fs_usage_deltas;
 415 };
 416
 417 #define BTREE_FLAG(flag)                                                \
 418 static inline bool btree_node_ ## flag(struct btree *b)                 \
 419 {       return test_bit(BTREE_NODE_ ## flag, &b->flags); }              \
 420                                                                         \
 421 static inline void set_btree_node_ ## flag(struct btree *b)             \
 422 {       set_bit(BTREE_NODE_ ## flag, &b->flags); }                      \
 423                                                                         \
 424 static inline void clear_btree_node_ ## flag(struct btree *b)           \
 425 {       clear_bit(BTREE_NODE_ ## flag, &b->flags); }
 426
 427 enum btree_flags {
 428         BTREE_NODE_read_in_flight,
 429         BTREE_NODE_read_error,
 430         BTREE_NODE_dirty,
 431         BTREE_NODE_need_write,
 432         BTREE_NODE_noevict,
 433         BTREE_NODE_write_idx,
 434         BTREE_NODE_accessed,
 435         BTREE_NODE_write_in_flight,
 436         BTREE_NODE_write_in_flight_inner,
 437         BTREE_NODE_just_written,
 438         BTREE_NODE_dying,
 439         BTREE_NODE_fake,
 440         BTREE_NODE_need_rewrite,
 441         BTREE_NODE_never_write,
 442 };
 443
 444 BTREE_FLAG(read_in_flight);
 445 BTREE_FLAG(read_error);
 446 BTREE_FLAG(need_write);
 447 BTREE_FLAG(noevict);
 448 BTREE_FLAG(write_idx);
 449 BTREE_FLAG(accessed);
 450 BTREE_FLAG(write_in_flight);
 451 BTREE_FLAG(write_in_flight_inner);
 452 BTREE_FLAG(just_written);
 453 BTREE_FLAG(dying);
 454 BTREE_FLAG(fake);
 455 BTREE_FLAG(need_rewrite);
 456 BTREE_FLAG(never_write);
 457
 458 static inline struct btree_write *btree_current_write(struct btree *b)
 459 {
 460         return b->writes + btree_node_write_idx(b);
 461 }
 462
 463 static inline struct btree_write *btree_prev_write(struct btree *b)
 464 {
 465         return b->writes + (btree_node_write_idx(b) ^ 1);
 466 }
 467
 468 static inline struct bset_tree *bset_tree_last(struct btree *b)
 469 {
 470         EBUG_ON(!b->nsets);
 471         return b->set + b->nsets - 1;
 472 }
 473
 474 static inline void *
 475 __btree_node_offset_to_ptr(const struct btree *b, u16 offset)
 476 {
 477         return (void *) ((u64 *) b->data + 1 + offset);
 478 }
 479
 480 static inline u16
 481 __btree_node_ptr_to_offset(const struct btree *b, const void *p)
 482 {
 483         u16 ret = (u64 *) p - 1 - (u64 *) b->data;
 484
 485         EBUG_ON(__btree_node_offset_to_ptr(b, ret) != p);
 486         return ret;
 487 }
 488
 489 static inline struct bset *bset(const struct btree *b,
 490                                 const struct bset_tree *t)
 491 {
 492         return __btree_node_offset_to_ptr(b, t->data_offset);
 493 }
 494
 495 static inline void set_btree_bset_end(struct btree *b, struct bset_tree *t)
 496 {
 497         t->end_offset =
 498                 __btree_node_ptr_to_offset(b, vstruct_last(bset(b, t)));
 499 }
 500
 501 static inline void set_btree_bset(struct btree *b, struct bset_tree *t,
 502                                   const struct bset *i)
 503 {
 504         t->data_offset = __btree_node_ptr_to_offset(b, i);
 505         set_btree_bset_end(b, t);
 506 }
 507
 508 static inline struct bset *btree_bset_first(struct btree *b)
 509 {
 510         return bset(b, b->set);
 511 }
 512
 513 static inline struct bset *btree_bset_last(struct btree *b)
 514 {
 515         return bset(b, bset_tree_last(b));
 516 }
 517
 518 static inline u16
 519 __btree_node_key_to_offset(const struct btree *b, const struct bkey_packed *k)
 520 {
 521         return __btree_node_ptr_to_offset(b, k);
 522 }
 523
 524 static inline struct bkey_packed *
 525 __btree_node_offset_to_key(const struct btree *b, u16 k)
 526 {
 527         return __btree_node_offset_to_ptr(b, k);
 528 }
 529
 530 static inline unsigned btree_bkey_first_offset(const struct bset_tree *t)
 531 {
 532         return t->data_offset + offsetof(struct bset, _data) / sizeof(u64);
 533 }
 534
 535 #define btree_bkey_first(_b, _t)                                        \
 536 ({                                                                      \
 537         EBUG_ON(bset(_b, _t)->start !=                                  \
 538                 __btree_node_offset_to_key(_b, btree_bkey_first_offset(_t)));\
 539                                                                         \
 540         bset(_b, _t)->start;                                            \
 541 })
 542
 543 #define btree_bkey_last(_b, _t)                                         \
 544 ({                                                                      \
 545         EBUG_ON(__btree_node_offset_to_key(_b, (_t)->end_offset) !=     \
 546                 vstruct_last(bset(_b, _t)));                            \
 547                                                                         \
 548         __btree_node_offset_to_key(_b, (_t)->end_offset);               \
 549 })
 550
 551 static inline unsigned bset_u64s(struct bset_tree *t)
 552 {
 553         return t->end_offset - t->data_offset -
 554                 sizeof(struct bset) / sizeof(u64);
 555 }
 556
 557 static inline unsigned bset_dead_u64s(struct btree *b, struct bset_tree *t)
 558 {
 559         return bset_u64s(t) - b->nr.bset_u64s[t - b->set];
 560 }
 561
 562 static inline unsigned bset_byte_offset(struct btree *b, void *i)
 563 {
 564         return i - (void *) b->data;
 565 }
 566
 567 enum btree_node_type {
 568 #define x(kwd, val) BKEY_TYPE_##kwd = val,
 569         BCH_BTREE_IDS()
 570 #undef x
 571         BKEY_TYPE_btree,
 572 };
 573
 574 /* Type of a key in btree @id at level @level: */
 575 static inline enum btree_node_type __btree_node_type(unsigned level, enum btree_id id)
 576 {
 577         return level ? BKEY_TYPE_btree : (enum btree_node_type) id;
 578 }
 579
 580 /* Type of keys @b contains: */
 581 static inline enum btree_node_type btree_node_type(struct btree *b)
 582 {
 583         return __btree_node_type(b->c.level, b->c.btree_id);
 584 }
 585
 586 static inline bool btree_node_type_is_extents(enum btree_node_type type)
 587 {
 588         switch (type) {
 589         case BKEY_TYPE_extents:
 590         case BKEY_TYPE_reflink:
 591                 return true;
 592         default:
 593                 return false;
 594         }
 595 }
 596
 597 static inline bool btree_node_is_extents(struct btree *b)
 598 {
 599         return btree_node_type_is_extents(btree_node_type(b));
 600 }
 601
 602 #define BTREE_NODE_TYPE_HAS_TRANS_TRIGGERS              \
 603         ((1U << BKEY_TYPE_extents)|                     \
 604          (1U << BKEY_TYPE_inodes)|                      \
 605          (1U << BKEY_TYPE_stripes)|                     \
 606          (1U << BKEY_TYPE_reflink)|                     \
 607          (1U << BKEY_TYPE_btree))
 608
 609 #define BTREE_NODE_TYPE_HAS_MEM_TRIGGERS                \
 610         ((1U << BKEY_TYPE_alloc)|                       \
 611          (1U << BKEY_TYPE_inodes)|                      \
 612          (1U << BKEY_TYPE_stripes)|                     \
 613          (1U << BKEY_TYPE_snapshots))
 614
 615 #define BTREE_NODE_TYPE_HAS_TRIGGERS                    \
 616         (BTREE_NODE_TYPE_HAS_TRANS_TRIGGERS|            \
 617          BTREE_NODE_TYPE_HAS_MEM_TRIGGERS)
 618
 619 #define BTREE_ID_HAS_SNAPSHOTS                          \
 620         ((1U << BTREE_ID_extents)|                      \
 621          (1U << BTREE_ID_inodes)|                       \
 622          (1U << BTREE_ID_dirents)|                      \
 623          (1U << BTREE_ID_xattrs))
 624
 625 #define BTREE_ID_HAS_PTRS                               \
 626         ((1U << BTREE_ID_extents)|                      \
 627          (1U << BTREE_ID_reflink))
 628
 629 static inline bool btree_type_has_snapshots(enum btree_id id)
 630 {
 631         return (1 << id) & BTREE_ID_HAS_SNAPSHOTS;
 632 }
 633
 634 enum btree_update_flags {
 635         __BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE,
 636
 637         __BTREE_TRIGGER_NORUN,          /* Don't run triggers at all */
 638
 639         __BTREE_TRIGGER_INSERT,
 640         __BTREE_TRIGGER_OVERWRITE,
 641
 642         __BTREE_TRIGGER_GC,
 643         __BTREE_TRIGGER_BUCKET_INVALIDATE,
 644         __BTREE_TRIGGER_NOATOMIC,
 645 };
 646
 647 #define BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE (1U << __BTREE_UPDATE_INTERNAL_SNAPSHOT_NODE)
 648
 649 #define BTREE_TRIGGER_NORUN             (1U << __BTREE_TRIGGER_NORUN)
 650
 651 #define BTREE_TRIGGER_INSERT            (1U << __BTREE_TRIGGER_INSERT)
 652 #define BTREE_TRIGGER_OVERWRITE         (1U << __BTREE_TRIGGER_OVERWRITE)
 653
 654 #define BTREE_TRIGGER_GC                (1U << __BTREE_TRIGGER_GC)
 655 #define BTREE_TRIGGER_BUCKET_INVALIDATE (1U << __BTREE_TRIGGER_BUCKET_INVALIDATE)
 656 #define BTREE_TRIGGER_NOATOMIC          (1U << __BTREE_TRIGGER_NOATOMIC)
 657
 658 #define BTREE_TRIGGER_WANTS_OLD_AND_NEW         \
 659         ((1U << KEY_TYPE_alloc)|                \
 660          (1U << KEY_TYPE_alloc_v2)|             \
 661          (1U << KEY_TYPE_alloc_v3)|             \
 662          (1U << KEY_TYPE_stripe)|               \
 663          (1U << KEY_TYPE_inode)|                \
 664          (1U << KEY_TYPE_inode_v2)|             \
 665          (1U << KEY_TYPE_snapshot))
 666
 667 static inline bool btree_node_type_needs_gc(enum btree_node_type type)
 668 {
 669         return BTREE_NODE_TYPE_HAS_TRIGGERS & (1U << type);
 670 }
 671
 672 struct btree_root {
 673         struct btree            *b;
 674
 675         /* On disk root - see async splits: */
 676         __BKEY_PADDED(key, BKEY_BTREE_PTR_VAL_U64s_MAX);
 677         u8                      level;
 678         u8                      alive;
 679         s8                      error;
 680 };
 681
 682 enum btree_insert_ret {
 683         BTREE_INSERT_OK,
 684         /* leaf node needs to be split */
 685         BTREE_INSERT_BTREE_NODE_FULL,
 686         BTREE_INSERT_NEED_MARK_REPLICAS,
 687         BTREE_INSERT_NEED_JOURNAL_RES,
 688         BTREE_INSERT_NEED_JOURNAL_RECLAIM,
 689 };
 690
 691 enum btree_gc_coalesce_fail_reason {
 692         BTREE_GC_COALESCE_FAIL_RESERVE_GET,
 693         BTREE_GC_COALESCE_FAIL_KEYLIST_REALLOC,
 694         BTREE_GC_COALESCE_FAIL_FORMAT_FITS,
 695 };
 696
 697 enum btree_node_sibling {
 698         btree_prev_sib,
 699         btree_next_sib,
 700 };
 701
 702 #endif /* _BCACHEFS_BTREE_TYPES_H */