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
11#include "blk.h"
12
13unsigned long blk_max_low_pfn;
14EXPORT_SYMBOL(blk_max_low_pfn);
15
16unsigned long blk_max_pfn;
17
18
19
20
21
22
23
24
25
26
27
28
29void blk_queue_prep_rq(struct request_queue *q, prep_rq_fn *pfn)
30{
31 q->prep_rq_fn = pfn;
32}
33EXPORT_SYMBOL(blk_queue_prep_rq);
34
35
36
37
38
39
40
41
42
43
44
45
46void blk_queue_set_discard(struct request_queue *q, prepare_discard_fn *dfn)
47{
48 q->prepare_discard_fn = dfn;
49}
50EXPORT_SYMBOL(blk_queue_set_discard);
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68void blk_queue_merge_bvec(struct request_queue *q, merge_bvec_fn *mbfn)
69{
70 q->merge_bvec_fn = mbfn;
71}
72EXPORT_SYMBOL(blk_queue_merge_bvec);
73
74void blk_queue_softirq_done(struct request_queue *q, softirq_done_fn *fn)
75{
76 q->softirq_done_fn = fn;
77}
78EXPORT_SYMBOL(blk_queue_softirq_done);
79
80void blk_queue_rq_timeout(struct request_queue *q, unsigned int timeout)
81{
82 q->rq_timeout = timeout;
83}
84EXPORT_SYMBOL_GPL(blk_queue_rq_timeout);
85
86void blk_queue_rq_timed_out(struct request_queue *q, rq_timed_out_fn *fn)
87{
88 q->rq_timed_out_fn = fn;
89}
90EXPORT_SYMBOL_GPL(blk_queue_rq_timed_out);
91
92void blk_queue_lld_busy(struct request_queue *q, lld_busy_fn *fn)
93{
94 q->lld_busy_fn = fn;
95}
96EXPORT_SYMBOL_GPL(blk_queue_lld_busy);
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120void blk_queue_make_request(struct request_queue *q, make_request_fn *mfn)
121{
122
123
124
125 q->nr_requests = BLKDEV_MAX_RQ;
126 blk_queue_max_phys_segments(q, MAX_PHYS_SEGMENTS);
127 blk_queue_max_hw_segments(q, MAX_HW_SEGMENTS);
128 blk_queue_segment_boundary(q, BLK_SEG_BOUNDARY_MASK);
129 blk_queue_max_segment_size(q, MAX_SEGMENT_SIZE);
130
131 q->make_request_fn = mfn;
132 q->backing_dev_info.ra_pages =
133 (VM_MAX_READAHEAD * 1024) / PAGE_CACHE_SIZE;
134 q->backing_dev_info.state = 0;
135 q->backing_dev_info.capabilities = BDI_CAP_MAP_COPY;
136 blk_queue_max_sectors(q, SAFE_MAX_SECTORS);
137 blk_queue_hardsect_size(q, 512);
138 blk_queue_dma_alignment(q, 511);
139 blk_queue_congestion_threshold(q);
140 q->nr_batching = BLK_BATCH_REQ;
141
142 q->unplug_thresh = 4;
143 q->unplug_delay = (3 * HZ) / 1000;
144 if (q->unplug_delay == 0)
145 q->unplug_delay = 1;
146
147 q->unplug_timer.function = blk_unplug_timeout;
148 q->unplug_timer.data = (unsigned long)q;
149
150
151
152
153 blk_queue_bounce_limit(q, BLK_BOUNCE_HIGH);
154}
155EXPORT_SYMBOL(blk_queue_make_request);
156
157
158
159
160
161
162
163
164
165
166
167
168void blk_queue_bounce_limit(struct request_queue *q, u64 dma_addr)
169{
170 unsigned long b_pfn = dma_addr >> PAGE_SHIFT;
171 int dma = 0;
172
173 q->bounce_gfp = GFP_NOIO;
174#if BITS_PER_LONG == 64
175
176
177
178 if (b_pfn < (min_t(u64, 0x100000000UL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
179 dma = 1;
180 q->bounce_pfn = max_low_pfn;
181#else
182 if (b_pfn < blk_max_low_pfn)
183 dma = 1;
184 q->bounce_pfn = b_pfn;
185#endif
186 if (dma) {
187 init_emergency_isa_pool();
188 q->bounce_gfp = GFP_NOIO | GFP_DMA;
189 q->bounce_pfn = b_pfn;
190 }
191}
192EXPORT_SYMBOL(blk_queue_bounce_limit);
193
194
195
196
197
198
199
200
201
202
203void blk_queue_max_sectors(struct request_queue *q, unsigned int max_sectors)
204{
205 if ((max_sectors << 9) < PAGE_CACHE_SIZE) {
206 max_sectors = 1 << (PAGE_CACHE_SHIFT - 9);
207 printk(KERN_INFO "%s: set to minimum %d\n",
208 __func__, max_sectors);
209 }
210
211 if (BLK_DEF_MAX_SECTORS > max_sectors)
212 q->max_hw_sectors = q->max_sectors = max_sectors;
213 else {
214 q->max_sectors = BLK_DEF_MAX_SECTORS;
215 q->max_hw_sectors = max_sectors;
216 }
217}
218EXPORT_SYMBOL(blk_queue_max_sectors);
219
220
221
222
223
224
225
226
227
228
229
230void blk_queue_max_phys_segments(struct request_queue *q,
231 unsigned short max_segments)
232{
233 if (!max_segments) {
234 max_segments = 1;
235 printk(KERN_INFO "%s: set to minimum %d\n",
236 __func__, max_segments);
237 }
238
239 q->max_phys_segments = max_segments;
240}
241EXPORT_SYMBOL(blk_queue_max_phys_segments);
242
243
244
245
246
247
248
249
250
251
252
253
254void blk_queue_max_hw_segments(struct request_queue *q,
255 unsigned short max_segments)
256{
257 if (!max_segments) {
258 max_segments = 1;
259 printk(KERN_INFO "%s: set to minimum %d\n",
260 __func__, max_segments);
261 }
262
263 q->max_hw_segments = max_segments;
264}
265EXPORT_SYMBOL(blk_queue_max_hw_segments);
266
267
268
269
270
271
272
273
274
275
276void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
277{
278 if (max_size < PAGE_CACHE_SIZE) {
279 max_size = PAGE_CACHE_SIZE;
280 printk(KERN_INFO "%s: set to minimum %d\n",
281 __func__, max_size);
282 }
283
284 q->max_segment_size = max_size;
285}
286EXPORT_SYMBOL(blk_queue_max_segment_size);
287
288
289
290
291
292
293
294
295
296
297
298
299void blk_queue_hardsect_size(struct request_queue *q, unsigned short size)
300{
301 q->hardsect_size = size;
302}
303EXPORT_SYMBOL(blk_queue_hardsect_size);
304
305
306
307
308#define min_not_zero(l, r) (l == 0) ? r : ((r == 0) ? l : min(l, r))
309
310
311
312
313
314
315void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
316{
317
318 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
319 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
320 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask, b->seg_boundary_mask);
321
322 t->max_phys_segments = min(t->max_phys_segments, b->max_phys_segments);
323 t->max_hw_segments = min(t->max_hw_segments, b->max_hw_segments);
324 t->max_segment_size = min(t->max_segment_size, b->max_segment_size);
325 t->hardsect_size = max(t->hardsect_size, b->hardsect_size);
326 if (!t->queue_lock)
327 WARN_ON_ONCE(1);
328 else if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags)) {
329 unsigned long flags;
330 spin_lock_irqsave(t->queue_lock, flags);
331 queue_flag_clear(QUEUE_FLAG_CLUSTER, t);
332 spin_unlock_irqrestore(t->queue_lock, flags);
333 }
334}
335EXPORT_SYMBOL(blk_queue_stack_limits);
336
337
338
339
340
341
342
343
344
345
346
347void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
348{
349 q->dma_pad_mask = mask;
350}
351EXPORT_SYMBOL(blk_queue_dma_pad);
352
353
354
355
356
357
358
359
360
361
362
363void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
364{
365 if (mask > q->dma_pad_mask)
366 q->dma_pad_mask = mask;
367}
368EXPORT_SYMBOL(blk_queue_update_dma_pad);
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393int blk_queue_dma_drain(struct request_queue *q,
394 dma_drain_needed_fn *dma_drain_needed,
395 void *buf, unsigned int size)
396{
397 if (q->max_hw_segments < 2 || q->max_phys_segments < 2)
398 return -EINVAL;
399
400 --q->max_hw_segments;
401 --q->max_phys_segments;
402 q->dma_drain_needed = dma_drain_needed;
403 q->dma_drain_buffer = buf;
404 q->dma_drain_size = size;
405
406 return 0;
407}
408EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
409
410
411
412
413
414
415void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
416{
417 if (mask < PAGE_CACHE_SIZE - 1) {
418 mask = PAGE_CACHE_SIZE - 1;
419 printk(KERN_INFO "%s: set to minimum %lx\n",
420 __func__, mask);
421 }
422
423 q->seg_boundary_mask = mask;
424}
425EXPORT_SYMBOL(blk_queue_segment_boundary);
426
427
428
429
430
431
432
433
434
435
436
437void blk_queue_dma_alignment(struct request_queue *q, int mask)
438{
439 q->dma_alignment = mask;
440}
441EXPORT_SYMBOL(blk_queue_dma_alignment);
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
458{
459 BUG_ON(mask > PAGE_SIZE);
460
461 if (mask > q->dma_alignment)
462 q->dma_alignment = mask;
463}
464EXPORT_SYMBOL(blk_queue_update_dma_alignment);
465
466static int __init blk_settings_init(void)
467{
468 blk_max_low_pfn = max_low_pfn - 1;
469 blk_max_pfn = max_pfn - 1;
470 return 0;
471}
472subsys_initcall(blk_settings_init);
473