| /openbmc/linux/fs/btrfs/ |
| H A D | ctree.c | 1485 u32 nritems; in reada_for_search() local
1530 nritems = btrfs_header_nritems(node); in reada_for_search()
1541 if (nr >= nritems) in reada_for_search()
1566 int nritems; in reada_for_balance() local
1572 nritems = btrfs_header_nritems(parent); in reada_for_balance()
1577 if (slot + 1 < nritems) in reada_for_balance()
1616 u32 nritems; in unlock_up() local
1618 nritems = btrfs_header_nritems(path->nodes[i]); in unlock_up()
1619 if (nritems < 1 || path->slots[i] >= nritems - 1) { in unlock_up()
3085 int nritems; in insert_ptr() local
[all …]
|
| H A D | tree-mod-log.c | 372 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()
406 tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *), in btrfs_tree_mod_log_insert_root()
412 for (i = 0; i < nritems; i++) { in btrfs_tree_mod_log_insert_root()
451 ret = tree_mod_log_free_eb(fs_info, tm_list, nritems); 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
[all …]
|
| H A D | reflink.c | 347 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 D | tree-log.c | 2050 int nritems; in find_dir_range() local
2087 nritems = btrfs_header_nritems(path->nodes[0]); in find_dir_range()
2089 if (path->slots[0] >= nritems) { in find_dir_range()
2202 int nritems; in replay_xattr_deletes() local
2217 nritems = btrfs_header_nritems(path->nodes[0]); in replay_xattr_deletes()
2218 for (i = path->slots[0]; i < nritems; i++) { in replay_xattr_deletes()
2347 int nritems; in replay_dir_deletes() local
2353 nritems = btrfs_header_nritems(path->nodes[0]); in replay_dir_deletes()
2354 if (path->slots[0] >= nritems) { in replay_dir_deletes()
2408 int nritems; in replay_one_buffer() local
[all …]
|
| H A D | defrag.c | 373 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 D | relocation.c | 1010 u32 nritems; in replace_file_extents() local
1025 nritems = btrfs_header_nritems(leaf); in replace_file_extents()
1026 for (i = 0; i < nritems; i++) { in replace_file_extents()
1376 u32 nritems; in walk_up_reloc_tree() local
1387 nritems = btrfs_header_nritems(eb); in walk_up_reloc_tree()
1388 while (path->slots[i] + 1 < nritems) { in walk_up_reloc_tree()
1414 u32 nritems; in walk_down_reloc_tree() local
1420 nritems = btrfs_header_nritems(eb); in walk_down_reloc_tree()
1421 while (path->slots[i] < nritems) { in walk_down_reloc_tree()
1427 if (path->slots[i] >= nritems) { in walk_down_reloc_tree()
|
| H A D | file-item.c | 1012 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 D | tree-checker.c | 1882 u32 nritems = btrfs_header_nritems(leaf); in __btrfs_check_leaf() local
1900 if (nritems == 0 && !btrfs_header_flag(leaf, BTRFS_HEADER_FLAG_RELOC)) { in __btrfs_check_leaf()
1936 if (unlikely(nritems == 0)) in __btrfs_check_leaf()
1950 for (slot = 0; slot < nritems; slot++) { in __btrfs_check_leaf()
|
| H A D | extent-tree.c | 440 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()
2428 u32 nritems; in __btrfs_mod_ref() local
2442 nritems = btrfs_header_nritems(buf); in __btrfs_mod_ref()
2457 for (i = 0; i < nritems; i++) { in __btrfs_mod_ref()
5065 u32 nritems; in reada_walk_down() local
5082 nritems = btrfs_header_nritems(eb); in reada_walk_down()
5084 for (slot = path->slots[wc->level]; slot < nritems; slot++) { in reada_walk_down()
|
| H A D | ref-verify.c | 511 int nritems = btrfs_header_nritems(leaf); in process_leaf() local
513 for (i = 0; i < nritems; i++) { in process_leaf()
|
| H A D | extent_io.c | 1631 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 D | accessors.h | 666 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 D | block-group.c | 712 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 D | send.c | 7493 const int nritems = btrfs_header_nritems(parent); in tree_move_down() local
7512 for (slot++; slot < nritems && reada_done < reada_max; slot++) { in tree_move_down()
7533 int nritems; in tree_move_next_or_upnext() local
7534 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
7538 while (path->slots[*level] >= nritems) { in tree_move_next_or_upnext()
7540 path->slots[*level] = nritems - 1; in tree_move_next_or_upnext()
7551 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
|
| H A D | backref.c | 112 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 D | ioctl.c | 1575 int nritems; in copy_to_sk() local
1582 nritems = btrfs_header_nritems(leaf); in copy_to_sk()
1585 i = nritems; in copy_to_sk()
1590 for (i = slot; i < nritems; i++) { in copy_to_sk()
|
| H A D | inode.c | 3662 u32 nritems = btrfs_header_nritems(leaf); in acls_after_inode_item() local
3677 while (slot < nritems) { in acls_after_inode_item()
|
| /openbmc/u-boot/fs/btrfs/ |
| H A D | ctree.c | 82 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 D | conv-funcs.h | 159 DEFINE_CONV(btrfs_header, bytenr, flags, generation, owner, nritems)
|
| H A D | ctree.h | 86 __u32 nritems; member
|
| /openbmc/linux/include/uapi/linux/ |
| H A D | btrfs_tree.h | 473 __le32 nritems; member
|