/kernel/linux/linux-5.10/fs/btrfs/ |
H A D | print-tree.c | 390 btrfs_node_blockptr(c, i), in btrfs_print_tree() 400 next = read_tree_block(fs_info, btrfs_node_blockptr(c, i), in btrfs_print_tree()
|
H A D | ctree.c | 446 tm->blockptr = btrfs_node_blockptr(eb, slot); in alloc_tree_mod_elem() 1643 blocknr = btrfs_node_blockptr(parent, i); in btrfs_realloc_node() 1650 other = btrfs_node_blockptr(parent, i - 1); in btrfs_realloc_node() 1654 other = btrfs_node_blockptr(parent, i + 1); in btrfs_realloc_node() 1828 eb = read_tree_block(parent->fs_info, btrfs_node_blockptr(parent, slot), in btrfs_read_node_slot() 1867 orig_ptr = btrfs_node_blockptr(mid, orig_slot); in balance_level() 2056 btrfs_node_blockptr(path->nodes[level], path->slots[level])) in balance_level() 2240 search = btrfs_node_blockptr(node, slot); in reada_for_search() 2268 search = btrfs_node_blockptr(node, nr); in reada_for_search() 2299 block1 = btrfs_node_blockptr(paren in reada_for_balance() [all...] |
H A D | qgroup.c | 2046 child_bytenr = btrfs_node_blockptr(eb, parent_slot); in qgroup_trace_extent_swap() 2182 child_bytenr = btrfs_node_blockptr(eb, parent_slot); in qgroup_trace_new_subtree_blocks() 2361 child_bytenr = btrfs_node_blockptr(eb, parent_slot); in btrfs_qgroup_trace_subtree() 4240 block->subvol_bytenr = btrfs_node_blockptr(reloc_parent, reloc_slot); in btrfs_qgroup_add_swapped_blocks() 4243 block->reloc_bytenr = btrfs_node_blockptr(subvol_parent, subvol_slot); in btrfs_qgroup_add_swapped_blocks()
|
H A D | relocation.c | 1255 old_bytenr = btrfs_node_blockptr(parent, slot); in replace_path() 1262 new_bytenr = btrfs_node_blockptr(eb, in replace_path() 1471 bytenr = btrfs_node_blockptr(eb, path->slots[i]); in walk_down_reloc_tree() 2261 bytenr = btrfs_node_blockptr(upper->eb, slot); in do_relocation() 2301 bytenr = btrfs_node_blockptr(upper->eb, slot); in do_relocation()
|
H A D | reada.c | 144 bytenr = btrfs_node_blockptr(eb, i); in __readahead_hook()
|
H A D | ref-verify.c | 563 block_bytenr = btrfs_node_blockptr(path->nodes[level], in walk_down_tree()
|
H A D | extent-tree.c | 2459 bytenr = btrfs_node_blockptr(buf, i); in __btrfs_mod_ref() 4792 bytenr = btrfs_node_blockptr(eb, slot); in reada_walk_down() 4985 bytenr = btrfs_node_blockptr(path->nodes[level], path->slots[level]); in do_walk_down()
|
H A D | tree-checker.c | 1761 bytenr = btrfs_node_blockptr(node, slot); in btrfs_check_node()
|
H A D | backref.c | 2808 if (btrfs_node_blockptr(eb, path->slots[level]) != cur->bytenr) {
|
H A D | ctree.h | 1777 static inline u64 btrfs_node_blockptr(const struct extent_buffer *eb, int nr) in btrfs_node_blockptr() function
|
H A D | send.c | 7068 left_blockptr = btrfs_node_blockptr( in btrfs_compare_trees() 7071 right_blockptr = btrfs_node_blockptr( in btrfs_compare_trees()
|
H A D | tree-log.c | 2754 bytenr = btrfs_node_blockptr(cur, path->slots[*level]); in walk_down_log_tree()
|
H A D | volumes.c | 7162 start = btrfs_node_blockptr(node, i); in readahead_tree_node_children()
|
/kernel/linux/linux-6.6/fs/btrfs/ |
H A D | print-tree.c | 382 btrfs_node_blockptr(c, i), in btrfs_print_tree() 397 next = read_tree_block(fs_info, btrfs_node_blockptr(c, i), &check); in btrfs_print_tree()
|
H A D | ctree.c | 863 blocknr = btrfs_node_blockptr(parent, i); in btrfs_realloc_node() 868 other = btrfs_node_blockptr(parent, i - 1); in btrfs_realloc_node() 872 other = btrfs_node_blockptr(parent, i + 1); in btrfs_realloc_node() 1024 eb = read_tree_block(parent->fs_info, btrfs_node_blockptr(parent, slot), in btrfs_read_node_slot() 1063 orig_ptr = btrfs_node_blockptr(mid, orig_slot); in balance_level() 1280 btrfs_node_blockptr(path->nodes[level], path->slots[level])) in balance_level() 1487 search = btrfs_node_blockptr(node, slot); in reada_for_search() 1520 search = btrfs_node_blockptr(node, nr); in reada_for_search() 1634 blocknr = btrfs_node_blockptr(*eb_ret, slot); in read_block_for_search()
|
H A D | relocation.c | 1279 old_bytenr = btrfs_node_blockptr(parent, slot); in replace_path() 1285 new_bytenr = btrfs_node_blockptr(eb, in replace_path() 2444 bytenr = btrfs_node_blockptr(upper->eb, slot); in do_relocation() 2480 bytenr = btrfs_node_blockptr(upper->eb, slot); in do_relocation()
|
H A D | tree-mod-log.c | 215 tm->blockptr = btrfs_node_blockptr(eb, slot); in alloc_tree_mod_elem()
|
H A D | qgroup.c | 2436 child_bytenr = btrfs_node_blockptr(eb, parent_slot); in btrfs_qgroup_trace_subtree() 4288 block->subvol_bytenr = btrfs_node_blockptr(reloc_parent, reloc_slot); in btrfs_qgroup_add_swapped_blocks() 4291 block->reloc_bytenr = btrfs_node_blockptr(subvol_parent, subvol_slot); in btrfs_qgroup_add_swapped_blocks()
|
H A D | accessors.h | 378 static inline u64 btrfs_node_blockptr(const struct extent_buffer *eb, int nr) in btrfs_node_blockptr() function
|
H A D | extent-tree.c | 2469 bytenr = btrfs_node_blockptr(buf, i); in __btrfs_mod_ref() 5070 bytenr = btrfs_node_blockptr(eb, slot); in reada_walk_down() 5262 bytenr = btrfs_node_blockptr(path->nodes[level], path->slots[level]); in do_walk_down()
|
H A D | tree-checker.c | 1887 bytenr = btrfs_node_blockptr(node, slot); in __btrfs_check_node()
|
H A D | backref.c | 3267 if (btrfs_node_blockptr(eb, path->slots[level]) != cur->bytenr) { in handle_indirect_tree_backref()
|
H A D | extent_io.c | 4761 btrfs_node_blockptr(node, slot), in btrfs_readahead_node_child()
|
H A D | send.c | 7899 left_blockptr = btrfs_node_blockptr( in btrfs_compare_trees() 7902 right_blockptr = btrfs_node_blockptr( in btrfs_compare_trees()
|
H A D | tree-log.c | 2611 bytenr = btrfs_node_blockptr(cur, path->slots[*level]); in walk_down_log_tree()
|