1 /* SPDX-License-Identifier: GPL-2.0 */ 2 #ifndef _BCACHEFS_BTREE_JOURNAL_ITER_H 3 #define _BCACHEFS_BTREE_JOURNAL_ITER_H 4 5 #include "bkey.h" 6 7 struct journal_iter { 8 struct list_head list; 9 enum btree_id btree_id; 10 unsigned level; 11 size_t idx; 12 struct journal_keys *keys; 13 }; 14 15 /* 16 * Iterate over keys in the btree, with keys from the journal overlaid on top: 17 */ 18 19 struct btree_and_journal_iter { 20 struct btree_trans *trans; 21 struct btree *b; 22 struct btree_node_iter node_iter; 23 struct bkey unpacked; 24 25 struct journal_iter journal; 26 struct bpos pos; 27 bool at_end; 28 bool prefetch; 29 bool fail_if_too_many_whiteouts; 30 }; 31 32 static inline int __journal_key_btree_cmp(enum btree_id l_btree_id, 33 unsigned l_level, 34 const struct journal_key *r) 35 { 36 return -cmp_int(l_level, r->level) ?: 37 cmp_int(l_btree_id, r->btree_id); 38 } 39 40 static inline int __journal_key_cmp(enum btree_id l_btree_id, 41 unsigned l_level, 42 struct bpos l_pos, 43 const struct journal_key *r) 44 { 45 return __journal_key_btree_cmp(l_btree_id, l_level, r) ?: 46 bpos_cmp(l_pos, r->k->k.p); 47 } 48 49 static inline int journal_key_cmp(const struct journal_key *l, const struct journal_key *r) 50 { 51 return __journal_key_cmp(l->btree_id, l->level, l->k->k.p, r); 52 } 53 54 struct bkey_i *bch2_journal_keys_peek_max(struct bch_fs *, enum btree_id, 55 unsigned, struct bpos, struct bpos, size_t *); 56 struct bkey_i *bch2_journal_keys_peek_prev_min(struct bch_fs *, enum btree_id, 57 unsigned, struct bpos, struct bpos, size_t *); 58 struct bkey_i *bch2_journal_keys_peek_slot(struct bch_fs *, enum btree_id, 59 unsigned, struct bpos); 60 61 int bch2_btree_and_journal_iter_prefetch(struct btree_trans *, struct btree_path *, 62 struct btree_and_journal_iter *); 63 64 int bch2_journal_key_insert_take(struct bch_fs *, enum btree_id, 65 unsigned, struct bkey_i *); 66 int bch2_journal_key_insert(struct bch_fs *, enum btree_id, 67 unsigned, struct bkey_i *); 68 int bch2_journal_key_delete(struct bch_fs *, enum btree_id, 69 unsigned, struct bpos); 70 bool bch2_key_deleted_in_journal(struct btree_trans *, enum btree_id, unsigned, struct bpos); 71 void bch2_journal_key_overwritten(struct bch_fs *, enum btree_id, unsigned, struct bpos); 72 73 void bch2_btree_and_journal_iter_advance(struct btree_and_journal_iter *); 74 struct bkey_s_c bch2_btree_and_journal_iter_peek(struct btree_and_journal_iter *); 75 76 void bch2_btree_and_journal_iter_exit(struct btree_and_journal_iter *); 77 void __bch2_btree_and_journal_iter_init_node_iter(struct btree_trans *, 78 struct btree_and_journal_iter *, struct btree *, 79 struct btree_node_iter, struct bpos); 80 void bch2_btree_and_journal_iter_init_node_iter(struct btree_trans *, 81 struct btree_and_journal_iter *, struct btree *); 82 83 void bch2_journal_keys_put(struct bch_fs *); 84 85 static inline void bch2_journal_keys_put_initial(struct bch_fs *c) 86 { 87 if (c->journal_keys.initial_ref_held) 88 bch2_journal_keys_put(c); 89 c->journal_keys.initial_ref_held = false; 90 } 91 92 int bch2_journal_keys_sort(struct bch_fs *); 93 94 void bch2_shoot_down_journal_keys(struct bch_fs *, enum btree_id, 95 unsigned, unsigned, 96 struct bpos, struct bpos); 97 98 void bch2_journal_keys_dump(struct bch_fs *); 99 100 void bch2_fs_journal_keys_init(struct bch_fs *); 101 102 #endif /* _BCACHEFS_BTREE_JOURNAL_ITER_H */ 103