Merge branch 'master' of git://git.kernel.org/pub/scm/linux/kernel/git/torvalds/linux-2.6

Conflicts:

	arch/x86/kernel/io_apic.c

17 files changed, 196 insertions, 195 deletions

diff --git a/block/Kconfig b/block/Kconfig
index 290b219fad9c..ac0956f77785 100644
--- a/block/Kconfig
+++ b/block/Kconfig
@@ -24,21 +24,17 @@ menuconfig BLOCK
 if BLOCK
 
 config LBD
-        bool "Support for Large Block Devices"
+        bool "Support for large block devices and files"
         depends on !64BIT
         help
-          Enable block devices of size 2TB and larger.
+          Enable block devices or files of size 2TB and larger.
 
           This option is required to support the full capacity of large
           (2TB+) block devices, including RAID, disk, Network Block Device,
           Logical Volume Manager (LVM) and loopback.
-
-          For example, RAID devices are frequently bigger than the capacity
-          of the largest individual hard drive.
-
-          This option is not required if you have individual disk drives
-          which total 2TB+ and you are not aggregating the capacity into
-          a large block device (e.g. using RAID or LVM).
+        
+          This option also enables support for single files larger than
+          2TB.
 
           If unsure, say N.
 
@@ -58,15 +54,6 @@ config BLK_DEV_IO_TRACE
 
           If unsure, say N.
 
-config LSF
-        bool "Support for Large Single Files"
-        depends on !64BIT
-        help
-          Say Y here if you want to be able to handle very large files (2TB
-          and larger), otherwise say N.
-
-          If unsure, say Y.
-
 config BLK_DEV_BSG
         bool "Block layer SG support v4 (EXPERIMENTAL)"
         depends on EXPERIMENTAL
diff --git a/block/as-iosched.c b/block/as-iosched.c
index 71f0abb219ee..631f6f44460a 100644
--- a/block/as-iosched.c
+++ b/block/as-iosched.c
@@ -1339,12 +1339,12 @@ static int as_may_queue(struct request_queue *q, int rw)
         return ret;
 }
 
-static void as_exit_queue(elevator_t *e)
+static void as_exit_queue(struct elevator_queue *e)
 {
         struct as_data *ad = e->elevator_data;
 
         del_timer_sync(&ad->antic_timer);
-        kblockd_flush_work(&ad->antic_work);
+        cancel_work_sync(&ad->antic_work);
 
         BUG_ON(!list_empty(&ad->fifo_list[REQ_SYNC]));
         BUG_ON(!list_empty(&ad->fifo_list[REQ_ASYNC]));
@@ -1409,7 +1409,7 @@ as_var_store(unsigned long *var, const char *page, size_t count)
         return count;
 }
 
-static ssize_t est_time_show(elevator_t *e, char *page)
+static ssize_t est_time_show(struct elevator_queue *e, char *page)
 {
         struct as_data *ad = e->elevator_data;
         int pos = 0;
@@ -1427,7 +1427,7 @@ static ssize_t est_time_show(elevator_t *e, char *page)
 }
 
 #define SHOW_FUNCTION(__FUNC, __VAR)                            \
