/linux-master/block/ |
H A D | blk-flush.c | 186 list_move_tail(&rq->queuelist, pending); 192 list_move(&rq->queuelist, &q->requeue_list); 204 list_del_init(&rq->queuelist); 260 list_for_each_entry_safe(rq, n, running, queuelist) { 294 list_first_entry(pending, struct request, queuelist); 345 list_add_tail(&flush_rq->queuelist, &q->flush_list); 373 * re-initialize rq->queuelist before reusing it here. 375 INIT_LIST_HEAD(&rq->queuelist);
|
H A D | blk-mq-sched.c | 50 struct request *rqa = container_of(a, struct request, queuelist); 51 struct request *rqb = container_of(b, struct request, queuelist); 59 list_first_entry(rq_list, struct request, queuelist)->mq_hctx; 64 list_for_each_entry(rq, rq_list, queuelist) { 66 list_cut_before(&hctx_list, rq_list, &rq->queuelist); 139 list_add_tail(&rq->queuelist, &rq_list); 259 list_add(&rq->queuelist, &rq_list);
|
H A D | elevator.h | 183 #define rq_entry_fifo(ptr) list_entry((ptr), struct request, queuelist) 184 #define rq_fifo_clear(rq) list_del_init(&(rq)->queuelist)
|
H A D | mq-deadline.c | 214 list_del_init(&rq->queuelist); 262 if (!list_empty(&req->queuelist) && !list_empty(&next->queuelist)) { 265 list_move(&req->queuelist, &next->queuelist); 368 queuelist) { 456 queuelist); 459 list_del_init(&rq->queuelist); 826 list_add(&rq->queuelist, &per_prio->dispatch); 853 insert_before = &rq2->queuelist; [all...] |
H A D | kyber-iosched.c | 597 list_for_each_entry_safe(rq, next, rq_list, queuelist) { 605 list_move(&rq->queuelist, head); 607 list_move_tail(&rq->queuelist, head); 772 rq = list_first_entry_or_null(rqs, struct request, queuelist); 778 list_del_init(&rq->queuelist); 788 rq = list_first_entry(rqs, struct request, queuelist); 791 list_del_init(&rq->queuelist);
|
H A D | blk-mq.c | 317 INIT_LIST_HEAD(&rq->queuelist); 385 INIT_LIST_HEAD(&rq->queuelist); 576 INIT_LIST_HEAD(&rq->queuelist); 1442 list_add_tail(&rq->queuelist, &q->requeue_list); 1464 rq = list_entry(rq_list.next, struct request, queuelist); 1472 list_del_init(&rq->queuelist); 1475 list_del_init(&rq->queuelist); 1481 rq = list_entry(flush_list.next, struct request, queuelist); 1482 list_del_init(&rq->queuelist); 1728 list_del_init(&dispatch_data->rq->queuelist); [all...] |
H A D | bfq-iosched.c | 2392 if (rq->queuelist.prev != &rq->queuelist) 2393 list_del_init(&rq->queuelist); 2579 !list_empty(&rq->queuelist) && !list_empty(&next->queuelist) && 2581 list_del_init(&rq->queuelist); 2582 list_replace_init(&next->queuelist, &rq->queuelist); 5167 queuelist); 5168 list_del_init(&rq->queuelist); [all...] |
H A D | elevator.c | 345 list_add(&rq->queuelist, free); 361 list_add(&rq->queuelist, free);
|
H A D | blk-mq.h | 405 list_del_init(&rq->queuelist);
|
H A D | blk-merge.c | 1145 list_for_each_entry_reverse(rq, list, queuelist) {
|
/linux-master/drivers/mtd/ |
H A D | mtd_blkdevs.c | 110 rq = list_first_entry_or_null(&dev->rq_list, struct request, queuelist); 112 list_del_init(&rq->queuelist); 178 list_add_tail(&bd->rq->queuelist, &dev->rq_list);
|
/linux-master/drivers/block/null_blk/ |
H A D | main.c | 1494 list_for_each_entry(rq, &list, queuelist) 1502 req = list_first_entry(&list, struct request, queuelist); 1503 list_del_init(&req->queuelist); 1530 list_del_init(&rq->queuelist); 1593 list_add_tail(&rq->queuelist, &nq->poll_list);
|
/linux-master/drivers/block/aoe/ |
H A D | aoeblk.c | 265 list_add_tail(&bd->rq->queuelist, &d->rq_list);
|
H A D | aoecmd.c | 850 queuelist); 853 list_del_init(&rq->queuelist);
|
/linux-master/include/linux/ |
H A D | blk-mq.h | 100 struct list_head queuelist; member in union:request::__anon1877
|
H A D | blkdev.h | 593 #define list_entry_rq(ptr) list_entry((ptr), struct request, queuelist)
|
/linux-master/drivers/block/ |
H A D | xen-blkfront.c | 2036 list_for_each_entry_safe(req, n, &info->requests, queuelist) { 2038 list_del_init(&req->queuelist); 2095 list_add(&shadow[j].request->queuelist, &info->requests);
|
H A D | floppy.c | 2761 queuelist); 2764 list_del_init(¤t_req->queuelist); 2875 list_add_tail(&bd->rq->queuelist, &floppy_reqs);
|