225 		node = list_entry(cache->detached.next,  in backref_cache_cleanup()
231 		node = list_entry(cache->leaves.next,  in backref_cache_cleanup()
356 		edge = list_entry(node->upper.next,  in walk_up_backref()
383 		edge = list_entry(edge->list[LOWER].next,  in walk_down_backref()
437 		edge = list_entry(node->upper.next, struct backref_edge,  in remove_backref_node()
498 		node = list_entry(cache->detached.next,  in update_backref_cache()
504 		node = list_entry(cache->changed.next,  in update_backref_cache()
754 		edge = list_entry(cur->upper.next, struct backref_edge,
795 					goto next;
815 			goto next;
882 			goto next;
884 			goto next;
1014 next:
1033 		edge = list_entry(list.next, struct backref_edge, list[UPPER]);
1057 		edge = list_entry(list.next, struct backref_edge, list[UPPER]);
1114 		upper = list_entry(useless.next, struct backref_node, list);
1124 			edge = list_entry(upper->lower.next,
1148 			lower = list_entry(useless.next,
1180 			lower = list_entry(useless.next,
1277 		new_edge = list_entry(new_node->lower.next,
2333 		reloc_root = list_entry(rc->reloc_roots.next,
2368 		reloc_root = list_entry(list->next, struct btrfs_root,
2404 		reloc_root = list_entry(reloc_roots.next,
2494 	struct backref_node *next;  local
2498 	next = node;
2501 		next = walk_up_backref(next, edges, &index);
2502 		root = next->root;
2514 		if (next->new_bytenr != root->node->start) {
2515 			BUG_ON(next->new_bytenr);
2516 			BUG_ON(!list_empty(&next->list));
2517 			next->new_bytenr = root->node->start;
2518 			next->root = root;
2519 			list_add_tail(&next->list,
2521 			__mark_block_processed(rc, next);
2527 		next = walk_down_backref(edges, &index);
2528 		if (!next || next->level <= node->level)
2534 	next = node;
2537 		rc->backref_cache.path[next->level] = next;
2540 		next = edges[index]->node[UPPER];
2554 	struct backref_node *next;  local
2560 	next = node;
2563 		next = walk_up_backref(next, edges, &index);
2564 		root = next->root;
2574 		if (next != node)
2577 		next = walk_down_backref(edges, &index);
2578 		if (!next || next->level <= node->level)
2591 	struct backref_node *next = node;  local
2599 	while (next) {
2602 			if (next->processed && (reserve || next != node))
2607 			if (list_empty(&next->upper))
2610 			edge = list_entry(next->upper.next,
2613 			next = edge->node[UPPER];
2615 		next = walk_down_backref(edges, &index);
2703 					goto next;
2746 				goto next;
2750 				goto next;
2758 			goto next;
2762 			goto next;
2774 				goto next;
2794 next:
2837 			node = list_entry(cache->pending[level].next,
2879 	struct backref_node *next = node;  local
2884 	while (next) {
2887 			if (next->processed)
2890 			__mark_block_processed(rc, next);
2892 			if (list_empty(&next->upper))
2895 			edge = list_entry(next->upper.next,
2898 			next = edge->node[UPPER];
2900 		next = walk_down_backref(edges, &index);
3659 			goto next;
3663 			goto next;
3667 			goto next;
3672 			goto next;
3694 next:
3832 next:
3850 			goto next;
3856 			goto next;
3863 			goto next;
4018 			goto next;
4023 			goto next;
4030 next:
4575 		reloc_root = list_entry(reloc_roots.next,
4662 		sums = list_entry(list.next, struct btrfs_ordered_sum, list);