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