blob: 482a21d676279ccbd3d7421be1630b009db44094 [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
123#define BLK_MAX_CDB 16
124
125/*
126 * try to put the fields that are referenced together in the same cacheline
127 */
128struct request {
Jens Axboeff856ba2006-01-09 16:02:34 +0100129 struct list_head queuelist;
130 struct list_head donelist;
131
Linus Torvalds1da177e2005-04-16 15:20:36 -0700132 unsigned long flags; /* see REQ_ bits below */
133
134 /* Maintain bio traversal state for part by part I/O submission.
135 * hard_* are block layer internals, no driver should touch them!
136 */
137
138 sector_t sector; /* next sector to submit */
139 unsigned long nr_sectors; /* no. of sectors left to submit */
140 /* no. of sectors left to submit in the current segment */
141 unsigned int current_nr_sectors;
142
143 sector_t hard_sector; /* next sector to complete */
144 unsigned long hard_nr_sectors; /* no. of sectors left to complete */
145 /* no. of sectors left to complete in the current segment */
146 unsigned int hard_cur_sectors;
147
148 struct bio *bio;
149 struct bio *biotail;
150
151 void *elevator_private;
Jens Axboeff856ba2006-01-09 16:02:34 +0100152 void *completion_data;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700153
Jens Axboe22e2c502005-06-27 10:55:12 +0200154 unsigned short ioprio;
155
Linus Torvalds1da177e2005-04-16 15:20:36 -0700156 int rq_status; /* should split this into a few status bits */
157 struct gendisk *rq_disk;
158 int errors;
159 unsigned long start_time;
160
161 /* Number of scatter-gather DMA addr+len pairs after
162 * physical address coalescing is performed.
163 */
164 unsigned short nr_phys_segments;
165
166 /* Number of scatter-gather addr+len pairs after
167 * physical and DMA remapping hardware coalescing is performed.
168 * This is the number of scatter-gather entries the driver
169 * will actually have to deal with after DMA mapping is done.
170 */
171 unsigned short nr_hw_segments;
172
173 int tag;
174 char *buffer;
175
176 int ref_count;
177 request_queue_t *q;
178 struct request_list *rl;
179
180 struct completion *waiting;
181 void *special;
182
183 /*
184 * when request is used as a packet command carrier
185 */
186 unsigned int cmd_len;
187 unsigned char cmd[BLK_MAX_CDB];
188
189 unsigned int data_len;
190 void *data;
191
192 unsigned int sense_len;
193 void *sense;
194
195 unsigned int timeout;
Mike Christie17e01f22005-11-11 05:31:37 -0600196 int retries;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700197
198 /*
199 * For Power Management requests
200 */
201 struct request_pm_state *pm;
202
203 /*
204 * completion callback. end_io_data should be folded in with waiting
205 */
206 rq_end_io_fn *end_io;
207 void *end_io_data;
208};
209
210/*
211 * first three bits match BIO_RW* bits, important
212 */
213enum rq_flag_bits {
214 __REQ_RW, /* not set, read. set, write */
215 __REQ_FAILFAST, /* no low level driver retries */
Tejun Heo8922e162005-10-20 16:23:44 +0200216 __REQ_SORTED, /* elevator knows about this request */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700217 __REQ_SOFTBARRIER, /* may not be passed by ioscheduler */
218 __REQ_HARDBARRIER, /* may not be passed by drive either */
Tejun Heo797e7db2006-01-06 09:51:03 +0100219 __REQ_FUA, /* forced unit access */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700220 __REQ_CMD, /* is a regular fs rw request */
221 __REQ_NOMERGE, /* don't touch this for merging */
222 __REQ_STARTED, /* drive already may have started this one */
223 __REQ_DONTPREP, /* don't call prep for this one */
224 __REQ_QUEUED, /* uses queueing */
Tejun Heocb98fc82005-10-28 08:29:39 +0200225 __REQ_ELVPRIV, /* elevator private data attached */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700226 /*
227 * for ATA/ATAPI devices
228 */
229 __REQ_PC, /* packet command (special) */
230 __REQ_BLOCK_PC, /* queued down pc from block layer */
231 __REQ_SENSE, /* sense retrival */
232
233 __REQ_FAILED, /* set if the request failed */
234 __REQ_QUIET, /* don't worry about errors */
235 __REQ_SPECIAL, /* driver suplied command */
236 __REQ_DRIVE_CMD,
237 __REQ_DRIVE_TASK,
238 __REQ_DRIVE_TASKFILE,
239 __REQ_PREEMPT, /* set for "ide_preempt" requests */
240 __REQ_PM_SUSPEND, /* suspend request */
241 __REQ_PM_RESUME, /* resume request */
242 __REQ_PM_SHUTDOWN, /* shutdown request */
Tejun Heo797e7db2006-01-06 09:51:03 +0100243 __REQ_ORDERED_COLOR, /* is before or after barrier */
Jens Axboeb31dc662006-06-13 08:26:10 +0200244 __REQ_RW_SYNC, /* request is sync (O_DIRECT) */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700245 __REQ_NR_BITS, /* stops here */
246};
247
248#define REQ_RW (1 << __REQ_RW)
249#define REQ_FAILFAST (1 << __REQ_FAILFAST)
Tejun Heo8922e162005-10-20 16:23:44 +0200250#define REQ_SORTED (1 << __REQ_SORTED)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700251#define REQ_SOFTBARRIER (1 << __REQ_SOFTBARRIER)
252#define REQ_HARDBARRIER (1 << __REQ_HARDBARRIER)
Tejun Heo797e7db2006-01-06 09:51:03 +0100253#define REQ_FUA (1 << __REQ_FUA)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700254#define REQ_CMD (1 << __REQ_CMD)
255#define REQ_NOMERGE (1 << __REQ_NOMERGE)
256#define REQ_STARTED (1 << __REQ_STARTED)
257#define REQ_DONTPREP (1 << __REQ_DONTPREP)
258#define REQ_QUEUED (1 << __REQ_QUEUED)
Tejun Heocb98fc82005-10-28 08:29:39 +0200259#define REQ_ELVPRIV (1 << __REQ_ELVPRIV)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260#define REQ_PC (1 << __REQ_PC)
261#define REQ_BLOCK_PC (1 << __REQ_BLOCK_PC)
262#define REQ_SENSE (1 << __REQ_SENSE)
263#define REQ_FAILED (1 << __REQ_FAILED)
264#define REQ_QUIET (1 << __REQ_QUIET)
265#define REQ_SPECIAL (1 << __REQ_SPECIAL)
266#define REQ_DRIVE_CMD (1 << __REQ_DRIVE_CMD)
267#define REQ_DRIVE_TASK (1 << __REQ_DRIVE_TASK)
268#define REQ_DRIVE_TASKFILE (1 << __REQ_DRIVE_TASKFILE)
269#define REQ_PREEMPT (1 << __REQ_PREEMPT)
270#define REQ_PM_SUSPEND (1 << __REQ_PM_SUSPEND)
271#define REQ_PM_RESUME (1 << __REQ_PM_RESUME)
272#define REQ_PM_SHUTDOWN (1 << __REQ_PM_SHUTDOWN)
Tejun Heo797e7db2006-01-06 09:51:03 +0100273#define REQ_ORDERED_COLOR (1 << __REQ_ORDERED_COLOR)
Jens Axboeb31dc662006-06-13 08:26:10 +0200274#define REQ_RW_SYNC (1 << __REQ_RW_SYNC)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700275
276/*
277 * State information carried for REQ_PM_SUSPEND and REQ_PM_RESUME
278 * requests. Some step values could eventually be made generic.
279 */
280struct request_pm_state
281{
282 /* PM state machine step value, currently driver specific */
283 int pm_step;
284 /* requested PM state value (S1, S2, S3, S4, ...) */
285 u32 pm_state;
286 void* data; /* for driver use */
287};
288
289#include <linux/elevator.h>
290
291typedef int (merge_request_fn) (request_queue_t *, struct request *,
292 struct bio *);
293typedef int (merge_requests_fn) (request_queue_t *, struct request *,
294 struct request *);
295typedef void (request_fn_proc) (request_queue_t *q);
296typedef int (make_request_fn) (request_queue_t *q, struct bio *bio);
297typedef int (prep_rq_fn) (request_queue_t *, struct request *);
298typedef void (unplug_fn) (request_queue_t *);
299
300struct bio_vec;
301typedef int (merge_bvec_fn) (request_queue_t *, struct bio *, struct bio_vec *);
302typedef void (activity_fn) (void *data, int rw);
303typedef int (issue_flush_fn) (request_queue_t *, struct gendisk *, sector_t *);
Tejun Heo797e7db2006-01-06 09:51:03 +0100304typedef void (prepare_flush_fn) (request_queue_t *, struct request *);
Jens Axboeff856ba2006-01-09 16:02:34 +0100305typedef void (softirq_done_fn)(struct request *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700306
307enum blk_queue_state {
308 Queue_down,
309 Queue_up,
310};
311
Linus Torvalds1da177e2005-04-16 15:20:36 -0700312struct blk_queue_tag {
313 struct request **tag_index; /* map of busy tags */
314 unsigned long *tag_map; /* bit map of free/busy tags */
315 struct list_head busy_list; /* fifo list of busy tags */
316 int busy; /* current depth */
317 int max_depth; /* what we will send to device */
Tejun Heoba025082005-08-05 13:28:11 -0700318 int real_max_depth; /* what the array can hold */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700319 atomic_t refcnt; /* map can be shared */
320};
321
322struct request_queue
323{
324 /*
325 * Together with queue_head for cacheline sharing
326 */
327 struct list_head queue_head;
328 struct request *last_merge;
329 elevator_t *elevator;
330
331 /*
332 * the queue request freelist, one for reads and one for writes
333 */
334 struct request_list rq;
335
336 request_fn_proc *request_fn;
337 merge_request_fn *back_merge_fn;
338 merge_request_fn *front_merge_fn;
339 merge_requests_fn *merge_requests_fn;
340 make_request_fn *make_request_fn;
341 prep_rq_fn *prep_rq_fn;
342 unplug_fn *unplug_fn;
343 merge_bvec_fn *merge_bvec_fn;
344 activity_fn *activity_fn;
345 issue_flush_fn *issue_flush_fn;
346 prepare_flush_fn *prepare_flush_fn;
Jens Axboeff856ba2006-01-09 16:02:34 +0100347 softirq_done_fn *softirq_done_fn;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700348
349 /*
Tejun Heo8922e162005-10-20 16:23:44 +0200350 * Dispatch queue sorting
351 */
Jens Axboe1b47f532005-10-20 16:37:00 +0200352 sector_t end_sector;
Tejun Heo8922e162005-10-20 16:23:44 +0200353 struct request *boundary_rq;
Tejun Heo8922e162005-10-20 16:23:44 +0200354
355 /*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700356 * Auto-unplugging state
357 */
358 struct timer_list unplug_timer;
359 int unplug_thresh; /* After this many requests */
360 unsigned long unplug_delay; /* After this many jiffies */
361 struct work_struct unplug_work;
362
363 struct backing_dev_info backing_dev_info;
364
365 /*
366 * The queue owner gets to use this for whatever they like.
367 * ll_rw_blk doesn't touch it.
368 */
369 void *queuedata;
370
371 void *activity_data;
372
373 /*
374 * queue needs bounce pages for pages above this limit
375 */
376 unsigned long bounce_pfn;
Al Viro8267e262005-10-21 03:20:53 -0400377 gfp_t bounce_gfp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700378
379 /*
380 * various queue flags, see QUEUE_* below
381 */
382 unsigned long queue_flags;
383
384 /*
152587d2005-04-12 16:22:06 -0500385 * protects queue structures from reentrancy. ->__queue_lock should
386 * _never_ be used directly, it is queue private. always use
387 * ->queue_lock.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700388 */
152587d2005-04-12 16:22:06 -0500389 spinlock_t __queue_lock;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700390 spinlock_t *queue_lock;
391
392 /*
393 * queue kobject
394 */
395 struct kobject kobj;
396
397 /*
398 * queue settings
399 */
400 unsigned long nr_requests; /* Max # of requests */
401 unsigned int nr_congestion_on;
402 unsigned int nr_congestion_off;
403 unsigned int nr_batching;
404
Jens Axboe2cb2e142006-01-17 09:04:32 +0100405 unsigned int max_sectors;
406 unsigned int max_hw_sectors;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700407 unsigned short max_phys_segments;
408 unsigned short max_hw_segments;
409 unsigned short hardsect_size;
410 unsigned int max_segment_size;
411
412 unsigned long seg_boundary_mask;
413 unsigned int dma_alignment;
414
415 struct blk_queue_tag *queue_tags;
416
Tejun Heo15853af2005-11-10 08:52:05 +0100417 unsigned int nr_sorted;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700418 unsigned int in_flight;
419
420 /*
421 * sg stuff
422 */
423 unsigned int sg_timeout;
424 unsigned int sg_reserved_size;
Christoph Lameter19460892005-06-23 00:08:19 -0700425 int node;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700426
Jens Axboe2056a782006-03-23 20:00:26 +0100427 struct blk_trace *blk_trace;
428
Linus Torvalds1da177e2005-04-16 15:20:36 -0700429 /*
430 * reserved for flush operations
431 */
Tejun Heo797e7db2006-01-06 09:51:03 +0100432 unsigned int ordered, next_ordered, ordseq;
433 int orderr, ordcolor;
434 struct request pre_flush_rq, bar_rq, post_flush_rq;
435 struct request *orig_bar_rq;
436 unsigned int bi_size;
Al Viro483f4af2006-03-18 18:34:37 -0500437
438 struct mutex sysfs_lock;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700439};
440
441#define RQ_INACTIVE (-1)
442#define RQ_ACTIVE 1
Linus Torvalds1da177e2005-04-16 15:20:36 -0700443
444#define QUEUE_FLAG_CLUSTER 0 /* cluster several segments into 1 */
445#define QUEUE_FLAG_QUEUED 1 /* uses generic tag queueing */
446#define QUEUE_FLAG_STOPPED 2 /* queue is stopped */
447#define QUEUE_FLAG_READFULL 3 /* write queue has been filled */
448#define QUEUE_FLAG_WRITEFULL 4 /* read queue has been filled */
449#define QUEUE_FLAG_DEAD 5 /* queue being torn down */
450#define QUEUE_FLAG_REENTER 6 /* Re-entrancy avoidance */
451#define QUEUE_FLAG_PLUGGED 7 /* queue is plugged */
Jens Axboe64521d12005-10-28 08:30:39 +0200452#define QUEUE_FLAG_ELVSWITCH 8 /* don't use elevator, just do FIFO */
Tejun Heo797e7db2006-01-06 09:51:03 +0100453
454enum {
455 /*
456 * Hardbarrier is supported with one of the following methods.
457 *
458 * NONE : hardbarrier unsupported
459 * DRAIN : ordering by draining is enough
460 * DRAIN_FLUSH : ordering by draining w/ pre and post flushes
461 * DRAIN_FUA : ordering by draining w/ pre flush and FUA write
462 * TAG : ordering by tag is enough
463 * TAG_FLUSH : ordering by tag w/ pre and post flushes
464 * TAG_FUA : ordering by tag w/ pre flush and FUA write
465 */
466 QUEUE_ORDERED_NONE = 0x00,
467 QUEUE_ORDERED_DRAIN = 0x01,
468 QUEUE_ORDERED_TAG = 0x02,
469
470 QUEUE_ORDERED_PREFLUSH = 0x10,
471 QUEUE_ORDERED_POSTFLUSH = 0x20,
472 QUEUE_ORDERED_FUA = 0x40,
473
474 QUEUE_ORDERED_DRAIN_FLUSH = QUEUE_ORDERED_DRAIN |
475 QUEUE_ORDERED_PREFLUSH | QUEUE_ORDERED_POSTFLUSH,
476 QUEUE_ORDERED_DRAIN_FUA = QUEUE_ORDERED_DRAIN |
477 QUEUE_ORDERED_PREFLUSH | QUEUE_ORDERED_FUA,
478 QUEUE_ORDERED_TAG_FLUSH = QUEUE_ORDERED_TAG |
479 QUEUE_ORDERED_PREFLUSH | QUEUE_ORDERED_POSTFLUSH,
480 QUEUE_ORDERED_TAG_FUA = QUEUE_ORDERED_TAG |
481 QUEUE_ORDERED_PREFLUSH | QUEUE_ORDERED_FUA,
482
483 /*
484 * Ordered operation sequence
485 */
486 QUEUE_ORDSEQ_STARTED = 0x01, /* flushing in progress */
487 QUEUE_ORDSEQ_DRAIN = 0x02, /* waiting for the queue to be drained */
488 QUEUE_ORDSEQ_PREFLUSH = 0x04, /* pre-flushing in progress */
489 QUEUE_ORDSEQ_BAR = 0x08, /* original barrier req in progress */
490 QUEUE_ORDSEQ_POSTFLUSH = 0x10, /* post-flushing in progress */
491 QUEUE_ORDSEQ_DONE = 0x20,
492};
Linus Torvalds1da177e2005-04-16 15:20:36 -0700493
494#define blk_queue_plugged(q) test_bit(QUEUE_FLAG_PLUGGED, &(q)->queue_flags)
495#define blk_queue_tagged(q) test_bit(QUEUE_FLAG_QUEUED, &(q)->queue_flags)
496#define blk_queue_stopped(q) test_bit(QUEUE_FLAG_STOPPED, &(q)->queue_flags)
Tejun Heo797e7db2006-01-06 09:51:03 +0100497#define blk_queue_flushing(q) ((q)->ordseq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700498
499#define blk_fs_request(rq) ((rq)->flags & REQ_CMD)
500#define blk_pc_request(rq) ((rq)->flags & REQ_BLOCK_PC)
501#define blk_noretry_request(rq) ((rq)->flags & REQ_FAILFAST)
502#define blk_rq_started(rq) ((rq)->flags & REQ_STARTED)
503
504#define blk_account_rq(rq) (blk_rq_started(rq) && blk_fs_request(rq))
505
506#define blk_pm_suspend_request(rq) ((rq)->flags & REQ_PM_SUSPEND)
507#define blk_pm_resume_request(rq) ((rq)->flags & REQ_PM_RESUME)
508#define blk_pm_request(rq) \
509 ((rq)->flags & (REQ_PM_SUSPEND | REQ_PM_RESUME))
510
Tejun Heo8922e162005-10-20 16:23:44 +0200511#define blk_sorted_rq(rq) ((rq)->flags & REQ_SORTED)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700512#define blk_barrier_rq(rq) ((rq)->flags & REQ_HARDBARRIER)
Tejun Heo797e7db2006-01-06 09:51:03 +0100513#define blk_fua_rq(rq) ((rq)->flags & REQ_FUA)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700514
515#define list_entry_rq(ptr) list_entry((ptr), struct request, queuelist)
516
517#define rq_data_dir(rq) ((rq)->flags & 1)
518
519static inline int blk_queue_full(struct request_queue *q, int rw)
520{
521 if (rw == READ)
522 return test_bit(QUEUE_FLAG_READFULL, &q->queue_flags);
523 return test_bit(QUEUE_FLAG_WRITEFULL, &q->queue_flags);
524}
525
526static inline void blk_set_queue_full(struct request_queue *q, int rw)
527{
528 if (rw == READ)
529 set_bit(QUEUE_FLAG_READFULL, &q->queue_flags);
530 else
531 set_bit(QUEUE_FLAG_WRITEFULL, &q->queue_flags);
532}
533
534static inline void blk_clear_queue_full(struct request_queue *q, int rw)
535{
536 if (rw == READ)
537 clear_bit(QUEUE_FLAG_READFULL, &q->queue_flags);
538 else
539 clear_bit(QUEUE_FLAG_WRITEFULL, &q->queue_flags);
540}
541
542
543/*
544 * mergeable request must not have _NOMERGE or _BARRIER bit set, nor may
545 * it already be started by driver.
546 */
547#define RQ_NOMERGE_FLAGS \
548 (REQ_NOMERGE | REQ_STARTED | REQ_HARDBARRIER | REQ_SOFTBARRIER)
549#define rq_mergeable(rq) \
550 (!((rq)->flags & RQ_NOMERGE_FLAGS) && blk_fs_request((rq)))
551
552/*
553 * noop, requests are automagically marked as active/inactive by I/O
554 * scheduler -- see elv_next_request
555 */
556#define blk_queue_headactive(q, head_active)
557
558/*
559 * q->prep_rq_fn return values
560 */
561#define BLKPREP_OK 0 /* serve it */
562#define BLKPREP_KILL 1 /* fatal error, kill */
563#define BLKPREP_DEFER 2 /* leave on queue */
564
565extern unsigned long blk_max_low_pfn, blk_max_pfn;
566
567/*
568 * standard bounce addresses:
569 *
570 * BLK_BOUNCE_HIGH : bounce all highmem pages
571 * BLK_BOUNCE_ANY : don't bounce anything
572 * BLK_BOUNCE_ISA : bounce pages above ISA DMA boundary
573 */
574#define BLK_BOUNCE_HIGH ((u64)blk_max_low_pfn << PAGE_SHIFT)
575#define BLK_BOUNCE_ANY ((u64)blk_max_pfn << PAGE_SHIFT)
576#define BLK_BOUNCE_ISA (ISA_DMA_THRESHOLD)
577
578#ifdef CONFIG_MMU
579extern int init_emergency_isa_pool(void);
580extern void blk_queue_bounce(request_queue_t *q, struct bio **bio);
581#else
582static inline int init_emergency_isa_pool(void)
583{
584 return 0;
585}
586static inline void blk_queue_bounce(request_queue_t *q, struct bio **bio)
587{
588}
589#endif /* CONFIG_MMU */
590
591#define rq_for_each_bio(_bio, rq) \
592 if ((rq->bio)) \
593 for (_bio = (rq)->bio; _bio; _bio = _bio->bi_next)
594
595struct sec_size {
596 unsigned block_size;
597 unsigned block_size_bits;
598};
599
600extern int blk_register_queue(struct gendisk *disk);
601extern void blk_unregister_queue(struct gendisk *disk);
602extern void register_disk(struct gendisk *dev);
603extern void generic_make_request(struct bio *bio);
604extern void blk_put_request(struct request *);
Mike Christie6e39b692005-11-11 05:30:24 -0600605extern void __blk_put_request(request_queue_t *, struct request *);
Tejun Heo8ffdc652006-01-06 09:49:03 +0100606extern void blk_end_sync_rq(struct request *rq, int error);
Al Viro8267e262005-10-21 03:20:53 -0400607extern struct request *blk_get_request(request_queue_t *, int, gfp_t);
Tejun Heo 867d1192005-04-24 02:06:05 -0500608extern void blk_insert_request(request_queue_t *, struct request *, int, void *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700609extern void blk_requeue_request(request_queue_t *, struct request *);
610extern void blk_plug_device(request_queue_t *);
611extern int blk_remove_plug(request_queue_t *);
612extern void blk_recount_segments(request_queue_t *, struct bio *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700613extern int scsi_cmd_ioctl(struct file *, struct gendisk *, unsigned int, void __user *);
Christoph Hellwig21b2f0c2006-03-22 17:52:04 +0100614extern int sg_scsi_ioctl(struct file *, struct request_queue *,
615 struct gendisk *, struct scsi_ioctl_command __user *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700616extern void blk_start_queue(request_queue_t *q);
617extern void blk_stop_queue(request_queue_t *q);
618extern void blk_sync_queue(struct request_queue *q);
619extern void __blk_stop_queue(request_queue_t *q);
620extern void blk_run_queue(request_queue_t *);
621extern void blk_queue_activity_fn(request_queue_t *, activity_fn *, void *);
Jens Axboedd1cab92005-06-20 14:06:01 +0200622extern int blk_rq_map_user(request_queue_t *, struct request *, void __user *, unsigned int);
623extern int blk_rq_unmap_user(struct bio *, unsigned int);
Al Viro8267e262005-10-21 03:20:53 -0400624extern int blk_rq_map_kern(request_queue_t *, struct request *, void *, unsigned int, gfp_t);
James Bottomley f1970ba2005-06-20 14:06:52 +0200625extern int blk_rq_map_user_iov(request_queue_t *, struct request *, struct sg_iovec *, int);
James Bottomley 994ca9a2005-06-20 14:11:09 +0200626extern int blk_execute_rq(request_queue_t *, struct gendisk *,
627 struct request *, int);
Mike Christie6e39b692005-11-11 05:30:24 -0600628extern void blk_execute_rq_nowait(request_queue_t *, struct gendisk *,
Jens Axboe15fc8582006-01-06 10:00:50 +0100629 struct request *, int, rq_end_io_fn *);
Mike Christie6e39b692005-11-11 05:30:24 -0600630
Linus Torvalds1da177e2005-04-16 15:20:36 -0700631static inline request_queue_t *bdev_get_queue(struct block_device *bdev)
632{
633 return bdev->bd_disk->queue;
634}
635
636static inline void blk_run_backing_dev(struct backing_dev_info *bdi,
637 struct page *page)
638{
639 if (bdi && bdi->unplug_io_fn)
640 bdi->unplug_io_fn(bdi, page);
641}
642
643static inline void blk_run_address_space(struct address_space *mapping)
644{
645 if (mapping)
646 blk_run_backing_dev(mapping->backing_dev_info, NULL);
647}
648
649/*
650 * end_request() and friends. Must be called with the request queue spinlock
651 * acquired. All functions called within end_request() _must_be_ atomic.
652 *
653 * Several drivers define their own end_request and call
654 * end_that_request_first() and end_that_request_last()
655 * for parts of the original function. This prevents
656 * code duplication in drivers.
657 */
658extern int end_that_request_first(struct request *, int, int);
659extern int end_that_request_chunk(struct request *, int, int);
Tejun Heo8ffdc652006-01-06 09:49:03 +0100660extern void end_that_request_last(struct request *, int);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700661extern void end_request(struct request *req, int uptodate);
Jens Axboeff856ba2006-01-09 16:02:34 +0100662extern void blk_complete_request(struct request *);
663
664static inline int rq_all_done(struct request *rq, unsigned int nr_bytes)
665{
666 if (blk_fs_request(rq))
667 return (nr_bytes >= (rq->hard_nr_sectors << 9));
668 else if (blk_pc_request(rq))
669 return nr_bytes >= rq->data_len;
670
671 return 0;
672}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700673
674/*
675 * end_that_request_first/chunk() takes an uptodate argument. we account
676 * any value <= as an io error. 0 means -EIO for compatability reasons,
677 * any other < 0 value is the direct error type. An uptodate value of
678 * 1 indicates successful io completion
679 */
680#define end_io_error(uptodate) (unlikely((uptodate) <= 0))
681
682static inline void blkdev_dequeue_request(struct request *req)
683{
Tejun Heo8922e162005-10-20 16:23:44 +0200684 elv_dequeue_request(req->q, req);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700685}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700686
Linus Torvalds1da177e2005-04-16 15:20:36 -0700687/*
Jens Axboe1b47f532005-10-20 16:37:00 +0200688 * This should be in elevator.h, but that requires pulling in rq and q
689 */
690static inline void elv_dispatch_add_tail(struct request_queue *q,
691 struct request *rq)
692{
Tejun Heo06b86242005-10-20 16:46:23 +0200693 if (q->last_merge == rq)
694 q->last_merge = NULL;
Tejun Heo15853af2005-11-10 08:52:05 +0100695 q->nr_sorted--;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700696
Jens Axboe1b47f532005-10-20 16:37:00 +0200697 q->end_sector = rq_end_sector(rq);
698 q->boundary_rq = rq;
699 list_add_tail(&rq->queuelist, &q->queue_head);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700700}
701
702/*
703 * Access functions for manipulating queue properties
704 */
Christoph Lameter19460892005-06-23 00:08:19 -0700705extern request_queue_t *blk_init_queue_node(request_fn_proc *rfn,
706 spinlock_t *lock, int node_id);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700707extern request_queue_t *blk_init_queue(request_fn_proc *, spinlock_t *);
708extern void blk_cleanup_queue(request_queue_t *);
709extern void blk_queue_make_request(request_queue_t *, make_request_fn *);
710extern void blk_queue_bounce_limit(request_queue_t *, u64);
Jens Axboe2cb2e142006-01-17 09:04:32 +0100711extern void blk_queue_max_sectors(request_queue_t *, unsigned int);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700712extern void blk_queue_max_phys_segments(request_queue_t *, unsigned short);
713extern void blk_queue_max_hw_segments(request_queue_t *, unsigned short);
714extern void blk_queue_max_segment_size(request_queue_t *, unsigned int);
715extern void blk_queue_hardsect_size(request_queue_t *, unsigned short);
716extern void blk_queue_stack_limits(request_queue_t *t, request_queue_t *b);
717extern void blk_queue_segment_boundary(request_queue_t *, unsigned long);
718extern void blk_queue_prep_rq(request_queue_t *, prep_rq_fn *pfn);
719extern void blk_queue_merge_bvec(request_queue_t *, merge_bvec_fn *);
720extern void blk_queue_dma_alignment(request_queue_t *, int);
Jens Axboeff856ba2006-01-09 16:02:34 +0100721extern void blk_queue_softirq_done(request_queue_t *, softirq_done_fn *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700722extern struct backing_dev_info *blk_get_backing_dev_info(struct block_device *bdev);
Tejun Heo797e7db2006-01-06 09:51:03 +0100723extern int blk_queue_ordered(request_queue_t *, unsigned, prepare_flush_fn *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700724extern void blk_queue_issue_flush_fn(request_queue_t *, issue_flush_fn *);
Tejun Heo797e7db2006-01-06 09:51:03 +0100725extern int blk_do_ordered(request_queue_t *, struct request **);
726extern unsigned blk_ordered_cur_seq(request_queue_t *);
727extern unsigned blk_ordered_req_seq(struct request *);
728extern void blk_ordered_complete_seq(request_queue_t *, unsigned, int);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700729
730extern int blk_rq_map_sg(request_queue_t *, struct request *, struct scatterlist *);
731extern void blk_dump_rq_flags(struct request *, char *);
732extern void generic_unplug_device(request_queue_t *);
733extern void __generic_unplug_device(request_queue_t *);
734extern long nr_blockdev_pages(void);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700735
736int blk_get_queue(request_queue_t *);
Al Viro8267e262005-10-21 03:20:53 -0400737request_queue_t *blk_alloc_queue(gfp_t);
738request_queue_t *blk_alloc_queue_node(gfp_t, int);
Al Viro483f4af2006-03-18 18:34:37 -0500739extern void blk_put_queue(request_queue_t *);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700740
741/*
742 * tag stuff
743 */
744#define blk_queue_tag_depth(q) ((q)->queue_tags->busy)
745#define blk_queue_tag_queue(q) ((q)->queue_tags->busy < (q)->queue_tags->max_depth)
746#define blk_rq_tagged(rq) ((rq)->flags & REQ_QUEUED)
747extern int blk_queue_start_tag(request_queue_t *, struct request *);
748extern struct request *blk_queue_find_tag(request_queue_t *, int);
749extern void blk_queue_end_tag(request_queue_t *, struct request *);
750extern int blk_queue_init_tags(request_queue_t *, int, struct blk_queue_tag *);
751extern void blk_queue_free_tags(request_queue_t *);
752extern int blk_queue_resize_tags(request_queue_t *, int);
753extern void blk_queue_invalidate_tags(request_queue_t *);
754extern long blk_congestion_wait(int rw, long timeout);
755
756extern void blk_rq_bio_prep(request_queue_t *, struct request *, struct bio *);
757extern int blkdev_issue_flush(struct block_device *, sector_t *);
758
759#define MAX_PHYS_SEGMENTS 128
760#define MAX_HW_SEGMENTS 128
Mike Christiedefd94b2005-12-05 02:37:06 -0600761#define SAFE_MAX_SECTORS 255
762#define BLK_DEF_MAX_SECTORS 1024
Linus Torvalds1da177e2005-04-16 15:20:36 -0700763
764#define MAX_SEGMENT_SIZE 65536
765
766#define blkdev_entry_to_request(entry) list_entry((entry), struct request, queuelist)
767
Linus Torvalds1da177e2005-04-16 15:20:36 -0700768static inline int queue_hardsect_size(request_queue_t *q)
769{
770 int retval = 512;
771
772 if (q && q->hardsect_size)
773 retval = q->hardsect_size;
774
775 return retval;
776}
777
778static inline int bdev_hardsect_size(struct block_device *bdev)
779{
780 return queue_hardsect_size(bdev_get_queue(bdev));
781}
782
783static inline int queue_dma_alignment(request_queue_t *q)
784{
785 int retval = 511;
786
787 if (q && q->dma_alignment)
788 retval = q->dma_alignment;
789
790 return retval;
791}
792
793static inline int bdev_dma_aligment(struct block_device *bdev)
794{
795 return queue_dma_alignment(bdev_get_queue(bdev));
796}
797
798#define blk_finished_io(nsects) do { } while (0)
799#define blk_started_io(nsects) do { } while (0)
800
801/* assumes size > 256 */
802static inline unsigned int blksize_bits(unsigned int size)
803{
804 unsigned int bits = 8;
805 do {
806 bits++;
807 size >>= 1;
808 } while (size > 256);
809 return bits;
810}
811
Adrian Bunk2befb9e2005-09-10 00:27:17 -0700812static inline unsigned int block_size(struct block_device *bdev)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700813{
814 return bdev->bd_block_size;
815}
816
817typedef struct {struct page *v;} Sector;
818
819unsigned char *read_dev_sector(struct block_device *, sector_t, Sector *);
820
821static inline void put_dev_sector(Sector p)
822{
823 page_cache_release(p.v);
824}
825
826struct work_struct;
827int kblockd_schedule_work(struct work_struct *work);
828void kblockd_flush(void);
829
830#ifdef CONFIG_LBD
831# include <asm/div64.h>
832# define sector_div(a, b) do_div(a, b)
833#else
834# define sector_div(n, b)( \
835{ \
836 int _res; \
837 _res = (n) % (b); \
838 (n) /= (b); \
839 _res; \
840} \
841)
842#endif
843
844#define MODULE_ALIAS_BLOCKDEV(major,minor) \
845 MODULE_ALIAS("block-major-" __stringify(major) "-" __stringify(minor))
846#define MODULE_ALIAS_BLOCKDEV_MAJOR(major) \
847 MODULE_ALIAS("block-major-" __stringify(major) "-*")
848
849
850#endif