1
2
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>
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
17unsigned long blk_max_low_pfn;
18EXPORT_SYMBOL(blk_max_low_pfn);
19
20unsigned long blk_max_pfn;
21
22
23
24
25
26
27
28
29
30
31
32
33void blk_queue_prep_rq(struct request_queue *q, prep_rq_fn *pfn)
34{
35 q->prep_rq_fn = pfn;
36}
37EXPORT_SYMBOL(blk_queue_prep_rq);
38
39
40
41
42
43
44
45
46
47
48
49
50void blk_queue_unprep_rq(struct request_queue *q, unprep_rq_fn *ufn)
51{
52 q->unprep_rq_fn = ufn;
53}
54EXPORT_SYMBOL(blk_queue_unprep_rq);
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72void blk_queue_merge_bvec(struct request_queue *q, merge_bvec_fn *mbfn)
73{
74 q->merge_bvec_fn = mbfn;
75}
76EXPORT_SYMBOL(blk_queue_merge_bvec);
77
78void blk_queue_softirq_done(struct request_queue *q, softirq_done_fn *fn)
79{
80 q->softirq_done_fn = fn;
81}
82EXPORT_SYMBOL(blk_queue_softirq_done);
83
84void blk_queue_rq_timeout(struct request_queue *q, unsigned int timeout)
85{
86 q->rq_timeout = timeout;
87}
88EXPORT_SYMBOL_GPL(blk_queue_rq_timeout);
89
90void blk_queue_rq_timed_out(struct request_queue *q, rq_timed_out_fn *fn)
91{
92 q->rq_timed_out_fn = fn;
93}
94EXPORT_SYMBOL_GPL(blk_queue_rq_timed_out);
95
96void blk_queue_lld_busy(struct request_queue *q, lld_busy_fn *fn)
97{
98 q->lld_busy_fn = fn;
99}
100EXPORT_SYMBOL_GPL(blk_queue_lld_busy);
101
102
103
104
105
106
107
108
109void 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}
129EXPORT_SYMBOL(blk_set_default_limits);
130
131
132
133
134
135
136
137
138
139void blk_set_stacking_limits(struct queue_limits *lim)
140{
141 blk_set_default_limits(lim);
142
143
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}
150EXPORT_SYMBOL(blk_set_stacking_limits);
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
175{
176
177
178
179 q->nr_requests = BLKDEV_MAX_RQ;
180
181 q->make_request_fn = mfn;
182 blk_queue_dma_alignment(q, 511);
183 blk_queue_congestion_threshold(q);
184 q->nr_batching = BLK_BATCH_REQ;
185
186 blk_set_default_limits(&q->limits);
187
188
189
190
191 blk_queue_bounce_limit(q, BLK_BOUNCE_HIGH);
192}
193EXPORT_SYMBOL(blk_queue_make_request);
194
195
196
197
198
199
200
201
202
203
204
205
206void 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
215
216
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) {
227 init_emergency_isa_pool();
228 q->bounce_gfp = GFP_NOIO | GFP_DMA;
229 q->limits.bounce_pfn = b_pfn;
230 }
231}
232EXPORT_SYMBOL(blk_queue_bounce_limit);
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250void 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}
262EXPORT_SYMBOL(blk_limits_max_hw_sectors);
263
264
265
266
267
268
269
270
271
272void 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}
276EXPORT_SYMBOL(blk_queue_max_hw_sectors);
277
278
279
280
281
282
283void blk_queue_max_discard_sectors(struct request_queue *q,
284 unsigned int max_discard_sectors)
285{
286 q->limits.max_discard_sectors = max_discard_sectors;
287}
288EXPORT_SYMBOL(blk_queue_max_discard_sectors);
289
290
291
292
293
294
295void blk_queue_max_write_same_sectors(struct request_queue *q,
296 unsigned int max_write_same_sectors)
297{
298 q->limits.max_write_same_sectors = max_write_same_sectors;
299}
300EXPORT_SYMBOL(blk_queue_max_write_same_sectors);
301
302
303
304
305
306
307
308
309
310
311void 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}
321EXPORT_SYMBOL(blk_queue_max_segments);
322
323
324
325
326
327
328
329
330
331
332void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
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}
342EXPORT_SYMBOL(blk_queue_max_segment_size);
343
344
345
346
347
348
349
350
351
352
353
354void 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}
364EXPORT_SYMBOL(blk_queue_logical_block_size);
365
366
367
368
369
370
371
372
373
374
375
376void blk_queue_physical_block_size(struct request_queue *q, unsigned int size)
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}
386EXPORT_SYMBOL(blk_queue_physical_block_size);
387
388
389
390
391
392
393
394
395
396
397
398
399void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
400{
401 q->limits.alignment_offset =
402 offset & (q->limits.physical_block_size - 1);
403 q->limits.misaligned = 0;
404}
405EXPORT_SYMBOL(blk_queue_alignment_offset);
406
407
408
409
410
411
412
413
414
415
416
417
418void 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}
428EXPORT_SYMBOL(blk_limits_io_min);
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444void blk_queue_io_min(struct request_queue *q, unsigned int min)
445{
446 blk_limits_io_min(&q->limits, min);
447}
448EXPORT_SYMBOL(blk_queue_io_min);
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
464{
465 limits->io_opt = opt;
466}
467EXPORT_SYMBOL(blk_limits_io_opt);
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
483{
484 blk_limits_io_opt(&q->limits, opt);
485}
486EXPORT_SYMBOL(blk_queue_io_opt);
487
488
489
490
491
492
493void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
494{
495 blk_stack_limits(&t->limits, &b->limits, 0);
496}
497EXPORT_SYMBOL(blk_queue_stack_limits);
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520int 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
546
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
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
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
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
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
595 t->alignment_offset = lcm(t->alignment_offset, alignment)
596 & (max(t->physical_block_size, t->io_min) - 1);
597
598
599 if (t->alignment_offset & (t->logical_block_size - 1)) {
600 t->misaligned = 1;
601 ret = -1;
602 }
603
604
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
614 if ((max(top, bottom) % min(top, bottom)) != 0)
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;
624 }
625
626 return ret;
627}
628EXPORT_SYMBOL(blk_stack_limits);
629
630
631
632
633
634
635
636
637
638
639
640
641int 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}
650EXPORT_SYMBOL(bdev_stack_limits);
651
652
653
654
655
656
657
658
659
660
661
662void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
663 sector_t offset)
664{
665 struct request_queue *t = disk->queue;
666
667 if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) {
668 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
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}
677EXPORT_SYMBOL(disk_stack_limits);
678
679
680
681
682
683
684
685
686
687
688
689void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
690{
691 q->dma_pad_mask = mask;
692}
693EXPORT_SYMBOL(blk_queue_dma_pad);
694
695
696
697
698
699
700
701
702
703
704
705void 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}
710EXPORT_SYMBOL(blk_queue_update_dma_pad);
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733int blk_queue_dma_drain(struct request_queue *q,
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
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}
747EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
748
749
750
751
752
753
754void 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}
764EXPORT_SYMBOL(blk_queue_segment_boundary);
765
766
767
768
769
770
771
772
773
774
775
776void blk_queue_dma_alignment(struct request_queue *q, int mask)
777{
778 q->dma_alignment = mask;
779}
780EXPORT_SYMBOL(blk_queue_dma_alignment);
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
797{
798 BUG_ON(mask > PAGE_SIZE);
799
800 if (mask > q->dma_alignment)
801 q->dma_alignment = mask;
802}
803EXPORT_SYMBOL(blk_queue_update_dma_alignment);
804
805
806
807
808
809
810
811
812
813
814void 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}
823EXPORT_SYMBOL_GPL(blk_queue_flush);
824
825void blk_queue_flush_queueable(struct request_queue *q, bool queueable)
826{
827 q->flush_not_queueable = !queueable;
828}
829EXPORT_SYMBOL_GPL(blk_queue_flush_queueable);
830
831static int __init blk_settings_init(void)
832{
833 blk_max_low_pfn = max_low_pfn - 1;
834 blk_max_pfn = max_pfn - 1;
835 return 0;
836}
837subsys_initcall(blk_settings_init);
838