191 		struct btrfs_backref_edge *edges[], int *index)  in walk_up_backref()  argument
199 		edges[idx++] = edge;  in walk_up_backref()
211 		struct btrfs_backref_edge *edges[], int *index)  in walk_down_backref()  argument
218 		edge = edges[idx - 1];  in walk_down_backref()
226 		edges[idx - 1] = edge;  in walk_down_backref()
378  * - Cleanup the children edges and nodes
414 		/* Cleanup the lower edges */  in handle_useless_nodes()
516 	/* Finish the upper linkage of newly added edges/nodes */  in build_backref_tree()
2155 				     struct btrfs_backref_edge *edges[])  in select_reloc_root()  argument
2165 		next = walk_up_backref(next, edges, &index);  in select_reloc_root()
2243 		next = walk_down_backref(edges, &index);  in select_reloc_root()
2262 		next = edges[index]->node[UPPER];  in select_reloc_root()
2282 	struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];  in select_one_root()  local
2288 		next = walk_up_backref(next, edges, &index);  in select_one_root()
2308 		next = walk_down_backref(edges, &index);  in select_one_root()
2325 	struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];  in calcu_metadata_size()  local
2344 			edges[index++] = edge;  in calcu_metadata_size()
2347 		next = walk_down_backref(edges, &index);  in calcu_metadata_size()
2408 	struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];  in do_relocation()  local
2430 		root = select_reloc_root(trans, rc, upper, edges);  in do_relocation()
2607 	struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];  in update_processed_blocks()  local
2623 			edges[index++] = edge;  in update_processed_blocks()
2626 		next = walk_down_backref(edges, &index);  in update_processed_blocks()