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_discard_sectors = 0;
117 lim->discard_granularity = 0;
118 lim->discard_alignment = 0;
119 lim->discard_misaligned = 0;
120 lim->discard_zeroes_data = 0;
121 lim->logical_block_size = lim->physical_block_size = lim->io_min = 512;
122 lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT);
123 lim->alignment_offset = 0;
124 lim->io_opt = 0;
125 lim->misaligned = 0;
126 lim->cluster = 1;
127}
128EXPORT_SYMBOL(blk_set_default_limits);
129
130
131
132
133
134
135
136
137
138void blk_set_stacking_limits(struct queue_limits *lim)
139{
140 blk_set_default_limits(lim);
141
142
143 lim->discard_zeroes_data = 1;
144 lim->max_segments = USHRT_MAX;
145 lim->max_hw_sectors = UINT_MAX;
146
147 lim->max_sectors = BLK_DEF_MAX_SECTORS;
148}
149EXPORT_SYMBOL(blk_set_stacking_limits);
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
174{
175
176
177
178 q->nr_requests = BLKDEV_MAX_RQ;
179
180 q->make_request_fn = mfn;
181 blk_queue_dma_alignment(q, 511);
182 blk_queue_congestion_threshold(q);
183 q->nr_batching = BLK_BATCH_REQ;
184
185 blk_set_default_limits(&q->limits);
186
187
188
189
190 blk_queue_bounce_limit(q, BLK_BOUNCE_HIGH);
191}
192EXPORT_SYMBOL(blk_queue_make_request);
193
194
195
196
197
198
199
200
201
202
203
204
205void blk_queue_bounce_limit(struct request_queue *q, u64 dma_mask)
206{
207 unsigned long b_pfn = dma_mask >> PAGE_SHIFT;
208 int dma = 0;
209
210 q->bounce_gfp = GFP_NOIO;
211#if BITS_PER_LONG == 64
212
213
214
215
216
217 if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
218 dma = 1;
219 q->limits.bounce_pfn = max(max_low_pfn, b_pfn);
220#else
221 if (b_pfn < blk_max_low_pfn)
222 dma = 1;
223 q->limits.bounce_pfn = b_pfn;
224#endif
225 if (dma) {
226 init_emergency_isa_pool();
227 q->bounce_gfp = GFP_NOIO | GFP_DMA;
228 q->limits.bounce_pfn = b_pfn;
229 }
230}
231EXPORT_SYMBOL(blk_queue_bounce_limit);
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249void blk_limits_max_hw_sectors(struct queue_limits *limits, unsigned int max_hw_sectors)
250{
251 if ((max_hw_sectors << 9) < PAGE_CACHE_SIZE) {
252 max_hw_sectors = 1 << (PAGE_CACHE_SHIFT - 9);
253 printk(KERN_INFO "%s: set to minimum %d\n",
254 __func__, max_hw_sectors);
255 }
256
257 limits->max_hw_sectors = max_hw_sectors;
258 limits->max_sectors = min_t(unsigned int, max_hw_sectors,
259 BLK_DEF_MAX_SECTORS);
260}
261EXPORT_SYMBOL(blk_limits_max_hw_sectors);
262
263
264
265
266
267
268
269
270
271void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_hw_sectors)
272{
273 blk_limits_max_hw_sectors(&q->limits, max_hw_sectors);
274}
275EXPORT_SYMBOL(blk_queue_max_hw_sectors);
276
277
278
279
280
281
282void blk_queue_max_discard_sectors(struct request_queue *q,
283 unsigned int max_discard_sectors)
284{
285 q->limits.max_discard_sectors = max_discard_sectors;
286}
287EXPORT_SYMBOL(blk_queue_max_discard_sectors);
288
289
290
291
292
293
294
295
296
297
298void blk_queue_max_segments(struct request_queue *q, unsigned short max_segments)
299{
300 if (!max_segments) {
301 max_segments = 1;
302 printk(KERN_INFO "%s: set to minimum %d\n",
303 __func__, max_segments);
304 }
305
306 q->limits.max_segments = max_segments;
307}
308EXPORT_SYMBOL(blk_queue_max_segments);
309
310
311
312
313
314
315
316
317
318
319void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
320{
321 if (max_size < PAGE_CACHE_SIZE) {
322 max_size = PAGE_CACHE_SIZE;
323 printk(KERN_INFO "%s: set to minimum %d\n",
324 __func__, max_size);
325 }
326
327 q->limits.max_segment_size = max_size;
328}
329EXPORT_SYMBOL(blk_queue_max_segment_size);
330
331
332
333
334
335
336
337
338
339
340
341void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
342{
343 q->limits.logical_block_size = size;
344
345 if (q->limits.physical_block_size < size)
346 q->limits.physical_block_size = size;
347
348 if (q->limits.io_min < q->limits.physical_block_size)
349 q->limits.io_min = q->limits.physical_block_size;
350}
351EXPORT_SYMBOL(blk_queue_logical_block_size);
352
353
354
355
356
357
358
359
360
361
362
363void blk_queue_physical_block_size(struct request_queue *q, unsigned int size)
364{
365 q->limits.physical_block_size = size;
366
367 if (q->limits.physical_block_size < q->limits.logical_block_size)
368 q->limits.physical_block_size = q->limits.logical_block_size;
369
370 if (q->limits.io_min < q->limits.physical_block_size)
371 q->limits.io_min = q->limits.physical_block_size;
372}
373EXPORT_SYMBOL(blk_queue_physical_block_size);
374
375
376
377
378
379
380
381
382
383
384
385
386void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
387{
388 q->limits.alignment_offset =
389 offset & (q->limits.physical_block_size - 1);
390 q->limits.misaligned = 0;
391}
392EXPORT_SYMBOL(blk_queue_alignment_offset);
393
394
395
396
397
398
399
400
401
402
403
404
405void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
406{
407 limits->io_min = min;
408
409 if (limits->io_min < limits->logical_block_size)
410 limits->io_min = limits->logical_block_size;
411
412 if (limits->io_min < limits->physical_block_size)
413 limits->io_min = limits->physical_block_size;
414}
415EXPORT_SYMBOL(blk_limits_io_min);
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431void blk_queue_io_min(struct request_queue *q, unsigned int min)
432{
433 blk_limits_io_min(&q->limits, min);
434}
435EXPORT_SYMBOL(blk_queue_io_min);
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
451{
452 limits->io_opt = opt;
453}
454EXPORT_SYMBOL(blk_limits_io_opt);
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
470{
471 blk_limits_io_opt(&q->limits, opt);
472}
473EXPORT_SYMBOL(blk_queue_io_opt);
474
475
476
477
478
479
480void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
481{
482 blk_stack_limits(&t->limits, &b->limits, 0);
483}
484EXPORT_SYMBOL(blk_queue_stack_limits);
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
508 sector_t start)
509{
510 unsigned int top, bottom, alignment, ret = 0;
511
512 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
513 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
514 t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
515
516 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
517 b->seg_boundary_mask);
518
519 t->max_segments = min_not_zero(t->max_segments, b->max_segments);
520 t->max_integrity_segments = min_not_zero(t->max_integrity_segments,
521 b->max_integrity_segments);
522
523 t->max_segment_size = min_not_zero(t->max_segment_size,
524 b->max_segment_size);
525
526 t->misaligned |= b->misaligned;
527
528 alignment = queue_limit_alignment_offset(b, start);
529
530
531
532
533 if (t->alignment_offset != alignment) {
534
535 top = max(t->physical_block_size, t->io_min)
536 + t->alignment_offset;
537 bottom = max(b->physical_block_size, b->io_min) + alignment;
538
539
540 if (max(top, bottom) & (min(top, bottom) - 1)) {
541 t->misaligned = 1;
542 ret = -1;
543 }
544 }
545
546 t->logical_block_size = max(t->logical_block_size,
547 b->logical_block_size);
548
549 t->physical_block_size = max(t->physical_block_size,
550 b->physical_block_size);
551
552 t->io_min = max(t->io_min, b->io_min);
553 t->io_opt = lcm(t->io_opt, b->io_opt);
554
555 t->cluster &= b->cluster;
556 t->discard_zeroes_data &= b->discard_zeroes_data;
557
558
559 if (t->physical_block_size & (t->logical_block_size - 1)) {
560 t->physical_block_size = t->logical_block_size;
561 t->misaligned = 1;
562 ret = -1;
563 }
564
565
566 if (t->io_min & (t->physical_block_size - 1)) {
567 t->io_min = t->physical_block_size;
568 t->misaligned = 1;
569 ret = -1;
570 }
571
572
573 if (t->io_opt & (t->physical_block_size - 1)) {
574 t->io_opt = 0;
575 t->misaligned = 1;
576 ret = -1;
577 }
578
579
580 t->alignment_offset = lcm(t->alignment_offset, alignment)
581 & (max(t->physical_block_size, t->io_min) - 1);
582
583
584 if (t->alignment_offset & (t->logical_block_size - 1)) {
585 t->misaligned = 1;
586 ret = -1;
587 }
588
589
590 if (b->discard_granularity) {
591 alignment = queue_limit_discard_alignment(b, start);
592
593 if (t->discard_granularity != 0 &&
594 t->discard_alignment != alignment) {
595 top = t->discard_granularity + t->discard_alignment;
596 bottom = b->discard_granularity + alignment;
597
598
599 if (max(top, bottom) & (min(top, bottom) - 1))
600 t->discard_misaligned = 1;
601 }
602
603 t->max_discard_sectors = min_not_zero(t->max_discard_sectors,
604 b->max_discard_sectors);
605 t->discard_granularity = max(t->discard_granularity,
606 b->discard_granularity);
607 t->discard_alignment = lcm(t->discard_alignment, alignment) &
608 (t->discard_granularity - 1);
609 }
610
611 return ret;
612}
613EXPORT_SYMBOL(blk_stack_limits);
614
615
616
617
618
619
620
621
622
623
624
625
626int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev,
627 sector_t start)
628{
629 struct request_queue *bq = bdev_get_queue(bdev);
630
631 start += get_start_sect(bdev);
632
633 return blk_stack_limits(t, &bq->limits, start);
634}
635EXPORT_SYMBOL(bdev_stack_limits);
636
637
638
639
640
641
642
643
644
645
646
647void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
648 sector_t offset)
649{
650 struct request_queue *t = disk->queue;
651
652 if (bdev_stack_limits(&t->limits, bdev, offset >> 9) < 0) {
653 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
654
655 disk_name(disk, 0, top);
656 bdevname(bdev, bottom);
657
658 printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
659 top, bottom);
660 }
661}
662EXPORT_SYMBOL(disk_stack_limits);
663
664
665
666
667
668
669
670
671
672
673
674void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
675{
676 q->dma_pad_mask = mask;
677}
678EXPORT_SYMBOL(blk_queue_dma_pad);
679
680
681
682
683
684
685
686
687
688
689
690void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
691{
692 if (mask > q->dma_pad_mask)
693 q->dma_pad_mask = mask;
694}
695EXPORT_SYMBOL(blk_queue_update_dma_pad);
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718int blk_queue_dma_drain(struct request_queue *q,
719 dma_drain_needed_fn *dma_drain_needed,
720 void *buf, unsigned int size)
721{
722 if (queue_max_segments(q) < 2)
723 return -EINVAL;
724
725 blk_queue_max_segments(q, queue_max_segments(q) - 1);
726 q->dma_drain_needed = dma_drain_needed;
727 q->dma_drain_buffer = buf;
728 q->dma_drain_size = size;
729
730 return 0;
731}
732EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
733
734
735
736
737
738
739void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
740{
741 if (mask < PAGE_CACHE_SIZE - 1) {
742 mask = PAGE_CACHE_SIZE - 1;
743 printk(KERN_INFO "%s: set to minimum %lx\n",
744 __func__, mask);
745 }
746
747 q->limits.seg_boundary_mask = mask;
748}
749EXPORT_SYMBOL(blk_queue_segment_boundary);
750
751
752
753
754
755
756
757
758
759
760
761void blk_queue_dma_alignment(struct request_queue *q, int mask)
762{
763 q->dma_alignment = mask;
764}
765EXPORT_SYMBOL(blk_queue_dma_alignment);
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
782{
783 BUG_ON(mask > PAGE_SIZE);
784
785 if (mask > q->dma_alignment)
786 q->dma_alignment = mask;
787}
788EXPORT_SYMBOL(blk_queue_update_dma_alignment);
789
790
791
792
793
794
795
796
797
798
799void blk_queue_flush(struct request_queue *q, unsigned int flush)
800{
801 WARN_ON_ONCE(flush & ~(REQ_FLUSH | REQ_FUA));
802
803 if (WARN_ON_ONCE(!(flush & REQ_FLUSH) && (flush & REQ_FUA)))
804 flush &= ~REQ_FUA;
805
806 q->flush_flags = flush & (REQ_FLUSH | REQ_FUA);
807}
808EXPORT_SYMBOL_GPL(blk_queue_flush);
809
810void blk_queue_flush_queueable(struct request_queue *q, bool queueable)
811{
812 q->flush_not_queueable = !queueable;
813}
814EXPORT_SYMBOL_GPL(blk_queue_flush_queueable);
815
816static int __init blk_settings_init(void)
817{
818 blk_max_low_pfn = max_low_pfn - 1;
819 blk_max_pfn = max_pfn - 1;
820 return 0;
821}
822subsys_initcall(blk_settings_init);
823