Searched refs:useless_node (Results 1 – 2 of 2) sorted by relevance
3025 INIT_LIST_HEAD(&cache->useless_node); in btrfs_backref_init_cache()3162 ASSERT(list_empty(&cache->useless_node)); in btrfs_backref_release_cache()3217 list_add(&cur->list, &cache->useless_node); in handle_direct_tree_backref()3309 list_add(&cur->list, &cache->useless_node); in handle_indirect_tree_backref()3353 list_add(&lower->list, &cache->useless_node); in handle_indirect_tree_backref()3571 struct list_head *useless_node = &cache->useless_node; in btrfs_backref_finish_upper_links() local3607 list_add(&lower->list, useless_node); in btrfs_backref_finish_upper_links()3652 while (!list_empty(&cache->useless_node)) { in btrfs_backref_error_cleanup()3653 lower = list_first_entry(&cache->useless_node, in btrfs_backref_error_cleanup()3672 list_add(&lower->list, &cache->useless_node); in btrfs_backref_error_cleanup()[all …]
435 struct list_head *useless_node = &cache->useless_node; in handle_useless_nodes() local438 while (!list_empty(useless_node)) { in handle_useless_nodes()441 cur = list_first_entry(useless_node, struct btrfs_backref_node, in handle_useless_nodes()465 list_add(&lower->list, useless_node); in handle_useless_nodes()564 ASSERT(list_empty(&cache->useless_node) && in build_backref_tree()