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
11struct extent_buffer;
12struct btrfs_chunk;
 
13
14/* All the extra info needed to verify the parentness of a tree block. */
15struct 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 */
48int 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 */
54int btrfs_check_leaf_relaxed(struct extent_buffer *leaf);
 
 
 
55int btrfs_check_node(struct extent_buffer *node);
56
57int btrfs_check_chunk_valid(struct extent_buffer *leaf,
58			    struct btrfs_chunk *chunk, u64 logical);
59int btrfs_check_eb_owner(const struct extent_buffer *eb, u64 root_owner);
 
 
60
61#endif

 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 <linux/types.h>
10#include <uapi/linux/btrfs_tree.h>
11
12struct extent_buffer;
13struct btrfs_chunk;
14struct btrfs_key;
15
16/* All the extra info needed to verify the parentness of a tree block. */
17struct btrfs_tree_parent_check {
18	/*
19	 * The owner check against the tree block.
20	 *
21	 * Can be 0 to skip the owner check.
22	 */
23	u64 owner_root;
24
25	/*
26	 * Expected transid, can be 0 to skip the check, but such skip
27	 * should only be utilized for backref walk related code.
28	 */
29	u64 transid;
30
31	/*
32	 * The expected first key.
33	 *
34	 * This check can be skipped if @has_first_key is false, such skip
35	 * can happen for case where we don't have the parent node key,
36	 * e.g. reading the tree root, doing backref walk.
37	 */
38	struct btrfs_key first_key;
39	bool has_first_key;
40
41	/* The expected level. Should always be set. */
42	u8 level;
43};
44
45enum btrfs_tree_block_status {
46	BTRFS_TREE_BLOCK_CLEAN,
47	BTRFS_TREE_BLOCK_INVALID_NRITEMS,
48	BTRFS_TREE_BLOCK_INVALID_PARENT_KEY,
49	BTRFS_TREE_BLOCK_BAD_KEY_ORDER,
50	BTRFS_TREE_BLOCK_INVALID_LEVEL,
51	BTRFS_TREE_BLOCK_INVALID_FREE_SPACE,
52	BTRFS_TREE_BLOCK_INVALID_OFFSETS,
53	BTRFS_TREE_BLOCK_INVALID_BLOCKPTR,
54	BTRFS_TREE_BLOCK_INVALID_ITEM,
55	BTRFS_TREE_BLOCK_INVALID_OWNER,
56	BTRFS_TREE_BLOCK_WRITTEN_NOT_SET,
57};
58
59/*
60 * Exported simply for btrfs-progs which wants to have the
61 * btrfs_tree_block_status return codes.
62 */
63enum btrfs_tree_block_status __btrfs_check_leaf(struct extent_buffer *leaf);
64enum btrfs_tree_block_status __btrfs_check_node(struct extent_buffer *node);
65
66int btrfs_check_leaf(struct extent_buffer *leaf);
67int btrfs_check_node(struct extent_buffer *node);
68
69int btrfs_check_chunk_valid(struct extent_buffer *leaf,
70			    struct btrfs_chunk *chunk, u64 logical);
71int btrfs_check_eb_owner(const struct extent_buffer *eb, u64 root_owner);
72int btrfs_verify_level_key(struct extent_buffer *eb, int level,
73			   struct btrfs_key *first_key, u64 parent_transid);
74
75#endif