Searched refs:useless_node (Results 1 – 3 of 3) sorted by relevance
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()3566 struct list_head *useless_node = &cache->useless_node; in btrfs_backref_finish_upper_links() local3602 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()3683 while (!list_empty(&cache->useless_node)) { in btrfs_backref_error_cleanup()[all …]
406 struct list_head useless_node; member
329 struct list_head *useless_node = &cache->useless_node; in handle_useless_nodes() local332 while (!list_empty(useless_node)) { in handle_useless_nodes()335 cur = list_first_entry(useless_node, struct btrfs_backref_node, in handle_useless_nodes()359 list_add(&lower->list, useless_node); in handle_useless_nodes()459 ASSERT(list_empty(&cache->useless_node) && in build_backref_tree()