1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _BCACHEFS_RECOVERY_H
3 #define _BCACHEFS_RECOVERY_H
5 #define for_each_journal_key(keys, i) \
6 for (i = (keys).d; i < (keys).d + (keys).nr; (i)++)
10 enum btree_id btree_id;
13 struct journal_keys *keys;
17 * Iterate over keys in the btree, with keys from the journal overlaid on top:
20 struct btree_and_journal_iter {
22 struct btree_node_iter node_iter;
25 struct journal_iter journal;
27 enum last_key_returned {
34 size_t bch2_journal_key_search(struct journal_keys *, enum btree_id,
35 unsigned, struct bpos);
36 struct bkey_i *bch2_journal_keys_peek(struct bch_fs *, enum btree_id,
37 unsigned, struct bpos pos);
39 int bch2_journal_key_insert_take(struct bch_fs *, enum btree_id,
40 unsigned, struct bkey_i *);
41 int bch2_journal_key_insert(struct bch_fs *, enum btree_id,
42 unsigned, struct bkey_i *);
43 int bch2_journal_key_delete(struct bch_fs *, enum btree_id,
44 unsigned, struct bpos);
45 void bch2_journal_key_overwritten(struct bch_fs *, enum btree_id,
46 unsigned, struct bpos);
48 void bch2_btree_and_journal_iter_advance(struct btree_and_journal_iter *);
49 struct bkey_s_c bch2_btree_and_journal_iter_peek(struct btree_and_journal_iter *);
50 struct bkey_s_c bch2_btree_and_journal_iter_next(struct btree_and_journal_iter *);
52 void bch2_btree_and_journal_iter_exit(struct btree_and_journal_iter *);
53 void __bch2_btree_and_journal_iter_init_node_iter(struct btree_and_journal_iter *,
54 struct bch_fs *, struct btree *,
55 struct btree_node_iter, struct bpos);
56 void bch2_btree_and_journal_iter_init_node_iter(struct btree_and_journal_iter *,
60 void bch2_journal_keys_free(struct journal_keys *);
61 void bch2_journal_entries_free(struct list_head *);
63 int bch2_fs_recovery(struct bch_fs *);
64 int bch2_fs_initialize(struct bch_fs *);
66 #endif /* _BCACHEFS_RECOVERY_H */