Lines Matching refs:nritems
1456 u32 nritems;
1501 nritems = btrfs_header_nritems(node);
1512 if (nr >= nritems)
1537 int nritems;
1543 nritems = btrfs_header_nritems(parent);
1548 if (slot + 1 < nritems)
1587 u32 nritems;
1589 nritems = btrfs_header_nritems(path->nodes[i]);
1590 if (nritems < 1 || path->slots[i] >= nritems - 1) {
3048 int nritems;
3054 nritems = btrfs_header_nritems(lower);
3055 BUG_ON(slot > nritems);
3056 BUG_ON(nritems == BTRFS_NODEPTRS_PER_BLOCK(trans->fs_info));
3057 if (slot != nritems) {
3060 slot, nritems - slot);
3069 (nritems - slot) * sizeof(struct btrfs_key_ptr));
3083 btrfs_set_header_nritems(lower, nritems + 1);
3195 int nritems = btrfs_header_nritems(l);
3196 int end = min(nritems, start + nr) - 1;
3215 int nritems = btrfs_header_nritems(leaf);
3218 ret = BTRFS_LEAF_DATA_SIZE(fs_info) - leaf_space_used(leaf, 0, nritems);
3221 "leaf free space ret %d, leaf data size %lu, used %d nritems %d",
3224 leaf_space_used(leaf, 0, nritems), nritems);
3653 int slot, int mid, int nritems)
3663 nritems = nritems - mid;
3664 btrfs_set_header_nritems(right, nritems);
3667 copy_leaf_items(right, l, 0, mid, nritems);
3675 for (i = 0; i < nritems; i++) {
3726 u32 nritems;
3744 nritems = btrfs_header_nritems(path->nodes[0]);
3749 if (path->slots[0] == 0 || path->slots[0] == nritems)
3786 u32 nritems;
3839 nritems = btrfs_header_nritems(l);
3840 mid = (nritems + 1) / 2;
3843 if (nritems == 1 ||
3844 leaf_space_used(l, mid, nritems - mid) + data_size >
3846 if (slot >= nritems) {
3850 if (mid != nritems &&
3851 leaf_space_used(l, mid, nritems - mid) +
3868 if (mid != nritems &&
3869 leaf_space_used(l, mid, nritems - mid) +
3940 ret = copy_for_split(trans, path, l, right, slot, mid, nritems);
4037 u32 nritems;
4062 nritems = btrfs_header_nritems(leaf);
4063 if (slot != nritems) {
4065 memmove_leaf_items(leaf, slot + 1, slot, nritems - slot);
4078 btrfs_set_header_nritems(leaf, nritems + 1);
4138 u32 nritems;
4153 nritems = btrfs_header_nritems(leaf);
4161 BUG_ON(slot >= nritems);
4168 for (i = slot; i < nritems; i++) {
4230 u32 nritems;
4239 nritems = btrfs_header_nritems(leaf);
4250 if (slot >= nritems) {
4252 btrfs_crit(leaf->fs_info, "slot %d too large, nritems %d",
4253 slot, nritems);
4262 for (i = slot; i < nritems; i++) {
4301 u32 nritems;
4323 nritems = btrfs_header_nritems(leaf);
4335 if (slot != nritems) {
4349 for (i = slot; i < nritems; i++) {
4357 memmove_leaf_items(leaf, slot + batch->nr, slot, nritems - slot);
4374 btrfs_set_header_nritems(leaf, nritems + batch->nr);
4508 u32 nritems;
4511 nritems = btrfs_header_nritems(parent);
4512 if (slot != nritems - 1) {
4515 slot + 1, nritems - slot - 1);
4525 (nritems - slot - 1));
4535 nritems--;
4536 btrfs_set_header_nritems(parent, nritems);
4537 if (nritems == 0 && parent == root->node) {
4597 u32 nritems;
4600 nritems = btrfs_header_nritems(leaf);
4602 if (slot + nr != nritems) {
4616 for (i = slot + nr; i < nritems; i++) {
4623 memmove_leaf_items(leaf, slot, slot + nr, nritems - slot - nr);
4625 btrfs_set_header_nritems(leaf, nritems - nr);
4626 nritems -= nr;
4629 if (nritems == 0) {
4639 int used = leaf_space_used(leaf, 0, nritems);
4687 nritems = btrfs_header_nritems(leaf);
4688 min_push_space = leaf_space_used(leaf, 0, nritems);
4746 u32 nritems;
4765 nritems = btrfs_header_nritems(cur);
4775 if (slot >= nritems)
4788 while (slot < nritems) {
4803 if (slot >= nritems) {
4928 u32 nritems;
4939 nritems = btrfs_header_nritems(path->nodes[0]);
4940 if (nritems == 0)
4943 btrfs_item_key_to_cpu(path->nodes[0], &key, nritems - 1);
4973 nritems = btrfs_header_nritems(path->nodes[0]);
4980 if (nritems > 0 && path->slots[0] < nritems - 1) {
5000 if (nritems > 0 && ret > 0 && path->slots[0] == nritems - 1) {
5139 u32 nritems;
5151 nritems = btrfs_header_nritems(leaf);
5152 if (nritems == 0)
5154 if (path->slots[0] == nritems)
5180 u32 nritems;
5192 nritems = btrfs_header_nritems(leaf);
5193 if (nritems == 0)
5195 if (path->slots[0] == nritems)