Lines Matching refs:next
201 edge = list_entry(node->upper.next,
212 * walk down backref nodes to find start of next reference path
228 edge = list_entry(edge->list[LOWER].next,
272 node = list_entry(cache->detached.next,
278 node = list_entry(cache->changed.next,
424 edge = list_entry(cur->lower.next,
623 new_edge = list_entry(new_node->lower.next,
1435 * helper to find next relocated block in reloc tree
1644 struct btrfs_root *next;
1648 list_for_each_entry_safe(root, next, &rc->dirty_subvol_roots,
1903 reloc_root = list_entry(rc->reloc_roots.next,
2019 reloc_root = list_entry(reloc_roots.next,
2159 struct btrfs_backref_node *next;
2164 next = node;
2167 next = walk_up_backref(next, edges, &index);
2168 root = next->root;
2216 if (next->new_bytenr != root->node->start) {
2224 ASSERT(next->new_bytenr == 0);
2225 ASSERT(list_empty(&next->list));
2226 if (next->new_bytenr || !list_empty(&next->list)) {
2229 node->bytenr, next->bytenr);
2233 next->new_bytenr = root->node->start;
2234 btrfs_put_root(next->root);
2235 next->root = btrfs_grab_root(root);
2236 ASSERT(next->root);
2237 list_add_tail(&next->list,
2239 mark_block_processed(rc, next);
2245 next = walk_down_backref(edges, &index);
2246 if (!next || next->level <= node->level)
2258 next = node;
2261 rc->backref_cache.path[next->level] = next;
2264 next = edges[index]->node[UPPER];
2281 struct btrfs_backref_node *next;
2287 next = node;
2290 next = walk_up_backref(next, edges, &index);
2291 root = next->root;
2307 if (next != node)
2310 next = walk_down_backref(edges, &index);
2311 if (!next || next->level <= node->level)
2325 struct btrfs_backref_node *next = node;
2333 while (next) {
2336 if (next->processed && (reserve || next != node))
2341 if (list_empty(&next->upper))
2344 edge = list_entry(next->upper.next,
2347 next = edge->node[UPPER];
2349 next = walk_down_backref(edges, &index);
2435 goto next;
2442 goto next;
2446 goto next;
2476 goto next;
2488 goto next;
2492 goto next;
2499 goto next;
2509 goto next;
2535 next:
2583 node = list_entry(cache->pending[level].next,
2606 struct btrfs_backref_node *next = node;
2611 while (next) {
2614 if (next->processed)
2617 mark_block_processed(rc, next);
2619 if (list_empty(&next->upper))
2622 edge = list_entry(next->upper.next,
2625 next = edge->node[UPPER];
2627 next = walk_down_backref(edges, &index);
2778 struct tree_block *next;
2789 rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) {
2797 rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) {
2806 rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) {
2983 /* Use next boundary start*/
3099 /* Crossed extent end, go to next extent */
3495 * helper to find next unprocessed extent
3527 next:
3545 goto next;
3551 goto next;
3558 goto next;
4309 reloc_root = list_entry(reloc_roots.next,
4401 list_entry(list.next, struct btrfs_ordered_sum, list);