reada             892 drivers/md/bcache/request.c 	unsigned int reada = 0;
reada             907 drivers/md/bcache/request.c 		reada = min_t(sector_t, dc->readahead >> 9,
reada             910 drivers/md/bcache/request.c 	s->insert_bio_sectors = min(sectors, bio_sectors(bio) + reada);
reada             944 drivers/md/bcache/request.c 	if (reada)
reada             529 fs/btrfs/block-group.c 	path->reada = READA_FORWARD;
reada            1716 fs/btrfs/block-group.c 	path->reada = READA_FORWARD;
reada            2248 fs/btrfs/ctree.c 		if (path->reada == READA_BACK) {
reada            2252 fs/btrfs/ctree.c 		} else if (path->reada == READA_FORWARD) {
reada            2257 fs/btrfs/ctree.c 		if (path->reada == READA_BACK && objectid) {
reada            2477 fs/btrfs/ctree.c 	if (p->reada != READA_NONE)
reada             351 fs/btrfs/ctree.h 	u8 reada;
reada            1450 fs/btrfs/extent-tree.c 	path->reada = READA_FORWARD;
reada            1475 fs/btrfs/extent-tree.c 	path->reada = READA_FORWARD;
reada            1585 fs/btrfs/extent-tree.c 	path->reada = READA_FORWARD;
reada            2977 fs/btrfs/extent-tree.c 	path->reada = READA_FORWARD;
reada            4633 fs/btrfs/extent-tree.c 			goto reada;
reada            4650 fs/btrfs/extent-tree.c 				goto reada;
reada            4668 fs/btrfs/extent-tree.c reada:
reada            4806 fs/btrfs/extent-tree.c 	int reada = 0;
reada            4835 fs/btrfs/extent-tree.c 		reada = 1;
reada            4887 fs/btrfs/extent-tree.c 		if (reada && level == 1)
reada             194 fs/btrfs/file-item.c 		path->reada = READA_FORWARD;
reada             328 fs/btrfs/file-item.c 		path->reada = READA_FORWARD;
reada            1057 fs/btrfs/free-space-tree.c 	path->reada = READA_FORWARD;
reada            1553 fs/btrfs/free-space-tree.c 	path->reada = READA_FORWARD;
reada              53 fs/btrfs/inode-map.c 	path->reada = READA_FORWARD;
reada            3564 fs/btrfs/inode.c 	path->reada = READA_BACK;
reada            4753 fs/btrfs/inode.c 	path->reada = READA_BACK;
reada            6119 fs/btrfs/inode.c 	path->reada = READA_FORWARD;
reada            7071 fs/btrfs/inode.c 	path->reada = READA_FORWARD;
reada            3523 fs/btrfs/ioctl.c 	path->reada = READA_FORWARD;
reada             714 fs/btrfs/relocation.c 	path1->reada = READA_FORWARD;
reada             715 fs/btrfs/relocation.c 	path2->reada = READA_FORWARD;
reada            2285 fs/btrfs/relocation.c 	path->reada = READA_FORWARD;
reada            3691 fs/btrfs/relocation.c 	path->reada = READA_FORWARD;
reada            4086 fs/btrfs/relocation.c 	path->reada = READA_FORWARD;
reada            4514 fs/btrfs/relocation.c 	path->reada = READA_BACK;
reada            3491 fs/btrfs/scrub.c 	path->reada = READA_FORWARD;
reada            1636 fs/btrfs/volumes.c 	path->reada = READA_FORWARD;
reada            4747 fs/btrfs/volumes.c 	path->reada = READA_BACK;
reada            7841 fs/btrfs/volumes.c 	path->reada = READA_FORWARD;
reada             270 fs/btrfs/xattr.c 	path->reada = READA_FORWARD;
reada              90 fs/reiserfs/dir.c 	path_to_entry.reada = PATH_READA;
reada            2135 fs/reiserfs/reiserfs.h 	int reada;
reada            2144 fs/reiserfs/reiserfs.h struct treepath var = {.path_length = ILLEGAL_PATH_ELEMENT_OFFSET, .reada = 0,}
reada             779 fs/reiserfs/stree.c 		if ((search_path->reada & PATH_READA) &&
reada             785 fs/reiserfs/stree.c 			if (search_path->reada & PATH_READA_BACK)
reada             792 fs/reiserfs/stree.c 				if (search_path->reada & PATH_READA_BACK)
reada            1940 fs/reiserfs/stree.c 		s_search_path.reada = PATH_READA | PATH_READA_BACK;