2 * Copyright (C) 1991, 1992 Linus Torvalds
3 * Copyright (C) 1994, Karl Keyte: Added support for disk statistics
4 * Elevator latency, (C) 2000 Andrea Arcangeli <andrea@suse.de> SuSE
5 * Queue request tables / lock, selectable elevator, Jens Axboe <axboe@suse.de>
6 * kernel-doc documentation started by NeilBrown <neilb@cse.unsw.edu.au> - July2000
7 * bio rewrite, highmem i/o, etc, Jens Axboe <axboe@suse.de> - may 2001
11 * This handles all read/write requests to block devices
13 #include <linux/kernel.h>
14 #include <linux/module.h>
15 #include <linux/backing-dev.h>
16 #include <linux/bio.h>
17 #include <linux/blkdev.h>
18 #include <linux/highmem.h>
20 #include <linux/kernel_stat.h>
21 #include <linux/string.h>
22 #include <linux/init.h>
23 #include <linux/bootmem.h> /* for max_pfn/max_low_pfn */
24 #include <linux/completion.h>
25 #include <linux/slab.h>
26 #include <linux/swap.h>
27 #include <linux/writeback.h>
28 #include <linux/task_io_accounting_ops.h>
29 #include <linux/interrupt.h>
30 #include <linux/cpu.h>
31 #include <linux/blktrace_api.h>
32 #include <linux/fault-inject.h>
33 #include <linux/scatterlist.h>
38 #include <scsi/scsi_cmnd.h>
40 static void blk_unplug_work(struct work_struct
*work
);
41 static void blk_unplug_timeout(unsigned long data
);
42 static void drive_stat_acct(struct request
*rq
, int nr_sectors
, int new_io
);
43 static void init_request_from_bio(struct request
*req
, struct bio
*bio
);
44 static int __make_request(struct request_queue
*q
, struct bio
*bio
);
45 static struct io_context
*current_io_context(gfp_t gfp_flags
, int node
);
46 static void blk_recalc_rq_segments(struct request
*rq
);
47 static void blk_rq_bio_prep(struct request_queue
*q
, struct request
*rq
,
51 * For the allocated request tables
53 static struct kmem_cache
*request_cachep
;
56 * For queue allocation
58 static struct kmem_cache
*requestq_cachep
;
61 * For io context allocations
63 static struct kmem_cache
*iocontext_cachep
;
66 * Controlling structure to kblockd
68 static struct workqueue_struct
*kblockd_workqueue
;
70 unsigned long blk_max_low_pfn
, blk_max_pfn
;
72 EXPORT_SYMBOL(blk_max_low_pfn
);
73 EXPORT_SYMBOL(blk_max_pfn
);
75 static DEFINE_PER_CPU(struct list_head
, blk_cpu_done
);
77 /* Amount of time in which a process may batch requests */
78 #define BLK_BATCH_TIME (HZ/50UL)
80 /* Number of requests a "batching" process may submit */
81 #define BLK_BATCH_REQ 32
84 * Return the threshold (number of used requests) at which the queue is
85 * considered to be congested. It include a little hysteresis to keep the
86 * context switch rate down.
88 static inline int queue_congestion_on_threshold(struct request_queue
*q
)
90 return q
->nr_congestion_on
;
94 * The threshold at which a queue is considered to be uncongested
96 static inline int queue_congestion_off_threshold(struct request_queue
*q
)
98 return q
->nr_congestion_off
;
101 static void blk_queue_congestion_threshold(struct request_queue
*q
)
105 nr
= q
->nr_requests
- (q
->nr_requests
/ 8) + 1;
106 if (nr
> q
->nr_requests
)
108 q
->nr_congestion_on
= nr
;
110 nr
= q
->nr_requests
- (q
->nr_requests
/ 8) - (q
->nr_requests
/ 16) - 1;
113 q
->nr_congestion_off
= nr
;
117 * blk_get_backing_dev_info - get the address of a queue's backing_dev_info
120 * Locates the passed device's request queue and returns the address of its
123 * Will return NULL if the request queue cannot be located.
125 struct backing_dev_info
*blk_get_backing_dev_info(struct block_device
*bdev
)
127 struct backing_dev_info
*ret
= NULL
;
128 struct request_queue
*q
= bdev_get_queue(bdev
);
131 ret
= &q
->backing_dev_info
;
134 EXPORT_SYMBOL(blk_get_backing_dev_info
);
137 * blk_queue_prep_rq - set a prepare_request function for queue
139 * @pfn: prepare_request function
141 * It's possible for a queue to register a prepare_request callback which
142 * is invoked before the request is handed to the request_fn. The goal of
143 * the function is to prepare a request for I/O, it can be used to build a
144 * cdb from the request data for instance.
147 void blk_queue_prep_rq(struct request_queue
*q
, prep_rq_fn
*pfn
)
152 EXPORT_SYMBOL(blk_queue_prep_rq
);
155 * blk_queue_merge_bvec - set a merge_bvec function for queue
157 * @mbfn: merge_bvec_fn
159 * Usually queues have static limitations on the max sectors or segments that
160 * we can put in a request. Stacking drivers may have some settings that
161 * are dynamic, and thus we have to query the queue whether it is ok to
162 * add a new bio_vec to a bio at a given offset or not. If the block device
163 * has such limitations, it needs to register a merge_bvec_fn to control
164 * the size of bio's sent to it. Note that a block device *must* allow a
165 * single page to be added to an empty bio. The block device driver may want
166 * to use the bio_split() function to deal with these bio's. By default
167 * no merge_bvec_fn is defined for a queue, and only the fixed limits are
170 void blk_queue_merge_bvec(struct request_queue
*q
, merge_bvec_fn
*mbfn
)
172 q
->merge_bvec_fn
= mbfn
;
175 EXPORT_SYMBOL(blk_queue_merge_bvec
);
177 void blk_queue_softirq_done(struct request_queue
*q
, softirq_done_fn
*fn
)
179 q
->softirq_done_fn
= fn
;
182 EXPORT_SYMBOL(blk_queue_softirq_done
);
185 * blk_queue_make_request - define an alternate make_request function for a device
186 * @q: the request queue for the device to be affected
187 * @mfn: the alternate make_request function
190 * The normal way for &struct bios to be passed to a device
191 * driver is for them to be collected into requests on a request
192 * queue, and then to allow the device driver to select requests
193 * off that queue when it is ready. This works well for many block
194 * devices. However some block devices (typically virtual devices
195 * such as md or lvm) do not benefit from the processing on the
196 * request queue, and are served best by having the requests passed
197 * directly to them. This can be achieved by providing a function
198 * to blk_queue_make_request().
201 * The driver that does this *must* be able to deal appropriately
202 * with buffers in "highmemory". This can be accomplished by either calling
203 * __bio_kmap_atomic() to get a temporary kernel mapping, or by calling
204 * blk_queue_bounce() to create a buffer in normal memory.
206 void blk_queue_make_request(struct request_queue
* q
, make_request_fn
* mfn
)
211 q
->nr_requests
= BLKDEV_MAX_RQ
;
212 blk_queue_max_phys_segments(q
, MAX_PHYS_SEGMENTS
);
213 blk_queue_max_hw_segments(q
, MAX_HW_SEGMENTS
);
214 q
->make_request_fn
= mfn
;
215 q
->backing_dev_info
.ra_pages
= (VM_MAX_READAHEAD
* 1024) / PAGE_CACHE_SIZE
;
216 q
->backing_dev_info
.state
= 0;
217 q
->backing_dev_info
.capabilities
= BDI_CAP_MAP_COPY
;
218 blk_queue_max_sectors(q
, SAFE_MAX_SECTORS
);
219 blk_queue_hardsect_size(q
, 512);
220 blk_queue_dma_alignment(q
, 511);
221 blk_queue_congestion_threshold(q
);
222 q
->nr_batching
= BLK_BATCH_REQ
;
224 q
->unplug_thresh
= 4; /* hmm */
225 q
->unplug_delay
= (3 * HZ
) / 1000; /* 3 milliseconds */
226 if (q
->unplug_delay
== 0)
229 INIT_WORK(&q
->unplug_work
, blk_unplug_work
);
231 q
->unplug_timer
.function
= blk_unplug_timeout
;
232 q
->unplug_timer
.data
= (unsigned long)q
;
235 * by default assume old behaviour and bounce for any highmem page
237 blk_queue_bounce_limit(q
, BLK_BOUNCE_HIGH
);
240 EXPORT_SYMBOL(blk_queue_make_request
);
242 static void rq_init(struct request_queue
*q
, struct request
*rq
)
244 INIT_LIST_HEAD(&rq
->queuelist
);
245 INIT_LIST_HEAD(&rq
->donelist
);
248 rq
->bio
= rq
->biotail
= NULL
;
249 INIT_HLIST_NODE(&rq
->hash
);
250 RB_CLEAR_NODE(&rq
->rb_node
);
258 rq
->nr_phys_segments
= 0;
261 rq
->end_io_data
= NULL
;
262 rq
->completion_data
= NULL
;
267 * blk_queue_ordered - does this queue support ordered writes
268 * @q: the request queue
269 * @ordered: one of QUEUE_ORDERED_*
270 * @prepare_flush_fn: rq setup helper for cache flush ordered writes
273 * For journalled file systems, doing ordered writes on a commit
274 * block instead of explicitly doing wait_on_buffer (which is bad
275 * for performance) can be a big win. Block drivers supporting this
276 * feature should call this function and indicate so.
279 int blk_queue_ordered(struct request_queue
*q
, unsigned ordered
,
280 prepare_flush_fn
*prepare_flush_fn
)
282 if (ordered
& (QUEUE_ORDERED_PREFLUSH
| QUEUE_ORDERED_POSTFLUSH
) &&
283 prepare_flush_fn
== NULL
) {
284 printk(KERN_ERR
"blk_queue_ordered: prepare_flush_fn required\n");
288 if (ordered
!= QUEUE_ORDERED_NONE
&&
289 ordered
!= QUEUE_ORDERED_DRAIN
&&
290 ordered
!= QUEUE_ORDERED_DRAIN_FLUSH
&&
291 ordered
!= QUEUE_ORDERED_DRAIN_FUA
&&
292 ordered
!= QUEUE_ORDERED_TAG
&&
293 ordered
!= QUEUE_ORDERED_TAG_FLUSH
&&
294 ordered
!= QUEUE_ORDERED_TAG_FUA
) {
295 printk(KERN_ERR
"blk_queue_ordered: bad value %d\n", ordered
);
299 q
->ordered
= ordered
;
300 q
->next_ordered
= ordered
;
301 q
->prepare_flush_fn
= prepare_flush_fn
;
306 EXPORT_SYMBOL(blk_queue_ordered
);
309 * Cache flushing for ordered writes handling
311 inline unsigned blk_ordered_cur_seq(struct request_queue
*q
)
315 return 1 << ffz(q
->ordseq
);
318 unsigned blk_ordered_req_seq(struct request
*rq
)
320 struct request_queue
*q
= rq
->q
;
322 BUG_ON(q
->ordseq
== 0);
324 if (rq
== &q
->pre_flush_rq
)
325 return QUEUE_ORDSEQ_PREFLUSH
;
326 if (rq
== &q
->bar_rq
)
327 return QUEUE_ORDSEQ_BAR
;
328 if (rq
== &q
->post_flush_rq
)
329 return QUEUE_ORDSEQ_POSTFLUSH
;
332 * !fs requests don't need to follow barrier ordering. Always
333 * put them at the front. This fixes the following deadlock.
335 * http://thread.gmane.org/gmane.linux.kernel/537473
337 if (!blk_fs_request(rq
))
338 return QUEUE_ORDSEQ_DRAIN
;
340 if ((rq
->cmd_flags
& REQ_ORDERED_COLOR
) ==
341 (q
->orig_bar_rq
->cmd_flags
& REQ_ORDERED_COLOR
))
342 return QUEUE_ORDSEQ_DRAIN
;
344 return QUEUE_ORDSEQ_DONE
;
347 void blk_ordered_complete_seq(struct request_queue
*q
, unsigned seq
, int error
)
352 if (error
&& !q
->orderr
)
355 BUG_ON(q
->ordseq
& seq
);
358 if (blk_ordered_cur_seq(q
) != QUEUE_ORDSEQ_DONE
)
362 * Okay, sequence complete.
366 uptodate
= q
->orderr
;
371 end_that_request_first(rq
, uptodate
, rq
->hard_nr_sectors
);
372 end_that_request_last(rq
, uptodate
);
375 static void pre_flush_end_io(struct request
*rq
, int error
)
377 elv_completed_request(rq
->q
, rq
);
378 blk_ordered_complete_seq(rq
->q
, QUEUE_ORDSEQ_PREFLUSH
, error
);
381 static void bar_end_io(struct request
*rq
, int error
)
383 elv_completed_request(rq
->q
, rq
);
384 blk_ordered_complete_seq(rq
->q
, QUEUE_ORDSEQ_BAR
, error
);
387 static void post_flush_end_io(struct request
*rq
, int error
)
389 elv_completed_request(rq
->q
, rq
);
390 blk_ordered_complete_seq(rq
->q
, QUEUE_ORDSEQ_POSTFLUSH
, error
);
393 static void queue_flush(struct request_queue
*q
, unsigned which
)
396 rq_end_io_fn
*end_io
;
398 if (which
== QUEUE_ORDERED_PREFLUSH
) {
399 rq
= &q
->pre_flush_rq
;
400 end_io
= pre_flush_end_io
;
402 rq
= &q
->post_flush_rq
;
403 end_io
= post_flush_end_io
;
406 rq
->cmd_flags
= REQ_HARDBARRIER
;
408 rq
->elevator_private
= NULL
;
409 rq
->elevator_private2
= NULL
;
410 rq
->rq_disk
= q
->bar_rq
.rq_disk
;
412 q
->prepare_flush_fn(q
, rq
);
414 elv_insert(q
, rq
, ELEVATOR_INSERT_FRONT
);
417 static inline struct request
*start_ordered(struct request_queue
*q
,
421 q
->ordered
= q
->next_ordered
;
422 q
->ordseq
|= QUEUE_ORDSEQ_STARTED
;
425 * Prep proxy barrier request.
427 blkdev_dequeue_request(rq
);
432 if (bio_data_dir(q
->orig_bar_rq
->bio
) == WRITE
)
433 rq
->cmd_flags
|= REQ_RW
;
434 if (q
->ordered
& QUEUE_ORDERED_FUA
)
435 rq
->cmd_flags
|= REQ_FUA
;
436 rq
->elevator_private
= NULL
;
437 rq
->elevator_private2
= NULL
;
438 init_request_from_bio(rq
, q
->orig_bar_rq
->bio
);
439 rq
->end_io
= bar_end_io
;
442 * Queue ordered sequence. As we stack them at the head, we
443 * need to queue in reverse order. Note that we rely on that
444 * no fs request uses ELEVATOR_INSERT_FRONT and thus no fs
445 * request gets inbetween ordered sequence. If this request is
446 * an empty barrier, we don't need to do a postflush ever since
447 * there will be no data written between the pre and post flush.
448 * Hence a single flush will suffice.
450 if ((q
->ordered
& QUEUE_ORDERED_POSTFLUSH
) && !blk_empty_barrier(rq
))
451 queue_flush(q
, QUEUE_ORDERED_POSTFLUSH
);
453 q
->ordseq
|= QUEUE_ORDSEQ_POSTFLUSH
;
455 elv_insert(q
, rq
, ELEVATOR_INSERT_FRONT
);
457 if (q
->ordered
& QUEUE_ORDERED_PREFLUSH
) {
458 queue_flush(q
, QUEUE_ORDERED_PREFLUSH
);
459 rq
= &q
->pre_flush_rq
;
461 q
->ordseq
|= QUEUE_ORDSEQ_PREFLUSH
;
463 if ((q
->ordered
& QUEUE_ORDERED_TAG
) || q
->in_flight
== 0)
464 q
->ordseq
|= QUEUE_ORDSEQ_DRAIN
;
471 int blk_do_ordered(struct request_queue
*q
, struct request
**rqp
)
473 struct request
*rq
= *rqp
;
474 const int is_barrier
= blk_fs_request(rq
) && blk_barrier_rq(rq
);
480 if (q
->next_ordered
!= QUEUE_ORDERED_NONE
) {
481 *rqp
= start_ordered(q
, rq
);
485 * This can happen when the queue switches to
486 * ORDERED_NONE while this request is on it.
488 blkdev_dequeue_request(rq
);
489 end_that_request_first(rq
, -EOPNOTSUPP
,
490 rq
->hard_nr_sectors
);
491 end_that_request_last(rq
, -EOPNOTSUPP
);
498 * Ordered sequence in progress
501 /* Special requests are not subject to ordering rules. */
502 if (!blk_fs_request(rq
) &&
503 rq
!= &q
->pre_flush_rq
&& rq
!= &q
->post_flush_rq
)
506 if (q
->ordered
& QUEUE_ORDERED_TAG
) {
507 /* Ordered by tag. Blocking the next barrier is enough. */
508 if (is_barrier
&& rq
!= &q
->bar_rq
)
511 /* Ordered by draining. Wait for turn. */
512 WARN_ON(blk_ordered_req_seq(rq
) < blk_ordered_cur_seq(q
));
513 if (blk_ordered_req_seq(rq
) > blk_ordered_cur_seq(q
))
520 static void req_bio_endio(struct request
*rq
, struct bio
*bio
,
521 unsigned int nbytes
, int error
)
523 struct request_queue
*q
= rq
->q
;
525 if (&q
->bar_rq
!= rq
) {
527 clear_bit(BIO_UPTODATE
, &bio
->bi_flags
);
528 else if (!test_bit(BIO_UPTODATE
, &bio
->bi_flags
))
531 if (unlikely(nbytes
> bio
->bi_size
)) {
532 printk("%s: want %u bytes done, only %u left\n",
533 __FUNCTION__
, nbytes
, bio
->bi_size
);
534 nbytes
= bio
->bi_size
;
537 bio
->bi_size
-= nbytes
;
538 bio
->bi_sector
+= (nbytes
>> 9);
539 if (bio
->bi_size
== 0)
540 bio_endio(bio
, error
);
544 * Okay, this is the barrier request in progress, just
547 if (error
&& !q
->orderr
)
553 * blk_queue_bounce_limit - set bounce buffer limit for queue
554 * @q: the request queue for the device
555 * @dma_addr: bus address limit
558 * Different hardware can have different requirements as to what pages
559 * it can do I/O directly to. A low level driver can call
560 * blk_queue_bounce_limit to have lower memory pages allocated as bounce
561 * buffers for doing I/O to pages residing above @page.
563 void blk_queue_bounce_limit(struct request_queue
*q
, u64 dma_addr
)
565 unsigned long bounce_pfn
= dma_addr
>> PAGE_SHIFT
;
568 q
->bounce_gfp
= GFP_NOIO
;
569 #if BITS_PER_LONG == 64
570 /* Assume anything <= 4GB can be handled by IOMMU.
571 Actually some IOMMUs can handle everything, but I don't
572 know of a way to test this here. */
573 if (bounce_pfn
< (min_t(u64
,0xffffffff,BLK_BOUNCE_HIGH
) >> PAGE_SHIFT
))
575 q
->bounce_pfn
= max_low_pfn
;
577 if (bounce_pfn
< blk_max_low_pfn
)
579 q
->bounce_pfn
= bounce_pfn
;
582 init_emergency_isa_pool();
583 q
->bounce_gfp
= GFP_NOIO
| GFP_DMA
;
584 q
->bounce_pfn
= bounce_pfn
;
588 EXPORT_SYMBOL(blk_queue_bounce_limit
);
591 * blk_queue_max_sectors - set max sectors for a request for this queue
592 * @q: the request queue for the device
593 * @max_sectors: max sectors in the usual 512b unit
596 * Enables a low level driver to set an upper limit on the size of
599 void blk_queue_max_sectors(struct request_queue
*q
, unsigned int max_sectors
)
601 if ((max_sectors
<< 9) < PAGE_CACHE_SIZE
) {
602 max_sectors
= 1 << (PAGE_CACHE_SHIFT
- 9);
603 printk("%s: set to minimum %d\n", __FUNCTION__
, max_sectors
);
606 if (BLK_DEF_MAX_SECTORS
> max_sectors
)
607 q
->max_hw_sectors
= q
->max_sectors
= max_sectors
;
609 q
->max_sectors
= BLK_DEF_MAX_SECTORS
;
610 q
->max_hw_sectors
= max_sectors
;
614 EXPORT_SYMBOL(blk_queue_max_sectors
);
617 * blk_queue_max_phys_segments - set max phys segments for a request for this queue
618 * @q: the request queue for the device
619 * @max_segments: max number of segments
622 * Enables a low level driver to set an upper limit on the number of
623 * physical data segments in a request. This would be the largest sized
624 * scatter list the driver could handle.
626 void blk_queue_max_phys_segments(struct request_queue
*q
,
627 unsigned short max_segments
)
631 printk("%s: set to minimum %d\n", __FUNCTION__
, max_segments
);
634 q
->max_phys_segments
= max_segments
;
637 EXPORT_SYMBOL(blk_queue_max_phys_segments
);
640 * blk_queue_max_hw_segments - set max hw segments for a request for this queue
641 * @q: the request queue for the device
642 * @max_segments: max number of segments
645 * Enables a low level driver to set an upper limit on the number of
646 * hw data segments in a request. This would be the largest number of
647 * address/length pairs the host adapter can actually give as once
650 void blk_queue_max_hw_segments(struct request_queue
*q
,
651 unsigned short max_segments
)
655 printk("%s: set to minimum %d\n", __FUNCTION__
, max_segments
);
658 q
->max_hw_segments
= max_segments
;
661 EXPORT_SYMBOL(blk_queue_max_hw_segments
);
664 * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg
665 * @q: the request queue for the device
666 * @max_size: max size of segment in bytes
669 * Enables a low level driver to set an upper limit on the size of a
672 void blk_queue_max_segment_size(struct request_queue
*q
, unsigned int max_size
)
674 if (max_size
< PAGE_CACHE_SIZE
) {
675 max_size
= PAGE_CACHE_SIZE
;
676 printk("%s: set to minimum %d\n", __FUNCTION__
, max_size
);
679 q
->max_segment_size
= max_size
;
682 EXPORT_SYMBOL(blk_queue_max_segment_size
);
685 * blk_queue_hardsect_size - set hardware sector size for the queue
686 * @q: the request queue for the device
687 * @size: the hardware sector size, in bytes
690 * This should typically be set to the lowest possible sector size
691 * that the hardware can operate on (possible without reverting to
692 * even internal read-modify-write operations). Usually the default
693 * of 512 covers most hardware.
695 void blk_queue_hardsect_size(struct request_queue
*q
, unsigned short size
)
697 q
->hardsect_size
= size
;
700 EXPORT_SYMBOL(blk_queue_hardsect_size
);
703 * Returns the minimum that is _not_ zero, unless both are zero.
705 #define min_not_zero(l, r) (l == 0) ? r : ((r == 0) ? l : min(l, r))
708 * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers
709 * @t: the stacking driver (top)
710 * @b: the underlying device (bottom)
712 void blk_queue_stack_limits(struct request_queue
*t
, struct request_queue
*b
)
714 /* zero is "infinity" */
715 t
->max_sectors
= min_not_zero(t
->max_sectors
,b
->max_sectors
);
716 t
->max_hw_sectors
= min_not_zero(t
->max_hw_sectors
,b
->max_hw_sectors
);
718 t
->max_phys_segments
= min(t
->max_phys_segments
,b
->max_phys_segments
);
719 t
->max_hw_segments
= min(t
->max_hw_segments
,b
->max_hw_segments
);
720 t
->max_segment_size
= min(t
->max_segment_size
,b
->max_segment_size
);
721 t
->hardsect_size
= max(t
->hardsect_size
,b
->hardsect_size
);
722 if (!test_bit(QUEUE_FLAG_CLUSTER
, &b
->queue_flags
))
723 clear_bit(QUEUE_FLAG_CLUSTER
, &t
->queue_flags
);
726 EXPORT_SYMBOL(blk_queue_stack_limits
);
729 * blk_queue_segment_boundary - set boundary rules for segment merging
730 * @q: the request queue for the device
731 * @mask: the memory boundary mask
733 void blk_queue_segment_boundary(struct request_queue
*q
, unsigned long mask
)
735 if (mask
< PAGE_CACHE_SIZE
- 1) {
736 mask
= PAGE_CACHE_SIZE
- 1;
737 printk("%s: set to minimum %lx\n", __FUNCTION__
, mask
);
740 q
->seg_boundary_mask
= mask
;
743 EXPORT_SYMBOL(blk_queue_segment_boundary
);
746 * blk_queue_dma_alignment - set dma length and memory alignment
747 * @q: the request queue for the device
748 * @mask: alignment mask
751 * set required memory and length aligment for direct dma transactions.
752 * this is used when buiding direct io requests for the queue.
755 void blk_queue_dma_alignment(struct request_queue
*q
, int mask
)
757 q
->dma_alignment
= mask
;
760 EXPORT_SYMBOL(blk_queue_dma_alignment
);
763 * blk_queue_find_tag - find a request by its tag and queue
764 * @q: The request queue for the device
765 * @tag: The tag of the request
768 * Should be used when a device returns a tag and you want to match
771 * no locks need be held.
773 struct request
*blk_queue_find_tag(struct request_queue
*q
, int tag
)
775 return blk_map_queue_find_tag(q
->queue_tags
, tag
);
778 EXPORT_SYMBOL(blk_queue_find_tag
);
781 * __blk_free_tags - release a given set of tag maintenance info
782 * @bqt: the tag map to free
784 * Tries to free the specified @bqt@. Returns true if it was
785 * actually freed and false if there are still references using it
787 static int __blk_free_tags(struct blk_queue_tag
*bqt
)
791 retval
= atomic_dec_and_test(&bqt
->refcnt
);
794 BUG_ON(!list_empty(&bqt
->busy_list
));
796 kfree(bqt
->tag_index
);
797 bqt
->tag_index
= NULL
;
810 * __blk_queue_free_tags - release tag maintenance info
811 * @q: the request queue for the device
814 * blk_cleanup_queue() will take care of calling this function, if tagging
815 * has been used. So there's no need to call this directly.
817 static void __blk_queue_free_tags(struct request_queue
*q
)
819 struct blk_queue_tag
*bqt
= q
->queue_tags
;
824 __blk_free_tags(bqt
);
826 q
->queue_tags
= NULL
;
827 q
->queue_flags
&= ~(1 << QUEUE_FLAG_QUEUED
);
832 * blk_free_tags - release a given set of tag maintenance info
833 * @bqt: the tag map to free
835 * For externally managed @bqt@ frees the map. Callers of this
836 * function must guarantee to have released all the queues that
837 * might have been using this tag map.
839 void blk_free_tags(struct blk_queue_tag
*bqt
)
841 if (unlikely(!__blk_free_tags(bqt
)))
844 EXPORT_SYMBOL(blk_free_tags
);
847 * blk_queue_free_tags - release tag maintenance info
848 * @q: the request queue for the device
851 * This is used to disabled tagged queuing to a device, yet leave
854 void blk_queue_free_tags(struct request_queue
*q
)
856 clear_bit(QUEUE_FLAG_QUEUED
, &q
->queue_flags
);
859 EXPORT_SYMBOL(blk_queue_free_tags
);
862 init_tag_map(struct request_queue
*q
, struct blk_queue_tag
*tags
, int depth
)
864 struct request
**tag_index
;
865 unsigned long *tag_map
;
868 if (q
&& depth
> q
->nr_requests
* 2) {
869 depth
= q
->nr_requests
* 2;
870 printk(KERN_ERR
"%s: adjusted depth to %d\n",
871 __FUNCTION__
, depth
);
874 tag_index
= kzalloc(depth
* sizeof(struct request
*), GFP_ATOMIC
);
878 nr_ulongs
= ALIGN(depth
, BITS_PER_LONG
) / BITS_PER_LONG
;
879 tag_map
= kzalloc(nr_ulongs
* sizeof(unsigned long), GFP_ATOMIC
);
883 tags
->real_max_depth
= depth
;
884 tags
->max_depth
= depth
;
885 tags
->tag_index
= tag_index
;
886 tags
->tag_map
= tag_map
;
894 static struct blk_queue_tag
*__blk_queue_init_tags(struct request_queue
*q
,
897 struct blk_queue_tag
*tags
;
899 tags
= kmalloc(sizeof(struct blk_queue_tag
), GFP_ATOMIC
);
903 if (init_tag_map(q
, tags
, depth
))
906 INIT_LIST_HEAD(&tags
->busy_list
);
908 atomic_set(&tags
->refcnt
, 1);
916 * blk_init_tags - initialize the tag info for an external tag map
917 * @depth: the maximum queue depth supported
918 * @tags: the tag to use
920 struct blk_queue_tag
*blk_init_tags(int depth
)
922 return __blk_queue_init_tags(NULL
, depth
);
924 EXPORT_SYMBOL(blk_init_tags
);
927 * blk_queue_init_tags - initialize the queue tag info
928 * @q: the request queue for the device
929 * @depth: the maximum queue depth supported
930 * @tags: the tag to use
932 int blk_queue_init_tags(struct request_queue
*q
, int depth
,
933 struct blk_queue_tag
*tags
)
937 BUG_ON(tags
&& q
->queue_tags
&& tags
!= q
->queue_tags
);
939 if (!tags
&& !q
->queue_tags
) {
940 tags
= __blk_queue_init_tags(q
, depth
);
944 } else if (q
->queue_tags
) {
945 if ((rc
= blk_queue_resize_tags(q
, depth
)))
947 set_bit(QUEUE_FLAG_QUEUED
, &q
->queue_flags
);
950 atomic_inc(&tags
->refcnt
);
953 * assign it, all done
955 q
->queue_tags
= tags
;
956 q
->queue_flags
|= (1 << QUEUE_FLAG_QUEUED
);
963 EXPORT_SYMBOL(blk_queue_init_tags
);
966 * blk_queue_resize_tags - change the queueing depth
967 * @q: the request queue for the device
968 * @new_depth: the new max command queueing depth
971 * Must be called with the queue lock held.
973 int blk_queue_resize_tags(struct request_queue
*q
, int new_depth
)
975 struct blk_queue_tag
*bqt
= q
->queue_tags
;
976 struct request
**tag_index
;
977 unsigned long *tag_map
;
978 int max_depth
, nr_ulongs
;
984 * if we already have large enough real_max_depth. just
985 * adjust max_depth. *NOTE* as requests with tag value
986 * between new_depth and real_max_depth can be in-flight, tag
987 * map can not be shrunk blindly here.
989 if (new_depth
<= bqt
->real_max_depth
) {
990 bqt
->max_depth
= new_depth
;
995 * Currently cannot replace a shared tag map with a new
996 * one, so error out if this is the case
998 if (atomic_read(&bqt
->refcnt
) != 1)
1002 * save the old state info, so we can copy it back
1004 tag_index
= bqt
->tag_index
;
1005 tag_map
= bqt
->tag_map
;
1006 max_depth
= bqt
->real_max_depth
;
1008 if (init_tag_map(q
, bqt
, new_depth
))
1011 memcpy(bqt
->tag_index
, tag_index
, max_depth
* sizeof(struct request
*));
1012 nr_ulongs
= ALIGN(max_depth
, BITS_PER_LONG
) / BITS_PER_LONG
;
1013 memcpy(bqt
->tag_map
, tag_map
, nr_ulongs
* sizeof(unsigned long));
1020 EXPORT_SYMBOL(blk_queue_resize_tags
);
1023 * blk_queue_end_tag - end tag operations for a request
1024 * @q: the request queue for the device
1025 * @rq: the request that has completed
1028 * Typically called when end_that_request_first() returns 0, meaning
1029 * all transfers have been done for a request. It's important to call
1030 * this function before end_that_request_last(), as that will put the
1031 * request back on the free list thus corrupting the internal tag list.
1034 * queue lock must be held.
1036 void blk_queue_end_tag(struct request_queue
*q
, struct request
*rq
)
1038 struct blk_queue_tag
*bqt
= q
->queue_tags
;
1043 if (unlikely(tag
>= bqt
->real_max_depth
))
1045 * This can happen after tag depth has been reduced.
1046 * FIXME: how about a warning or info message here?
1050 list_del_init(&rq
->queuelist
);
1051 rq
->cmd_flags
&= ~REQ_QUEUED
;
1054 if (unlikely(bqt
->tag_index
[tag
] == NULL
))
1055 printk(KERN_ERR
"%s: tag %d is missing\n",
1058 bqt
->tag_index
[tag
] = NULL
;
1061 * We use test_and_clear_bit's memory ordering properties here.
1062 * The tag_map bit acts as a lock for tag_index[bit], so we need
1063 * a barrer before clearing the bit (precisely: release semantics).
1064 * Could use clear_bit_unlock when it is merged.
1066 if (unlikely(!test_and_clear_bit(tag
, bqt
->tag_map
))) {
1067 printk(KERN_ERR
"%s: attempt to clear non-busy tag (%d)\n",
1075 EXPORT_SYMBOL(blk_queue_end_tag
);
1078 * blk_queue_start_tag - find a free tag and assign it
1079 * @q: the request queue for the device
1080 * @rq: the block request that needs tagging
1083 * This can either be used as a stand-alone helper, or possibly be
1084 * assigned as the queue &prep_rq_fn (in which case &struct request
1085 * automagically gets a tag assigned). Note that this function
1086 * assumes that any type of request can be queued! if this is not
1087 * true for your device, you must check the request type before
1088 * calling this function. The request will also be removed from
1089 * the request queue, so it's the drivers responsibility to readd
1090 * it if it should need to be restarted for some reason.
1093 * queue lock must be held.
1095 int blk_queue_start_tag(struct request_queue
*q
, struct request
*rq
)
1097 struct blk_queue_tag
*bqt
= q
->queue_tags
;
1100 if (unlikely((rq
->cmd_flags
& REQ_QUEUED
))) {
1102 "%s: request %p for device [%s] already tagged %d",
1104 rq
->rq_disk
? rq
->rq_disk
->disk_name
: "?", rq
->tag
);
1109 * Protect against shared tag maps, as we may not have exclusive
1110 * access to the tag map.
1113 tag
= find_first_zero_bit(bqt
->tag_map
, bqt
->max_depth
);
1114 if (tag
>= bqt
->max_depth
)
1117 } while (test_and_set_bit(tag
, bqt
->tag_map
));
1119 * We rely on test_and_set_bit providing lock memory ordering semantics
1120 * (could use test_and_set_bit_lock when it is merged).
1123 rq
->cmd_flags
|= REQ_QUEUED
;
1125 bqt
->tag_index
[tag
] = rq
;
1126 blkdev_dequeue_request(rq
);
1127 list_add(&rq
->queuelist
, &bqt
->busy_list
);
1132 EXPORT_SYMBOL(blk_queue_start_tag
);
1135 * blk_queue_invalidate_tags - invalidate all pending tags
1136 * @q: the request queue for the device
1139 * Hardware conditions may dictate a need to stop all pending requests.
1140 * In this case, we will safely clear the block side of the tag queue and
1141 * readd all requests to the request queue in the right order.
1144 * queue lock must be held.
1146 void blk_queue_invalidate_tags(struct request_queue
*q
)
1148 struct blk_queue_tag
*bqt
= q
->queue_tags
;
1149 struct list_head
*tmp
, *n
;
1152 list_for_each_safe(tmp
, n
, &bqt
->busy_list
) {
1153 rq
= list_entry_rq(tmp
);
1155 if (rq
->tag
== -1) {
1157 "%s: bad tag found on list\n", __FUNCTION__
);
1158 list_del_init(&rq
->queuelist
);
1159 rq
->cmd_flags
&= ~REQ_QUEUED
;
1161 blk_queue_end_tag(q
, rq
);
1163 rq
->cmd_flags
&= ~REQ_STARTED
;
1164 __elv_add_request(q
, rq
, ELEVATOR_INSERT_BACK
, 0);
1168 EXPORT_SYMBOL(blk_queue_invalidate_tags
);
1170 void blk_dump_rq_flags(struct request
*rq
, char *msg
)
1174 printk("%s: dev %s: type=%x, flags=%x\n", msg
,
1175 rq
->rq_disk
? rq
->rq_disk
->disk_name
: "?", rq
->cmd_type
,
1178 printk("\nsector %llu, nr/cnr %lu/%u\n", (unsigned long long)rq
->sector
,
1180 rq
->current_nr_sectors
);
1181 printk("bio %p, biotail %p, buffer %p, data %p, len %u\n", rq
->bio
, rq
->biotail
, rq
->buffer
, rq
->data
, rq
->data_len
);
1183 if (blk_pc_request(rq
)) {
1185 for (bit
= 0; bit
< sizeof(rq
->cmd
); bit
++)
1186 printk("%02x ", rq
->cmd
[bit
]);
1191 EXPORT_SYMBOL(blk_dump_rq_flags
);
1193 void blk_recount_segments(struct request_queue
*q
, struct bio
*bio
)
1196 struct bio
*nxt
= bio
->bi_next
;
1198 rq
.bio
= rq
.biotail
= bio
;
1199 bio
->bi_next
= NULL
;
1200 blk_recalc_rq_segments(&rq
);
1202 bio
->bi_phys_segments
= rq
.nr_phys_segments
;
1203 bio
->bi_hw_segments
= rq
.nr_hw_segments
;
1204 bio
->bi_flags
|= (1 << BIO_SEG_VALID
);
1206 EXPORT_SYMBOL(blk_recount_segments
);
1208 static void blk_recalc_rq_segments(struct request
*rq
)
1212 unsigned int phys_size
;
1213 unsigned int hw_size
;
1214 struct bio_vec
*bv
, *bvprv
= NULL
;
1218 struct req_iterator iter
;
1219 int high
, highprv
= 1;
1220 struct request_queue
*q
= rq
->q
;
1225 cluster
= q
->queue_flags
& (1 << QUEUE_FLAG_CLUSTER
);
1226 hw_seg_size
= seg_size
= 0;
1227 phys_size
= hw_size
= nr_phys_segs
= nr_hw_segs
= 0;
1228 rq_for_each_segment(bv
, rq
, iter
) {
1230 * the trick here is making sure that a high page is never
1231 * considered part of another segment, since that might
1232 * change with the bounce page.
1234 high
= page_to_pfn(bv
->bv_page
) > q
->bounce_pfn
;
1235 if (high
|| highprv
)
1236 goto new_hw_segment
;
1238 if (seg_size
+ bv
->bv_len
> q
->max_segment_size
)
1240 if (!BIOVEC_PHYS_MERGEABLE(bvprv
, bv
))
1242 if (!BIOVEC_SEG_BOUNDARY(q
, bvprv
, bv
))
1244 if (BIOVEC_VIRT_OVERSIZE(hw_seg_size
+ bv
->bv_len
))
1245 goto new_hw_segment
;
1247 seg_size
+= bv
->bv_len
;
1248 hw_seg_size
+= bv
->bv_len
;
1253 if (BIOVEC_VIRT_MERGEABLE(bvprv
, bv
) &&
1254 !BIOVEC_VIRT_OVERSIZE(hw_seg_size
+ bv
->bv_len
))
1255 hw_seg_size
+= bv
->bv_len
;
1258 if (nr_hw_segs
== 1 &&
1259 hw_seg_size
> rq
->bio
->bi_hw_front_size
)
1260 rq
->bio
->bi_hw_front_size
= hw_seg_size
;
1261 hw_seg_size
= BIOVEC_VIRT_START_SIZE(bv
) + bv
->bv_len
;
1267 seg_size
= bv
->bv_len
;
1271 if (nr_hw_segs
== 1 &&
1272 hw_seg_size
> rq
->bio
->bi_hw_front_size
)
1273 rq
->bio
->bi_hw_front_size
= hw_seg_size
;
1274 if (hw_seg_size
> rq
->biotail
->bi_hw_back_size
)
1275 rq
->biotail
->bi_hw_back_size
= hw_seg_size
;
1276 rq
->nr_phys_segments
= nr_phys_segs
;
1277 rq
->nr_hw_segments
= nr_hw_segs
;
1280 static int blk_phys_contig_segment(struct request_queue
*q
, struct bio
*bio
,
1283 if (!(q
->queue_flags
& (1 << QUEUE_FLAG_CLUSTER
)))
1286 if (!BIOVEC_PHYS_MERGEABLE(__BVEC_END(bio
), __BVEC_START(nxt
)))
1288 if (bio
->bi_size
+ nxt
->bi_size
> q
->max_segment_size
)
1292 * bio and nxt are contigous in memory, check if the queue allows
1293 * these two to be merged into one
1295 if (BIO_SEG_BOUNDARY(q
, bio
, nxt
))
1301 static int blk_hw_contig_segment(struct request_queue
*q
, struct bio
*bio
,
1304 if (unlikely(!bio_flagged(bio
, BIO_SEG_VALID
)))
1305 blk_recount_segments(q
, bio
);
1306 if (unlikely(!bio_flagged(nxt
, BIO_SEG_VALID
)))
1307 blk_recount_segments(q
, nxt
);
1308 if (!BIOVEC_VIRT_MERGEABLE(__BVEC_END(bio
), __BVEC_START(nxt
)) ||
1309 BIOVEC_VIRT_OVERSIZE(bio
->bi_hw_back_size
+ nxt
->bi_hw_front_size
))
1311 if (bio
->bi_hw_back_size
+ nxt
->bi_hw_front_size
> q
->max_segment_size
)
1318 * map a request to scatterlist, return number of sg entries setup. Caller
1319 * must make sure sg can hold rq->nr_phys_segments entries
1321 int blk_rq_map_sg(struct request_queue
*q
, struct request
*rq
,
1322 struct scatterlist
*sglist
)
1324 struct bio_vec
*bvec
, *bvprv
;
1325 struct req_iterator iter
;
1326 struct scatterlist
*sg
;
1330 cluster
= q
->queue_flags
& (1 << QUEUE_FLAG_CLUSTER
);
1333 * for each bio in rq
1337 rq_for_each_segment(bvec
, rq
, iter
) {
1338 int nbytes
= bvec
->bv_len
;
1340 if (bvprv
&& cluster
) {
1341 if (sg
->length
+ nbytes
> q
->max_segment_size
)
1344 if (!BIOVEC_PHYS_MERGEABLE(bvprv
, bvec
))
1346 if (!BIOVEC_SEG_BOUNDARY(q
, bvprv
, bvec
))
1349 sg
->length
+= nbytes
;
1356 * If the driver previously mapped a shorter
1357 * list, we could see a termination bit
1358 * prematurely unless it fully inits the sg
1359 * table on each mapping. We KNOW that there
1360 * must be more entries here or the driver
1361 * would be buggy, so force clear the
1362 * termination bit to avoid doing a full
1363 * sg_init_table() in drivers for each command.
1365 sg
->page_link
&= ~0x02;
1369 sg_set_page(sg
, bvec
->bv_page
, nbytes
, bvec
->bv_offset
);
1373 } /* segments in rq */
1381 EXPORT_SYMBOL(blk_rq_map_sg
);
1384 * the standard queue merge functions, can be overridden with device
1385 * specific ones if so desired
1388 static inline int ll_new_mergeable(struct request_queue
*q
,
1389 struct request
*req
,
1392 int nr_phys_segs
= bio_phys_segments(q
, bio
);
1394 if (req
->nr_phys_segments
+ nr_phys_segs
> q
->max_phys_segments
) {
1395 req
->cmd_flags
|= REQ_NOMERGE
;
1396 if (req
== q
->last_merge
)
1397 q
->last_merge
= NULL
;
1402 * A hw segment is just getting larger, bump just the phys
1405 req
->nr_phys_segments
+= nr_phys_segs
;
1409 static inline int ll_new_hw_segment(struct request_queue
*q
,
1410 struct request
*req
,
1413 int nr_hw_segs
= bio_hw_segments(q
, bio
);
1414 int nr_phys_segs
= bio_phys_segments(q
, bio
);
1416 if (req
->nr_hw_segments
+ nr_hw_segs
> q
->max_hw_segments
1417 || req
->nr_phys_segments
+ nr_phys_segs
> q
->max_phys_segments
) {
1418 req
->cmd_flags
|= REQ_NOMERGE
;
1419 if (req
== q
->last_merge
)
1420 q
->last_merge
= NULL
;
1425 * This will form the start of a new hw segment. Bump both
1428 req
->nr_hw_segments
+= nr_hw_segs
;
1429 req
->nr_phys_segments
+= nr_phys_segs
;
1433 static int ll_back_merge_fn(struct request_queue
*q
, struct request
*req
,
1436 unsigned short max_sectors
;
1439 if (unlikely(blk_pc_request(req
)))
1440 max_sectors
= q
->max_hw_sectors
;
1442 max_sectors
= q
->max_sectors
;
1444 if (req
->nr_sectors
+ bio_sectors(bio
) > max_sectors
) {
1445 req
->cmd_flags
|= REQ_NOMERGE
;
1446 if (req
== q
->last_merge
)
1447 q
->last_merge
= NULL
;
1450 if (unlikely(!bio_flagged(req
->biotail
, BIO_SEG_VALID
)))
1451 blk_recount_segments(q
, req
->biotail
);
1452 if (unlikely(!bio_flagged(bio
, BIO_SEG_VALID
)))
1453 blk_recount_segments(q
, bio
);
1454 len
= req
->biotail
->bi_hw_back_size
+ bio
->bi_hw_front_size
;
1455 if (BIOVEC_VIRT_MERGEABLE(__BVEC_END(req
->biotail
), __BVEC_START(bio
)) &&
1456 !BIOVEC_VIRT_OVERSIZE(len
)) {
1457 int mergeable
= ll_new_mergeable(q
, req
, bio
);
1460 if (req
->nr_hw_segments
== 1)
1461 req
->bio
->bi_hw_front_size
= len
;
1462 if (bio
->bi_hw_segments
== 1)
1463 bio
->bi_hw_back_size
= len
;
1468 return ll_new_hw_segment(q
, req
, bio
);
1471 static int ll_front_merge_fn(struct request_queue
*q
, struct request
*req
,
1474 unsigned short max_sectors
;
1477 if (unlikely(blk_pc_request(req
)))
1478 max_sectors
= q
->max_hw_sectors
;
1480 max_sectors
= q
->max_sectors
;
1483 if (req
->nr_sectors
+ bio_sectors(bio
) > max_sectors
) {
1484 req
->cmd_flags
|= REQ_NOMERGE
;
1485 if (req
== q
->last_merge
)
1486 q
->last_merge
= NULL
;
1489 len
= bio
->bi_hw_back_size
+ req
->bio
->bi_hw_front_size
;
1490 if (unlikely(!bio_flagged(bio
, BIO_SEG_VALID
)))
1491 blk_recount_segments(q
, bio
);
1492 if (unlikely(!bio_flagged(req
->bio
, BIO_SEG_VALID
)))
1493 blk_recount_segments(q
, req
->bio
);
1494 if (BIOVEC_VIRT_MERGEABLE(__BVEC_END(bio
), __BVEC_START(req
->bio
)) &&
1495 !BIOVEC_VIRT_OVERSIZE(len
)) {
1496 int mergeable
= ll_new_mergeable(q
, req
, bio
);
1499 if (bio
->bi_hw_segments
== 1)
1500 bio
->bi_hw_front_size
= len
;
1501 if (req
->nr_hw_segments
== 1)
1502 req
->biotail
->bi_hw_back_size
= len
;
1507 return ll_new_hw_segment(q
, req
, bio
);
1510 static int ll_merge_requests_fn(struct request_queue
*q
, struct request
*req
,
1511 struct request
*next
)
1513 int total_phys_segments
;
1514 int total_hw_segments
;
1517 * First check if the either of the requests are re-queued
1518 * requests. Can't merge them if they are.
1520 if (req
->special
|| next
->special
)
1524 * Will it become too large?
1526 if ((req
->nr_sectors
+ next
->nr_sectors
) > q
->max_sectors
)
1529 total_phys_segments
= req
->nr_phys_segments
+ next
->nr_phys_segments
;
1530 if (blk_phys_contig_segment(q
, req
->biotail
, next
->bio
))
1531 total_phys_segments
--;
1533 if (total_phys_segments
> q
->max_phys_segments
)
1536 total_hw_segments
= req
->nr_hw_segments
+ next
->nr_hw_segments
;
1537 if (blk_hw_contig_segment(q
, req
->biotail
, next
->bio
)) {
1538 int len
= req
->biotail
->bi_hw_back_size
+ next
->bio
->bi_hw_front_size
;
1540 * propagate the combined length to the end of the requests
1542 if (req
->nr_hw_segments
== 1)
1543 req
->bio
->bi_hw_front_size
= len
;
1544 if (next
->nr_hw_segments
== 1)
1545 next
->biotail
->bi_hw_back_size
= len
;
1546 total_hw_segments
--;
1549 if (total_hw_segments
> q
->max_hw_segments
)
1552 /* Merge is OK... */
1553 req
->nr_phys_segments
= total_phys_segments
;
1554 req
->nr_hw_segments
= total_hw_segments
;
1559 * "plug" the device if there are no outstanding requests: this will
1560 * force the transfer to start only after we have put all the requests
1563 * This is called with interrupts off and no requests on the queue and
1564 * with the queue lock held.
1566 void blk_plug_device(struct request_queue
*q
)
1568 WARN_ON(!irqs_disabled());
1571 * don't plug a stopped queue, it must be paired with blk_start_queue()
1572 * which will restart the queueing
1574 if (blk_queue_stopped(q
))
1577 if (!test_and_set_bit(QUEUE_FLAG_PLUGGED
, &q
->queue_flags
)) {
1578 mod_timer(&q
->unplug_timer
, jiffies
+ q
->unplug_delay
);
1579 blk_add_trace_generic(q
, NULL
, 0, BLK_TA_PLUG
);
1583 EXPORT_SYMBOL(blk_plug_device
);
1586 * remove the queue from the plugged list, if present. called with
1587 * queue lock held and interrupts disabled.
1589 int blk_remove_plug(struct request_queue
*q
)
1591 WARN_ON(!irqs_disabled());
1593 if (!test_and_clear_bit(QUEUE_FLAG_PLUGGED
, &q
->queue_flags
))
1596 del_timer(&q
->unplug_timer
);
1600 EXPORT_SYMBOL(blk_remove_plug
);
1603 * remove the plug and let it rip..
1605 void __generic_unplug_device(struct request_queue
*q
)
1607 if (unlikely(blk_queue_stopped(q
)))
1610 if (!blk_remove_plug(q
))
1615 EXPORT_SYMBOL(__generic_unplug_device
);
1618 * generic_unplug_device - fire a request queue
1619 * @q: The &struct request_queue in question
1622 * Linux uses plugging to build bigger requests queues before letting
1623 * the device have at them. If a queue is plugged, the I/O scheduler
1624 * is still adding and merging requests on the queue. Once the queue
1625 * gets unplugged, the request_fn defined for the queue is invoked and
1626 * transfers started.
1628 void generic_unplug_device(struct request_queue
*q
)
1630 spin_lock_irq(q
->queue_lock
);
1631 __generic_unplug_device(q
);
1632 spin_unlock_irq(q
->queue_lock
);
1634 EXPORT_SYMBOL(generic_unplug_device
);
1636 static void blk_backing_dev_unplug(struct backing_dev_info
*bdi
,
1639 struct request_queue
*q
= bdi
->unplug_io_data
;
1642 * devices don't necessarily have an ->unplug_fn defined
1645 blk_add_trace_pdu_int(q
, BLK_TA_UNPLUG_IO
, NULL
,
1646 q
->rq
.count
[READ
] + q
->rq
.count
[WRITE
]);
1652 static void blk_unplug_work(struct work_struct
*work
)
1654 struct request_queue
*q
=
1655 container_of(work
, struct request_queue
, unplug_work
);
1657 blk_add_trace_pdu_int(q
, BLK_TA_UNPLUG_IO
, NULL
,
1658 q
->rq
.count
[READ
] + q
->rq
.count
[WRITE
]);
1663 static void blk_unplug_timeout(unsigned long data
)
1665 struct request_queue
*q
= (struct request_queue
*)data
;
1667 blk_add_trace_pdu_int(q
, BLK_TA_UNPLUG_TIMER
, NULL
,
1668 q
->rq
.count
[READ
] + q
->rq
.count
[WRITE
]);
1670 kblockd_schedule_work(&q
->unplug_work
);
1674 * blk_start_queue - restart a previously stopped queue
1675 * @q: The &struct request_queue in question
1678 * blk_start_queue() will clear the stop flag on the queue, and call
1679 * the request_fn for the queue if it was in a stopped state when
1680 * entered. Also see blk_stop_queue(). Queue lock must be held.
1682 void blk_start_queue(struct request_queue
*q
)
1684 WARN_ON(!irqs_disabled());
1686 clear_bit(QUEUE_FLAG_STOPPED
, &q
->queue_flags
);
1689 * one level of recursion is ok and is much faster than kicking
1690 * the unplug handling
1692 if (!test_and_set_bit(QUEUE_FLAG_REENTER
, &q
->queue_flags
)) {
1694 clear_bit(QUEUE_FLAG_REENTER
, &q
->queue_flags
);
1697 kblockd_schedule_work(&q
->unplug_work
);
1701 EXPORT_SYMBOL(blk_start_queue
);
1704 * blk_stop_queue - stop a queue
1705 * @q: The &struct request_queue in question
1708 * The Linux block layer assumes that a block driver will consume all
1709 * entries on the request queue when the request_fn strategy is called.
1710 * Often this will not happen, because of hardware limitations (queue
1711 * depth settings). If a device driver gets a 'queue full' response,
1712 * or if it simply chooses not to queue more I/O at one point, it can
1713 * call this function to prevent the request_fn from being called until
1714 * the driver has signalled it's ready to go again. This happens by calling
1715 * blk_start_queue() to restart queue operations. Queue lock must be held.
1717 void blk_stop_queue(struct request_queue
*q
)
1720 set_bit(QUEUE_FLAG_STOPPED
, &q
->queue_flags
);
1722 EXPORT_SYMBOL(blk_stop_queue
);
1725 * blk_sync_queue - cancel any pending callbacks on a queue
1729 * The block layer may perform asynchronous callback activity
1730 * on a queue, such as calling the unplug function after a timeout.
1731 * A block device may call blk_sync_queue to ensure that any
1732 * such activity is cancelled, thus allowing it to release resources
1733 * that the callbacks might use. The caller must already have made sure
1734 * that its ->make_request_fn will not re-add plugging prior to calling
1738 void blk_sync_queue(struct request_queue
*q
)
1740 del_timer_sync(&q
->unplug_timer
);
1742 EXPORT_SYMBOL(blk_sync_queue
);
1745 * blk_run_queue - run a single device queue
1746 * @q: The queue to run
1748 void blk_run_queue(struct request_queue
*q
)
1750 unsigned long flags
;
1752 spin_lock_irqsave(q
->queue_lock
, flags
);
1756 * Only recurse once to avoid overrunning the stack, let the unplug
1757 * handling reinvoke the handler shortly if we already got there.
1759 if (!elv_queue_empty(q
)) {
1760 if (!test_and_set_bit(QUEUE_FLAG_REENTER
, &q
->queue_flags
)) {
1762 clear_bit(QUEUE_FLAG_REENTER
, &q
->queue_flags
);
1765 kblockd_schedule_work(&q
->unplug_work
);
1769 spin_unlock_irqrestore(q
->queue_lock
, flags
);
1771 EXPORT_SYMBOL(blk_run_queue
);
1774 * blk_cleanup_queue: - release a &struct request_queue when it is no longer needed
1775 * @kobj: the kobj belonging of the request queue to be released
1778 * blk_cleanup_queue is the pair to blk_init_queue() or
1779 * blk_queue_make_request(). It should be called when a request queue is
1780 * being released; typically when a block device is being de-registered.
1781 * Currently, its primary task it to free all the &struct request
1782 * structures that were allocated to the queue and the queue itself.
1785 * Hopefully the low level driver will have finished any
1786 * outstanding requests first...
1788 static void blk_release_queue(struct kobject
*kobj
)
1790 struct request_queue
*q
=
1791 container_of(kobj
, struct request_queue
, kobj
);
1792 struct request_list
*rl
= &q
->rq
;
1797 mempool_destroy(rl
->rq_pool
);
1800 __blk_queue_free_tags(q
);
1802 blk_trace_shutdown(q
);
1804 bdi_destroy(&q
->backing_dev_info
);
1805 kmem_cache_free(requestq_cachep
, q
);
1808 void blk_put_queue(struct request_queue
*q
)
1810 kobject_put(&q
->kobj
);
1812 EXPORT_SYMBOL(blk_put_queue
);
1814 void blk_cleanup_queue(struct request_queue
* q
)
1816 mutex_lock(&q
->sysfs_lock
);
1817 set_bit(QUEUE_FLAG_DEAD
, &q
->queue_flags
);
1818 mutex_unlock(&q
->sysfs_lock
);
1821 elevator_exit(q
->elevator
);
1826 EXPORT_SYMBOL(blk_cleanup_queue
);
1828 static int blk_init_free_list(struct request_queue
*q
)
1830 struct request_list
*rl
= &q
->rq
;
1832 rl
->count
[READ
] = rl
->count
[WRITE
] = 0;
1833 rl
->starved
[READ
] = rl
->starved
[WRITE
] = 0;
1835 init_waitqueue_head(&rl
->wait
[READ
]);
1836 init_waitqueue_head(&rl
->wait
[WRITE
]);
1838 rl
->rq_pool
= mempool_create_node(BLKDEV_MIN_RQ
, mempool_alloc_slab
,
1839 mempool_free_slab
, request_cachep
, q
->node
);
1847 struct request_queue
*blk_alloc_queue(gfp_t gfp_mask
)
1849 return blk_alloc_queue_node(gfp_mask
, -1);
1851 EXPORT_SYMBOL(blk_alloc_queue
);
1853 static struct kobj_type queue_ktype
;
1855 struct request_queue
*blk_alloc_queue_node(gfp_t gfp_mask
, int node_id
)
1857 struct request_queue
*q
;
1860 q
= kmem_cache_alloc_node(requestq_cachep
,
1861 gfp_mask
| __GFP_ZERO
, node_id
);
1865 q
->backing_dev_info
.unplug_io_fn
= blk_backing_dev_unplug
;
1866 q
->backing_dev_info
.unplug_io_data
= q
;
1867 err
= bdi_init(&q
->backing_dev_info
);
1869 kmem_cache_free(requestq_cachep
, q
);
1873 init_timer(&q
->unplug_timer
);
1875 kobject_set_name(&q
->kobj
, "%s", "queue");
1876 q
->kobj
.ktype
= &queue_ktype
;
1877 kobject_init(&q
->kobj
);
1879 mutex_init(&q
->sysfs_lock
);
1883 EXPORT_SYMBOL(blk_alloc_queue_node
);
1886 * blk_init_queue - prepare a request queue for use with a block device
1887 * @rfn: The function to be called to process requests that have been
1888 * placed on the queue.
1889 * @lock: Request queue spin lock
1892 * If a block device wishes to use the standard request handling procedures,
1893 * which sorts requests and coalesces adjacent requests, then it must
1894 * call blk_init_queue(). The function @rfn will be called when there
1895 * are requests on the queue that need to be processed. If the device
1896 * supports plugging, then @rfn may not be called immediately when requests
1897 * are available on the queue, but may be called at some time later instead.
1898 * Plugged queues are generally unplugged when a buffer belonging to one
1899 * of the requests on the queue is needed, or due to memory pressure.
1901 * @rfn is not required, or even expected, to remove all requests off the
1902 * queue, but only as many as it can handle at a time. If it does leave
1903 * requests on the queue, it is responsible for arranging that the requests
1904 * get dealt with eventually.
1906 * The queue spin lock must be held while manipulating the requests on the
1907 * request queue; this lock will be taken also from interrupt context, so irq
1908 * disabling is needed for it.
1910 * Function returns a pointer to the initialized request queue, or NULL if
1911 * it didn't succeed.
1914 * blk_init_queue() must be paired with a blk_cleanup_queue() call
1915 * when the block device is deactivated (such as at module unload).
1918 struct request_queue
*blk_init_queue(request_fn_proc
*rfn
, spinlock_t
*lock
)
1920 return blk_init_queue_node(rfn
, lock
, -1);
1922 EXPORT_SYMBOL(blk_init_queue
);
1924 struct request_queue
*
1925 blk_init_queue_node(request_fn_proc
*rfn
, spinlock_t
*lock
, int node_id
)
1927 struct request_queue
*q
= blk_alloc_queue_node(GFP_KERNEL
, node_id
);
1933 if (blk_init_free_list(q
)) {
1934 kmem_cache_free(requestq_cachep
, q
);
1939 * if caller didn't supply a lock, they get per-queue locking with
1943 spin_lock_init(&q
->__queue_lock
);
1944 lock
= &q
->__queue_lock
;
1947 q
->request_fn
= rfn
;
1948 q
->prep_rq_fn
= NULL
;
1949 q
->unplug_fn
= generic_unplug_device
;
1950 q
->queue_flags
= (1 << QUEUE_FLAG_CLUSTER
);
1951 q
->queue_lock
= lock
;
1953 blk_queue_segment_boundary(q
, 0xffffffff);
1955 blk_queue_make_request(q
, __make_request
);
1956 blk_queue_max_segment_size(q
, MAX_SEGMENT_SIZE
);
1958 blk_queue_max_hw_segments(q
, MAX_HW_SEGMENTS
);
1959 blk_queue_max_phys_segments(q
, MAX_PHYS_SEGMENTS
);
1961 q
->sg_reserved_size
= INT_MAX
;
1966 if (!elevator_init(q
, NULL
)) {
1967 blk_queue_congestion_threshold(q
);
1974 EXPORT_SYMBOL(blk_init_queue_node
);
1976 int blk_get_queue(struct request_queue
*q
)
1978 if (likely(!test_bit(QUEUE_FLAG_DEAD
, &q
->queue_flags
))) {
1979 kobject_get(&q
->kobj
);
1986 EXPORT_SYMBOL(blk_get_queue
);
1988 static inline void blk_free_request(struct request_queue
*q
, struct request
*rq
)
1990 if (rq
->cmd_flags
& REQ_ELVPRIV
)
1991 elv_put_request(q
, rq
);
1992 mempool_free(rq
, q
->rq
.rq_pool
);
1995 static struct request
*
1996 blk_alloc_request(struct request_queue
*q
, int rw
, int priv
, gfp_t gfp_mask
)
1998 struct request
*rq
= mempool_alloc(q
->rq
.rq_pool
, gfp_mask
);
2004 * first three bits are identical in rq->cmd_flags and bio->bi_rw,
2005 * see bio.h and blkdev.h
2007 rq
->cmd_flags
= rw
| REQ_ALLOCED
;
2010 if (unlikely(elv_set_request(q
, rq
, gfp_mask
))) {
2011 mempool_free(rq
, q
->rq
.rq_pool
);
2014 rq
->cmd_flags
|= REQ_ELVPRIV
;
2021 * ioc_batching returns true if the ioc is a valid batching request and
2022 * should be given priority access to a request.
2024 static inline int ioc_batching(struct request_queue
*q
, struct io_context
*ioc
)
2030 * Make sure the process is able to allocate at least 1 request
2031 * even if the batch times out, otherwise we could theoretically
2034 return ioc
->nr_batch_requests
== q
->nr_batching
||
2035 (ioc
->nr_batch_requests
> 0
2036 && time_before(jiffies
, ioc
->last_waited
+ BLK_BATCH_TIME
));
2040 * ioc_set_batching sets ioc to be a new "batcher" if it is not one. This
2041 * will cause the process to be a "batcher" on all queues in the system. This
2042 * is the behaviour we want though - once it gets a wakeup it should be given
2045 static void ioc_set_batching(struct request_queue
*q
, struct io_context
*ioc
)
2047 if (!ioc
|| ioc_batching(q
, ioc
))
2050 ioc
->nr_batch_requests
= q
->nr_batching
;
2051 ioc
->last_waited
= jiffies
;
2054 static void __freed_request(struct request_queue
*q
, int rw
)
2056 struct request_list
*rl
= &q
->rq
;
2058 if (rl
->count
[rw
] < queue_congestion_off_threshold(q
))
2059 blk_clear_queue_congested(q
, rw
);
2061 if (rl
->count
[rw
] + 1 <= q
->nr_requests
) {
2062 if (waitqueue_active(&rl
->wait
[rw
]))
2063 wake_up(&rl
->wait
[rw
]);
2065 blk_clear_queue_full(q
, rw
);
2070 * A request has just been released. Account for it, update the full and
2071 * congestion status, wake up any waiters. Called under q->queue_lock.
2073 static void freed_request(struct request_queue
*q
, int rw
, int priv
)
2075 struct request_list
*rl
= &q
->rq
;
2081 __freed_request(q
, rw
);
2083 if (unlikely(rl
->starved
[rw
^ 1]))
2084 __freed_request(q
, rw
^ 1);
2087 #define blkdev_free_rq(list) list_entry((list)->next, struct request, queuelist)
2089 * Get a free request, queue_lock must be held.
2090 * Returns NULL on failure, with queue_lock held.
2091 * Returns !NULL on success, with queue_lock *not held*.
2093 static struct request
*get_request(struct request_queue
*q
, int rw_flags
,
2094 struct bio
*bio
, gfp_t gfp_mask
)
2096 struct request
*rq
= NULL
;
2097 struct request_list
*rl
= &q
->rq
;
2098 struct io_context
*ioc
= NULL
;
2099 const int rw
= rw_flags
& 0x01;
2100 int may_queue
, priv
;
2102 may_queue
= elv_may_queue(q
, rw_flags
);
2103 if (may_queue
== ELV_MQUEUE_NO
)
2106 if (rl
->count
[rw
]+1 >= queue_congestion_on_threshold(q
)) {
2107 if (rl
->count
[rw
]+1 >= q
->nr_requests
) {
2108 ioc
= current_io_context(GFP_ATOMIC
, q
->node
);
2110 * The queue will fill after this allocation, so set
2111 * it as full, and mark this process as "batching".
2112 * This process will be allowed to complete a batch of
2113 * requests, others will be blocked.
2115 if (!blk_queue_full(q
, rw
)) {
2116 ioc_set_batching(q
, ioc
);
2117 blk_set_queue_full(q
, rw
);
2119 if (may_queue
!= ELV_MQUEUE_MUST
2120 && !ioc_batching(q
, ioc
)) {
2122 * The queue is full and the allocating
2123 * process is not a "batcher", and not
2124 * exempted by the IO scheduler
2130 blk_set_queue_congested(q
, rw
);
2134 * Only allow batching queuers to allocate up to 50% over the defined
2135 * limit of requests, otherwise we could have thousands of requests
2136 * allocated with any setting of ->nr_requests
2138 if (rl
->count
[rw
] >= (3 * q
->nr_requests
/ 2))
2142 rl
->starved
[rw
] = 0;
2144 priv
= !test_bit(QUEUE_FLAG_ELVSWITCH
, &q
->queue_flags
);
2148 spin_unlock_irq(q
->queue_lock
);
2150 rq
= blk_alloc_request(q
, rw_flags
, priv
, gfp_mask
);
2151 if (unlikely(!rq
)) {
2153 * Allocation failed presumably due to memory. Undo anything
2154 * we might have messed up.
2156 * Allocating task should really be put onto the front of the
2157 * wait queue, but this is pretty rare.
2159 spin_lock_irq(q
->queue_lock
);
2160 freed_request(q
, rw
, priv
);
2163 * in the very unlikely event that allocation failed and no
2164 * requests for this direction was pending, mark us starved
2165 * so that freeing of a request in the other direction will
2166 * notice us. another possible fix would be to split the
2167 * rq mempool into READ and WRITE
2170 if (unlikely(rl
->count
[rw
] == 0))
2171 rl
->starved
[rw
] = 1;
2177 * ioc may be NULL here, and ioc_batching will be false. That's
2178 * OK, if the queue is under the request limit then requests need
2179 * not count toward the nr_batch_requests limit. There will always
2180 * be some limit enforced by BLK_BATCH_TIME.
2182 if (ioc_batching(q
, ioc
))
2183 ioc
->nr_batch_requests
--;
2187 blk_add_trace_generic(q
, bio
, rw
, BLK_TA_GETRQ
);
2193 * No available requests for this queue, unplug the device and wait for some
2194 * requests to become available.
2196 * Called with q->queue_lock held, and returns with it unlocked.
2198 static struct request
*get_request_wait(struct request_queue
*q
, int rw_flags
,
2201 const int rw
= rw_flags
& 0x01;
2204 rq
= get_request(q
, rw_flags
, bio
, GFP_NOIO
);
2207 struct request_list
*rl
= &q
->rq
;
2209 prepare_to_wait_exclusive(&rl
->wait
[rw
], &wait
,
2210 TASK_UNINTERRUPTIBLE
);
2212 rq
= get_request(q
, rw_flags
, bio
, GFP_NOIO
);
2215 struct io_context
*ioc
;
2217 blk_add_trace_generic(q
, bio
, rw
, BLK_TA_SLEEPRQ
);
2219 __generic_unplug_device(q
);
2220 spin_unlock_irq(q
->queue_lock
);
2224 * After sleeping, we become a "batching" process and
2225 * will be able to allocate at least one request, and
2226 * up to a big batch of them for a small period time.
2227 * See ioc_batching, ioc_set_batching
2229 ioc
= current_io_context(GFP_NOIO
, q
->node
);
2230 ioc_set_batching(q
, ioc
);
2232 spin_lock_irq(q
->queue_lock
);
2234 finish_wait(&rl
->wait
[rw
], &wait
);
2240 struct request
*blk_get_request(struct request_queue
*q
, int rw
, gfp_t gfp_mask
)
2244 BUG_ON(rw
!= READ
&& rw
!= WRITE
);
2246 spin_lock_irq(q
->queue_lock
);
2247 if (gfp_mask
& __GFP_WAIT
) {
2248 rq
= get_request_wait(q
, rw
, NULL
);
2250 rq
= get_request(q
, rw
, NULL
, gfp_mask
);
2252 spin_unlock_irq(q
->queue_lock
);
2254 /* q->queue_lock is unlocked at this point */
2258 EXPORT_SYMBOL(blk_get_request
);
2261 * blk_start_queueing - initiate dispatch of requests to device
2262 * @q: request queue to kick into gear
2264 * This is basically a helper to remove the need to know whether a queue
2265 * is plugged or not if someone just wants to initiate dispatch of requests
2268 * The queue lock must be held with interrupts disabled.
2270 void blk_start_queueing(struct request_queue
*q
)
2272 if (!blk_queue_plugged(q
))
2275 __generic_unplug_device(q
);
2277 EXPORT_SYMBOL(blk_start_queueing
);
2280 * blk_requeue_request - put a request back on queue
2281 * @q: request queue where request should be inserted
2282 * @rq: request to be inserted
2285 * Drivers often keep queueing requests until the hardware cannot accept
2286 * more, when that condition happens we need to put the request back
2287 * on the queue. Must be called with queue lock held.
2289 void blk_requeue_request(struct request_queue
*q
, struct request
*rq
)
2291 blk_add_trace_rq(q
, rq
, BLK_TA_REQUEUE
);
2293 if (blk_rq_tagged(rq
))
2294 blk_queue_end_tag(q
, rq
);
2296 elv_requeue_request(q
, rq
);
2299 EXPORT_SYMBOL(blk_requeue_request
);
2302 * blk_insert_request - insert a special request in to a request queue
2303 * @q: request queue where request should be inserted
2304 * @rq: request to be inserted
2305 * @at_head: insert request at head or tail of queue
2306 * @data: private data
2309 * Many block devices need to execute commands asynchronously, so they don't
2310 * block the whole kernel from preemption during request execution. This is
2311 * accomplished normally by inserting aritficial requests tagged as
2312 * REQ_SPECIAL in to the corresponding request queue, and letting them be
2313 * scheduled for actual execution by the request queue.
2315 * We have the option of inserting the head or the tail of the queue.
2316 * Typically we use the tail for new ioctls and so forth. We use the head
2317 * of the queue for things like a QUEUE_FULL message from a device, or a
2318 * host that is unable to accept a particular command.
2320 void blk_insert_request(struct request_queue
*q
, struct request
*rq
,
2321 int at_head
, void *data
)
2323 int where
= at_head
? ELEVATOR_INSERT_FRONT
: ELEVATOR_INSERT_BACK
;
2324 unsigned long flags
;
2327 * tell I/O scheduler that this isn't a regular read/write (ie it
2328 * must not attempt merges on this) and that it acts as a soft
2331 rq
->cmd_type
= REQ_TYPE_SPECIAL
;
2332 rq
->cmd_flags
|= REQ_SOFTBARRIER
;
2336 spin_lock_irqsave(q
->queue_lock
, flags
);
2339 * If command is tagged, release the tag
2341 if (blk_rq_tagged(rq
))
2342 blk_queue_end_tag(q
, rq
);
2344 drive_stat_acct(rq
, rq
->nr_sectors
, 1);
2345 __elv_add_request(q
, rq
, where
, 0);
2346 blk_start_queueing(q
);
2347 spin_unlock_irqrestore(q
->queue_lock
, flags
);
2350 EXPORT_SYMBOL(blk_insert_request
);
2352 static int __blk_rq_unmap_user(struct bio
*bio
)
2357 if (bio_flagged(bio
, BIO_USER_MAPPED
))
2358 bio_unmap_user(bio
);
2360 ret
= bio_uncopy_user(bio
);
2366 int blk_rq_append_bio(struct request_queue
*q
, struct request
*rq
,
2370 blk_rq_bio_prep(q
, rq
, bio
);
2371 else if (!ll_back_merge_fn(q
, rq
, bio
))
2374 rq
->biotail
->bi_next
= bio
;
2377 rq
->data_len
+= bio
->bi_size
;
2381 EXPORT_SYMBOL(blk_rq_append_bio
);
2383 static int __blk_rq_map_user(struct request_queue
*q
, struct request
*rq
,
2384 void __user
*ubuf
, unsigned int len
)
2386 unsigned long uaddr
;
2387 struct bio
*bio
, *orig_bio
;
2390 reading
= rq_data_dir(rq
) == READ
;
2393 * if alignment requirement is satisfied, map in user pages for
2394 * direct dma. else, set up kernel bounce buffers
2396 uaddr
= (unsigned long) ubuf
;
2397 if (!(uaddr
& queue_dma_alignment(q
)) && !(len
& queue_dma_alignment(q
)))
2398 bio
= bio_map_user(q
, NULL
, uaddr
, len
, reading
);
2400 bio
= bio_copy_user(q
, uaddr
, len
, reading
);
2403 return PTR_ERR(bio
);
2406 blk_queue_bounce(q
, &bio
);
2409 * We link the bounce buffer in and could have to traverse it
2410 * later so we have to get a ref to prevent it from being freed
2414 ret
= blk_rq_append_bio(q
, rq
, bio
);
2416 return bio
->bi_size
;
2418 /* if it was boucned we must call the end io function */
2420 __blk_rq_unmap_user(orig_bio
);
2426 * blk_rq_map_user - map user data to a request, for REQ_BLOCK_PC usage
2427 * @q: request queue where request should be inserted
2428 * @rq: request structure to fill
2429 * @ubuf: the user buffer
2430 * @len: length of user data
2433 * Data will be mapped directly for zero copy io, if possible. Otherwise
2434 * a kernel bounce buffer is used.
2436 * A matching blk_rq_unmap_user() must be issued at the end of io, while
2437 * still in process context.
2439 * Note: The mapped bio may need to be bounced through blk_queue_bounce()
2440 * before being submitted to the device, as pages mapped may be out of
2441 * reach. It's the callers responsibility to make sure this happens. The
2442 * original bio must be passed back in to blk_rq_unmap_user() for proper
2445 int blk_rq_map_user(struct request_queue
*q
, struct request
*rq
,
2446 void __user
*ubuf
, unsigned long len
)
2448 unsigned long bytes_read
= 0;
2449 struct bio
*bio
= NULL
;
2452 if (len
> (q
->max_hw_sectors
<< 9))
2457 while (bytes_read
!= len
) {
2458 unsigned long map_len
, end
, start
;
2460 map_len
= min_t(unsigned long, len
- bytes_read
, BIO_MAX_SIZE
);
2461 end
= ((unsigned long)ubuf
+ map_len
+ PAGE_SIZE
- 1)
2463 start
= (unsigned long)ubuf
>> PAGE_SHIFT
;
2466 * A bad offset could cause us to require BIO_MAX_PAGES + 1
2467 * pages. If this happens we just lower the requested
2468 * mapping len by a page so that we can fit
2470 if (end
- start
> BIO_MAX_PAGES
)
2471 map_len
-= PAGE_SIZE
;
2473 ret
= __blk_rq_map_user(q
, rq
, ubuf
, map_len
);
2482 rq
->buffer
= rq
->data
= NULL
;
2485 blk_rq_unmap_user(bio
);
2489 EXPORT_SYMBOL(blk_rq_map_user
);
2492 * blk_rq_map_user_iov - map user data to a request, for REQ_BLOCK_PC usage
2493 * @q: request queue where request should be inserted
2494 * @rq: request to map data to
2495 * @iov: pointer to the iovec
2496 * @iov_count: number of elements in the iovec
2497 * @len: I/O byte count
2500 * Data will be mapped directly for zero copy io, if possible. Otherwise
2501 * a kernel bounce buffer is used.
2503 * A matching blk_rq_unmap_user() must be issued at the end of io, while
2504 * still in process context.
2506 * Note: The mapped bio may need to be bounced through blk_queue_bounce()
2507 * before being submitted to the device, as pages mapped may be out of
2508 * reach. It's the callers responsibility to make sure this happens. The
2509 * original bio must be passed back in to blk_rq_unmap_user() for proper
2512 int blk_rq_map_user_iov(struct request_queue
*q
, struct request
*rq
,
2513 struct sg_iovec
*iov
, int iov_count
, unsigned int len
)
2517 if (!iov
|| iov_count
<= 0)
2520 /* we don't allow misaligned data like bio_map_user() does. If the
2521 * user is using sg, they're expected to know the alignment constraints
2522 * and respect them accordingly */
2523 bio
= bio_map_user_iov(q
, NULL
, iov
, iov_count
, rq_data_dir(rq
)== READ
);
2525 return PTR_ERR(bio
);
2527 if (bio
->bi_size
!= len
) {
2529 bio_unmap_user(bio
);
2534 blk_rq_bio_prep(q
, rq
, bio
);
2535 rq
->buffer
= rq
->data
= NULL
;
2539 EXPORT_SYMBOL(blk_rq_map_user_iov
);
2542 * blk_rq_unmap_user - unmap a request with user data
2543 * @bio: start of bio list
2546 * Unmap a rq previously mapped by blk_rq_map_user(). The caller must
2547 * supply the original rq->bio from the blk_rq_map_user() return, since
2548 * the io completion may have changed rq->bio.
2550 int blk_rq_unmap_user(struct bio
*bio
)
2552 struct bio
*mapped_bio
;
2557 if (unlikely(bio_flagged(bio
, BIO_BOUNCED
)))
2558 mapped_bio
= bio
->bi_private
;
2560 ret2
= __blk_rq_unmap_user(mapped_bio
);
2566 bio_put(mapped_bio
);
2572 EXPORT_SYMBOL(blk_rq_unmap_user
);
2575 * blk_rq_map_kern - map kernel data to a request, for REQ_BLOCK_PC usage
2576 * @q: request queue where request should be inserted
2577 * @rq: request to fill
2578 * @kbuf: the kernel buffer
2579 * @len: length of user data
2580 * @gfp_mask: memory allocation flags
2582 int blk_rq_map_kern(struct request_queue
*q
, struct request
*rq
, void *kbuf
,
2583 unsigned int len
, gfp_t gfp_mask
)
2587 if (len
> (q
->max_hw_sectors
<< 9))
2592 bio
= bio_map_kern(q
, kbuf
, len
, gfp_mask
);
2594 return PTR_ERR(bio
);
2596 if (rq_data_dir(rq
) == WRITE
)
2597 bio
->bi_rw
|= (1 << BIO_RW
);
2599 blk_rq_bio_prep(q
, rq
, bio
);
2600 blk_queue_bounce(q
, &rq
->bio
);
2601 rq
->buffer
= rq
->data
= NULL
;
2605 EXPORT_SYMBOL(blk_rq_map_kern
);
2608 * blk_execute_rq_nowait - insert a request into queue for execution
2609 * @q: queue to insert the request in
2610 * @bd_disk: matching gendisk
2611 * @rq: request to insert
2612 * @at_head: insert request at head or tail of queue
2613 * @done: I/O completion handler
2616 * Insert a fully prepared request at the back of the io scheduler queue
2617 * for execution. Don't wait for completion.
2619 void blk_execute_rq_nowait(struct request_queue
*q
, struct gendisk
*bd_disk
,
2620 struct request
*rq
, int at_head
,
2623 int where
= at_head
? ELEVATOR_INSERT_FRONT
: ELEVATOR_INSERT_BACK
;
2625 rq
->rq_disk
= bd_disk
;
2626 rq
->cmd_flags
|= REQ_NOMERGE
;
2628 WARN_ON(irqs_disabled());
2629 spin_lock_irq(q
->queue_lock
);
2630 __elv_add_request(q
, rq
, where
, 1);
2631 __generic_unplug_device(q
);
2632 spin_unlock_irq(q
->queue_lock
);
2634 EXPORT_SYMBOL_GPL(blk_execute_rq_nowait
);
2637 * blk_execute_rq - insert a request into queue for execution
2638 * @q: queue to insert the request in
2639 * @bd_disk: matching gendisk
2640 * @rq: request to insert
2641 * @at_head: insert request at head or tail of queue
2644 * Insert a fully prepared request at the back of the io scheduler queue
2645 * for execution and wait for completion.
2647 int blk_execute_rq(struct request_queue
*q
, struct gendisk
*bd_disk
,
2648 struct request
*rq
, int at_head
)
2650 DECLARE_COMPLETION_ONSTACK(wait
);
2651 char sense
[SCSI_SENSE_BUFFERSIZE
];
2655 * we need an extra reference to the request, so we can look at
2656 * it after io completion
2661 memset(sense
, 0, sizeof(sense
));
2666 rq
->end_io_data
= &wait
;
2667 blk_execute_rq_nowait(q
, bd_disk
, rq
, at_head
, blk_end_sync_rq
);
2668 wait_for_completion(&wait
);
2676 EXPORT_SYMBOL(blk_execute_rq
);
2678 static void bio_end_empty_barrier(struct bio
*bio
, int err
)
2681 clear_bit(BIO_UPTODATE
, &bio
->bi_flags
);
2683 complete(bio
->bi_private
);
2687 * blkdev_issue_flush - queue a flush
2688 * @bdev: blockdev to issue flush for
2689 * @error_sector: error sector
2692 * Issue a flush for the block device in question. Caller can supply
2693 * room for storing the error offset in case of a flush error, if they
2694 * wish to. Caller must run wait_for_completion() on its own.
2696 int blkdev_issue_flush(struct block_device
*bdev
, sector_t
*error_sector
)
2698 DECLARE_COMPLETION_ONSTACK(wait
);
2699 struct request_queue
*q
;
2703 if (bdev
->bd_disk
== NULL
)
2706 q
= bdev_get_queue(bdev
);
2710 bio
= bio_alloc(GFP_KERNEL
, 0);
2714 bio
->bi_end_io
= bio_end_empty_barrier
;
2715 bio
->bi_private
= &wait
;
2716 bio
->bi_bdev
= bdev
;
2717 submit_bio(1 << BIO_RW_BARRIER
, bio
);
2719 wait_for_completion(&wait
);
2722 * The driver must store the error location in ->bi_sector, if
2723 * it supports it. For non-stacked drivers, this should be copied
2727 *error_sector
= bio
->bi_sector
;
2730 if (!bio_flagged(bio
, BIO_UPTODATE
))
2737 EXPORT_SYMBOL(blkdev_issue_flush
);
2739 static void drive_stat_acct(struct request
*rq
, int nr_sectors
, int new_io
)
2741 int rw
= rq_data_dir(rq
);
2743 if (!blk_fs_request(rq
) || !rq
->rq_disk
)
2747 __disk_stat_inc(rq
->rq_disk
, merges
[rw
]);
2749 disk_round_stats(rq
->rq_disk
);
2750 rq
->rq_disk
->in_flight
++;
2755 * add-request adds a request to the linked list.
2756 * queue lock is held and interrupts disabled, as we muck with the
2757 * request queue list.
2759 static inline void add_request(struct request_queue
* q
, struct request
* req
)
2761 drive_stat_acct(req
, req
->nr_sectors
, 1);
2764 * elevator indicated where it wants this request to be
2765 * inserted at elevator_merge time
2767 __elv_add_request(q
, req
, ELEVATOR_INSERT_SORT
, 0);
2771 * disk_round_stats() - Round off the performance stats on a struct
2774 * The average IO queue length and utilisation statistics are maintained
2775 * by observing the current state of the queue length and the amount of
2776 * time it has been in this state for.
2778 * Normally, that accounting is done on IO completion, but that can result
2779 * in more than a second's worth of IO being accounted for within any one
2780 * second, leading to >100% utilisation. To deal with that, we call this
2781 * function to do a round-off before returning the results when reading
2782 * /proc/diskstats. This accounts immediately for all queue usage up to
2783 * the current jiffies and restarts the counters again.
2785 void disk_round_stats(struct gendisk
*disk
)
2787 unsigned long now
= jiffies
;
2789 if (now
== disk
->stamp
)
2792 if (disk
->in_flight
) {
2793 __disk_stat_add(disk
, time_in_queue
,
2794 disk
->in_flight
* (now
- disk
->stamp
));
2795 __disk_stat_add(disk
, io_ticks
, (now
- disk
->stamp
));
2800 EXPORT_SYMBOL_GPL(disk_round_stats
);
2803 * queue lock must be held
2805 void __blk_put_request(struct request_queue
*q
, struct request
*req
)
2809 if (unlikely(--req
->ref_count
))
2812 elv_completed_request(q
, req
);
2815 * Request may not have originated from ll_rw_blk. if not,
2816 * it didn't come out of our reserved rq pools
2818 if (req
->cmd_flags
& REQ_ALLOCED
) {
2819 int rw
= rq_data_dir(req
);
2820 int priv
= req
->cmd_flags
& REQ_ELVPRIV
;
2822 BUG_ON(!list_empty(&req
->queuelist
));
2823 BUG_ON(!hlist_unhashed(&req
->hash
));
2825 blk_free_request(q
, req
);
2826 freed_request(q
, rw
, priv
);
2830 EXPORT_SYMBOL_GPL(__blk_put_request
);
2832 void blk_put_request(struct request
*req
)
2834 unsigned long flags
;
2835 struct request_queue
*q
= req
->q
;
2838 * Gee, IDE calls in w/ NULL q. Fix IDE and remove the
2839 * following if (q) test.
2842 spin_lock_irqsave(q
->queue_lock
, flags
);
2843 __blk_put_request(q
, req
);
2844 spin_unlock_irqrestore(q
->queue_lock
, flags
);
2848 EXPORT_SYMBOL(blk_put_request
);
2851 * blk_end_sync_rq - executes a completion event on a request
2852 * @rq: request to complete
2853 * @error: end io status of the request
2855 void blk_end_sync_rq(struct request
*rq
, int error
)
2857 struct completion
*waiting
= rq
->end_io_data
;
2859 rq
->end_io_data
= NULL
;
2860 __blk_put_request(rq
->q
, rq
);
2863 * complete last, if this is a stack request the process (and thus
2864 * the rq pointer) could be invalid right after this complete()
2868 EXPORT_SYMBOL(blk_end_sync_rq
);
2871 * Has to be called with the request spinlock acquired
2873 static int attempt_merge(struct request_queue
*q
, struct request
*req
,
2874 struct request
*next
)
2876 if (!rq_mergeable(req
) || !rq_mergeable(next
))
2882 if (req
->sector
+ req
->nr_sectors
!= next
->sector
)
2885 if (rq_data_dir(req
) != rq_data_dir(next
)
2886 || req
->rq_disk
!= next
->rq_disk
2891 * If we are allowed to merge, then append bio list
2892 * from next to rq and release next. merge_requests_fn
2893 * will have updated segment counts, update sector
2896 if (!ll_merge_requests_fn(q
, req
, next
))
2900 * At this point we have either done a back merge
2901 * or front merge. We need the smaller start_time of
2902 * the merged requests to be the current request
2903 * for accounting purposes.
2905 if (time_after(req
->start_time
, next
->start_time
))
2906 req
->start_time
= next
->start_time
;
2908 req
->biotail
->bi_next
= next
->bio
;
2909 req
->biotail
= next
->biotail
;
2911 req
->nr_sectors
= req
->hard_nr_sectors
+= next
->hard_nr_sectors
;
2913 elv_merge_requests(q
, req
, next
);
2916 disk_round_stats(req
->rq_disk
);
2917 req
->rq_disk
->in_flight
--;
2920 req
->ioprio
= ioprio_best(req
->ioprio
, next
->ioprio
);
2922 __blk_put_request(q
, next
);
2926 static inline int attempt_back_merge(struct request_queue
*q
,
2929 struct request
*next
= elv_latter_request(q
, rq
);
2932 return attempt_merge(q
, rq
, next
);
2937 static inline int attempt_front_merge(struct request_queue
*q
,
2940 struct request
*prev
= elv_former_request(q
, rq
);
2943 return attempt_merge(q
, prev
, rq
);
2948 static void init_request_from_bio(struct request
*req
, struct bio
*bio
)
2950 req
->cmd_type
= REQ_TYPE_FS
;
2953 * inherit FAILFAST from bio (for read-ahead, and explicit FAILFAST)
2955 if (bio_rw_ahead(bio
) || bio_failfast(bio
))
2956 req
->cmd_flags
|= REQ_FAILFAST
;
2959 * REQ_BARRIER implies no merging, but lets make it explicit
2961 if (unlikely(bio_barrier(bio
)))
2962 req
->cmd_flags
|= (REQ_HARDBARRIER
| REQ_NOMERGE
);
2965 req
->cmd_flags
|= REQ_RW_SYNC
;
2966 if (bio_rw_meta(bio
))
2967 req
->cmd_flags
|= REQ_RW_META
;
2970 req
->hard_sector
= req
->sector
= bio
->bi_sector
;
2971 req
->ioprio
= bio_prio(bio
);
2972 req
->start_time
= jiffies
;
2973 blk_rq_bio_prep(req
->q
, req
, bio
);
2976 static int __make_request(struct request_queue
*q
, struct bio
*bio
)
2978 struct request
*req
;
2979 int el_ret
, nr_sectors
, barrier
, err
;
2980 const unsigned short prio
= bio_prio(bio
);
2981 const int sync
= bio_sync(bio
);
2984 nr_sectors
= bio_sectors(bio
);
2987 * low level driver can indicate that it wants pages above a
2988 * certain limit bounced to low memory (ie for highmem, or even
2989 * ISA dma in theory)
2991 blk_queue_bounce(q
, &bio
);
2993 barrier
= bio_barrier(bio
);
2994 if (unlikely(barrier
) && (q
->next_ordered
== QUEUE_ORDERED_NONE
)) {
2999 spin_lock_irq(q
->queue_lock
);
3001 if (unlikely(barrier
) || elv_queue_empty(q
))
3004 el_ret
= elv_merge(q
, &req
, bio
);
3006 case ELEVATOR_BACK_MERGE
:
3007 BUG_ON(!rq_mergeable(req
));
3009 if (!ll_back_merge_fn(q
, req
, bio
))
3012 blk_add_trace_bio(q
, bio
, BLK_TA_BACKMERGE
);
3014 req
->biotail
->bi_next
= bio
;
3016 req
->nr_sectors
= req
->hard_nr_sectors
+= nr_sectors
;
3017 req
->ioprio
= ioprio_best(req
->ioprio
, prio
);
3018 drive_stat_acct(req
, nr_sectors
, 0);
3019 if (!attempt_back_merge(q
, req
))
3020 elv_merged_request(q
, req
, el_ret
);
3023 case ELEVATOR_FRONT_MERGE
:
3024 BUG_ON(!rq_mergeable(req
));
3026 if (!ll_front_merge_fn(q
, req
, bio
))
3029 blk_add_trace_bio(q
, bio
, BLK_TA_FRONTMERGE
);
3031 bio
->bi_next
= req
->bio
;
3035 * may not be valid. if the low level driver said
3036 * it didn't need a bounce buffer then it better
3037 * not touch req->buffer either...
3039 req
->buffer
= bio_data(bio
);
3040 req
->current_nr_sectors
= bio_cur_sectors(bio
);
3041 req
->hard_cur_sectors
= req
->current_nr_sectors
;
3042 req
->sector
= req
->hard_sector
= bio
->bi_sector
;
3043 req
->nr_sectors
= req
->hard_nr_sectors
+= nr_sectors
;
3044 req
->ioprio
= ioprio_best(req
->ioprio
, prio
);
3045 drive_stat_acct(req
, nr_sectors
, 0);
3046 if (!attempt_front_merge(q
, req
))
3047 elv_merged_request(q
, req
, el_ret
);
3050 /* ELV_NO_MERGE: elevator says don't/can't merge. */
3057 * This sync check and mask will be re-done in init_request_from_bio(),
3058 * but we need to set it earlier to expose the sync flag to the
3059 * rq allocator and io schedulers.
3061 rw_flags
= bio_data_dir(bio
);
3063 rw_flags
|= REQ_RW_SYNC
;
3066 * Grab a free request. This is might sleep but can not fail.
3067 * Returns with the queue unlocked.
3069 req
= get_request_wait(q
, rw_flags
, bio
);
3072 * After dropping the lock and possibly sleeping here, our request
3073 * may now be mergeable after it had proven unmergeable (above).
3074 * We don't worry about that case for efficiency. It won't happen
3075 * often, and the elevators are able to handle it.
3077 init_request_from_bio(req
, bio
);
3079 spin_lock_irq(q
->queue_lock
);
3080 if (elv_queue_empty(q
))
3082 add_request(q
, req
);
3085 __generic_unplug_device(q
);
3087 spin_unlock_irq(q
->queue_lock
);
3091 bio_endio(bio
, err
);
3096 * If bio->bi_dev is a partition, remap the location
3098 static inline void blk_partition_remap(struct bio
*bio
)
3100 struct block_device
*bdev
= bio
->bi_bdev
;
3102 if (bio_sectors(bio
) && bdev
!= bdev
->bd_contains
) {
3103 struct hd_struct
*p
= bdev
->bd_part
;
3104 const int rw
= bio_data_dir(bio
);
3106 p
->sectors
[rw
] += bio_sectors(bio
);
3109 bio
->bi_sector
+= p
->start_sect
;
3110 bio
->bi_bdev
= bdev
->bd_contains
;
3112 blk_add_trace_remap(bdev_get_queue(bio
->bi_bdev
), bio
,
3113 bdev
->bd_dev
, bio
->bi_sector
,
3114 bio
->bi_sector
- p
->start_sect
);
3118 static void handle_bad_sector(struct bio
*bio
)
3120 char b
[BDEVNAME_SIZE
];
3122 printk(KERN_INFO
"attempt to access beyond end of device\n");
3123 printk(KERN_INFO
"%s: rw=%ld, want=%Lu, limit=%Lu\n",
3124 bdevname(bio
->bi_bdev
, b
),
3126 (unsigned long long)bio
->bi_sector
+ bio_sectors(bio
),
3127 (long long)(bio
->bi_bdev
->bd_inode
->i_size
>> 9));
3129 set_bit(BIO_EOF
, &bio
->bi_flags
);
3132 #ifdef CONFIG_FAIL_MAKE_REQUEST
3134 static DECLARE_FAULT_ATTR(fail_make_request
);
3136 static int __init
setup_fail_make_request(char *str
)
3138 return setup_fault_attr(&fail_make_request
, str
);
3140 __setup("fail_make_request=", setup_fail_make_request
);
3142 static int should_fail_request(struct bio
*bio
)
3144 if ((bio
->bi_bdev
->bd_disk
->flags
& GENHD_FL_FAIL
) ||
3145 (bio
->bi_bdev
->bd_part
&& bio
->bi_bdev
->bd_part
->make_it_fail
))
3146 return should_fail(&fail_make_request
, bio
->bi_size
);
3151 static int __init
fail_make_request_debugfs(void)
3153 return init_fault_attr_dentries(&fail_make_request
,
3154 "fail_make_request");
3157 late_initcall(fail_make_request_debugfs
);
3159 #else /* CONFIG_FAIL_MAKE_REQUEST */
3161 static inline int should_fail_request(struct bio
*bio
)
3166 #endif /* CONFIG_FAIL_MAKE_REQUEST */
3169 * Check whether this bio extends beyond the end of the device.
3171 static inline int bio_check_eod(struct bio
*bio
, unsigned int nr_sectors
)
3178 /* Test device or partition size, when known. */
3179 maxsector
= bio
->bi_bdev
->bd_inode
->i_size
>> 9;
3181 sector_t sector
= bio
->bi_sector
;
3183 if (maxsector
< nr_sectors
|| maxsector
- nr_sectors
< sector
) {
3185 * This may well happen - the kernel calls bread()
3186 * without checking the size of the device, e.g., when
3187 * mounting a device.
3189 handle_bad_sector(bio
);
3198 * generic_make_request: hand a buffer to its device driver for I/O
3199 * @bio: The bio describing the location in memory and on the device.
3201 * generic_make_request() is used to make I/O requests of block
3202 * devices. It is passed a &struct bio, which describes the I/O that needs
3205 * generic_make_request() does not return any status. The
3206 * success/failure status of the request, along with notification of
3207 * completion, is delivered asynchronously through the bio->bi_end_io
3208 * function described (one day) else where.
3210 * The caller of generic_make_request must make sure that bi_io_vec
3211 * are set to describe the memory buffer, and that bi_dev and bi_sector are
3212 * set to describe the device address, and the
3213 * bi_end_io and optionally bi_private are set to describe how
3214 * completion notification should be signaled.
3216 * generic_make_request and the drivers it calls may use bi_next if this
3217 * bio happens to be merged with someone else, and may change bi_dev and
3218 * bi_sector for remaps as it sees fit. So the values of these fields
3219 * should NOT be depended on after the call to generic_make_request.
3221 static inline void __generic_make_request(struct bio
*bio
)
3223 struct request_queue
*q
;
3224 sector_t old_sector
;
3225 int ret
, nr_sectors
= bio_sectors(bio
);
3230 if (bio_check_eod(bio
, nr_sectors
))
3234 * Resolve the mapping until finished. (drivers are
3235 * still free to implement/resolve their own stacking
3236 * by explicitly returning 0)
3238 * NOTE: we don't repeat the blk_size check for each new device.
3239 * Stacking drivers are expected to know what they are doing.
3244 char b
[BDEVNAME_SIZE
];
3246 q
= bdev_get_queue(bio
->bi_bdev
);
3249 "generic_make_request: Trying to access "
3250 "nonexistent block-device %s (%Lu)\n",
3251 bdevname(bio
->bi_bdev
, b
),
3252 (long long) bio
->bi_sector
);
3254 bio_endio(bio
, -EIO
);
3258 if (unlikely(nr_sectors
> q
->max_hw_sectors
)) {
3259 printk("bio too big device %s (%u > %u)\n",
3260 bdevname(bio
->bi_bdev
, b
),
3266 if (unlikely(test_bit(QUEUE_FLAG_DEAD
, &q
->queue_flags
)))
3269 if (should_fail_request(bio
))
3273 * If this device has partitions, remap block n
3274 * of partition p to block n+start(p) of the disk.
3276 blk_partition_remap(bio
);
3278 if (old_sector
!= -1)
3279 blk_add_trace_remap(q
, bio
, old_dev
, bio
->bi_sector
,
3282 blk_add_trace_bio(q
, bio
, BLK_TA_QUEUE
);
3284 old_sector
= bio
->bi_sector
;
3285 old_dev
= bio
->bi_bdev
->bd_dev
;
3287 if (bio_check_eod(bio
, nr_sectors
))
3290 ret
= q
->make_request_fn(q
, bio
);
3295 * We only want one ->make_request_fn to be active at a time,
3296 * else stack usage with stacked devices could be a problem.
3297 * So use current->bio_{list,tail} to keep a list of requests
3298 * submited by a make_request_fn function.
3299 * current->bio_tail is also used as a flag to say if
3300 * generic_make_request is currently active in this task or not.
3301 * If it is NULL, then no make_request is active. If it is non-NULL,
3302 * then a make_request is active, and new requests should be added
3305 void generic_make_request(struct bio
*bio
)
3307 if (current
->bio_tail
) {
3308 /* make_request is active */
3309 *(current
->bio_tail
) = bio
;
3310 bio
->bi_next
= NULL
;
3311 current
->bio_tail
= &bio
->bi_next
;
3314 /* following loop may be a bit non-obvious, and so deserves some
3316 * Before entering the loop, bio->bi_next is NULL (as all callers
3317 * ensure that) so we have a list with a single bio.
3318 * We pretend that we have just taken it off a longer list, so
3319 * we assign bio_list to the next (which is NULL) and bio_tail
3320 * to &bio_list, thus initialising the bio_list of new bios to be
3321 * added. __generic_make_request may indeed add some more bios
3322 * through a recursive call to generic_make_request. If it
3323 * did, we find a non-NULL value in bio_list and re-enter the loop
3324 * from the top. In this case we really did just take the bio
3325 * of the top of the list (no pretending) and so fixup bio_list and
3326 * bio_tail or bi_next, and call into __generic_make_request again.
3328 * The loop was structured like this to make only one call to
3329 * __generic_make_request (which is important as it is large and
3330 * inlined) and to keep the structure simple.
3332 BUG_ON(bio
->bi_next
);
3334 current
->bio_list
= bio
->bi_next
;
3335 if (bio
->bi_next
== NULL
)
3336 current
->bio_tail
= ¤t
->bio_list
;
3338 bio
->bi_next
= NULL
;
3339 __generic_make_request(bio
);
3340 bio
= current
->bio_list
;
3342 current
->bio_tail
= NULL
; /* deactivate */
3345 EXPORT_SYMBOL(generic_make_request
);
3348 * submit_bio: submit a bio to the block device layer for I/O
3349 * @rw: whether to %READ or %WRITE, or maybe to %READA (read ahead)
3350 * @bio: The &struct bio which describes the I/O
3352 * submit_bio() is very similar in purpose to generic_make_request(), and
3353 * uses that function to do most of the work. Both are fairly rough
3354 * interfaces, @bio must be presetup and ready for I/O.
3357 void submit_bio(int rw
, struct bio
*bio
)
3359 int count
= bio_sectors(bio
);
3364 * If it's a regular read/write or a barrier with data attached,
3365 * go through the normal accounting stuff before submission.
3367 if (!bio_empty_barrier(bio
)) {
3369 BIO_BUG_ON(!bio
->bi_size
);
3370 BIO_BUG_ON(!bio
->bi_io_vec
);
3373 count_vm_events(PGPGOUT
, count
);
3375 task_io_account_read(bio
->bi_size
);
3376 count_vm_events(PGPGIN
, count
);
3379 if (unlikely(block_dump
)) {
3380 char b
[BDEVNAME_SIZE
];
3381 printk(KERN_DEBUG
"%s(%d): %s block %Lu on %s\n",
3382 current
->comm
, task_pid_nr(current
),
3383 (rw
& WRITE
) ? "WRITE" : "READ",
3384 (unsigned long long)bio
->bi_sector
,
3385 bdevname(bio
->bi_bdev
,b
));
3389 generic_make_request(bio
);
3392 EXPORT_SYMBOL(submit_bio
);
3394 static void blk_recalc_rq_sectors(struct request
*rq
, int nsect
)
3396 if (blk_fs_request(rq
)) {
3397 rq
->hard_sector
+= nsect
;
3398 rq
->hard_nr_sectors
-= nsect
;
3401 * Move the I/O submission pointers ahead if required.
3403 if ((rq
->nr_sectors
>= rq
->hard_nr_sectors
) &&
3404 (rq
->sector
<= rq
->hard_sector
)) {
3405 rq
->sector
= rq
->hard_sector
;
3406 rq
->nr_sectors
= rq
->hard_nr_sectors
;
3407 rq
->hard_cur_sectors
= bio_cur_sectors(rq
->bio
);
3408 rq
->current_nr_sectors
= rq
->hard_cur_sectors
;
3409 rq
->buffer
= bio_data(rq
->bio
);
3413 * if total number of sectors is less than the first segment
3414 * size, something has gone terribly wrong
3416 if (rq
->nr_sectors
< rq
->current_nr_sectors
) {
3417 printk("blk: request botched\n");
3418 rq
->nr_sectors
= rq
->current_nr_sectors
;
3423 static int __end_that_request_first(struct request
*req
, int uptodate
,
3426 int total_bytes
, bio_nbytes
, error
, next_idx
= 0;
3429 blk_add_trace_rq(req
->q
, req
, BLK_TA_COMPLETE
);
3432 * extend uptodate bool to allow < 0 value to be direct io error
3435 if (end_io_error(uptodate
))
3436 error
= !uptodate
? -EIO
: uptodate
;
3439 * for a REQ_BLOCK_PC request, we want to carry any eventual
3440 * sense key with us all the way through
3442 if (!blk_pc_request(req
))
3446 if (blk_fs_request(req
) && !(req
->cmd_flags
& REQ_QUIET
))
3447 printk("end_request: I/O error, dev %s, sector %llu\n",
3448 req
->rq_disk
? req
->rq_disk
->disk_name
: "?",
3449 (unsigned long long)req
->sector
);
3452 if (blk_fs_request(req
) && req
->rq_disk
) {
3453 const int rw
= rq_data_dir(req
);
3455 disk_stat_add(req
->rq_disk
, sectors
[rw
], nr_bytes
>> 9);
3458 total_bytes
= bio_nbytes
= 0;
3459 while ((bio
= req
->bio
) != NULL
) {
3463 * For an empty barrier request, the low level driver must
3464 * store a potential error location in ->sector. We pass
3465 * that back up in ->bi_sector.
3467 if (blk_empty_barrier(req
))
3468 bio
->bi_sector
= req
->sector
;
3470 if (nr_bytes
>= bio
->bi_size
) {
3471 req
->bio
= bio
->bi_next
;
3472 nbytes
= bio
->bi_size
;
3473 req_bio_endio(req
, bio
, nbytes
, error
);
3477 int idx
= bio
->bi_idx
+ next_idx
;
3479 if (unlikely(bio
->bi_idx
>= bio
->bi_vcnt
)) {
3480 blk_dump_rq_flags(req
, "__end_that");
3481 printk("%s: bio idx %d >= vcnt %d\n",
3483 bio
->bi_idx
, bio
->bi_vcnt
);
3487 nbytes
= bio_iovec_idx(bio
, idx
)->bv_len
;
3488 BIO_BUG_ON(nbytes
> bio
->bi_size
);
3491 * not a complete bvec done
3493 if (unlikely(nbytes
> nr_bytes
)) {
3494 bio_nbytes
+= nr_bytes
;
3495 total_bytes
+= nr_bytes
;
3500 * advance to the next vector
3503 bio_nbytes
+= nbytes
;
3506 total_bytes
+= nbytes
;
3509 if ((bio
= req
->bio
)) {
3511 * end more in this run, or just return 'not-done'
3513 if (unlikely(nr_bytes
<= 0))
3525 * if the request wasn't completed, update state
3528 req_bio_endio(req
, bio
, bio_nbytes
, error
);
3529 bio
->bi_idx
+= next_idx
;
3530 bio_iovec(bio
)->bv_offset
+= nr_bytes
;
3531 bio_iovec(bio
)->bv_len
-= nr_bytes
;
3534 blk_recalc_rq_sectors(req
, total_bytes
>> 9);
3535 blk_recalc_rq_segments(req
);
3540 * end_that_request_first - end I/O on a request
3541 * @req: the request being processed
3542 * @uptodate: 1 for success, 0 for I/O error, < 0 for specific error
3543 * @nr_sectors: number of sectors to end I/O on
3546 * Ends I/O on a number of sectors attached to @req, and sets it up
3547 * for the next range of segments (if any) in the cluster.
3550 * 0 - we are done with this request, call end_that_request_last()
3551 * 1 - still buffers pending for this request
3553 int end_that_request_first(struct request
*req
, int uptodate
, int nr_sectors
)
3555 return __end_that_request_first(req
, uptodate
, nr_sectors
<< 9);
3558 EXPORT_SYMBOL(end_that_request_first
);
3561 * end_that_request_chunk - end I/O on a request
3562 * @req: the request being processed
3563 * @uptodate: 1 for success, 0 for I/O error, < 0 for specific error
3564 * @nr_bytes: number of bytes to complete
3567 * Ends I/O on a number of bytes attached to @req, and sets it up
3568 * for the next range of segments (if any). Like end_that_request_first(),
3569 * but deals with bytes instead of sectors.
3572 * 0 - we are done with this request, call end_that_request_last()
3573 * 1 - still buffers pending for this request
3575 int end_that_request_chunk(struct request
*req
, int uptodate
, int nr_bytes
)
3577 return __end_that_request_first(req
, uptodate
, nr_bytes
);
3580 EXPORT_SYMBOL(end_that_request_chunk
);
3583 * splice the completion data to a local structure and hand off to
3584 * process_completion_queue() to complete the requests
3586 static void blk_done_softirq(struct softirq_action
*h
)
3588 struct list_head
*cpu_list
, local_list
;
3590 local_irq_disable();
3591 cpu_list
= &__get_cpu_var(blk_cpu_done
);
3592 list_replace_init(cpu_list
, &local_list
);
3595 while (!list_empty(&local_list
)) {
3596 struct request
*rq
= list_entry(local_list
.next
, struct request
, donelist
);
3598 list_del_init(&rq
->donelist
);
3599 rq
->q
->softirq_done_fn(rq
);
3603 static int __cpuinit
blk_cpu_notify(struct notifier_block
*self
, unsigned long action
,
3607 * If a CPU goes away, splice its entries to the current CPU
3608 * and trigger a run of the softirq
3610 if (action
== CPU_DEAD
|| action
== CPU_DEAD_FROZEN
) {
3611 int cpu
= (unsigned long) hcpu
;
3613 local_irq_disable();
3614 list_splice_init(&per_cpu(blk_cpu_done
, cpu
),
3615 &__get_cpu_var(blk_cpu_done
));
3616 raise_softirq_irqoff(BLOCK_SOFTIRQ
);
3624 static struct notifier_block blk_cpu_notifier __cpuinitdata
= {
3625 .notifier_call
= blk_cpu_notify
,
3629 * blk_complete_request - end I/O on a request
3630 * @req: the request being processed
3633 * Ends all I/O on a request. It does not handle partial completions,
3634 * unless the driver actually implements this in its completion callback
3635 * through requeueing. The actual completion happens out-of-order,
3636 * through a softirq handler. The user must have registered a completion
3637 * callback through blk_queue_softirq_done().
3640 void blk_complete_request(struct request
*req
)
3642 struct list_head
*cpu_list
;
3643 unsigned long flags
;
3645 BUG_ON(!req
->q
->softirq_done_fn
);
3647 local_irq_save(flags
);
3649 cpu_list
= &__get_cpu_var(blk_cpu_done
);
3650 list_add_tail(&req
->donelist
, cpu_list
);
3651 raise_softirq_irqoff(BLOCK_SOFTIRQ
);
3653 local_irq_restore(flags
);
3656 EXPORT_SYMBOL(blk_complete_request
);
3659 * queue lock must be held
3661 void end_that_request_last(struct request
*req
, int uptodate
)
3663 struct gendisk
*disk
= req
->rq_disk
;
3667 * extend uptodate bool to allow < 0 value to be direct io error
3670 if (end_io_error(uptodate
))
3671 error
= !uptodate
? -EIO
: uptodate
;
3673 if (unlikely(laptop_mode
) && blk_fs_request(req
))
3674 laptop_io_completion();
3677 * Account IO completion. bar_rq isn't accounted as a normal
3678 * IO on queueing nor completion. Accounting the containing
3679 * request is enough.
3681 if (disk
&& blk_fs_request(req
) && req
!= &req
->q
->bar_rq
) {
3682 unsigned long duration
= jiffies
- req
->start_time
;
3683 const int rw
= rq_data_dir(req
);
3685 __disk_stat_inc(disk
, ios
[rw
]);
3686 __disk_stat_add(disk
, ticks
[rw
], duration
);
3687 disk_round_stats(disk
);
3691 req
->end_io(req
, error
);
3693 __blk_put_request(req
->q
, req
);
3696 EXPORT_SYMBOL(end_that_request_last
);
3698 static inline void __end_request(struct request
*rq
, int uptodate
,
3699 unsigned int nr_bytes
, int dequeue
)
3701 if (!end_that_request_chunk(rq
, uptodate
, nr_bytes
)) {
3703 blkdev_dequeue_request(rq
);
3704 add_disk_randomness(rq
->rq_disk
);
3705 end_that_request_last(rq
, uptodate
);
3709 static unsigned int rq_byte_size(struct request
*rq
)
3711 if (blk_fs_request(rq
))
3712 return rq
->hard_nr_sectors
<< 9;
3714 return rq
->data_len
;
3718 * end_queued_request - end all I/O on a queued request
3719 * @rq: the request being processed
3720 * @uptodate: error value or 0/1 uptodate flag
3723 * Ends all I/O on a request, and removes it from the block layer queues.
3724 * Not suitable for normal IO completion, unless the driver still has
3725 * the request attached to the block layer.
3728 void end_queued_request(struct request
*rq
, int uptodate
)
3730 __end_request(rq
, uptodate
, rq_byte_size(rq
), 1);
3732 EXPORT_SYMBOL(end_queued_request
);
3735 * end_dequeued_request - end all I/O on a dequeued request
3736 * @rq: the request being processed
3737 * @uptodate: error value or 0/1 uptodate flag
3740 * Ends all I/O on a request. The request must already have been
3741 * dequeued using blkdev_dequeue_request(), as is normally the case
3745 void end_dequeued_request(struct request
*rq
, int uptodate
)
3747 __end_request(rq
, uptodate
, rq_byte_size(rq
), 0);
3749 EXPORT_SYMBOL(end_dequeued_request
);
3753 * end_request - end I/O on the current segment of the request
3754 * @req: the request being processed
3755 * @uptodate: error value or 0/1 uptodate flag
3758 * Ends I/O on the current segment of a request. If that is the only
3759 * remaining segment, the request is also completed and freed.
3761 * This is a remnant of how older block drivers handled IO completions.
3762 * Modern drivers typically end IO on the full request in one go, unless
3763 * they have a residual value to account for. For that case this function
3764 * isn't really useful, unless the residual just happens to be the
3765 * full current segment. In other words, don't use this function in new
3766 * code. Either use end_request_completely(), or the
3767 * end_that_request_chunk() (along with end_that_request_last()) for
3768 * partial completions.
3771 void end_request(struct request
*req
, int uptodate
)
3773 __end_request(req
, uptodate
, req
->hard_cur_sectors
<< 9, 1);
3775 EXPORT_SYMBOL(end_request
);
3777 static void blk_rq_bio_prep(struct request_queue
*q
, struct request
*rq
,
3780 /* first two bits are identical in rq->cmd_flags and bio->bi_rw */
3781 rq
->cmd_flags
|= (bio
->bi_rw
& 3);
3783 rq
->nr_phys_segments
= bio_phys_segments(q
, bio
);
3784 rq
->nr_hw_segments
= bio_hw_segments(q
, bio
);
3785 rq
->current_nr_sectors
= bio_cur_sectors(bio
);
3786 rq
->hard_cur_sectors
= rq
->current_nr_sectors
;
3787 rq
->hard_nr_sectors
= rq
->nr_sectors
= bio_sectors(bio
);
3788 rq
->buffer
= bio_data(bio
);
3789 rq
->data_len
= bio
->bi_size
;
3791 rq
->bio
= rq
->biotail
= bio
;
3794 rq
->rq_disk
= bio
->bi_bdev
->bd_disk
;
3797 int kblockd_schedule_work(struct work_struct
*work
)
3799 return queue_work(kblockd_workqueue
, work
);
3802 EXPORT_SYMBOL(kblockd_schedule_work
);
3804 void kblockd_flush_work(struct work_struct
*work
)
3806 cancel_work_sync(work
);
3808 EXPORT_SYMBOL(kblockd_flush_work
);
3810 int __init
blk_dev_init(void)
3814 kblockd_workqueue
= create_workqueue("kblockd");
3815 if (!kblockd_workqueue
)
3816 panic("Failed to create kblockd\n");
3818 request_cachep
= kmem_cache_create("blkdev_requests",
3819 sizeof(struct request
), 0, SLAB_PANIC
, NULL
);
3821 requestq_cachep
= kmem_cache_create("blkdev_queue",
3822 sizeof(struct request_queue
), 0, SLAB_PANIC
, NULL
);
3824 iocontext_cachep
= kmem_cache_create("blkdev_ioc",
3825 sizeof(struct io_context
), 0, SLAB_PANIC
, NULL
);
3827 for_each_possible_cpu(i
)
3828 INIT_LIST_HEAD(&per_cpu(blk_cpu_done
, i
));
3830 open_softirq(BLOCK_SOFTIRQ
, blk_done_softirq
, NULL
);
3831 register_hotcpu_notifier(&blk_cpu_notifier
);
3833 blk_max_low_pfn
= max_low_pfn
- 1;
3834 blk_max_pfn
= max_pfn
- 1;
3840 * IO Context helper functions
3842 void put_io_context(struct io_context
*ioc
)
3847 BUG_ON(atomic_read(&ioc
->refcount
) == 0);
3849 if (atomic_dec_and_test(&ioc
->refcount
)) {
3850 struct cfq_io_context
*cic
;
3853 if (ioc
->aic
&& ioc
->aic
->dtor
)
3854 ioc
->aic
->dtor(ioc
->aic
);
3855 if (ioc
->cic_root
.rb_node
!= NULL
) {
3856 struct rb_node
*n
= rb_first(&ioc
->cic_root
);
3858 cic
= rb_entry(n
, struct cfq_io_context
, rb_node
);
3863 kmem_cache_free(iocontext_cachep
, ioc
);
3866 EXPORT_SYMBOL(put_io_context
);
3868 /* Called by the exitting task */
3869 void exit_io_context(void)
3871 struct io_context
*ioc
;
3872 struct cfq_io_context
*cic
;
3875 ioc
= current
->io_context
;
3876 current
->io_context
= NULL
;
3877 task_unlock(current
);
3880 if (ioc
->aic
&& ioc
->aic
->exit
)
3881 ioc
->aic
->exit(ioc
->aic
);
3882 if (ioc
->cic_root
.rb_node
!= NULL
) {
3883 cic
= rb_entry(rb_first(&ioc
->cic_root
), struct cfq_io_context
, rb_node
);
3887 put_io_context(ioc
);
3891 * If the current task has no IO context then create one and initialise it.
3892 * Otherwise, return its existing IO context.
3894 * This returned IO context doesn't have a specifically elevated refcount,
3895 * but since the current task itself holds a reference, the context can be
3896 * used in general code, so long as it stays within `current` context.
3898 static struct io_context
*current_io_context(gfp_t gfp_flags
, int node
)
3900 struct task_struct
*tsk
= current
;
3901 struct io_context
*ret
;
3903 ret
= tsk
->io_context
;
3907 ret
= kmem_cache_alloc_node(iocontext_cachep
, gfp_flags
, node
);
3909 atomic_set(&ret
->refcount
, 1);
3910 ret
->task
= current
;
3911 ret
->ioprio_changed
= 0;
3912 ret
->last_waited
= jiffies
; /* doesn't matter... */
3913 ret
->nr_batch_requests
= 0; /* because this is 0 */
3915 ret
->cic_root
.rb_node
= NULL
;
3916 ret
->ioc_data
= NULL
;
3917 /* make sure set_task_ioprio() sees the settings above */
3919 tsk
->io_context
= ret
;
3926 * If the current task has no IO context then create one and initialise it.
3927 * If it does have a context, take a ref on it.
3929 * This is always called in the context of the task which submitted the I/O.
3931 struct io_context
*get_io_context(gfp_t gfp_flags
, int node
)
3933 struct io_context
*ret
;
3934 ret
= current_io_context(gfp_flags
, node
);
3936 atomic_inc(&ret
->refcount
);
3939 EXPORT_SYMBOL(get_io_context
);
3941 void copy_io_context(struct io_context
**pdst
, struct io_context
**psrc
)
3943 struct io_context
*src
= *psrc
;
3944 struct io_context
*dst
= *pdst
;
3947 BUG_ON(atomic_read(&src
->refcount
) == 0);
3948 atomic_inc(&src
->refcount
);
3949 put_io_context(dst
);
3953 EXPORT_SYMBOL(copy_io_context
);
3955 void swap_io_context(struct io_context
**ioc1
, struct io_context
**ioc2
)
3957 struct io_context
*temp
;
3962 EXPORT_SYMBOL(swap_io_context
);
3967 struct queue_sysfs_entry
{
3968 struct attribute attr
;
3969 ssize_t (*show
)(struct request_queue
*, char *);
3970 ssize_t (*store
)(struct request_queue
*, const char *, size_t);
3974 queue_var_show(unsigned int var
, char *page
)
3976 return sprintf(page
, "%d\n", var
);
3980 queue_var_store(unsigned long *var
, const char *page
, size_t count
)
3982 char *p
= (char *) page
;
3984 *var
= simple_strtoul(p
, &p
, 10);
3988 static ssize_t
queue_requests_show(struct request_queue
*q
, char *page
)
3990 return queue_var_show(q
->nr_requests
, (page
));
3994 queue_requests_store(struct request_queue
*q
, const char *page
, size_t count
)
3996 struct request_list
*rl
= &q
->rq
;
3998 int ret
= queue_var_store(&nr
, page
, count
);
3999 if (nr
< BLKDEV_MIN_RQ
)
4002 spin_lock_irq(q
->queue_lock
);
4003 q
->nr_requests
= nr
;
4004 blk_queue_congestion_threshold(q
);
4006 if (rl
->count
[READ
] >= queue_congestion_on_threshold(q
))
4007 blk_set_queue_congested(q
, READ
);
4008 else if (rl
->count
[READ
] < queue_congestion_off_threshold(q
))
4009 blk_clear_queue_congested(q
, READ
);
4011 if (rl
->count
[WRITE
] >= queue_congestion_on_threshold(q
))
4012 blk_set_queue_congested(q
, WRITE
);
4013 else if (rl
->count
[WRITE
] < queue_congestion_off_threshold(q
))
4014 blk_clear_queue_congested(q
, WRITE
);
4016 if (rl
->count
[READ
] >= q
->nr_requests
) {
4017 blk_set_queue_full(q
, READ
);
4018 } else if (rl
->count
[READ
]+1 <= q
->nr_requests
) {
4019 blk_clear_queue_full(q
, READ
);
4020 wake_up(&rl
->wait
[READ
]);
4023 if (rl
->count
[WRITE
] >= q
->nr_requests
) {
4024 blk_set_queue_full(q
, WRITE
);
4025 } else if (rl
->count
[WRITE
]+1 <= q
->nr_requests
) {
4026 blk_clear_queue_full(q
, WRITE
);
4027 wake_up(&rl
->wait
[WRITE
]);
4029 spin_unlock_irq(q
->queue_lock
);
4033 static ssize_t
queue_ra_show(struct request_queue
*q
, char *page
)
4035 int ra_kb
= q
->backing_dev_info
.ra_pages
<< (PAGE_CACHE_SHIFT
- 10);
4037 return queue_var_show(ra_kb
, (page
));
4041 queue_ra_store(struct request_queue
*q
, const char *page
, size_t count
)
4043 unsigned long ra_kb
;
4044 ssize_t ret
= queue_var_store(&ra_kb
, page
, count
);
4046 spin_lock_irq(q
->queue_lock
);
4047 q
->backing_dev_info
.ra_pages
= ra_kb
>> (PAGE_CACHE_SHIFT
- 10);
4048 spin_unlock_irq(q
->queue_lock
);
4053 static ssize_t
queue_max_sectors_show(struct request_queue
*q
, char *page
)
4055 int max_sectors_kb
= q
->max_sectors
>> 1;
4057 return queue_var_show(max_sectors_kb
, (page
));
4061 queue_max_sectors_store(struct request_queue
*q
, const char *page
, size_t count
)
4063 unsigned long max_sectors_kb
,
4064 max_hw_sectors_kb
= q
->max_hw_sectors
>> 1,
4065 page_kb
= 1 << (PAGE_CACHE_SHIFT
- 10);
4066 ssize_t ret
= queue_var_store(&max_sectors_kb
, page
, count
);
4068 if (max_sectors_kb
> max_hw_sectors_kb
|| max_sectors_kb
< page_kb
)
4071 * Take the queue lock to update the readahead and max_sectors
4072 * values synchronously:
4074 spin_lock_irq(q
->queue_lock
);
4075 q
->max_sectors
= max_sectors_kb
<< 1;
4076 spin_unlock_irq(q
->queue_lock
);
4081 static ssize_t
queue_max_hw_sectors_show(struct request_queue
*q
, char *page
)
4083 int max_hw_sectors_kb
= q
->max_hw_sectors
>> 1;
4085 return queue_var_show(max_hw_sectors_kb
, (page
));
4088 static ssize_t
queue_max_segments_show(struct request_queue
*q
, char *page
)
4090 return queue_var_show(q
->max_phys_segments
, page
);
4093 static ssize_t
queue_max_segments_store(struct request_queue
*q
,
4094 const char *page
, size_t count
)
4096 unsigned long segments
;
4097 ssize_t ret
= queue_var_store(&segments
, page
, count
);
4099 spin_lock_irq(q
->queue_lock
);
4100 q
->max_phys_segments
= segments
;
4101 spin_unlock_irq(q
->queue_lock
);
4105 static struct queue_sysfs_entry queue_requests_entry
= {
4106 .attr
= {.name
= "nr_requests", .mode
= S_IRUGO
| S_IWUSR
},
4107 .show
= queue_requests_show
,
4108 .store
= queue_requests_store
,
4111 static struct queue_sysfs_entry queue_ra_entry
= {
4112 .attr
= {.name
= "read_ahead_kb", .mode
= S_IRUGO
| S_IWUSR
},
4113 .show
= queue_ra_show
,
4114 .store
= queue_ra_store
,
4117 static struct queue_sysfs_entry queue_max_sectors_entry
= {
4118 .attr
= {.name
= "max_sectors_kb", .mode
= S_IRUGO
| S_IWUSR
},
4119 .show
= queue_max_sectors_show
,
4120 .store
= queue_max_sectors_store
,
4123 static struct queue_sysfs_entry queue_max_hw_sectors_entry
= {
4124 .attr
= {.name
= "max_hw_sectors_kb", .mode
= S_IRUGO
},
4125 .show
= queue_max_hw_sectors_show
,
4128 static struct queue_sysfs_entry queue_max_segments_entry
= {
4129 .attr
= {.name
= "max_segments", .mode
= S_IRUGO
| S_IWUSR
},
4130 .show
= queue_max_segments_show
,
4131 .store
= queue_max_segments_store
,
4134 static struct queue_sysfs_entry queue_iosched_entry
= {
4135 .attr
= {.name
= "scheduler", .mode
= S_IRUGO
| S_IWUSR
},
4136 .show
= elv_iosched_show
,
4137 .store
= elv_iosched_store
,
4140 static struct attribute
*default_attrs
[] = {
4141 &queue_requests_entry
.attr
,
4142 &queue_ra_entry
.attr
,
4143 &queue_max_hw_sectors_entry
.attr
,
4144 &queue_max_sectors_entry
.attr
,
4145 &queue_max_segments_entry
.attr
,
4146 &queue_iosched_entry
.attr
,
4150 #define to_queue(atr) container_of((atr), struct queue_sysfs_entry, attr)
4153 queue_attr_show(struct kobject
*kobj
, struct attribute
*attr
, char *page
)
4155 struct queue_sysfs_entry
*entry
= to_queue(attr
);
4156 struct request_queue
*q
=
4157 container_of(kobj
, struct request_queue
, kobj
);
4162 mutex_lock(&q
->sysfs_lock
);
4163 if (test_bit(QUEUE_FLAG_DEAD
, &q
->queue_flags
)) {
4164 mutex_unlock(&q
->sysfs_lock
);
4167 res
= entry
->show(q
, page
);
4168 mutex_unlock(&q
->sysfs_lock
);
4173 queue_attr_store(struct kobject
*kobj
, struct attribute
*attr
,
4174 const char *page
, size_t length
)
4176 struct queue_sysfs_entry
*entry
= to_queue(attr
);
4177 struct request_queue
*q
= container_of(kobj
, struct request_queue
, kobj
);
4183 mutex_lock(&q
->sysfs_lock
);
4184 if (test_bit(QUEUE_FLAG_DEAD
, &q
->queue_flags
)) {
4185 mutex_unlock(&q
->sysfs_lock
);
4188 res
= entry
->store(q
, page
, length
);
4189 mutex_unlock(&q
->sysfs_lock
);
4193 static struct sysfs_ops queue_sysfs_ops
= {
4194 .show
= queue_attr_show
,
4195 .store
= queue_attr_store
,
4198 static struct kobj_type queue_ktype
= {
4199 .sysfs_ops
= &queue_sysfs_ops
,
4200 .default_attrs
= default_attrs
,
4201 .release
= blk_release_queue
,
4204 int blk_register_queue(struct gendisk
*disk
)
4208 struct request_queue
*q
= disk
->queue
;
4210 if (!q
|| !q
->request_fn
)
4213 q
->kobj
.parent
= kobject_get(&disk
->kobj
);
4215 ret
= kobject_add(&q
->kobj
);
4219 kobject_uevent(&q
->kobj
, KOBJ_ADD
);
4221 ret
= elv_register_queue(q
);
4223 kobject_uevent(&q
->kobj
, KOBJ_REMOVE
);
4224 kobject_del(&q
->kobj
);
4231 void blk_unregister_queue(struct gendisk
*disk
)
4233 struct request_queue
*q
= disk
->queue
;
4235 if (q
&& q
->request_fn
) {
4236 elv_unregister_queue(q
);
4238 kobject_uevent(&q
->kobj
, KOBJ_REMOVE
);
4239 kobject_del(&q
->kobj
);
4240 kobject_put(&disk
->kobj
);