nritems            83 fs/btrfs/backref.c 	int nritems;
nritems            92 fs/btrfs/backref.c 	nritems = btrfs_header_nritems(eb);
nritems            93 fs/btrfs/backref.c 	for (slot = 0; slot < nritems; ++slot) {
nritems           502 fs/btrfs/block-group.c 	u32 nritems;
nritems           541 fs/btrfs/block-group.c 	nritems = btrfs_header_nritems(leaf);
nritems           549 fs/btrfs/block-group.c 		if (path->slots[0] < nritems) {
nritems           575 fs/btrfs/block-group.c 			nritems = btrfs_header_nritems(leaf);
nritems           593 fs/btrfs/ctree.c 		       int nritems)
nritems           598 fs/btrfs/ctree.c 	for (i = nritems - 1; i >= 0; i--) {
nritems           601 fs/btrfs/ctree.c 			for (j = nritems - 1; j > i; j--)
nritems           617 fs/btrfs/ctree.c 	int nritems = 0;
nritems           625 fs/btrfs/ctree.c 		nritems = btrfs_header_nritems(old_root);
nritems           626 fs/btrfs/ctree.c 		tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *),
nritems           632 fs/btrfs/ctree.c 		for (i = 0; i < nritems; i++) {
nritems           658 fs/btrfs/ctree.c 		ret = __tree_mod_log_free_eb(fs_info, tm_list, nritems);
nritems           671 fs/btrfs/ctree.c 		for (i = 0; i < nritems; i++)
nritems           819 fs/btrfs/ctree.c 	int nritems = 0;
nritems           829 fs/btrfs/ctree.c 	nritems = btrfs_header_nritems(eb);
nritems           830 fs/btrfs/ctree.c 	tm_list = kcalloc(nritems, sizeof(struct tree_mod_elem *), GFP_NOFS);
nritems           834 fs/btrfs/ctree.c 	for (i = 0; i < nritems; i++) {
nritems           846 fs/btrfs/ctree.c 	ret = __tree_mod_log_free_eb(eb->fs_info, tm_list, nritems);
nritems           855 fs/btrfs/ctree.c 	for (i = 0; i < nritems; i++)
nritems          2217 fs/btrfs/ctree.c 	u32 nritems;
nritems          2244 fs/btrfs/ctree.c 	nritems = btrfs_header_nritems(node);
nritems          2254 fs/btrfs/ctree.c 			if (nr >= nritems)
nritems          2278 fs/btrfs/ctree.c 	int nritems;
nritems          2289 fs/btrfs/ctree.c 	nritems = btrfs_header_nritems(parent);
nritems          2305 fs/btrfs/ctree.c 	if (slot + 1 < nritems) {
nritems          2353 fs/btrfs/ctree.c 			u32 nritems;
nritems          2355 fs/btrfs/ctree.c 			nritems = btrfs_header_nritems(t);
nritems          2356 fs/btrfs/ctree.c 			if (nritems < 1 || path->slots[i] >= nritems - 1) {
nritems          3452 fs/btrfs/ctree.c 	int nritems;
nritems          3458 fs/btrfs/ctree.c 	nritems = btrfs_header_nritems(lower);
nritems          3459 fs/btrfs/ctree.c 	BUG_ON(slot > nritems);
nritems          3460 fs/btrfs/ctree.c 	BUG_ON(nritems == BTRFS_NODEPTRS_PER_BLOCK(trans->fs_info));
nritems          3461 fs/btrfs/ctree.c 	if (slot != nritems) {
nritems          3464 fs/btrfs/ctree.c 					nritems - slot);
nritems          3470 fs/btrfs/ctree.c 			      (nritems - slot) * sizeof(struct btrfs_key_ptr));
nritems          3481 fs/btrfs/ctree.c 	btrfs_set_header_nritems(lower, nritems + 1);
nritems          3587 fs/btrfs/ctree.c 	int nritems = btrfs_header_nritems(l);
nritems          3588 fs/btrfs/ctree.c 	int end = min(nritems, start + nr) - 1;
nritems          3611 fs/btrfs/ctree.c 	int nritems = btrfs_header_nritems(leaf);
nritems          3614 fs/btrfs/ctree.c 	ret = BTRFS_LEAF_DATA_SIZE(fs_info) - leaf_space_used(leaf, 0, nritems);
nritems          3620 fs/btrfs/ctree.c 			   leaf_space_used(leaf, 0, nritems), nritems);
nritems          4085 fs/btrfs/ctree.c 				    int slot, int mid, int nritems)
nritems          4094 fs/btrfs/ctree.c 	nritems = nritems - mid;
nritems          4095 fs/btrfs/ctree.c 	btrfs_set_header_nritems(right, nritems);
nritems          4100 fs/btrfs/ctree.c 			   nritems * sizeof(struct btrfs_item));
nritems          4110 fs/btrfs/ctree.c 	for (i = 0; i < nritems; i++) {
nritems          4159 fs/btrfs/ctree.c 	u32 nritems;
nritems          4177 fs/btrfs/ctree.c 	nritems = btrfs_header_nritems(path->nodes[0]);
nritems          4182 fs/btrfs/ctree.c 	if (path->slots[0] == 0 || path->slots[0] == nritems)
nritems          4219 fs/btrfs/ctree.c 	u32 nritems;
nritems          4272 fs/btrfs/ctree.c 	nritems = btrfs_header_nritems(l);
nritems          4273 fs/btrfs/ctree.c 	mid = (nritems + 1) / 2;
nritems          4276 fs/btrfs/ctree.c 		if (nritems == 1 ||
nritems          4277 fs/btrfs/ctree.c 		    leaf_space_used(l, mid, nritems - mid) + data_size >
nritems          4279 fs/btrfs/ctree.c 			if (slot >= nritems) {
nritems          4283 fs/btrfs/ctree.c 				if (mid != nritems &&
nritems          4284 fs/btrfs/ctree.c 				    leaf_space_used(l, mid, nritems - mid) +
nritems          4301 fs/btrfs/ctree.c 				if (mid != nritems &&
nritems          4302 fs/btrfs/ctree.c 				    leaf_space_used(l, mid, nritems - mid) +
nritems          4353 fs/btrfs/ctree.c 	copy_for_split(trans, path, l, right, slot, mid, nritems);
nritems          4447 fs/btrfs/ctree.c 	u32 nritems;
nritems          4469 fs/btrfs/ctree.c 	nritems = btrfs_header_nritems(leaf);
nritems          4470 fs/btrfs/ctree.c 	if (slot != nritems) {
nritems          4474 fs/btrfs/ctree.c 				(nritems - slot) * sizeof(struct btrfs_item));
nritems          4489 fs/btrfs/ctree.c 	btrfs_set_header_nritems(leaf, nritems + 1);
nritems          4585 fs/btrfs/ctree.c 	u32 nritems;
nritems          4600 fs/btrfs/ctree.c 	nritems = btrfs_header_nritems(leaf);
nritems          4608 fs/btrfs/ctree.c 	BUG_ON(slot >= nritems);
nritems          4615 fs/btrfs/ctree.c 	for (i = slot; i < nritems; i++) {
nritems          4682 fs/btrfs/ctree.c 	u32 nritems;
nritems          4691 fs/btrfs/ctree.c 	nritems = btrfs_header_nritems(leaf);
nritems          4702 fs/btrfs/ctree.c 	if (slot >= nritems) {
nritems          4705 fs/btrfs/ctree.c 			   slot, nritems);
nritems          4714 fs/btrfs/ctree.c 	for (i = slot; i < nritems; i++) {
nritems          4752 fs/btrfs/ctree.c 	u32 nritems;
nritems          4768 fs/btrfs/ctree.c 	nritems = btrfs_header_nritems(leaf);
nritems          4779 fs/btrfs/ctree.c 	if (slot != nritems) {
nritems          4792 fs/btrfs/ctree.c 		for (i = slot; i < nritems; i++) {
nritems          4803 fs/btrfs/ctree.c 			      (nritems - slot) * sizeof(struct btrfs_item));
nritems          4823 fs/btrfs/ctree.c 	btrfs_set_header_nritems(leaf, nritems + nr);
nritems          4903 fs/btrfs/ctree.c 	u32 nritems;
nritems          4906 fs/btrfs/ctree.c 	nritems = btrfs_header_nritems(parent);
nritems          4907 fs/btrfs/ctree.c 	if (slot != nritems - 1) {
nritems          4910 fs/btrfs/ctree.c 					nritems - slot - 1);
nritems          4917 fs/btrfs/ctree.c 			      (nritems - slot - 1));
nritems          4924 fs/btrfs/ctree.c 	nritems--;
nritems          4925 fs/btrfs/ctree.c 	btrfs_set_header_nritems(parent, nritems);
nritems          4926 fs/btrfs/ctree.c 	if (nritems == 0 && parent == root->node) {
nritems          4984 fs/btrfs/ctree.c 	u32 nritems;
nritems          4992 fs/btrfs/ctree.c 	nritems = btrfs_header_nritems(leaf);
nritems          4994 fs/btrfs/ctree.c 	if (slot + nr != nritems) {
nritems          5004 fs/btrfs/ctree.c 		for (i = slot + nr; i < nritems; i++) {
nritems          5016 fs/btrfs/ctree.c 			      (nritems - slot - nr));
nritems          5018 fs/btrfs/ctree.c 	btrfs_set_header_nritems(leaf, nritems - nr);
nritems          5019 fs/btrfs/ctree.c 	nritems -= nr;
nritems          5022 fs/btrfs/ctree.c 	if (nritems == 0) {
nritems          5031 fs/btrfs/ctree.c 		int used = leaf_space_used(leaf, 0, nritems);
nritems          5161 fs/btrfs/ctree.c 	u32 nritems;
nritems          5179 fs/btrfs/ctree.c 		nritems = btrfs_header_nritems(cur);
nritems          5189 fs/btrfs/ctree.c 			if (slot >= nritems)
nritems          5202 fs/btrfs/ctree.c 		while (slot < nritems) {
nritems          5217 fs/btrfs/ctree.c 		if (slot >= nritems) {
nritems          5353 fs/btrfs/ctree.c 	u32 nritems;
nritems          5358 fs/btrfs/ctree.c 	nritems = btrfs_header_nritems(path->nodes[0]);
nritems          5359 fs/btrfs/ctree.c 	if (nritems == 0)
nritems          5362 fs/btrfs/ctree.c 	btrfs_item_key_to_cpu(path->nodes[0], &key, nritems - 1);
nritems          5381 fs/btrfs/ctree.c 	nritems = btrfs_header_nritems(path->nodes[0]);
nritems          5388 fs/btrfs/ctree.c 	if (nritems > 0 && path->slots[0] < nritems - 1) {
nritems          5408 fs/btrfs/ctree.c 	if (nritems > 0 && ret > 0 && path->slots[0] == nritems - 1) {
nritems          5526 fs/btrfs/ctree.c 	u32 nritems;
nritems          5539 fs/btrfs/ctree.c 		nritems = btrfs_header_nritems(leaf);
nritems          5540 fs/btrfs/ctree.c 		if (nritems == 0)
nritems          5542 fs/btrfs/ctree.c 		if (path->slots[0] == nritems)
nritems          5568 fs/btrfs/ctree.c 	u32 nritems;
nritems          5581 fs/btrfs/ctree.c 		nritems = btrfs_header_nritems(leaf);
nritems          5582 fs/btrfs/ctree.c 		if (nritems == 0)
nritems          5584 fs/btrfs/ctree.c 		if (path->slots[0] == nritems)
nritems           163 fs/btrfs/ctree.h 	__le32 nritems;
nritems          1882 fs/btrfs/ctree.h BTRFS_SETGET_HEADER_FUNCS(header_nritems, struct btrfs_header, nritems, 32);
nritems          1889 fs/btrfs/ctree.h 			 nritems, 32);
nritems           303 fs/btrfs/dir-item.c 	u32 nritems;
nritems           315 fs/btrfs/dir-item.c 	nritems = btrfs_header_nritems(leaf);
nritems           318 fs/btrfs/dir-item.c 		if (path->slots[0] >= nritems) {
nritems           325 fs/btrfs/dir-item.c 			nritems = btrfs_header_nritems(leaf);
nritems           486 fs/btrfs/extent-tree.c 	u32 nritems;
nritems           515 fs/btrfs/extent-tree.c 	nritems = btrfs_header_nritems(leaf);
nritems           517 fs/btrfs/extent-tree.c 		if (path->slots[0] >= nritems) {
nritems           525 fs/btrfs/extent-tree.c 			nritems = btrfs_header_nritems(leaf);
nritems          2427 fs/btrfs/extent-tree.c 	u32 nritems;
nritems          2441 fs/btrfs/extent-tree.c 	nritems = btrfs_header_nritems(buf);
nritems          2456 fs/btrfs/extent-tree.c 	for (i = 0; i < nritems; i++) {
nritems          4605 fs/btrfs/extent-tree.c 	u32 nritems;
nritems          4622 fs/btrfs/extent-tree.c 	nritems = btrfs_header_nritems(eb);
nritems          4624 fs/btrfs/extent-tree.c 	for (slot = path->slots[wc->level]; slot < nritems; slot++) {
nritems          3859 fs/btrfs/extent_io.c 	u32 nritems;
nritems          3870 fs/btrfs/extent_io.c 	nritems = btrfs_header_nritems(eb);
nritems          3872 fs/btrfs/extent_io.c 		end = btrfs_node_key_ptr_offset(nritems);
nritems          3880 fs/btrfs/extent_io.c 		start = btrfs_item_nr_offset(nritems);
nritems           753 fs/btrfs/file-item.c 	u32 nritems;
nritems           798 fs/btrfs/file-item.c 		nritems = btrfs_header_nritems(path->nodes[0]);
nritems           799 fs/btrfs/file-item.c 		if (!nritems || (path->slots[0] >= nritems - 1)) {
nritems          3730 fs/btrfs/inode.c 	u32 nritems = btrfs_header_nritems(leaf);
nritems          3745 fs/btrfs/inode.c 	while (slot < nritems) {
nritems          2044 fs/btrfs/ioctl.c 	int nritems;
nritems          2051 fs/btrfs/ioctl.c 	nritems = btrfs_header_nritems(leaf);
nritems          2054 fs/btrfs/ioctl.c 		i = nritems;
nritems          2059 fs/btrfs/ioctl.c 	for (i = slot; i < nritems; i++) {
nritems          3506 fs/btrfs/ioctl.c 	u32 nritems;
nritems          3561 fs/btrfs/ioctl.c 		nritems = btrfs_header_nritems(path->nodes[0]);
nritems          3563 fs/btrfs/ioctl.c 		if (path->slots[0] >= nritems) {
nritems          3569 fs/btrfs/ioctl.c 			nritems = btrfs_header_nritems(path->nodes[0]);
nritems            98 fs/btrfs/reada.c 	int nritems;
nritems           131 fs/btrfs/reada.c 	nritems = btrfs_header_nritems(eb);
nritems           133 fs/btrfs/reada.c 	for (i = 0; i < nritems; i++) {
nritems           140 fs/btrfs/reada.c 		if (i + 1 < nritems)
nritems           505 fs/btrfs/ref-verify.c 	int nritems = btrfs_header_nritems(leaf);
nritems           507 fs/btrfs/ref-verify.c 	for (i = 0; i < nritems; i++) {
nritems          1676 fs/btrfs/relocation.c 	u32 nritems;
nritems          1691 fs/btrfs/relocation.c 	nritems = btrfs_header_nritems(leaf);
nritems          1692 fs/btrfs/relocation.c 	for (i = 0; i < nritems; i++) {
nritems          2021 fs/btrfs/relocation.c 	u32 nritems;
nritems          2032 fs/btrfs/relocation.c 		nritems = btrfs_header_nritems(eb);
nritems          2033 fs/btrfs/relocation.c 		while (path->slots[i] + 1 < nritems) {
nritems          2061 fs/btrfs/relocation.c 	u32 nritems;
nritems          2069 fs/btrfs/relocation.c 		nritems = btrfs_header_nritems(eb);
nritems          2070 fs/btrfs/relocation.c 		while (path->slots[i] < nritems) {
nritems          2076 fs/btrfs/relocation.c 		if (path->slots[i] >= nritems) {
nritems          3665 fs/btrfs/relocation.c 	u32 nritems;
nritems          3715 fs/btrfs/relocation.c 	nritems = btrfs_header_nritems(leaf);
nritems          3729 fs/btrfs/relocation.c 			path->slots[0] = nritems;
nritems          3733 fs/btrfs/relocation.c 		while (path->slots[0] >= nritems) {
nritems          3743 fs/btrfs/relocation.c 			nritems = btrfs_header_nritems(leaf);
nritems          3755 fs/btrfs/relocation.c 					path->slots[0] = nritems;
nritems          3803 fs/btrfs/relocation.c 			path->slots[0] = nritems;
nritems          6574 fs/btrfs/send.c 	int nritems;
nritems          6575 fs/btrfs/send.c 	nritems = btrfs_header_nritems(path->nodes[*level]);
nritems          6579 fs/btrfs/send.c 	while (path->slots[*level] >= nritems) {
nritems          6590 fs/btrfs/send.c 		nritems = btrfs_header_nritems(path->nodes[*level]);
nritems          1301 fs/btrfs/tree-checker.c 	u32 nritems = btrfs_header_nritems(leaf);
nritems          1319 fs/btrfs/tree-checker.c 	if (nritems == 0 && !btrfs_header_flag(leaf, BTRFS_HEADER_FLAG_RELOC)) {
nritems          1343 fs/btrfs/tree-checker.c 	if (nritems == 0)
nritems          1357 fs/btrfs/tree-checker.c 	for (slot = 0; slot < nritems; slot++) {
nritems            52 fs/btrfs/tree-defrag.c 		u32 nritems;
nritems            56 fs/btrfs/tree-defrag.c 		nritems = btrfs_header_nritems(root_node);
nritems            60 fs/btrfs/tree-defrag.c 				      nritems - 1);
nritems          2148 fs/btrfs/tree-log.c 	int nritems;
nritems          2185 fs/btrfs/tree-log.c 	nritems = btrfs_header_nritems(path->nodes[0]);
nritems          2187 fs/btrfs/tree-log.c 	if (path->slots[0] >= nritems) {
nritems          2327 fs/btrfs/tree-log.c 	int nritems;
nritems          2342 fs/btrfs/tree-log.c 	nritems = btrfs_header_nritems(path->nodes[0]);
nritems          2343 fs/btrfs/tree-log.c 	for (i = path->slots[0]; i < nritems; i++) {
nritems          2471 fs/btrfs/tree-log.c 			int nritems;
nritems          2477 fs/btrfs/tree-log.c 			nritems = btrfs_header_nritems(path->nodes[0]);
nritems          2478 fs/btrfs/tree-log.c 			if (path->slots[0] >= nritems) {
nritems          2538 fs/btrfs/tree-log.c 	int nritems;
nritems          2558 fs/btrfs/tree-log.c 	nritems = btrfs_header_nritems(eb);
nritems          2559 fs/btrfs/tree-log.c 	for (i = 0; i < nritems; i++) {
nritems          3579 fs/btrfs/tree-log.c 	int nritems;
nritems          3660 fs/btrfs/tree-log.c 		nritems = btrfs_header_nritems(src);
nritems          3661 fs/btrfs/tree-log.c 		for (i = path->slots[0]; i < nritems; i++) {
nritems          3706 fs/btrfs/tree-log.c 		path->slots[0] = nritems;
nritems          4539 fs/btrfs/tree-log.c 		int nritems = btrfs_header_nritems(leaf);
nritems          4541 fs/btrfs/tree-log.c 		if (slot >= nritems) {
nritems          5039 fs/btrfs/tree-log.c 	int nritems;
nritems          5267 fs/btrfs/tree-log.c 		nritems = btrfs_header_nritems(path->nodes[0]);
nritems          5269 fs/btrfs/tree-log.c 		if (path->slots[0] < nritems) {
nritems          5571 fs/btrfs/tree-log.c 		int nritems;
nritems          5594 fs/btrfs/tree-log.c 		nritems = btrfs_header_nritems(leaf);
nritems          5595 fs/btrfs/tree-log.c 		for (i = path->slots[0]; i < nritems; i++) {
nritems          5652 fs/btrfs/tree-log.c 		if (i == nritems) {