Searched refs:useless_node (Results 1 - 6 of 6) sorted by relevance
| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | backref.c | 2555 INIT_LIST_HEAD(&cache->useless_node);
2655 ASSERT(list_empty(&cache->useless_node));
2701 list_add(&cur->list, &cache->useless_node);
2785 list_add(&cur->list, &cache->useless_node);
2828 list_add(&lower->list, &cache->useless_node);
3042 struct list_head *useless_node = &cache->useless_node; local
3084 list_add(&lower->list, useless_node);
3147 while (!list_empty(&cache->useless_node)) {
3148 lower = list_first_entry(&cache->useless_node,
[all...] |
| H A D | backref.h | 258 struct list_head useless_node; member
|
| H A D | relocation.c | 385 struct list_head *useless_node = &cache->useless_node; in handle_useless_nodes() local
388 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()
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | backref.c | 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() local
3540 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()
[all...] |
| H A D | backref.h | 433 struct list_head useless_node; member
|
| H A D | relocation.c | 397 struct list_head *useless_node = &cache->useless_node; in handle_useless_nodes() local
400 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()
|
Completed in 19 milliseconds