Lines Matching refs:list
144 /* list of reloc trees */
146 /* list of subvolume trees that get relocated */
202 struct btrfs_backref_edge, list[LOWER]);
224 if (list_is_last(&edge->list[LOWER], &lower->upper)) {
228 edge = list_entry(edge->list[LOWER].next,
229 struct btrfs_backref_edge, list[LOWER]);
273 struct btrfs_backref_node, list);
279 struct btrfs_backref_node, list);
280 list_del_init(&node->list);
286 * some nodes can be left in the pending list if there were
290 list_for_each_entry(node, &cache->pending[level], list) {
390 * Return false if @node is not in the @useless_nodes list.
391 * Return true if @node is in the @useless_nodes list.
404 list);
405 list_del_init(&cur->list);
425 struct btrfs_backref_edge, list[UPPER]);
426 list_del(&edge->list[UPPER]);
427 list_del(&edge->list[LOWER]);
433 list_add(&lower->list, useless_node);
444 list_add(&cur->list, &cache->detached);
510 struct btrfs_backref_edge, list[UPPER]);
512 * The pending list isn't empty, take the first block to
516 list_del_init(&edge->list[UPPER]);
597 list_for_each_entry(edge, &node->lower, list[UPPER]) {
615 list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) {
616 list_add_tail(&new_edge->list[LOWER],
624 struct btrfs_backref_edge, list[UPPER]);
625 list_del(&new_edge->list[UPPER]);
690 * We only put the reloc root here if it's on the list. There's a lot
694 * list we don't want the reference being dropped, because the guy
695 * messing with the list is in charge of the reference.
843 * root->reloc_root, and another for being on the rc->reloc_roots list.
1775 * dirty list. At commit time we'll still call
1912 * back on our list so we can clean up properly.
1964 * list so we can clean up properly.
1987 void free_reloc_roots(struct list_head *list)
1991 list_for_each_entry_safe(reloc_root, tmp, list, root_list)
2010 * adding their roots to the list while we are
2096 * for the list that holds it, so these roots will be cleaned up when we
2220 * list. If it is then we have multiple roots pointing
2225 ASSERT(list_empty(&next->list));
2226 if (next->new_bytenr || !list_empty(&next->list)) {
2237 list_add_tail(&next->list,
2345 struct btrfs_backref_edge, list[LOWER]);
2426 list_for_each_entry(edge, &node->upper, list[LOWER]) {
2546 list_move_tail(&node->list, &rc->backref_cache.changed);
2575 LIST_HEAD(list);
2584 struct btrfs_backref_node, list);
2585 list_move_tail(&node->list, &list);
2594 list_splice_init(&list, &cache->pending[level]);
2623 struct btrfs_backref_edge, list[LOWER]);
2710 * should have not been included on the changed list.
2720 ASSERT(list_empty(&node->list));
2721 if (node->new_bytenr || !list_empty(&node->list)) {
2744 list_add_tail(&node->list, &rc->backref_cache.changed);
2768 * relocate a list of blocks
3192 * helper to add a tree block to the list.
4390 LIST_HEAD(list);
4395 &list, 0, false);
4399 while (!list_empty(&list)) {
4401 list_entry(list.next, struct btrfs_ordered_sum, list);
4403 list_del_init(&sums->list);
4460 list_move_tail(&node->list,