192 		node = edge->node[UPPER];  in walk_up_backref()
220 		return edge->node[UPPER];  in walk_down_backref()
413 					struct btrfs_backref_edge, list[UPPER]);  in handle_useless_nodes()
414 			list_del(&edge->list[UPPER]);  in handle_useless_nodes()
497 				struct btrfs_backref_edge, list[UPPER]);  in build_backref_tree()
503 			list_del_init(&edge->list[UPPER]);  in build_backref_tree()
504 			cur = edge->node[UPPER];  in build_backref_tree()
584 		list_for_each_entry(edge, &node->lower, list[UPPER]) {  in clone_backref_node()
602 		list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) {  in clone_backref_node()
611 				      struct btrfs_backref_edge, list[UPPER]);  in clone_backref_node()
612 		list_del(&new_edge->list[UPPER]);  in clone_backref_node()
2088 		next = edges[index]->node[UPPER];  in select_reloc_root()
2165 			next = edge->node[UPPER];  in calcu_metadata_size()
2249 		upper = edge->node[UPPER];  in do_relocation()
2446 			next = edge->node[UPPER];  in update_processed_blocks()