186 	struct btrfs_backref_edge *edge;  in walk_up_backref()  local
190 		edge = list_entry(node->upper.next,  in walk_up_backref()
192 		edges[idx++] = edge;  in walk_up_backref()
193 		node = edge->node[UPPER];  in walk_up_backref()
206 	struct btrfs_backref_edge *edge;  in walk_down_backref()  local
211 		edge = edges[idx - 1];  in walk_down_backref()
212 		lower = edge->node[LOWER];  in walk_down_backref()
213 		if (list_is_last(&edge->list[LOWER], &lower->upper)) {  in walk_down_backref()
217 		edge = list_entry(edge->list[LOWER].next,  in walk_down_backref()
219 		edges[idx - 1] = edge;  in walk_down_backref()
221 		return edge->node[UPPER];  in walk_down_backref()
410 			struct btrfs_backref_edge *edge;  in handle_useless_nodes()  local
413 			edge = list_entry(cur->lower.next,  in handle_useless_nodes()
415 			list_del(&edge->list[UPPER]);  in handle_useless_nodes()
416 			list_del(&edge->list[LOWER]);  in handle_useless_nodes()
417 			lower = edge->node[LOWER];  in handle_useless_nodes()
418 			btrfs_backref_free_edge(cache, edge);  in handle_useless_nodes()
467 	struct btrfs_backref_edge *edge;  in build_backref_tree()  local
497 		edge = list_first_entry_or_null(&cache->pending_edge,  in build_backref_tree()
503 		if (edge) {  in build_backref_tree()
504 			list_del_init(&edge->list[UPPER]);  in build_backref_tree()
505 			cur = edge->node[UPPER];  in build_backref_tree()
507 	} while (edge);  in build_backref_tree()
545 	struct btrfs_backref_edge *edge;  in clone_backref_node()  local
585 		list_for_each_entry(edge, &node->lower, list[UPPER]) {  in clone_backref_node()
590 			btrfs_backref_link_edge(new_edge, edge->node[LOWER],  in clone_backref_node()
2314 	struct btrfs_backref_edge *edge;  in calcu_metadata_size()  local
2332 			edge = list_entry(next->upper.next,  in calcu_metadata_size()
2334 			edges[index++] = edge;  in calcu_metadata_size()
2335 			next = edge->node[UPPER];  in calcu_metadata_size()
2397 	struct btrfs_backref_edge *edge;  in do_relocation()  local
2414 	list_for_each_entry(edge, &node->upper, list[LOWER]) {  in do_relocation()
2419 		upper = edge->node[UPPER];  in do_relocation()
2596 	struct btrfs_backref_edge *edge;  in update_processed_blocks()  local
2611 			edge = list_entry(next->upper.next,  in update_processed_blocks()
2613 			edges[index++] = edge;  in update_processed_blocks()
2614 			next = edge->node[UPPER];  in update_processed_blocks()