Searched refs:useless_node (Results 1 – 3 of 3) sorted by relevance
2551 INIT_LIST_HEAD(&cache->useless_node);2651 ASSERT(list_empty(&cache->useless_node));2697 list_add(&cur->list, &cache->useless_node);2781 list_add(&cur->list, &cache->useless_node);2824 list_add(&lower->list, &cache->useless_node);3038 struct list_head *useless_node = &cache->useless_node; local3080 list_add(&lower->list, useless_node);3143 while (!list_empty(&cache->useless_node)) {3144 lower = list_first_entry(&cache->useless_node,3163 list_add(&lower->list, &cache->useless_node);[all …]
258 struct list_head useless_node; member
385 struct list_head *useless_node = &cache->useless_node; in handle_useless_nodes() local388 while (!list_empty(useless_node)) { in handle_useless_nodes()391 cur = list_first_entry(useless_node, struct btrfs_backref_node, in handle_useless_nodes()421 list_add(&lower->list, useless_node); in handle_useless_nodes()525 ASSERT(list_empty(&cache->useless_node) && in build_backref_tree()