blk.h 10.9 KB
Newer Older
1 2 3
#ifndef BLK_INTERNAL_H
#define BLK_INTERNAL_H

4
#include <linux/idr.h>
5 6
#include <linux/blk-mq.h>
#include "blk-mq.h"
7

J
Jens Axboe 已提交
8 9 10 11 12 13
/* Amount of time in which a process may batch requests */
#define BLK_BATCH_TIME	(HZ/50UL)

/* Number of requests a "batching" process may submit */
#define BLK_BATCH_REQ	32

14 15 16
/* Max future timer expiry for timeouts */
#define BLK_MAX_TIMEOUT		(5 * HZ)

17 18 19 20
#ifdef CONFIG_DEBUG_FS
extern struct dentry *blk_debugfs_root;
#endif

21 22 23 24 25 26 27 28
struct blk_flush_queue {
	unsigned int		flush_queue_delayed:1;
	unsigned int		flush_pending_idx:1;
	unsigned int		flush_running_idx:1;
	unsigned long		flush_pending_since;
	struct list_head	flush_queue[2];
	struct list_head	flush_data_in_flight;
	struct request		*flush_rq;
29 30 31 32 33 34

	/*
	 * flush_rq shares tag with this rq, both can't be active
	 * at the same time
	 */
	struct request		*orig_rq;
35 36 37
	spinlock_t		mq_flush_lock;
};

38
extern struct kmem_cache *blk_requestq_cachep;
39
extern struct kmem_cache *request_cachep;
40
extern struct kobj_type blk_queue_ktype;
41
extern struct ida blk_queue_ida;
42

43
static inline struct blk_flush_queue *blk_get_flush_queue(
44
		struct request_queue *q, struct blk_mq_ctx *ctx)
45
{
C
Christoph Hellwig 已提交
46 47 48
	if (q->mq_ops)
		return blk_mq_map_queue(q, ctx->cpu)->fq;
	return q->fq;
49 50
}

T
Tejun Heo 已提交
51 52 53 54 55
static inline void __blk_get_queue(struct request_queue *q)
{
	kobject_get(&q->kobj);
}

56 57 58
struct blk_flush_queue *blk_alloc_flush_queue(struct request_queue *q,
		int node, int cmd_size);
void blk_free_flush_queue(struct blk_flush_queue *q);
59

60 61
int blk_init_rl(struct request_list *rl, struct request_queue *q,
		gfp_t gfp_mask);
62
void blk_exit_rl(struct request_queue *q, struct request_list *rl);
J
Jens Axboe 已提交
63 64
void blk_rq_bio_prep(struct request_queue *q, struct request *rq,
			struct bio *bio);
65 66
void blk_queue_bypass_start(struct request_queue *q);
void blk_queue_bypass_end(struct request_queue *q);
67
void __blk_queue_free_tags(struct request_queue *q);
68 69 70 71 72 73 74 75 76 77 78 79
void blk_freeze_queue(struct request_queue *q);

static inline void blk_queue_enter_live(struct request_queue *q)
{
	/*
	 * Given that running in generic_make_request() context
	 * guarantees that a live reference against q_usage_counter has
	 * been established, further references under that same context
	 * need not check that the queue has been frozen (marked dead).
	 */
	percpu_ref_get(&q->q_usage_counter);
}
80

81 82
#ifdef CONFIG_BLK_DEV_INTEGRITY
void blk_flush_integrity(void);
83 84 85 86 87 88 89
bool __bio_integrity_endio(struct bio *);
static inline bool bio_integrity_endio(struct bio *bio)
{
	if (bio_integrity(bio))
		return __bio_integrity_endio(bio);
	return true;
}
90 91 92 93
#else
static inline void blk_flush_integrity(void)
{
}
94 95 96 97
static inline bool bio_integrity_endio(struct bio *bio)
{
	return true;
}
98
#endif
99

100
void blk_timeout_work(struct work_struct *work);
101
unsigned long blk_rq_timeout(unsigned long timeout);
102
void blk_add_timer(struct request *req);
J
Jens Axboe 已提交
103 104
void blk_delete_timer(struct request *);

105 106 107 108 109

bool bio_attempt_front_merge(struct request_queue *q, struct request *req,
			     struct bio *bio);
bool bio_attempt_back_merge(struct request_queue *q, struct request *req,
			    struct bio *bio);
110 111
bool bio_attempt_discard_merge(struct request_queue *q, struct request *req,
		struct bio *bio);
112
bool blk_attempt_plug_merge(struct request_queue *q, struct bio *bio,
113 114
			    unsigned int *request_count,
			    struct request **same_queue_rq);
115
unsigned int blk_plug_queued_count(struct request_queue *q);
116 117 118 119 120

void blk_account_io_start(struct request *req, bool new_io);
void blk_account_io_completion(struct request *req, unsigned int bytes);
void blk_account_io_done(struct request *req);

J
Jens Axboe 已提交
121 122 123 124 125
/*
 * Internal atomic flags for request handling
 */
