2714 	INIT_LIST_HEAD(&cache->useless_node);  in btrfs_backref_init_cache()
2814 	ASSERT(list_empty(&cache->useless_node));  in btrfs_backref_release_cache()
2860 			list_add(&cur->list, &cache->useless_node);  in handle_direct_tree_backref()
2944 			list_add(&cur->list, &cache->useless_node);  in handle_indirect_tree_backref()
2987 				list_add(&lower->list, &cache->useless_node);  in handle_indirect_tree_backref()
3201 	struct list_head *useless_node = &cache->useless_node;  in btrfs_backref_finish_upper_links()  local
3243 				list_add(&lower->list, useless_node);  in btrfs_backref_finish_upper_links()
3306 	while (!list_empty(&cache->useless_node)) {  in btrfs_backref_error_cleanup()
3307 		lower = list_first_entry(&cache->useless_node,  in btrfs_backref_error_cleanup()
3326 			list_add(&lower->list, &cache->useless_node);  in btrfs_backref_error_cleanup()
3336 			list_add(&upper->list, &cache->useless_node);  in btrfs_backref_error_cleanup()
3339 	while (!list_empty(&cache->useless_node)) {  in btrfs_backref_error_cleanup()
3340 		lower = list_first_entry(&cache->useless_node,  in btrfs_backref_error_cleanup()
3349 	ASSERT(list_empty(&cache->useless_node) &&  in btrfs_backref_error_cleanup()