Lines Matching defs:data
41 * BG A: 10 data extents | BG A: deleted
42 * BG B: 2 data extents | BG B: 10 data extents (2 old + 8 relocated)
43 * BG C: 1 extents | BG C: 3 data extents (1 old + 2 relocated)
53 * 2.2 Build data reloc tree and reloc trees
55 * data extents.
56 * There will be only one data reloc tree for one data block group.
66 * 3. Cleanup reloc trees and data reloc tree.
85 void *data;
120 /* inode for moving data */
152 /* stages of data relocation */
362 root = (struct btrfs_root *)node->data;
634 node->data = root;
672 ASSERT(!node || (struct btrfs_root *)node->data == root);
716 BUG_ON((struct btrfs_root *)node->data != root);
992 * get new location of data
1330 * If not traced, we will leak data numbers
1332 * If not traced, we will double count old data
3031 * cache inode, to avoid free space cache data extent blocking data relocation.
3072 * helper to find all tree blocks that reference a given data extent
3493 * helper to create inode for data relocation.
3494 * the inode is in data relocation tree and its link count is 0
3584 return "move data extents";
3586 return "update data pointers";
3895 /* cleanup orphan inode in data relocation tree */
3905 * helper to add ordered checksum for data relocation.
3940 * We can do this because the data reloc inode refers strictly