enum rq_atomic_flags {
	REQ_ATOM_COMPLETE = 0,
126
	REQ_ATOM_STARTED,
127
	REQ_ATOM_POLL_SLEPT,
J
Jens Axboe 已提交
128 129 130 131
};

/*
 * EH timer and IO completion will both attempt to 'grab' the request, make
L
Lucas De Marchi 已提交
132
 * sure that only one of them succeeds
J
Jens Axboe 已提交
133 134 135 136 137 138 139 140 141 142
 */
static inline int blk_mark_rq_complete(struct request *rq)
{
	return test_and_set_bit(REQ_ATOM_COMPLETE, &rq->atomic_flags);
}

static inline void blk_clear_rq_complete(struct request *rq)
{
	clear_bit(REQ_ATOM_COMPLETE, &rq->atomic_flags);
}
J
Jens Axboe 已提交
143

144 145 146
/*
 * Internal elevator interface
 */
147
#define ELV_ON_HASH(rq) ((rq)->rq_flags & RQF_HASHED)
148

149
void blk_insert_flush(struct request *rq);
T
Tejun Heo 已提交
150

151 152 153
static inline struct request *__elv_next_request(struct request_queue *q)
{
	struct request *rq;
154
	struct blk_flush_queue *fq = blk_get_flush_queue(q, NULL);
155

156 157
	WARN_ON_ONCE(q->mq_ops);

158
	while (1) {
159
		if (!list_empty(&q->queue_head)) {
160
			rq = list_entry_rq(q->queue_head.next);
161
			return rq;
162 163
		}

164 165 166 167 168 169 170 171 172 173 174 175 176 177 178
		/*
		 * Flush request is running and flush request isn't queueable
		 * in the drive, we can hold the queue till flush request is
		 * finished. Even we don't do this, driver can't dispatch next
		 * requests and will requeue them. And this can improve
		 * throughput too. For example, we have request flush1, write1,
		 * flush 2. flush1 is dispatched, then queue is hold, write1
		 * isn't inserted to queue. After flush1 is finished, flush2
		 * will be dispatched. Since disk cache is already clean,
		 * flush2 will be finished very soon, so looks like flush2 is
		 * folded to flush1.
		 * Since the queue is hold, a flag is set to indicate the queue
		 * should be restarted later. Please see flush_end_io() for
		 * details.
		 */
179
		if (fq->flush_pending_idx != fq->flush_running_idx &&
180
				!queue_flush_queueable(q)) {
181
			fq->flush_queue_delayed = 1;
182 183
			return NULL;
		}
184
		if (unlikely(blk_queue_bypass(q)) ||
185
		    !q->elevator->type->ops.sq.elevator_dispatch_fn(q, 0))
186 187 188 189 190 191 192 193
			return NULL;
	}
}

static inline void elv_activate_rq(struct request_queue *q, struct request *rq)
{
	struct elevator_queue *e = q->elevator;

194 195
	if (e->type->ops.sq.elevator_activate_req_fn)
		e->type->ops.sq.elevator_activate_req_fn(q, rq);
196 197 198 199 200 201
}

static inline void elv_deactivate_rq(struct request_queue *q, struct request *rq)
{
	struct elevator_queue *e = q->elevator;

202 203
	if (e->type->ops.sq.elevator_deactivate_req_fn)
		e->type->ops.sq.elevator_deactivate_req_fn(q, rq);
204 205
}

206 207
struct hd_struct *__disk_get_part(struct gendisk *disk, int partno);

208 209 210 211 212 213 214 215 216 217 218 219
#ifdef CONFIG_FAIL_IO_TIMEOUT
int blk_should_fake_timeout(struct request_queue *);
ssize_t part_timeout_show(struct device *, struct device_attribute *, char *);
ssize_t part_timeout_store(struct device *, struct device_attribute *,
				const char *, size_t);
#else
static inline int blk_should_fake_timeout(struct request_queue *q)
{
	return 0;
}
#endif

220 221 222 223
int ll_back_merge_fn(struct request_queue *q, struct request *req,
		     struct bio *bio);
int ll_front_merge_fn(struct request_queue *q, struct request *req, 
		      struct bio *bio);
224 225
struct request *attempt_back_merge(struct request_queue *q, struct request *rq);
struct request *attempt_front_merge(struct request_queue *q, struct request *rq);
226 227
int blk_attempt_req_merge(struct request_queue *q, struct request *rq,
				struct request *next);
228
void blk_recalc_rq_segments(struct request *rq);
229
void blk_rq_set_mixed_merge(struct request *rq);
230
bool blk_rq_merge_ok(struct request *rq, struct bio *bio);
231
enum elv_merge blk_try_merge(struct request *rq, struct bio *bio);
232

233 234
void blk_queue_congestion_threshold(struct request_queue *q);

235 236
int blk_dev_init(void);

237

