Lines Matching refs:dispatch
33 * Time after which to dispatch lower priority requests even if higher
74 struct list_head dispatch;
277 * move an entry to dispatch queue
343 * dispatch using arrival ordered lists.
387 * dispatch using sector position sorted lists.
454 if (!list_empty(&per_prio->dispatch)) {
455 rq = list_first_entry(&per_prio->dispatch, struct request,
609 * Next, dispatch requests in priority order. Ignore lower priority
712 INIT_LIST_HEAD(&per_prio->dispatch);
728 /* We dispatch from request queue wide instead of hw queue */
827 list_add(&rq->queuelist, &per_prio->dispatch);
915 * write request dispatch progress in this case, mark the queue as needing a
951 return !list_empty_careful(&per_prio->dispatch) ||
1179 return seq_list_start(&per_prio->dispatch, *pos); \
1189 return seq_list_next(v, &per_prio->dispatch, pos); \