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)++)
9 enum btree_id btree_id;
11 struct journal_keys *keys;
12 struct journal_key *k;
16 * Iterate over keys in the btree, with keys from the journal overlaid on top:
19 struct btree_and_journal_iter {
20 struct btree_iter *btree;
23 struct btree_node_iter node_iter;
26 struct journal_iter journal;
28 enum last_key_returned {
35 void bch2_btree_and_journal_iter_advance(struct btree_and_journal_iter *);
36 struct bkey_s_c bch2_btree_and_journal_iter_peek(struct btree_and_journal_iter *);
37 struct bkey_s_c bch2_btree_and_journal_iter_next(struct btree_and_journal_iter *);
39 void bch2_btree_and_journal_iter_init(struct btree_and_journal_iter *,
41 struct journal_keys *,
42 enum btree_id, struct bpos);
43 void bch2_btree_and_journal_iter_init_node_iter(struct btree_and_journal_iter *,
44 struct journal_keys *,
47 typedef int (*btree_walk_node_fn)(struct bch_fs *c, struct btree *b);
48 typedef int (*btree_walk_key_fn)(struct bch_fs *c, enum btree_id id,
49 unsigned level, struct bkey_s_c k);
51 int bch2_btree_and_journal_walk(struct bch_fs *, struct journal_keys *, enum btree_id,
52 btree_walk_node_fn, btree_walk_key_fn);
54 void bch2_journal_keys_free(struct journal_keys *);
55 void bch2_journal_entries_free(struct list_head *);
57 int bch2_fs_recovery(struct bch_fs *);
58 int bch2_fs_initialize(struct bch_fs *);
60 #endif /* _BCACHEFS_RECOVERY_H */