190 				  struct btrfs_backref_edge, list[LOWER]);  in walk_up_backref()
211 		lower = edge->node[LOWER];  in walk_down_backref()
212 		if (list_is_last(&edge->list[LOWER], &lower->upper)) {  in walk_down_backref()
216 		edge = list_entry(edge->list[LOWER].next,  in walk_down_backref()
217 				  struct btrfs_backref_edge, list[LOWER]);  in walk_down_backref()
415 			list_del(&edge->list[LOWER]);  in handle_useless_nodes()
416 			lower = edge->node[LOWER];  in handle_useless_nodes()
589 			btrfs_backref_link_edge(new_edge, edge->node[LOWER],  in clone_backref_node()
603 			list_add_tail(&new_edge->list[LOWER],  in clone_backref_node()
604 				      &new_edge->node[LOWER]->upper);  in clone_backref_node()
2163 					struct btrfs_backref_edge, list[LOWER]);  in calcu_metadata_size()
2243 	list_for_each_entry(edge, &node->upper, list[LOWER]) {  in do_relocation()
2444 					struct btrfs_backref_edge, list[LOWER]);  in update_processed_blocks()