]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blame - include/linux/blkdev.h
[PATCH] regularize blk_cleanup_queue() use
[mirror_ubuntu-artful-kernel.git] / include / linux / blkdev.h
CommitLineData
1da177e4
LT
1#ifndef _LINUX_BLKDEV_H
2#define _LINUX_BLKDEV_H
3
4#include <linux/config.h>
5#include <linux/major.h>
6#include <linux/genhd.h>
7#include <linux/list.h>
8#include <linux/timer.h>
9#include <linux/workqueue.h>
10#include <linux/pagemap.h>
11#include <linux/backing-dev.h>
12#include <linux/wait.h>
13#include <linux/mempool.h>
14#include <linux/bio.h>
15#include <linux/module.h>
16#include <linux/stringify.h>
17
18#include <asm/scatterlist.h>
19
20struct request_queue;
21typedef struct request_queue request_queue_t;
22struct elevator_queue;
23typedef struct elevator_queue elevator_t;
24struct request_pm_state;
25
26#define BLKDEV_MIN_RQ 4
27#define BLKDEV_MAX_RQ 128 /* Default maximum */
28
29/*
30 * This is the per-process anticipatory I/O scheduler state.
31 */
32struct as_io_context {
33 spinlock_t lock;
34
35 void (*dtor)(struct as_io_context *aic); /* destructor */
36 void (*exit)(struct as_io_context *aic); /* called on task exit */
37
38 unsigned long state;
39 atomic_t nr_queued; /* queued reads & sync writes */
40 atomic_t nr_dispatched; /* number of requests gone to the drivers */
41
42 /* IO History tracking */
43 /* Thinktime */
44 unsigned long last_end_request;
45 unsigned long ttime_total;
46 unsigned long ttime_samples;
47 unsigned long ttime_mean;
48 /* Layout pattern */
49 unsigned int seek_samples;
50 sector_t last_request_pos;
51 u64 seek_total;
52 sector_t seek_mean;
53};
54
55struct cfq_queue;
56struct cfq_io_context {
1da177e4
LT
57 /*
58 * circular list of cfq_io_contexts belonging to a process io context
59 */
60 struct list_head list;
12a05732 61 struct cfq_queue *cfqq[2];
22e2c507
JA
62 void *key;
63
64 struct io_context *ioc;
65
66 unsigned long last_end_request;
67 unsigned long last_queue;
68 unsigned long ttime_total;
69 unsigned long ttime_samples;
70 unsigned long ttime_mean;
71
d9ff4187
AV
72 struct list_head queue_list;
73
22e2c507
JA
74 void (*dtor)(struct cfq_io_context *);
75 void (*exit)(struct cfq_io_context *);
1da177e4
LT
76};
77
78/*
79 * This is the per-process I/O subsystem state. It is refcounted and
80 * kmalloc'ed. Currently all fields are modified in process io context
81 * (apart from the atomic refcount), so require no locking.
82 */
83struct io_context {
84 atomic_t refcount;
22e2c507
JA
85 struct task_struct *task;
86
87 int (*set_ioprio)(struct io_context *, unsigned int);
1da177e4
LT
88
89 /*
90 * For request batching
91 */
92 unsigned long last_waited; /* Time last woken after wait for request */
93 int nr_batch_requests; /* Number of requests left in the batch */
94
1da177e4
LT
95 struct as_io_context *aic;
96 struct cfq_io_context *cic;
97};
98
99void put_io_context(struct io_context *ioc);
100void exit_io_context(void);
8267e268
AV
101struct io_context *current_io_context(gfp_t gfp_flags);
102struct io_context *get_io_context(gfp_t gfp_flags);
1da177e4
LT
103void copy_io_context(struct io_context **pdst, struct io_context **psrc);
104void swap_io_context(struct io_context **ioc1, struct io_context **ioc2);
105
106struct request;
8ffdc655 107typedef void (rq_end_io_fn)(struct request *, int);
1da177e4
LT
108
109struct request_list {
110 int count[2];
111 int starved[2];
cb98fc8b 112 int elvpriv;
1da177e4
LT
113 mempool_t *rq_pool;
114 wait_queue_head_t wait[2];
1da177e4
LT
115};
116
117#define BLK_MAX_CDB 16
118
119/*
120 * try to put the fields that are referenced together in the same cacheline
121 */
122struct request {
ff856bad
JA
123 struct list_head queuelist;
124 struct list_head donelist;
125
1da177e4
LT
126 unsigned long flags; /* see REQ_ bits below */
127
128 /* Maintain bio traversal state for part by part I/O submission.
129 * hard_* are block layer internals, no driver should touch them!
130 */
131
132 sector_t sector; /* next sector to submit */
133 unsigned long nr_sectors; /* no. of sectors left to submit */
134 /* no. of sectors left to submit in the current segment */
135 unsigned int current_nr_sectors;
136
137 sector_t hard_sector; /* next sector to complete */
138 unsigned long hard_nr_sectors; /* no. of sectors left to complete */
139 /* no. of sectors left to complete in the current segment */
140 unsigned int hard_cur_sectors;
141
142 struct bio *bio;
143 struct bio *biotail;
144
145 void *elevator_private;
ff856bad 146 void *completion_data;
1da177e4 147
22e2c507
JA
148 unsigned short ioprio;
149
1da177e4
LT
150 int rq_status; /* should split this into a few status bits */
151 struct gendisk *rq_disk;
152 int errors;
153 unsigned long start_time;
154
155 /* Number of scatter-gather DMA addr+len pairs after
156 * physical address coalescing is performed.
157 */
158 unsigned short nr_phys_segments;
159
160 /* Number of scatter-gather addr+len pairs after
161 * physical and DMA remapping hardware coalescing is performed.
162 * This is the number of scatter-gather entries the driver
163 * will actually have to deal with after DMA mapping is done.
164 */
165 unsigned short nr_hw_segments;
166
167 int tag;
168 char *buffer;
169
170 int ref_count;
171 request_queue_t *q;
172 struct request_list *rl;
173
174 struct completion *waiting;
175 void *special;
176
177 /*
178 * when request is used as a packet command carrier
179 */
180 unsigned int cmd_len;
181 unsigned char cmd[BLK_MAX_CDB];
182
183 unsigned int data_len;
184 void *data;
185
186 unsigned int sense_len;
187 void *sense;
188
189 unsigned int timeout;
17e01f21 190 int retries;
1da177e4
LT
191
192 /*
193 * For Power Management requests
194 */
195 struct request_pm_state *pm;
196
197 /*
198 * completion callback. end_io_data should be folded in with waiting
199 */
200 rq_end_io_fn *end_io;
201 void *end_io_data;
202};
203
204/*
205 * first three bits match BIO_RW* bits, important
206 */
207enum rq_flag_bits {
208 __REQ_RW, /* not set, read. set, write */
209 __REQ_FAILFAST, /* no low level driver retries */
8922e16c 210 __REQ_SORTED, /* elevator knows about this request */
1da177e4
LT
211 __REQ_SOFTBARRIER, /* may not be passed by ioscheduler */
212 __REQ_HARDBARRIER, /* may not be passed by drive either */
797e7dbb 213 __REQ_FUA, /* forced unit access */
1da177e4
LT
214 __REQ_CMD, /* is a regular fs rw request */
215 __REQ_NOMERGE, /* don't touch this for merging */
216 __REQ_STARTED, /* drive already may have started this one */
217 __REQ_DONTPREP, /* don't call prep for this one */
218 __REQ_QUEUED, /* uses queueing */
cb98fc8b 219 __REQ_ELVPRIV, /* elevator private data attached */
1da177e4
LT
220 /*
221 * for ATA/ATAPI devices
222 */
223 __REQ_PC, /* packet command (special) */
224 __REQ_BLOCK_PC, /* queued down pc from block layer */
225 __REQ_SENSE, /* sense retrival */
226
227 __REQ_FAILED, /* set if the request failed */
228 __REQ_QUIET, /* don't worry about errors */
229 __REQ_SPECIAL, /* driver suplied command */
230 __REQ_DRIVE_CMD,
231 __REQ_DRIVE_TASK,
232 __REQ_DRIVE_TASKFILE,
233 __REQ_PREEMPT, /* set for "ide_preempt" requests */
234 __REQ_PM_SUSPEND, /* suspend request */
235 __REQ_PM_RESUME, /* resume request */
236 __REQ_PM_SHUTDOWN, /* shutdown request */
797e7dbb 237 __REQ_ORDERED_COLOR, /* is before or after barrier */
1da177e4
LT
238 __REQ_NR_BITS, /* stops here */
239};
240
241#define REQ_RW (1 << __REQ_RW)
242#define REQ_FAILFAST (1 << __REQ_FAILFAST)
8922e16c 243#define REQ_SORTED (1 << __REQ_SORTED)
1da177e4
LT
244#define REQ_SOFTBARRIER (1 << __REQ_SOFTBARRIER)
245#define REQ_HARDBARRIER (1 << __REQ_HARDBARRIER)
797e7dbb 246#define REQ_FUA (1 << __REQ_FUA)
1da177e4
LT
247#define REQ_CMD (1 << __REQ_CMD)
248#define REQ_NOMERGE (1 << __REQ_NOMERGE)
249#define REQ_STARTED (1 << __REQ_STARTED)
250#define REQ_DONTPREP (1 << __REQ_DONTPREP)
251#define REQ_QUEUED (1 << __REQ_QUEUED)
cb98fc8b 252#define REQ_ELVPRIV (1 << __REQ_ELVPRIV)
1da177e4
LT
253#define REQ_PC (1 << __REQ_PC)
254#define REQ_BLOCK_PC (1 << __REQ_BLOCK_PC)
255#define REQ_SENSE (1 << __REQ_SENSE)
256#define REQ_FAILED (1 << __REQ_FAILED)
257#define REQ_QUIET (1 << __REQ_QUIET)
258#define REQ_SPECIAL (1 << __REQ_SPECIAL)
259#define REQ_DRIVE_CMD (1 << __REQ_DRIVE_CMD)
260#define REQ_DRIVE_TASK (1 << __REQ_DRIVE_TASK)
261#define REQ_DRIVE_TASKFILE (1 << __REQ_DRIVE_TASKFILE)
262#define REQ_PREEMPT (1 << __REQ_PREEMPT)
263#define REQ_PM_SUSPEND (1 << __REQ_PM_SUSPEND)
264#define REQ_PM_RESUME (1 << __REQ_PM_RESUME)
265#define REQ_PM_SHUTDOWN (1 << __REQ_PM_SHUTDOWN)
797e7dbb 266#define REQ_ORDERED_COLOR (1 << __REQ_ORDERED_COLOR)
1da177e4
LT
267
268/*
269 * State information carried for REQ_PM_SUSPEND and REQ_PM_RESUME
270 * requests. Some step values could eventually be made generic.
271 */
272struct request_pm_state
273{
274 /* PM state machine step value, currently driver specific */
275 int pm_step;
276 /* requested PM state value (S1, S2, S3, S4, ...) */
277 u32 pm_state;
278 void* data; /* for driver use */
279};
280
281#include <linux/elevator.h>
282
283typedef int (merge_request_fn) (request_queue_t *, struct request *,
284 struct bio *);
285typedef int (merge_requests_fn) (request_queue_t *, struct request *,
286 struct request *);
287typedef void (request_fn_proc) (request_queue_t *q);
288typedef int (make_request_fn) (request_queue_t *q, struct bio *bio);
289typedef int (prep_rq_fn) (request_queue_t *, struct request *);
290typedef void (unplug_fn) (request_queue_t *);
291
292struct bio_vec;
293typedef int (merge_bvec_fn) (request_queue_t *, struct bio *, struct bio_vec *);
294typedef void (activity_fn) (void *data, int rw);
295typedef int (issue_flush_fn) (request_queue_t *, struct gendisk *, sector_t *);
797e7dbb 296typedef void (prepare_flush_fn) (request_queue_t *, struct request *);
ff856bad 297typedef void (softirq_done_fn)(struct request *);
1da177e4
LT
298
299enum blk_queue_state {
300 Queue_down,
301 Queue_up,
302};
303
1da177e4
LT
304struct blk_queue_tag {
305 struct request **tag_index; /* map of busy tags */
306 unsigned long *tag_map; /* bit map of free/busy tags */
307 struct list_head busy_list; /* fifo list of busy tags */
308 int busy; /* current depth */
309 int max_depth; /* what we will send to device */
ba025082 310 int real_max_depth; /* what the array can hold */
1da177e4
LT
311 atomic_t refcnt; /* map can be shared */
312};
313
314struct request_queue
315{
316 /*
317 * Together with queue_head for cacheline sharing
318 */
319 struct list_head queue_head;
320 struct request *last_merge;
321 elevator_t *elevator;
322
323 /*
324 * the queue request freelist, one for reads and one for writes
325 */
326 struct request_list rq;
327
328 request_fn_proc *request_fn;
329 merge_request_fn *back_merge_fn;
330 merge_request_fn *front_merge_fn;
331 merge_requests_fn *merge_requests_fn;
332 make_request_fn *make_request_fn;
333 prep_rq_fn *prep_rq_fn;
334 unplug_fn *unplug_fn;
335 merge_bvec_fn *merge_bvec_fn;
336 activity_fn *activity_fn;
337 issue_flush_fn *issue_flush_fn;
338 prepare_flush_fn *prepare_flush_fn;
ff856bad 339 softirq_done_fn *softirq_done_fn;
1da177e4 340
8922e16c
TH
341 /*
342 * Dispatch queue sorting
343 */
1b47f531 344 sector_t end_sector;
8922e16c 345 struct request *boundary_rq;
8922e16c 346
1da177e4
LT
347 /*
348 * Auto-unplugging state
349 */
350 struct timer_list unplug_timer;
351 int unplug_thresh; /* After this many requests */
352 unsigned long unplug_delay; /* After this many jiffies */
353 struct work_struct unplug_work;
354
355 struct backing_dev_info backing_dev_info;
356
357 /*
358 * The queue owner gets to use this for whatever they like.
359 * ll_rw_blk doesn't touch it.
360 */
361 void *queuedata;
362
363 void *activity_data;
364
365 /*
366 * queue needs bounce pages for pages above this limit
367 */
368 unsigned long bounce_pfn;
8267e268 369 gfp_t bounce_gfp;
1da177e4
LT
370
371 /*
372 * various queue flags, see QUEUE_* below
373 */
374 unsigned long queue_flags;
375
376 /*
152587de
JA
377 * protects queue structures from reentrancy. ->__queue_lock should
378 * _never_ be used directly, it is queue private. always use
379 * ->queue_lock.
1da177e4 380 */
152587de 381 spinlock_t __queue_lock;
1da177e4
LT
382 spinlock_t *queue_lock;
383
384 /*
385 * queue kobject
386 */
387 struct kobject kobj;
388
389 /*
390 * queue settings
391 */
392 unsigned long nr_requests; /* Max # of requests */
393 unsigned int nr_congestion_on;
394 unsigned int nr_congestion_off;
395 unsigned int nr_batching;
396
2cb2e147
JA
397 unsigned int max_sectors;
398 unsigned int max_hw_sectors;
1da177e4
LT
399 unsigned short max_phys_segments;
400 unsigned short max_hw_segments;
401 unsigned short hardsect_size;
402 unsigned int max_segment_size;
403
404 unsigned long seg_boundary_mask;
405 unsigned int dma_alignment;
406
407 struct blk_queue_tag *queue_tags;
408
409 atomic_t refcnt;
410
15853af9 411 unsigned int nr_sorted;
1da177e4
LT
412 unsigned int in_flight;
413
414 /*
415 * sg stuff
416 */
417 unsigned int sg_timeout;
418 unsigned int sg_reserved_size;
1946089a 419 int node;
1da177e4 420
1da177e4
LT
421 /*
422 * reserved for flush operations
423 */
797e7dbb
TH
424 unsigned int ordered, next_ordered, ordseq;
425 int orderr, ordcolor;
426 struct request pre_flush_rq, bar_rq, post_flush_rq;
427 struct request *orig_bar_rq;
428 unsigned int bi_size;
1da177e4
LT
429};
430
431#define RQ_INACTIVE (-1)
432#define RQ_ACTIVE 1
433#define RQ_SCSI_BUSY 0xffff
434#define RQ_SCSI_DONE 0xfffe
435#define RQ_SCSI_DISCONNECTING 0xffe0
436
437#define QUEUE_FLAG_CLUSTER 0 /* cluster several segments into 1 */
438#define QUEUE_FLAG_QUEUED 1 /* uses generic tag queueing */
439#define QUEUE_FLAG_STOPPED 2 /* queue is stopped */
440#define QUEUE_FLAG_READFULL 3 /* write queue has been filled */
441#define QUEUE_FLAG_WRITEFULL 4 /* read queue has been filled */
442#define QUEUE_FLAG_DEAD 5 /* queue being torn down */
443#define QUEUE_FLAG_REENTER 6 /* Re-entrancy avoidance */
444#define QUEUE_FLAG_PLUGGED 7 /* queue is plugged */
64521d1a 445#define QUEUE_FLAG_ELVSWITCH 8 /* don't use elevator, just do FIFO */
797e7dbb
TH
446
447enum {
448 /*
449 * Hardbarrier is supported with one of the following methods.
450 *
451 * NONE : hardbarrier unsupported
452 * DRAIN : ordering by draining is enough
453 * DRAIN_FLUSH : ordering by draining w/ pre and post flushes
454 * DRAIN_FUA : ordering by draining w/ pre flush and FUA write
455 * TAG : ordering by tag is enough
456 * TAG_FLUSH : ordering by tag w/ pre and post flushes
457 * TAG_FUA : ordering by tag w/ pre flush and FUA write
458 */
459 QUEUE_ORDERED_NONE = 0x00,
460 QUEUE_ORDERED_DRAIN = 0x01,
461 QUEUE_ORDERED_TAG = 0x02,
462
463 QUEUE_ORDERED_PREFLUSH = 0x10,
464 QUEUE_ORDERED_POSTFLUSH = 0x20,
465 QUEUE_ORDERED_FUA = 0x40,
466
467 QUEUE_ORDERED_DRAIN_FLUSH = QUEUE_ORDERED_DRAIN |
468 QUEUE_ORDERED_PREFLUSH | QUEUE_ORDERED_POSTFLUSH,
469 QUEUE_ORDERED_DRAIN_FUA = QUEUE_ORDERED_DRAIN |
470 QUEUE_ORDERED_PREFLUSH | QUEUE_ORDERED_FUA,
471 QUEUE_ORDERED_TAG_FLUSH = QUEUE_ORDERED_TAG |
472 QUEUE_ORDERED_PREFLUSH | QUEUE_ORDERED_POSTFLUSH,
473 QUEUE_ORDERED_TAG_FUA = QUEUE_ORDERED_TAG |
474 QUEUE_ORDERED_PREFLUSH | QUEUE_ORDERED_FUA,
475
476 /*
477 * Ordered operation sequence
478 */
479 QUEUE_ORDSEQ_STARTED = 0x01, /* flushing in progress */
480 QUEUE_ORDSEQ_DRAIN = 0x02, /* waiting for the queue to be drained */
481 QUEUE_ORDSEQ_PREFLUSH = 0x04, /* pre-flushing in progress */
482 QUEUE_ORDSEQ_BAR = 0x08, /* original barrier req in progress */
483 QUEUE_ORDSEQ_POSTFLUSH = 0x10, /* post-flushing in progress */
484 QUEUE_ORDSEQ_DONE = 0x20,
485};
1da177e4
LT
486
487#define blk_queue_plugged(q) test_bit(QUEUE_FLAG_PLUGGED, &(q)->queue_flags)
488#define blk_queue_tagged(q) test_bit(QUEUE_FLAG_QUEUED, &(q)->queue_flags)
489#define blk_queue_stopped(q) test_bit(QUEUE_FLAG_STOPPED, &(q)->queue_flags)
797e7dbb 490#define blk_queue_flushing(q) ((q)->ordseq)
1da177e4
LT
491
492#define blk_fs_request(rq) ((rq)->flags & REQ_CMD)
493#define blk_pc_request(rq) ((rq)->flags & REQ_BLOCK_PC)
494#define blk_noretry_request(rq) ((rq)->flags & REQ_FAILFAST)
495#define blk_rq_started(rq) ((rq)->flags & REQ_STARTED)
496
497#define blk_account_rq(rq) (blk_rq_started(rq) && blk_fs_request(rq))
498
499#define blk_pm_suspend_request(rq) ((rq)->flags & REQ_PM_SUSPEND)
500#define blk_pm_resume_request(rq) ((rq)->flags & REQ_PM_RESUME)
501#define blk_pm_request(rq) \
502 ((rq)->flags & (REQ_PM_SUSPEND | REQ_PM_RESUME))
503
8922e16c 504#define blk_sorted_rq(rq) ((rq)->flags & REQ_SORTED)
1da177e4 505#define blk_barrier_rq(rq) ((rq)->flags & REQ_HARDBARRIER)
797e7dbb 506#define blk_fua_rq(rq) ((rq)->flags & REQ_FUA)
1da177e4
LT
507
508#define list_entry_rq(ptr) list_entry((ptr), struct request, queuelist)
509
510#define rq_data_dir(rq) ((rq)->flags & 1)
511
512static inline int blk_queue_full(struct request_queue *q, int rw)
513{
514 if (rw == READ)
515 return test_bit(QUEUE_FLAG_READFULL, &q->queue_flags);
516 return test_bit(QUEUE_FLAG_WRITEFULL, &q->queue_flags);
517}
518
519static inline void blk_set_queue_full(struct request_queue *q, int rw)
520{
521 if (rw == READ)
522 set_bit(QUEUE_FLAG_READFULL, &q->queue_flags);
523 else
524 set_bit(QUEUE_FLAG_WRITEFULL, &q->queue_flags);
525}
526
527static inline void blk_clear_queue_full(struct request_queue *q, int rw)
528{
529 if (rw == READ)
530 clear_bit(QUEUE_FLAG_READFULL, &q->queue_flags);
531 else
532 clear_bit(QUEUE_FLAG_WRITEFULL, &q->queue_flags);
533}
534
535
536/*
537 * mergeable request must not have _NOMERGE or _BARRIER bit set, nor may
538 * it already be started by driver.
539 */
540#define RQ_NOMERGE_FLAGS \
541 (REQ_NOMERGE | REQ_STARTED | REQ_HARDBARRIER | REQ_SOFTBARRIER)
542#define rq_mergeable(rq) \
543 (!((rq)->flags & RQ_NOMERGE_FLAGS) && blk_fs_request((rq)))
544
545/*
546 * noop, requests are automagically marked as active/inactive by I/O
547 * scheduler -- see elv_next_request
548 */
549#define blk_queue_headactive(q, head_active)
550
551/*
552 * q->prep_rq_fn return values
553 */
554#define BLKPREP_OK 0 /* serve it */
555#define BLKPREP_KILL 1 /* fatal error, kill */
556#define BLKPREP_DEFER 2 /* leave on queue */
557
558extern unsigned long blk_max_low_pfn, blk_max_pfn;
559
560/*
561 * standard bounce addresses:
562 *
563 * BLK_BOUNCE_HIGH : bounce all highmem pages
564 * BLK_BOUNCE_ANY : don't bounce anything
565 * BLK_BOUNCE_ISA : bounce pages above ISA DMA boundary
566 */
567#define BLK_BOUNCE_HIGH ((u64)blk_max_low_pfn << PAGE_SHIFT)
568#define BLK_BOUNCE_ANY ((u64)blk_max_pfn << PAGE_SHIFT)
569#define BLK_BOUNCE_ISA (ISA_DMA_THRESHOLD)
570
571#ifdef CONFIG_MMU
572extern int init_emergency_isa_pool(void);
573extern void blk_queue_bounce(request_queue_t *q, struct bio **bio);
574#else
575static inline int init_emergency_isa_pool(void)
576{
577 return 0;
578}
579static inline void blk_queue_bounce(request_queue_t *q, struct bio **bio)
580{
581}
582#endif /* CONFIG_MMU */
583
584#define rq_for_each_bio(_bio, rq) \
585 if ((rq->bio)) \
586 for (_bio = (rq)->bio; _bio; _bio = _bio->bi_next)
587
588struct sec_size {
589 unsigned block_size;
590 unsigned block_size_bits;
591};
592
593extern int blk_register_queue(struct gendisk *disk);
594extern void blk_unregister_queue(struct gendisk *disk);
595extern void register_disk(struct gendisk *dev);
596extern void generic_make_request(struct bio *bio);
597extern void blk_put_request(struct request *);
6e39b69e 598extern void __blk_put_request(request_queue_t *, struct request *);
8ffdc655 599extern void blk_end_sync_rq(struct request *rq, int error);
8267e268 600extern struct request *blk_get_request(request_queue_t *, int, gfp_t);
867d1191 601extern void blk_insert_request(request_queue_t *, struct request *, int, void *);
1da177e4
LT
602extern void blk_requeue_request(request_queue_t *, struct request *);
603extern void blk_plug_device(request_queue_t *);
604extern int blk_remove_plug(request_queue_t *);
605extern void blk_recount_segments(request_queue_t *, struct bio *);
1da177e4
LT
606extern int scsi_cmd_ioctl(struct file *, struct gendisk *, unsigned int, void __user *);
607extern void blk_start_queue(request_queue_t *q);
608extern void blk_stop_queue(request_queue_t *q);
609extern void blk_sync_queue(struct request_queue *q);
610extern void __blk_stop_queue(request_queue_t *q);
611extern void blk_run_queue(request_queue_t *);
612extern void blk_queue_activity_fn(request_queue_t *, activity_fn *, void *);
dd1cab95
JA
613extern int blk_rq_map_user(request_queue_t *, struct request *, void __user *, unsigned int);
614extern int blk_rq_unmap_user(struct bio *, unsigned int);
8267e268 615extern int blk_rq_map_kern(request_queue_t *, struct request *, void *, unsigned int, gfp_t);
f1970baf 616extern int blk_rq_map_user_iov(request_queue_t *, struct request *, struct sg_iovec *, int);
994ca9a1
JB
617extern int blk_execute_rq(request_queue_t *, struct gendisk *,
618 struct request *, int);
6e39b69e 619extern void blk_execute_rq_nowait(request_queue_t *, struct gendisk *,
15fc858a 620 struct request *, int, rq_end_io_fn *);
6e39b69e 621
1da177e4
LT
622static inline request_queue_t *bdev_get_queue(struct block_device *bdev)
623{
624 return bdev->bd_disk->queue;
625}
626
627static inline void blk_run_backing_dev(struct backing_dev_info *bdi,
628 struct page *page)
629{
630 if (bdi && bdi->unplug_io_fn)
631 bdi->unplug_io_fn(bdi, page);
632}
633
634static inline void blk_run_address_space(struct address_space *mapping)
635{
636 if (mapping)
637 blk_run_backing_dev(mapping->backing_dev_info, NULL);
638}
639
640/*
641 * end_request() and friends. Must be called with the request queue spinlock
642 * acquired. All functions called within end_request() _must_be_ atomic.
643 *
644 * Several drivers define their own end_request and call
645 * end_that_request_first() and end_that_request_last()
646 * for parts of the original function. This prevents
647 * code duplication in drivers.
648 */
649extern int end_that_request_first(struct request *, int, int);
650extern int end_that_request_chunk(struct request *, int, int);
8ffdc655 651extern void end_that_request_last(struct request *, int);
1da177e4 652extern void end_request(struct request *req, int uptodate);
ff856bad
JA
653extern void blk_complete_request(struct request *);
654
655static inline int rq_all_done(struct request *rq, unsigned int nr_bytes)
656{
657 if (blk_fs_request(rq))
658 return (nr_bytes >= (rq->hard_nr_sectors << 9));
659 else if (blk_pc_request(rq))
660 return nr_bytes >= rq->data_len;
661
662 return 0;
663}
1da177e4
LT
664
665/*
666 * end_that_request_first/chunk() takes an uptodate argument. we account
667 * any value <= as an io error. 0 means -EIO for compatability reasons,
668 * any other < 0 value is the direct error type. An uptodate value of
669 * 1 indicates successful io completion
670 */
671#define end_io_error(uptodate) (unlikely((uptodate) <= 0))
672
673static inline void blkdev_dequeue_request(struct request *req)
674{
8922e16c 675 elv_dequeue_request(req->q, req);
1da177e4 676}
1da177e4 677
1b47f531
JA
678/*
679 * This should be in elevator.h, but that requires pulling in rq and q
680 */
681static inline void elv_dispatch_add_tail(struct request_queue *q,
682 struct request *rq)
683{
06b86245
TH
684 if (q->last_merge == rq)
685 q->last_merge = NULL;
15853af9 686 q->nr_sorted--;
1da177e4 687
1b47f531
JA
688 q->end_sector = rq_end_sector(rq);
689 q->boundary_rq = rq;
690 list_add_tail(&rq->queuelist, &q->queue_head);
1da177e4
LT
691}
692
693/*
694 * Access functions for manipulating queue properties
695 */
1946089a
CL
696extern request_queue_t *blk_init_queue_node(request_fn_proc *rfn,
697 spinlock_t *lock, int node_id);
1da177e4
LT
698extern request_queue_t *blk_init_queue(request_fn_proc *, spinlock_t *);
699extern void blk_cleanup_queue(request_queue_t *);
700extern void blk_queue_make_request(request_queue_t *, make_request_fn *);
701extern void blk_queue_bounce_limit(request_queue_t *, u64);
2cb2e147 702extern void blk_queue_max_sectors(request_queue_t *, unsigned int);
1da177e4
LT
703extern void blk_queue_max_phys_segments(request_queue_t *, unsigned short);
704extern void blk_queue_max_hw_segments(request_queue_t *, unsigned short);
705extern void blk_queue_max_segment_size(request_queue_t *, unsigned int);
706extern void blk_queue_hardsect_size(request_queue_t *, unsigned short);
707extern void blk_queue_stack_limits(request_queue_t *t, request_queue_t *b);
708extern void blk_queue_segment_boundary(request_queue_t *, unsigned long);
709extern void blk_queue_prep_rq(request_queue_t *, prep_rq_fn *pfn);
710extern void blk_queue_merge_bvec(request_queue_t *, merge_bvec_fn *);
711extern void blk_queue_dma_alignment(request_queue_t *, int);
ff856bad 712extern void blk_queue_softirq_done(request_queue_t *, softirq_done_fn *);
1da177e4 713extern struct backing_dev_info *blk_get_backing_dev_info(struct block_device *bdev);
797e7dbb 714extern int blk_queue_ordered(request_queue_t *, unsigned, prepare_flush_fn *);
1da177e4 715extern void blk_queue_issue_flush_fn(request_queue_t *, issue_flush_fn *);
797e7dbb
TH
716extern int blk_do_ordered(request_queue_t *, struct request **);
717extern unsigned blk_ordered_cur_seq(request_queue_t *);
718extern unsigned blk_ordered_req_seq(struct request *);
719extern void blk_ordered_complete_seq(request_queue_t *, unsigned, int);
1da177e4
LT
720
721extern int blk_rq_map_sg(request_queue_t *, struct request *, struct scatterlist *);
722extern void blk_dump_rq_flags(struct request *, char *);
723extern void generic_unplug_device(request_queue_t *);
724extern void __generic_unplug_device(request_queue_t *);
725extern long nr_blockdev_pages(void);
1da177e4
LT
726
727int blk_get_queue(request_queue_t *);
8267e268
AV
728request_queue_t *blk_alloc_queue(gfp_t);
729request_queue_t *blk_alloc_queue_node(gfp_t, int);
1da177e4
LT
730#define blk_put_queue(q) blk_cleanup_queue((q))
731
732/*
733 * tag stuff
734 */
735#define blk_queue_tag_depth(q) ((q)->queue_tags->busy)
736#define blk_queue_tag_queue(q) ((q)->queue_tags->busy < (q)->queue_tags->max_depth)
737#define blk_rq_tagged(rq) ((rq)->flags & REQ_QUEUED)
738extern int blk_queue_start_tag(request_queue_t *, struct request *);
739extern struct request *blk_queue_find_tag(request_queue_t *, int);
740extern void blk_queue_end_tag(request_queue_t *, struct request *);
741extern int blk_queue_init_tags(request_queue_t *, int, struct blk_queue_tag *);
742extern void blk_queue_free_tags(request_queue_t *);
743extern int blk_queue_resize_tags(request_queue_t *, int);
744extern void blk_queue_invalidate_tags(request_queue_t *);
745extern long blk_congestion_wait(int rw, long timeout);
746
747extern void blk_rq_bio_prep(request_queue_t *, struct request *, struct bio *);
748extern int blkdev_issue_flush(struct block_device *, sector_t *);
749
750#define MAX_PHYS_SEGMENTS 128
751#define MAX_HW_SEGMENTS 128
defd94b7
MC
752#define SAFE_MAX_SECTORS 255
753#define BLK_DEF_MAX_SECTORS 1024
1da177e4
LT
754
755#define MAX_SEGMENT_SIZE 65536
756
757#define blkdev_entry_to_request(entry) list_entry((entry), struct request, queuelist)
758
1da177e4
LT
759static inline int queue_hardsect_size(request_queue_t *q)
760{
761 int retval = 512;
762
763 if (q && q->hardsect_size)
764 retval = q->hardsect_size;
765
766 return retval;
767}
768
769static inline int bdev_hardsect_size(struct block_device *bdev)
770{
771 return queue_hardsect_size(bdev_get_queue(bdev));
772}
773
774static inline int queue_dma_alignment(request_queue_t *q)
775{
776 int retval = 511;
777
778 if (q && q->dma_alignment)
779 retval = q->dma_alignment;
780
781 return retval;
782}
783
784static inline int bdev_dma_aligment(struct block_device *bdev)
785{
786 return queue_dma_alignment(bdev_get_queue(bdev));
787}
788
789#define blk_finished_io(nsects) do { } while (0)
790#define blk_started_io(nsects) do { } while (0)
791
792/* assumes size > 256 */
793static inline unsigned int blksize_bits(unsigned int size)
794{
795 unsigned int bits = 8;
796 do {
797 bits++;
798 size >>= 1;
799 } while (size > 256);
800 return bits;
801}
802
2befb9e3 803static inline unsigned int block_size(struct block_device *bdev)
1da177e4
LT
804{
805 return bdev->bd_block_size;
806}
807
808typedef struct {struct page *v;} Sector;
809
810unsigned char *read_dev_sector(struct block_device *, sector_t, Sector *);
811
812static inline void put_dev_sector(Sector p)
813{
814 page_cache_release(p.v);
815}
816
817struct work_struct;
818int kblockd_schedule_work(struct work_struct *work);
819void kblockd_flush(void);
820
821#ifdef CONFIG_LBD
822# include <asm/div64.h>
823# define sector_div(a, b) do_div(a, b)
824#else
825# define sector_div(n, b)( \
826{ \
827 int _res; \
828 _res = (n) % (b); \
829 (n) /= (b); \
830 _res; \
831} \
832)
833#endif
834
835#define MODULE_ALIAS_BLOCKDEV(major,minor) \
836 MODULE_ALIAS("block-major-" __stringify(major) "-" __stringify(minor))
837#define MODULE_ALIAS_BLOCKDEV_MAJOR(major) \
838 MODULE_ALIAS("block-major-" __stringify(major) "-*")
839
840
841#endif