Home
last modified time | relevance | path

Searched refs:nritems (Results 1 – 17 of 17) sorted by relevance

/fs/btrfs/
Dctree.c597 int nritems) in __tree_mod_log_free_eb() argument
602 for (i = nritems - 1; i >= 0; i--) { in __tree_mod_log_free_eb()
605 for (j = nritems - 1; j > i; j--) in __tree_mod_log_free_eb()
621 int nritems = 0; in tree_mod_log_insert_root() local
629 nritems = btrfs_header_nritems(old_root); in tree_mod_log_insert_root()
630 tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *), in tree_mod_log_insert_root()
636 for (i = 0; i < nritems; i++) { in tree_mod_log_insert_root()
662 ret = __tree_mod_log_free_eb(fs_info, tm_list, nritems); in tree_mod_log_insert_root()
675 for (i = 0; i < nritems; i++) in tree_mod_log_insert_root()
823 int nritems = 0; in tree_mod_log_free_eb() local
[all …]
Dtree-defrag.c52 u32 nritems; in btrfs_defrag_leaves() local
56 nritems = btrfs_header_nritems(root_node); in btrfs_defrag_leaves()
60 nritems - 1); in btrfs_defrag_leaves()
Ddir-item.c303 u32 nritems; in btrfs_search_dir_index_item() local
315 nritems = btrfs_header_nritems(leaf); in btrfs_search_dir_index_item()
318 if (path->slots[0] >= nritems) { in btrfs_search_dir_index_item()
325 nritems = btrfs_header_nritems(leaf); in btrfs_search_dir_index_item()
Dtree-log.c2148 int nritems; in find_dir_range() local
2185 nritems = btrfs_header_nritems(path->nodes[0]); in find_dir_range()
2187 if (path->slots[0] >= nritems) { in find_dir_range()
2327 int nritems; in replay_xattr_deletes() local
2342 nritems = btrfs_header_nritems(path->nodes[0]); in replay_xattr_deletes()
2343 for (i = path->slots[0]; i < nritems; i++) { in replay_xattr_deletes()
2471 int nritems; in replay_dir_deletes() local
2477 nritems = btrfs_header_nritems(path->nodes[0]); in replay_dir_deletes()
2478 if (path->slots[0] >= nritems) { in replay_dir_deletes()
2538 int nritems; in replay_one_buffer() local
[all …]
Drelocation.c1674 u32 nritems; in replace_file_extents() local
1689 nritems = btrfs_header_nritems(leaf); in replace_file_extents()
1690 for (i = 0; i < nritems; i++) { in replace_file_extents()
2019 u32 nritems; in walk_up_reloc_tree() local
2030 nritems = btrfs_header_nritems(eb); in walk_up_reloc_tree()
2031 while (path->slots[i] + 1 < nritems) { in walk_up_reloc_tree()
2059 u32 nritems; in walk_down_reloc_tree() local
2067 nritems = btrfs_header_nritems(eb); in walk_down_reloc_tree()
2068 while (path->slots[i] < nritems) { in walk_down_reloc_tree()
2074 if (path->slots[i] >= nritems) { in walk_down_reloc_tree()
[all …]
Dreada.c98 int nritems; in __readahead_hook() local
131 nritems = btrfs_header_nritems(eb); in __readahead_hook()
133 for (i = 0; i < nritems; i++) { in __readahead_hook()
140 if (i + 1 < nritems) in __readahead_hook()
Dfile-item.c752 u32 nritems; in btrfs_csum_file_blocks() local
797 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_csum_file_blocks()
798 if (!nritems || (path->slots[0] >= nritems - 1)) { in btrfs_csum_file_blocks()
Dtree-checker.c1301 u32 nritems = btrfs_header_nritems(leaf); in check_leaf() local
1319 if (nritems == 0 && !btrfs_header_flag(leaf, BTRFS_HEADER_FLAG_RELOC)) { in check_leaf()
1343 if (nritems == 0) in check_leaf()
1357 for (slot = 0; slot < nritems; slot++) { in check_leaf()
Dextent-tree.c486 u32 nritems; in lookup_extent_data_ref() local
515 nritems = btrfs_header_nritems(leaf); in lookup_extent_data_ref()
517 if (path->slots[0] >= nritems) { in lookup_extent_data_ref()
525 nritems = btrfs_header_nritems(leaf); in lookup_extent_data_ref()
2427 u32 nritems; in __btrfs_mod_ref() local
2441 nritems = btrfs_header_nritems(buf); in __btrfs_mod_ref()
2456 for (i = 0; i < nritems; i++) { in __btrfs_mod_ref()
4603 u32 nritems; in reada_walk_down() local
4620 nritems = btrfs_header_nritems(eb); in reada_walk_down()
4622 for (slot = path->slots[wc->level]; slot < nritems; slot++) { in reada_walk_down()
Dref-verify.c505 int nritems = btrfs_header_nritems(leaf); in process_leaf() local
507 for (i = 0; i < nritems; i++) { in process_leaf()
Dioctl.c2044 int nritems; in copy_to_sk() local
2051 nritems = btrfs_header_nritems(leaf); in copy_to_sk()
2054 i = nritems; in copy_to_sk()
2059 for (i = slot; i < nritems; i++) { in copy_to_sk()
3505 u32 nritems; in btrfs_clone() local
3560 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_clone()
3562 if (path->slots[0] >= nritems) { in btrfs_clone()
3568 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_clone()
Dbackref.c83 int nritems; in find_extent_in_eb() local
92 nritems = btrfs_header_nritems(eb); in find_extent_in_eb()
93 for (slot = 0; slot < nritems; ++slot) { in find_extent_in_eb()
Dblock-group.c502 u32 nritems; in load_extent_tree_free() local
541 nritems = btrfs_header_nritems(leaf); in load_extent_tree_free()
549 if (path->slots[0] < nritems) { in load_extent_tree_free()
575 nritems = btrfs_header_nritems(leaf); in load_extent_tree_free()
Dctree.h163 __le32 nritems; member
1884 BTRFS_SETGET_HEADER_FUNCS(header_nritems, struct btrfs_header, nritems, 32);
1891 nritems, 32);
Dextent_io.c3855 u32 nritems; in write_one_eb() local
3866 nritems = btrfs_header_nritems(eb); in write_one_eb()
3868 end = btrfs_node_key_ptr_offset(nritems); in write_one_eb()
3876 start = btrfs_item_nr_offset(nritems); in write_one_eb()
Dsend.c6574 int nritems; in tree_move_next_or_upnext() local
6575 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
6579 while (path->slots[*level] >= nritems) { in tree_move_next_or_upnext()
6590 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
Dinode.c3659 u32 nritems = btrfs_header_nritems(leaf); in acls_after_inode_item() local
3674 while (slot < nritems) { in acls_after_inode_item()