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 int bch2_journal_key_insert_take(struct bch_fs *, enum btree_id,
35 unsigned, struct bkey_i *);
36 int bch2_journal_key_insert(struct bch_fs *, enum btree_id,
37 unsigned, struct bkey_i *);
38 int bch2_journal_key_delete(struct bch_fs *, enum btree_id,
39 unsigned, struct bpos);
40 void bch2_journal_key_overwritten(struct bch_fs *, enum btree_id,
41 unsigned, struct bpos);
43 void bch2_btree_and_journal_iter_advance(struct btree_and_journal_iter *);
44 struct bkey_s_c bch2_btree_and_journal_iter_peek(struct btree_and_journal_iter *);
45 struct bkey_s_c bch2_btree_and_journal_iter_next(struct btree_and_journal_iter *);
47 void bch2_btree_and_journal_iter_exit(struct btree_and_journal_iter *);
48 void bch2_btree_and_journal_iter_init_node_iter(struct btree_and_journal_iter *,
52 typedef int (*btree_walk_key_fn)(struct btree_trans *, struct bkey_s_c);
54 int bch2_btree_and_journal_walk(struct btree_trans *, enum btree_id, btree_walk_key_fn);
56 void bch2_journal_keys_free(struct journal_keys *);
57 void bch2_journal_entries_free(struct list_head *);
59 int bch2_fs_recovery(struct bch_fs *);
60 int bch2_fs_initialize(struct bch_fs *);
62 #endif /* _BCACHEFS_RECOVERY_H */