Home
last modified time | relevance | path

Searched refs:block_entry (Results 1 - 2 of 2) sorted by relevance

/kernel/linux/linux-6.6/fs/btrfs/
H A Dref-verify.c66 struct block_entry { struct
78 static struct block_entry *insert_block_entry(struct rb_root *root, in insert_block_entry()
79 struct block_entry *be) in insert_block_entry()
83 struct block_entry *entry; in insert_block_entry()
87 entry = rb_entry(parent_node, struct block_entry, node); in insert_block_entry()
101 static struct block_entry *lookup_block_entry(struct rb_root *root, u64 bytenr) in lookup_block_entry()
104 struct block_entry *entry = NULL; in lookup_block_entry()
108 entry = rb_entry(n, struct block_entry, node); in lookup_block_entry()
235 static void free_block_entry(struct block_entry *be) in free_block_entry()
263 static struct block_entry *add_block_entr
[all...]
/kernel/linux/linux-5.10/fs/btrfs/
H A Dref-verify.c63 struct block_entry { struct
75 static struct block_entry *insert_block_entry(struct rb_root *root, in insert_block_entry()
76 struct block_entry *be) in insert_block_entry()
80 struct block_entry *entry; in insert_block_entry()
84 entry = rb_entry(parent_node, struct block_entry, node); in insert_block_entry()
98 static struct block_entry *lookup_block_entry(struct rb_root *root, u64 bytenr) in lookup_block_entry()
101 struct block_entry *entry = NULL; in lookup_block_entry()
105 entry = rb_entry(n, struct block_entry, node); in lookup_block_entry()
232 static void free_block_entry(struct block_entry *be) in free_block_entry()
260 static struct block_entry *add_block_entr
[all...]

Completed in 2 milliseconds