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_mask)
169{
170 unsigned long b_pfn = dma_mask >> PAGE_SHIFT;
171 int dma = 0;
172
173 q->bounce_gfp = GFP_NOIO;
174#if BITS_PER_LONG == 64
175
176
177
178
179
180 if (b_pfn < (min_t(u64, 0xffffffffUL, BLK_BOUNCE_HIGH) >> PAGE_SHIFT))
181 dma = 1;
182 q->bounce_pfn = max_low_pfn;
183#else
184 if (b_pfn < blk_max_low_pfn)
185 dma = 1;
186 q->bounce_pfn = b_pfn;
187#endif
188 if (dma) {
189 init_emergency_isa_pool();
190 q->bounce_gfp = GFP_NOIO | GFP_DMA;
191 q->bounce_pfn = b_pfn;
192 }
193}
194EXPORT_SYMBOL(blk_queue_bounce_limit);
195
196
197
198
199
200
201
202
203
204
205void blk_queue_max_sectors(struct request_queue *q, unsigned int max_sectors)
206{
207 if ((max_sectors << 9) < PAGE_CACHE_SIZE) {
208 max_sectors = 1 << (PAGE_CACHE_SHIFT - 9);
209 printk(KERN_INFO "%s: set to minimum %d\n",
210 __func__, max_sectors);
211 }
212
213 if (BLK_DEF_MAX_SECTORS > max_sectors)
214 q->max_hw_sectors = q->max_sectors = max_sectors;
215 else {
216 q->max_sectors = BLK_DEF_MAX_SECTORS;
217 q->max_hw_sectors = max_sectors;
218 }
219}
220EXPORT_SYMBOL(blk_queue_max_sectors);
221
222
223
224
225
226
227
228
229
230
231
232void blk_queue_max_phys_segments(struct request_queue *q,
233 unsigned short max_segments)
234{
235 if (!max_segments) {
236 max_segments = 1;
237 printk(KERN_INFO "%s: set to minimum %d\n",
238 __func__, max_segments);
239 }
240
241 q->max_phys_segments = max_segments;
242}
243EXPORT_SYMBOL(blk_queue_max_phys_segments);
244
245
246
247
248
249
250
251
252
253
254
255
256void blk_queue_max_hw_segments(struct request_queue *q,
257 unsigned short max_segments)
258{
259 if (!max_segments) {
260 max_segments = 1;
261 printk(KERN_INFO "%s: set to minimum %d\n",
262 __func__, max_segments);
263 }
264
265 q->max_hw_segments = max_segments;
266}
267EXPORT_SYMBOL(blk_queue_max_hw_segments);
268
269
270
271
272
273
274
275
276
277
278void blk_queue_max_segment_size(struct request_queue *q, unsigned int max_size)
279{
280 if (max_size < PAGE_CACHE_SIZE) {
281 max_size = PAGE_CACHE_SIZE;
282 printk(KERN_INFO "%s: set to minimum %d\n",
283 __func__, max_size);
284 }
285
286 q->max_segment_size = max_size;
287}
288EXPORT_SYMBOL(blk_queue_max_segment_size);
289
290
291
292
293
294
295
296
297
298
299
300
301void blk_queue_hardsect_size(struct request_queue *q, unsigned short size)
302{
303 q->hardsect_size = size;
304}
305EXPORT_SYMBOL(blk_queue_hardsect_size);
306
307
308
309
310#define min_not_zero(l, r) (l == 0) ? r : ((r == 0) ? l : min(l, r))
311
312
313
314
315
316
317void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b)
318{
319
320 t->max_sectors = min_not_zero(t->max_sectors, b->max_sectors);
321 t->max_hw_sectors = min_not_zero(t->max_hw_sectors, b->max_hw_sectors);
322 t->seg_boundary_mask = min_not_zero(t->seg_boundary_mask, b->seg_boundary_mask);
323
324 t->max_phys_segments = min_not_zero(t->max_phys_segments, b->max_phys_segments);
325 t->max_hw_segments = min_not_zero(t->max_hw_segments, b->max_hw_segments);
326 t->max_segment_size = min_not_zero(t->max_segment_size, b->max_segment_size);
327 t->hardsect_size = max(t->hardsect_size, b->hardsect_size);
328 if (!t->queue_lock)
329 WARN_ON_ONCE(1);
330 else if (!test_bit(QUEUE_FLAG_CLUSTER, &b->queue_flags)) {
331 unsigned long flags;
332 spin_lock_irqsave(t->queue_lock, flags);
333 queue_flag_clear(QUEUE_FLAG_CLUSTER, t);
334 spin_unlock_irqrestore(t->queue_lock, flags);
335 }
336}
337EXPORT_SYMBOL(blk_queue_stack_limits);
338
339
340
341
342
343
344
345
346
347
348
349void blk_queue_dma_pad(struct request_queue *q, unsigned int mask)
350{
351 q->dma_pad_mask = mask;
352}
353EXPORT_SYMBOL(blk_queue_dma_pad);
354
355
356
357
358
359
360
361
362
363
364
365void blk_queue_update_dma_pad(struct request_queue *q, unsigned int mask)
366{
367 if (mask > q->dma_pad_mask)
368 q->dma_pad_mask = mask;
369}
370EXPORT_SYMBOL(blk_queue_update_dma_pad);
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395int blk_queue_dma_drain(struct request_queue *q,
396 dma_drain_needed_fn *dma_drain_needed,
397 void *buf, unsigned int size)
398{
399 if (q->max_hw_segments < 2 || q->max_phys_segments < 2)
400 return -EINVAL;
401
402 --q->max_hw_segments;
403 --q->max_phys_segments;
404 q->dma_drain_needed = dma_drain_needed;
405 q->dma_drain_buffer = buf;
406 q->dma_drain_size = size;
407
408 return 0;
409}
410EXPORT_SYMBOL_GPL(blk_queue_dma_drain);
411
412
413
414
415
416
417void blk_queue_segment_boundary(struct request_queue *q, unsigned long mask)
418{
419 if (mask < PAGE_CACHE_SIZE - 1) {
420 mask = PAGE_CACHE_SIZE - 1;
421 printk(KERN_INFO "%s: set to minimum %lx\n",
422 __func__, mask);
423 }
424
425 q->seg_boundary_mask = mask;
426}
427EXPORT_SYMBOL(blk_queue_segment_boundary);
428
429
430
431
432
433
434
435
436
437
438
439void blk_queue_dma_alignment(struct request_queue *q, int mask)
440{
441 q->dma_alignment = mask;
442}
443EXPORT_SYMBOL(blk_queue_dma_alignment);
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459void blk_queue_update_dma_alignment(struct request_queue *q, int mask)
460{
461 BUG_ON(mask > PAGE_SIZE);
462
463 if (mask > q->dma_alignment)
464 q->dma_alignment = mask;
465}
466EXPORT_SYMBOL(blk_queue_update_dma_alignment);
467
468static int __init blk_settings_init(void)
469{
470 blk_max_low_pfn = max_low_pfn - 1;
471 blk_max_pfn = max_pfn - 1;
472 return 0;
473}
474subsys_initcall(blk_settings_init);
475