aboutsummaryrefslogtreecommitdiff
path: root/drivers/block
diff options
context:
space:
mode:
authorJens Axboe <axboe@suse.de>2005-10-20 16:37:00 +0200
committerJens Axboe <axboe@nelson.home.kernel.dk>2005-10-28 08:44:37 +0200
commit1b47f531e244e339b648dfff071c086f936e49e1 (patch)
tree4ecbec3d9ade19e01a47c562772db550daadcef2 /drivers/block
parent8922e16cf6269e668123acb1ae1fdc62b7a3a4fc (diff)
[PATCH] generic dispatch fixes
- Split elv_dispatch_insert() into two functions - Rename rq_last_sector() to rq_end_sector() Signed-off-by: Jens Axboe <axboe@suse.de>
Diffstat (limited to 'drivers/block')
-rw-r--r--drivers/block/elevator.c33
1 files changed, 12 insertions, 21 deletions
diff --git a/drivers/block/elevator.c b/drivers/block/elevator.c
index a27555908d3..237e43d760c 100644
--- a/drivers/block/elevator.c
+++ b/drivers/block/elevator.c
@@ -40,11 +40,6 @@
static DEFINE_SPINLOCK(elv_list_lock);
static LIST_HEAD(elv_list);
-static inline sector_t rq_last_sector(struct request *rq)
-{
- return rq->sector + rq->nr_sectors;
-}
-
/*
* can we safely merge with this request?
*/
@@ -148,7 +143,7 @@ static int elevator_attach(request_queue_t *q, struct elevator_type *e,
INIT_LIST_HEAD(&q->queue_head);
q->last_merge = NULL;
q->elevator = eq;
- q->last_sector = 0;
+ q->end_sector = 0;
q->boundary_rq = NULL;
q->max_back_kb = 0;
@@ -233,29 +228,25 @@ void elevator_exit(elevator_t *e)
kfree(e);
}
+void elv_dispatch_insert_tail(request_queue_t *q, struct request *rq)
+{
+}
+
/*
* Insert rq into dispatch queue of q. Queue lock must be held on
* entry. If sort != 0, rq is sort-inserted; otherwise, rq will be
* appended to the dispatch queue. To be used by specific elevators.
*/
-void elv_dispatch_insert(request_queue_t *q, struct request *rq, int sort)
+void elv_dispatch_sort(request_queue_t *q, struct request *rq)
{
sector_t boundary;
unsigned max_back;
struct list_head *entry;
- if (!sort) {
- /* Specific elevator is performing sort. Step away. */
- q->last_sector = rq_last_sector(rq);
- q->boundary_rq = rq;
- list_add_tail(&rq->queuelist, &q->queue_head);
- return;
- }
-
- boundary = q->last_sector;
+ boundary = q->end_sector;
max_back = q->max_back_kb * 2;
boundary = boundary > max_back ? boundary - max_back : 0;
-
+
list_for_each_prev(entry, &q->queue_head) {
struct request *pos = list_entry_rq(entry);
@@ -343,10 +334,10 @@ void __elv_add_request(request_queue_t *q, struct request *rq, int where,
where = ELEVATOR_INSERT_BACK;
/*
- * this request is scheduling boundary, update last_sector
+ * this request is scheduling boundary, update end_sector
*/
if (blk_fs_request(rq)) {
- q->last_sector = rq_last_sector(rq);
+ q->end_sector = rq_end_sector(rq);
q->boundary_rq = rq;
}
}
@@ -479,7 +470,7 @@ struct request *elv_next_request(request_queue_t *q)
q->last_merge = NULL;
if (!q->boundary_rq || q->boundary_rq == rq) {
- q->last_sector = rq_last_sector(rq);
+ q->end_sector = rq_end_sector(rq);
q->boundary_rq = NULL;
}
@@ -802,7 +793,7 @@ ssize_t elv_iosched_show(request_queue_t *q, char *name)
return len;
}
-EXPORT_SYMBOL(elv_dispatch_insert);
+EXPORT_SYMBOL(elv_dispatch_sort);
EXPORT_SYMBOL(elv_add_request);
EXPORT_SYMBOL(__elv_add_request);
EXPORT_SYMBOL(elv_requeue_request);