Lines Matching defs:blocks
70 * relocated tree blocks.
140 /* tree blocks have been processed */
440 * Backref nodes for upper level tree blocks are left in the
460 * upper level blocks that reference the block, and then check backrefs of
461 * these upper level blocks recursively. The recursion stops when tree root is
465 * all upper level blocks that directly/indirectly reference the block are also
783 * the source tree is a reloc tree, all tree blocks
1202 * try to replace tree blocks in fs tree with the new blocks
1203 * in reloc tree. tree blocks haven't been modified since the
1362 * the swapped tree blocks.
1373 * swap blocks in fs tree and reloc tree.
1690 * merge the relocated tree blocks in reloc tree with corresponding
1746 * tree blocks between reloc tree and subvolume tree. Thus for tree
2104 static void free_block_list(struct rb_root *blocks)
2108 while ((rb_node = rb_first(blocks))) {
2110 rb_erase(rb_node, blocks);
2397 * blocks that reference the block to point to the new location.
2600 * mark a block and all blocks directly/indirectly reference the block
2768 * relocate a list of blocks
2772 struct reloc_control *rc, struct rb_root *blocks)
2788 /* Kick in readahead for tree blocks with missing keys */
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) {
2827 free_block_list(blocks);
3198 struct rb_root *blocks)
3231 * We're reading random blocks without knowing their owner ahead
3284 rb_node = rb_simple_insert(blocks, block->bytenr, &block->rb_node);
3293 * helper to add tree blocks for backref of type BTRFS_SHARED_DATA_REF_KEY
3297 struct rb_root *blocks)
3308 if (rb_simple_search(blocks, bytenr))
3359 ret = add_tree_block(rc, &key, path, blocks);
3445 * helper to find all tree blocks that reference a given data extent
3451 struct rb_root *blocks)
3484 ret = __add_tree_block(rc, ref_node->val, blocksize, blocks);
3489 free_block_list(blocks);
3649 struct rb_root blocks = RB_ROOT;
3706 ret = add_tree_block(rc, &key, path, &blocks);
3709 ret = add_data_references(rc, &key, path, &blocks);
3719 if (!RB_EMPTY_ROOT(&blocks)) {
3720 ret = relocate_tree_blocks(trans, rc, &blocks);
4202 * this is important for keeping the sharing of tree blocks
4479 * required for relocating tree blocks in the snapshot