INIT_LIST_HEAD(&plug->mq_list);
INIT_LIST_HEAD(&plug->cb_list);
plug->rq_count = 0;
+ plug->multiple_queues = false;
/*
* Store ordering should not be needed here, since a potential
list_splice_init(&plug->mq_list, &list);
plug->rq_count = 0;
- list_sort(NULL, &list, plug_rq_cmp);
+ if (plug->rq_count > 2 && plug->multiple_queues)
+ list_sort(NULL, &list, plug_rq_cmp);
this_q = NULL;
this_hctx = NULL;
}
}
+static void blk_add_rq_to_plug(struct blk_plug *plug, struct request *rq)
+{
+ list_add_tail(&rq->queuelist, &plug->mq_list);
+ plug->rq_count++;
+ if (!plug->multiple_queues && !list_is_singular(&plug->mq_list)) {
+ struct request *tmp;
+
+ tmp = list_first_entry(&plug->mq_list, struct request,
+ queuelist);
+ if (tmp->q != rq->q)
+ plug->multiple_queues = true;
+ }
+}
+
static blk_qc_t blk_mq_make_request(struct request_queue *q, struct bio *bio)
{
const int is_sync = op_is_sync(bio->bi_opf);
trace_block_plug(q);
}
- list_add_tail(&rq->queuelist, &plug->mq_list);
- plug->rq_count++;
+ blk_add_rq_to_plug(plug, rq);
} else if (plug && !blk_queue_nomerges(q)) {
blk_mq_bio_to_request(rq, bio);
list_del_init(&same_queue_rq->queuelist);
plug->rq_count--;
}
- list_add_tail(&rq->queuelist, &plug->mq_list);
- plug->rq_count++;
+ blk_add_rq_to_plug(plug, rq);
blk_mq_put_ctx(data.ctx);