xref: /linux/fs/btrfs/tree-checker.h (revision 7effbd18e496a954540fb6319db0d87d28a70496)
1 /* SPDX-License-Identifier: GPL-2.0 */
2 /*
3  * Copyright (C) Qu Wenruo 2017.  All rights reserved.
4  */
5 
6 #ifndef BTRFS_TREE_CHECKER_H
7 #define BTRFS_TREE_CHECKER_H
8 
9 #include <uapi/linux/btrfs_tree.h>
10 
11 struct extent_buffer;
12 struct btrfs_chunk;
13 
14 /* All the extra info needed to verify the parentness of a tree block. */
15 struct btrfs_tree_parent_check {
16 	/*
17 	 * The owner check against the tree block.
18 	 *
19 	 * Can be 0 to skip the owner check.
20 	 */
21 	u64 owner_root;
22 
23 	/*
24 	 * Expected transid, can be 0 to skip the check, but such skip
25 	 * should only be utlized for backref walk related code.
26 	 */
27 	u64 transid;
28 
29 	/*
30 	 * The expected first key.
31 	 *
32 	 * This check can be skipped if @has_first_key is false, such skip
33 	 * can happen for case where we don't have the parent node key,
34 	 * e.g. reading the tree root, doing backref walk.
35 	 */
36 	struct btrfs_key first_key;
37 	bool has_first_key;
38 
39 	/* The expected level. Should always be set. */
40 	u8 level;
41 };
42 
43 /*
44  * Comprehensive leaf checker.
45  * Will check not only the item pointers, but also every possible member
46  * in item data.
47  */
48 int btrfs_check_leaf_full(struct extent_buffer *leaf);
49 
50 /*
51  * Less strict leaf checker.
52  * Will only check item pointers, not reading item data.
53  */
54 int btrfs_check_leaf_relaxed(struct extent_buffer *leaf);
55 int btrfs_check_node(struct extent_buffer *node);
56 
57 int btrfs_check_chunk_valid(struct extent_buffer *leaf,
58 			    struct btrfs_chunk *chunk, u64 logical);
59 int btrfs_check_eb_owner(const struct extent_buffer *eb, u64 root_owner);
60 
61 #endif
62