fs/btrfs/ctree.c

1329 	u32 nritems;
1374 	nritems = btrfs_header_nritems(node);
1385 			if (nr >= nritems)
1410 	int nritems;
1416 	nritems = btrfs_header_nritems(parent);
1421 	if (slot + 1 < nritems)
1460 				u32 nritems;
1462 				nritems = btrfs_header_nritems(path->nodes[i]);
1463 				if (nritems < 1 || path->slots[i] >= nritems - 1) {
2920 	int nritems;
2926 	nritems = btrfs_header_nritems(lower);
2927 	BUG_ON(slot > nritems);
2928 	BUG_ON(nritems == BTRFS_NODEPTRS_PER_BLOCK(trans->fs_info));
2929 	if (slot != nritems) {
2932 					slot, nritems - slot);
2941 			      (nritems - slot) * sizeof(struct btrfs_key_ptr));
2955 	btrfs_set_header_nritems(lower, nritems + 1);
3067 	int nritems = btrfs_header_nritems(l);
3068 	int end = min(nritems, start + nr) - 1;
3087 	int nritems = btrfs_header_nritems(leaf);
3090 	ret = BTRFS_LEAF_DATA_SIZE(fs_info) - leaf_space_used(leaf, 0, nritems);
3093 			   "leaf free space ret %d, leaf data size %lu, used %d nritems %d",
3096 			   leaf_space_used(leaf, 0, nritems), nritems);
3525 				   int slot, int mid, int nritems)
3535 	nritems = nritems - mid;
3536 	btrfs_set_header_nritems(right, nritems);
3539 	copy_leaf_items(right, l, 0, mid, nritems);
3547 	for (i = 0; i < nritems; i++) {
3598 	u32 nritems;
3616 	nritems = btrfs_header_nritems(path->nodes[0]);
3621 	if (path->slots[0] == 0 || path->slots[0] == nritems)
3658 	u32 nritems;
3711 	nritems = btrfs_header_nritems(l);
3712 	mid = (nritems + 1) / 2;
3715 		if (nritems == 1 ||
3716 		    leaf_space_used(l, mid, nritems - mid) + data_size >
3718 			if (slot >= nritems) {
3722 				if (mid != nritems &&
3723 				    leaf_space_used(l, mid, nritems - mid) +
3740 				if (mid != nritems &&
3741 				    leaf_space_used(l, mid, nritems - mid) +
3812 	ret = copy_for_split(trans, path, l, right, slot, mid, nritems);
3909 	u32 nritems;
3934 	nritems = btrfs_header_nritems(leaf);
3935 	if (slot != nritems) {
3937 		memmove_leaf_items(leaf, slot + 1, slot, nritems - slot);
3950 	btrfs_set_header_nritems(leaf, nritems + 1);
4010 	u32 nritems;
4025 	nritems = btrfs_header_nritems(leaf);
4033 	BUG_ON(slot >= nritems);
4040 	for (i = slot; i < nritems; i++) {
4102 	u32 nritems;
4111 	nritems = btrfs_header_nritems(leaf);
4122 	if (slot >= nritems) {
4124 		btrfs_crit(leaf->fs_info, "slot %d too large, nritems %d",
4125 			   slot, nritems);
4134 	for (i = slot; i < nritems; i++) {
4173 	u32 nritems;
4195 	nritems = btrfs_header_nritems(leaf);
4207 	if (slot != nritems) {
4221 		for (i = slot; i < nritems; i++) {
4229 		memmove_leaf_items(leaf, slot + batch->nr, slot, nritems - slot);
4246 	btrfs_set_header_nritems(leaf, nritems + batch->nr);
4384 	u32 nritems;
4387 	nritems = btrfs_header_nritems(parent);
4388 	if (slot != nritems - 1) {
4391 					slot + 1, nritems - slot - 1);
4401 			      (nritems - slot - 1));
4411 	nritems--;
4412 	btrfs_set_header_nritems(parent, nritems);
4413 	if (nritems == 0 && parent == root->node) {
4473 	u32 nritems;
4476 	nritems = btrfs_header_nritems(leaf);
4478 	if (slot + nr != nritems) {
4492 		for (i = slot + nr; i < nritems; i++) {
4499 		memmove_leaf_items(leaf, slot, slot + nr, nritems - slot - nr);
4501 	btrfs_set_header_nritems(leaf, nritems - nr);
4502 	nritems -= nr;
4505 	if (nritems == 0) {
4515 		int used = leaf_space_used(leaf, 0, nritems);
4563 				nritems = btrfs_header_nritems(leaf);
4564 				min_push_space = leaf_space_used(leaf, 0, nritems);
4622 	u32 nritems;
4641 		nritems = btrfs_header_nritems(cur);
4651 			if (slot >= nritems)
4664 		while (slot < nritems) {
4679 		if (slot >= nritems) {
4804 	u32 nritems;
4815 	nritems = btrfs_header_nritems(path->nodes[0]);
4816 	if (nritems == 0)
4819 	btrfs_item_key_to_cpu(path->nodes[0], &key, nritems - 1);
4849 	nritems = btrfs_header_nritems(path->nodes[0]);
4856 	if (nritems > 0 && path->slots[0] < nritems - 1) {
4876 	if (nritems > 0 && ret > 0 && path->slots[0] == nritems - 1) {
5015 	u32 nritems;
5027 		nritems = btrfs_header_nritems(leaf);
5028 		if (nritems == 0)
5030 		if (path->slots[0] == nritems)
5056 	u32 nritems;
5068 		nritems = btrfs_header_nritems(leaf);
5069 		if (nritems == 0)
5071 		if (path->slots[0] == nritems)