238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255
/*
 * Return the threshold (number of used requests) at which the queue is
 * considered to be congested.  It include a little hysteresis to keep the
 * context switch rate down.
 */
static inline int queue_congestion_on_threshold(struct request_queue *q)
{
	return q->nr_congestion_on;
}

/*
 * The threshold at which a queue is considered to be uncongested
 */
static inline int queue_congestion_off_threshold(struct request_queue *q)
{
	return q->nr_congestion_off;
}

256 257
extern int blk_update_nr_requests(struct request_queue *, unsigned int);

258 259 260 261 262
/*
 * Contribute to IO statistics IFF:
 *
 *	a) it's attached to a gendisk, and
 *	b) the queue had IO stats enabled when this request was started, and
263
 *	c) it's a file system request
264
 */
265
static inline int blk_do_io_stat(struct request *rq)
266
{
267
	return rq->rq_disk &&
268
	       (rq->rq_flags & RQF_IO_STAT) &&
269
		!blk_rq_is_passthrough(rq);
270 271
}

272 273 274 275 276 277 278
static inline void req_set_nomerge(struct request_queue *q, struct request *req)
{
	req->cmd_flags |= REQ_NOMERGE;
	if (req == q->last_merge)
		q->last_merge = NULL;
}

279 280 281 282
/*
 * Internal io_context interface
 */
void get_io_context(struct io_context *ioc);
283
struct io_cq *ioc_lookup_icq(struct io_context *ioc, struct request_queue *q);
284 285
struct io_cq *ioc_create_icq(struct io_context *ioc, struct request_queue *q,
			     gfp_t gfp_mask);
286
void ioc_clear_queue(struct request_queue *q);
287

288
int create_task_io_context(struct task_struct *task, gfp_t gfp_mask, int node);
289

J
Jens Axboe 已提交
290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305
/**
 * rq_ioc - determine io_context for request allocation
 * @bio: request being allocated is for this bio (can be %NULL)
 *
 * Determine io_context to use for request allocation for @bio.  May return
 * %NULL if %current->io_context doesn't exist.
 */
static inline struct io_context *rq_ioc(struct bio *bio)
{
#ifdef CONFIG_BLK_CGROUP
	if (bio && bio->bi_ioc)
		return bio->bi_ioc;
#endif
	return current->io_context;
}

306 307 308 309 310
/**
 * create_io_context - try to create task->io_context
 * @gfp_mask: allocation mask
 * @node: allocation node
 *
311 312 313
 * If %current->io_context is %NULL, allocate a new io_context and install
 * it.  Returns the current %current->io_context which may be %NULL if
 * allocation failed.
314 315
 *
 * Note that this function can't be called with IRQ disabled because
316
 * task_lock which protects %current->io_context is IRQ-unsafe.
317
 */
318
static inline struct io_context *create_io_context(gfp_t gfp_mask, int node)
319 320
{
	WARN_ON_ONCE(irqs_disabled());
321 322 323
	if (unlikely(!current->io_context))
		create_task_io_context(current, gfp_mask, node);
	return current->io_context;
324 325 326 327 328
}

/*
 * Internal throttling interface
 */
329
#ifdef CONFIG_BLK_DEV_THROTTLING
330
extern void blk_throtl_drain(struct request_queue *q);
331 332
extern int blk_throtl_init(struct request_queue *q);
extern void blk_throtl_exit(struct request_queue *q);
333
extern void blk_throtl_register_queue(struct request_queue *q);
334
#else /* CONFIG_BLK_DEV_THROTTLING */
335
static inline void blk_throtl_drain(struct request_queue *q) { }
336 337
static inline int blk_throtl_init(struct request_queue *q) { return 0; }
static inline void blk_throtl_exit(struct request_queue *q) { }
338
static inline void blk_throtl_register_queue(struct request_queue *q) { }
339
#endif /* CONFIG_BLK_DEV_THROTTLING */
340 341 342 343
#ifdef CONFIG_BLK_DEV_THROTTLING_LOW
extern ssize_t blk_throtl_sample_time_show(struct request_queue *q, char *page);
extern ssize_t blk_throtl_sample_time_store(struct request_queue *q,
	const char *page, size_t count);
344
extern void blk_throtl_bio_endio(struct bio *bio);
345
extern void blk_throtl_stat_add(struct request *rq, u64 time);
346 347
#else
static inline void blk_throtl_bio_endio(struct bio *bio) { }
348
static inline void blk_throtl_stat_add(struct request *rq, u64 time) { }
349
#endif
350

351 352 353 354 355 356 357 358 359 360 361 362 363
#ifdef CONFIG_BOUNCE
extern int init_emergency_isa_pool(void);
extern void blk_queue_bounce(struct request_queue *q, struct bio **bio);
#else
static inline int init_emergency_isa_pool(void)
{
	return 0;
}
static inline void blk_queue_bounce(struct request_queue *q, struct bio **bio)
{
}
#endif /* CONFIG_BOUNCE */

364
#endif /* BLK_INTERNAL_H */