| /linux-6.1.9/fs/btrfs/ |
| D | ctree.c | 1255 u32 nritems; in reada_for_search() local
1300 nritems = btrfs_header_nritems(node); in reada_for_search()
1311 if (nr >= nritems) in reada_for_search()
1336 int nritems; in reada_for_balance() local
1342 nritems = btrfs_header_nritems(parent); in reada_for_balance()
1347 if (slot + 1 < nritems) in reada_for_balance()
1386 u32 nritems; in unlock_up() local
1388 nritems = btrfs_header_nritems(path->nodes[i]); in unlock_up()
1389 if (nritems < 1 || path->slots[i] >= nritems - 1) { in unlock_up()
2758 int nritems; in insert_ptr() local
[all …]
|
| D | tree-mod-log.c | 325 int nritems) in tree_mod_log_free_eb() argument
330 for (i = nritems - 1; i >= 0; i--) { in tree_mod_log_free_eb()
333 for (j = nritems - 1; j > i; j--) in tree_mod_log_free_eb()
350 int nritems = 0; in btrfs_tree_mod_log_insert_root() local
358 nritems = btrfs_header_nritems(old_root); in btrfs_tree_mod_log_insert_root()
359 tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *), in btrfs_tree_mod_log_insert_root()
365 for (i = 0; i < nritems; i++) { in btrfs_tree_mod_log_insert_root()
391 ret = tree_mod_log_free_eb(fs_info, tm_list, nritems); in btrfs_tree_mod_log_insert_root()
404 for (i = 0; i < nritems; i++) in btrfs_tree_mod_log_insert_root()
553 int nritems = 0; in btrfs_tree_mod_log_free_eb() local
[all …]
|
| D | tree-defrag.c | 46 u32 nritems; in btrfs_defrag_leaves() local
49 nritems = btrfs_header_nritems(root_node); in btrfs_defrag_leaves()
53 nritems - 1); in btrfs_defrag_leaves()
|
| D | reflink.c | 342 u32 nritems; in btrfs_clone() local
394 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_clone()
396 if (path->slots[0] >= nritems) { in btrfs_clone()
402 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_clone()
|
| D | tree-log.c | 2067 int nritems; in find_dir_range() local
2104 nritems = btrfs_header_nritems(path->nodes[0]); in find_dir_range()
2106 if (path->slots[0] >= nritems) { in find_dir_range()
2226 int nritems; in replay_xattr_deletes() local
2241 nritems = btrfs_header_nritems(path->nodes[0]); in replay_xattr_deletes()
2242 for (i = path->slots[0]; i < nritems; i++) { in replay_xattr_deletes()
2371 int nritems; in replay_dir_deletes() local
2377 nritems = btrfs_header_nritems(path->nodes[0]); in replay_dir_deletes()
2378 if (path->slots[0] >= nritems) { in replay_dir_deletes()
2432 int nritems; in replay_one_buffer() local
[all …]
|
| D | relocation.c | 1068 u32 nritems; in replace_file_extents() local
1083 nritems = btrfs_header_nritems(leaf); in replace_file_extents()
1084 for (i = 0; i < nritems; i++) { in replace_file_extents()
1431 u32 nritems; in walk_up_reloc_tree() local
1442 nritems = btrfs_header_nritems(eb); in walk_up_reloc_tree()
1443 while (path->slots[i] + 1 < nritems) { in walk_up_reloc_tree()
1469 u32 nritems; in walk_down_reloc_tree() local
1475 nritems = btrfs_header_nritems(eb); in walk_down_reloc_tree()
1476 while (path->slots[i] < nritems) { in walk_down_reloc_tree()
1482 if (path->slots[i] >= nritems) { in walk_down_reloc_tree()
|
| D | file-item.c | 957 const u32 nritems = btrfs_header_nritems(path->nodes[0]); in find_next_csum_offset() local
962 if (nritems == 0 || slot >= nritems) { in find_next_csum_offset()
|
| D | tree-checker.c | 1665 u32 nritems = btrfs_header_nritems(leaf); in check_leaf() local
1683 if (nritems == 0 && !btrfs_header_flag(leaf, BTRFS_HEADER_FLAG_RELOC)) { in check_leaf()
1719 if (unlikely(nritems == 0)) in check_leaf()
1733 for (slot = 0; slot < nritems; slot++) { in check_leaf()
|
| D | extent-tree.c | 453 u32 nritems; in lookup_extent_data_ref() local
482 nritems = btrfs_header_nritems(leaf); in lookup_extent_data_ref()
484 if (path->slots[0] >= nritems) { in lookup_extent_data_ref()
492 nritems = btrfs_header_nritems(leaf); in lookup_extent_data_ref()
2388 u32 nritems; in __btrfs_mod_ref() local
2402 nritems = btrfs_header_nritems(buf); in __btrfs_mod_ref()
2417 for (i = 0; i < nritems; i++) { in __btrfs_mod_ref()
5066 u32 nritems; in reada_walk_down() local
5083 nritems = btrfs_header_nritems(eb); in reada_walk_down()
5085 for (slot = path->slots[wc->level]; slot < nritems; slot++) { in reada_walk_down()
|
| D | ref-verify.c | 508 int nritems = btrfs_header_nritems(leaf); in process_leaf() local
510 for (i = 0; i < nritems; i++) { in process_leaf()
|
| D | block-group.c | 539 u32 nritems; in load_extent_tree_free() local
579 nritems = btrfs_header_nritems(leaf); in load_extent_tree_free()
587 if (path->slots[0] < nritems) { in load_extent_tree_free()
611 nritems = btrfs_header_nritems(leaf); in load_extent_tree_free()
|
| D | backref.c | 85 int nritems; in find_extent_in_eb() local
94 nritems = btrfs_header_nritems(eb); in find_extent_in_eb()
95 for (slot = 0; slot < nritems; ++slot) { in find_extent_in_eb()
|
| D | send.c | 7157 const int nritems = btrfs_header_nritems(parent); in tree_move_down() local
7176 for (slot++; slot < nritems && reada_done < reada_max; slot++) { in tree_move_down()
7197 int nritems; in tree_move_next_or_upnext() local
7198 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
7202 while (path->slots[*level] >= nritems) { in tree_move_next_or_upnext()
7204 path->slots[*level] = nritems - 1; in tree_move_next_or_upnext()
7215 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
|
| D | extent_io.c | 2649 u32 nritems; in prepare_eb_write() local
2657 nritems = btrfs_header_nritems(eb); in prepare_eb_write()
2659 end = btrfs_node_key_ptr_offset(nritems); in prepare_eb_write()
2666 start = btrfs_item_nr_offset(nritems); in prepare_eb_write()
|
| D | ioctl.c | 2432 int nritems; in copy_to_sk() local
2439 nritems = btrfs_header_nritems(leaf); in copy_to_sk()
2442 i = nritems; in copy_to_sk()
2447 for (i = slot; i < nritems; i++) { in copy_to_sk()
|
| D | ctree.h | 174 __le32 nritems; member
2374 BTRFS_SETGET_HEADER_FUNCS(header_nritems, struct btrfs_header, nritems, 32);
2381 nritems, 32);
|
| D | inode.c | 3868 u32 nritems = btrfs_header_nritems(leaf); in acls_after_inode_item() local
3883 while (slot < nritems) { in acls_after_inode_item()
|