Home
last modified time | relevance | path

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

/linux/fs/btrfs/
H A Dtree-mod-log.c408 int nritems) in tree_mod_log_free_eb() argument
413 for (i = nritems - 1; i >= 0; i--) { in tree_mod_log_free_eb()
416 for (j = nritems - 1; j > i; j--) in tree_mod_log_free_eb()
433 int nritems = 0; in btrfs_tree_mod_log_insert_root() local
441 nritems = btrfs_header_nritems(old_root); in btrfs_tree_mod_log_insert_root()
442 tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *), in btrfs_tree_mod_log_insert_root()
448 for (i = 0; i < nritems; i++) { in btrfs_tree_mod_log_insert_root()
487 ret = tree_mod_log_free_eb(fs_info, tm_list, nritems); in btrfs_tree_mod_log_insert_root()
501 for (i = 0; i < nritems; i++) in btrfs_tree_mod_log_insert_root()
709 int nritems = 0; in btrfs_tree_mod_log_free_eb() local
[all …]
H A Drelocation.c868 u32 nritems; in replace_file_extents() local
882 nritems = btrfs_header_nritems(leaf); in replace_file_extents()
883 for (i = 0; i < nritems; i++) { in replace_file_extents()
1253 u32 nritems; in walk_up_reloc_tree() local
1264 nritems = btrfs_header_nritems(eb); in walk_up_reloc_tree()
1265 while (path->slots[i] + 1 < nritems) { in walk_up_reloc_tree()
1291 u32 nritems; in walk_down_reloc_tree() local
1297 nritems = btrfs_header_nritems(eb); in walk_down_reloc_tree()
1298 while (path->slots[i] < nritems) { in walk_down_reloc_tree()
1304 if (path->slots[i] >= nritems) { in walk_down_reloc_tree()
H A Dtree-checker.c1979 u32 nritems = btrfs_header_nritems(leaf); in __btrfs_check_leaf() local
2002 if (nritems == 0 && !btrfs_header_flag(leaf, BTRFS_HEADER_FLAG_RELOC)) { in __btrfs_check_leaf()
2038 if (unlikely(nritems == 0)) in __btrfs_check_leaf()
2052 for (slot = 0; slot < nritems; slot++) { in __btrfs_check_leaf()
H A Dref-verify.c501 int nritems = btrfs_header_nritems(leaf); in process_leaf() local
503 for (i = 0; i < nritems; i++) { in process_leaf()
H A Dextent_io.c2188 u32 nritems; in prepare_eb_write() local
2195 nritems = btrfs_header_nritems(eb); in prepare_eb_write()
2197 end = btrfs_node_key_ptr_offset(eb, nritems); in prepare_eb_write()
2204 start = btrfs_item_nr_offset(eb, nritems); in prepare_eb_write()
2206 if (nritems == 0) in prepare_eb_write()
2209 end += btrfs_item_offset(eb, nritems - 1); in prepare_eb_write()
H A Dsend.c7361 const int nritems = btrfs_header_nritems(parent); in tree_move_down() local
7380 for (slot++; slot < nritems && reada_done < reada_max; slot++) { in tree_move_down()
7401 int nritems; in tree_move_next_or_upnext() local
7402 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
7406 while (path->slots[*level] >= nritems) { in tree_move_next_or_upnext()
7408 path->slots[*level] = nritems - 1; in tree_move_next_or_upnext()
7419 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
H A Dioctl.c1473 int nritems; in copy_to_sk() local
1480 nritems = btrfs_header_nritems(leaf); in copy_to_sk()
1483 i = nritems; in copy_to_sk()
1488 for (i = slot; i < nritems; i++) { in copy_to_sk()
/linux/include/uapi/linux/
H A Dbtrfs_tree.h494 __le32 nritems; member