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
12#include "blk.h"
13
14unsigned long blk_max_low_pfn;
15EXPORT_SYMBOL(blk_max_low_pfn);
16
17unsigned long blk_max_pfn;
18
19
20
21
22
23
24
25
26
27
28
29
30void blk_queue_prep_rq(struct request_queue *q, prep_rq_fn *pfn)
31{
32 q->prep_rq_fn = pfn;
33}
34EXPORT_SYMBOL(blk_queue_prep_rq);
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52void blk_queue_merge_bvec(struct request_queue *q, merge_bvec_fn *mbfn)
53{
54 q->merge_bvec_fn = mbfn;
55}
56EXPORT_SYMBOL(blk_queue_merge_bvec);
57
58void blk_queue_softirq_done(struct request_queue *q, softirq_done_fn *fn)
59{
60 q->softirq_done_fn = fn;
61}
62EXPORT_SYMBOL(blk_queue_softirq_done);
63
64void blk_queue_rq_timeout(struct request_queue *q, unsigned int timeout)
65{
66 q->rq_timeout = timeout;
67}
68EXPORT_SYMBOL_GPL(blk_queue_rq_timeout);
69
70void blk_queue_rq_timed_out(struct request_queue *q, rq_timed_out_fn *fn)
71{
72 q->rq_timed_out_fn = fn;
73}
74EXPORT_SYMBOL_GPL(blk_queue_rq_timed_out);
75
76void blk_queue_lld_busy(struct request_queue *q, lld_busy_fn *fn)
77{
78 q->lld_busy_fn = fn;
79}
80EXPORT_SYMBOL_GPL(blk_queue_lld_busy);
81
82
83
84
85
86
87
88
89
90
91void blk_set_default_limits(struct queue_limits *lim)
92{
93 lim->max_phys_segments = MAX_PHYS_SEGMENTS;
94 lim->max_hw_segments = MAX_HW_SEGMENTS;
95 lim->seg_boundary_mask = BLK_SEG_BOUNDARY_MASK;
96 lim->max_segment_size = MAX_SEGMENT_SIZE;
97 lim->max_sectors = BLK_DEF_MAX_SECTORS;
98 lim->max_hw_sectors = INT_MAX;
99 lim->max_discard_sectors = SAFE_MAX_SECTORS;
100 lim->logical_block_size = lim->physical_block_size = lim->io_min = 512;
101 lim->bounce_pfn = (unsigned long)(BLK_BOUNCE_ANY >> PAGE_SHIFT);
102 lim->alignment_offset = 0;
103 lim->io_opt = 0;
104 lim->misaligned = 0;
105 lim->no_cluster = 0;
106}
107EXPORT_SYMBOL(blk_set_default_limits);
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
132{
133
134
135
136 q->nr_requests = BLKDEV_MAX_RQ;
137
138 q->make_request_fn = mfn;
139 blk_queue_dma_alignment(q, 511);
140 blk_queue_congestion_threshold(q);
141 q->nr_batching = BLK_BATCH_REQ;
142
143 q->unplug_thresh = 4;
144 q->unplug_delay = (3 * HZ) / 1000;
145 if (q->unplug_delay == 0)
146 q->unplug_delay = 1;
147
148 q->unplug_timer.function = blk_unplug_timeout;
149 q->unplug_timer.data = (unsigned long)q;
150
151 blk_set_default_limits(&q->limits);
152 blk_queue_max_sectors(q, SAFE_MAX_SECTORS);
153
154
155
156
157
158 if (!q->queue_lock)
159 q->queue_lock = &q->__queue_lock;
160
161
162
163
164 blk_queue_bounce_limit(q, BLK_BOUNCE_HIGH);
165}
166EXPORT_SYMBOL(blk_queue_make_request);
167
168
169
170
171
172
173
174
175
176
177
178
179void blk_queue_bounce_limit(struct request_queue *q, u64 dma_mask)
180{
181 unsigned long b_pfn = dma_mask >> PAGE_SHIFT;
182 int dma = 0;
183
184 q->bounce_gfp = GFP_NOIO;
185#if BITS_PER_LONG == 64
186
187
188
189
190
191 if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
192 dma = 1;
193 q->limits.bounce_pfn = max_low_pfn;
194#else
195 if (b_pfn < blk_max_low_pfn)
196 dma = 1;
197 q->limits.bounce_pfn = b_pfn;
198#endif
199 if (dma) {
200 init_emergency_isa_pool();
201 q->bounce_gfp = GFP_NOIO | GFP_DMA;
202 q->limits.bounce_pfn = b_pfn;
203 }
204}
205EXPORT_SYMBOL(blk_queue_bounce_limit);
206
207
208
209
210
211
212
213
214
215
216void blk_queue_max_sectors(struct request_queue *q, unsigned int max_sectors)
217{
218 if ((max_sectors << 9) < PAGE_CACHE_SIZE) {
219 max_sectors = 1 << (PAGE_CACHE_SHIFT - 9);
220 printk(KERN_INFO "%s: set to minimum %d\n",
221 __func__, max_sectors);
222 }
223
224 if (BLK_DEF_MAX_SECTORS > max_sectors)
225 q->limits.max_hw_sectors = q->limits.max_sectors = max_sectors;
226 else {
227 q->limits.max_sectors = BLK_DEF_MAX_SECTORS;
228 q->limits.max_hw_sectors = max_sectors;
229 }
230}
231EXPORT_SYMBOL(blk_queue_max_sectors);
232
233void blk_queue_max_hw_sectors(struct request_queue *q, unsigned int max_sectors)
234{
235 if (BLK_DEF_MAX_SECTORS > max_sectors)
236 q->limits.max_hw_sectors = BLK_DEF_MAX_SECTORS;
237 else
238 q->limits.max_hw_sectors = max_sectors;
239}
240EXPORT_SYMBOL(blk_queue_max_hw_sectors);
241
242
243
244
245
246
247void blk_queue_max_discard_sectors(struct request_queue *q,
248 unsigned int max_discard_sectors)
249{
250 q->limits.max_discard_sectors = max_discard_sectors;
251}
252EXPORT_SYMBOL(blk_queue_max_discard_sectors);
253
254
255
256
257
258
259
260
261
262
263
264void blk_queue_max_phys_segments(struct request_queue *q,
265 unsigned short max_segments)
266{
267 if (!max_segments) {
268 max_segments = 1;
269 printk(KERN_INFO "%s: set to minimum %d\n",
270 __func__, max_segments);
271 }
272
273 q->limits.max_phys_segments = max_segments;
274}
275EXPORT_SYMBOL(blk_queue_max_phys_segments);
276
277
278
279
280
281
282
283
284
285
286
287
288void blk_queue_max_hw_segments(struct request_queue *q,
289 unsigned short max_segments)
290{
291 if (!max_segments) {
292 max_segments = 1;
293 printk(KERN_INFO "%s: set to minimum %d\n",
294 __func__, max_segments);
295 }
296
297 q->limits.max_hw_segments = max_segments;
298}
299EXPORT_SYMBOL(blk_queue_max_hw_segments);
300
301
302
303
304
305
306
307
308
309
310void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
311{
312 if (max_size < PAGE_CACHE_SIZE) {
313 max_size = PAGE_CACHE_SIZE;
314 printk(KERN_INFO "%s: set to minimum %d\n",
315 __func__, max_size);
316 }
317
318 q->limits.max_segment_size = max_size;
319}
320EXPORT_SYMBOL(blk_queue_max_segment_size);
321
322
323
324
325
326
327
328
329
330
331
332void blk_queue_logical_block_size(struct request_queue *q, unsigned short size)
333{
334 q->limits.logical_block_size = size;
335
336 if (q->limits.physical_block_size < size)
337 q->limits.physical_block_size = size;
338
339 if (q->limits.io_min < q->limits.physical_block_size)
340 q->limits.io_min = q->limits.physical_block_size;
341}
342EXPORT_SYMBOL(blk_queue_logical_block_size);
343
344
345
346
347
348
349
350
351
352
353
354void blk_queue_physical_block_size(struct request_queue *q, unsigned short size)
355{
356 q->limits.physical_block_size = size;
357
358 if (q->limits.physical_block_size < q->limits.logical_block_size)
359 q->limits.physical_block_size = q->limits.logical_block_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_physical_block_size);
365
366
367
368
369
370
371
372
373
374
375
376
377void blk_queue_alignment_offset(struct request_queue *q, unsigned int offset)
378{
379 q->limits.alignment_offset =
380 offset & (q->limits.physical_block_size - 1);
381 q->limits.misaligned = 0;
382}
383EXPORT_SYMBOL(blk_queue_alignment_offset);
384
385
386
387
388
389
390
391
392
393
394
395
396void blk_limits_io_min(struct queue_limits *limits, unsigned int min)
397{
398 limits->io_min = min;
399
400 if (limits->io_min < limits->logical_block_size)
401 limits->io_min = limits->logical_block_size;
402
403 if (limits->io_min < limits->physical_block_size)
404 limits->io_min = limits->physical_block_size;
405}
406EXPORT_SYMBOL(blk_limits_io_min);
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422void blk_queue_io_min(struct request_queue *q, unsigned int min)
423{
424 blk_limits_io_min(&q->limits, min);
425}
426EXPORT_SYMBOL(blk_queue_io_min);
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt)
442{
443 limits->io_opt = opt;
444}
445EXPORT_SYMBOL(blk_limits_io_opt);
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460void blk_queue_io_opt(struct request_queue *q, unsigned int opt)
461{
462 blk_limits_io_opt(&q->limits, opt);
463}
464EXPORT_SYMBOL(blk_queue_io_opt);
465
466
467
468
469#define min_not_zero(l, r) (l == 0) ? r : ((r == 0) ? l : min(l, r))
470
471
472
473
474
475
476void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
477{
478 blk_stack_limits(&t->limits, &b->limits, 0);
479
480 if (!t->queue_lock)
481 WARN_ON_ONCE(1);
482 else if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags)) {
483 unsigned long flags;
484 spin_lock_irqsave(t->queue_lock, flags);
485 queue_flag_clear(QUEUE_FLAG_CLUSTER, t);
486 spin_unlock_irqrestore(t->queue_lock, flags);
487 }
488}
489EXPORT_SYMBOL(blk_queue_stack_limits);
490
491
492
493
494
495
496
497
498
499
500
501
502int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
503 sector_t offset)
504{
505 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
506 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
507 t->bounce_pfn = min_not_zero(t->bounce_pfn, b->bounce_pfn);
508
509 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask,
510 b->seg_boundary_mask);
511
512 t->max_phys_segments = min_not_zero(t->max_phys_segments,
513 b->max_phys_segments);
514
515 t->max_hw_segments = min_not_zero(t->max_hw_segments,
516 b->max_hw_segments);
517
518 t->max_segment_size = min_not_zero(t->max_segment_size,
519 b->max_segment_size);
520
521 t->logical_block_size = max(t->logical_block_size,
522 b->logical_block_size);
523
524 t->physical_block_size = max(t->physical_block_size,
525 b->physical_block_size);
526
527 t->io_min = max(t->io_min, b->io_min);
528 t->no_cluster |= b->no_cluster;
529
530
531 if (offset &&
532 (offset & (b->physical_block_size - 1)) != b->alignment_offset) {
533 t->misaligned = 1;
534 return -1;
535 }
536
537
538 if (!t->alignment_offset)
539 t->alignment_offset =
540 b->alignment_offset & (b->physical_block_size - 1);
541
542
543 if (t->alignment_offset & (t->logical_block_size - 1)) {
544 t->misaligned = 1;
545 return -1;
546 }
547
548
549 if (t->io_opt && b->io_opt)
550 t->io_opt = (t->io_opt * b->io_opt) / gcd(t->io_opt, b->io_opt);
551 else if (b->io_opt)
552 t->io_opt = b->io_opt;
553
554
555 if (t->io_min && t->io_opt % t->io_min)
556 return -1;
557
558 return 0;
559}
560EXPORT_SYMBOL(blk_stack_limits);
561
562
563
564
565
566
567
568
569
570
571
572
573void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
574 sector_t offset)
575{
576 struct request_queue *t = disk->queue;
577 struct request_queue *b = bdev_get_queue(bdev);
578
579 offset += get_start_sect(bdev) << 9;
580
581 if (blk_stack_limits(&t->limits, &b->limits, offset) < 0) {
582 char top[BDEVNAME_SIZE], bottom[BDEVNAME_SIZE];
583
584 disk_name(disk, 0, top);
585 bdevname(bdev, bottom);
586
587 printk(KERN_NOTICE "%s: Warning: Device %s is misaligned\n",
588 top, bottom);
589 }
590
591 if (!t->queue_lock)
592 WARN_ON_ONCE(1);
593 else if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags)) {
594 unsigned long flags;
595
596 spin_lock_irqsave(t->queue_lock, flags);
597 if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags))
598 queue_flag_clear(QUEUE_FLAG_CLUSTER, t);
599 spin_unlock_irqrestore(t->queue_lock, flags);
600 }
601}
602EXPORT_SYMBOL(disk_stack_limits);
603
604
605
606
607
608
609
610
611
612
613
614void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
615{
616 q->dma_pad_mask = mask;
617}
618EXPORT_SYMBOL(blk_queue_dma_pad);
619
620
621
622
623
624
625
626
627
628
629
630void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
631{
632 if (mask > q->dma_pad_mask)
633 q->dma_pad_mask = mask;
634}
635EXPORT_SYMBOL(blk_queue_update_dma_pad);
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660int blk_queue_dma_drain(struct request_queue *q,
661 dma_drain_needed_fn *dma_drain_needed,
662 void *buf, unsigned int size)
663{
664 if (queue_max_hw_segments(q) < 2 || queue_max_phys_segments(q) < 2)
665 return -EINVAL;
666
667 blk_queue_max_hw_segments(q, queue_max_hw_segments(q) - 1);
668 blk_queue_max_phys_segments(q, queue_max_phys_segments(q) - 1);
669 q->dma_drain_needed = dma_drain_needed;
670 q->dma_drain_buffer = buf;
671 q->dma_drain_size = size;
672
673 return 0;
674}
675EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
676
677
678
679
680
681
682void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
683{
684 if (mask < PAGE_CACHE_SIZE - 1) {
685 mask = PAGE_CACHE_SIZE - 1;
686 printk(KERN_INFO "%s: set to minimum %lx\n",
687 __func__, mask);
688 }
689
690 q->limits.seg_boundary_mask = mask;
691}
692EXPORT_SYMBOL(blk_queue_segment_boundary);
693
694
695
696
697
698
699
700
701
702
703
704void blk_queue_dma_alignment(struct request_queue *q, int mask)
705{
706 q->dma_alignment = mask;
707}
708EXPORT_SYMBOL(blk_queue_dma_alignment);
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
725{
726 BUG_ON(mask > PAGE_SIZE);
727
728 if (mask > q->dma_alignment)
729 q->dma_alignment = mask;
730}
731EXPORT_SYMBOL(blk_queue_update_dma_alignment);
732
733static int __init blk_settings_init(void)
734{
735 blk_max_low_pfn = max_low_pfn - 1;
736 blk_max_pfn = max_pfn - 1;
737 return 0;
738}
739subsys_initcall(blk_settings_init);
740