blob: 8a3e309e08427c1c27ad8df167754aa1fa507748 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001#ifndef _LINUX_BLKDEV_H
2#define _LINUX_BLKDEV_H
3
Linus Torvalds1da177e2005-04-16 15:20:36 -07004#include <linux/major.h>
5#include <linux/genhd.h>
6#include <linux/list.h>
7#include <linux/timer.h>
8#include <linux/workqueue.h>
9#include <linux/pagemap.h>
10#include <linux/backing-dev.h>
11#include <linux/wait.h>
12#include <linux/mempool.h>
13#include <linux/bio.h>
14#include <linux/module.h>
15#include <linux/stringify.h>
16
17#include <asm/scatterlist.h>
18
Christoph Hellwig21b2f0c2006-03-22 17:52:04 +010019struct scsi_ioctl_command;
20
Linus Torvalds1da177e2005-04-16 15:20:36 -070021struct request_queue;
22typedef struct request_queue request_queue_t;
23struct elevator_queue;
24typedef struct elevator_queue elevator_t;
25struct request_pm_state;
Jens Axboe2056a782006-03-23 20:00:26 +010026struct blk_trace;
Linus Torvalds1da177e2005-04-16 15:20:36 -070027
28#define BLKDEV_MIN_RQ 4
29#define BLKDEV_MAX_RQ 128 /* Default maximum */
30
31/*
32 * This is the per-process anticipatory I/O scheduler state.
33 */
34struct as_io_context {
35 spinlock_t lock;
36
37 void (*dtor)(struct as_io_context *aic); /* destructor */
38 void (*exit)(struct as_io_context *aic); /* called on task exit */
39
40 unsigned long state;
41 atomic_t nr_queued; /* queued reads & sync writes */
42 atomic_t nr_dispatched; /* number of requests gone to the drivers */
43
44 /* IO History tracking */
45 /* Thinktime */
46 unsigned long last_end_request;
47 unsigned long ttime_total;
48 unsigned long ttime_samples;
49 unsigned long ttime_mean;
50 /* Layout pattern */
51 unsigned int seek_samples;
52 sector_t last_request_pos;
53 u64 seek_total;
54 sector_t seek_mean;
55};
56
57struct cfq_queue;
58struct cfq_io_context {
Jens Axboee2d74ac2006-03-28 08:59:01 +020059 struct rb_node rb_node;
Jens Axboe22e2c502005-06-27 10:55:12 +020060 void *key;
61
Jens Axboee2d74ac2006-03-28 08:59:01 +020062 struct cfq_queue *cfqq[2];
63
Jens Axboe22e2c502005-06-27 10:55:12 +020064 struct io_context *ioc;
65
66 unsigned long last_end_request;
Jens Axboe206dc692006-03-28 13:03:44 +020067 sector_t last_request_pos;
68 unsigned long last_queue;
69
Jens Axboe22e2c502005-06-27 10:55:12 +020070 unsigned long ttime_total;
71 unsigned long ttime_samples;
72 unsigned long ttime_mean;
73
Jens Axboe206dc692006-03-28 13:03:44 +020074 unsigned int seek_samples;
75 u64 seek_total;
76 sector_t seek_mean;
77
Al Virod9ff4182006-03-18 13:51:22 -050078 struct list_head queue_list;
79
Jens Axboee2d74ac2006-03-28 08:59:01 +020080 void (*dtor)(struct io_context *); /* destructor */
81 void (*exit)(struct io_context *); /* called on task exit */
Linus Torvalds1da177e2005-04-16 15:20:36 -070082};
83
84/*
85 * This is the per-process I/O subsystem state. It is refcounted and
86 * kmalloc'ed. Currently all fields are modified in process io context
87 * (apart from the atomic refcount), so require no locking.
88 */
89struct io_context {
90 atomic_t refcount;
Jens Axboe22e2c502005-06-27 10:55:12 +020091 struct task_struct *task;
92
93 int (*set_ioprio)(struct io_context *, unsigned int);
Linus Torvalds1da177e2005-04-16 15:20:36 -070094
95 /*
96 * For request batching
97 */
98 unsigned long last_waited; /* Time last woken after wait for request */
99 int nr_batch_requests; /* Number of requests left in the batch */
100
Linus Torvalds1da177e2005-04-16 15:20:36 -0700101 struct as_io_context *aic;
Jens Axboee2d74ac2006-03-28 08:59:01 +0200102 struct rb_root cic_root;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700103};
104
105void put_io_context(struct io_context *ioc);
106void exit_io_context(void);
Al Viro8267e262005-10-21 03:20:53 -0400107struct io_context *current_io_context(gfp_t gfp_flags);
108struct io_context *get_io_context(gfp_t gfp_flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700109void copy_io_context(struct io_context **pdst, struct io_context **psrc);
110void swap_io_context(struct io_context **ioc1, struct io_context **ioc2);
111
112struct request;
Tejun Heo8ffdc652006-01-06 09:49:03 +0100113typedef void (rq_end_io_fn)(struct request *, int);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700114
115struct request_list {
116 int count[2];
117 int starved[2];
Tejun Heocb98fc82005-10-28 08:29:39 +0200118 int elvpriv;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700119 mempool_t *rq_pool;
120 wait_queue_head_t wait[2];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700121};
122
Jens Axboe4aff5e22006-08-10 08:44:47 +0200123/*
124 * request command types
125 */
126enum rq_cmd_type_bits {
127 REQ_TYPE_FS = 1, /* fs request */
128 REQ_TYPE_BLOCK_PC, /* scsi command */
129 REQ_TYPE_SENSE, /* sense request */
130 REQ_TYPE_PM_SUSPEND, /* suspend request */
131 REQ_TYPE_PM_RESUME, /* resume request */
132 REQ_TYPE_PM_SHUTDOWN, /* shutdown request */
133 REQ_TYPE_FLUSH, /* flush request */
134 REQ_TYPE_SPECIAL, /* driver defined type */
135 REQ_TYPE_LINUX_BLOCK, /* generic block layer message */
136 /*
137 * for ATA/ATAPI devices. this really doesn't belong here, ide should
138 * use REQ_TYPE_SPECIAL and use rq->cmd[0] with the range of driver
139 * private REQ_LB opcodes to differentiate what type of request this is
140 */
141 REQ_TYPE_ATA_CMD,
142 REQ_TYPE_ATA_TASK,
143 REQ_TYPE_ATA_TASKFILE,
144};
145
146/*
147 * For request of type REQ_TYPE_LINUX_BLOCK, rq->cmd[0] is the opcode being
148 * sent down (similar to how REQ_TYPE_BLOCK_PC means that ->cmd[] holds a
149 * SCSI cdb.
150 *
151 * 0x00 -> 0x3f are driver private, to be used for whatever purpose they need,
152 * typically to differentiate REQ_TYPE_SPECIAL requests.
153 *
154 */
155enum {
156 /*
157 * just examples for now
158 */
159 REQ_LB_OP_EJECT = 0x40, /* eject request */
160 REQ_LB_OP_FLUSH = 0x41, /* flush device */
161};
162
163/*
164 * request type modified bits. first three bits match BIO_RW* bits, important
165 */
166enum rq_flag_bits {
167 __REQ_RW, /* not set, read. set, write */
168 __REQ_FAILFAST, /* no low level driver retries */
169 __REQ_SORTED, /* elevator knows about this request */
170 __REQ_SOFTBARRIER, /* may not be passed by ioscheduler */
171 __REQ_HARDBARRIER, /* may not be passed by drive either */
172 __REQ_FUA, /* forced unit access */
173 __REQ_NOMERGE, /* don't touch this for merging */
174 __REQ_STARTED, /* drive already may have started this one */
175 __REQ_DONTPREP, /* don't call prep for this one */
176 __REQ_QUEUED, /* uses queueing */
177 __REQ_ELVPRIV, /* elevator private data attached */
178 __REQ_FAILED, /* set if the request failed */
179 __REQ_QUIET, /* don't worry about errors */
180 __REQ_PREEMPT, /* set for "ide_preempt" requests */
181 __REQ_ORDERED_COLOR, /* is before or after barrier */
182 __REQ_RW_SYNC, /* request is sync (O_DIRECT) */
Jens Axboe49171e52006-08-10 08:59:11 +0200183 __REQ_ALLOCED, /* request came from our alloc pool */
Jens Axboe4aff5e22006-08-10 08:44:47 +0200184 __REQ_NR_BITS, /* stops here */
185};
186
187#define REQ_RW (1 << __REQ_RW)
188#define REQ_FAILFAST (1 << __REQ_FAILFAST)
189#define REQ_SORTED (1 << __REQ_SORTED)
190#define REQ_SOFTBARRIER (1 << __REQ_SOFTBARRIER)
191#define REQ_HARDBARRIER (1 << __REQ_HARDBARRIER)
192#define REQ_FUA (1 << __REQ_FUA)
193#define REQ_NOMERGE (1 << __REQ_NOMERGE)
194#define REQ_STARTED (1 << __REQ_STARTED)
195#define REQ_DONTPREP (1 << __REQ_DONTPREP)
196#define REQ_QUEUED (1 << __REQ_QUEUED)
197#define REQ_ELVPRIV (1 << __REQ_ELVPRIV)
198#define REQ_FAILED (1 << __REQ_FAILED)
199#define REQ_QUIET (1 << __REQ_QUIET)
200#define REQ_PREEMPT (1 << __REQ_PREEMPT)
201#define REQ_ORDERED_COLOR (1 << __REQ_ORDERED_COLOR)
202#define REQ_RW_SYNC (1 << __REQ_RW_SYNC)
Jens Axboe49171e52006-08-10 08:59:11 +0200203#define REQ_ALLOCED (1 << __REQ_ALLOCED)
Jens Axboe4aff5e22006-08-10 08:44:47 +0200204
Linus Torvalds1da177e2005-04-16 15:20:36 -0700205#define BLK_MAX_CDB 16
206
207/*
208 * try to put the fields that are referenced together in the same cacheline
209 */
210struct request {
Jens Axboeff856ba2006-01-09 16:02:34 +0100211 struct list_head queuelist;
212 struct list_head donelist;
213
Jens Axboe4aff5e22006-08-10 08:44:47 +0200214 unsigned int cmd_flags;
215 enum rq_cmd_type_bits cmd_type;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700216
217 /* Maintain bio traversal state for part by part I/O submission.
218 * hard_* are block layer internals, no driver should touch them!
219 */
220
221 sector_t sector; /* next sector to submit */
222 unsigned long nr_sectors; /* no. of sectors left to submit */
223 /* no. of sectors left to submit in the current segment */
224 unsigned int current_nr_sectors;
225
226 sector_t hard_sector; /* next sector to complete */
227 unsigned long hard_nr_sectors; /* no. of sectors left to complete */
228 /* no. of sectors left to complete in the current segment */
229 unsigned int hard_cur_sectors;
230
231 struct bio *bio;
232 struct bio *biotail;
233
Jens Axboe98170642006-07-28 09:23:08 +0200234 struct hlist_node hash; /* merge hash */
Jens Axboe2e662b62006-07-13 11:55:04 +0200235 struct rb_node rb_node; /* sort/lookup */
Jens Axboe98170642006-07-28 09:23:08 +0200236
Jens Axboeff7d1452006-07-12 14:04:37 +0200237 /*
238 * two pointers are available for the IO schedulers, if they need
239 * more they have to dynamically allocate it.
240 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700241 void *elevator_private;
Jens Axboeff7d1452006-07-12 14:04:37 +0200242 void *elevator_private2;
243
Jens Axboeff856ba2006-01-09 16:02:34 +0100244 void *completion_data;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700245
Jens Axboe8f34ee72006-06-13 09:02:34 +0200246 struct gendisk *rq_disk;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700247 unsigned long start_time;
248
249 /* Number of scatter-gather DMA addr+len pairs after
250 * physical address coalescing is performed.
251 */
252 unsigned short nr_phys_segments;
253
254 /* Number of scatter-gather addr+len pairs after
255 * physical and DMA remapping hardware coalescing is performed.
256 * This is the number of scatter-gather entries the driver
257 * will actually have to deal with after DMA mapping is done.
258 */
259 unsigned short nr_hw_segments;
260
Jens Axboe8f34ee72006-06-13 09:02:34 +0200261 unsigned short ioprio;
262
Linus Torvalds1da177e2005-04-16 15:20:36 -0700263 request_queue_t *q;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700264
Linus Torvalds1da177e2005-04-16 15:20:36 -0700265 void *special;
Jens Axboe8f34ee72006-06-13 09:02:34 +0200266 char *buffer;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700267
Jens Axboecdd60262006-07-28 09:32:07 +0200268 int tag;
269 int errors;
270
271 int ref_count;
272
Linus Torvalds1da177e2005-04-16 15:20:36 -0700273 /*
274 * when request is used as a packet command carrier
275 */
276 unsigned int cmd_len;
277 unsigned char cmd[BLK_MAX_CDB];
278
279 unsigned int data_len;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700280 unsigned int sense_len;
Jens Axboe8f34ee72006-06-13 09:02:34 +0200281 void *data;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700282 void *sense;
283
284 unsigned int timeout;
Mike Christie17e01f22005-11-11 05:31:37 -0600285 int retries;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700286
287 /*
Jens Axboec00895a2006-09-30 20:29:12 +0200288 * completion callback.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700289 */
290 rq_end_io_fn *end_io;
291 void *end_io_data;
292};
293
294/*
Jens Axboe4aff5e22006-08-10 08:44:47 +0200295 * State information carried for REQ_TYPE_PM_SUSPEND and REQ_TYPE_PM_RESUME
Linus Torvalds1da177e2005-04-16 15:20:36 -0700296 * requests. Some step values could eventually be made generic.
297 */
298struct request_pm_state
299{
300 /* PM state machine step value, currently driver specific */
301 int pm_step;
302 /* requested PM state value (S1, S2, S3, S4, ...) */
303 u32 pm_state;
304 void* data; /* for driver use */
305};
306
307#include <linux/elevator.h>
308
309typedef int (merge_request_fn) (request_queue_t *, struct request *,
310 struct bio *);
311typedef int (merge_requests_fn) (request_queue_t *, struct request *,
312 struct request *);
313typedef void (request_fn_proc) (request_queue_t *q);
314typedef int (make_request_fn) (request_queue_t *q, struct bio *bio);
315typedef int (prep_rq_fn) (request_queue_t *, struct request *);
316typedef void (unplug_fn) (request_queue_t *);
317
318struct bio_vec;
319typedef int (merge_bvec_fn) (request_queue_t *, struct bio *, struct bio_vec *);
320typedef void (activity_fn) (void *data, int rw);
321typedef int (issue_flush_fn) (request_queue_t *, struct gendisk *, sector_t *);
Tejun Heo797e7db2006-01-06 09:51:03 +0100322typedef void (prepare_flush_fn) (request_queue_t *, struct request *);
Jens Axboeff856ba2006-01-09 16:02:34 +0100323typedef void (softirq_done_fn)(struct request *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700324
325enum blk_queue_state {
326 Queue_down,
327 Queue_up,
328};
329
Linus Torvalds1da177e2005-04-16 15:20:36 -0700330struct blk_queue_tag {
331 struct request **tag_index; /* map of busy tags */
332 unsigned long *tag_map; /* bit map of free/busy tags */
333 struct list_head busy_list; /* fifo list of busy tags */
334 int busy; /* current depth */
335 int max_depth; /* what we will send to device */
Tejun Heoba025082005-08-05 13:28:11 -0700336 int real_max_depth; /* what the array can hold */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700337 atomic_t refcnt; /* map can be shared */
338};
339
340struct request_queue
341{
342 /*
343 * Together with queue_head for cacheline sharing
344 */
345 struct list_head queue_head;
346 struct request *last_merge;
347 elevator_t *elevator;
348
349 /*
350 * the queue request freelist, one for reads and one for writes
351 */
352 struct request_list rq;
353
354 request_fn_proc *request_fn;
355 merge_request_fn *back_merge_fn;
356 merge_request_fn *front_merge_fn;
357 merge_requests_fn *merge_requests_fn;
358 make_request_fn *make_request_fn;
359 prep_rq_fn *prep_rq_fn;
360 unplug_fn *unplug_fn;
361 merge_bvec_fn *merge_bvec_fn;
362 activity_fn *activity_fn;
363 issue_flush_fn *issue_flush_fn;
364 prepare_flush_fn *prepare_flush_fn;
Jens Axboeff856ba2006-01-09 16:02:34 +0100365 softirq_done_fn *softirq_done_fn;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700366
367 /*
Tejun Heo8922e162005-10-20 16:23:44 +0200368 * Dispatch queue sorting
369 */
Jens Axboe1b47f532005-10-20 16:37:00 +0200370 sector_t end_sector;
Tejun Heo8922e162005-10-20 16:23:44 +0200371 struct request *boundary_rq;
Tejun Heo8922e162005-10-20 16:23:44 +0200372
373 /*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700374 * Auto-unplugging state
375 */
376 struct timer_list unplug_timer;
377 int unplug_thresh; /* After this many requests */
378 unsigned long unplug_delay; /* After this many jiffies */
379 struct work_struct unplug_work;
380
381 struct backing_dev_info backing_dev_info;
382
383 /*
384 * The queue owner gets to use this for whatever they like.
385 * ll_rw_blk doesn't touch it.
386 */
387 void *queuedata;
388
389 void *activity_data;
390
391 /*
392 * queue needs bounce pages for pages above this limit
393 */
394 unsigned long bounce_pfn;
Al Viro8267e262005-10-21 03:20:53 -0400395 gfp_t bounce_gfp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700396
397 /*
398 * various queue flags, see QUEUE_* below
399 */
400 unsigned long queue_flags;
401
402 /*
152587d2005-04-12 16:22:06 -0500403 * protects queue structures from reentrancy. ->__queue_lock should
404 * _never_ be used directly, it is queue private. always use
405 * ->queue_lock.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700406 */
152587d2005-04-12 16:22:06 -0500407 spinlock_t __queue_lock;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700408 spinlock_t *queue_lock;
409
410 /*
411 * queue kobject
412 */
413 struct kobject kobj;
414
415 /*
416 * queue settings
417 */
418 unsigned long nr_requests; /* Max # of requests */
419 unsigned int nr_congestion_on;
420 unsigned int nr_congestion_off;
421 unsigned int nr_batching;
422
Jens Axboe2cb2e142006-01-17 09:04:32 +0100423 unsigned int max_sectors;
424 unsigned int max_hw_sectors;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700425 unsigned short max_phys_segments;
426 unsigned short max_hw_segments;
427 unsigned short hardsect_size;
428 unsigned int max_segment_size;
429
430 unsigned long seg_boundary_mask;
431 unsigned int dma_alignment;
432
433 struct blk_queue_tag *queue_tags;
434
Tejun Heo15853af2005-11-10 08:52:05 +0100435 unsigned int nr_sorted;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700436 unsigned int in_flight;
437
438 /*
439 * sg stuff
440 */
441 unsigned int sg_timeout;
442 unsigned int sg_reserved_size;
Christoph Lameter19460892005-06-23 00:08:19 -0700443 int node;
Alexey Dobriyan6c5c9342006-09-29 01:59:40 -0700444#ifdef CONFIG_BLK_DEV_IO_TRACE
Jens Axboe2056a782006-03-23 20:00:26 +0100445 struct blk_trace *blk_trace;
Alexey Dobriyan6c5c9342006-09-29 01:59:40 -0700446#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700447 /*
448 * reserved for flush operations
449 */
Tejun Heo797e7db2006-01-06 09:51:03 +0100450 unsigned int ordered, next_ordered, ordseq;
451 int orderr, ordcolor;
452 struct request pre_flush_rq, bar_rq, post_flush_rq;
453 struct request *orig_bar_rq;
454 unsigned int bi_size;
Al Viro483f4af2006-03-18 18:34:37 -0500455
456 struct mutex sysfs_lock;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700457};
458
Linus Torvalds1da177e2005-04-16 15:20:36 -0700459#define QUEUE_FLAG_CLUSTER 0 /* cluster several segments into 1 */
460#define QUEUE_FLAG_QUEUED 1 /* uses generic tag queueing */
461#define QUEUE_FLAG_STOPPED 2 /* queue is stopped */
462#define QUEUE_FLAG_READFULL 3 /* write queue has been filled */
463#define QUEUE_FLAG_WRITEFULL 4 /* read queue has been filled */
464#define QUEUE_FLAG_DEAD 5 /* queue being torn down */
465#define QUEUE_FLAG_REENTER 6 /* Re-entrancy avoidance */
466#define QUEUE_FLAG_PLUGGED 7 /* queue is plugged */
Jens Axboe64521d12005-10-28 08:30:39 +0200467#define QUEUE_FLAG_ELVSWITCH 8 /* don't use elevator, just do FIFO */
Tejun Heo797e7db2006-01-06 09:51:03 +0100468
469enum {
470 /*
471 * Hardbarrier is supported with one of the following methods.
472 *
473 * NONE : hardbarrier unsupported
474 * DRAIN : ordering by draining is enough
475 * DRAIN_FLUSH : ordering by draining w/ pre and post flushes
476 * DRAIN_FUA : ordering by draining w/ pre flush and FUA write
477 * TAG : ordering by tag is enough
478 * TAG_FLUSH : ordering by tag w/ pre and post flushes
479 * TAG_FUA : ordering by tag w/ pre flush and FUA write
480 */
481 QUEUE_ORDERED_NONE = 0x00,
482 QUEUE_ORDERED_DRAIN = 0x01,
483 QUEUE_ORDERED_TAG = 0x02,
484
485 QUEUE_ORDERED_PREFLUSH = 0x10,
486 QUEUE_ORDERED_POSTFLUSH = 0x20,
487 QUEUE_ORDERED_FUA = 0x40,
488
489 QUEUE_ORDERED_DRAIN_FLUSH = QUEUE_ORDERED_DRAIN |
490 QUEUE_ORDERED_PREFLUSH | QUEUE_ORDERED_POSTFLUSH,
491 QUEUE_ORDERED_DRAIN_FUA = QUEUE_ORDERED_DRAIN |
492 QUEUE_ORDERED_PREFLUSH | QUEUE_ORDERED_FUA,
493 QUEUE_ORDERED_TAG_FLUSH = QUEUE_ORDERED_TAG |
494 QUEUE_ORDERED_PREFLUSH | QUEUE_ORDERED_POSTFLUSH,
495 QUEUE_ORDERED_TAG_FUA = QUEUE_ORDERED_TAG |
496 QUEUE_ORDERED_PREFLUSH | QUEUE_ORDERED_FUA,
497
498 /*
499 * Ordered operation sequence
500 */
501 QUEUE_ORDSEQ_STARTED = 0x01, /* flushing in progress */
502 QUEUE_ORDSEQ_DRAIN = 0x02, /* waiting for the queue to be drained */
503 QUEUE_ORDSEQ_PREFLUSH = 0x04, /* pre-flushing in progress */
504 QUEUE_ORDSEQ_BAR = 0x08, /* original barrier req in progress */
505 QUEUE_ORDSEQ_POSTFLUSH = 0x10, /* post-flushing in progress */
506 QUEUE_ORDSEQ_DONE = 0x20,
507};
Linus Torvalds1da177e2005-04-16 15:20:36 -0700508
509#define blk_queue_plugged(q) test_bit(QUEUE_FLAG_PLUGGED, &(q)->queue_flags)
510#define blk_queue_tagged(q) test_bit(QUEUE_FLAG_QUEUED, &(q)->queue_flags)
511#define blk_queue_stopped(q) test_bit(QUEUE_FLAG_STOPPED, &(q)->queue_flags)
Tejun Heo797e7db2006-01-06 09:51:03 +0100512#define blk_queue_flushing(q) ((q)->ordseq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700513
Jens Axboe4aff5e22006-08-10 08:44:47 +0200514#define blk_fs_request(rq) ((rq)->cmd_type == REQ_TYPE_FS)
515#define blk_pc_request(rq) ((rq)->cmd_type == REQ_TYPE_BLOCK_PC)
516#define blk_special_request(rq) ((rq)->cmd_type == REQ_TYPE_SPECIAL)
517#define blk_sense_request(rq) ((rq)->cmd_type == REQ_TYPE_SENSE)
518
519#define blk_noretry_request(rq) ((rq)->cmd_flags & REQ_FAILFAST)
520#define blk_rq_started(rq) ((rq)->cmd_flags & REQ_STARTED)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700521
522#define blk_account_rq(rq) (blk_rq_started(rq) && blk_fs_request(rq))
523
Jens Axboe4aff5e22006-08-10 08:44:47 +0200524#define blk_pm_suspend_request(rq) ((rq)->cmd_type == REQ_TYPE_PM_SUSPEND)
525#define blk_pm_resume_request(rq) ((rq)->cmd_type == REQ_TYPE_PM_RESUME)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700526#define blk_pm_request(rq) \
Jens Axboe4aff5e22006-08-10 08:44:47 +0200527 (blk_pm_suspend_request(rq) || blk_pm_resume_request(rq))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700528
Jens Axboe4aff5e22006-08-10 08:44:47 +0200529#define blk_sorted_rq(rq) ((rq)->cmd_flags & REQ_SORTED)
530#define blk_barrier_rq(rq) ((rq)->cmd_flags & REQ_HARDBARRIER)
531#define blk_fua_rq(rq) ((rq)->cmd_flags & REQ_FUA)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700532
533#define list_entry_rq(ptr) list_entry((ptr), struct request, queuelist)
534
Jens Axboe4aff5e22006-08-10 08:44:47 +0200535#define rq_data_dir(rq) ((rq)->cmd_flags & 1)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700536
Jens Axboe9e2585a2006-07-28 09:26:13 +0200537/*
538 * We regard a request as sync, if it's a READ or a SYNC write.
539 */
540#define rq_is_sync(rq) (rq_data_dir((rq)) == READ || (rq)->cmd_flags & REQ_RW_SYNC)
541
Linus Torvalds1da177e2005-04-16 15:20:36 -0700542static inline int blk_queue_full(struct request_queue *q, int rw)
543{
544 if (rw == READ)
545 return test_bit(QUEUE_FLAG_READFULL, &q->queue_flags);
546 return test_bit(QUEUE_FLAG_WRITEFULL, &q->queue_flags);
547}
548
549static inline void blk_set_queue_full(struct request_queue *q, int rw)
550{
551 if (rw == READ)
552 set_bit(QUEUE_FLAG_READFULL, &q->queue_flags);
553 else
554 set_bit(QUEUE_FLAG_WRITEFULL, &q->queue_flags);
555}
556
557static inline void blk_clear_queue_full(struct request_queue *q, int rw)
558{
559 if (rw == READ)
560 clear_bit(QUEUE_FLAG_READFULL, &q->queue_flags);
561 else
562 clear_bit(QUEUE_FLAG_WRITEFULL, &q->queue_flags);
563}
564
565
566/*
567 * mergeable request must not have _NOMERGE or _BARRIER bit set, nor may
568 * it already be started by driver.
569 */
570#define RQ_NOMERGE_FLAGS \
571 (REQ_NOMERGE | REQ_STARTED | REQ_HARDBARRIER | REQ_SOFTBARRIER)
572#define rq_mergeable(rq) \
Jens Axboe4aff5e22006-08-10 08:44:47 +0200573 (!((rq)->cmd_flags & RQ_NOMERGE_FLAGS) && blk_fs_request((rq)))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700574
575/*
576 * noop, requests are automagically marked as active/inactive by I/O
577 * scheduler -- see elv_next_request
578 */
579#define blk_queue_headactive(q, head_active)
580
581/*
582 * q->prep_rq_fn return values
583 */
584#define BLKPREP_OK 0 /* serve it */
585#define BLKPREP_KILL 1 /* fatal error, kill */
586#define BLKPREP_DEFER 2 /* leave on queue */
587
588extern unsigned long blk_max_low_pfn, blk_max_pfn;
589
590/*
591 * standard bounce addresses:
592 *
593 * BLK_BOUNCE_HIGH : bounce all highmem pages
594 * BLK_BOUNCE_ANY : don't bounce anything
595 * BLK_BOUNCE_ISA : bounce pages above ISA DMA boundary
596 */
597#define BLK_BOUNCE_HIGH ((u64)blk_max_low_pfn << PAGE_SHIFT)
598#define BLK_BOUNCE_ANY ((u64)blk_max_pfn << PAGE_SHIFT)
599#define BLK_BOUNCE_ISA (ISA_DMA_THRESHOLD)
600
601#ifdef CONFIG_MMU
602extern int init_emergency_isa_pool(void);
603extern void blk_queue_bounce(request_queue_t *q, struct bio **bio);
604#else
605static inline int init_emergency_isa_pool(void)
606{
607 return 0;
608}
609static inline void blk_queue_bounce(request_queue_t *q, struct bio **bio)
610{
611}
612#endif /* CONFIG_MMU */
613
614#define rq_for_each_bio(_bio, rq) \
615 if ((rq->bio)) \
616 for (_bio = (rq)->bio; _bio; _bio = _bio->bi_next)
617
618struct sec_size {
619 unsigned block_size;
620 unsigned block_size_bits;
621};
622
623extern int blk_register_queue(struct gendisk *disk);
624extern void blk_unregister_queue(struct gendisk *disk);
625extern void register_disk(struct gendisk *dev);
626extern void generic_make_request(struct bio *bio);
627extern void blk_put_request(struct request *);
Mike Christie6e39b692005-11-11 05:30:24 -0600628extern void __blk_put_request(request_queue_t *, struct request *);
Tejun Heo8ffdc652006-01-06 09:49:03 +0100629extern void blk_end_sync_rq(struct request *rq, int error);
Al Viro8267e262005-10-21 03:20:53 -0400630extern struct request *blk_get_request(request_queue_t *, int, gfp_t);
Tejun Heo 867d1192005-04-24 02:06:05 -0500631extern void blk_insert_request(request_queue_t *, struct request *, int, void *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700632extern void blk_requeue_request(request_queue_t *, struct request *);
633extern void blk_plug_device(request_queue_t *);
634extern int blk_remove_plug(request_queue_t *);
635extern void blk_recount_segments(request_queue_t *, struct bio *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700636extern int scsi_cmd_ioctl(struct file *, struct gendisk *, unsigned int, void __user *);
Christoph Hellwig21b2f0c2006-03-22 17:52:04 +0100637extern int sg_scsi_ioctl(struct file *, struct request_queue *,
638 struct gendisk *, struct scsi_ioctl_command __user *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700639extern void blk_start_queue(request_queue_t *q);
640extern void blk_stop_queue(request_queue_t *q);
641extern void blk_sync_queue(struct request_queue *q);
642extern void __blk_stop_queue(request_queue_t *q);
643extern void blk_run_queue(request_queue_t *);
644extern void blk_queue_activity_fn(request_queue_t *, activity_fn *, void *);
Jens Axboedd1cab92005-06-20 14:06:01 +0200645extern int blk_rq_map_user(request_queue_t *, struct request *, void __user *, unsigned int);
646extern int blk_rq_unmap_user(struct bio *, unsigned int);
Al Viro8267e262005-10-21 03:20:53 -0400647extern int blk_rq_map_kern(request_queue_t *, struct request *, void *, unsigned int, gfp_t);
James Bottomley f1970ba2005-06-20 14:06:52 +0200648extern int blk_rq_map_user_iov(request_queue_t *, struct request *, struct sg_iovec *, int);
James Bottomley 994ca9a2005-06-20 14:11:09 +0200649extern int blk_execute_rq(request_queue_t *, struct gendisk *,
650 struct request *, int);
Mike Christie6e39b692005-11-11 05:30:24 -0600651extern void blk_execute_rq_nowait(request_queue_t *, struct gendisk *,
Jens Axboe15fc8582006-01-06 10:00:50 +0100652 struct request *, int, rq_end_io_fn *);
Mike Christie6e39b692005-11-11 05:30:24 -0600653
Linus Torvalds1da177e2005-04-16 15:20:36 -0700654static inline request_queue_t *bdev_get_queue(struct block_device *bdev)
655{
656 return bdev->bd_disk->queue;
657}
658
659static inline void blk_run_backing_dev(struct backing_dev_info *bdi,
660 struct page *page)
661{
662 if (bdi && bdi->unplug_io_fn)
663 bdi->unplug_io_fn(bdi, page);
664}
665
666static inline void blk_run_address_space(struct address_space *mapping)
667{
668 if (mapping)
669 blk_run_backing_dev(mapping->backing_dev_info, NULL);
670}
671
672/*
673 * end_request() and friends. Must be called with the request queue spinlock
674 * acquired. All functions called within end_request() _must_be_ atomic.
675 *
676 * Several drivers define their own end_request and call
677 * end_that_request_first() and end_that_request_last()
678 * for parts of the original function. This prevents
679 * code duplication in drivers.
680 */
681extern int end_that_request_first(struct request *, int, int);
682extern int end_that_request_chunk(struct request *, int, int);
Tejun Heo8ffdc652006-01-06 09:49:03 +0100683extern void end_that_request_last(struct request *, int);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700684extern void end_request(struct request *req, int uptodate);
Jens Axboeff856ba2006-01-09 16:02:34 +0100685extern void blk_complete_request(struct request *);
686
687static inline int rq_all_done(struct request *rq, unsigned int nr_bytes)
688{
689 if (blk_fs_request(rq))
690 return (nr_bytes >= (rq->hard_nr_sectors << 9));
691 else if (blk_pc_request(rq))
692 return nr_bytes >= rq->data_len;
693
694 return 0;
695}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700696
697/*
698 * end_that_request_first/chunk() takes an uptodate argument. we account
699 * any value <= as an io error. 0 means -EIO for compatability reasons,
700 * any other < 0 value is the direct error type. An uptodate value of
701 * 1 indicates successful io completion
702 */
703#define end_io_error(uptodate) (unlikely((uptodate) <= 0))
704
705static inline void blkdev_dequeue_request(struct request *req)
706{
Tejun Heo8922e162005-10-20 16:23:44 +0200707 elv_dequeue_request(req->q, req);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700708}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700709
Linus Torvalds1da177e2005-04-16 15:20:36 -0700710/*
711 * Access functions for manipulating queue properties
712 */
Christoph Lameter19460892005-06-23 00:08:19 -0700713extern request_queue_t *blk_init_queue_node(request_fn_proc *rfn,
714 spinlock_t *lock, int node_id);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700715extern request_queue_t *blk_init_queue(request_fn_proc *, spinlock_t *);
716extern void blk_cleanup_queue(request_queue_t *);
717extern void blk_queue_make_request(request_queue_t *, make_request_fn *);
718extern void blk_queue_bounce_limit(request_queue_t *, u64);
Jens Axboe2cb2e142006-01-17 09:04:32 +0100719extern void blk_queue_max_sectors(request_queue_t *, unsigned int);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700720extern void blk_queue_max_phys_segments(request_queue_t *, unsigned short);
721extern void blk_queue_max_hw_segments(request_queue_t *, unsigned short);
722extern void blk_queue_max_segment_size(request_queue_t *, unsigned int);
723extern void blk_queue_hardsect_size(request_queue_t *, unsigned short);
724extern void blk_queue_stack_limits(request_queue_t *t, request_queue_t *b);
725extern void blk_queue_segment_boundary(request_queue_t *, unsigned long);
726extern void blk_queue_prep_rq(request_queue_t *, prep_rq_fn *pfn);
727extern void blk_queue_merge_bvec(request_queue_t *, merge_bvec_fn *);
728extern void blk_queue_dma_alignment(request_queue_t *, int);
Jens Axboeff856ba2006-01-09 16:02:34 +0100729extern void blk_queue_softirq_done(request_queue_t *, softirq_done_fn *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700730extern struct backing_dev_info *blk_get_backing_dev_info(struct block_device *bdev);
Tejun Heo797e7db2006-01-06 09:51:03 +0100731extern int blk_queue_ordered(request_queue_t *, unsigned, prepare_flush_fn *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700732extern void blk_queue_issue_flush_fn(request_queue_t *, issue_flush_fn *);
Tejun Heo797e7db2006-01-06 09:51:03 +0100733extern int blk_do_ordered(request_queue_t *, struct request **);
734extern unsigned blk_ordered_cur_seq(request_queue_t *);
735extern unsigned blk_ordered_req_seq(struct request *);
736extern void blk_ordered_complete_seq(request_queue_t *, unsigned, int);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700737
738extern int blk_rq_map_sg(request_queue_t *, struct request *, struct scatterlist *);
739extern void blk_dump_rq_flags(struct request *, char *);
740extern void generic_unplug_device(request_queue_t *);
741extern void __generic_unplug_device(request_queue_t *);
742extern long nr_blockdev_pages(void);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700743
744int blk_get_queue(request_queue_t *);
Al Viro8267e262005-10-21 03:20:53 -0400745request_queue_t *blk_alloc_queue(gfp_t);
746request_queue_t *blk_alloc_queue_node(gfp_t, int);
Al Viro483f4af2006-03-18 18:34:37 -0500747extern void blk_put_queue(request_queue_t *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700748
749/*
750 * tag stuff
751 */
752#define blk_queue_tag_depth(q) ((q)->queue_tags->busy)
753#define blk_queue_tag_queue(q) ((q)->queue_tags->busy < (q)->queue_tags->max_depth)
Jens Axboe4aff5e22006-08-10 08:44:47 +0200754#define blk_rq_tagged(rq) ((rq)->cmd_flags & REQ_QUEUED)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700755extern int blk_queue_start_tag(request_queue_t *, struct request *);
756extern struct request *blk_queue_find_tag(request_queue_t *, int);
757extern void blk_queue_end_tag(request_queue_t *, struct request *);
758extern int blk_queue_init_tags(request_queue_t *, int, struct blk_queue_tag *);
759extern void blk_queue_free_tags(request_queue_t *);
760extern int blk_queue_resize_tags(request_queue_t *, int);
761extern void blk_queue_invalidate_tags(request_queue_t *);
762extern long blk_congestion_wait(int rw, long timeout);
James Bottomley492dfb42006-08-30 15:48:45 -0400763extern struct blk_queue_tag *blk_init_tags(int);
764extern void blk_free_tags(struct blk_queue_tag *);
Trond Myklebust275a0822006-08-22 20:06:24 -0400765extern void blk_congestion_end(int rw);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700766
767extern void blk_rq_bio_prep(request_queue_t *, struct request *, struct bio *);
768extern int blkdev_issue_flush(struct block_device *, sector_t *);
769
770#define MAX_PHYS_SEGMENTS 128
771#define MAX_HW_SEGMENTS 128
Mike Christiedefd94b2005-12-05 02:37:06 -0600772#define SAFE_MAX_SECTORS 255
773#define BLK_DEF_MAX_SECTORS 1024
Linus Torvalds1da177e2005-04-16 15:20:36 -0700774
775#define MAX_SEGMENT_SIZE 65536
776
777#define blkdev_entry_to_request(entry) list_entry((entry), struct request, queuelist)
778
Linus Torvalds1da177e2005-04-16 15:20:36 -0700779static inline int queue_hardsect_size(request_queue_t *q)
780{
781 int retval = 512;
782
783 if (q && q->hardsect_size)
784 retval = q->hardsect_size;
785
786 return retval;
787}
788
789static inline int bdev_hardsect_size(struct block_device *bdev)
790{
791 return queue_hardsect_size(bdev_get_queue(bdev));
792}
793
794static inline int queue_dma_alignment(request_queue_t *q)
795{
796 int retval = 511;
797
798 if (q && q->dma_alignment)
799 retval = q->dma_alignment;
800
801 return retval;
802}
803
804static inline int bdev_dma_aligment(struct block_device *bdev)
805{
806 return queue_dma_alignment(bdev_get_queue(bdev));
807}
808
809#define blk_finished_io(nsects) do { } while (0)
810#define blk_started_io(nsects) do { } while (0)
811
812/* assumes size > 256 */
813static inline unsigned int blksize_bits(unsigned int size)
814{
815 unsigned int bits = 8;
816 do {
817 bits++;
818 size >>= 1;
819 } while (size > 256);
820 return bits;
821}
822
Adrian Bunk2befb9e2005-09-10 00:27:17 -0700823static inline unsigned int block_size(struct block_device *bdev)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700824{
825 return bdev->bd_block_size;
826}
827
828typedef struct {struct page *v;} Sector;
829
830unsigned char *read_dev_sector(struct block_device *, sector_t, Sector *);
831
832static inline void put_dev_sector(Sector p)
833{
834 page_cache_release(p.v);
835}
836
837struct work_struct;
838int kblockd_schedule_work(struct work_struct *work);
839void kblockd_flush(void);
840
841#ifdef CONFIG_LBD
842# include <asm/div64.h>
843# define sector_div(a, b) do_div(a, b)
844#else
845# define sector_div(n, b)( \
846{ \
847 int _res; \
848 _res = (n) % (b); \
849 (n) /= (b); \
850 _res; \
851} \
852)
853#endif
854
855#define MODULE_ALIAS_BLOCKDEV(major,minor) \
856 MODULE_ALIAS("block-major-" __stringify(major) "-" __stringify(minor))
857#define MODULE_ALIAS_BLOCKDEV_MAJOR(major) \
858 MODULE_ALIAS("block-major-" __stringify(major) "-*")
859
860
861#endif