Lines Matching refs:next
190 edge = list_entry(node->upper.next, in walk_up_backref()
217 edge = list_entry(edge->list[LOWER].next, in walk_down_backref()
261 node = list_entry(cache->detached.next, in update_backref_cache()
267 node = list_entry(cache->changed.next, in update_backref_cache()
413 edge = list_entry(cur->lower.next, in handle_useless_nodes()
611 new_edge = list_entry(new_node->lower.next, in clone_backref_node()
1633 struct btrfs_root *next; in clean_dirty_subvols() local
1637 list_for_each_entry_safe(root, next, &rc->dirty_subvol_roots, in clean_dirty_subvols()
1891 reloc_root = list_entry(rc->reloc_roots.next, in prepare_to_merge()
2007 reloc_root = list_entry(reloc_roots.next, in merge_reloc_roots()
2147 struct btrfs_backref_node *next; in select_reloc_root() local
2152 next = node; in select_reloc_root()
2155 next = walk_up_backref(next, edges, &index); in select_reloc_root()
2156 root = next->root; in select_reloc_root()
2204 if (next->new_bytenr != root->node->start) { in select_reloc_root()
2212 ASSERT(next->new_bytenr == 0); in select_reloc_root()
2213 ASSERT(list_empty(&next->list)); in select_reloc_root()
2214 if (next->new_bytenr || !list_empty(&next->list)) { in select_reloc_root()
2217 node->bytenr, next->bytenr); in select_reloc_root()
2221 next->new_bytenr = root->node->start; in select_reloc_root()
2222 btrfs_put_root(next->root); in select_reloc_root()
2223 next->root = btrfs_grab_root(root); in select_reloc_root()
2224 ASSERT(next->root); in select_reloc_root()
2225 list_add_tail(&next->list, in select_reloc_root()
2227 mark_block_processed(rc, next); in select_reloc_root()
2233 next = walk_down_backref(edges, &index); in select_reloc_root()
2234 if (!next || next->level <= node->level) in select_reloc_root()
2246 next = node; in select_reloc_root()
2249 rc->backref_cache.path[next->level] = next; in select_reloc_root()
2252 next = edges[index]->node[UPPER]; in select_reloc_root()
2269 struct btrfs_backref_node *next; in select_one_root() local
2275 next = node; in select_one_root()
2278 next = walk_up_backref(next, edges, &index); in select_one_root()
2279 root = next->root; in select_one_root()
2295 if (next != node) in select_one_root()
2298 next = walk_down_backref(edges, &index); in select_one_root()
2299 if (!next || next->level <= node->level) in select_one_root()
2313 struct btrfs_backref_node *next = node; in calcu_metadata_size() local
2321 while (next) { in calcu_metadata_size()
2324 if (next->processed && (reserve || next != node)) in calcu_metadata_size()
2329 if (list_empty(&next->upper)) in calcu_metadata_size()
2332 edge = list_entry(next->upper.next, in calcu_metadata_size()
2335 next = edge->node[UPPER]; in calcu_metadata_size()
2337 next = walk_down_backref(edges, &index); in calcu_metadata_size()
2423 goto next; in do_relocation()
2430 goto next; in do_relocation()
2434 goto next; in do_relocation()
2464 goto next; in do_relocation()
2476 goto next; in do_relocation()
2480 goto next; in do_relocation()
2487 goto next; in do_relocation()
2497 goto next; in do_relocation()
2524 next: in do_relocation()
2572 node = list_entry(cache->pending[level].next, in finish_pending_nodes()
2595 struct btrfs_backref_node *next = node; in update_processed_blocks() local
2600 while (next) { in update_processed_blocks()
2603 if (next->processed) in update_processed_blocks()
2606 mark_block_processed(rc, next); in update_processed_blocks()
2608 if (list_empty(&next->upper)) in update_processed_blocks()
2611 edge = list_entry(next->upper.next, in update_processed_blocks()
2614 next = edge->node[UPPER]; in update_processed_blocks()
2616 next = walk_down_backref(edges, &index); in update_processed_blocks()
2763 struct tree_block *next; in relocate_tree_blocks() local
2774 rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { in relocate_tree_blocks()
2782 rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { in relocate_tree_blocks()
2791 rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { in relocate_tree_blocks()
3499 next: in find_next_extent()
3517 goto next; in find_next_extent()
3523 goto next; in find_next_extent()
3530 goto next; in find_next_extent()
4270 reloc_root = list_entry(reloc_roots.next, in btrfs_recover_relocation()
4365 sums = list_entry(list.next, struct btrfs_ordered_sum, list); in btrfs_reloc_clone_csums()