mirror of
https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git
synced 2024-09-27 12:57:53 +00: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>
30 lines
590 B
C
30 lines
590 B
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
#ifndef _BCACHEFS_BTREE_NODE_SCAN_TYPES_H
|
|
#define _BCACHEFS_BTREE_NODE_SCAN_TYPES_H
|
|
|
|
#include "darray.h"
|
|
|
|
struct found_btree_node {
|
|
bool range_updated:1;
|
|
bool overwritten:1;
|
|
u8 btree_id;
|
|
u8 level;
|
|
u32 seq;
|
|
u64 cookie;
|
|
|
|
struct bpos min_key;
|
|
struct bpos max_key;
|
|
|
|
unsigned nr_ptrs;
|
|
struct bch_extent_ptr ptrs[BCH_REPLICAS_MAX];
|
|
};
|
|
|
|
typedef DARRAY(struct found_btree_node) found_btree_nodes;
|
|
|
|
struct find_btree_nodes {
|
|
int ret;
|
|
struct mutex lock;
|
|
found_btree_nodes nodes;
|
|
};
|
|
|
|
#endif /* _BCACHEFS_BTREE_NODE_SCAN_TYPES_H */
|