184 		struct btrfs_backref_edge *edges[], int *index)  in walk_up_backref()  argument
192 		edges[idx++] = edge;  in walk_up_backref()
204 		struct btrfs_backref_edge *edges[], int *index)  in walk_down_backref()  argument
211 		edge = edges[idx - 1];  in walk_down_backref()
219 		edges[idx - 1] = edge;  in walk_down_backref()
372  * - Cleanup the children edges and nodes
408 		/* Cleanup the lower edges */  in handle_useless_nodes()
509 	/* Finish the upper linkage of newly added edges/nodes */  in build_backref_tree()
2108 				     struct btrfs_backref_edge *edges[])  in select_reloc_root()  argument
2118 		next = walk_up_backref(next, edges, &index);  in select_reloc_root()
2196 		next = walk_down_backref(edges, &index);  in select_reloc_root()
2215 		next = edges[index]->node[UPPER];  in select_reloc_root()
2235 	struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];  in select_one_root()  local
2241 		next = walk_up_backref(next, edges, &index);  in select_one_root()
2261 		next = walk_down_backref(edges, &index);  in select_one_root()
2278 	struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];  in calcu_metadata_size()  local
2297 			edges[index++] = edge;  in calcu_metadata_size()
2300 		next = walk_down_backref(edges, &index);  in calcu_metadata_size()
2361 	struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];  in do_relocation()  local
2383 		root = select_reloc_root(trans, rc, upper, edges);  in do_relocation()
2559 	struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];  in update_processed_blocks()  local
2575 			edges[index++] = edge;  in update_processed_blocks()
2578 		next = walk_down_backref(edges, &index);  in update_processed_blocks()