Home
last modified time | relevance | path

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

/linux-6.15/fs/btrfs/
H A Dctree.c1276 u32 nritems; in reada_for_search() local
1357 int nritems; in reada_for_balance() local
1410 if (nritems < 1 || path->slots[i] >= nritems - 1) { in unlock_up()
2908 int nritems; in insert_ptr() local
3084 leaf_space_used(leaf, 0, nritems), nritems); in btrfs_leaf_free_space()
3523 nritems = nritems - mid; in copy_for_split()
3586 u32 nritems; in push_for_double_split() local
3646 u32 nritems; in split_leaf() local
3898 u32 nritems; in split_item() local
4399 nritems--; in btrfs_del_ptr()
[all …]
H A Dtree-mod-log.c371 int nritems) in tree_mod_log_free_eb() argument
376 for (i = nritems - 1; i >= 0; i--) { in tree_mod_log_free_eb()
379 for (j = nritems - 1; j > i; j--) in tree_mod_log_free_eb()
396 int nritems = 0; in btrfs_tree_mod_log_insert_root() local
404 nritems = btrfs_header_nritems(old_root); in btrfs_tree_mod_log_insert_root()
411 for (i = 0; i < nritems; i++) { in btrfs_tree_mod_log_insert_root()
464 for (i = 0; i < nritems; i++) in btrfs_tree_mod_log_insert_root()
672 int nritems = 0; in btrfs_tree_mod_log_free_eb() local
679 nritems = btrfs_header_nritems(eb); in btrfs_tree_mod_log_free_eb()
686 for (i = 0; i < nritems; i++) { in btrfs_tree_mod_log_free_eb()
[all …]
H A Dreflink.c347 u32 nritems; in btrfs_clone() local
399 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_clone()
401 if (path->slots[0] >= nritems) { in btrfs_clone()
407 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_clone()
H A Dtree-log.c2032 int nritems; in find_dir_range() local
2071 if (path->slots[0] >= nritems) { in find_dir_range()
2184 int nritems; in replay_xattr_deletes() local
2200 for (i = path->slots[0]; i < nritems; i++) { in replay_xattr_deletes()
2329 int nritems; in replay_dir_deletes() local
2336 if (path->slots[0] >= nritems) { in replay_dir_deletes()
2390 int nritems; in replay_one_buffer() local
2414 nritems = btrfs_header_nritems(eb); in replay_one_buffer()
2415 for (i = 0; i < nritems; i++) { in replay_one_buffer()
5081 int nritems = btrfs_header_nritems(leaf); in btrfs_log_all_xattrs() local
[all …]
H A Drelocation.c855 u32 nritems; in replace_file_extents() local
869 nritems = btrfs_header_nritems(leaf); in replace_file_extents()
870 for (i = 0; i < nritems; i++) { in replace_file_extents()
1240 u32 nritems; in walk_up_reloc_tree() local
1251 nritems = btrfs_header_nritems(eb); in walk_up_reloc_tree()
1252 while (path->slots[i] + 1 < nritems) { in walk_up_reloc_tree()
1278 u32 nritems; in walk_down_reloc_tree() local
1284 nritems = btrfs_header_nritems(eb); in walk_down_reloc_tree()
1285 while (path->slots[i] < nritems) { in walk_down_reloc_tree()
1291 if (path->slots[i] >= nritems) { in walk_down_reloc_tree()
H A Ddefrag.c468 u32 nritems; in btrfs_defrag_leaves() local
471 nritems = btrfs_header_nritems(root_node); in btrfs_defrag_leaves()
475 nritems - 1); in btrfs_defrag_leaves()
H A Dfile-item.c1017 const u32 nritems = btrfs_header_nritems(path->nodes[0]); in find_next_csum_offset() local
1022 if (nritems == 0 || slot >= nritems) { in find_next_csum_offset()
H A Dtree-checker.c1943 u32 nritems = btrfs_header_nritems(leaf); in __btrfs_check_leaf() local
1966 if (nritems == 0 && !btrfs_header_flag(leaf, BTRFS_HEADER_FLAG_RELOC)) { in __btrfs_check_leaf()
2002 if (unlikely(nritems == 0)) in __btrfs_check_leaf()
2016 for (slot = 0; slot < nritems; slot++) { in __btrfs_check_leaf()
H A Dextent-tree.c433 u32 nritems; in lookup_extent_data_ref() local
460 nritems = btrfs_header_nritems(leaf); in lookup_extent_data_ref()
462 if (path->slots[0] >= nritems) { in lookup_extent_data_ref()
471 nritems = btrfs_header_nritems(leaf); in lookup_extent_data_ref()
2458 u32 nritems; in __btrfs_mod_ref() local
2471 nritems = btrfs_header_nritems(buf); in __btrfs_mod_ref()
2486 for (i = 0; i < nritems; i++) { in __btrfs_mod_ref()
5313 u32 nritems; in reada_walk_down() local
5329 nritems = btrfs_header_nritems(eb); in reada_walk_down()
5331 for (slot = path->slots[wc->level]; slot < nritems; slot++) { in reada_walk_down()
H A Dref-verify.c519 int nritems = btrfs_header_nritems(leaf); in process_leaf() local
521 for (i = 0; i < nritems; i++) { in process_leaf()
H A Dextent_io.c1945 u32 nritems; in prepare_eb_write() local
1952 nritems = btrfs_header_nritems(eb); in prepare_eb_write()
1954 end = btrfs_node_key_ptr_offset(eb, nritems); in prepare_eb_write()
1961 start = btrfs_item_nr_offset(eb, nritems); in prepare_eb_write()
1963 if (nritems == 0) in prepare_eb_write()
1966 end += btrfs_item_offset(eb, nritems - 1); in prepare_eb_write()
H A Daccessors.h687 BTRFS_SETGET_HEADER_FUNCS(header_nritems, struct btrfs_header, nritems, 32);
693 BTRFS_SETGET_STACK_FUNCS(stack_header_nritems, struct btrfs_header, nritems, 32);
H A Dblock-group.c709 u32 nritems; in load_extent_tree_free() local
749 nritems = btrfs_header_nritems(leaf); in load_extent_tree_free()
757 if (path->slots[0] < nritems) { in load_extent_tree_free()
781 nritems = btrfs_header_nritems(leaf); in load_extent_tree_free()
H A Dbackref.c112 int nritems; in find_extent_in_eb() local
121 nritems = btrfs_header_nritems(eb); in find_extent_in_eb()
122 for (slot = 0; slot < nritems; ++slot) { in find_extent_in_eb()
H A Dsend.c7441 const int nritems = btrfs_header_nritems(parent); in tree_move_down() local
7460 for (slot++; slot < nritems && reada_done < reada_max; slot++) { in tree_move_down()
7481 int nritems; in tree_move_next_or_upnext() local
7482 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
7486 while (path->slots[*level] >= nritems) { in tree_move_next_or_upnext()
7488 path->slots[*level] = nritems - 1; in tree_move_next_or_upnext()
7499 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
H A Dioctl.c1487 int nritems; in copy_to_sk() local
1494 nritems = btrfs_header_nritems(leaf); in copy_to_sk()
1497 i = nritems; in copy_to_sk()
1502 for (i = slot; i < nritems; i++) { in copy_to_sk()
H A Dinode.c3759 u32 nritems = btrfs_header_nritems(leaf); in acls_after_inode_item() local
3774 while (slot < nritems) { in acls_after_inode_item()
/linux-6.15/include/uapi/linux/
H A Dbtrfs_tree.h494 __le32 nritems; member