reada_count      4588 fs/btrfs/extent-tree.c 	int reada_count;
reada_count      4613 fs/btrfs/extent-tree.c 		wc->reada_count = wc->reada_count * 2 / 3;
reada_count      4614 fs/btrfs/extent-tree.c 		wc->reada_count = max(wc->reada_count, 2);
reada_count      4616 fs/btrfs/extent-tree.c 		wc->reada_count = wc->reada_count * 3 / 2;
reada_count      4617 fs/btrfs/extent-tree.c 		wc->reada_count = min_t(int, wc->reada_count,
reada_count      4625 fs/btrfs/extent-tree.c 		if (nread >= wc->reada_count)
reada_count      5308 fs/btrfs/extent-tree.c 	wc->reada_count = BTRFS_NODEPTRS_PER_BLOCK(fs_info);
reada_count      5475 fs/btrfs/extent-tree.c 	wc->reada_count = BTRFS_NODEPTRS_PER_BLOCK(fs_info);
reada_count       599 fs/reiserfs/stree.c 	int reada_count = 0;
reada_count       654 fs/reiserfs/stree.c 			if (!buffer_uptodate(bh) && reada_count > 1)
reada_count       656 fs/reiserfs/stree.c 						    reada_blocks, reada_count);
reada_count       674 fs/reiserfs/stree.c 		reada_count = 0;
reada_count       787 fs/reiserfs/stree.c 			while (reada_count < SEARCH_BY_KEY_READA) {
reada_count       790 fs/reiserfs/stree.c 				reada_blocks[reada_count++] =