Lines Matching refs:nritems
621 int nritems) in __tree_mod_log_free_eb() argument
626 for (i = nritems - 1; i >= 0; i--) { in __tree_mod_log_free_eb()
629 for (j = nritems - 1; j > i; j--) in __tree_mod_log_free_eb()
647 int nritems = 0; in tree_mod_log_insert_root() local
655 nritems = btrfs_header_nritems(old_root); in tree_mod_log_insert_root()
656 tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *), in tree_mod_log_insert_root()
662 for (i = 0; i < nritems; i++) { in tree_mod_log_insert_root()
688 ret = __tree_mod_log_free_eb(fs_info, tm_list, nritems); in tree_mod_log_insert_root()
701 for (i = 0; i < nritems; i++) in tree_mod_log_insert_root()
873 int nritems = 0; in tree_mod_log_free_eb() local
883 nritems = btrfs_header_nritems(eb); in tree_mod_log_free_eb()
884 tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *), GFP_NOFS); in tree_mod_log_free_eb()
888 for (i = 0; i < nritems; i++) { in tree_mod_log_free_eb()
900 ret = __tree_mod_log_free_eb(fs_info, tm_list, nritems); in tree_mod_log_free_eb()
909 for (i = 0; i < nritems; i++) in tree_mod_log_free_eb()
2221 u32 nritems; in reada_for_search() local
2250 nritems = btrfs_header_nritems(node); in reada_for_search()
2260 if (nr >= nritems) in reada_for_search()
2285 int nritems; in reada_for_balance() local
2296 nritems = btrfs_header_nritems(parent); in reada_for_balance()
2312 if (slot + 1 < nritems) { in reada_for_balance()
2360 u32 nritems; in unlock_up() local
2362 nritems = btrfs_header_nritems(t); in unlock_up()
2363 if (nritems < 1 || path->slots[i] >= nritems - 1) { in unlock_up()
3395 int nritems; in insert_ptr() local
3401 nritems = btrfs_header_nritems(lower); in insert_ptr()
3402 BUG_ON(slot > nritems); in insert_ptr()
3403 BUG_ON(nritems == BTRFS_NODEPTRS_PER_BLOCK(root)); in insert_ptr()
3404 if (slot != nritems) { in insert_ptr()
3407 slot, nritems - slot); in insert_ptr()
3411 (nritems - slot) * sizeof(struct btrfs_key_ptr)); in insert_ptr()
3422 btrfs_set_header_nritems(lower, nritems + 1); in insert_ptr()
3539 int nritems = btrfs_header_nritems(l); in leaf_space_used() local
3540 int end = min(nritems, start + nr) - 1; in leaf_space_used()
3563 int nritems = btrfs_header_nritems(leaf); in btrfs_leaf_free_space() local
3565 ret = BTRFS_LEAF_DATA_SIZE(root) - leaf_space_used(leaf, 0, nritems); in btrfs_leaf_free_space()
3570 leaf_space_used(leaf, 0, nritems), nritems); in btrfs_leaf_free_space()
4028 int slot, int mid, int nritems) in copy_for_split() argument
4038 nritems = nritems - mid; in copy_for_split()
4039 btrfs_set_header_nritems(right, nritems); in copy_for_split()
4044 nritems * sizeof(struct btrfs_item)); in copy_for_split()
4054 for (i = 0; i < nritems; i++) { in copy_for_split()
4104 u32 nritems; in push_for_double_split() local
4122 nritems = btrfs_header_nritems(path->nodes[0]); in push_for_double_split()
4127 if (path->slots[0] == 0 || path->slots[0] == nritems) in push_for_double_split()
4161 u32 nritems; in split_leaf() local
4211 nritems = btrfs_header_nritems(l); in split_leaf()
4212 mid = (nritems + 1) / 2; in split_leaf()
4215 if (nritems == 1 || in split_leaf()
4216 leaf_space_used(l, mid, nritems - mid) + data_size > in split_leaf()
4218 if (slot >= nritems) { in split_leaf()
4222 if (mid != nritems && in split_leaf()
4223 leaf_space_used(l, mid, nritems - mid) + in split_leaf()
4240 if (mid != nritems && in split_leaf()
4241 leaf_space_used(l, mid, nritems - mid) + in split_leaf()
4301 copy_for_split(trans, root, path, l, right, slot, mid, nritems); in split_leaf()
4397 u32 nritems; in split_item() local
4419 nritems = btrfs_header_nritems(leaf); in split_item()
4420 if (slot != nritems) { in split_item()
4424 (nritems - slot) * sizeof(struct btrfs_item)); in split_item()
4439 btrfs_set_header_nritems(leaf, nritems + 1); in split_item()
4536 u32 nritems; in btrfs_truncate_item() local
4553 nritems = btrfs_header_nritems(leaf); in btrfs_truncate_item()
4561 BUG_ON(slot >= nritems); in btrfs_truncate_item()
4567 for (i = slot; i < nritems; i++) { in btrfs_truncate_item()
4635 u32 nritems; in btrfs_extend_item() local
4646 nritems = btrfs_header_nritems(leaf); in btrfs_extend_item()
4657 if (slot >= nritems) { in btrfs_extend_item()
4660 slot, nritems); in btrfs_extend_item()
4668 for (i = slot; i < nritems; i++) { in btrfs_extend_item()
4705 u32 nritems; in setup_items_for_insert() local
4723 nritems = btrfs_header_nritems(leaf); in setup_items_for_insert()
4733 if (slot != nritems) { in setup_items_for_insert()
4746 for (i = slot; i < nritems; i++) { in setup_items_for_insert()
4757 (nritems - slot) * sizeof(struct btrfs_item)); in setup_items_for_insert()
4777 btrfs_set_header_nritems(leaf, nritems + nr); in setup_items_for_insert()
4857 u32 nritems; in del_ptr() local
4860 nritems = btrfs_header_nritems(parent); in del_ptr()
4861 if (slot != nritems - 1) { in del_ptr()
4864 slot + 1, nritems - slot - 1); in del_ptr()
4869 (nritems - slot - 1)); in del_ptr()
4876 nritems--; in del_ptr()
4877 btrfs_set_header_nritems(parent, nritems); in del_ptr()
4878 if (nritems == 0 && parent == root->node) { in del_ptr()
4935 u32 nritems; in btrfs_del_items() local
4946 nritems = btrfs_header_nritems(leaf); in btrfs_del_items()
4948 if (slot + nr != nritems) { in btrfs_del_items()
4956 for (i = slot + nr; i < nritems; i++) { in btrfs_del_items()
4968 (nritems - slot - nr)); in btrfs_del_items()
4970 btrfs_set_header_nritems(leaf, nritems - nr); in btrfs_del_items()
4971 nritems -= nr; in btrfs_del_items()
4974 if (nritems == 0) { in btrfs_del_items()
4983 int used = leaf_space_used(leaf, 0, nritems); in btrfs_del_items()
5116 u32 nritems; in btrfs_search_forward() local
5134 nritems = btrfs_header_nritems(cur); in btrfs_search_forward()
5140 if (slot >= nritems) in btrfs_search_forward()
5153 while (slot < nritems) { in btrfs_search_forward()
5168 if (slot >= nritems) { in btrfs_search_forward()
5224 int nritems; in tree_move_next_or_upnext() local
5225 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
5229 while (path->slots[*level] >= nritems) { in tree_move_next_or_upnext()
5240 nritems = btrfs_header_nritems(path->nodes[*level]); in tree_move_next_or_upnext()
5655 u32 nritems; in btrfs_next_old_leaf() local
5660 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_next_old_leaf()
5661 if (nritems == 0) in btrfs_next_old_leaf()
5664 btrfs_item_key_to_cpu(path->nodes[0], &key, nritems - 1); in btrfs_next_old_leaf()
5683 nritems = btrfs_header_nritems(path->nodes[0]); in btrfs_next_old_leaf()
5690 if (nritems > 0 && path->slots[0] < nritems - 1) { in btrfs_next_old_leaf()
5710 if (nritems > 0 && ret > 0 && path->slots[0] == nritems - 1) { in btrfs_next_old_leaf()
5832 u32 nritems; in btrfs_previous_item() local
5845 nritems = btrfs_header_nritems(leaf); in btrfs_previous_item()
5846 if (nritems == 0) in btrfs_previous_item()
5848 if (path->slots[0] == nritems) in btrfs_previous_item()
5874 u32 nritems; in btrfs_previous_extent_item() local
5887 nritems = btrfs_header_nritems(leaf); in btrfs_previous_extent_item()
5888 if (nritems == 0) in btrfs_previous_extent_item()
5890 if (path->slots[0] == nritems) in btrfs_previous_extent_item()