-static ssize_t __FUNC(elevator_t *e, char *page)                \
+static ssize_t __FUNC(struct elevator_queue *e, char *page)     \
 {                                                               \
         struct as_data *ad = e->elevator_data;                  \
         return as_var_show(jiffies_to_msecs((__VAR)), (page));  \
@@ -1440,7 +1440,7 @@ SHOW_FUNCTION(as_write_batch_expire_show, ad->batch_expire[REQ_ASYNC]);
 #undef SHOW_FUNCTION
 
 #define STORE_FUNCTION(__FUNC, __PTR, MIN, MAX)                         \
-static ssize_t __FUNC(elevator_t *e, const char *page, size_t count)    \
+static ssize_t __FUNC(struct elevator_queue *e, const char *page, size_t count) \
 {                                                                       \
         struct as_data *ad = e->elevator_data;                          \
         int ret = as_var_store(__PTR, (page), count);                   \
diff --git a/block/blk-barrier.c b/block/blk-barrier.c
index 6e72d661ae42..8eba4e43bb0c 100644
--- a/block/blk-barrier.c
+++ b/block/blk-barrier.c
@@ -24,8 +24,8 @@
 int blk_queue_ordered(struct request_queue *q, unsigned ordered,
                       prepare_flush_fn *prepare_flush_fn)
 {
-        if (ordered & (QUEUE_ORDERED_PREFLUSH | QUEUE_ORDERED_POSTFLUSH) &&
-            prepare_flush_fn == NULL) {
+        if (!prepare_flush_fn && (ordered & (QUEUE_ORDERED_DO_PREFLUSH |
+                                             QUEUE_ORDERED_DO_POSTFLUSH))) {
                 printk(KERN_ERR "%s: prepare_flush_fn required\n", __func__);
                 return -EINVAL;
         }
@@ -88,7 +88,7 @@ unsigned blk_ordered_req_seq(struct request *rq)
                 return QUEUE_ORDSEQ_DONE;
 }
 
-void blk_ordered_complete_seq(struct request_queue *q, unsigned seq, int error)
+bool blk_ordered_complete_seq(struct request_queue *q, unsigned seq, int error)
 {
         struct request *rq;
 
@@ -99,7 +99,7 @@ void blk_ordered_complete_seq(struct request_queue *q, unsigned seq, int error)
         q->ordseq |= seq;
 
         if (blk_ordered_cur_seq(q) != QUEUE_ORDSEQ_DONE)
-                return;
+                return false;
 
         /*
          * Okay, sequence complete.
@@ -109,6 +109,8 @@ void blk_ordered_complete_seq(struct request_queue *q, unsigned seq, int error)
 
         if (__blk_end_request(rq, q->orderr, blk_rq_bytes(rq)))
                 BUG();
+
+        return true;
 }
 
 static void pre_flush_end_io(struct request *rq, int error)
@@ -134,7 +136,7 @@ static void queue_flush(struct request_queue *q, unsigned which)
         struct request *rq;
         rq_end_io_fn *end_io;
 
-        if (which == QUEUE_ORDERED_PREFLUSH) {
+        if (which == QUEUE_ORDERED_DO_PREFLUSH) {
                 rq = &q->pre_flush_rq;
                 end_io = pre_flush_end_io;
         } else {
@@ -151,80 +153,110 @@ static void queue_flush(struct request_queue *q, unsigned which)
         elv_insert(q, rq, ELEVATOR_INSERT_FRONT);
 }
 
-static inline struct request *start_ordered(struct request_queue *q,
-                                            struct request *rq)
+static inline bool start_ordered(struct request_queue *q, struct request **rqp)
 {
+        struct request *rq = *rqp;
+        unsigned skip = 0;
+
         q->orderr = 0;
         q->ordered = q->next_ordered;
         q->ordseq |= QUEUE_ORDSEQ_STARTED;
 
         /*
-         * Prep proxy barrier request.
+         * For an empty barrier, there's no actual BAR request, which
+         * in turn makes POSTFLUSH unnecessary.  Mask them off.
          */
+        if (!rq->hard_nr_sectors) {
+                q->ordered &= ~(QUEUE_ORDERED_DO_BAR |
+                                QUEUE_ORDERED_DO_POSTFLUSH);
+                /*
+                 * Empty barrier on a write-through device w/ ordered
+                 * tag has no command to issue and without any command
+                 * to issue, ordering by tag can't be used.  Drain
+                 * instead.
+                 */
+                if ((q->ordered & QUEUE_ORDERED_BY_TAG) &&
+                    !(q->ordered & QUEUE_ORDERED_DO_PREFLUSH)) {
+                        q->ordered &= ~QUEUE_ORDERED_BY_TAG;
+                        q->ordered |= QUEUE_ORDERED_BY_DRAIN;
+                }
+        }
+
+        /* stash away the original request */
         elv_dequeue_request(q, rq);
         q->orig_bar_rq = rq;
-        rq = &q->bar_rq;
-        blk_rq_init(q, rq);
-        if (bio_data_dir(q->orig_bar_rq->bio) == WRITE)
-                rq->cmd_flags |= REQ_RW;
-        if (q->ordered & QUEUE_ORDERED_FUA)
-                rq->cmd_flags |= REQ_FUA;
-        init_request_from_bio(rq, q->orig_bar_rq->bio);
-        rq->end_io = bar_end_io;
+        rq = NULL;
 
         /*
          * Queue ordered sequence.  As we stack them at the head, we
          * need to queue in reverse order.  Note that we rely on that
          * no fs request uses ELEVATOR_INSERT_FRONT and thus no fs
-         * request gets inbetween ordered sequence. If this request is
-         * an empty barrier, we don't need to do a postflush ever since
-         * there will be no data written between the pre and post flush.
-         * Hence a single flush will suffice.
+         * request gets inbetween ordered sequence.
          */
-        if ((q->ordered & QUEUE_ORDERED_POSTFLUSH) && !blk_empty_barrier(rq))
-                queue_flush(q, QUEUE_ORDERED_POSTFLUSH);
-        else
-                q->ordseq |= QUEUE_ORDSEQ_POSTFLUSH;
+        if (q->ordered & QUEUE_ORDERED_DO_POSTFLUSH) {
+                queue_flush(q, QUEUE_ORDERED_DO_POSTFLUSH);
+                rq = &q->post_flush_rq;
+        } else
+                skip |= QUEUE_ORDSEQ_POSTFLUSH;
 
-        elv_insert(q, rq, ELEVATOR_INSERT_FRONT);
+        if (q->ordered & QUEUE_ORDERED_DO_BAR) {
+                rq = &q->bar_rq;
+
+                /* initialize proxy request and queue it */
+                blk_rq_init(q, rq);
+                if (bio_data_dir(q->orig_bar_rq->bio) == WRITE)
+                        rq->cmd_flags |= REQ_RW;
+                if (q->ordered & QUEUE_ORDERED_DO_FUA)
+                        rq->cmd_flags |= REQ_FUA;
+                init_request_from_bio(rq, q->orig_bar_rq->bio);
+                rq->end_io = bar_end_io;
 
-        if (q->ordered & QUEUE_ORDERED_PREFLUSH) {
-                queue_flush(q, QUEUE_ORDERED_PREFLUSH);
+                elv_insert(q, rq, ELEVATOR_INSERT_FRONT);
+        } else
+                skip |= QUEUE_ORDSEQ_BAR;
+
+        if (q->ordered & QUEUE_ORDERED_DO_PREFLUSH) {
+                queue_flush(q, QUEUE_ORDERED_DO_PREFLUSH);
                 rq = &q->pre_flush_rq;
         } else
-                q->ordseq |= QUEUE_ORDSEQ_PREFLUSH;
+                skip |= QUEUE_ORDSEQ_PREFLUSH;
 
-        if ((q->ordered & QUEUE_ORDERED_TAG) || q->in_flight == 0)
-                q->ordseq |= QUEUE_ORDSEQ_DRAIN;
-        else
+        if ((q->ordered & QUEUE_ORDERED_BY_DRAIN) && q->in_flight)
                 rq = NULL;
+        else
+                skip |= QUEUE_ORDSEQ_DRAIN;
+
+        *rqp = rq;
 
-        return rq;
+        /*
+         * Complete skipped sequences.  If whole sequence is complete,
+         * return false to tell elevator that this request is gone.
+         */
+        return !blk_ordered_complete_seq(q, skip, 0);
 }
 
-int blk_do_ordered(struct request_queue *q, struct request **rqp)
+bool blk_do_ordered(struct request_queue *q, struct request **rqp)
 {
         struct request *rq = *rqp;
         const int is_barrier = blk_fs_request(rq) && blk_barrier_rq(rq);
 
         if (!q->ordseq) {
                 if (!is_barrier)
-                        return 1;
+                        return true;
 
-                if (q->next_ordered != QUEUE_ORDERED_NONE) {
-                        *rqp = start_ordered(q, rq);
-                        return 1;
-                } else {
+                if (q->next_ordered != QUEUE_ORDERED_NONE)
+                        return start_ordered(q, rqp);
+                else {
                         /*
-                         * This can happen when the queue switches to
-                         * ORDERED_NONE while this request is on it.
+                         * Queue ordering not supported.  Terminate
+                         * with prejudice.
                          */
                         elv_dequeue_request(q, rq);
                         if (__blk_end_request(rq, -EOPNOTSUPP,
                                               blk_rq_bytes(rq)))
                                 BUG();
                         *rqp = NULL;
-                        return 0;
+                        return false;
                 }
         }
 
@@ -235,9 +267,9 @@ int blk_do_ordered(struct request_queue *q, struct request **rqp)
         /* Special requests are not subject to ordering rules. */
         if (!blk_fs_request(rq) &&
             rq != &q->pre_flush_rq && rq != &q->post_flush_rq)
-                return 1;
+                return true;
 
-        if (q->ordered & QUEUE_ORDERED_TAG) {
+        if (q->ordered & QUEUE_ORDERED_BY_TAG) {
                 /* Ordered by tag.  Blocking the next barrier is enough. */
                 if (is_barrier && rq != &q->bar_rq)
                         *rqp = NULL;
@@ -248,7 +280,7 @@ int blk_do_ordered(struct request_queue *q, struct request **rqp)
                         *rqp = NULL;
         }
 
-        return 1;
+        return true;
 }
 
 static void bio_end_empty_barrier(struct bio *bio, int err)
diff --git a/block/blk-core.c b/block/blk-core.c
index 561e8a1b43a4..a824e49c0d0a 100644
--- a/block/blk-core.c
+++ b/block/blk-core.c
@@ -153,6 +153,9 @@ static void req_bio_endio(struct request *rq, struct bio *bio,
                         nbytes = bio->bi_size;
                 }
 
+                if (unlikely(rq->cmd_flags & REQ_QUIET))
+                        set_bit(BIO_QUIET, &bio->bi_flags);
+
                 bio->bi_size -= nbytes;
                 bio->bi_sector += (nbytes >> 9);
 
@@ -265,8 +268,7 @@ void __generic_unplug_device(struct request_queue *q)
 {
         if (unlikely(blk_queue_stopped(q)))
                 return;
-
-        if (!blk_remove_plug(q))
+        if (!blk_remove_plug(q) && !blk_queue_nonrot(q))
                 return;
 
         q->request_fn(q);
@@ -404,7 +406,8 @@ EXPORT_SYMBOL(blk_stop_queue);
 void blk_sync_queue(struct request_queue *q)
 {
         del_timer_sync(&q->unplug_timer);
-        kblockd_flush_work(&q->unplug_work);
+        del_timer_sync(&q->timeout);
+        cancel_work_sync(&q->unplug_work);
 }
 EXPORT_SYMBOL(blk_sync_queue);
 
@@ -1135,7 +1138,7 @@ void init_request_from_bio(struct request *req, struct bio *bio)
 static int __make_request(struct request_queue *q, struct bio *bio)
 {
         struct request *req;
-        int el_ret, nr_sectors, barrier, discard, err;
+        int el_ret, nr_sectors;
         const unsigned short prio = bio_prio(bio);
         const int sync = bio_sync(bio);
         int rw_flags;
@@ -1149,22 +1152,9 @@ static int __make_request(struct request_queue *q, struct bio *bio)
          */
         blk_queue_bounce(q, &bio);
 
-        barrier = bio_barrier(bio);
-        if (unlikely(barrier) && bio_has_data(bio) &&
-            (q->next_ordered == QUEUE_ORDERED_NONE)) {
-                err = -EOPNOTSUPP;
-                goto end_io;
-        }
-
-        discard = bio_discard(bio);
-        if (unlikely(discard) && !q->prepare_discard_fn) {
-                err = -EOPNOTSUPP;
-                goto end_io;
-        }
-
         spin_lock_irq(q->queue_lock);
 
-        if (unlikely(barrier) || elv_queue_empty(q))
+        if (unlikely(bio_barrier(bio)) || elv_queue_empty(q))
                 goto get_rq;
 
         el_ret = elv_merge(q, &req, bio);
@@ -1250,18 +1240,14 @@ get_rq:
         if (test_bit(QUEUE_FLAG_SAME_COMP, &q->queue_flags) ||
             bio_flagged(bio, BIO_CPU_AFFINE))
                 req->cpu = blk_cpu_to_group(smp_processor_id());
-        if (elv_queue_empty(q))
+        if (!blk_queue_nonrot(q) && elv_queue_empty(q))
                 blk_plug_device(q);
         add_request(q, req);
 out:
-        if (sync)
+        if (sync || blk_queue_nonrot(q))
                 __generic_unplug_device(q);
         spin_unlock_irq(q->queue_lock);
         return 0;
-
-end_io:
-        bio_endio(bio, err);
-        return 0;
 }
 
 /*
@@ -1414,15 +1400,13 @@ static inline void __generic_make_request(struct bio *bio)
                 char b[BDEVNAME_SIZE];
 
                 q = bdev_get_queue(bio->bi_bdev);
-                if (!q) {
+                if (unlikely(!q)) {
                         printk(KERN_ERR
                                "generic_make_request: Trying to access "
                                 "nonexistent block-device %s (%Lu)\n",
                                 bdevname(bio->bi_bdev, b),
                                 (long long) bio->bi_sector);
-end_io:
-                        bio_endio(bio, err);
-                        break;
+                        goto end_io;
                 }
 
                 if (unlikely(nr_sectors > q->max_hw_sectors)) {
@@ -1459,14 +1443,19 @@ end_io:
 
                 if (bio_check_eod(bio, nr_sectors))
                         goto end_io;
-                if ((bio_empty_barrier(bio) && !q->prepare_flush_fn) ||
-                    (bio_discard(bio) && !q->prepare_discard_fn)) {
+
+                if (bio_discard(bio) && !q->prepare_discard_fn) {
                         err = -EOPNOTSUPP;
                         goto end_io;
                 }
 
                 ret = q->make_request_fn(q, bio);
         } while (ret);
+
+        return;
+
+end_io:
+        bio_endio(bio, err);
 }
 
 /*
@@ -1716,14 +1705,6 @@ static int __end_that_request_first(struct request *req, int error,
         while ((bio = req->bio) != NULL) {
                 int nbytes;
 
-                /*
-                 * For an empty barrier request, the low level driver must
-                 * store a potential error location in ->sector. We pass
-                 * that back up in ->bi_sector.
-                 */
-                if (blk_empty_barrier(req))
-                        bio->bi_sector = req->sector;
-
                 if (nr_bytes >= bio->bi_size) {
                         req->bio = bio->bi_next;
                         nbytes = bio->bi_size;
@@ -2143,12 +2124,6 @@ int kblockd_schedule_work(struct request_queue *q, struct work_struct *work)
 }
 EXPORT_SYMBOL(kblockd_schedule_work);
 
-void kblockd_flush_work(struct work_struct *work)
-{
-        cancel_work_sync(work);
-}
-EXPORT_SYMBOL(kblockd_flush_work);
-
 int __init blk_dev_init(void)
 {
         kblockd_workqueue = create_workqueue("kblockd");
diff --git a/block/blk-settings.c b/block/blk-settings.c
index afa55e14e278..59fd05d9f1d5 100644
--- a/block/blk-settings.c
+++ b/block/blk-settings.c
@@ -319,9 +319,9 @@ void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
         t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
         t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask, b->seg_boundary_mask);
 
-        t->max_phys_segments = min(t->max_phys_segments, b->max_phys_segments);
-        t->max_hw_segments = min(t->max_hw_segments, b->max_hw_segments);
-        t->max_segment_size = min(t->max_segment_size, b->max_segment_size);
+        t->max_phys_segments = min_not_zero(t->max_phys_segments, b->max_phys_segments);
+        t->max_hw_segments = min_not_zero(t->max_hw_segments, b->max_hw_segments);
+        t->max_segment_size = min_not_zero(t->max_segment_size, b->max_segment_size);
         t->hardsect_size = max(t->hardsect_size, b->hardsect_size);
         if (!t->queue_lock)
                 WARN_ON_ONCE(1);
diff --git a/block/blk-softirq.c b/block/blk-softirq.c
index e660d26ca656..ce0efc6b26dc 100644
--- a/block/blk-softirq.c
+++ b/block/blk-softirq.c
@@ -161,7 +161,7 @@ void blk_complete_request(struct request *req)
 }
 EXPORT_SYMBOL(blk_complete_request);
 
-__init int blk_softirq_init(void)
+static __init int blk_softirq_init(void)
 {
         int i;
 
diff --git a/block/blk-sysfs.c b/block/blk-sysfs.c
index 21e275d7eed9..a29cb788e408 100644
--- a/block/blk-sysfs.c
+++ b/block/blk-sysfs.c
@@ -88,9 +88,7 @@ queue_ra_store(struct request_queue *q, const char *page, size_t count)
         unsigned long ra_kb;
         ssize_t ret = queue_var_store(&ra_kb, page, count);
 
-        spin_lock_irq(q->queue_lock);
         q->backing_dev_info.ra_pages = ra_kb >> (PAGE_CACHE_SHIFT - 10);
-        spin_unlock_irq(q->queue_lock);
 
         return ret;
 }
@@ -117,10 +115,7 @@ queue_max_sectors_store(struct request_queue *q, const char *page, size_t count)
 
         if (max_sectors_kb > max_hw_sectors_kb || max_sectors_kb < page_kb)
                 return -EINVAL;
-        /*
-         * Take the queue lock to update the readahead and max_sectors
-         * values synchronously:
-         */
+
         spin_lock_irq(q->queue_lock);
         q->max_sectors = max_sectors_kb << 1;
         spin_unlock_irq(q->queue_lock);
diff --git a/block/blk-tag.c b/block/blk-tag.c
index c0d419e84ce7..3c518e3303ae 100644
--- a/block/blk-tag.c
+++ b/block/blk-tag.c
@@ -158,7 +158,6 @@ fail:
 /**
  * blk_init_tags - initialize the tag info for an external tag map
  * @depth:      the maximum queue depth supported
- * @tags: the tag to use
  **/
 struct blk_queue_tag *blk_init_tags(int depth)
 {
diff --git a/block/blk-timeout.c b/block/blk-timeout.c
index 69185ea9fae2..a09535377a94 100644
--- a/block/blk-timeout.c
+++ b/block/blk-timeout.c
@@ -73,11 +73,7 @@ ssize_t part_timeout_store(struct device *dev, struct device_attribute *attr,
  */
 void blk_delete_timer(struct request *req)
 {
-        struct request_queue *q = req->q;
-
         list_del_init(&req->timeout_list);
-        if (list_empty(&q->timeout_list))
-                del_timer(&q->timeout);
 }
 
 static void blk_rq_timed_out(struct request *req)
@@ -111,7 +107,7 @@ static void blk_rq_timed_out(struct request *req)
 void blk_rq_timed_out_timer(unsigned long data)
 {
         struct request_queue *q = (struct request_queue *) data;
-        unsigned long flags, uninitialized_var(next), next_set = 0;
+        unsigned long flags, next = 0;
         struct request *rq, *tmp;
 
         spin_lock_irqsave(q->queue_lock, flags);
@@ -126,15 +122,18 @@ void blk_rq_timed_out_timer(unsigned long data)
                         if (blk_mark_rq_complete(rq))
                                 continue;
                         blk_rq_timed_out(rq);
+                } else {
+                        if (!next || time_after(next, rq->deadline))
+                                next = rq->deadline;
                 }
-                if (!next_set) {
-                        next = rq->deadline;
-                        next_set = 1;
-                } else if (time_after(next, rq->deadline))
-                        next = rq->deadline;
         }
 
-        if (next_set && !list_empty(&q->timeout_list))
+        /*
+         * next can never be 0 here with the list non-empty, since we always
+         * bump ->deadline to 1 so we can detect if the timer was ever added
+         * or not. See comment in blk_add_timer()
+         */
+        if (next)
                 mod_timer(&q->timeout, round_jiffies_up(next));
 
         spin_unlock_irqrestore(q->queue_lock, flags);
diff --git a/block/cfq-iosched.c b/block/cfq-iosched.c
index 6a062eebbd15..e8525fa72823 100644
--- a/block/cfq-iosched.c
+++ b/block/cfq-iosched.c
@@ -1136,12 +1136,8 @@ static int cfq_dispatch_requests(struct request_queue *q, int force)
                 if (cfq_class_idle(cfqq))
                         max_dispatch = 1;
 
-                if (cfqq->dispatched >= max_dispatch) {
-                        if (cfqd->busy_queues > 1)
-                                break;
-                        if (cfqq->dispatched >= 4 * max_dispatch)
-                                break;
-                }
+                if (cfqq->dispatched >= max_dispatch && cfqd->busy_queues > 1)
+                        break;
 
                 if (cfqd->sync_flight && !cfq_cfqq_sync(cfqq))
                         break;
@@ -1318,7 +1314,15 @@ static void cfq_exit_single_io_context(struct io_context *ioc,
                 unsigned long flags;
 
                 spin_lock_irqsave(q->queue_lock, flags);
-                __cfq_exit_single_io_context(cfqd, cic);
+
+                /*
+                 * Ensure we get a fresh copy of the ->key to prevent
+                 * race between exiting task and queue
+                 */
+                smp_read_barrier_depends();
+                if (cic->key)
+                        __cfq_exit_single_io_context(cfqd, cic);
+
                 spin_unlock_irqrestore(q->queue_lock, flags);
         }
 }
@@ -2160,7 +2164,7 @@ out_cont:
 static void cfq_shutdown_timer_wq(struct cfq_data *cfqd)
 {
         del_timer_sync(&cfqd->idle_slice_timer);
-        kblockd_flush_work(&cfqd->unplug_work);
+        cancel_work_sync(&cfqd->unplug_work);
 }
 
 static void cfq_put_async_queues(struct cfq_data *cfqd)
@@ -2178,7 +2182,7 @@ static void cfq_put_async_queues(struct cfq_data *cfqd)
                 cfq_put_queue(cfqd->async_idle_cfqq);
 }
 
-static void cfq_exit_queue(elevator_t *e)
+static void cfq_exit_queue(struct elevator_queue *e)
 {
         struct cfq_data *cfqd = e->elevator_data;
         struct request_queue *q = cfqd->queue;
@@ -2288,7 +2292,7 @@ cfq_var_store(unsigned int *var, const char *page, size_t count)
 }
 
 #define SHOW_FUNCTION(__FUNC, __VAR, __CONV)                            \
-static ssize_t __FUNC(elevator_t *e, char *page)                        \
+static ssize_t __FUNC(struct elevator_queue *e, char *page)             \
 {                                                                       \
         struct cfq_data *cfqd = e->elevator_data;                       \
         unsigned int __data = __VAR;                                    \
@@ -2308,7 +2312,7 @@ SHOW_FUNCTION(cfq_slice_async_rq_show, cfqd->cfq_slice_async_rq, 0);
 #undef SHOW_FUNCTION
 
 #define STORE_FUNCTION(__FUNC, __PTR, MIN, MAX, __CONV)                 \
-static ssize_t __FUNC(elevator_t *e, const char *page, size_t count)    \
+static ssize_t __FUNC(struct elevator_queue *e, const char *page, size_t count) \
 {                                                                       \
         struct cfq_data *cfqd = e->elevator_data;                       \
         unsigned int __data;                                            \
diff --git a/block/compat_ioctl.c b/block/compat_ioctl.c
index 67eb93cff699..f87615dea46b 100644
--- a/block/compat_ioctl.c
+++ b/block/compat_ioctl.c
@@ -774,9 +774,7 @@ long compat_blkdev_ioctl(struct file *file, unsigned cmd, unsigned long arg)
                 bdi = blk_get_backing_dev_info(bdev);
                 if (bdi == NULL)
                         return -ENOTTY;
-                lock_kernel();
                 bdi->ra_pages = (arg * 512) / PAGE_CACHE_SIZE;
-                unlock_kernel();
                 return 0;
         case BLKGETSIZE:
                 size = bdev->bd_inode->i_size;
diff --git a/block/deadline-iosched.c b/block/deadline-iosched.c
index fd311179f44c..c4d991d4adef 100644
--- a/block/deadline-iosched.c
+++ b/block/deadline-iosched.c
@@ -334,7 +334,7 @@ static int deadline_queue_empty(struct request_queue *q)
                 && list_empty(&dd->fifo_list[READ]);
 }
 
-static void deadline_exit_queue(elevator_t *e)
+static void deadline_exit_queue(struct elevator_queue *e)
 {
         struct deadline_data *dd = e->elevator_data;
 
@@ -387,7 +387,7 @@ deadline_var_store(int *var, const char *page, size_t count)
 }
 
 #define SHOW_FUNCTION(__FUNC, __VAR, __CONV)                            \
-static ssize_t __FUNC(elevator_t *e, char *page)                        \
+static ssize_t __FUNC(struct elevator_queue *e, char *page)             \
 {                                                                       \
         struct deadline_data *dd = e->elevator_data;                    \
         int __data = __VAR;                                             \
@@ -403,7 +403,7 @@ SHOW_FUNCTION(deadline_fifo_batch_show, dd->fifo_batch, 0);
 #undef SHOW_FUNCTION
 
 #define STORE_FUNCTION(__FUNC, __PTR, MIN, MAX, __CONV)                 \
-static ssize_t __FUNC(elevator_t *e, const char *page, size_t count)    \
+static ssize_t __FUNC(struct elevator_queue *e, const char *page, size_t count) \
 {                                                                       \
         struct deadline_data *dd = e->elevator_data;                    \
         int __data;                                                     \
diff --git a/block/elevator.c b/block/elevator.c
index 86836dd179c0..98259eda0ef6 100644
--- a/block/elevator.c
+++ b/block/elevator.c
@@ -65,7 +65,7 @@ DEFINE_TRACE(block_rq_issue);
 static int elv_iosched_allow_merge(struct request *rq, struct bio *bio)
 {
         struct request_queue *q = rq->q;
-        elevator_t *e = q->elevator;
+        struct elevator_queue *e = q->elevator;
 
         if (e->ops->elevator_allow_merge_fn)
                 return e->ops->elevator_allow_merge_fn(q, rq, bio);
@@ -208,13 +208,13 @@ __setup("elevator=", elevator_setup);
 
 static struct kobj_type elv_ktype;
 
-static elevator_t *elevator_alloc(struct request_queue *q,
+static struct elevator_queue *elevator_alloc(struct request_queue *q,
                                   struct elevator_type *e)
 {
-        elevator_t *eq;
+        struct elevator_queue *eq;
         int i;
 
-        eq = kmalloc_node(sizeof(elevator_t), GFP_KERNEL | __GFP_ZERO, q->node);
+        eq = kmalloc_node(sizeof(*eq), GFP_KERNEL | __GFP_ZERO, q->node);
         if (unlikely(!eq))
                 goto err;
 
@@ -240,8 +240,9 @@ err:
 
 static void elevator_release(struct kobject *kobj)
 {
-        elevator_t *e = container_of(kobj, elevator_t, kobj);
+        struct elevator_queue *e;
 
+        e = container_of(kobj, struct elevator_queue, kobj);
         elevator_put(e->elevator_type);
         kfree(e->hash);
         kfree(e);
@@ -297,7 +298,7 @@ int elevator_init(struct request_queue *q, char *name)
 }
 EXPORT_SYMBOL(elevator_init);
 
-void elevator_exit(elevator_t *e)
+void elevator_exit(struct elevator_queue *e)
 {
         mutex_lock(&e->sysfs_lock);
         if (e->ops->elevator_exit_fn)
@@ -311,7 +312,7 @@ EXPORT_SYMBOL(elevator_exit);
 
 static void elv_activate_rq(struct request_queue *q, struct request *rq)
 {
-        elevator_t *e = q->elevator;
+        struct elevator_queue *e = q->elevator;
 
         if (e->ops->elevator_activate_req_fn)
                 e->ops->elevator_activate_req_fn(q, rq);
@@ -319,7 +320,7 @@ static void elv_activate_rq(struct request_queue *q, struct request *rq)
 
 static void elv_deactivate_rq(struct request_queue *q, struct request *rq)
 {
-        elevator_t *e = q->elevator;
+        struct elevator_queue *e = q->elevator;
 
         if (e->ops->elevator_deactivate_req_fn)
                 e->ops->elevator_deactivate_req_fn(q, rq);
@@ -338,7 +339,7 @@ static void elv_rqhash_del(struct request_queue *q, struct request *rq)
 
 static void elv_rqhash_add(struct request_queue *q, struct request *rq)
 {
-        elevator_t *e = q->elevator;
+        struct elevator_queue *e = q->elevator;
 
         BUG_ON(ELV_ON_HASH(rq));
         hlist_add_head(&rq->hash, &e->hash[ELV_HASH_FN(rq_hash_key(rq))]);
@@ -352,7 +353,7 @@ static void elv_rqhash_reposition(struct request_queue *q, struct request *rq)
 
 static struct request *elv_rqhash_find(struct request_queue *q, sector_t offset)
 {
-        elevator_t *e = q->elevator;
+        struct elevator_queue *e = q->elevator;
         struct hlist_head *hash_list = &e->hash[ELV_HASH_FN(offset)];
         struct hlist_node *entry, *next;
         struct request *rq;
@@ -494,7 +495,7 @@ EXPORT_SYMBOL(elv_dispatch_add_tail);
 
 int elv_merge(struct request_queue *q, struct request **req, struct bio *bio)
 {
-        elevator_t *e = q->elevator;
+        struct elevator_queue *e = q->elevator;
         struct request *__rq;
         int ret;
 
@@ -529,7 +530,7 @@ int elv_merge(struct request_queue *q, struct request **req, struct bio *bio)
 
 void elv_merged_request(struct request_queue *q, struct request *rq, int type)
 {
-        elevator_t *e = q->elevator;
+        struct elevator_queue *e = q->elevator;
 
         if (e->ops->elevator_merged_fn)
                 e->ops->elevator_merged_fn(q, rq, type);
@@ -543,7 +544,7 @@ void elv_merged_request(struct request_queue *q, struct request *rq, int type)
 void elv_merge_requests(struct request_queue *q, struct request *rq,
                              struct request *next)
 {
-        elevator_t *e = q->elevator;
+        struct elevator_queue *e = q->elevator;
 
         if (e->ops->elevator_merge_req_fn)
                 e->ops->elevator_merge_req_fn(q, rq, next);
@@ -755,14 +756,6 @@ struct request *elv_next_request(struct request_queue *q)
         int ret;
 
         while ((rq = __elv_next_request(q)) != NULL) {
-                /*
-                 * Kill the empty barrier place holder, the driver must
-                 * not ever see it.
-                 */
-                if (blk_empty_barrier(rq)) {
-                        __blk_end_request(rq, 0, blk_rq_bytes(rq));
-                        continue;
-                }
                 if (!(rq->cmd_flags & REQ_STARTED)) {
                         /*
                          * This is the first time the device driver
@@ -854,7 +847,7 @@ void elv_dequeue_request(struct request_queue *q, struct request *rq)
 
 int elv_queue_empty(struct request_queue *q)
 {
-        elevator_t *e = q->elevator;
+        struct elevator_queue *e = q->elevator;
 
         if (!list_empty(&q->queue_head))
                 return 0;
@@ -868,7 +861,7 @@ EXPORT_SYMBOL(elv_queue_empty);
 
 struct request *elv_latter_request(struct request_queue *q, struct request *rq)
 {
-        elevator_t *e = q->elevator;
+        struct elevator_queue *e = q->elevator;
 
         if (e->ops->elevator_latter_req_fn)
                 return e->ops->elevator_latter_req_fn(q, rq);
@@ -877,7 +870,7 @@ struct request *elv_latter_request(struct request_queue *q, struct request *rq)
 
 struct request *elv_former_request(struct request_queue *q, struct request *rq)
 {
-        elevator_t *e = q->elevator;
+        struct elevator_queue *e = q->elevator;
 
         if (e->ops->elevator_former_req_fn)
                 return e->ops->elevator_former_req_fn(q, rq);
@@ -886,7 +879,7 @@ struct request *elv_former_request(struct request_queue *q, struct request *rq)
 
 int elv_set_request(struct request_queue *q, struct request *rq, gfp_t gfp_mask)
 {
-        elevator_t *e = q->elevator;
+        struct elevator_queue *e = q->elevator;
 
         if (e->ops->elevator_set_req_fn)
                 return e->ops->elevator_set_req_fn(q, rq, gfp_mask);
@@ -897,7 +890,7 @@ int elv_set_request(struct request_queue *q, struct request *rq, gfp_t gfp_mask)
 
 void elv_put_request(struct request_queue *q, struct request *rq)
 {
-        elevator_t *e = q->elevator;
+        struct elevator_queue *e = q->elevator;
 
         if (e->ops->elevator_put_req_fn)
                 e->ops->elevator_put_req_fn(rq);
@@ -905,7 +898,7 @@ void elv_put_request(struct request_queue *q, struct request *rq)
 
 int elv_may_queue(struct request_queue *q, int rw)
 {
-        elevator_t *e = q->elevator;
+        struct elevator_queue *e = q->elevator;
 
         if (e->ops->elevator_may_queue_fn)
                 return e->ops->elevator_may_queue_fn(q, rw);
@@ -928,7 +921,7 @@ EXPORT_SYMBOL(elv_abort_queue);
 
 void elv_completed_request(struct request_queue *q, struct request *rq)
 {
-        elevator_t *e = q->elevator;
+        struct elevator_queue *e = q->elevator;
 
         /*
          * request is released from the driver, io must be done
@@ -944,10 +937,14 @@ void elv_completed_request(struct request_queue *q, struct request *rq)
          * drained for flush sequence.
          */
         if (unlikely(q->ordseq)) {
-                struct request *first_rq = list_entry_rq(q->queue_head.next);
-                if (q->in_flight == 0 &&
+                struct request *next = NULL;
+
+                if (!list_empty(&q->queue_head))
+                        next = list_entry_rq(q->queue_head.next);
+
+                if (!q->in_flight &&
                     blk_ordered_cur_seq(q) == QUEUE_ORDSEQ_DRAIN &&
-                    blk_ordered_req_seq(first_rq) > QUEUE_ORDSEQ_DRAIN) {
+                    (!next || blk_ordered_req_seq(next) > QUEUE_ORDSEQ_DRAIN)) {
                         blk_ordered_complete_seq(q, QUEUE_ORDSEQ_DRAIN, 0);
                         blk_start_queueing(q);
                 }
@@ -959,13 +956,14 @@ void elv_completed_request(struct request_queue *q, struct request *rq)
 static ssize_t
 elv_attr_show(struct kobject *kobj, struct attribute *attr, char *page)
 {
-        elevator_t *e = container_of(kobj, elevator_t, kobj);
         struct elv_fs_entry *entry = to_elv(attr);
+        struct elevator_queue *e;
         ssize_t error;
 
         if (!entry->show)
                 return -EIO;
 
+        e = container_of(kobj, struct elevator_queue, kobj);
         mutex_lock(&e->sysfs_lock);
         error = e->ops ? entry->show(e, page) : -ENOENT;
         mutex_unlock(&e->sysfs_lock);
@@ -976,13 +974,14 @@ static ssize_t
 elv_attr_store(struct kobject *kobj, struct attribute *attr,
                const char *page, size_t length)
 {
-        elevator_t *e = container_of(kobj, elevator_t, kobj);
         struct elv_fs_entry *entry = to_elv(attr);
+        struct elevator_queue *e;
         ssize_t error;
 
         if (!entry->store)
                 return -EIO;
 
+        e = container_of(kobj, struct elevator_queue, kobj);
         mutex_lock(&e->sysfs_lock);
         error = e->ops ? entry->store(e, page, length) : -ENOENT;
         mutex_unlock(&e->sysfs_lock);
@@ -1001,7 +1000,7 @@ static struct kobj_type elv_ktype = {
 
 int elv_register_queue(struct request_queue *q)
 {
-        elevator_t *e = q->elevator;
+        struct elevator_queue *e = q->elevator;
         int error;
 
         error = kobject_add(&e->kobj, &q->kobj, "%s", "iosched");
@@ -1019,7 +1018,7 @@ int elv_register_queue(struct request_queue *q)
         return error;
 }
 
-static void __elv_unregister_queue(elevator_t *e)
+static void __elv_unregister_queue(struct elevator_queue *e)
 {
         kobject_uevent(&e->kobj, KOBJ_REMOVE);
         kobject_del(&e->kobj);
@@ -1082,7 +1081,7 @@ EXPORT_SYMBOL_GPL(elv_unregister);
  */
 static int elevator_switch(struct request_queue *q, struct elevator_type *new_e)
 {
-        elevator_t *old_elevator, *e;
+        struct elevator_queue *old_elevator, *e;
         void *data;
 
         /*
@@ -1188,7 +1187,7 @@ ssize_t elv_iosched_store(struct request_queue *q, const char *name,
 
 ssize_t elv_iosched_show(struct request_queue *q, char *name)
 {
-        elevator_t *e = q->elevator;
+        struct elevator_queue *e = q->elevator;
         struct elevator_type *elv = e->elevator_type;
         struct elevator_type *__e;
         int len = 0;
diff --git a/block/genhd.c b/block/genhd.c
index 2f7feda61e35..d84a7df1e2a0 100644
--- a/block/genhd.c
+++ b/block/genhd.c
@@ -181,6 +181,12 @@ void disk_part_iter_exit(struct disk_part_iter *piter)
 }
 EXPORT_SYMBOL_GPL(disk_part_iter_exit);
 
+static inline int sector_in_part(struct hd_struct *part, sector_t sector)
+{
+        return part->start_sect <= sector &&
+                sector < part->start_sect + part->nr_sects;
+}
+
 /**
  * disk_map_sector_rcu - map sector to partition
  * @disk: gendisk of interest
@@ -199,16 +205,22 @@ EXPORT_SYMBOL_GPL(disk_part_iter_exit);
 struct hd_struct *disk_map_sector_rcu(struct gendisk *disk, sector_t sector)
 {
         struct disk_part_tbl *ptbl;
+        struct hd_struct *part;
         int i;
 
         ptbl = rcu_dereference(disk->part_tbl);
 
+        part = rcu_dereference(ptbl->last_lookup);
+        if (part && sector_in_part(part, sector))
+                return part;
+
         for (i = 1; i < ptbl->len; i++) {
-                struct hd_struct *part = rcu_dereference(ptbl->part[i]);
+                part = rcu_dereference(ptbl->part[i]);
 
-                if (part && part->start_sect <= sector &&
-                    sector < part->start_sect + part->nr_sects)
+                if (part && sector_in_part(part, sector)) {
+                        rcu_assign_pointer(ptbl->last_lookup, part);
                         return part;
+                }
         }
         return &disk->part0;
 }
@@ -888,8 +900,11 @@ static void disk_replace_part_tbl(struct gendisk *disk,
         struct disk_part_tbl *old_ptbl = disk->part_tbl;
 
         rcu_assign_pointer(disk->part_tbl, new_ptbl);
-        if (old_ptbl)
+
+        if (old_ptbl) {
+                rcu_assign_pointer(old_ptbl->last_lookup, NULL);
                 call_rcu(&old_ptbl->rcu_head, disk_free_ptbl_rcu_cb);
+        }
 }
 
 /**
diff --git a/block/ioctl.c b/block/ioctl.c
index d03985b04d67..0f22e629b13c 100644
--- a/block/ioctl.c
+++ b/block/ioctl.c
@@ -323,9 +323,7 @@ int blkdev_ioctl(struct block_device *bdev, fmode_t mode, unsigned cmd,
                 bdi = blk_get_backing_dev_info(bdev);
                 if (bdi == NULL)
                         return -ENOTTY;
-                lock_kernel();
                 bdi->ra_pages = (arg * 512) / PAGE_CACHE_SIZE;
-                unlock_kernel();
                 return 0;
         case BLKBSZSET:
                 /* set the logical block size */
diff --git a/block/noop-iosched.c b/block/noop-iosched.c
index c23e02969650..3a0d369d08c7 100644
--- a/block/noop-iosched.c
+++ b/block/noop-iosched.c
@@ -76,7 +76,7 @@ static void *noop_init_queue(struct request_queue *q)
         return nd;
 }
 
-static void noop_exit_queue(elevator_t *e)
+static void noop_exit_queue(struct elevator_queue *e)
 {
         struct noop_data *nd = e->elevator_data;
 
diff --git a/block/scsi_ioctl.c b/block/scsi_ioctl.c
index d0bb92cbefb9..ee9c67d7e1be 100644
--- a/block/scsi_ioctl.c
+++ b/block/scsi_ioctl.c
@@ -60,7 +60,7 @@ static int scsi_get_bus(struct request_queue *q, int __user *p)
 
 static int sg_get_timeout(struct request_queue *q)
 {
-        return q->sg_timeout / (HZ / USER_HZ);
+        return jiffies_to_clock_t(q->sg_timeout);
 }
 
 static int sg_set_timeout(struct request_queue *q, int __user *p)
@@ -68,7 +68,7 @@ static int sg_set_timeout(struct request_queue *q, int __user *p)
         int timeout, err = get_user(timeout, p);
 
         if (!err)
-                q->sg_timeout = timeout * (HZ / USER_HZ);
+                q->sg_timeout = clock_t_to_jiffies(timeout);
 
         return err;
 }