Home
last modified time | relevance | path

Searched refs:queuelist (Results 1 – 18 of 18) sorted by relevance

/linux/block/
H A Dblk-flush.c171 list_add_tail(&rq->queuelist, pending); in blk_flush_complete_seq()
177 list_move(&rq->queuelist, &q->requeue_list); in blk_flush_complete_seq()
189 list_del_init(&rq->queuelist); in blk_flush_complete_seq()
245 list_for_each_entry_safe(rq, n, running, queuelist) { in flush_end_io()
249 list_del_init(&rq->queuelist); in flush_end_io()
280 list_first_entry(pending, struct request, queuelist); in blk_kick_flush()
331 list_add_tail(&flush_rq->queuelist, &q->flush_list); in blk_kick_flush()
359 * re-initialize rq->queuelist before reusing it here. in mq_flush_data_end_io()
361 INIT_LIST_HEAD(&rq->queuelist); in mq_flush_data_end_io()
H A Dblk-mq-sched.c50 struct request *rqa = container_of(a, struct request, queuelist); in sched_rq_cmp()
51 struct request *rqb = container_of(b, struct request, queuelist); in sched_rq_cmp()
59 list_first_entry(rq_list, struct request, queuelist)->mq_hctx; in blk_mq_dispatch_hctx_list()
63 list_for_each_entry(rq, rq_list, queuelist) { in blk_mq_dispatch_hctx_list()
65 list_cut_before(&hctx_list, rq_list, &rq->queuelist); in blk_mq_dispatch_hctx_list()
137 list_add_tail(&rq->queuelist, &rq_list); in __blk_mq_do_dispatch_sched()
257 list_add(&rq->queuelist, &rq_list); in blk_mq_do_dispatch_ctx()
H A Dmq-deadline.c176 list_del_init(&rq->queuelist); in deadline_remove_request()
224 if (!list_empty(&req->queuelist) && !list_empty(&next->queuelist)) { in dd_merged_requests()
227 list_move(&req->queuelist, &next->queuelist); in dd_merged_requests()
330 queuelist); in __dd_dispatch_request()
333 list_del_init(&rq->queuelist); in __dd_dispatch_request()
674 list_add(&rq->queuelist, &per_prio->dispatch); in dd_insert_request()
689 list_add_tail(&rq->queuelist, &per_prio->fifo_list[data_dir]); in dd_insert_request()
708 rq = list_first_entry(list, struct request, queuelist); in dd_insert_requests()
[all...]
H A Delevator.h193 #define rq_entry_fifo(ptr) list_entry((ptr), struct request, queuelist)
194 #define rq_fifo_clear(rq) list_del_init(&(rq)->queuelist)
H A Dkyber-iosched.c585 list_for_each_entry_safe(rq, next, rq_list, queuelist) { in kyber_insert_requests()
593 list_move(&rq->queuelist, head); in kyber_insert_requests()
595 list_move_tail(&rq->queuelist, head); in kyber_insert_requests()
760 rq = list_first_entry_or_null(rqs, struct request, queuelist); in kyber_dispatch_cur_domain()
766 list_del_init(&rq->queuelist); in kyber_dispatch_cur_domain()
776 rq = list_first_entry(rqs, struct request, queuelist); in kyber_dispatch_cur_domain()
779 list_del_init(&rq->queuelist); in kyber_dispatch_cur_domain()
H A Dblk-mq.c376 INIT_LIST_HEAD(&rq->queuelist); in blk_rq_init()
434 INIT_LIST_HEAD(&rq->queuelist); in blk_mq_rq_ctx_init()
629 INIT_LIST_HEAD(&rq->queuelist); in blk_mq_alloc_cached_request()
1532 list_add_tail(&rq->queuelist, &q->requeue_list); in blk_mq_requeue_request()
1554 rq = list_entry(rq_list.next, struct request, queuelist); in blk_mq_requeue_work()
1555 list_del_init(&rq->queuelist); in blk_mq_requeue_work()
1569 rq = list_entry(flush_list.next, struct request, queuelist); in blk_mq_requeue_work()
1570 list_del_init(&rq->queuelist); in blk_mq_requeue_work()
1815 list_del_init(&dispatch_data->rq->queuelist); in dispatch_rq_from_ctx()
2007 list_add(&rq->queuelist, lis in blk_mq_handle_dev_resource()
[all...]
H A Dbfq-iosched.c2394 if (rq->queuelist.prev != &rq->queuelist) in bfq_remove_request()
2395 list_del_init(&rq->queuelist); in bfq_remove_request()
2574 !list_empty(&rq->queuelist) && !list_empty(&next->queuelist) && in bfq_requests_merged()
2576 list_del_init(&rq->queuelist); in bfq_requests_merged()
2577 list_replace_init(&next->queuelist, &rq->queuelist); in bfq_requests_merged()
5164 queuelist); in __bfq_dispatch_request()
5165 list_del_init(&rq->queuelist); in __bfq_dispatch_request()
6195 list_add_tail(&rq->queuelist, &bfqq->fifo); in __bfq_insert_request()
6261 list_add(&rq->queuelist, &bfqd->dispatch); in bfq_insert_request()
6263 list_add_tail(&rq->queuelist, &bfqd->dispatch); in bfq_insert_request()
[all …]
H A Delevator.c349 list_add(&rq->queuelist, free); in elv_attempt_insert_merge()
365 list_add(&rq->queuelist, free); in elv_attempt_insert_merge()
H A Dblk-mq.h381 list_del_init(&rq->queuelist); in blk_mq_free_requests()
H A Dblk-merge.c1029 list_for_each_entry_reverse(rq, list, queuelist) { in blk_bio_list_merge()
/linux/drivers/mtd/
H A Dmtd_blkdevs.c110 rq = list_first_entry_or_null(&dev->rq_list, struct request, queuelist); in mtd_next_request()
112 list_del_init(&rq->queuelist); in mtd_next_request()
178 list_add_tail(&bd->rq->queuelist, &dev->rq_list); in mtd_queue_rq()
/linux/drivers/block/aoe/
H A Daoedev.c231 list_for_each_entry_safe(rq, rqnext, &d->rq_list, queuelist) { in aoedev_downdev()
232 list_del_init(&rq->queuelist); in aoedev_downdev()
H A Daoecmd.c859 queuelist); in nextbuf()
862 list_del_init(&rq->queuelist); in nextbuf()
/linux/drivers/block/null_blk/
H A Dmain.c1587 list_for_each_entry(rq, &list, queuelist) in null_poll()
1595 req = list_first_entry(&list, struct request, queuelist); in null_poll()
1596 list_del_init(&req->queuelist); in null_poll()
1623 list_del_init(&rq->queuelist); in null_timeout_rq()
1686 list_add_tail(&rq->queuelist, &nq->poll_list); in null_queue_rq()
/linux/drivers/block/
H A Dxen-blkfront.c2037 list_for_each_entry_safe(req, n, &info->requests, queuelist) { in blkif_recover()
2039 list_del_init(&req->queuelist); in blkif_recover()
2096 list_add(&shadow[j].request->queuelist, &info->requests); in blkfront_resume()
H A Dfloppy.c2761 queuelist); in set_next_request()
2764 list_del_init(&current_req->queuelist); in set_next_request()
2875 list_add_tail(&bd->rq->queuelist, &floppy_reqs); in floppy_queue_rq()
/linux/include/linux/
H A Dblk-mq.h124 struct list_head queuelist; member
H A Dblkdev.h702 #define list_entry_rq(ptr) list_entry((ptr), struct request, queuelist)