Skip to content

Commit

Permalink
---
Browse files Browse the repository at this point in the history
yaml
---
r: 10188
b: refs/heads/master
c: 06b8624
h: refs/heads/master
v: v3
  • Loading branch information
Tejun Heo authored and Jens Axboe committed Oct 28, 2005
1 parent 0c47ec5 commit 3be2f9f
Show file tree
Hide file tree
Showing 3 changed files with 22 additions and 26 deletions.
2 changes: 1 addition & 1 deletion [refs]
Original file line number Diff line number Diff line change
@@ -1,2 +1,2 @@
---
refs/heads/master: b4878f245ec8e168cdd1f170f823a750b7dd4af5
refs/heads/master: 06b86245c052963029bfd9020ca1f08ceb66f85a
43 changes: 18 additions & 25 deletions trunk/drivers/block/elevator.c
Original file line number Diff line number Diff line change
Expand Up @@ -83,15 +83,6 @@ inline int elv_try_merge(struct request *__rq, struct bio *bio)
}
EXPORT_SYMBOL(elv_try_merge);

inline int elv_try_last_merge(request_queue_t *q, struct bio *bio)
{
if (q->last_merge)
return elv_try_merge(q->last_merge, bio);

return ELEVATOR_NO_MERGE;
}
EXPORT_SYMBOL(elv_try_last_merge);

static struct elevator_type *elevator_find(const char *name)
{
struct elevator_type *e = NULL;
Expand Down Expand Up @@ -239,6 +230,9 @@ void elv_dispatch_sort(request_queue_t *q, struct request *rq)
unsigned max_back;
struct list_head *entry;

if (q->last_merge == rq)
q->last_merge = NULL;

boundary = q->end_sector;
max_back = q->max_back_kb * 2;
boundary = boundary > max_back ? boundary - max_back : 0;
Expand All @@ -265,6 +259,15 @@ void elv_dispatch_sort(request_queue_t *q, struct request *rq)
int elv_merge(request_queue_t *q, struct request **req, struct bio *bio)
{
elevator_t *e = q->elevator;
int ret;

if (q->last_merge) {
ret = elv_try_merge(q->last_merge, bio);
if (ret != ELEVATOR_NO_MERGE) {
*req = q->last_merge;
return ret;
}
}

if (e->ops->elevator_merge_fn)
return e->ops->elevator_merge_fn(q, req, bio);
Expand All @@ -278,18 +281,19 @@ void elv_merged_request(request_queue_t *q, struct request *rq)

if (e->ops->elevator_merged_fn)
e->ops->elevator_merged_fn(q, rq);

q->last_merge = rq;
}

void elv_merge_requests(request_queue_t *q, struct request *rq,
struct request *next)
{
elevator_t *e = q->elevator;

if (q->last_merge == next)
q->last_merge = NULL;

if (e->ops->elevator_merge_req_fn)
e->ops->elevator_merge_req_fn(q, rq, next);

q->last_merge = rq;
}

void elv_requeue_request(request_queue_t *q, struct request *rq)
Expand Down Expand Up @@ -384,6 +388,8 @@ void __elv_add_request(request_queue_t *q, struct request *rq, int where,
BUG_ON(!blk_fs_request(rq));
rq->flags |= REQ_SORTED;
q->elevator->ops->elevator_add_req_fn(q, rq);
if (q->last_merge == NULL && rq_mergeable(rq))
q->last_merge = rq;
break;

default:
Expand Down Expand Up @@ -462,9 +468,6 @@ struct request *elv_next_request(request_queue_t *q)
rq->flags |= REQ_STARTED;
}

if (rq == q->last_merge)
q->last_merge = NULL;

if (!q->boundary_rq || q->boundary_rq == rq) {
q->end_sector = rq_end_sector(rq);
q->boundary_rq = NULL;
Expand Down Expand Up @@ -518,16 +521,6 @@ void elv_dequeue_request(request_queue_t *q, struct request *rq)
*/
if (blk_account_rq(rq))
q->in_flight++;

/*
* the main clearing point for q->last_merge is on retrieval of
* request by driver (it calls elv_next_request()), but it _can_
* also happen here if a request is added to the queue but later
* deleted without ever being given to driver (merged with another
* request).
*/
if (rq == q->last_merge)
q->last_merge = NULL;
}

int elv_queue_empty(request_queue_t *q)
Expand Down
3 changes: 3 additions & 0 deletions trunk/include/linux/blkdev.h
Original file line number Diff line number Diff line change
Expand Up @@ -630,6 +630,9 @@ static inline void blkdev_dequeue_request(struct request *req)
static inline void elv_dispatch_add_tail(struct request_queue *q,
struct request *rq)
{
if (q->last_merge == rq)
q->last_merge = NULL;

q->end_sector = rq_end_sector(rq);
q->boundary_rq = rq;
list_add_tail(&rq->queuelist, &q->queue_head);
Expand Down

0 comments on commit 3be2f9f

Please sign in to comment.