3025 	INIT_LIST_HEAD(&cache->useless_node);  in btrfs_backref_init_cache()
3159 	ASSERT(list_empty(&cache->useless_node));  in btrfs_backref_release_cache()
3211 			list_add(&cur->list, &cache->useless_node);  in handle_direct_tree_backref()
3301 			list_add(&cur->list, &cache->useless_node);  in handle_indirect_tree_backref()
3344 				list_add(&lower->list, &cache->useless_node);  in handle_indirect_tree_backref()
3562 	struct list_head *useless_node = &cache->useless_node;  in btrfs_backref_finish_upper_links()  local
3598 				list_add(&lower->list, useless_node);  in btrfs_backref_finish_upper_links()
3645 	while (!list_empty(&cache->useless_node)) {  in btrfs_backref_error_cleanup()
3646 		lower = list_first_entry(&cache->useless_node,  in btrfs_backref_error_cleanup()
3665 			list_add(&lower->list, &cache->useless_node);  in btrfs_backref_error_cleanup()
3675 			list_add(&upper->list, &cache->useless_node);  in btrfs_backref_error_cleanup()
3678 	while (!list_empty(&cache->useless_node)) {  in btrfs_backref_error_cleanup()
3679 		lower = list_first_entry(&cache->useless_node,  in btrfs_backref_error_cleanup()
3688 	ASSERT(list_empty(&cache->useless_node) &&  in btrfs_backref_error_cleanup()