Lines Matching refs:list
132 /* list of reloc trees */
134 /* list of subvolume trees that get relocated */
190 struct btrfs_backref_edge, list[LOWER]);
212 if (list_is_last(&edge->list[LOWER], &lower->upper)) {
216 edge = list_entry(edge->list[LOWER].next,
217 struct btrfs_backref_edge, list[LOWER]);
261 struct btrfs_backref_node, list);
267 struct btrfs_backref_node, list);
268 list_del_init(&node->list);
274 * some nodes can be left in the pending list if there were
278 list_for_each_entry(node, &cache->pending[level], list) {
378 * Return false if @node is not in the @useless_nodes list.
379 * Return true if @node is in the @useless_nodes list.
392 list);
393 list_del_init(&cur->list);
413 struct btrfs_backref_edge, list[UPPER]);
414 list_del(&edge->list[UPPER]);
415 list_del(&edge->list[LOWER]);
421 list_add(&lower->list, useless_node);
432 list_add(&cur->list, &cache->detached);
497 struct btrfs_backref_edge, list[UPPER]);
499 * The pending list isn't empty, take the first block to
503 list_del_init(&edge->list[UPPER]);
584 list_for_each_entry(edge, &node->lower, list[UPPER]) {
602 list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) {
603 list_add_tail(&new_edge->list[LOWER],
611 struct btrfs_backref_edge, list[UPPER]);
612 list_del(&new_edge->list[UPPER]);
676 * We only put the reloc root here if it's on the list. There's a lot
680 * list we don't want the reference being dropped, because the guy
681 * messing with the list is in charge of the reference.
829 * root->reloc_root, and another for being on the rc->reloc_roots list.
1742 * dirty list. At commit time we'll still call
1905 void free_reloc_roots(struct list_head *list)
1909 list_for_each_entry_safe(reloc_root, tmp, list, root_list)
1928 * adding their roots to the list while we are
1996 * for the list that holds it, so these roots will be cleaned up when we
2062 BUG_ON(!list_empty(&next->list));
2067 list_add_tail(&next->list,
2163 struct btrfs_backref_edge, list[LOWER]);
2243 list_for_each_entry(edge, &node->upper, list[LOWER]) {
2372 list_move_tail(&node->list, &rc->backref_cache.changed);
2396 LIST_HEAD(list);
2405 struct btrfs_backref_node, list);
2406 list_move_tail(&node->list, &list);
2415 list_splice_init(&list, &cache->pending[level]);
2444 struct btrfs_backref_edge, list[LOWER]);
2517 BUG_ON(!list_empty(&node->list));
2524 list_add_tail(&node->list, &rc->backref_cache.changed);
2544 * relocate a list of blocks
2858 * helper to add a tree block to the list.
3918 LIST_HEAD(list);
3925 disk_bytenr + len - 1, &list, 0);
3929 while (!list_empty(&list)) {
3930 sums = list_entry(list.next, struct btrfs_ordered_sum, list);
3931 list_del_init(&sums->list);
3992 list_move_tail(&node->list,