Lines Matching refs:list
889 * smaller or equal that seq to the list
1012 * add all inline backrefs for bytenr to the list
1144 * add all non-inline backrefs for bytenr to the list
1375 * refs) for the given bytenr to the refs list, merges duplicates and resolves
1377 * When roots are found, they're added to the roots list
1585 * the list of found roots is updated.
1640 * We transferred the list ownership to the ref,
1654 * its inode list here.
1671 * We have transferred the inode list ownership from
1673 * So set this ref's inode list to NULL to avoid
1731 * list. In turn, we find all referencing extents for those, further appending
1732 * to the list. The way we iterate the list allows adding more elements after
1734 * list.
2501 "root %llu references leaf %llu, data list %#llx",
3027 INIT_LIST_HEAD(&node->list);
3068 list[LOWER]);
3070 list_del(&edge->list[LOWER]);
3071 list_del(&edge->list[UPPER]);
3075 * Add the node to leaf node list if no other child block
3097 struct btrfs_backref_node, list);
3158 list_add(&cur->list, &cache->useless_node);
3179 * block to pending list
3181 list_add_tail(&edge->list[UPPER], &cache->pending_edge);
3186 INIT_LIST_HEAD(&edge->list[UPPER]);
3244 list_add(&cur->list, &cache->useless_node);
3287 list_add(&lower->list, &cache->useless_node);
3326 * Add the block to pending list if we need to check its
3332 list_add_tail(&edge->list[UPPER],
3337 INIT_LIST_HEAD(&edge->list[UPPER]);
3343 INIT_LIST_HEAD(&edge->list[UPPER]);
3409 list[LOWER]);
3410 ASSERT(list_empty(&edge->list[UPPER]));
3413 * Add the upper level block to pending list if we need check
3417 list_add_tail(&edge->list[UPPER], &cache->pending_edge);
3520 list_for_each_entry(edge, &start->upper, list[LOWER])
3521 list_add_tail(&edge->list[UPPER], &pending_edge);
3528 struct btrfs_backref_edge, list[UPPER]);
3529 list_del_init(&edge->list[UPPER]);
3535 list_del(&edge->list[LOWER]);
3540 list_add(&lower->list, useless_node);
3557 list_add_tail(&edge->list[UPPER], &upper->lower);
3584 list_add_tail(&edge->list[UPPER], &upper->lower);
3590 list_for_each_entry(edge, &upper->upper, list[LOWER])
3591 list_add_tail(&edge->list[UPPER], &pending_edge);
3605 struct btrfs_backref_node, list);
3606 list_del_init(&lower->list);
3610 struct btrfs_backref_edge, list[UPPER]);
3611 list_del(&edge->list[UPPER]);
3612 list_del(&edge->list[LOWER]);
3623 list_add(&lower->list, &cache->useless_node);
3628 /* Add this guy's upper edges to the list to process */
3629 list_for_each_entry(edge, &upper->upper, list[LOWER])
3630 list_add_tail(&edge->list[UPPER],
3633 list_add(&upper->list, &cache->useless_node);
3638 struct btrfs_backref_node, list);
3639 list_del_init(&lower->list);