Home
last modified time | relevance | path

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

/linux-6.3-rc2/fs/btrfs/
A Dctree.c1361 u32 nritems; in reada_for_search() local
1442 int nritems; in reada_for_balance() local
1495 if (nritems < 1 || path->slots[i] >= nritems - 1) { in unlock_up()
2869 int nritems; in insert_ptr() local
3030 leaf_space_used(leaf, 0, nritems), nritems); in btrfs_leaf_free_space()
3474 nritems = nritems - mid; in copy_for_split()
3533 u32 nritems; in push_for_double_split() local
3593 u32 nritems; in split_leaf() local
3828 u32 nritems; in split_item() local
4307 nritems--; in del_ptr()
[all …]
A Dtree-mod-log.c328 int nritems) in tree_mod_log_free_eb() argument
333 for (i = nritems - 1; i >= 0; i--) { in tree_mod_log_free_eb()
336 for (j = nritems - 1; j > i; j--) in tree_mod_log_free_eb()
353 int nritems = 0; in btrfs_tree_mod_log_insert_root() local
361 nritems = btrfs_header_nritems(old_root); in btrfs_tree_mod_log_insert_root()
368 for (i = 0; i < nritems; i++) { in btrfs_tree_mod_log_insert_root()
407 for (i = 0; i < nritems; i++) in btrfs_tree_mod_log_insert_root()
556 int nritems = 0; in btrfs_tree_mod_log_free_eb() local
563 nritems = btrfs_header_nritems(eb); in btrfs_tree_mod_log_free_eb()
568 for (i = 0; i < nritems; i++) { in btrfs_tree_mod_log_free_eb()
[all …]
A Dreflink.c348 u32 nritems; in btrfs_clone() local
400 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_clone()
402 if (path->slots[0] >= nritems) { in btrfs_clone()
408 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_clone()
A Dtree-log.c2031 int nritems; in find_dir_range() local
2070 if (path->slots[0] >= nritems) { in find_dir_range()
2183 int nritems; in replay_xattr_deletes() local
2328 int nritems; in replay_dir_deletes() local
2335 if (path->slots[0] >= nritems) { in replay_dir_deletes()
2389 int nritems; in replay_one_buffer() local
2413 nritems = btrfs_header_nritems(eb); in replay_one_buffer()
2414 for (i = 0; i < nritems; i++) { in replay_one_buffer()
3687 for (; i < nritems; i++) { in process_dir_items_leaf()
5044 if (slot >= nritems) { in btrfs_log_all_xattrs()
[all …]
A Ddefrag.c373 u32 nritems; in btrfs_defrag_leaves() local
376 nritems = btrfs_header_nritems(root_node); in btrfs_defrag_leaves()
380 nritems - 1); in btrfs_defrag_leaves()
A Drelocation.c1077 u32 nritems; in replace_file_extents() local
1092 nritems = btrfs_header_nritems(leaf); in replace_file_extents()
1093 for (i = 0; i < nritems; i++) { in replace_file_extents()
1443 u32 nritems; in walk_up_reloc_tree() local
1454 nritems = btrfs_header_nritems(eb); in walk_up_reloc_tree()
1455 while (path->slots[i] + 1 < nritems) { in walk_up_reloc_tree()
1481 u32 nritems; in walk_down_reloc_tree() local
1487 nritems = btrfs_header_nritems(eb); in walk_down_reloc_tree()
1488 while (path->slots[i] < nritems) { in walk_down_reloc_tree()
1494 if (path->slots[i] >= nritems) { in walk_down_reloc_tree()
A Dtree-checker.c1669 u32 nritems = btrfs_header_nritems(leaf); in check_leaf() local
1687 if (nritems == 0 && !btrfs_header_flag(leaf, BTRFS_HEADER_FLAG_RELOC)) { in check_leaf()
1723 if (unlikely(nritems == 0)) in check_leaf()
1737 for (slot = 0; slot < nritems; slot++) { in check_leaf()
A Dfile-item.c1087 const u32 nritems = btrfs_header_nritems(path->nodes[0]); in find_next_csum_offset() local
1092 if (nritems == 0 || slot >= nritems) { in find_next_csum_offset()
A Dextent-tree.c459 u32 nritems; in lookup_extent_data_ref() local
488 nritems = btrfs_header_nritems(leaf); in lookup_extent_data_ref()
490 if (path->slots[0] >= nritems) { in lookup_extent_data_ref()
498 nritems = btrfs_header_nritems(leaf); in lookup_extent_data_ref()
2394 u32 nritems; in __btrfs_mod_ref() local
2408 nritems = btrfs_header_nritems(buf); in __btrfs_mod_ref()
2423 for (i = 0; i < nritems; i++) { in __btrfs_mod_ref()
4999 u32 nritems; in reada_walk_down() local
5016 nritems = btrfs_header_nritems(eb); in reada_walk_down()
5018 for (slot = path->slots[wc->level]; slot < nritems; slot++) { in reada_walk_down()
A Dref-verify.c511 int nritems = btrfs_header_nritems(leaf); in process_leaf() local
513 for (i = 0; i < nritems; i++) { in process_leaf()
A Daccessors.h667 BTRFS_SETGET_HEADER_FUNCS(header_nritems, struct btrfs_header, nritems, 32);
673 BTRFS_SETGET_STACK_FUNCS(stack_header_nritems, struct btrfs_header, nritems, 32);
A Dextent_io.c2085 u32 nritems; in prepare_eb_write() local
2093 nritems = btrfs_header_nritems(eb); in prepare_eb_write()
2095 end = btrfs_node_key_ptr_offset(eb, nritems); in prepare_eb_write()
2102 start = btrfs_item_nr_offset(eb, nritems); in prepare_eb_write()
2104 if (nritems == 0) in prepare_eb_write()
2107 end += btrfs_item_offset(eb, nritems - 1); in prepare_eb_write()
A Dblock-group.c690 u32 nritems; in load_extent_tree_free() local
730 nritems = btrfs_header_nritems(leaf); in load_extent_tree_free()
738 if (path->slots[0] < nritems) { in load_extent_tree_free()
762 nritems = btrfs_header_nritems(leaf); in load_extent_tree_free()
A Dbackref.c111 int nritems; in find_extent_in_eb() local
120 nritems = btrfs_header_nritems(eb); in find_extent_in_eb()
121 for (slot = 0; slot < nritems; ++slot) { in find_extent_in_eb()
A Dsend.c7408 const int nritems = btrfs_header_nritems(parent); in tree_move_down() local
7427 for (slot++; slot < nritems && reada_done < reada_max; slot++) { in tree_move_down()
7448 int nritems; in tree_move_next_or_upnext() local
7449 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
7453 while (path->slots[*level] >= nritems) { in tree_move_next_or_upnext()
7455 path->slots[*level] = nritems - 1; in tree_move_next_or_upnext()
7466 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
A Dioctl.c1541 int nritems; in copy_to_sk() local
1548 nritems = btrfs_header_nritems(leaf); in copy_to_sk()
1551 i = nritems; in copy_to_sk()
1556 for (i = slot; i < nritems; i++) { in copy_to_sk()
A Dinode.c3740 u32 nritems = btrfs_header_nritems(leaf); in acls_after_inode_item() local
3755 while (slot < nritems) { in acls_after_inode_item()
/linux-6.3-rc2/include/uapi/linux/
A Dbtrfs_tree.h469 __le32 nritems; member

Completed in 126 milliseconds