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