3025 	INIT_LIST_HEAD(&cache->useless_node);  in btrfs_backref_init_cache()
3159 	ASSERT(list_empty(&cache->useless_node));  in btrfs_backref_release_cache()
3215 			list_add(&cur->list, &cache->useless_node);  in handle_direct_tree_backref()
3305 			list_add(&cur->list, &cache->useless_node);  in handle_indirect_tree_backref()
3348 				list_add(&lower->list, &cache->useless_node);  in handle_indirect_tree_backref()
3566 	struct list_head *useless_node = &cache->useless_node;  in btrfs_backref_finish_upper_links()  local
3602 				list_add(&lower->list, useless_node);  in btrfs_backref_finish_upper_links()
3650 	while (!list_empty(&cache->useless_node)) {  in btrfs_backref_error_cleanup()
3651 		lower = list_first_entry(&cache->useless_node,  in btrfs_backref_error_cleanup()
3670 			list_add(&lower->list, &cache->useless_node);  in btrfs_backref_error_cleanup()
3680 			list_add(&upper->list, &cache->useless_node);  in btrfs_backref_error_cleanup()
3683 	while (!list_empty(&cache->useless_node)) {  in btrfs_backref_error_cleanup()
3684 		lower = list_first_entry(&cache->useless_node,  in btrfs_backref_error_cleanup()
3693 	ASSERT(list_empty(&cache->useless_node) &&  in btrfs_backref_error_cleanup()