35 struct backref_node {  struct
81 	struct backref_node *node[2];  argument
92 	struct backref_node *path[BTRFS_MAX_LEVEL];
186 				struct backref_node *node);
188 				   struct backref_node *node);
209 	struct backref_node *node;  in backref_cache_cleanup()
214 				  struct backref_node, list);  in backref_cache_cleanup()
220 				  struct backref_node, lower);  in backref_cache_cleanup()
235 static struct backref_node *alloc_backref_node(struct backref_cache *cache)  in alloc_backref_node()
237 	struct backref_node *node;  in alloc_backref_node()
251 			      struct backref_node *node)  in free_backref_node()
324 	struct backref_node *bnode = rb_entry(rb_node, struct backref_node,  in backref_tree_panic()
336 static struct backref_node *walk_up_backref(struct backref_node *node,  in walk_up_backref()
357 static struct backref_node *walk_down_backref(struct backref_edge *edges[],  in walk_down_backref()
361 	struct backref_node *lower;  in walk_down_backref()
381 static void unlock_node_buffer(struct backref_node *node)  in unlock_node_buffer()
389 static void drop_node_buffer(struct backref_node *node)  in drop_node_buffer()
399 			      struct backref_node *node)  in drop_backref_node()
415 				struct backref_node *node)  in remove_backref_node()
417 	struct backref_node *upper;  in remove_backref_node()
453 				struct backref_node *node, u64 bytenr)  in update_backref_node()
469 	struct backref_node *node;  in update_backref_cache()
487 				  struct backref_node, list);  in update_backref_cache()
493 				  struct backref_node, list);  in update_backref_cache()
646 struct backref_node *build_backref_tree(struct reloc_control *rc,  in build_backref_tree()
655 	struct backref_node *cur;  in build_backref_tree()
656 	struct backref_node *upper;  in build_backref_tree()
657 	struct backref_node *lower;  in build_backref_tree()
658 	struct backref_node *node = NULL;  in build_backref_tree()
659 	struct backref_node *exist = NULL;  in build_backref_tree()
823 				upper = rb_entry(rb_node, struct backref_node,  in build_backref_tree()
953 				upper = rb_entry(rb_node, struct backref_node,  in build_backref_tree()
1070 		upper = list_entry(useless.next, struct backref_node, list);  in build_backref_tree()
1105 					   struct backref_node, list);  in build_backref_tree()
1137 					   struct backref_node, list);  in build_backref_tree()
1163 	struct backref_node *node = NULL;  in clone_backref_node()
1164 	struct backref_node *new_node;  in clone_backref_node()
1174 		node = rb_entry(rb_node, struct backref_node, rb_node);  in clone_backref_node()
1185 			node = rb_entry(rb_node, struct backref_node,  in clone_backref_node()
2470 				     struct backref_node *node,  in select_reloc_root()
2473 	struct backref_node *next;  in select_reloc_root()
2531 struct btrfs_root *select_one_root(struct backref_node *node)  in select_one_root()
2533 	struct backref_node *next;  in select_one_root()
2568 			struct backref_node *node, int reserve)  in calcu_metadata_size()
2571 	struct backref_node *next = node;  in calcu_metadata_size()
2602 				  struct backref_node *node)  in reserve_metadata_space()
2650 			 struct backref_node *node,  in do_relocation()
2655 	struct backref_node *upper;  in do_relocation()
2802 			 struct backref_node *node,  in link_to_upper()
2817 	struct backref_node *node;  in finish_pending_nodes()
2824 					  struct backref_node, list);  in finish_pending_nodes()
2847 				   struct backref_node *node)  in __mark_block_processed()
2863 				    struct backref_node *node)  in update_processed_blocks()
2865 	struct backref_node *next = node;  in update_processed_blocks()
2929 				struct backref_node *node,  in relocate_tree_block()
2987 	struct backref_node *node;  in relocate_tree_blocks()
4564 	struct backref_node *node;  in btrfs_reloc_cow_block()