Searched refs:useless_node (Results 1 – 3 of 3) sorted by relevance
2489 INIT_LIST_HEAD(&cache->useless_node);2589 ASSERT(list_empty(&cache->useless_node));2635 list_add(&cur->list, &cache->useless_node);2719 list_add(&cur->list, &cache->useless_node);2976 struct list_head *useless_node = &cache->useless_node; local3018 list_add(&lower->list, useless_node);3081 while (!list_empty(&cache->useless_node)) {3082 lower = list_first_entry(&cache->useless_node,3101 list_add(&lower->list, &cache->useless_node);3114 while (!list_empty(&cache->useless_node)) {[all …]
260 struct list_head useless_node; member
387 struct list_head *useless_node = &cache->useless_node; in handle_useless_nodes() local390 while (!list_empty(useless_node)) { in handle_useless_nodes()393 cur = list_first_entry(useless_node, struct btrfs_backref_node, in handle_useless_nodes()423 list_add(&lower->list, useless_node); in handle_useless_nodes()527 ASSERT(list_empty(&cache->useless_node) && in build_backref_tree()
Completed in 18 milliseconds