nr_items          306 fs/btrfs/ctree.c 		int nr_items;
nr_items          518 fs/btrfs/ctree.c 		int dst_slot, int src_slot, int nr_items)
nr_items          529 fs/btrfs/ctree.c 	tm_list = kcalloc(nr_items, sizeof(struct tree_mod_elem *), GFP_NOFS);
nr_items          542 fs/btrfs/ctree.c 	tm->move.nr_items = nr_items;
nr_items          545 fs/btrfs/ctree.c 	for (i = 0; i + dst_slot < src_slot && i < nr_items; i++) {
nr_items          563 fs/btrfs/ctree.c 	for (i = 0; i + dst_slot < src_slot && i < nr_items; i++) {
nr_items          577 fs/btrfs/ctree.c 	for (i = 0; i < nr_items; i++) {
nr_items          747 fs/btrfs/ctree.c 		     unsigned long src_offset, int nr_items)
nr_items          762 fs/btrfs/ctree.c 	tm_list = kcalloc(nr_items * 2, sizeof(struct tree_mod_elem *),
nr_items          768 fs/btrfs/ctree.c 	tm_list_rem = tm_list + nr_items;
nr_items          769 fs/btrfs/ctree.c 	for (i = 0; i < nr_items; i++) {
nr_items          789 fs/btrfs/ctree.c 	for (i = 0; i < nr_items; i++) {
nr_items          804 fs/btrfs/ctree.c 	for (i = 0; i < nr_items * 2; i++) {
nr_items         1265 fs/btrfs/ctree.c 					      tm->move.nr_items * p_size);
nr_items         1777 fs/btrfs/extent-tree.c 	int nr_items = 1;	/* Dropping this ref head update. */
nr_items         1804 fs/btrfs/extent-tree.c 			nr_items += btrfs_csum_bytes_to_leaves(fs_info,
nr_items         1809 fs/btrfs/extent-tree.c 	btrfs_delayed_refs_rsv_release(fs_info, nr_items);
nr_items         2118 fs/btrfs/ioctl.c 		if (*num_found >= sk->nr_items) {
nr_items         2211 fs/btrfs/ioctl.c 	sk->nr_items = num_found;
nr_items          316 fs/btrfs/space-info.c 					 unsigned long nr_pages, int nr_items)
nr_items          331 fs/btrfs/space-info.c 		btrfs_start_delalloc_roots(fs_info, nr_items);
nr_items          333 fs/btrfs/space-info.c 			btrfs_wait_ordered_roots(fs_info, nr_items, 0, (u64)-1);
nr_items         7592 fs/btrfs/volumes.c 			if (stats->nr_items > i)
nr_items         7602 fs/btrfs/volumes.c 			if (stats->nr_items > i)
nr_items         7605 fs/btrfs/volumes.c 	if (stats->nr_items > BTRFS_DEV_STAT_VALUES_MAX)
nr_items         7606 fs/btrfs/volumes.c 		stats->nr_items = BTRFS_DEV_STAT_VALUES_MAX;
nr_items          790 fs/xfs/xfs_trans.c 	int			nr_items,
nr_items          797 fs/xfs/xfs_trans.c 	xfs_trans_ail_update_bulk(ailp, cur, log_items, nr_items, commit_lsn);
nr_items          799 fs/xfs/xfs_trans.c 	for (i = 0; i < nr_items; i++) {
nr_items          710 fs/xfs/xfs_trans_ail.c 	int			nr_items,
nr_items          718 fs/xfs/xfs_trans_ail.c 	ASSERT(nr_items > 0);		/* Not required, but true. */
nr_items          721 fs/xfs/xfs_trans_ail.c 	for (i = 0; i < nr_items; i++) {
nr_items           71 fs/xfs/xfs_trans_priv.h 				struct xfs_log_item **log_items, int nr_items,
nr_items           31 include/linux/list_lru.h 	long			nr_items;
nr_items           49 include/linux/list_lru.h 	long nr_items;
nr_items          488 include/uapi/linux/btrfs.h 	__u32 nr_items;		/* in/out */
nr_items          662 include/uapi/linux/btrfs.h 	__u64 nr_items;				/* in/out */
nr_items          137 mm/list_lru.c  		if (!l->nr_items++)
nr_items          140 mm/list_lru.c  		nlru->nr_items++;
nr_items          159 mm/list_lru.c  		l->nr_items--;
nr_items          160 mm/list_lru.c  		nlru->nr_items--;
nr_items          172 mm/list_lru.c  	list->nr_items--;
nr_items          180 mm/list_lru.c  	list->nr_items--;
nr_items          193 mm/list_lru.c  	count = l->nr_items;
nr_items          205 mm/list_lru.c  	return nlru->nr_items;
nr_items          239 mm/list_lru.c  			nlru->nr_items--;
nr_items          328 mm/list_lru.c  	l->nr_items = 0;
nr_items          559 mm/list_lru.c  	set = (!dst->nr_items && src->nr_items);
nr_items          560 mm/list_lru.c  	dst->nr_items += src->nr_items;
nr_items          563 mm/list_lru.c  	src->nr_items = 0;