37 struct backref_node {  struct
83 	struct backref_node *node[2];  argument
94 	struct backref_node *path[BTRFS_MAX_LEVEL];
190 				struct backref_node *node);
192 				   struct backref_node *node);
213 	struct backref_node *node;  in backref_cache_cleanup()
218 				  struct backref_node, list);  in backref_cache_cleanup()
224 				  struct backref_node, lower);  in backref_cache_cleanup()
239 static struct backref_node *alloc_backref_node(struct backref_cache *cache)  in alloc_backref_node()
241 	struct backref_node *node;  in alloc_backref_node()
255 			      struct backref_node *node)  in free_backref_node()
328 	struct backref_node *bnode = rb_entry(rb_node, struct backref_node,  in backref_tree_panic()
340 static struct backref_node *walk_up_backref(struct backref_node *node,  in walk_up_backref()
361 static struct backref_node *walk_down_backref(struct backref_edge *edges[],  in walk_down_backref()
365 	struct backref_node *lower;  in walk_down_backref()
385 static void unlock_node_buffer(struct backref_node *node)  in unlock_node_buffer()
393 static void drop_node_buffer(struct backref_node *node)  in drop_node_buffer()
403 			      struct backref_node *node)  in drop_backref_node()
419 				struct backref_node *node)  in remove_backref_node()
421 	struct backref_node *upper;  in remove_backref_node()
457 				struct backref_node *node, u64 bytenr)  in update_backref_node()
473 	struct backref_node *node;  in update_backref_cache()
491 				  struct backref_node, list);  in update_backref_cache()
497 				  struct backref_node, list);  in update_backref_cache()
650 struct backref_node *build_backref_tree(struct reloc_control *rc,  in build_backref_tree()
659 	struct backref_node *cur;  in build_backref_tree()
660 	struct backref_node *upper;  in build_backref_tree()
661 	struct backref_node *lower;  in build_backref_tree()
662 	struct backref_node *node = NULL;  in build_backref_tree()
663 	struct backref_node *exist = NULL;  in build_backref_tree()
832 				upper = rb_entry(rb_node, struct backref_node,  in build_backref_tree()
966 				upper = rb_entry(rb_node, struct backref_node,  in build_backref_tree()
1083 		upper = list_entry(useless.next, struct backref_node, list);  in build_backref_tree()
1118 					   struct backref_node, list);  in build_backref_tree()
1150 					   struct backref_node, list);  in build_backref_tree()
1176 	struct backref_node *node = NULL;  in clone_backref_node()
1177 	struct backref_node *new_node;  in clone_backref_node()
1187 		node = rb_entry(rb_node, struct backref_node, rb_node);  in clone_backref_node()
1198 			node = rb_entry(rb_node, struct backref_node,  in clone_backref_node()
2557 				     struct backref_node *node,  in select_reloc_root()
2560 	struct backref_node *next;  in select_reloc_root()
2618 struct btrfs_root *select_one_root(struct backref_node *node)  in select_one_root()
2620 	struct backref_node *next;  in select_one_root()
2655 			struct backref_node *node, int reserve)  in calcu_metadata_size()
2658 	struct backref_node *next = node;  in calcu_metadata_size()
2689 				  struct backref_node *node)  in reserve_metadata_space()
2737 			 struct backref_node *node,  in do_relocation()
2742 	struct backref_node *upper;  in do_relocation()
2900 			 struct backref_node *node,  in link_to_upper()
2915 	struct backref_node *node;  in finish_pending_nodes()
2922 					  struct backref_node, list);  in finish_pending_nodes()
2945 				   struct backref_node *node)  in __mark_block_processed()
2961 				    struct backref_node *node)  in update_processed_blocks()
2963 	struct backref_node *next = node;  in update_processed_blocks()
3026 				struct backref_node *node,  in relocate_tree_block()
3084 	struct backref_node *node;  in relocate_tree_blocks()
4660 	struct backref_node *node;  in btrfs_reloc_cow_block()