| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | ctree.c | 558 int nritems) in __tree_mod_log_free_eb()
563 for (i = nritems - 1; i >= 0; i--) { in __tree_mod_log_free_eb()
566 for (j = nritems - 1; j > i; j--) in __tree_mod_log_free_eb()
582 int nritems = 0; in tree_mod_log_insert_root() local
590 nritems = btrfs_header_nritems(old_root); in tree_mod_log_insert_root()
591 tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *), in tree_mod_log_insert_root()
597 for (i = 0; i < nritems; i++) { in tree_mod_log_insert_root()
623 ret = __tree_mod_log_free_eb(fs_info, tm_list, nritems); in tree_mod_log_insert_root()
636 for (i = 0; i < nritems; i++) in tree_mod_log_insert_root()
784 int nritems in tree_mod_log_free_eb() local
556 __tree_mod_log_free_eb(struct btrfs_fs_info *fs_info, struct tree_mod_elem **tm_list, int nritems) __tree_mod_log_free_eb() argument
2223 u32 nritems; reada_for_search() local
2284 int nritems; reada_for_balance() local
2359 u32 nritems; unlock_up() local
3498 int nritems; insert_ptr() local
3634 int nritems = btrfs_header_nritems(l); leaf_space_used() local
3657 int nritems = btrfs_header_nritems(leaf); btrfs_leaf_free_space() local
4138 copy_for_split(struct btrfs_trans_handle *trans, struct btrfs_path *path, struct extent_buffer *l, struct extent_buffer *right, int slot, int mid, int nritems) copy_for_split() argument
4215 u32 nritems; push_for_double_split() local
4275 u32 nritems; split_leaf() local
4513 u32 nritems; split_item() local
4649 u32 nritems; btrfs_truncate_item() local
4745 u32 nritems; btrfs_extend_item() local
4820 u32 nritems; setup_items_for_insert() local
4976 u32 nritems; del_ptr() local
5057 u32 nritems; btrfs_del_items() local
5263 u32 nritems; btrfs_search_forward() local
5455 u32 nritems; btrfs_next_old_leaf() local
5632 u32 nritems; btrfs_previous_item() local
5674 u32 nritems; btrfs_previous_extent_item() local
[all...] |
| H A D | tree-defrag.c | 52 u32 nritems; in btrfs_defrag_leaves() local
56 nritems = btrfs_header_nritems(root_node); in btrfs_defrag_leaves()
60 nritems - 1); in btrfs_defrag_leaves()
|
| H A D | dir-item.c | 303 u32 nritems; in btrfs_search_dir_index_item() local
315 nritems = btrfs_header_nritems(leaf); in btrfs_search_dir_index_item()
318 if (path->slots[0] >= nritems) { in btrfs_search_dir_index_item()
325 nritems = btrfs_header_nritems(leaf); in btrfs_search_dir_index_item()
|
| H A D | tree-log.c | 2173 int nritems; in find_dir_range() local
2210 nritems = btrfs_header_nritems(path->nodes[0]); in find_dir_range()
2212 if (path->slots[0] >= nritems) { in find_dir_range()
2352 int nritems; in replay_xattr_deletes() local
2367 nritems = btrfs_header_nritems(path->nodes[0]); in replay_xattr_deletes()
2368 for (i = path->slots[0]; i < nritems; i++) { in replay_xattr_deletes()
2498 int nritems; in replay_dir_deletes() local
2504 nritems = btrfs_header_nritems(path->nodes[0]); in replay_dir_deletes()
2505 if (path->slots[0] >= nritems) { in replay_dir_deletes()
2565 int nritems; in replay_one_buffer() local
3591 int nritems; log_dir_items() local
4638 int nritems = btrfs_header_nritems(leaf); btrfs_log_all_xattrs() local
5682 int nritems; log_new_dir_dentries() local
[all...] |
| H A D | reada.c | 98 int nritems; in __readahead_hook() local
123 * FIXME: currently we just set nritems to 0 if this is a leaf, in __readahead_hook()
131 nritems = btrfs_header_nritems(eb); in __readahead_hook()
133 for (i = 0; i < nritems; i++) { in __readahead_hook()
140 if (i + 1 < nritems) in __readahead_hook()
|
| H A D | reflink.c | 338 u32 nritems; in btrfs_clone() local
391 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_clone()
393 if (path->slots[0] >= nritems) { in btrfs_clone()
399 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_clone()
|
| H A D | file-item.c | 857 u32 nritems; in btrfs_csum_file_blocks() local
902 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_csum_file_blocks()
903 if (!nritems || (path->slots[0] >= nritems - 1)) { in btrfs_csum_file_blocks()
|
| H A D | relocation.c | 1057 u32 nritems; in replace_file_extents() local
1072 nritems = btrfs_header_nritems(leaf); in replace_file_extents()
1073 for (i = 0; i < nritems; i++) { in replace_file_extents()
1405 u32 nritems; in walk_up_reloc_tree() local
1416 nritems = btrfs_header_nritems(eb); in walk_up_reloc_tree()
1417 while (path->slots[i] + 1 < nritems) { in walk_up_reloc_tree()
1445 u32 nritems; in walk_down_reloc_tree() local
1453 nritems = btrfs_header_nritems(eb); in walk_down_reloc_tree()
1454 while (path->slots[i] < nritems) { in walk_down_reloc_tree()
1460 if (path->slots[i] >= nritems) { in walk_down_reloc_tree()
[all...] |
| H A D | extent-tree.c | 448 u32 nritems; in lookup_extent_data_ref() local
477 nritems = btrfs_header_nritems(leaf); in lookup_extent_data_ref()
479 if (path->slots[0] >= nritems) { in lookup_extent_data_ref()
487 nritems = btrfs_header_nritems(leaf); in lookup_extent_data_ref()
2401 u32 nritems; in __btrfs_mod_ref() local
2415 nritems = btrfs_header_nritems(buf); in __btrfs_mod_ref()
2430 for (i = 0; i < nritems; i++) { in __btrfs_mod_ref()
4768 u32 nritems; in reada_walk_down() local
4785 nritems = btrfs_header_nritems(eb); in reada_walk_down()
4787 for (slot = path->slots[wc->level]; slot < nritems; slo in reada_walk_down()
[all...] |
| H A D | tree-checker.c | 1591 u32 nritems = btrfs_header_nritems(leaf); in check_leaf() local
1609 if (nritems == 0 && !btrfs_header_flag(leaf, BTRFS_HEADER_FLAG_RELOC)) { in check_leaf()
1633 if (nritems == 0) in check_leaf()
1647 for (slot = 0; slot < nritems; slot++) { in check_leaf()
1753 "corrupt node: root=%llu block=%llu, nritems too %s, have %lu expect range [1,%u]", in btrfs_check_node()
|
| H A D | block-group.c | 510 u32 nritems; in load_extent_tree_free() local
549 nritems = btrfs_header_nritems(leaf); in load_extent_tree_free()
557 if (path->slots[0] < nritems) { in load_extent_tree_free()
583 nritems = btrfs_header_nritems(leaf); in load_extent_tree_free()
|
| H A D | ref-verify.c | 507 int nritems = btrfs_header_nritems(leaf); in process_leaf() local
509 for (i = 0; i < nritems; i++) { in process_leaf()
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | ctree.c | 1456 u32 nritems; in reada_for_search() local
1501 nritems = btrfs_header_nritems(node); in reada_for_search()
1512 if (nr >= nritems) in reada_for_search()
1537 int nritems; in reada_for_balance() local
1543 nritems = btrfs_header_nritems(parent); in reada_for_balance()
1548 if (slot + 1 < nritems) in reada_for_balance()
1587 u32 nritems; in unlock_up() local
1589 nritems = btrfs_header_nritems(path->nodes[i]); in unlock_up()
1590 if (nritems < 1 || path->slots[i] >= nritems in unlock_up()
3048 int nritems; insert_ptr() local
3195 int nritems = btrfs_header_nritems(l); leaf_space_used() local
3215 int nritems = btrfs_header_nritems(leaf); btrfs_leaf_free_space() local
3649 copy_for_split(struct btrfs_trans_handle *trans, struct btrfs_path *path, struct extent_buffer *l, struct extent_buffer *right, int slot, int mid, int nritems) copy_for_split() argument
3726 u32 nritems; push_for_double_split() local
3786 u32 nritems; split_leaf() local
4037 u32 nritems; split_item() local
4138 u32 nritems; btrfs_truncate_item() local
4230 u32 nritems; btrfs_extend_item() local
4301 u32 nritems; setup_items_for_insert() local
4508 u32 nritems; btrfs_del_ptr() local
4597 u32 nritems; btrfs_del_items() local
4746 u32 nritems; btrfs_search_forward() local
4928 u32 nritems; btrfs_next_old_leaf() local
5139 u32 nritems; btrfs_previous_item() local
5180 u32 nritems; btrfs_previous_extent_item() local
[all...] |
| H A D | tree-mod-log.c | 372 int nritems) in tree_mod_log_free_eb()
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 in btrfs_tree_mod_log_free_eb() local
370 tree_mod_log_free_eb(struct btrfs_fs_info *fs_info, struct tree_mod_elem **tm_list, int nritems) tree_mod_log_free_eb() argument
[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 | 2031 int nritems; in find_dir_range() local
2068 nritems = btrfs_header_nritems(path->nodes[0]); in find_dir_range()
2070 if (path->slots[0] >= nritems) { in find_dir_range()
2183 int nritems; in replay_xattr_deletes() local
2198 nritems = btrfs_header_nritems(path->nodes[0]); in replay_xattr_deletes()
2199 for (i = path->slots[0]; i < nritems; i++) { in replay_xattr_deletes()
2328 int nritems; in replay_dir_deletes() local
2334 nritems = btrfs_header_nritems(path->nodes[0]); in replay_dir_deletes()
2335 if (path->slots[0] >= nritems) { in replay_dir_deletes()
2389 int nritems; in replay_one_buffer() local
3639 const int nritems = btrfs_header_nritems(path->nodes[0]); process_dir_items_leaf() local
5013 int nritems = btrfs_header_nritems(leaf); btrfs_log_all_xattrs() local
[all...] |
| H A D | relocation.c | 1078 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()
[all...] |
| 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 | 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()
517 * If btrfs_search_slot() makes path to point beyond nritems, in defrag_get_extent()
|
| 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-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()
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; slo in reada_walk_down()
[all...] |
| H A D | tree-checker.c | 1701 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()
1879 "corrupt node: root=%llu block=%llu, nritems too %s, have %lu expect range [1,%u]", in __btrfs_check_node()
2014 "invalid tree nritems, bytenr=%llu nritems=0 expect >0", in btrfs_verify_level_key()
|
| H A D | extent_io.c | 1641 u32 nritems; in prepare_eb_write() local
1647 /* Set btree blocks beyond nritems with 0 to avoid stale content */ in prepare_eb_write()
1648 nritems = btrfs_header_nritems(eb); in prepare_eb_write()
1650 end = btrfs_node_key_ptr_offset(eb, nritems); in prepare_eb_write()
1657 start = btrfs_item_nr_offset(eb, nritems); in prepare_eb_write()
1659 if (nritems == 0) in prepare_eb_write()
1662 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);
|
| /kernel/linux/linux-6.6/include/uapi/linux/ |
| H A D | btrfs_tree.h | 473 __le32 nritems; member
|