Home
last modified time | relevance | path

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

/linux/fs/btrfs/
H A Dctree.c1346 u32 nritems; in reada_for_search() local
1391 nritems = btrfs_header_nritems(node); in reada_for_search()
1402 if (nr >= nritems) in reada_for_search()
1427 int nritems; in reada_for_balance() local
1433 nritems = btrfs_header_nritems(parent); in reada_for_balance()
1438 if (slot + 1 < nritems) in reada_for_balance()
1477 u32 nritems; in unlock_up() local
1479 nritems = btrfs_header_nritems(path->nodes[i]); in unlock_up()
1480 if (nritems < 1 || path->slots[i] >= nritems - 1) { in unlock_up()
2936 int nritems; in insert_ptr() local
[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()
405 tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *), in btrfs_tree_mod_log_insert_root()
411 for (i = 0; i < nritems; i++) { in btrfs_tree_mod_log_insert_root()
450 ret = tree_mod_log_free_eb(fs_info, tm_list, nritems); 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
[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.c2049 int nritems; in find_dir_range() local
2086 nritems = btrfs_header_nritems(path->nodes[0]); in find_dir_range()
2088 if (path->slots[0] >= nritems) { in find_dir_range()
2201 int nritems; in replay_xattr_deletes() local
2216 nritems = btrfs_header_nritems(path->nodes[0]); in replay_xattr_deletes()
2217 for (i = path->slots[0]; i < nritems; i++) { in replay_xattr_deletes()
2346 int nritems; in replay_dir_deletes() local
2352 nritems = btrfs_header_nritems(path->nodes[0]); in replay_dir_deletes()
2353 if (path->slots[0] >= nritems) { in replay_dir_deletes()
2407 int nritems; in replay_one_buffer() local
[all …]
H A Drelocation.c1016 u32 nritems; in replace_file_extents() local
1031 nritems = btrfs_header_nritems(leaf); in replace_file_extents()
1032 for (i = 0; i < nritems; i++) { in replace_file_extents()
1407 u32 nritems; in walk_up_reloc_tree() local
1418 nritems = btrfs_header_nritems(eb); in walk_up_reloc_tree()
1419 while (path->slots[i] + 1 < nritems) { in walk_up_reloc_tree()
1445 u32 nritems; in walk_down_reloc_tree() local
1451 nritems = btrfs_header_nritems(eb); in walk_down_reloc_tree()
1452 while (path->slots[i] < nritems) { in walk_down_reloc_tree()
1458 if (path->slots[i] >= nritems) { in walk_down_reloc_tree()
H A Dfile-item.c1023 const u32 nritems = btrfs_header_nritems(path->nodes[0]); in find_next_csum_offset() local
1028 if (nritems == 0 || slot >= nritems) { in find_next_csum_offset()
H A Ddefrag.c466 u32 nritems; in btrfs_defrag_leaves() local
469 nritems = btrfs_header_nritems(root_node); in btrfs_defrag_leaves()
473 nritems - 1); in btrfs_defrag_leaves()
H A Dtree-checker.c1906 u32 nritems = btrfs_header_nritems(leaf); in __btrfs_check_leaf() local
1929 if (nritems == 0 && !btrfs_header_flag(leaf, BTRFS_HEADER_FLAG_RELOC)) { in __btrfs_check_leaf()
1965 if (unlikely(nritems == 0)) in __btrfs_check_leaf()
1979 for (slot = 0; slot < nritems; slot++) { in __btrfs_check_leaf()
H A Dextent-tree.c437 u32 nritems; in lookup_extent_data_ref() local
464 nritems = btrfs_header_nritems(leaf); in lookup_extent_data_ref()
466 if (path->slots[0] >= nritems) { in lookup_extent_data_ref()
475 nritems = btrfs_header_nritems(leaf); in lookup_extent_data_ref()
2450 u32 nritems; in __btrfs_mod_ref() local
2463 nritems = btrfs_header_nritems(buf); in __btrfs_mod_ref()
2478 for (i = 0; i < nritems; i++) { in __btrfs_mod_ref()
5320 u32 nritems; in reada_walk_down() local
5336 nritems = btrfs_header_nritems(eb); in reada_walk_down()
5338 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.c1654 u32 nritems; in prepare_eb_write() local
1661 nritems = btrfs_header_nritems(eb); in prepare_eb_write()
1663 end = btrfs_node_key_ptr_offset(eb, nritems); in prepare_eb_write()
1670 start = btrfs_item_nr_offset(eb, nritems); in prepare_eb_write()
1672 if (nritems == 0) in prepare_eb_write()
1675 end += btrfs_item_offset(eb, nritems - 1); in prepare_eb_write()
H A Daccessors.h686 BTRFS_SETGET_HEADER_FUNCS(header_nritems, struct btrfs_header, nritems, 32);
692 BTRFS_SETGET_STACK_FUNCS(stack_header_nritems, struct btrfs_header, nritems, 32);
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 Dsend.c7466 const int nritems = btrfs_header_nritems(parent); in tree_move_down() local
7485 for (slot++; slot < nritems && reada_done < reada_max; slot++) { in tree_move_down()
7506 int nritems; in tree_move_next_or_upnext() local
7507 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
7511 while (path->slots[*level] >= nritems) { in tree_move_next_or_upnext()
7513 path->slots[*level] = nritems - 1; in tree_move_next_or_upnext()
7524 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
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 Dioctl.c1582 int nritems; in copy_to_sk() local
1589 nritems = btrfs_header_nritems(leaf); in copy_to_sk()
1592 i = nritems; in copy_to_sk()
1597 for (i = slot; i < nritems; i++) { in copy_to_sk()
H A Dinode.c3706 u32 nritems = btrfs_header_nritems(leaf); in acls_after_inode_item() local
3721 while (slot < nritems) { in acls_after_inode_item()
/linux/include/uapi/linux/
H A Dbtrfs_tree.h494 __le32 nritems; member