Lines Matching defs:data_dir

133 				enum dd_data_dir data_dir, sector_t pos)
135 	struct rb_node *node = per_prio->sort_list[data_dir].rb_node;
257  * in the FIFO list. Requires !list_empty(&dd->fifo_list[data_dir]).
260 				       enum dd_data_dir data_dir)
262 	struct request *rq = rq_entry_fifo(per_prio->fifo_list[data_dir].next);
272 					     enum dd_data_dir data_dir)
274 	if (list_empty(&per_prio->fifo_list[data_dir]))
277 	return rq_entry_fifo(per_prio->fifo_list[data_dir].next);
285 					     enum dd_data_dir data_dir)
287 	return deadline_from_pos(per_prio, data_dir,
288 				 per_prio->latest_pos[data_dir]);
306 					enum dd_data_dir data_dir,
312 	dd->per_prio[prio].latest_pos[data_dir] = blk_rq_pos(rq);
327 	enum dd_data_dir data_dir;
337 		data_dir = rq_data_dir(rq);
353 		data_dir = DD_READ;
368 		data_dir = DD_WRITE;
377 	 * we are not running a batch, find best request for selected data_dir
379 	next_rq = deadline_next_request(per_prio, data_dir);
380 	if (deadline_check_fifo(per_prio, data_dir) || !next_rq) {
386 		rq = deadline_fifo_request(per_prio, data_dir);
398 	dd->last_dir = data_dir;
410 	return dd_start_request(dd, data_dir, rq);
625 	const enum dd_data_dir data_dir = rq_data_dir(rq);
659 		rq->fifo_time = jiffies + dd->fifo_expire[data_dir];
660 		list_add_tail(&rq->queuelist, &per_prio->fifo_list[data_dir]);
799 #define DEADLINE_DEBUGFS_DDIR_ATTRS(prio, data_dir, name)		\
809 	return seq_list_start(&per_prio->fifo_list[data_dir], *pos);	\
819 	return seq_list_next(v, &per_prio->fifo_list[data_dir], pos);	\
846 	rq = deadline_from_pos(per_prio, data_dir,			\
847 			       per_prio->latest_pos[data_dir]);		\