Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 1 | /* |
| 2 | * Functions related to setting various queue properties from drivers |
| 3 | */ |
| 4 | #include <linux/kernel.h> |
| 5 | #include <linux/module.h> |
| 6 | #include <linux/init.h> |
| 7 | #include <linux/bio.h> |
| 8 | #include <linux/blkdev.h> |
| 9 | #include <linux/bootmem.h> /* for max_pfn/max_low_pfn */ |
Martin K. Petersen | 70dd5bf | 2009-07-31 11:49:12 -0400 | [diff] [blame] | 10 | #include <linux/gcd.h> |
Martin K. Petersen | 2cda272 | 2010-03-15 12:46:51 +0100 | [diff] [blame] | 11 | #include <linux/lcm.h> |
Randy Dunlap | ad5ebd2 | 2009-11-11 13:47:45 +0100 | [diff] [blame] | 12 | #include <linux/jiffies.h> |
Tejun Heo | 5a0e3ad | 2010-03-24 17:04:11 +0900 | [diff] [blame] | 13 | #include <linux/gfp.h> |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 14 | |
| 15 | #include "blk.h" |
| 16 | |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 17 | unsigned long blk_max_low_pfn; |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 18 | EXPORT_SYMBOL(blk_max_low_pfn); |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 19 | |
| 20 | unsigned long blk_max_pfn; |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 21 | |
| 22 | /** |
| 23 | * blk_queue_prep_rq - set a prepare_request function for queue |
| 24 | * @q: queue |
| 25 | * @pfn: prepare_request function |
| 26 | * |
| 27 | * It's possible for a queue to register a prepare_request callback which |
| 28 | * is invoked before the request is handed to the request_fn. The goal of |
| 29 | * the function is to prepare a request for I/O, it can be used to build a |
| 30 | * cdb from the request data for instance. |
| 31 | * |
| 32 | */ |
| 33 | void blk_queue_prep_rq(struct request_queue *q, prep_rq_fn *pfn) |
| 34 | { |
| 35 | q->prep_rq_fn = pfn; |
| 36 | } |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 37 | EXPORT_SYMBOL(blk_queue_prep_rq); |
| 38 | |
| 39 | /** |
James Bottomley | 28018c2 | 2010-07-01 19:49:17 +0900 | [diff] [blame] | 40 | * blk_queue_unprep_rq - set an unprepare_request function for queue |
| 41 | * @q: queue |
| 42 | * @ufn: unprepare_request function |
| 43 | * |
| 44 | * It's possible for a queue to register an unprepare_request callback |
| 45 | * which is invoked before the request is finally completed. The goal |
| 46 | * of the function is to deallocate any data that was allocated in the |
| 47 | * prepare_request callback. |
| 48 | * |
| 49 | */ |
| 50 | void blk_queue_unprep_rq(struct request_queue *q, unprep_rq_fn *ufn) |
| 51 | { |
| 52 | q->unprep_rq_fn = ufn; |
| 53 | } |
| 54 | EXPORT_SYMBOL(blk_queue_unprep_rq); |
| 55 | |
| 56 | /** |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 57 | * blk_queue_merge_bvec - set a merge_bvec function for queue |
| 58 | * @q: queue |
| 59 | * @mbfn: merge_bvec_fn |
| 60 | * |
| 61 | * Usually queues have static limitations on the max sectors or segments that |
| 62 | * we can put in a request. Stacking drivers may have some settings that |
| 63 | * are dynamic, and thus we have to query the queue whether it is ok to |
| 64 | * add a new bio_vec to a bio at a given offset or not. If the block device |
| 65 | * has such limitations, it needs to register a merge_bvec_fn to control |
| 66 | * the size of bio's sent to it. Note that a block device *must* allow a |
| 67 | * single page to be added to an empty bio. The block device driver may want |
| 68 | * to use the bio_split() function to deal with these bio's. By default |
| 69 | * no merge_bvec_fn is defined for a queue, and only the fixed limits are |
| 70 | * honored. |
| 71 | */ |
| 72 | void blk_queue_merge_bvec(struct request_queue *q, merge_bvec_fn *mbfn) |
| 73 | { |
| 74 | q->merge_bvec_fn = mbfn; |
| 75 | } |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 76 | EXPORT_SYMBOL(blk_queue_merge_bvec); |
| 77 | |
| 78 | void blk_queue_softirq_done(struct request_queue *q, softirq_done_fn *fn) |
| 79 | { |
| 80 | q->softirq_done_fn = fn; |
| 81 | } |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 82 | EXPORT_SYMBOL(blk_queue_softirq_done); |
| 83 | |
Jens Axboe | 242f9dc | 2008-09-14 05:55:09 -0700 | [diff] [blame] | 84 | void blk_queue_rq_timeout(struct request_queue *q, unsigned int timeout) |
| 85 | { |
| 86 | q->rq_timeout = timeout; |
| 87 | } |
| 88 | EXPORT_SYMBOL_GPL(blk_queue_rq_timeout); |
| 89 | |
| 90 | void blk_queue_rq_timed_out(struct request_queue *q, rq_timed_out_fn *fn) |
| 91 | { |
| 92 | q->rq_timed_out_fn = fn; |
| 93 | } |
| 94 | EXPORT_SYMBOL_GPL(blk_queue_rq_timed_out); |
| 95 | |
Kiyoshi Ueda | ef9e3fa | 2008-10-01 16:12:15 +0200 | [diff] [blame] | 96 | void blk_queue_lld_busy(struct request_queue *q, lld_busy_fn *fn) |
| 97 | { |
| 98 | q->lld_busy_fn = fn; |
| 99 | } |
| 100 | EXPORT_SYMBOL_GPL(blk_queue_lld_busy); |
| 101 | |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 102 | /** |
Martin K. Petersen | e475bba | 2009-06-16 08:23:52 +0200 | [diff] [blame] | 103 | * blk_set_default_limits - reset limits to default values |
Randy Dunlap | f740f5ca | 2009-06-19 09:18:32 +0200 | [diff] [blame] | 104 | * @lim: the queue_limits structure to reset |
Martin K. Petersen | e475bba | 2009-06-16 08:23:52 +0200 | [diff] [blame] | 105 | * |
| 106 | * Description: |
Martin K. Petersen | b1bd055 | 2012-01-11 16:27:11 +0100 | [diff] [blame] | 107 | * Returns a queue_limit struct to its default state. |
Martin K. Petersen | e475bba | 2009-06-16 08:23:52 +0200 | [diff] [blame] | 108 | */ |
| 109 | void blk_set_default_limits(struct queue_limits *lim) |
| 110 | { |
Martin K. Petersen | 8a78362 | 2010-02-26 00:20:39 -0500 | [diff] [blame] | 111 | lim->max_segments = BLK_MAX_SEGMENTS; |
Martin K. Petersen | 13f05c8 | 2010-09-10 20:50:10 +0200 | [diff] [blame] | 112 | lim->max_integrity_segments = 0; |
Martin K. Petersen | e475bba | 2009-06-16 08:23:52 +0200 | [diff] [blame] | 113 | lim->seg_boundary_mask = BLK_SEG_BOUNDARY_MASK; |
Martin K. Petersen | eb28d31 | 2010-02-26 00:20:37 -0500 | [diff] [blame] | 114 | lim->max_segment_size = BLK_MAX_SEGMENT_SIZE; |
Martin K. Petersen | b1bd055 | 2012-01-11 16:27:11 +0100 | [diff] [blame] | 115 | lim->max_sectors = lim->max_hw_sectors = BLK_SAFE_MAX_SECTORS; |
Jens Axboe | 762380a | 2014-06-05 13:38:39 -0600 | [diff] [blame] | 116 | lim->chunk_sectors = 0; |
Martin K. Petersen | 4363ac7 | 2012-09-18 12:19:27 -0400 | [diff] [blame] | 117 | lim->max_write_same_sectors = 0; |
Martin K. Petersen | 86b3728 | 2009-11-10 11:50:21 +0100 | [diff] [blame] | 118 | lim->max_discard_sectors = 0; |
Jens Axboe | 0034af0 | 2015-07-16 09:14:26 -0600 | [diff] [blame^] | 119 | lim->max_hw_discard_sectors = 0; |
Martin K. Petersen | 86b3728 | 2009-11-10 11:50:21 +0100 | [diff] [blame] | 120 | lim->discard_granularity = 0; |
| 121 | lim->discard_alignment = 0; |
| 122 | lim->discard_misaligned = 0; |
Martin K. Petersen | b1bd055 | 2012-01-11 16:27:11 +0100 | [diff] [blame] | 123 | lim->discard_zeroes_data = 0; |
Martin K. Petersen | e475bba | 2009-06-16 08:23:52 +0200 | [diff] [blame] | 124 | lim->logical_block_size = lim->physical_block_size = lim->io_min = 512; |
Martin K. Petersen | 3a02c8e | 2009-06-18 09:56:03 +0200 | [diff] [blame] | 125 | lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT); |
Martin K. Petersen | e475bba | 2009-06-16 08:23:52 +0200 | [diff] [blame] | 126 | lim->alignment_offset = 0; |
| 127 | lim->io_opt = 0; |
| 128 | lim->misaligned = 0; |
Martin K. Petersen | e692cb6 | 2010-12-01 19:41:49 +0100 | [diff] [blame] | 129 | lim->cluster = 1; |
Martin K. Petersen | e475bba | 2009-06-16 08:23:52 +0200 | [diff] [blame] | 130 | } |
| 131 | EXPORT_SYMBOL(blk_set_default_limits); |
| 132 | |
| 133 | /** |
Martin K. Petersen | b1bd055 | 2012-01-11 16:27:11 +0100 | [diff] [blame] | 134 | * blk_set_stacking_limits - set default limits for stacking devices |
| 135 | * @lim: the queue_limits structure to reset |
| 136 | * |
| 137 | * Description: |
| 138 | * Returns a queue_limit struct to its default state. Should be used |
| 139 | * by stacking drivers like DM that have no internal limits. |
| 140 | */ |
| 141 | void blk_set_stacking_limits(struct queue_limits *lim) |
| 142 | { |
| 143 | blk_set_default_limits(lim); |
| 144 | |
| 145 | /* Inherit limits from component devices */ |
| 146 | lim->discard_zeroes_data = 1; |
| 147 | lim->max_segments = USHRT_MAX; |
| 148 | lim->max_hw_sectors = UINT_MAX; |
Mike Snitzer | d82ae52 | 2013-10-18 09:44:49 -0600 | [diff] [blame] | 149 | lim->max_segment_size = UINT_MAX; |
Mike Snitzer | fe86cdc | 2012-08-01 10:44:28 +0200 | [diff] [blame] | 150 | lim->max_sectors = UINT_MAX; |
Martin K. Petersen | 4363ac7 | 2012-09-18 12:19:27 -0400 | [diff] [blame] | 151 | lim->max_write_same_sectors = UINT_MAX; |
Martin K. Petersen | b1bd055 | 2012-01-11 16:27:11 +0100 | [diff] [blame] | 152 | } |
| 153 | EXPORT_SYMBOL(blk_set_stacking_limits); |
| 154 | |
| 155 | /** |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 156 | * blk_queue_make_request - define an alternate make_request function for a device |
| 157 | * @q: the request queue for the device to be affected |
| 158 | * @mfn: the alternate make_request function |
| 159 | * |
| 160 | * Description: |
| 161 | * The normal way for &struct bios to be passed to a device |
| 162 | * driver is for them to be collected into requests on a request |
| 163 | * queue, and then to allow the device driver to select requests |
| 164 | * off that queue when it is ready. This works well for many block |
| 165 | * devices. However some block devices (typically virtual devices |
| 166 | * such as md or lvm) do not benefit from the processing on the |
| 167 | * request queue, and are served best by having the requests passed |
| 168 | * directly to them. This can be achieved by providing a function |
| 169 | * to blk_queue_make_request(). |
| 170 | * |
| 171 | * Caveat: |
| 172 | * The driver that does this *must* be able to deal appropriately |
| 173 | * with buffers in "highmemory". This can be accomplished by either calling |
| 174 | * __bio_kmap_atomic() to get a temporary kernel mapping, or by calling |
| 175 | * blk_queue_bounce() to create a buffer in normal memory. |
| 176 | **/ |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 177 | void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn) |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 178 | { |
| 179 | /* |
| 180 | * set defaults |
| 181 | */ |
| 182 | q->nr_requests = BLKDEV_MAX_RQ; |
Milan Broz | 0e435ac | 2008-12-03 12:55:08 +0100 | [diff] [blame] | 183 | |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 184 | q->make_request_fn = mfn; |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 185 | blk_queue_dma_alignment(q, 511); |
| 186 | blk_queue_congestion_threshold(q); |
| 187 | q->nr_batching = BLK_BATCH_REQ; |
| 188 | |
Martin K. Petersen | e475bba | 2009-06-16 08:23:52 +0200 | [diff] [blame] | 189 | blk_set_default_limits(&q->limits); |
| 190 | |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 191 | /* |
| 192 | * by default assume old behaviour and bounce for any highmem page |
| 193 | */ |
| 194 | blk_queue_bounce_limit(q, BLK_BOUNCE_HIGH); |
| 195 | } |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 196 | EXPORT_SYMBOL(blk_queue_make_request); |
| 197 | |
| 198 | /** |
| 199 | * blk_queue_bounce_limit - set bounce buffer limit for queue |
Tejun Heo | cd0aca2 | 2009-04-15 22:10:25 +0900 | [diff] [blame] | 200 | * @q: the request queue for the device |
Santosh Shilimkar | 9f7e45d | 2013-07-29 14:17:54 +0100 | [diff] [blame] | 201 | * @max_addr: the maximum address the device can handle |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 202 | * |
| 203 | * Description: |
| 204 | * Different hardware can have different requirements as to what pages |
| 205 | * it can do I/O directly to. A low level driver can call |
| 206 | * blk_queue_bounce_limit to have lower memory pages allocated as bounce |
Santosh Shilimkar | 9f7e45d | 2013-07-29 14:17:54 +0100 | [diff] [blame] | 207 | * buffers for doing I/O to pages residing above @max_addr. |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 208 | **/ |
Santosh Shilimkar | 9f7e45d | 2013-07-29 14:17:54 +0100 | [diff] [blame] | 209 | void blk_queue_bounce_limit(struct request_queue *q, u64 max_addr) |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 210 | { |
Santosh Shilimkar | 9f7e45d | 2013-07-29 14:17:54 +0100 | [diff] [blame] | 211 | unsigned long b_pfn = max_addr >> PAGE_SHIFT; |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 212 | int dma = 0; |
| 213 | |
| 214 | q->bounce_gfp = GFP_NOIO; |
| 215 | #if BITS_PER_LONG == 64 |
Tejun Heo | cd0aca2 | 2009-04-15 22:10:25 +0900 | [diff] [blame] | 216 | /* |
| 217 | * Assume anything <= 4GB can be handled by IOMMU. Actually |
| 218 | * some IOMMUs can handle everything, but I don't know of a |
| 219 | * way to test this here. |
| 220 | */ |
| 221 | if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT)) |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 222 | dma = 1; |
Malahal Naineni | efb012b | 2010-10-01 14:45:27 +0200 | [diff] [blame] | 223 | q->limits.bounce_pfn = max(max_low_pfn, b_pfn); |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 224 | #else |
Jens Axboe | 6728cb0 | 2008-01-31 13:03:55 +0100 | [diff] [blame] | 225 | if (b_pfn < blk_max_low_pfn) |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 226 | dma = 1; |
Malahal Naineni | c49825f | 2010-09-24 20:25:49 +0200 | [diff] [blame] | 227 | q->limits.bounce_pfn = b_pfn; |
Jens Axboe | 260a67a | 2010-10-01 14:42:43 +0200 | [diff] [blame] | 228 | #endif |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 229 | if (dma) { |
| 230 | init_emergency_isa_pool(); |
| 231 | q->bounce_gfp = GFP_NOIO | GFP_DMA; |
Jens Axboe | 260a67a | 2010-10-01 14:42:43 +0200 | [diff] [blame] | 232 | q->limits.bounce_pfn = b_pfn; |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 233 | } |
| 234 | } |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 235 | EXPORT_SYMBOL(blk_queue_bounce_limit); |
| 236 | |
| 237 | /** |
Mike Snitzer | 72d4cd9 | 2010-12-17 08:34:20 +0100 | [diff] [blame] | 238 | * blk_limits_max_hw_sectors - set hard and soft limit of max sectors for request |
| 239 | * @limits: the queue limits |
Martin K. Petersen | 2800aac | 2010-02-26 00:20:35 -0500 | [diff] [blame] | 240 | * @max_hw_sectors: max hardware sectors in the usual 512b unit |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 241 | * |
| 242 | * Description: |
Martin K. Petersen | 2800aac | 2010-02-26 00:20:35 -0500 | [diff] [blame] | 243 | * Enables a low level driver to set a hard upper limit, |
| 244 | * max_hw_sectors, on the size of requests. max_hw_sectors is set by |
| 245 | * the device driver based upon the combined capabilities of I/O |
| 246 | * controller and storage device. |
| 247 | * |
| 248 | * max_sectors is a soft limit imposed by the block layer for |
| 249 | * filesystem type requests. This value can be overridden on a |
| 250 | * per-device basis in /sys/block/<device>/queue/max_sectors_kb. |
| 251 | * The soft limit can not exceed max_hw_sectors. |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 252 | **/ |
Mike Snitzer | 72d4cd9 | 2010-12-17 08:34:20 +0100 | [diff] [blame] | 253 | void blk_limits_max_hw_sectors(struct queue_limits *limits, unsigned int max_hw_sectors) |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 254 | { |
Martin K. Petersen | 2800aac | 2010-02-26 00:20:35 -0500 | [diff] [blame] | 255 | if ((max_hw_sectors << 9) < PAGE_CACHE_SIZE) { |
| 256 | max_hw_sectors = 1 << (PAGE_CACHE_SHIFT - 9); |
Harvey Harrison | 24c03d4 | 2008-05-01 04:35:17 -0700 | [diff] [blame] | 257 | printk(KERN_INFO "%s: set to minimum %d\n", |
Martin K. Petersen | 2800aac | 2010-02-26 00:20:35 -0500 | [diff] [blame] | 258 | __func__, max_hw_sectors); |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 259 | } |
| 260 | |
Christoph Hellwig | 34b48db | 2014-09-06 16:08:05 -0700 | [diff] [blame] | 261 | limits->max_sectors = limits->max_hw_sectors = max_hw_sectors; |
Mike Snitzer | 72d4cd9 | 2010-12-17 08:34:20 +0100 | [diff] [blame] | 262 | } |
| 263 | EXPORT_SYMBOL(blk_limits_max_hw_sectors); |
| 264 | |
| 265 | /** |
| 266 | * blk_queue_max_hw_sectors - set max sectors for a request for this queue |
| 267 | * @q: the request queue for the device |
| 268 | * @max_hw_sectors: max hardware sectors in the usual 512b unit |
| 269 | * |
| 270 | * Description: |
| 271 | * See description for blk_limits_max_hw_sectors(). |
| 272 | **/ |
| 273 | void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors) |
| 274 | { |
| 275 | blk_limits_max_hw_sectors(&q->limits, max_hw_sectors); |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 276 | } |
Martin K. Petersen | 086fa5f | 2010-02-26 00:20:38 -0500 | [diff] [blame] | 277 | EXPORT_SYMBOL(blk_queue_max_hw_sectors); |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 278 | |
| 279 | /** |
Jens Axboe | 762380a | 2014-06-05 13:38:39 -0600 | [diff] [blame] | 280 | * blk_queue_chunk_sectors - set size of the chunk for this queue |
| 281 | * @q: the request queue for the device |
| 282 | * @chunk_sectors: chunk sectors in the usual 512b unit |
| 283 | * |
| 284 | * Description: |
| 285 | * If a driver doesn't want IOs to cross a given chunk size, it can set |
| 286 | * this limit and prevent merging across chunks. Note that the chunk size |
Jens Axboe | 58a4915 | 2014-06-10 12:53:56 -0600 | [diff] [blame] | 287 | * must currently be a power-of-2 in sectors. Also note that the block |
| 288 | * layer must accept a page worth of data at any offset. So if the |
| 289 | * crossing of chunks is a hard limitation in the driver, it must still be |
| 290 | * prepared to split single page bios. |
Jens Axboe | 762380a | 2014-06-05 13:38:39 -0600 | [diff] [blame] | 291 | **/ |
| 292 | void blk_queue_chunk_sectors(struct request_queue *q, unsigned int chunk_sectors) |
| 293 | { |
| 294 | BUG_ON(!is_power_of_2(chunk_sectors)); |
| 295 | q->limits.chunk_sectors = chunk_sectors; |
| 296 | } |
| 297 | EXPORT_SYMBOL(blk_queue_chunk_sectors); |
| 298 | |
| 299 | /** |
Christoph Hellwig | 67efc92 | 2009-09-30 13:54:20 +0200 | [diff] [blame] | 300 | * blk_queue_max_discard_sectors - set max sectors for a single discard |
| 301 | * @q: the request queue for the device |
Randy Dunlap | c7ebf06 | 2009-10-12 08:20:47 +0200 | [diff] [blame] | 302 | * @max_discard_sectors: maximum number of sectors to discard |
Christoph Hellwig | 67efc92 | 2009-09-30 13:54:20 +0200 | [diff] [blame] | 303 | **/ |
| 304 | void blk_queue_max_discard_sectors(struct request_queue *q, |
| 305 | unsigned int max_discard_sectors) |
| 306 | { |
Jens Axboe | 0034af0 | 2015-07-16 09:14:26 -0600 | [diff] [blame^] | 307 | q->limits.max_hw_discard_sectors = max_discard_sectors; |
Christoph Hellwig | 67efc92 | 2009-09-30 13:54:20 +0200 | [diff] [blame] | 308 | q->limits.max_discard_sectors = max_discard_sectors; |
| 309 | } |
| 310 | EXPORT_SYMBOL(blk_queue_max_discard_sectors); |
| 311 | |
| 312 | /** |
Martin K. Petersen | 4363ac7 | 2012-09-18 12:19:27 -0400 | [diff] [blame] | 313 | * blk_queue_max_write_same_sectors - set max sectors for a single write same |
| 314 | * @q: the request queue for the device |
| 315 | * @max_write_same_sectors: maximum number of sectors to write per command |
| 316 | **/ |
| 317 | void blk_queue_max_write_same_sectors(struct request_queue *q, |
| 318 | unsigned int max_write_same_sectors) |
| 319 | { |
| 320 | q->limits.max_write_same_sectors = max_write_same_sectors; |
| 321 | } |
| 322 | EXPORT_SYMBOL(blk_queue_max_write_same_sectors); |
| 323 | |
| 324 | /** |
Martin K. Petersen | 8a78362 | 2010-02-26 00:20:39 -0500 | [diff] [blame] | 325 | * blk_queue_max_segments - set max hw segments for a request for this queue |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 326 | * @q: the request queue for the device |
| 327 | * @max_segments: max number of segments |
| 328 | * |
| 329 | * Description: |
| 330 | * Enables a low level driver to set an upper limit on the number of |
Martin K. Petersen | 8a78362 | 2010-02-26 00:20:39 -0500 | [diff] [blame] | 331 | * hw data segments in a request. |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 332 | **/ |
Martin K. Petersen | 8a78362 | 2010-02-26 00:20:39 -0500 | [diff] [blame] | 333 | void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments) |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 334 | { |
| 335 | if (!max_segments) { |
| 336 | max_segments = 1; |
Harvey Harrison | 24c03d4 | 2008-05-01 04:35:17 -0700 | [diff] [blame] | 337 | printk(KERN_INFO "%s: set to minimum %d\n", |
| 338 | __func__, max_segments); |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 339 | } |
| 340 | |
Martin K. Petersen | 8a78362 | 2010-02-26 00:20:39 -0500 | [diff] [blame] | 341 | q->limits.max_segments = max_segments; |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 342 | } |
Martin K. Petersen | 8a78362 | 2010-02-26 00:20:39 -0500 | [diff] [blame] | 343 | EXPORT_SYMBOL(blk_queue_max_segments); |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 344 | |
| 345 | /** |
| 346 | * blk_queue_max_segment_size - set max segment size for blk_rq_map_sg |
| 347 | * @q: the request queue for the device |
| 348 | * @max_size: max size of segment in bytes |
| 349 | * |
| 350 | * Description: |
| 351 | * Enables a low level driver to set an upper limit on the size of a |
| 352 | * coalesced segment |
| 353 | **/ |
| 354 | void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size) |
| 355 | { |
| 356 | if (max_size < PAGE_CACHE_SIZE) { |
| 357 | max_size = PAGE_CACHE_SIZE; |
Harvey Harrison | 24c03d4 | 2008-05-01 04:35:17 -0700 | [diff] [blame] | 358 | printk(KERN_INFO "%s: set to minimum %d\n", |
| 359 | __func__, max_size); |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 360 | } |
| 361 | |
Martin K. Petersen | 025146e | 2009-05-22 17:17:51 -0400 | [diff] [blame] | 362 | q->limits.max_segment_size = max_size; |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 363 | } |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 364 | EXPORT_SYMBOL(blk_queue_max_segment_size); |
| 365 | |
| 366 | /** |
Martin K. Petersen | e1defc4 | 2009-05-22 17:17:49 -0400 | [diff] [blame] | 367 | * blk_queue_logical_block_size - set logical block size for the queue |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 368 | * @q: the request queue for the device |
Martin K. Petersen | e1defc4 | 2009-05-22 17:17:49 -0400 | [diff] [blame] | 369 | * @size: the logical block size, in bytes |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 370 | * |
| 371 | * Description: |
Martin K. Petersen | e1defc4 | 2009-05-22 17:17:49 -0400 | [diff] [blame] | 372 | * This should be set to the lowest possible block size that the |
| 373 | * storage device can address. The default of 512 covers most |
| 374 | * hardware. |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 375 | **/ |
Martin K. Petersen | e1defc4 | 2009-05-22 17:17:49 -0400 | [diff] [blame] | 376 | void blk_queue_logical_block_size(struct request_queue *q, unsigned short size) |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 377 | { |
Martin K. Petersen | 025146e | 2009-05-22 17:17:51 -0400 | [diff] [blame] | 378 | q->limits.logical_block_size = size; |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 379 | |
| 380 | if (q->limits.physical_block_size < size) |
| 381 | q->limits.physical_block_size = size; |
| 382 | |
| 383 | if (q->limits.io_min < q->limits.physical_block_size) |
| 384 | q->limits.io_min = q->limits.physical_block_size; |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 385 | } |
Martin K. Petersen | e1defc4 | 2009-05-22 17:17:49 -0400 | [diff] [blame] | 386 | EXPORT_SYMBOL(blk_queue_logical_block_size); |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 387 | |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 388 | /** |
| 389 | * blk_queue_physical_block_size - set physical block size for the queue |
| 390 | * @q: the request queue for the device |
| 391 | * @size: the physical block size, in bytes |
| 392 | * |
| 393 | * Description: |
| 394 | * This should be set to the lowest possible sector size that the |
| 395 | * hardware can operate on without reverting to read-modify-write |
| 396 | * operations. |
| 397 | */ |
Martin K. Petersen | 892b6f9 | 2010-10-13 21:18:03 +0200 | [diff] [blame] | 398 | void blk_queue_physical_block_size(struct request_queue *q, unsigned int size) |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 399 | { |
| 400 | q->limits.physical_block_size = size; |
| 401 | |
| 402 | if (q->limits.physical_block_size < q->limits.logical_block_size) |
| 403 | q->limits.physical_block_size = q->limits.logical_block_size; |
| 404 | |
| 405 | if (q->limits.io_min < q->limits.physical_block_size) |
| 406 | q->limits.io_min = q->limits.physical_block_size; |
| 407 | } |
| 408 | EXPORT_SYMBOL(blk_queue_physical_block_size); |
| 409 | |
| 410 | /** |
| 411 | * blk_queue_alignment_offset - set physical block alignment offset |
| 412 | * @q: the request queue for the device |
Randy Dunlap | 8ebf975 | 2009-06-11 20:00:41 -0700 | [diff] [blame] | 413 | * @offset: alignment offset in bytes |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 414 | * |
| 415 | * Description: |
| 416 | * Some devices are naturally misaligned to compensate for things like |
| 417 | * the legacy DOS partition table 63-sector offset. Low-level drivers |
| 418 | * should call this function for devices whose first sector is not |
| 419 | * naturally aligned. |
| 420 | */ |
| 421 | void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset) |
| 422 | { |
| 423 | q->limits.alignment_offset = |
| 424 | offset & (q->limits.physical_block_size - 1); |
| 425 | q->limits.misaligned = 0; |
| 426 | } |
| 427 | EXPORT_SYMBOL(blk_queue_alignment_offset); |
| 428 | |
| 429 | /** |
Martin K. Petersen | 7c958e3 | 2009-07-31 11:49:11 -0400 | [diff] [blame] | 430 | * blk_limits_io_min - set minimum request size for a device |
| 431 | * @limits: the queue limits |
| 432 | * @min: smallest I/O size in bytes |
| 433 | * |
| 434 | * Description: |
| 435 | * Some devices have an internal block size bigger than the reported |
| 436 | * hardware sector size. This function can be used to signal the |
| 437 | * smallest I/O the device can perform without incurring a performance |
| 438 | * penalty. |
| 439 | */ |
| 440 | void blk_limits_io_min(struct queue_limits *limits, unsigned int min) |
| 441 | { |
| 442 | limits->io_min = min; |
| 443 | |
| 444 | if (limits->io_min < limits->logical_block_size) |
| 445 | limits->io_min = limits->logical_block_size; |
| 446 | |
| 447 | if (limits->io_min < limits->physical_block_size) |
| 448 | limits->io_min = limits->physical_block_size; |
| 449 | } |
| 450 | EXPORT_SYMBOL(blk_limits_io_min); |
| 451 | |
| 452 | /** |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 453 | * blk_queue_io_min - set minimum request size for the queue |
| 454 | * @q: the request queue for the device |
Randy Dunlap | 8ebf975 | 2009-06-11 20:00:41 -0700 | [diff] [blame] | 455 | * @min: smallest I/O size in bytes |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 456 | * |
| 457 | * Description: |
Martin K. Petersen | 7e5f5fb | 2009-07-31 11:49:13 -0400 | [diff] [blame] | 458 | * Storage devices may report a granularity or preferred minimum I/O |
| 459 | * size which is the smallest request the device can perform without |
| 460 | * incurring a performance penalty. For disk drives this is often the |
| 461 | * physical block size. For RAID arrays it is often the stripe chunk |
| 462 | * size. A properly aligned multiple of minimum_io_size is the |
| 463 | * preferred request size for workloads where a high number of I/O |
| 464 | * operations is desired. |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 465 | */ |
| 466 | void blk_queue_io_min(struct request_queue *q, unsigned int min) |
| 467 | { |
Martin K. Petersen | 7c958e3 | 2009-07-31 11:49:11 -0400 | [diff] [blame] | 468 | blk_limits_io_min(&q->limits, min); |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 469 | } |
| 470 | EXPORT_SYMBOL(blk_queue_io_min); |
| 471 | |
| 472 | /** |
Martin K. Petersen | 3c5820c | 2009-09-11 21:54:52 +0200 | [diff] [blame] | 473 | * blk_limits_io_opt - set optimal request size for a device |
| 474 | * @limits: the queue limits |
| 475 | * @opt: smallest I/O size in bytes |
| 476 | * |
| 477 | * Description: |
| 478 | * Storage devices may report an optimal I/O size, which is the |
| 479 | * device's preferred unit for sustained I/O. This is rarely reported |
| 480 | * for disk drives. For RAID arrays it is usually the stripe width or |
| 481 | * the internal track size. A properly aligned multiple of |
| 482 | * optimal_io_size is the preferred request size for workloads where |
| 483 | * sustained throughput is desired. |
| 484 | */ |
| 485 | void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt) |
| 486 | { |
| 487 | limits->io_opt = opt; |
| 488 | } |
| 489 | EXPORT_SYMBOL(blk_limits_io_opt); |
| 490 | |
| 491 | /** |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 492 | * blk_queue_io_opt - set optimal request size for the queue |
| 493 | * @q: the request queue for the device |
Randy Dunlap | 8ebf975 | 2009-06-11 20:00:41 -0700 | [diff] [blame] | 494 | * @opt: optimal request size in bytes |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 495 | * |
| 496 | * Description: |
Martin K. Petersen | 7e5f5fb | 2009-07-31 11:49:13 -0400 | [diff] [blame] | 497 | * Storage devices may report an optimal I/O size, which is the |
| 498 | * device's preferred unit for sustained I/O. This is rarely reported |
| 499 | * for disk drives. For RAID arrays it is usually the stripe width or |
| 500 | * the internal track size. A properly aligned multiple of |
| 501 | * optimal_io_size is the preferred request size for workloads where |
| 502 | * sustained throughput is desired. |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 503 | */ |
| 504 | void blk_queue_io_opt(struct request_queue *q, unsigned int opt) |
| 505 | { |
Martin K. Petersen | 3c5820c | 2009-09-11 21:54:52 +0200 | [diff] [blame] | 506 | blk_limits_io_opt(&q->limits, opt); |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 507 | } |
| 508 | EXPORT_SYMBOL(blk_queue_io_opt); |
| 509 | |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 510 | /** |
| 511 | * blk_queue_stack_limits - inherit underlying queue limits for stacked drivers |
| 512 | * @t: the stacking driver (top) |
| 513 | * @b: the underlying device (bottom) |
| 514 | **/ |
| 515 | void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b) |
| 516 | { |
Martin K. Petersen | fef2466 | 2009-07-31 11:49:10 -0400 | [diff] [blame] | 517 | blk_stack_limits(&t->limits, &b->limits, 0); |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 518 | } |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 519 | EXPORT_SYMBOL(blk_queue_stack_limits); |
| 520 | |
| 521 | /** |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 522 | * blk_stack_limits - adjust queue_limits for stacked devices |
Martin K. Petersen | 81744ee | 2009-12-29 08:35:35 +0100 | [diff] [blame] | 523 | * @t: the stacking driver limits (top device) |
| 524 | * @b: the underlying queue limits (bottom, component device) |
Martin K. Petersen | e03a72e | 2010-01-11 03:21:51 -0500 | [diff] [blame] | 525 | * @start: first data sector within component device |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 526 | * |
| 527 | * Description: |
Martin K. Petersen | 81744ee | 2009-12-29 08:35:35 +0100 | [diff] [blame] | 528 | * This function is used by stacking drivers like MD and DM to ensure |
| 529 | * that all component devices have compatible block sizes and |
| 530 | * alignments. The stacking driver must provide a queue_limits |
| 531 | * struct (top) and then iteratively call the stacking function for |
| 532 | * all component (bottom) devices. The stacking function will |
| 533 | * attempt to combine the values and ensure proper alignment. |
| 534 | * |
| 535 | * Returns 0 if the top and bottom queue_limits are compatible. The |
| 536 | * top device's block sizes and alignment offsets may be adjusted to |
| 537 | * ensure alignment with the bottom device. If no compatible sizes |
| 538 | * and alignments exist, -1 is returned and the resulting top |
| 539 | * queue_limits will have the misaligned flag set to indicate that |
| 540 | * the alignment_offset is undefined. |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 541 | */ |
| 542 | int blk_stack_limits(struct queue_limits *t, struct queue_limits *b, |
Martin K. Petersen | e03a72e | 2010-01-11 03:21:51 -0500 | [diff] [blame] | 543 | sector_t start) |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 544 | { |
Martin K. Petersen | e03a72e | 2010-01-11 03:21:51 -0500 | [diff] [blame] | 545 | unsigned int top, bottom, alignment, ret = 0; |
Martin K. Petersen | 86b3728 | 2009-11-10 11:50:21 +0100 | [diff] [blame] | 546 | |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 547 | t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors); |
| 548 | t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors); |
Martin K. Petersen | 4363ac7 | 2012-09-18 12:19:27 -0400 | [diff] [blame] | 549 | t->max_write_same_sectors = min(t->max_write_same_sectors, |
| 550 | b->max_write_same_sectors); |
Martin K. Petersen | 77634f3 | 2009-06-09 06:23:22 +0200 | [diff] [blame] | 551 | t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn); |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 552 | |
| 553 | t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask, |
| 554 | b->seg_boundary_mask); |
| 555 | |
Martin K. Petersen | 8a78362 | 2010-02-26 00:20:39 -0500 | [diff] [blame] | 556 | t->max_segments = min_not_zero(t->max_segments, b->max_segments); |
Martin K. Petersen | 13f05c8 | 2010-09-10 20:50:10 +0200 | [diff] [blame] | 557 | t->max_integrity_segments = min_not_zero(t->max_integrity_segments, |
| 558 | b->max_integrity_segments); |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 559 | |
| 560 | t->max_segment_size = min_not_zero(t->max_segment_size, |
| 561 | b->max_segment_size); |
| 562 | |
Martin K. Petersen | fe0b393 | 2010-01-11 03:21:47 -0500 | [diff] [blame] | 563 | t->misaligned |= b->misaligned; |
| 564 | |
Martin K. Petersen | e03a72e | 2010-01-11 03:21:51 -0500 | [diff] [blame] | 565 | alignment = queue_limit_alignment_offset(b, start); |
Martin K. Petersen | 9504e08 | 2009-12-21 15:55:51 +0100 | [diff] [blame] | 566 | |
Martin K. Petersen | 81744ee | 2009-12-29 08:35:35 +0100 | [diff] [blame] | 567 | /* Bottom device has different alignment. Check that it is |
| 568 | * compatible with the current top alignment. |
| 569 | */ |
Martin K. Petersen | 9504e08 | 2009-12-21 15:55:51 +0100 | [diff] [blame] | 570 | if (t->alignment_offset != alignment) { |
| 571 | |
| 572 | top = max(t->physical_block_size, t->io_min) |
| 573 | + t->alignment_offset; |
Martin K. Petersen | 81744ee | 2009-12-29 08:35:35 +0100 | [diff] [blame] | 574 | bottom = max(b->physical_block_size, b->io_min) + alignment; |
Martin K. Petersen | 9504e08 | 2009-12-21 15:55:51 +0100 | [diff] [blame] | 575 | |
Martin K. Petersen | 81744ee | 2009-12-29 08:35:35 +0100 | [diff] [blame] | 576 | /* Verify that top and bottom intervals line up */ |
Mike Snitzer | b8839b8 | 2014-10-08 18:26:13 -0400 | [diff] [blame] | 577 | if (max(top, bottom) % min(top, bottom)) { |
Martin K. Petersen | 9504e08 | 2009-12-21 15:55:51 +0100 | [diff] [blame] | 578 | t->misaligned = 1; |
Martin K. Petersen | fe0b393 | 2010-01-11 03:21:47 -0500 | [diff] [blame] | 579 | ret = -1; |
| 580 | } |
Martin K. Petersen | 9504e08 | 2009-12-21 15:55:51 +0100 | [diff] [blame] | 581 | } |
| 582 | |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 583 | t->logical_block_size = max(t->logical_block_size, |
| 584 | b->logical_block_size); |
| 585 | |
| 586 | t->physical_block_size = max(t->physical_block_size, |
| 587 | b->physical_block_size); |
| 588 | |
| 589 | t->io_min = max(t->io_min, b->io_min); |
Mike Snitzer | e963741 | 2015-03-30 13:39:09 -0400 | [diff] [blame] | 590 | t->io_opt = lcm_not_zero(t->io_opt, b->io_opt); |
Martin K. Petersen | 9504e08 | 2009-12-21 15:55:51 +0100 | [diff] [blame] | 591 | |
Martin K. Petersen | e692cb6 | 2010-12-01 19:41:49 +0100 | [diff] [blame] | 592 | t->cluster &= b->cluster; |
Martin K. Petersen | 98262f2 | 2009-12-03 09:24:48 +0100 | [diff] [blame] | 593 | t->discard_zeroes_data &= b->discard_zeroes_data; |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 594 | |
Martin K. Petersen | 81744ee | 2009-12-29 08:35:35 +0100 | [diff] [blame] | 595 | /* Physical block size a multiple of the logical block size? */ |
Martin K. Petersen | 9504e08 | 2009-12-21 15:55:51 +0100 | [diff] [blame] | 596 | if (t->physical_block_size & (t->logical_block_size - 1)) { |
| 597 | t->physical_block_size = t->logical_block_size; |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 598 | t->misaligned = 1; |
Martin K. Petersen | fe0b393 | 2010-01-11 03:21:47 -0500 | [diff] [blame] | 599 | ret = -1; |
Martin K. Petersen | 86b3728 | 2009-11-10 11:50:21 +0100 | [diff] [blame] | 600 | } |
| 601 | |
Martin K. Petersen | 81744ee | 2009-12-29 08:35:35 +0100 | [diff] [blame] | 602 | /* Minimum I/O a multiple of the physical block size? */ |
Martin K. Petersen | 9504e08 | 2009-12-21 15:55:51 +0100 | [diff] [blame] | 603 | if (t->io_min & (t->physical_block_size - 1)) { |
| 604 | t->io_min = t->physical_block_size; |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 605 | t->misaligned = 1; |
Martin K. Petersen | fe0b393 | 2010-01-11 03:21:47 -0500 | [diff] [blame] | 606 | ret = -1; |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 607 | } |
| 608 | |
Martin K. Petersen | 81744ee | 2009-12-29 08:35:35 +0100 | [diff] [blame] | 609 | /* Optimal I/O a multiple of the physical block size? */ |
Martin K. Petersen | 9504e08 | 2009-12-21 15:55:51 +0100 | [diff] [blame] | 610 | if (t->io_opt & (t->physical_block_size - 1)) { |
| 611 | t->io_opt = 0; |
| 612 | t->misaligned = 1; |
Martin K. Petersen | fe0b393 | 2010-01-11 03:21:47 -0500 | [diff] [blame] | 613 | ret = -1; |
Martin K. Petersen | 9504e08 | 2009-12-21 15:55:51 +0100 | [diff] [blame] | 614 | } |
Martin K. Petersen | 70dd5bf | 2009-07-31 11:49:12 -0400 | [diff] [blame] | 615 | |
Kent Overstreet | c78afc6 | 2013-07-11 22:39:53 -0700 | [diff] [blame] | 616 | t->raid_partial_stripes_expensive = |
| 617 | max(t->raid_partial_stripes_expensive, |
| 618 | b->raid_partial_stripes_expensive); |
| 619 | |
Martin K. Petersen | 81744ee | 2009-12-29 08:35:35 +0100 | [diff] [blame] | 620 | /* Find lowest common alignment_offset */ |
Mike Snitzer | e963741 | 2015-03-30 13:39:09 -0400 | [diff] [blame] | 621 | t->alignment_offset = lcm_not_zero(t->alignment_offset, alignment) |
Mike Snitzer | b8839b8 | 2014-10-08 18:26:13 -0400 | [diff] [blame] | 622 | % max(t->physical_block_size, t->io_min); |
Martin K. Petersen | 70dd5bf | 2009-07-31 11:49:12 -0400 | [diff] [blame] | 623 | |
Martin K. Petersen | 81744ee | 2009-12-29 08:35:35 +0100 | [diff] [blame] | 624 | /* Verify that new alignment_offset is on a logical block boundary */ |
Martin K. Petersen | fe0b393 | 2010-01-11 03:21:47 -0500 | [diff] [blame] | 625 | if (t->alignment_offset & (t->logical_block_size - 1)) { |
Martin K. Petersen | 9504e08 | 2009-12-21 15:55:51 +0100 | [diff] [blame] | 626 | t->misaligned = 1; |
Martin K. Petersen | fe0b393 | 2010-01-11 03:21:47 -0500 | [diff] [blame] | 627 | ret = -1; |
| 628 | } |
Martin K. Petersen | 9504e08 | 2009-12-21 15:55:51 +0100 | [diff] [blame] | 629 | |
| 630 | /* Discard alignment and granularity */ |
| 631 | if (b->discard_granularity) { |
Martin K. Petersen | e03a72e | 2010-01-11 03:21:51 -0500 | [diff] [blame] | 632 | alignment = queue_limit_discard_alignment(b, start); |
Martin K. Petersen | 9504e08 | 2009-12-21 15:55:51 +0100 | [diff] [blame] | 633 | |
| 634 | if (t->discard_granularity != 0 && |
| 635 | t->discard_alignment != alignment) { |
| 636 | top = t->discard_granularity + t->discard_alignment; |
| 637 | bottom = b->discard_granularity + alignment; |
| 638 | |
| 639 | /* Verify that top and bottom intervals line up */ |
Shaohua Li | 8dd2cb7 | 2012-12-14 11:15:36 +0800 | [diff] [blame] | 640 | if ((max(top, bottom) % min(top, bottom)) != 0) |
Martin K. Petersen | 9504e08 | 2009-12-21 15:55:51 +0100 | [diff] [blame] | 641 | t->discard_misaligned = 1; |
| 642 | } |
| 643 | |
Martin K. Petersen | 81744ee | 2009-12-29 08:35:35 +0100 | [diff] [blame] | 644 | t->max_discard_sectors = min_not_zero(t->max_discard_sectors, |
| 645 | b->max_discard_sectors); |
Jens Axboe | 0034af0 | 2015-07-16 09:14:26 -0600 | [diff] [blame^] | 646 | t->max_hw_discard_sectors = min_not_zero(t->max_hw_discard_sectors, |
| 647 | b->max_hw_discard_sectors); |
Martin K. Petersen | 9504e08 | 2009-12-21 15:55:51 +0100 | [diff] [blame] | 648 | t->discard_granularity = max(t->discard_granularity, |
| 649 | b->discard_granularity); |
Mike Snitzer | e963741 | 2015-03-30 13:39:09 -0400 | [diff] [blame] | 650 | t->discard_alignment = lcm_not_zero(t->discard_alignment, alignment) % |
Shaohua Li | 8dd2cb7 | 2012-12-14 11:15:36 +0800 | [diff] [blame] | 651 | t->discard_granularity; |
Martin K. Petersen | 9504e08 | 2009-12-21 15:55:51 +0100 | [diff] [blame] | 652 | } |
| 653 | |
Martin K. Petersen | fe0b393 | 2010-01-11 03:21:47 -0500 | [diff] [blame] | 654 | return ret; |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 655 | } |
Mike Snitzer | 5d85d32 | 2009-05-28 11:04:53 +0200 | [diff] [blame] | 656 | EXPORT_SYMBOL(blk_stack_limits); |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 657 | |
| 658 | /** |
Martin K. Petersen | 17be8c2 | 2010-01-11 03:21:49 -0500 | [diff] [blame] | 659 | * bdev_stack_limits - adjust queue limits for stacked drivers |
| 660 | * @t: the stacking driver limits (top device) |
| 661 | * @bdev: the component block_device (bottom) |
| 662 | * @start: first data sector within component device |
| 663 | * |
| 664 | * Description: |
| 665 | * Merges queue limits for a top device and a block_device. Returns |
| 666 | * 0 if alignment didn't change. Returns -1 if adding the bottom |
| 667 | * device caused misalignment. |
| 668 | */ |
| 669 | int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev, |
| 670 | sector_t start) |
| 671 | { |
| 672 | struct request_queue *bq = bdev_get_queue(bdev); |
| 673 | |
| 674 | start += get_start_sect(bdev); |
| 675 | |
Martin K. Petersen | e03a72e | 2010-01-11 03:21:51 -0500 | [diff] [blame] | 676 | return blk_stack_limits(t, &bq->limits, start); |
Martin K. Petersen | 17be8c2 | 2010-01-11 03:21:49 -0500 | [diff] [blame] | 677 | } |
| 678 | EXPORT_SYMBOL(bdev_stack_limits); |
| 679 | |
| 680 | /** |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 681 | * disk_stack_limits - adjust queue limits for stacked drivers |
Martin K. Petersen | 77634f3 | 2009-06-09 06:23:22 +0200 | [diff] [blame] | 682 | * @disk: MD/DM gendisk (top) |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 683 | * @bdev: the underlying block device (bottom) |
| 684 | * @offset: offset to beginning of data within component device |
| 685 | * |
| 686 | * Description: |
Martin K. Petersen | e03a72e | 2010-01-11 03:21:51 -0500 | [diff] [blame] | 687 | * Merges the limits for a top level gendisk and a bottom level |
| 688 | * block_device. |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 689 | */ |
| 690 | void disk_stack_limits(struct gendisk *disk, struct block_device *bdev, |
| 691 | sector_t offset) |
| 692 | { |
| 693 | struct request_queue *t = disk->queue; |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 694 | |
Martin K. Petersen | e03a72e | 2010-01-11 03:21:51 -0500 | [diff] [blame] | 695 | if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) { |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 696 | char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE]; |
| 697 | |
| 698 | disk_name(disk, 0, top); |
| 699 | bdevname(bdev, bottom); |
| 700 | |
| 701 | printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n", |
| 702 | top, bottom); |
| 703 | } |
Martin K. Petersen | c72758f | 2009-05-22 17:17:53 -0400 | [diff] [blame] | 704 | } |
| 705 | EXPORT_SYMBOL(disk_stack_limits); |
| 706 | |
| 707 | /** |
Tejun Heo | e3790c7 | 2008-03-04 11:18:17 +0100 | [diff] [blame] | 708 | * blk_queue_dma_pad - set pad mask |
| 709 | * @q: the request queue for the device |
| 710 | * @mask: pad mask |
| 711 | * |
FUJITA Tomonori | 27f8221 | 2008-07-04 09:30:03 +0200 | [diff] [blame] | 712 | * Set dma pad mask. |
Tejun Heo | e3790c7 | 2008-03-04 11:18:17 +0100 | [diff] [blame] | 713 | * |
FUJITA Tomonori | 27f8221 | 2008-07-04 09:30:03 +0200 | [diff] [blame] | 714 | * Appending pad buffer to a request modifies the last entry of a |
| 715 | * scatter list such that it includes the pad buffer. |
Tejun Heo | e3790c7 | 2008-03-04 11:18:17 +0100 | [diff] [blame] | 716 | **/ |
| 717 | void blk_queue_dma_pad(struct request_queue *q, unsigned int mask) |
| 718 | { |
| 719 | q->dma_pad_mask = mask; |
| 720 | } |
| 721 | EXPORT_SYMBOL(blk_queue_dma_pad); |
| 722 | |
| 723 | /** |
FUJITA Tomonori | 27f8221 | 2008-07-04 09:30:03 +0200 | [diff] [blame] | 724 | * blk_queue_update_dma_pad - update pad mask |
| 725 | * @q: the request queue for the device |
| 726 | * @mask: pad mask |
| 727 | * |
| 728 | * Update dma pad mask. |
| 729 | * |
| 730 | * Appending pad buffer to a request modifies the last entry of a |
| 731 | * scatter list such that it includes the pad buffer. |
| 732 | **/ |
| 733 | void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask) |
| 734 | { |
| 735 | if (mask > q->dma_pad_mask) |
| 736 | q->dma_pad_mask = mask; |
| 737 | } |
| 738 | EXPORT_SYMBOL(blk_queue_update_dma_pad); |
| 739 | |
| 740 | /** |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 741 | * blk_queue_dma_drain - Set up a drain buffer for excess dma. |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 742 | * @q: the request queue for the device |
Tejun Heo | 2fb98e8 | 2008-02-19 11:36:53 +0100 | [diff] [blame] | 743 | * @dma_drain_needed: fn which returns non-zero if drain is necessary |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 744 | * @buf: physically contiguous buffer |
| 745 | * @size: size of the buffer in bytes |
| 746 | * |
| 747 | * Some devices have excess DMA problems and can't simply discard (or |
| 748 | * zero fill) the unwanted piece of the transfer. They have to have a |
| 749 | * real area of memory to transfer it into. The use case for this is |
| 750 | * ATAPI devices in DMA mode. If the packet command causes a transfer |
| 751 | * bigger than the transfer size some HBAs will lock up if there |
| 752 | * aren't DMA elements to contain the excess transfer. What this API |
| 753 | * does is adjust the queue so that the buf is always appended |
| 754 | * silently to the scatterlist. |
| 755 | * |
Martin K. Petersen | 8a78362 | 2010-02-26 00:20:39 -0500 | [diff] [blame] | 756 | * Note: This routine adjusts max_hw_segments to make room for appending |
| 757 | * the drain buffer. If you call blk_queue_max_segments() after calling |
| 758 | * this routine, you must set the limit to one fewer than your device |
| 759 | * can support otherwise there won't be room for the drain buffer. |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 760 | */ |
Harvey Harrison | 448da4d | 2008-03-04 11:30:18 +0100 | [diff] [blame] | 761 | int blk_queue_dma_drain(struct request_queue *q, |
Tejun Heo | 2fb98e8 | 2008-02-19 11:36:53 +0100 | [diff] [blame] | 762 | dma_drain_needed_fn *dma_drain_needed, |
| 763 | void *buf, unsigned int size) |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 764 | { |
Martin K. Petersen | 8a78362 | 2010-02-26 00:20:39 -0500 | [diff] [blame] | 765 | if (queue_max_segments(q) < 2) |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 766 | return -EINVAL; |
| 767 | /* make room for appending the drain */ |
Martin K. Petersen | 8a78362 | 2010-02-26 00:20:39 -0500 | [diff] [blame] | 768 | blk_queue_max_segments(q, queue_max_segments(q) - 1); |
Tejun Heo | 2fb98e8 | 2008-02-19 11:36:53 +0100 | [diff] [blame] | 769 | q->dma_drain_needed = dma_drain_needed; |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 770 | q->dma_drain_buffer = buf; |
| 771 | q->dma_drain_size = size; |
| 772 | |
| 773 | return 0; |
| 774 | } |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 775 | EXPORT_SYMBOL_GPL(blk_queue_dma_drain); |
| 776 | |
| 777 | /** |
| 778 | * blk_queue_segment_boundary - set boundary rules for segment merging |
| 779 | * @q: the request queue for the device |
| 780 | * @mask: the memory boundary mask |
| 781 | **/ |
| 782 | void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask) |
| 783 | { |
| 784 | if (mask < PAGE_CACHE_SIZE - 1) { |
| 785 | mask = PAGE_CACHE_SIZE - 1; |
Harvey Harrison | 24c03d4 | 2008-05-01 04:35:17 -0700 | [diff] [blame] | 786 | printk(KERN_INFO "%s: set to minimum %lx\n", |
| 787 | __func__, mask); |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 788 | } |
| 789 | |
Martin K. Petersen | 025146e | 2009-05-22 17:17:51 -0400 | [diff] [blame] | 790 | q->limits.seg_boundary_mask = mask; |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 791 | } |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 792 | EXPORT_SYMBOL(blk_queue_segment_boundary); |
| 793 | |
| 794 | /** |
| 795 | * blk_queue_dma_alignment - set dma length and memory alignment |
| 796 | * @q: the request queue for the device |
| 797 | * @mask: alignment mask |
| 798 | * |
| 799 | * description: |
Randy Dunlap | 710027a | 2008-08-19 20:13:11 +0200 | [diff] [blame] | 800 | * set required memory and length alignment for direct dma transactions. |
Alan Cox | 8feb4d2 | 2009-04-01 15:01:39 +0100 | [diff] [blame] | 801 | * this is used when building direct io requests for the queue. |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 802 | * |
| 803 | **/ |
| 804 | void blk_queue_dma_alignment(struct request_queue *q, int mask) |
| 805 | { |
| 806 | q->dma_alignment = mask; |
| 807 | } |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 808 | EXPORT_SYMBOL(blk_queue_dma_alignment); |
| 809 | |
| 810 | /** |
| 811 | * blk_queue_update_dma_alignment - update dma length and memory alignment |
| 812 | * @q: the request queue for the device |
| 813 | * @mask: alignment mask |
| 814 | * |
| 815 | * description: |
Randy Dunlap | 710027a | 2008-08-19 20:13:11 +0200 | [diff] [blame] | 816 | * update required memory and length alignment for direct dma transactions. |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 817 | * If the requested alignment is larger than the current alignment, then |
| 818 | * the current queue alignment is updated to the new value, otherwise it |
| 819 | * is left alone. The design of this is to allow multiple objects |
| 820 | * (driver, device, transport etc) to set their respective |
| 821 | * alignments without having them interfere. |
| 822 | * |
| 823 | **/ |
| 824 | void blk_queue_update_dma_alignment(struct request_queue *q, int mask) |
| 825 | { |
| 826 | BUG_ON(mask > PAGE_SIZE); |
| 827 | |
| 828 | if (mask > q->dma_alignment) |
| 829 | q->dma_alignment = mask; |
| 830 | } |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 831 | EXPORT_SYMBOL(blk_queue_update_dma_alignment); |
| 832 | |
Tejun Heo | 4913efe | 2010-09-03 11:56:16 +0200 | [diff] [blame] | 833 | /** |
| 834 | * blk_queue_flush - configure queue's cache flush capability |
| 835 | * @q: the request queue for the device |
| 836 | * @flush: 0, REQ_FLUSH or REQ_FLUSH | REQ_FUA |
| 837 | * |
| 838 | * Tell block layer cache flush capability of @q. If it supports |
| 839 | * flushing, REQ_FLUSH should be set. If it supports bypassing |
| 840 | * write cache for individual writes, REQ_FUA should be set. |
| 841 | */ |
| 842 | void blk_queue_flush(struct request_queue *q, unsigned int flush) |
| 843 | { |
| 844 | WARN_ON_ONCE(flush & ~(REQ_FLUSH | REQ_FUA)); |
| 845 | |
| 846 | if (WARN_ON_ONCE(!(flush & REQ_FLUSH) && (flush & REQ_FUA))) |
| 847 | flush &= ~REQ_FUA; |
| 848 | |
| 849 | q->flush_flags = flush & (REQ_FLUSH | REQ_FUA); |
| 850 | } |
| 851 | EXPORT_SYMBOL_GPL(blk_queue_flush); |
| 852 | |
shaohua.li@intel.com | f387693 | 2011-05-06 11:34:32 -0600 | [diff] [blame] | 853 | void blk_queue_flush_queueable(struct request_queue *q, bool queueable) |
| 854 | { |
| 855 | q->flush_not_queueable = !queueable; |
| 856 | } |
| 857 | EXPORT_SYMBOL_GPL(blk_queue_flush_queueable); |
| 858 | |
Harvey Harrison | aeb3d3a | 2008-08-28 09:27:42 +0200 | [diff] [blame] | 859 | static int __init blk_settings_init(void) |
Jens Axboe | 86db1e2 | 2008-01-29 14:53:40 +0100 | [diff] [blame] | 860 | { |
| 861 | blk_max_low_pfn = max_low_pfn - 1; |
| 862 | blk_max_pfn = max_pfn - 1; |
| 863 | return 0; |
| 864 | } |
| 865 | subsys_initcall(blk_settings_init); |