Home
last modified time | relevance | path

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

/openbmc/linux/fs/btrfs/
H A Dctree.c1456 u32 nritems; in reada_for_search() local
1537 int nritems; in reada_for_balance() local
1590 if (nritems < 1 || path->slots[i] >= nritems - 1) { in unlock_up()
3048 int nritems; in insert_ptr() local
3224 leaf_space_used(leaf, 0, nritems), nritems); in btrfs_leaf_free_space()
3663 nritems = nritems - mid; in copy_for_split()
3726 u32 nritems; in push_for_double_split() local
3786 u32 nritems; in split_leaf() local
4037 u32 nritems; in split_item() local
4535 nritems--; in btrfs_del_ptr()
[all …]
H A Dtree-mod-log.c372 int nritems) in tree_mod_log_free_eb() argument
377 for (i = nritems - 1; i >= 0; i--) { in tree_mod_log_free_eb()
380 for (j = nritems - 1; j > i; j--) in tree_mod_log_free_eb()
397 int nritems = 0; in btrfs_tree_mod_log_insert_root() local
405 nritems = btrfs_header_nritems(old_root); in btrfs_tree_mod_log_insert_root()
412 for (i = 0; i < nritems; i++) { in btrfs_tree_mod_log_insert_root()
465 for (i = 0; i < nritems; i++) in btrfs_tree_mod_log_insert_root()
673 int nritems = 0; in btrfs_tree_mod_log_free_eb() local
680 nritems = btrfs_header_nritems(eb); in btrfs_tree_mod_log_free_eb()
687 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.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()
3660 for (; i < nritems; i++) { in process_dir_items_leaf()
5018 int nritems = btrfs_header_nritems(leaf); in btrfs_log_all_xattrs() local
[all …]
H 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()
H A Drelocation.c1078 u32 nritems; in replace_file_extents() local
1093 nritems = btrfs_header_nritems(leaf); in replace_file_extents()
1094 for (i = 0; i < nritems; i++) { in replace_file_extents()
1444 u32 nritems; in walk_up_reloc_tree() local
1455 nritems = btrfs_header_nritems(eb); in walk_up_reloc_tree()
1456 while (path->slots[i] + 1 < nritems) { in walk_up_reloc_tree()
1482 u32 nritems; in walk_down_reloc_tree() local
1488 nritems = btrfs_header_nritems(eb); in walk_down_reloc_tree()
1489 while (path->slots[i] < nritems) { in walk_down_reloc_tree()
1495 if (path->slots[i] >= nritems) { in walk_down_reloc_tree()
H A Dfile-item.c1012 const u32 nritems = btrfs_header_nritems(path->nodes[0]); in find_next_csum_offset() local
1017 if (nritems == 0 || slot >= nritems) { in find_next_csum_offset()
H A Dtree-checker.c1701 u32 nritems = btrfs_header_nritems(leaf); in __btrfs_check_leaf() local
1719 if (nritems == 0 && !btrfs_header_flag(leaf, BTRFS_HEADER_FLAG_RELOC)) { in __btrfs_check_leaf()
1755 if (unlikely(nritems == 0)) in __btrfs_check_leaf()
1769 for (slot = 0; slot < nritems; slot++) { in __btrfs_check_leaf()
H A Dref-verify.c511 int nritems = btrfs_header_nritems(leaf); in process_leaf() local
513 for (i = 0; i < nritems; i++) { in process_leaf()
H A Dextent-tree.c440 u32 nritems; in lookup_extent_data_ref() local
469 nritems = btrfs_header_nritems(leaf); in lookup_extent_data_ref()
471 if (path->slots[0] >= nritems) { in lookup_extent_data_ref()
479 nritems = btrfs_header_nritems(leaf); in lookup_extent_data_ref()
2412 u32 nritems; in __btrfs_mod_ref() local
2426 nritems = btrfs_header_nritems(buf); in __btrfs_mod_ref()
2441 for (i = 0; i < nritems; i++) { in __btrfs_mod_ref()
5046 u32 nritems; in reada_walk_down() local
5063 nritems = btrfs_header_nritems(eb); in reada_walk_down()
5065 for (slot = path->slots[wc->level]; slot < nritems; slot++) { in reada_walk_down()
H A Daccessors.h666 BTRFS_SETGET_HEADER_FUNCS(header_nritems, struct btrfs_header, nritems, 32);
672 BTRFS_SETGET_STACK_FUNCS(stack_header_nritems, struct btrfs_header, nritems, 32);
H A Dextent_io.c1631 u32 nritems; in prepare_eb_write() local
1638 nritems = btrfs_header_nritems(eb); in prepare_eb_write()
1640 end = btrfs_node_key_ptr_offset(eb, nritems); in prepare_eb_write()
1647 start = btrfs_item_nr_offset(eb, nritems); in prepare_eb_write()
1649 if (nritems == 0) in prepare_eb_write()
1652 end += btrfs_item_offset(eb, nritems - 1); in prepare_eb_write()
H A Dblock-group.c712 u32 nritems; in load_extent_tree_free() local
752 nritems = btrfs_header_nritems(leaf); in load_extent_tree_free()
760 if (path->slots[0] < nritems) { in load_extent_tree_free()
784 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.c7435 const int nritems = btrfs_header_nritems(parent); in tree_move_down() local
7454 for (slot++; slot < nritems && reada_done < reada_max; slot++) { in tree_move_down()
7475 int nritems; in tree_move_next_or_upnext() local
7476 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
7480 while (path->slots[*level] >= nritems) { in tree_move_next_or_upnext()
7482 path->slots[*level] = nritems - 1; in tree_move_next_or_upnext()
7493 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
H A Dioctl.c1573 int nritems; in copy_to_sk() local
1580 nritems = btrfs_header_nritems(leaf); in copy_to_sk()
1583 i = nritems; in copy_to_sk()
1588 for (i = slot; i < nritems; i++) { in copy_to_sk()
H A Dinode.c3659 u32 nritems = btrfs_header_nritems(leaf); in acls_after_inode_item() local
3674 while (slot < nritems) { in acls_after_inode_item()
/openbmc/u-boot/fs/btrfs/
H A Dctree.c82 return generic_bin_search(addr, size, key, p->header.nritems, slot); in btrfs_bin_search()
122 + hdr->nritems * sizeof(struct btrfs_key_ptr); in read_tree_node()
140 for (i = 0; i < hdr->nritems; ++i) in read_tree_node()
143 for (i = 0; i < hdr->nritems; ++i) in read_tree_node()
215 if ((dir > 0 && slot + dir >= p.nodes[level]->header.nritems) in jump_leaf()
244 p.slots[level] = p.nodes[level]->header.nritems - 1; in jump_leaf()
275 if (p->slots[0] + 1 >= leaf->header.nritems) in btrfs_next_slot()
H A Dconv-funcs.h159 DEFINE_CONV(btrfs_header, bytenr, flags, generation, owner, nritems)
H A Dctree.h86 __u32 nritems; member
/openbmc/linux/include/uapi/linux/
H A Dbtrfs_tree.h473 __le32 nritems; member