Home
last modified time | relevance | path

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

/OK3568_Linux_fs/kernel/fs/btrfs/
H A Dctree.c558 int nritems) in __tree_mod_log_free_eb() argument
563 for (i = nritems - 1; i >= 0; i--) { in __tree_mod_log_free_eb()
566 for (j = nritems - 1; j > i; j--) in __tree_mod_log_free_eb()
582 int nritems = 0; in tree_mod_log_insert_root() local
590 nritems = btrfs_header_nritems(old_root); in tree_mod_log_insert_root()
591 tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *), in tree_mod_log_insert_root()
597 for (i = 0; i < nritems; i++) { in tree_mod_log_insert_root()
623 ret = __tree_mod_log_free_eb(fs_info, tm_list, nritems); in tree_mod_log_insert_root()
636 for (i = 0; i < nritems; i++) in tree_mod_log_insert_root()
784 int nritems = 0; in tree_mod_log_free_eb() local
[all …]
H A 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()
H A 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()
H A Dreflink.c338 u32 nritems; in btrfs_clone() local
391 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_clone()
393 if (path->slots[0] >= nritems) { in btrfs_clone()
399 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_clone()
H A Dtree-log.c2173 int nritems; in find_dir_range() local
2210 nritems = btrfs_header_nritems(path->nodes[0]); in find_dir_range()
2212 if (path->slots[0] >= nritems) { in find_dir_range()
2352 int nritems; in replay_xattr_deletes() local
2367 nritems = btrfs_header_nritems(path->nodes[0]); in replay_xattr_deletes()
2368 for (i = path->slots[0]; i < nritems; i++) { in replay_xattr_deletes()
2498 int nritems; in replay_dir_deletes() local
2504 nritems = btrfs_header_nritems(path->nodes[0]); in replay_dir_deletes()
2505 if (path->slots[0] >= nritems) { in replay_dir_deletes()
2565 int nritems; in replay_one_buffer() local
[all …]
H A 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()
H A Dfile-item.c855 u32 nritems; in btrfs_csum_file_blocks() local
900 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_csum_file_blocks()
901 if (!nritems || (path->slots[0] >= nritems - 1)) { in btrfs_csum_file_blocks()
H A Drelocation.c1057 u32 nritems; in replace_file_extents() local
1072 nritems = btrfs_header_nritems(leaf); in replace_file_extents()
1073 for (i = 0; i < nritems; i++) { in replace_file_extents()
1405 u32 nritems; in walk_up_reloc_tree() local
1416 nritems = btrfs_header_nritems(eb); in walk_up_reloc_tree()
1417 while (path->slots[i] + 1 < nritems) { in walk_up_reloc_tree()
1445 u32 nritems; in walk_down_reloc_tree() local
1453 nritems = btrfs_header_nritems(eb); in walk_down_reloc_tree()
1454 while (path->slots[i] < nritems) { in walk_down_reloc_tree()
1460 if (path->slots[i] >= nritems) { in walk_down_reloc_tree()
H A Dtree-checker.c1591 u32 nritems = btrfs_header_nritems(leaf); in check_leaf() local
1609 if (nritems == 0 && !btrfs_header_flag(leaf, BTRFS_HEADER_FLAG_RELOC)) { in check_leaf()
1633 if (nritems == 0) in check_leaf()
1647 for (slot = 0; slot < nritems; slot++) { in check_leaf()
H A Dextent-tree.c448 u32 nritems; in lookup_extent_data_ref() local
477 nritems = btrfs_header_nritems(leaf); in lookup_extent_data_ref()
479 if (path->slots[0] >= nritems) { in lookup_extent_data_ref()
487 nritems = btrfs_header_nritems(leaf); in lookup_extent_data_ref()
2392 u32 nritems; in __btrfs_mod_ref() local
2406 nritems = btrfs_header_nritems(buf); in __btrfs_mod_ref()
2421 for (i = 0; i < nritems; i++) { in __btrfs_mod_ref()
4756 u32 nritems; in reada_walk_down() local
4773 nritems = btrfs_header_nritems(eb); in reada_walk_down()
4775 for (slot = path->slots[wc->level]; slot < nritems; slot++) { in reada_walk_down()
H A Dref-verify.c507 int nritems = btrfs_header_nritems(leaf); in process_leaf() local
509 for (i = 0; i < nritems; i++) { in process_leaf()
H A Dblock-group.c503 u32 nritems; in load_extent_tree_free() local
542 nritems = btrfs_header_nritems(leaf); in load_extent_tree_free()
550 if (path->slots[0] < nritems) { in load_extent_tree_free()
576 nritems = btrfs_header_nritems(leaf); in load_extent_tree_free()
H A Dbackref.c84 int nritems; in find_extent_in_eb() local
93 nritems = btrfs_header_nritems(eb); in find_extent_in_eb()
94 for (slot = 0; slot < nritems; ++slot) { in find_extent_in_eb()
H A Dctree.h173 __le32 nritems; member
2040 BTRFS_SETGET_HEADER_FUNCS(header_nritems, struct btrfs_header, nritems, 32);
2047 nritems, 32);
H A Dioctl.c2118 int nritems; in copy_to_sk() local
2125 nritems = btrfs_header_nritems(leaf); in copy_to_sk()
2128 i = nritems; in copy_to_sk()
2133 for (i = slot; i < nritems; i++) { in copy_to_sk()
H A Dextent_io.c3876 u32 nritems; in write_one_eb() local
3887 nritems = btrfs_header_nritems(eb); in write_one_eb()
3889 end = btrfs_node_key_ptr_offset(nritems); in write_one_eb()
3897 start = btrfs_item_nr_offset(nritems); in write_one_eb()
H A Dsend.c6767 int nritems; in tree_move_next_or_upnext() local
6768 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
6772 while (path->slots[*level] >= nritems) { in tree_move_next_or_upnext()
6783 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
H A Dinode.c3219 u32 nritems = btrfs_header_nritems(leaf); in acls_after_inode_item() local
3234 while (slot < nritems) { in acls_after_inode_item()