Lines Matching refs:dispatch
64 struct list_head dispatch;
162 * move an entry to dispatch queue
198 * dispatch using arrival ordered lists.
234 * dispatch using sector position sorted lists.
277 if (!list_empty(&dd->dispatch)) {
278 rq = list_first_entry(&dd->dispatch, struct request, queuelist);
435 INIT_LIST_HEAD(&dd->dispatch);
509 list_add(&rq->queuelist, &dd->dispatch);
511 list_add_tail(&rq->queuelist, &dd->dispatch);
565 * write request dispatch progress in this case, mark the queue as needing a
592 return !list_empty_careful(&dd->dispatch) ||
743 return seq_list_start(&dd->dispatch, *pos);
751 return seq_list_next(v, &dd->dispatch, pos);
778 {"dispatch", 0400, .seq_ops = &deadline_dispatch_seq_ops},