2731 	INIT_LIST_HEAD(&node->lower);  in btrfs_backref_alloc_node()
2780 		if (list_empty(&upper->lower)) {  in btrfs_backref_cleanup_node()
2781 			list_add_tail(&upper->lower, &cache->leaves);  in btrfs_backref_cleanup_node()
2805 				  struct btrfs_backref_node, lower);  in btrfs_backref_release_cache()
2914 	struct btrfs_backref_node *lower;  in handle_indirect_tree_backref()  local
2976 	lower = cur;  in handle_indirect_tree_backref()
2982 			       lower->bytenr);  in handle_indirect_tree_backref()
2987 				list_add(&lower->list, &cache->useless_node);  in handle_indirect_tree_backref()
2989 				lower->root = root;  in handle_indirect_tree_backref()
3005 							 lower->level + 1);  in handle_indirect_tree_backref()
3047 		btrfs_backref_link_edge(edge, lower, upper, LINK_LOWER);  in handle_indirect_tree_backref()
3053 		lower = upper;  in handle_indirect_tree_backref()
3215 		list_add_tail(&start->lower, &cache->leaves);  in btrfs_backref_finish_upper_links()
3228 		struct btrfs_backref_node *lower;  in btrfs_backref_finish_upper_links()  local
3234 		lower = edge->node[LOWER];  in btrfs_backref_finish_upper_links()
3242 			if (list_empty(&lower->upper))  in btrfs_backref_finish_upper_links()
3243 				list_add(&lower->list, useless_node);  in btrfs_backref_finish_upper_links()
3256 				list_del_init(&upper->lower);  in btrfs_backref_finish_upper_links()
3260 			list_add_tail(&edge->list[UPPER], &upper->lower);  in btrfs_backref_finish_upper_links()
3287 		list_add_tail(&edge->list[UPPER], &upper->lower);  in btrfs_backref_finish_upper_links()
3302 	struct btrfs_backref_node *lower;  in btrfs_backref_error_cleanup()  local
3307 		lower = list_first_entry(&cache->useless_node,  in btrfs_backref_error_cleanup()
3309 		list_del_init(&lower->list);  in btrfs_backref_error_cleanup()
3316 		lower = edge->node[LOWER];  in btrfs_backref_error_cleanup()
3324 		if (list_empty(&lower->upper) &&  in btrfs_backref_error_cleanup()
3325 		    RB_EMPTY_NODE(&lower->rb_node))  in btrfs_backref_error_cleanup()
3326 			list_add(&lower->list, &cache->useless_node);  in btrfs_backref_error_cleanup()
3340 		lower = list_first_entry(&cache->useless_node,  in btrfs_backref_error_cleanup()
3342 		list_del_init(&lower->list);  in btrfs_backref_error_cleanup()
3343 		if (lower == node)  in btrfs_backref_error_cleanup()
3345 		btrfs_backref_drop_node(cache, lower);  in btrfs_backref_error_cleanup()