struct request_queue *q = rq->q;
struct elevator_queue *e = q->elevator;
- if (e->type->ops.mq.allow_merge)
- return e->type->ops.mq.allow_merge(q, rq, bio);
+ if (e->type->ops.allow_merge)
+ return e->type->ops.allow_merge(q, rq, bio);
return 1;
}
void elevator_exit(struct request_queue *q, struct elevator_queue *e)
{
mutex_lock(&e->sysfs_lock);
- if (e->type->ops.mq.exit_sched)
+ if (e->type->ops.exit_sched)
blk_mq_exit_sched(q, e);
mutex_unlock(&e->sysfs_lock);
return ELEVATOR_BACK_MERGE;
}
- if (e->type->ops.mq.request_merge)
- return e->type->ops.mq.request_merge(q, req, bio);
+ if (e->type->ops.request_merge)
+ return e->type->ops.request_merge(q, req, bio);
return ELEVATOR_NO_MERGE;
}
{
struct elevator_queue *e = q->elevator;
- if (e->type->ops.mq.request_merged)
- e->type->ops.mq.request_merged(q, rq, type);
+ if (e->type->ops.request_merged)
+ e->type->ops.request_merged(q, rq, type);
if (type == ELEVATOR_BACK_MERGE)
elv_rqhash_reposition(q, rq);
struct elevator_queue *e = q->elevator;
bool next_sorted = false;
- if (e->type->ops.mq.requests_merged)
- e->type->ops.mq.requests_merged(q, rq, next);
+ if (e->type->ops.requests_merged)
+ e->type->ops.requests_merged(q, rq, next);
elv_rqhash_reposition(q, rq);
{
struct elevator_queue *e = q->elevator;
- if (e->type->ops.mq.next_request)
- return e->type->ops.mq.next_request(q, rq);
+ if (e->type->ops.next_request)
+ return e->type->ops.next_request(q, rq);
return NULL;
}
{
struct elevator_queue *e = q->elevator;
- if (e->type->ops.mq.former_request)
- return e->type->ops.mq.former_request(q, rq);
+ if (e->type->ops.former_request)
+ return e->type->ops.former_request(q, rq);
return NULL;
}