Linux Kernel  3.7.1
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
blk-settings.c
Go to the documentation of this file.
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 */
10 #include <linux/gcd.h>
11 #include <linux/lcm.h>
12 #include <linux/jiffies.h>
13 #include <linux/gfp.h>
14 
15 #include "blk.h"
16 
17 unsigned long blk_max_low_pfn;
19 
20 unsigned long blk_max_pfn;
21 
33 void blk_queue_prep_rq(struct request_queue *q, prep_rq_fn *pfn)
34 {
35  q->prep_rq_fn = pfn;
36 }
38 
50 void blk_queue_unprep_rq(struct request_queue *q, unprep_rq_fn *ufn)
51 {
52  q->unprep_rq_fn = ufn;
53 }
55 
72 void blk_queue_merge_bvec(struct request_queue *q, merge_bvec_fn *mbfn)
73 {
74  q->merge_bvec_fn = mbfn;
75 }
77 
78 void blk_queue_softirq_done(struct request_queue *q, softirq_done_fn *fn)
79 {
80  q->softirq_done_fn = fn;
81 }
83 
84 void blk_queue_rq_timeout(struct request_queue *q, unsigned int timeout)
85 {
86  q->rq_timeout = timeout;
87 }
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 }
95 
96 void blk_queue_lld_busy(struct request_queue *q, lld_busy_fn *fn)
97 {
98  q->lld_busy_fn = fn;
99 }
101 
109 void blk_set_default_limits(struct queue_limits *lim)
110 {
111  lim->max_segments = BLK_MAX_SEGMENTS;
112  lim->max_integrity_segments = 0;
113  lim->seg_boundary_mask = BLK_SEG_BOUNDARY_MASK;
114  lim->max_segment_size = BLK_MAX_SEGMENT_SIZE;
115  lim->max_sectors = lim->max_hw_sectors = BLK_SAFE_MAX_SECTORS;
116  lim->max_write_same_sectors = 0;
117  lim->max_discard_sectors = 0;
118  lim->discard_granularity = 0;
119  lim->discard_alignment = 0;
120  lim->discard_misaligned = 0;
121  lim->discard_zeroes_data = 0;
122  lim->logical_block_size = lim->physical_block_size = lim->io_min = 512;
123  lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT);
124  lim->alignment_offset = 0;
125  lim->io_opt = 0;
126  lim->misaligned = 0;
127  lim->cluster = 1;
128 }
130 
139 void blk_set_stacking_limits(struct queue_limits *lim)
140 {
142 
143  /* Inherit limits from component devices */
144  lim->discard_zeroes_data = 1;
145  lim->max_segments = USHRT_MAX;
146  lim->max_hw_sectors = UINT_MAX;
147  lim->max_sectors = UINT_MAX;
148  lim->max_write_same_sectors = UINT_MAX;
149 }
151 
174 void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
175 {
176  /*
177  * set defaults
178  */
179  q->nr_requests = BLKDEV_MAX_RQ;
180 
181  q->make_request_fn = mfn;
182  blk_queue_dma_alignment(q, 511);
184  q->nr_batching = BLK_BATCH_REQ;
185 
186  blk_set_default_limits(&q->limits);
187 
188  /*
189  * by default assume old behaviour and bounce for any highmem page
190  */
191  blk_queue_bounce_limit(q, BLK_BOUNCE_HIGH);
192 }
194 
206 void blk_queue_bounce_limit(struct request_queue *q, u64 dma_mask)
207 {
208  unsigned long b_pfn = dma_mask >> PAGE_SHIFT;
209  int dma = 0;
210 
211  q->bounce_gfp = GFP_NOIO;
212 #if BITS_PER_LONG == 64
213  /*
214  * Assume anything <= 4GB can be handled by IOMMU. Actually
215  * some IOMMUs can handle everything, but I don't know of a
216  * way to test this here.
217  */
218  if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
219  dma = 1;
220  q->limits.bounce_pfn = max(max_low_pfn, b_pfn);
221 #else
222  if (b_pfn < blk_max_low_pfn)
223  dma = 1;
224  q->limits.bounce_pfn = b_pfn;
225 #endif
226  if (dma) {
228  q->bounce_gfp = GFP_NOIO | GFP_DMA;
229  q->limits.bounce_pfn = b_pfn;
230  }
231 }
233 
250 void blk_limits_max_hw_sectors(struct queue_limits *limits, unsigned int max_hw_sectors)
251 {
252  if ((max_hw_sectors << 9) < PAGE_CACHE_SIZE) {
253  max_hw_sectors = 1 << (PAGE_CACHE_SHIFT - 9);
254  printk(KERN_INFO "%s: set to minimum %d\n",
255  __func__, max_hw_sectors);
256  }
257 
258  limits->max_hw_sectors = max_hw_sectors;
259  limits->max_sectors = min_t(unsigned int, max_hw_sectors,
260  BLK_DEF_MAX_SECTORS);
261 }
263 
272 void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors)
273 {
274  blk_limits_max_hw_sectors(&q->limits, max_hw_sectors);
275 }
277 
284  unsigned int max_discard_sectors)
285 {
286  q->limits.max_discard_sectors = max_discard_sectors;
287 }
289 
296  unsigned int max_write_same_sectors)
297 {
298  q->limits.max_write_same_sectors = max_write_same_sectors;
299 }
301 
311 void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments)
312 {
313  if (!max_segments) {
314  max_segments = 1;
315  printk(KERN_INFO "%s: set to minimum %d\n",
316  __func__, max_segments);
317  }
318 
319  q->limits.max_segments = max_segments;
320 }
322 
333 {
334  if (max_size < PAGE_CACHE_SIZE) {
335  max_size = PAGE_CACHE_SIZE;
336  printk(KERN_INFO "%s: set to minimum %d\n",
337  __func__, max_size);
338  }
339 
340  q->limits.max_segment_size = max_size;
341 }
343 
354 void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
355 {
356  q->limits.logical_block_size = size;
357 
358  if (q->limits.physical_block_size < size)
359  q->limits.physical_block_size = size;
360 
361  if (q->limits.io_min < q->limits.physical_block_size)
362  q->limits.io_min = q->limits.physical_block_size;
363 }
365 
377 {
378  q->limits.physical_block_size = size;
379 
380  if (q->limits.physical_block_size < q->limits.logical_block_size)
381  q->limits.physical_block_size = q->limits.logical_block_size;
382 
383  if (q->limits.io_min < q->limits.physical_block_size)
384  q->limits.io_min = q->limits.physical_block_size;
385 }
387 
400 {
401  q->limits.alignment_offset =
402  offset & (q->limits.physical_block_size - 1);
403  q->limits.misaligned = 0;
404 }
406 
418 void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
419 {
420  limits->io_min = min;
421 
422  if (limits->io_min < limits->logical_block_size)
423  limits->io_min = limits->logical_block_size;
424 
425  if (limits->io_min < limits->physical_block_size)
426  limits->io_min = limits->physical_block_size;
427 }
429 
444 void blk_queue_io_min(struct request_queue *q, unsigned int min)
445 {
446  blk_limits_io_min(&q->limits, min);
447 }
449 
463 void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
464 {
465  limits->io_opt = opt;
466 }
468 
482 void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
483 {
484  blk_limits_io_opt(&q->limits, opt);
485 }
487 
494 {
495  blk_stack_limits(&t->limits, &b->limits, 0);
496 }
498 
520 int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
521  sector_t start)
522 {
523  unsigned int top, bottom, alignment, ret = 0;
524 
525  t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
526  t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
527  t->max_write_same_sectors = min(t->max_write_same_sectors,
528  b->max_write_same_sectors);
529  t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
530 
531  t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
532  b->seg_boundary_mask);
533 
534  t->max_segments = min_not_zero(t->max_segments, b->max_segments);
535  t->max_integrity_segments = min_not_zero(t->max_integrity_segments,
536  b->max_integrity_segments);
537 
538  t->max_segment_size = min_not_zero(t->max_segment_size,
539  b->max_segment_size);
540 
541  t->misaligned |= b->misaligned;
542 
543  alignment = queue_limit_alignment_offset(b, start);
544 
545  /* Bottom device has different alignment. Check that it is
546  * compatible with the current top alignment.
547  */
548  if (t->alignment_offset != alignment) {
549 
550  top = max(t->physical_block_size, t->io_min)
551  + t->alignment_offset;
552  bottom = max(b->physical_block_size, b->io_min) + alignment;
553 
554  /* Verify that top and bottom intervals line up */
555  if (max(top, bottom) & (min(top, bottom) - 1)) {
556  t->misaligned = 1;
557  ret = -1;
558  }
559  }
560 
561  t->logical_block_size = max(t->logical_block_size,
562  b->logical_block_size);
563 
564  t->physical_block_size = max(t->physical_block_size,
565  b->physical_block_size);
566 
567  t->io_min = max(t->io_min, b->io_min);
568  t->io_opt = lcm(t->io_opt, b->io_opt);
569 
570  t->cluster &= b->cluster;
571  t->discard_zeroes_data &= b->discard_zeroes_data;
572 
573  /* Physical block size a multiple of the logical block size? */
574  if (t->physical_block_size & (t->logical_block_size - 1)) {
575  t->physical_block_size = t->logical_block_size;
576  t->misaligned = 1;
577  ret = -1;
578  }
579 
580  /* Minimum I/O a multiple of the physical block size? */
581  if (t->io_min & (t->physical_block_size - 1)) {
582  t->io_min = t->physical_block_size;
583  t->misaligned = 1;
584  ret = -1;
585  }
586 
587  /* Optimal I/O a multiple of the physical block size? */
588  if (t->io_opt & (t->physical_block_size - 1)) {
589  t->io_opt = 0;
590  t->misaligned = 1;
591  ret = -1;
592  }
593 
594  /* Find lowest common alignment_offset */
595  t->alignment_offset = lcm(t->alignment_offset, alignment)
596  & (max(t->physical_block_size, t->io_min) - 1);
597 
598  /* Verify that new alignment_offset is on a logical block boundary */
599  if (t->alignment_offset & (t->logical_block_size - 1)) {
600  t->misaligned = 1;
601  ret = -1;
602  }
603 
604  /* Discard alignment and granularity */
605  if (b->discard_granularity) {
606  alignment = queue_limit_discard_alignment(b, start);
607 
608  if (t->discard_granularity != 0 &&
609  t->discard_alignment != alignment) {
610  top = t->discard_granularity + t->discard_alignment;
611  bottom = b->discard_granularity + alignment;
612 
613  /* Verify that top and bottom intervals line up */
614  if (max(top, bottom) & (min(top, bottom) - 1))
615  t->discard_misaligned = 1;
616  }
617 
618  t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
619  b->max_discard_sectors);
620  t->discard_granularity = max(t->discard_granularity,
621  b->discard_granularity);
622  t->discard_alignment = lcm(t->discard_alignment, alignment) &
623  (t->discard_granularity - 1);
624  }
625 
626  return ret;
627 }
629 
641 int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev,
642  sector_t start)
643 {
644  struct request_queue *bq = bdev_get_queue(bdev);
645 
646  start += get_start_sect(bdev);
647 
648  return blk_stack_limits(t, &bq->limits, start);
649 }
651 
662 void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
664 {
665  struct request_queue *t = disk->queue;
666 
667  if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) {
669 
670  disk_name(disk, 0, top);
671  bdevname(bdev, bottom);
672 
673  printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
674  top, bottom);
675  }
676 }
678 
689 void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
690 {
691  q->dma_pad_mask = mask;
692 }
694 
705 void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
706 {
707  if (mask > q->dma_pad_mask)
708  q->dma_pad_mask = mask;
709 }
711 
734  dma_drain_needed_fn *dma_drain_needed,
735  void *buf, unsigned int size)
736 {
737  if (queue_max_segments(q) < 2)
738  return -EINVAL;
739  /* make room for appending the drain */
740  blk_queue_max_segments(q, queue_max_segments(q) - 1);
741  q->dma_drain_needed = dma_drain_needed;
742  q->dma_drain_buffer = buf;
743  q->dma_drain_size = size;
744 
745  return 0;
746 }
748 
754 void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
755 {
756  if (mask < PAGE_CACHE_SIZE - 1) {
757  mask = PAGE_CACHE_SIZE - 1;
758  printk(KERN_INFO "%s: set to minimum %lx\n",
759  __func__, mask);
760  }
761 
762  q->limits.seg_boundary_mask = mask;
763 }
765 
777 {
778  q->dma_alignment = mask;
779 }
781 
797 {
798  BUG_ON(mask > PAGE_SIZE);
799 
800  if (mask > q->dma_alignment)
801  q->dma_alignment = mask;
802 }
804 
814 void blk_queue_flush(struct request_queue *q, unsigned int flush)
815 {
816  WARN_ON_ONCE(flush & ~(REQ_FLUSH | REQ_FUA));
817 
818  if (WARN_ON_ONCE(!(flush & REQ_FLUSH) && (flush & REQ_FUA)))
819  flush &= ~REQ_FUA;
820 
821  q->flush_flags = flush & (REQ_FLUSH | REQ_FUA);
822 }
824 
825 void blk_queue_flush_queueable(struct request_queue *q, bool queueable)
826 {
827  q->flush_not_queueable = !queueable;
828 }
830 
831 static int __init blk_settings_init(void)
832 {
834  blk_max_pfn = max_pfn - 1;
835  return 0;
836 }
837 subsys_initcall(blk_settings_init);