604 		       int nritems)  in __tree_mod_log_free_eb()  argument
609 	for (i = nritems - 1; i >= 0; i--) {  in __tree_mod_log_free_eb()
612 			for (j = nritems - 1; j > i; j--)  in __tree_mod_log_free_eb()
628 	int nritems = 0;  in tree_mod_log_insert_root()  local
636 		nritems = btrfs_header_nritems(old_root);  in tree_mod_log_insert_root()
637 		tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *),  in tree_mod_log_insert_root()
643 		for (i = 0; i < nritems; i++) {  in tree_mod_log_insert_root()
669 		ret = __tree_mod_log_free_eb(fs_info, tm_list, nritems);  in tree_mod_log_insert_root()
682 		for (i = 0; i < nritems; i++)  in tree_mod_log_insert_root()
830 	int nritems = 0;  in tree_mod_log_free_eb()  local
840 	nritems = btrfs_header_nritems(eb);  in tree_mod_log_free_eb()
841 	tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *), GFP_NOFS);  in tree_mod_log_free_eb()
845 	for (i = 0; i < nritems; i++) {  in tree_mod_log_free_eb()
857 	ret = __tree_mod_log_free_eb(eb->fs_info, tm_list, nritems);  in tree_mod_log_free_eb()
866 	for (i = 0; i < nritems; i++)  in tree_mod_log_free_eb()
2181 	u32 nritems;  in reada_for_search()  local
2208 	nritems = btrfs_header_nritems(node);  in reada_for_search()
2218 			if (nr >= nritems)  in reada_for_search()
2242 	int nritems;  in reada_for_balance()  local
2253 	nritems = btrfs_header_nritems(parent);  in reada_for_balance()
2269 	if (slot + 1 < nritems) {  in reada_for_balance()
2317 			u32 nritems;  in unlock_up()  local
2319 			nritems = btrfs_header_nritems(t);  in unlock_up()
2320 			if (nritems < 1 || path->slots[i] >= nritems - 1) {  in unlock_up()
3396 	int nritems;  in insert_ptr()  local
3402 	nritems = btrfs_header_nritems(lower);  in insert_ptr()
3403 	BUG_ON(slot > nritems);  in insert_ptr()
3404 	BUG_ON(nritems == BTRFS_NODEPTRS_PER_BLOCK(fs_info));  in insert_ptr()
3405 	if (slot != nritems) {  in insert_ptr()
3408 					nritems - slot);  in insert_ptr()
3414 			      (nritems - slot) * sizeof(struct btrfs_key_ptr));  in insert_ptr()
3425 	btrfs_set_header_nritems(lower, nritems + 1);  in insert_ptr()
3531 	int nritems = btrfs_header_nritems(l);  in leaf_space_used()  local
3532 	int end = min(nritems, start + nr) - 1;  in leaf_space_used()
3555 	int nritems = btrfs_header_nritems(leaf);  in btrfs_leaf_free_space()  local
3558 	ret = BTRFS_LEAF_DATA_SIZE(fs_info) - leaf_space_used(leaf, 0, nritems);  in btrfs_leaf_free_space()
3564 			   leaf_space_used(leaf, 0, nritems), nritems);  in btrfs_leaf_free_space()
4030 				    int slot, int mid, int nritems)  in copy_for_split()  argument
4040 	nritems = nritems - mid;  in copy_for_split()
4041 	btrfs_set_header_nritems(right, nritems);  in copy_for_split()
4046 			   nritems * sizeof(struct btrfs_item));  in copy_for_split()
4055 	for (i = 0; i < nritems; i++) {  in copy_for_split()
4106 	u32 nritems;  in push_for_double_split()  local
4124 	nritems = btrfs_header_nritems(path->nodes[0]);  in push_for_double_split()
4129 	if (path->slots[0] == 0 || path->slots[0] == nritems)  in push_for_double_split()
4166 	u32 nritems;  in split_leaf()  local
4220 	nritems = btrfs_header_nritems(l);  in split_leaf()
4221 	mid = (nritems + 1) / 2;  in split_leaf()
4224 		if (nritems == 1 ||  in split_leaf()
4225 		    leaf_space_used(l, mid, nritems - mid) + data_size >  in split_leaf()
4227 			if (slot >= nritems) {  in split_leaf()
4231 				if (mid != nritems &&  in split_leaf()
4232 				    leaf_space_used(l, mid, nritems - mid) +  in split_leaf()
4249 				if (mid != nritems &&  in split_leaf()
4250 				    leaf_space_used(l, mid, nritems - mid) +  in split_leaf()
4301 	copy_for_split(trans, fs_info, path, l, right, slot, mid, nritems);  in split_leaf()
4397 	u32 nritems;  in split_item()  local
4419 	nritems = btrfs_header_nritems(leaf);  in split_item()
4420 	if (slot != nritems) {  in split_item()
4424 				(nritems - slot) * sizeof(struct btrfs_item));  in split_item()
4439 	btrfs_set_header_nritems(leaf, nritems + 1);  in split_item()
4536 	u32 nritems;  in btrfs_truncate_item()  local
4553 	nritems = btrfs_header_nritems(leaf);  in btrfs_truncate_item()
4561 	BUG_ON(slot >= nritems);  in btrfs_truncate_item()
4567 	for (i = slot; i < nritems; i++) {  in btrfs_truncate_item()
4635 	u32 nritems;  in btrfs_extend_item()  local
4646 	nritems = btrfs_header_nritems(leaf);  in btrfs_extend_item()
4657 	if (slot >= nritems) {  in btrfs_extend_item()
4660 			   slot, nritems);  in btrfs_extend_item()
4668 	for (i = slot; i < nritems; i++) {  in btrfs_extend_item()
4706 	u32 nritems;  in setup_items_for_insert()  local
4724 	nritems = btrfs_header_nritems(leaf);  in setup_items_for_insert()
4734 	if (slot != nritems) {  in setup_items_for_insert()
4747 		for (i = slot; i < nritems; i++) {  in setup_items_for_insert()
4758 			      (nritems - slot) * sizeof(struct btrfs_item));  in setup_items_for_insert()
4778 	btrfs_set_header_nritems(leaf, nritems + nr);  in setup_items_for_insert()
4858 	u32 nritems;  in del_ptr()  local
4861 	nritems = btrfs_header_nritems(parent);  in del_ptr()
4862 	if (slot != nritems - 1) {  in del_ptr()
4865 					nritems - slot - 1);  in del_ptr()
4872 			      (nritems - slot - 1));  in del_ptr()
4879 	nritems--;  in del_ptr()
4880 	btrfs_set_header_nritems(parent, nritems);  in del_ptr()
4881 	if (nritems == 0 && parent == root->node) {  in del_ptr()
4939 	u32 nritems;  in btrfs_del_items()  local
4950 	nritems = btrfs_header_nritems(leaf);  in btrfs_del_items()
4952 	if (slot + nr != nritems) {  in btrfs_del_items()
4960 		for (i = slot + nr; i < nritems; i++) {  in btrfs_del_items()
4972 			      (nritems - slot - nr));  in btrfs_del_items()
4974 	btrfs_set_header_nritems(leaf, nritems - nr);  in btrfs_del_items()
4975 	nritems -= nr;  in btrfs_del_items()
4978 	if (nritems == 0) {  in btrfs_del_items()
4987 		int used = leaf_space_used(leaf, 0, nritems);  in btrfs_del_items()
5118 	u32 nritems;  in btrfs_search_forward()  local
5136 		nritems = btrfs_header_nritems(cur);  in btrfs_search_forward()
5142 			if (slot >= nritems)  in btrfs_search_forward()
5155 		while (slot < nritems) {  in btrfs_search_forward()
5170 		if (slot >= nritems) {  in btrfs_search_forward()
5234 	int nritems;  in tree_move_next_or_upnext()  local
5235 	nritems = btrfs_header_nritems(path->nodes[*level]);  in tree_move_next_or_upnext()
5239 	while (path->slots[*level] >= nritems) {  in tree_move_next_or_upnext()
5250 		nritems = btrfs_header_nritems(path->nodes[*level]);  in tree_move_next_or_upnext()
5674 	u32 nritems;  in btrfs_next_old_leaf()  local
5679 	nritems = btrfs_header_nritems(path->nodes[0]);  in btrfs_next_old_leaf()
5680 	if (nritems == 0)  in btrfs_next_old_leaf()
5683 	btrfs_item_key_to_cpu(path->nodes[0], &key, nritems - 1);  in btrfs_next_old_leaf()
5702 	nritems = btrfs_header_nritems(path->nodes[0]);  in btrfs_next_old_leaf()
5709 	if (nritems > 0 && path->slots[0] < nritems - 1) {  in btrfs_next_old_leaf()
5729 	if (nritems > 0 && ret > 0 && path->slots[0] == nritems - 1) {  in btrfs_next_old_leaf()
5851 	u32 nritems;  in btrfs_previous_item()  local
5864 		nritems = btrfs_header_nritems(leaf);  in btrfs_previous_item()
5865 		if (nritems == 0)  in btrfs_previous_item()
5867 		if (path->slots[0] == nritems)  in btrfs_previous_item()
5893 	u32 nritems;  in btrfs_previous_extent_item()  local
5906 		nritems = btrfs_header_nritems(leaf);  in btrfs_previous_extent_item()
5907 		if (nritems == 0)  in btrfs_previous_extent_item()
5909 		if (path->slots[0] == nritems)  in btrfs_previous_extent_item()