Home
last modified time | relevance | path

Searched refs:pending_edge (Results 1 - 6 of 6) sorted by relevance

/kernel/linux/linux-5.10/fs/btrfs/
H A Dbackref.c2554 INIT_LIST_HEAD(&cache->pending_edge);
2654 ASSERT(list_empty(&cache->pending_edge));
2724 list_add_tail(&edge->list[UPPER], &cache->pending_edge);
2874 &cache->pending_edge);
2957 list_add_tail(&edge->list[UPPER], &cache->pending_edge);
3045 LIST_HEAD(pending_edge);
3065 list_add_tail(&edge->list[UPPER], &pending_edge);
3067 while (!list_empty(&pending_edge)) {
3071 edge = list_first_entry(&pending_edge,
3135 list_add_tail(&edge->list[UPPER], &pending_edge);
[all...]
H A Dbackref.h255 struct list_head pending_edge; member
H A Drelocation.c496 edge = list_first_entry_or_null(&cache->pending_edge, in build_backref_tree()
526 list_empty(&cache->pending_edge)); in build_backref_tree()
/kernel/linux/linux-6.6/fs/btrfs/
H A Dbackref.c3011 INIT_LIST_HEAD(&cache->pending_edge); in btrfs_backref_init_cache()
3111 ASSERT(list_empty(&cache->pending_edge)); in btrfs_backref_release_cache()
3181 list_add_tail(&edge->list[UPPER], &cache->pending_edge); in handle_direct_tree_backref()
3333 &cache->pending_edge); in handle_indirect_tree_backref()
3417 list_add_tail(&edge->list[UPPER], &cache->pending_edge); in btrfs_backref_add_tree_node()
3501 LIST_HEAD(pending_edge); in btrfs_backref_finish_upper_links()
3521 list_add_tail(&edge->list[UPPER], &pending_edge); in btrfs_backref_finish_upper_links()
3523 while (!list_empty(&pending_edge)) { in btrfs_backref_finish_upper_links()
3527 edge = list_first_entry(&pending_edge, in btrfs_backref_finish_upper_links()
3591 list_add_tail(&edge->list[UPPER], &pending_edge); in btrfs_backref_finish_upper_links()
[all...]
H A Dbackref.h430 struct list_head pending_edge; member
H A Drelocation.c509 edge = list_first_entry_or_null(&cache->pending_edge, in build_backref_tree()
539 list_empty(&cache->pending_edge)); in build_backref_tree()

Completed in 19 milliseconds