queuelist
if (rq->queuelist.prev != &rq->queuelist)
list_del_init(&rq->queuelist);
!list_empty(&rq->queuelist) && !list_empty(&next->queuelist) &&
list_del_init(&rq->queuelist);
list_replace_init(&next->queuelist, &rq->queuelist);
queuelist);
list_del_init(&rq->queuelist);
list_add_tail(&rq->queuelist, &bfqq->fifo);
list_add(&rq->queuelist, &bfqd->dispatch);
list_add_tail(&rq->queuelist, &bfqd->dispatch);
rq = list_first_entry(list, struct request, queuelist);
list_del_init(&rq->queuelist);
list_add_tail(&rq->queuelist, pending);
list_move(&rq->queuelist, &q->requeue_list);
list_del_init(&rq->queuelist);
list_for_each_entry_safe(rq, n, running, queuelist) {
list_del_init(&rq->queuelist);
list_first_entry(pending, struct request, queuelist);
list_add_tail(&flush_rq->queuelist, &q->flush_list);
INIT_LIST_HEAD(&rq->queuelist);
list_for_each_entry_reverse(rq, list, queuelist) {
list_add_tail(&rq->queuelist, &rq_list);
list_add(&rq->queuelist, &rq_list);
struct request *rqa = container_of(a, struct request, queuelist);
struct request *rqb = container_of(b, struct request, queuelist);
list_first_entry(rq_list, struct request, queuelist)->mq_hctx;
list_for_each_entry(rq, rq_list, queuelist) {
list_cut_before(&hctx_list, rq_list, &rq->queuelist);
list_add_tail(&rq->queuelist, &q->requeue_list);
rq = list_entry(rq_list.next, struct request, queuelist);
list_del_init(&rq->queuelist);
rq = list_entry(flush_list.next, struct request, queuelist);
list_del_init(&rq->queuelist);
list_del_init(&dispatch_data->rq->queuelist);
list_add(&rq->queuelist, list);
list_for_each_entry(rq, list, queuelist) {
rq = list_first_entry(list, struct request, queuelist);
list_del_init(&rq->queuelist);
list_add(&rq->queuelist, &hctx->dispatch);
list_add_tail(&rq->queuelist, &hctx->dispatch);
list_for_each_entry(rq, list, queuelist) {
list_add(&rq->queuelist, &list);
list_add(&rq->queuelist, &ctx->rq_lists[hctx->type]);
list_add_tail(&rq->queuelist,
list_add_tail(&rq->queuelist, &list);
queuelist);
list_del_init(&rq->queuelist);
INIT_LIST_HEAD(&rq->queuelist);
INIT_LIST_HEAD(&rq->queuelist);
INIT_LIST_HEAD(&rq->queuelist);
INIT_LIST_HEAD(&rq->queuelist);
list_del_init(&rq->queuelist);
list_add(&rq->queuelist, free);
list_add(&rq->queuelist, free);
#define rq_entry_fifo(ptr) list_entry((ptr), struct request, queuelist)
#define rq_fifo_clear(rq) list_del_init(&(rq)->queuelist)
list_for_each_entry_safe(rq, next, rq_list, queuelist) {
list_move(&rq->queuelist, head);
list_move_tail(&rq->queuelist, head);
rq = list_first_entry_or_null(rqs, struct request, queuelist);
list_del_init(&rq->queuelist);
rq = list_first_entry(rqs, struct request, queuelist);
list_del_init(&rq->queuelist);
list_del_init(&rq->queuelist);
if (!list_empty(&req->queuelist) && !list_empty(&next->queuelist)) {
list_move(&req->queuelist, &next->queuelist);
rq = list_first_entry(&dd->dispatch, struct request, queuelist);
list_del_init(&rq->queuelist);
list_add(&rq->queuelist, &dd->dispatch);
list_add_tail(&rq->queuelist, &per_prio->fifo_list[data_dir]);
rq = list_first_entry(list, struct request, queuelist);
list_del_init(&rq->queuelist);
list_add_tail(&bd->rq->queuelist, &d->rq_list);
queuelist);
list_del_init(&rq->queuelist);
list_for_each_entry_safe(rq, rqnext, &d->rq_list, queuelist) {
list_del_init(&rq->queuelist);
queuelist);
list_del_init(¤t_req->queuelist);
list_add_tail(&bd->rq->queuelist, &floppy_reqs);
list_for_each_entry(rq, &list, queuelist)
req = list_first_entry(&list, struct request, queuelist);
list_del_init(&req->queuelist);
list_del_init(&rq->queuelist);
list_add_tail(&rq->queuelist, &nq->poll_list);
list_for_each_entry_safe(req, n, &info->requests, queuelist) {
list_del_init(&req->queuelist);
list_add(&shadow[j].request->queuelist, &info->requests);
rq = list_first_entry_or_null(&dev->rq_list, struct request, queuelist);
list_del_init(&rq->queuelist);
list_add_tail(&bd->rq->queuelist, &dev->rq_list);
#define list_entry_rq(ptr) list_entry((ptr), struct request, queuelist)