Lines Matching refs:nritems
558 int nritems)
563 for (i = nritems - 1; i >= 0; i--) {
566 for (j = nritems - 1; j > i; j--)
582 int nritems = 0;
590 nritems = btrfs_header_nritems(old_root);
591 tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *),
597 for (i = 0; i < nritems; i++) {
623 ret = __tree_mod_log_free_eb(fs_info, tm_list, nritems);
636 for (i = 0; i < nritems; i++)
784 int nritems = 0;
794 nritems = btrfs_header_nritems(eb);
795 tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *), GFP_NOFS);
799 for (i = 0; i < nritems; i++) {
811 ret = __tree_mod_log_free_eb(eb->fs_info, tm_list, nritems);
820 for (i = 0; i < nritems; i++)
2223 u32 nritems;
2250 nritems = btrfs_header_nritems(node);
2260 if (nr >= nritems)
2284 int nritems;
2295 nritems = btrfs_header_nritems(parent);
2311 if (slot + 1 < nritems) {
2359 u32 nritems;
2361 nritems = btrfs_header_nritems(t);
2362 if (nritems < 1 || path->slots[i] >= nritems - 1) {
3498 int nritems;
3504 nritems = btrfs_header_nritems(lower);
3505 BUG_ON(slot > nritems);
3506 BUG_ON(nritems == BTRFS_NODEPTRS_PER_BLOCK(trans->fs_info));
3507 if (slot != nritems) {
3510 nritems - slot);
3516 (nritems - slot) * sizeof(struct btrfs_key_ptr));
3527 btrfs_set_header_nritems(lower, nritems + 1);
3634 int nritems = btrfs_header_nritems(l);
3635 int end = min(nritems, start + nr) - 1;
3657 int nritems = btrfs_header_nritems(leaf);
3660 ret = BTRFS_LEAF_DATA_SIZE(fs_info) - leaf_space_used(leaf, 0, nritems);
3663 "leaf free space ret %d, leaf data size %lu, used %d nritems %d",
3666 leaf_space_used(leaf, 0, nritems), nritems);
4142 int slot, int mid, int nritems)
4151 nritems = nritems - mid;
4152 btrfs_set_header_nritems(right, nritems);
4157 nritems * sizeof(struct btrfs_item));
4167 for (i = 0; i < nritems; i++) {
4215 u32 nritems;
4233 nritems = btrfs_header_nritems(path->nodes[0]);
4238 if (path->slots[0] == 0 || path->slots[0] == nritems)
4275 u32 nritems;
4328 nritems = btrfs_header_nritems(l);
4329 mid = (nritems + 1) / 2;
4332 if (nritems == 1 ||
4333 leaf_space_used(l, mid, nritems - mid) + data_size >
4335 if (slot >= nritems) {
4339 if (mid != nritems &&
4340 leaf_space_used(l, mid, nritems - mid) +
4357 if (mid != nritems &&
4358 leaf_space_used(l, mid, nritems - mid) +
4419 copy_for_split(trans, path, l, right, slot, mid, nritems);
4513 u32 nritems;
4535 nritems = btrfs_header_nritems(leaf);
4536 if (slot != nritems) {
4540 (nritems - slot) * sizeof(struct btrfs_item));
4555 btrfs_set_header_nritems(leaf, nritems + 1);
4649 u32 nritems;
4664 nritems = btrfs_header_nritems(leaf);
4672 BUG_ON(slot >= nritems);
4679 for (i = slot; i < nritems; i++) {
4745 u32 nritems;
4754 nritems = btrfs_header_nritems(leaf);
4765 if (slot >= nritems) {
4767 btrfs_crit(leaf->fs_info, "slot %d too large, nritems %d",
4768 slot, nritems);
4777 for (i = slot; i < nritems; i++) {
4820 u32 nritems;
4842 nritems = btrfs_header_nritems(leaf);
4853 if (slot != nritems) {
4867 for (i = slot; i < nritems; i++) {
4878 (nritems - slot) * sizeof(struct btrfs_item));
4897 btrfs_set_header_nritems(leaf, nritems + nr);
4976 u32 nritems;
4979 nritems = btrfs_header_nritems(parent);
4980 if (slot != nritems - 1) {
4983 nritems - slot - 1);
4990 (nritems - slot - 1));
4997 nritems--;
4998 btrfs_set_header_nritems(parent, nritems);
4999 if (nritems == 0 && parent == root->node) {
5057 u32 nritems;
5065 nritems = btrfs_header_nritems(leaf);
5067 if (slot + nr != nritems) {
5077 for (i = slot + nr; i < nritems; i++) {
5088 (nritems - slot - nr));
5090 btrfs_set_header_nritems(leaf, nritems - nr);
5091 nritems -= nr;
5094 if (nritems == 0) {
5103 int used = leaf_space_used(leaf, 0, nritems);
5263 u32 nritems;
5281 nritems = btrfs_header_nritems(cur);
5291 if (slot >= nritems)
5304 while (slot < nritems) {
5319 if (slot >= nritems) {
5455 u32 nritems;
5460 nritems = btrfs_header_nritems(path->nodes[0]);
5461 if (nritems == 0)
5464 btrfs_item_key_to_cpu(path->nodes[0], &key, nritems - 1);
5483 nritems = btrfs_header_nritems(path->nodes[0]);
5490 if (nritems > 0 && path->slots[0] < nritems - 1) {
5510 if (nritems > 0 && ret > 0 && path->slots[0] == nritems - 1) {
5632 u32 nritems;
5645 nritems = btrfs_header_nritems(leaf);
5646 if (nritems == 0)
5648 if (path->slots[0] == nritems)
5674 u32 nritems;
5687 nritems = btrfs_header_nritems(leaf);
5688 if (nritems == 0)
5690 if (path->slots[0] == nritems)