45 	struct list_head fifo_list[2];  member
185 	struct request *rq = rq_entry_fifo(dd->fifo_list[ddir].next);  in deadline_check_fifo()
209 	if (list_empty(&dd->fifo_list[data_dir]))  in deadline_fifo_request()
212 	rq = rq_entry_fifo(dd->fifo_list[data_dir].next);  in deadline_fifo_request()
221 	list_for_each_entry(rq, &dd->fifo_list[WRITE], queuelist) {  in deadline_fifo_request()
283 	reads = !list_empty(&dd->fifo_list[READ]);  in __dd_dispatch_request()
284 	writes = !list_empty(&dd->fifo_list[WRITE]);  in __dd_dispatch_request()
397 	BUG_ON(!list_empty(&dd->fifo_list[READ]));  in dd_exit_queue()
398 	BUG_ON(!list_empty(&dd->fifo_list[WRITE]));  in dd_exit_queue()
422 	INIT_LIST_HEAD(&dd->fifo_list[READ]);  in dd_init_queue()
423 	INIT_LIST_HEAD(&dd->fifo_list[WRITE]);  in dd_init_queue()
519 		list_add_tail(&rq->queuelist, &dd->fifo_list[data_dir]);  in dd_insert_request()
572 		if (!list_empty(&dd->fifo_list[WRITE]))  in dd_finish_request()
583 		!list_empty_careful(&dd->fifo_list[0]) ||  in dd_has_work()
584 		!list_empty_careful(&dd->fifo_list[1]);  in dd_has_work()
665 	return seq_list_start(&dd->fifo_list[ddir], *pos);		\
674 	return seq_list_next(v, &dd->fifo_list[ddir], pos);		\