Searched refs:useless_node (Results 1 – 3 of 3) sorted by relevance
3012 INIT_LIST_HEAD(&cache->useless_node); in btrfs_backref_init_cache()3112 ASSERT(list_empty(&cache->useless_node)); in btrfs_backref_release_cache()3158 list_add(&cur->list, &cache->useless_node); in handle_direct_tree_backref()3244 list_add(&cur->list, &cache->useless_node); in handle_indirect_tree_backref()3287 list_add(&lower->list, &cache->useless_node); in handle_indirect_tree_backref()3498 struct list_head *useless_node = &cache->useless_node; in btrfs_backref_finish_upper_links() local3540 list_add(&lower->list, useless_node); in btrfs_backref_finish_upper_links()3603 while (!list_empty(&cache->useless_node)) { in btrfs_backref_error_cleanup()3604 lower = list_first_entry(&cache->useless_node, in btrfs_backref_error_cleanup()3623 list_add(&lower->list, &cache->useless_node); in btrfs_backref_error_cleanup()[all …]
433 struct list_head useless_node; member
397 struct list_head *useless_node = &cache->useless_node; in handle_useless_nodes() local400 while (!list_empty(useless_node)) { in handle_useless_nodes()403 cur = list_first_entry(useless_node, struct btrfs_backref_node, in handle_useless_nodes()433 list_add(&lower->list, useless_node); in handle_useless_nodes()538 ASSERT(list_empty(&cache->useless_node) && in build_backref_tree()
