645 		       int nritems)  in __tree_mod_log_free_eb()  argument
650 	for (i = nritems - 1; i >= 0; i--) {  in __tree_mod_log_free_eb()
653 			for (j = nritems - 1; j > i; j--)  in __tree_mod_log_free_eb()
671 	int nritems = 0;  in tree_mod_log_insert_root()  local
679 		nritems = btrfs_header_nritems(old_root);  in tree_mod_log_insert_root()
680 		tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *),  in tree_mod_log_insert_root()
686 		for (i = 0; i < nritems; i++) {  in tree_mod_log_insert_root()
712 		ret = __tree_mod_log_free_eb(fs_info, tm_list, nritems);  in tree_mod_log_insert_root()
725 		for (i = 0; i < nritems; i++)  in tree_mod_log_insert_root()
897 	int nritems = 0;  in tree_mod_log_free_eb()  local
907 	nritems = btrfs_header_nritems(eb);  in tree_mod_log_free_eb()
908 	tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *), GFP_NOFS);  in tree_mod_log_free_eb()
912 	for (i = 0; i < nritems; i++) {  in tree_mod_log_free_eb()
924 	ret = __tree_mod_log_free_eb(fs_info, tm_list, nritems);  in tree_mod_log_free_eb()
933 	for (i = 0; i < nritems; i++)  in tree_mod_log_free_eb()
2240 	u32 nritems;  in reada_for_search()  local
2269 	nritems = btrfs_header_nritems(node);  in reada_for_search()
2279 			if (nr >= nritems)  in reada_for_search()
2304 	int nritems;  in reada_for_balance()  local
2315 	nritems = btrfs_header_nritems(parent);  in reada_for_balance()
2331 	if (slot + 1 < nritems) {  in reada_for_balance()
2379 			u32 nritems;  in unlock_up()  local
2381 			nritems = btrfs_header_nritems(t);  in unlock_up()
2382 			if (nritems < 1 || path->slots[i] >= nritems - 1) {  in unlock_up()
3402 	int nritems;  in insert_ptr()  local
3408 	nritems = btrfs_header_nritems(lower);  in insert_ptr()
3409 	BUG_ON(slot > nritems);  in insert_ptr()
3410 	BUG_ON(nritems == BTRFS_NODEPTRS_PER_BLOCK(root));  in insert_ptr()
3411 	if (slot != nritems) {  in insert_ptr()
3414 					     slot, nritems - slot);  in insert_ptr()
3418 			      (nritems - slot) * sizeof(struct btrfs_key_ptr));  in insert_ptr()
3429 	btrfs_set_header_nritems(lower, nritems + 1);  in insert_ptr()
3546 	int nritems = btrfs_header_nritems(l);  in leaf_space_used()  local
3547 	int end = min(nritems, start + nr) - 1;  in leaf_space_used()
3570 	int nritems = btrfs_header_nritems(leaf);  in btrfs_leaf_free_space()  local
3572 	ret = BTRFS_LEAF_DATA_SIZE(root) - leaf_space_used(leaf, 0, nritems);  in btrfs_leaf_free_space()
3577 		       leaf_space_used(leaf, 0, nritems), nritems);  in btrfs_leaf_free_space()
4035 				    int slot, int mid, int nritems)  in copy_for_split()  argument
4045 	nritems = nritems - mid;  in copy_for_split()
4046 	btrfs_set_header_nritems(right, nritems);  in copy_for_split()
4051 			   nritems * sizeof(struct btrfs_item));  in copy_for_split()
4061 	for (i = 0; i < nritems; i++) {  in copy_for_split()
4111 	u32 nritems;  in push_for_double_split()  local
4129 	nritems = btrfs_header_nritems(path->nodes[0]);  in push_for_double_split()
4134 	if (path->slots[0] == 0 || path->slots[0] == nritems)  in push_for_double_split()
4168 	u32 nritems;  in split_leaf()  local
4218 	nritems = btrfs_header_nritems(l);  in split_leaf()
4219 	mid = (nritems + 1) / 2;  in split_leaf()
4222 		if (nritems == 1 ||  in split_leaf()
4223 		    leaf_space_used(l, mid, nritems - mid) + data_size >  in split_leaf()
4225 			if (slot >= nritems) {  in split_leaf()
4229 				if (mid != nritems &&  in split_leaf()
4230 				    leaf_space_used(l, mid, nritems - mid) +  in split_leaf()
4247 				if (mid != nritems &&  in split_leaf()
4248 				    leaf_space_used(l, mid, nritems - mid) +  in split_leaf()
4308 	copy_for_split(trans, root, path, l, right, slot, mid, nritems);  in split_leaf()
4404 	u32 nritems;  in split_item()  local
4426 	nritems = btrfs_header_nritems(leaf);  in split_item()
4427 	if (slot != nritems) {  in split_item()
4431 				(nritems - slot) * sizeof(struct btrfs_item));  in split_item()
4446 	btrfs_set_header_nritems(leaf, nritems + 1);  in split_item()
4543 	u32 nritems;  in btrfs_truncate_item()  local
4560 	nritems = btrfs_header_nritems(leaf);  in btrfs_truncate_item()
4568 	BUG_ON(slot >= nritems);  in btrfs_truncate_item()
4574 	for (i = slot; i < nritems; i++) {  in btrfs_truncate_item()
4642 	u32 nritems;  in btrfs_extend_item()  local
4653 	nritems = btrfs_header_nritems(leaf);  in btrfs_extend_item()
4664 	if (slot >= nritems) {  in btrfs_extend_item()
4667 		       slot, nritems);  in btrfs_extend_item()
4675 	for (i = slot; i < nritems; i++) {  in btrfs_extend_item()
4712 	u32 nritems;  in setup_items_for_insert()  local
4730 	nritems = btrfs_header_nritems(leaf);  in setup_items_for_insert()
4740 	if (slot != nritems) {  in setup_items_for_insert()
4753 		for (i = slot; i < nritems; i++) {  in setup_items_for_insert()
4764 			      (nritems - slot) * sizeof(struct btrfs_item));  in setup_items_for_insert()
4784 	btrfs_set_header_nritems(leaf, nritems + nr);  in setup_items_for_insert()
4864 	u32 nritems;  in del_ptr()  local
4867 	nritems = btrfs_header_nritems(parent);  in del_ptr()
4868 	if (slot != nritems - 1) {  in del_ptr()
4871 					     slot + 1, nritems - slot - 1);  in del_ptr()
4876 			      (nritems - slot - 1));  in del_ptr()
4883 	nritems--;  in del_ptr()
4884 	btrfs_set_header_nritems(parent, nritems);  in del_ptr()
4885 	if (nritems == 0 && parent == root->node) {  in del_ptr()
4942 	u32 nritems;  in btrfs_del_items()  local
4953 	nritems = btrfs_header_nritems(leaf);  in btrfs_del_items()
4955 	if (slot + nr != nritems) {  in btrfs_del_items()
4963 		for (i = slot + nr; i < nritems; i++) {  in btrfs_del_items()
4975 			      (nritems - slot - nr));  in btrfs_del_items()
4977 	btrfs_set_header_nritems(leaf, nritems - nr);  in btrfs_del_items()
4978 	nritems -= nr;  in btrfs_del_items()
4981 	if (nritems == 0) {  in btrfs_del_items()
4990 		int used = leaf_space_used(leaf, 0, nritems);  in btrfs_del_items()
5123 	u32 nritems;  in btrfs_search_forward()  local
5141 		nritems = btrfs_header_nritems(cur);  in btrfs_search_forward()
5147 			if (slot >= nritems)  in btrfs_search_forward()
5160 		while (slot < nritems) {  in btrfs_search_forward()
5175 		if (slot >= nritems) {  in btrfs_search_forward()
5231 	int nritems;  in tree_move_next_or_upnext()  local
5232 	nritems = btrfs_header_nritems(path->nodes[*level]);  in tree_move_next_or_upnext()
5236 	while (path->slots[*level] >= nritems) {  in tree_move_next_or_upnext()
5247 		nritems = btrfs_header_nritems(path->nodes[*level]);  in tree_move_next_or_upnext()
5661 	u32 nritems;  in btrfs_next_old_leaf()  local
5666 	nritems = btrfs_header_nritems(path->nodes[0]);  in btrfs_next_old_leaf()
5667 	if (nritems == 0)  in btrfs_next_old_leaf()
5670 	btrfs_item_key_to_cpu(path->nodes[0], &key, nritems - 1);  in btrfs_next_old_leaf()
5689 	nritems = btrfs_header_nritems(path->nodes[0]);  in btrfs_next_old_leaf()
5696 	if (nritems > 0 && path->slots[0] < nritems - 1) {  in btrfs_next_old_leaf()
5716 	if (nritems > 0 && ret > 0 && path->slots[0] == nritems - 1) {  in btrfs_next_old_leaf()
5838 	u32 nritems;  in btrfs_previous_item()  local
5851 		nritems = btrfs_header_nritems(leaf);  in btrfs_previous_item()
5852 		if (nritems == 0)  in btrfs_previous_item()
5854 		if (path->slots[0] == nritems)  in btrfs_previous_item()
5880 	u32 nritems;  in btrfs_previous_extent_item()  local
5893 		nritems = btrfs_header_nritems(leaf);  in btrfs_previous_extent_item()
5894 		if (nritems == 0)  in btrfs_previous_extent_item()
5896 		if (path->slots[0] == nritems)  in btrfs_previous_extent_item()