mirror of
https://mirrors.bfsu.edu.cn/git/linux.git
synced 2024-12-12 21:44:06 +08:00
4409b8081d
If a btree root or interior btree node goes bad, we're going to lose a lot of data, unless we can recover the nodes that it pointed to by scanning. Fortunately btree node headers are fully self describing, and additionally the magic number is xored with the filesytem UUID, so we can do so safely. This implements the scanning - next patch will rework topology repair to make use of the found nodes. Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
12 lines
489 B
C
12 lines
489 B
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
#ifndef _BCACHEFS_BTREE_NODE_SCAN_H
|
|
#define _BCACHEFS_BTREE_NODE_SCAN_H
|
|
|
|
int bch2_scan_for_btree_nodes(struct bch_fs *);
|
|
bool bch2_btree_node_is_stale(struct bch_fs *, struct btree *);
|
|
bool bch2_btree_has_scanned_nodes(struct bch_fs *, enum btree_id);
|
|
int bch2_get_scanned_nodes(struct bch_fs *, enum btree_id, unsigned, struct bpos, struct bpos);
|
|
void bch2_find_btree_nodes_exit(struct find_btree_nodes *);
|
|
|
|
#endif /* _BCACHEFS_BTREE_NODE_SCAN_H */
|