Lines Matching defs:nritems
203 u32 nritems;
213 nritems = btrfs_header_nritems(buf);
749 u32 nritems = btrfs_header_nritems(node);
755 BUG_ON(nritems == 0);
765 BUG_ON(nritems > BTRFS_NODEPTRS_PER_BLOCK(root));
771 if (slot < nritems - 1) {
794 u32 nritems = btrfs_header_nritems(leaf);
799 if (nritems == 0)
812 if (slot != 0 && slot < nritems - 1) {
827 if (slot < nritems - 1) {
1354 u32 nritems;
1382 nritems = btrfs_header_nritems(node);
1391 if (nr >= nritems)
1420 int nritems;
1433 nritems = btrfs_header_nritems(parent);
1445 if (slot + 1 < nritems) {
1509 u32 nritems;
1511 nritems = btrfs_header_nritems(t);
1512 if (nritems < 1 || path->slots[i] >= nritems - 1) {
2149 int nritems;
2154 nritems = btrfs_header_nritems(lower);
2155 BUG_ON(slot > nritems);
2156 if (nritems == BTRFS_NODEPTRS_PER_BLOCK(root))
2158 if (slot != nritems) {
2162 (nritems - slot) * sizeof(struct btrfs_key_ptr));
2168 btrfs_set_header_nritems(lower, nritems + 1);
2275 int nritems = btrfs_header_nritems(l);
2276 int end = min(nritems, start + nr) - 1;
2295 int nritems = btrfs_header_nritems(leaf);
2297 ret = BTRFS_LEAF_DATA_SIZE(root) - leaf_space_used(leaf, 0, nritems);
2300 "used %d nritems %d\n",
2302 leaf_space_used(leaf, 0, nritems), nritems);
2802 int slot, int mid, int nritems)
2811 nritems = nritems - mid;
2812 btrfs_set_header_nritems(right, nritems);
2817 nritems * sizeof(struct btrfs_item));
2827 for (i = 0; i < nritems; i++) {
2894 u32 nritems;
2909 nritems = btrfs_header_nritems(path->nodes[0]);
2914 if (path->slots[0] == 0 || path->slots[0] == nritems)
2948 u32 nritems;
2992 nritems = btrfs_header_nritems(l);
2993 mid = (nritems + 1) / 2;
2996 if (nritems == 1 ||
2997 leaf_space_used(l, mid, nritems - mid) + data_size >
2999 if (slot >= nritems) {
3003 if (mid != nritems &&
3004 leaf_space_used(l, mid, nritems - mid) +
3021 if (mid != nritems &&
3022 leaf_space_used(l, mid, nritems - mid) +
3096 ret = copy_for_split(trans, root, path, l, right, slot, mid, nritems);
3191 u32 nritems;
3213 nritems = btrfs_header_nritems(leaf);
3214 if (slot != nritems) {
3218 (nritems - slot) * sizeof(struct btrfs_item));
3233 btrfs_set_header_nritems(leaf, nritems + 1);
3336 u32 nritems;
3351 nritems = btrfs_header_nritems(leaf);
3359 BUG_ON(slot >= nritems);
3365 for (i = slot; i < nritems; i++) {
3451 u32 nritems;
3460 nritems = btrfs_header_nritems(leaf);
3471 if (slot >= nritems) {
3473 printk(KERN_CRIT "slot %d too large, nritems %d\n",
3474 slot, nritems);
3482 for (i = slot; i < nritems; i++) {
3537 u32 nritems;
3563 nritems = btrfs_header_nritems(leaf);
3579 if (slot != nritems) {
3605 for (i = slot; i < nritems; i++) {
3628 (nritems - slot) * sizeof(struct btrfs_item));
3654 btrfs_set_header_nritems(leaf, nritems + nr);
3686 u32 nritems;
3696 nritems = btrfs_header_nritems(leaf);
3706 if (slot != nritems) {
3720 for (i = slot; i < nritems; i++) {
3743 (nritems - slot) * sizeof(struct btrfs_item));
3762 btrfs_set_header_nritems(leaf, nritems + nr);
3854 u32 nritems;
3858 nritems = btrfs_header_nritems(parent);
3859 if (slot != nritems - 1) {
3864 (nritems - slot - 1));
3866 nritems--;
3867 btrfs_set_header_nritems(parent, nritems);
3868 if (nritems == 0 && parent == root->node) {
3931 u32 nritems;
3939 nritems = btrfs_header_nritems(leaf);
3941 if (slot + nr != nritems) {
3949 for (i = slot + nr; i < nritems; i++) {
3972 (nritems - slot - nr));
3974 btrfs_set_header_nritems(leaf, nritems - nr);
3975 nritems -= nr;
3978 if (nritems == 0) {
3988 int used = leaf_space_used(leaf, 0, nritems);
4111 u32 nritems;
4128 nritems = btrfs_header_nritems(cur);
4134 if (slot >= nritems)
4148 while (slot < nritems) {
4187 if (slot >= nritems) {
4327 u32 nritems;
4332 nritems = btrfs_header_nritems(path->nodes[0]);
4333 if (nritems == 0)
4344 btrfs_item_key_to_cpu(path->nodes[0], &key, nritems - 1);
4361 nritems = btrfs_header_nritems(path->nodes[0]);
4368 if (nritems > 0 && path->slots[0] < nritems - 1) {
4482 u32 nritems;
4495 nritems = btrfs_header_nritems(leaf);
4496 if (nritems == 0)
4498 if (path->slots[0] == nritems)