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()
2246 	u32 nritems;  in reada_for_search()  local
2275 	nritems = btrfs_header_nritems(node);  in reada_for_search()
2285 			if (nr >= nritems)  in reada_for_search()
2310 	int nritems;  in reada_for_balance()  local
2321 	nritems = btrfs_header_nritems(parent);  in reada_for_balance()
2337 	if (slot + 1 < nritems) {  in reada_for_balance()
2385 			u32 nritems;  in unlock_up()  local
2387 			nritems = btrfs_header_nritems(t);  in unlock_up()
2388 			if (nritems < 1 || path->slots[i] >= nritems - 1) {  in unlock_up()
3408 	int nritems;  in insert_ptr()  local
3414 	nritems = btrfs_header_nritems(lower);  in insert_ptr()
3415 	BUG_ON(slot > nritems);  in insert_ptr()
3416 	BUG_ON(nritems == BTRFS_NODEPTRS_PER_BLOCK(root));  in insert_ptr()
3417 	if (slot != nritems) {  in insert_ptr()
3420 					     slot, nritems - slot);  in insert_ptr()
3424 			      (nritems - slot) * sizeof(struct btrfs_key_ptr));  in insert_ptr()
3435 	btrfs_set_header_nritems(lower, nritems + 1);  in insert_ptr()
3552 	int nritems = btrfs_header_nritems(l);  in leaf_space_used()  local
3553 	int end = min(nritems, start + nr) - 1;  in leaf_space_used()
3576 	int nritems = btrfs_header_nritems(leaf);  in btrfs_leaf_free_space()  local
3578 	ret = BTRFS_LEAF_DATA_SIZE(root) - leaf_space_used(leaf, 0, nritems);  in btrfs_leaf_free_space()
3583 		       leaf_space_used(leaf, 0, nritems), nritems);  in btrfs_leaf_free_space()
4041 				    int slot, int mid, int nritems)  in copy_for_split()  argument
4051 	nritems = nritems - mid;  in copy_for_split()
4052 	btrfs_set_header_nritems(right, nritems);  in copy_for_split()
4057 			   nritems * sizeof(struct btrfs_item));  in copy_for_split()
4067 	for (i = 0; i < nritems; i++) {  in copy_for_split()
4117 	u32 nritems;  in push_for_double_split()  local
4135 	nritems = btrfs_header_nritems(path->nodes[0]);  in push_for_double_split()
4140 	if (path->slots[0] == 0 || path->slots[0] == nritems)  in push_for_double_split()
4174 	u32 nritems;  in split_leaf()  local
4224 	nritems = btrfs_header_nritems(l);  in split_leaf()
4225 	mid = (nritems + 1) / 2;  in split_leaf()
4228 		if (nritems == 1 ||  in split_leaf()
4229 		    leaf_space_used(l, mid, nritems - mid) + data_size >  in split_leaf()
4231 			if (slot >= nritems) {  in split_leaf()
4235 				if (mid != nritems &&  in split_leaf()
4236 				    leaf_space_used(l, mid, nritems - mid) +  in split_leaf()
4253 				if (mid != nritems &&  in split_leaf()
4254 				    leaf_space_used(l, mid, nritems - mid) +  in split_leaf()
4314 	copy_for_split(trans, root, path, l, right, slot, mid, nritems);  in split_leaf()
4410 	u32 nritems;  in split_item()  local
4432 	nritems = btrfs_header_nritems(leaf);  in split_item()
4433 	if (slot != nritems) {  in split_item()
4437 				(nritems - slot) * sizeof(struct btrfs_item));  in split_item()
4452 	btrfs_set_header_nritems(leaf, nritems + 1);  in split_item()
4549 	u32 nritems;  in btrfs_truncate_item()  local
4566 	nritems = btrfs_header_nritems(leaf);  in btrfs_truncate_item()
4574 	BUG_ON(slot >= nritems);  in btrfs_truncate_item()
4580 	for (i = slot; i < nritems; i++) {  in btrfs_truncate_item()
4648 	u32 nritems;  in btrfs_extend_item()  local
4659 	nritems = btrfs_header_nritems(leaf);  in btrfs_extend_item()
4670 	if (slot >= nritems) {  in btrfs_extend_item()
4673 		       slot, nritems);  in btrfs_extend_item()
4681 	for (i = slot; i < nritems; i++) {  in btrfs_extend_item()
4718 	u32 nritems;  in setup_items_for_insert()  local
4736 	nritems = btrfs_header_nritems(leaf);  in setup_items_for_insert()
4746 	if (slot != nritems) {  in setup_items_for_insert()
4759 		for (i = slot; i < nritems; i++) {  in setup_items_for_insert()
4770 			      (nritems - slot) * sizeof(struct btrfs_item));  in setup_items_for_insert()
4790 	btrfs_set_header_nritems(leaf, nritems + nr);  in setup_items_for_insert()
4870 	u32 nritems;  in del_ptr()  local
4873 	nritems = btrfs_header_nritems(parent);  in del_ptr()
4874 	if (slot != nritems - 1) {  in del_ptr()
4877 					     slot + 1, nritems - slot - 1);  in del_ptr()
4882 			      (nritems - slot - 1));  in del_ptr()
4889 	nritems--;  in del_ptr()
4890 	btrfs_set_header_nritems(parent, nritems);  in del_ptr()
4891 	if (nritems == 0 && parent == root->node) {  in del_ptr()
4948 	u32 nritems;  in btrfs_del_items()  local
4959 	nritems = btrfs_header_nritems(leaf);  in btrfs_del_items()
4961 	if (slot + nr != nritems) {  in btrfs_del_items()
4969 		for (i = slot + nr; i < nritems; i++) {  in btrfs_del_items()
4981 			      (nritems - slot - nr));  in btrfs_del_items()
4983 	btrfs_set_header_nritems(leaf, nritems - nr);  in btrfs_del_items()
4984 	nritems -= nr;  in btrfs_del_items()
4987 	if (nritems == 0) {  in btrfs_del_items()
4996 		int used = leaf_space_used(leaf, 0, nritems);  in btrfs_del_items()
5129 	u32 nritems;  in btrfs_search_forward()  local
5147 		nritems = btrfs_header_nritems(cur);  in btrfs_search_forward()
5153 			if (slot >= nritems)  in btrfs_search_forward()
5166 		while (slot < nritems) {  in btrfs_search_forward()
5181 		if (slot >= nritems) {  in btrfs_search_forward()
5237 	int nritems;  in tree_move_next_or_upnext()  local
5238 	nritems = btrfs_header_nritems(path->nodes[*level]);  in tree_move_next_or_upnext()
5242 	while (path->slots[*level] >= nritems) {  in tree_move_next_or_upnext()
5253 		nritems = btrfs_header_nritems(path->nodes[*level]);  in tree_move_next_or_upnext()
5667 	u32 nritems;  in btrfs_next_old_leaf()  local
5672 	nritems = btrfs_header_nritems(path->nodes[0]);  in btrfs_next_old_leaf()
5673 	if (nritems == 0)  in btrfs_next_old_leaf()
5676 	btrfs_item_key_to_cpu(path->nodes[0], &key, nritems - 1);  in btrfs_next_old_leaf()
5695 	nritems = btrfs_header_nritems(path->nodes[0]);  in btrfs_next_old_leaf()
5702 	if (nritems > 0 && path->slots[0] < nritems - 1) {  in btrfs_next_old_leaf()
5722 	if (nritems > 0 && ret > 0 && path->slots[0] == nritems - 1) {  in btrfs_next_old_leaf()
5844 	u32 nritems;  in btrfs_previous_item()  local
5857 		nritems = btrfs_header_nritems(leaf);  in btrfs_previous_item()
5858 		if (nritems == 0)  in btrfs_previous_item()
5860 		if (path->slots[0] == nritems)  in btrfs_previous_item()
5886 	u32 nritems;  in btrfs_previous_extent_item()  local
5899 		nritems = btrfs_header_nritems(leaf);  in btrfs_previous_extent_item()
5900 		if (nritems == 0)  in btrfs_previous_extent_item()
5902 		if (path->slots[0] == nritems)  in btrfs_previous_extent_item()