blk.h 10.3 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_dequeue_request(struct request *rq);
68
void __blk_queue_free_tags(struct request_queue *q);
69 70 71 72 73 74 75 76 77 78 79 80
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);
}
81

82 83 84 85 86 87 88
#ifdef CONFIG_BLK_DEV_INTEGRITY
void blk_flush_integrity(void);
#else
static inline void blk_flush_integrity(void)
{
}
#endif
89

90
void blk_timeout_work(struct work_struct *work);
91
unsigned long blk_rq_timeout(unsigned long timeout);
92
void blk_add_timer(struct request *req);
J
Jens Axboe 已提交
93 94
void blk_delete_timer(struct request *);

95 96 97 98 99

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);
100 101
bool bio_attempt_discard_merge(struct request_queue *q, struct request *req,
		struct bio *bio);
102
bool blk_attempt_plug_merge(struct request_queue *q, struct bio *bio,
103 104
			    unsigned int *request_count,
			    struct request **same_queue_rq);
105
unsigned int blk_plug_queued_count(struct request_queue *q);
106 107 108 109 110

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 已提交
111 112 113 114 115
/*
 * Internal atomic flags for request handling
 */
enum rq_atomic_flags {
	REQ_ATOM_COMPLETE = 0,
116
	REQ_ATOM_STARTED,
117
	REQ_ATOM_POLL_SLEPT,
J
Jens Axboe 已提交
118 119 120 121
};

/*
 * EH timer and IO completion will both attempt to 'grab' the request, make
L
Lucas De Marchi 已提交
122
 * sure that only one of them succeeds
J
Jens Axboe 已提交
123 124 125 126 127 128 129 130 131 132
 */
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 已提交
133

134 135 136
/*
 * Internal elevator interface
 */
137
#define ELV_ON_HASH(rq) ((rq)->rq_flags & RQF_HASHED)
138

139
void blk_insert_flush(struct request *rq);
T
Tejun Heo 已提交
140

141 142 143
static inline struct request *__elv_next_request(struct request_queue *q)
{
	struct request *rq;
144
	struct blk_flush_queue *fq = blk_get_flush_queue(q, NULL);
145 146

	while (1) {
147
		if (!list_empty(&q->queue_head)) {
148
			rq = list_entry_rq(q->queue_head.next);
149
			return rq;
150 151
		}

152 153 154 155 156 157 158 159 160 161 162 163 164 165 166
		/*
		 * 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.
		 */
167
		if (fq->flush_pending_idx != fq->flush_running_idx &&
168
				!queue_flush_queueable(q)) {
169
			fq->flush_queue_delayed = 1;
170 171
			return NULL;
		}
172
		if (unlikely(blk_queue_bypass(q)) ||
173
		    !q->elevator->type->ops.sq.elevator_dispatch_fn(q, 0))
174 175 176 177 178 179 180 181
			return NULL;
	}
}

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

182 183
	if (e->type->ops.sq.elevator_activate_req_fn)
		e->type->ops.sq.elevator_activate_req_fn(q, rq);
184 185 186 187 188 189
}

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

190 191
	if (e->type->ops.sq.elevator_deactivate_req_fn)
		e->type->ops.sq.elevator_deactivate_req_fn(q, rq);
192 193
}

194 195 196 197 198 199 200 201 202 203 204 205
#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

206 207 208 209
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);
210 211
struct request *attempt_back_merge(struct request_queue *q, struct request *rq);
struct request *attempt_front_merge(struct request_queue *q, struct request *rq);
212 213
int blk_attempt_req_merge(struct request_queue *q, struct request *rq,
				struct request *next);
214
void blk_recalc_rq_segments(struct request *rq);
215
void blk_rq_set_mixed_merge(struct request *rq);
216
bool blk_rq_merge_ok(struct request *rq, struct bio *bio);
217
enum elv_merge blk_try_merge(struct request *rq, struct bio *bio);
218

219 220
void blk_queue_congestion_threshold(struct request_queue *q);

221 222
int blk_dev_init(void);

223

224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241
/*
 * 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;
}

242 243
extern int blk_update_nr_requests(struct request_queue *, unsigned int);

244 245 246 247 248
/*
 * 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
249
 *	c) it's a file system request
250
 */
251
static inline int blk_do_io_stat(struct request *rq)
252
{
253
	return rq->rq_disk &&
254
	       (rq->rq_flags & RQF_IO_STAT) &&
255
		!blk_rq_is_passthrough(rq);
256 257
}

258 259 260 261 262 263 264
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;
}

265 266 267 268
/*
 * Internal io_context interface
 */
void get_io_context(struct io_context *ioc);
269
struct io_cq *ioc_lookup_icq(struct io_context *ioc, struct request_queue *q);
270 271
struct io_cq *ioc_create_icq(struct io_context *ioc, struct request_queue *q,
			     gfp_t gfp_mask);
272
void ioc_clear_queue(struct request_queue *q);
273

274
int create_task_io_context(struct task_struct *task, gfp_t gfp_mask, int node);
275

J
Jens Axboe 已提交
276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291
/**
 * 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;
}

292 293 294 295 296
/**
 * create_io_context - try to create task->io_context
 * @gfp_mask: allocation mask
 * @node: allocation node
 *
297 298 299
 * 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.
300 301
 *
 * Note that this function can't be called with IRQ disabled because
302
 * task_lock which protects %current->io_context is IRQ-unsafe.
303
 */
304
static inline struct io_context *create_io_context(gfp_t gfp_mask, int node)
305 306
{
	WARN_ON_ONCE(irqs_disabled());
307 308 309
	if (unlikely(!current->io_context))
		create_task_io_context(current, gfp_mask, node);
	return current->io_context;
310 311 312 313 314
}

/*
 * Internal throttling interface
 */
315
#ifdef CONFIG_BLK_DEV_THROTTLING
316
extern void blk_throtl_drain(struct request_queue *q);
317 318
extern int blk_throtl_init(struct request_queue *q);
extern void blk_throtl_exit(struct request_queue *q);
319
extern void blk_throtl_register_queue(struct request_queue *q);
320
#else /* CONFIG_BLK_DEV_THROTTLING */
321
static inline void blk_throtl_drain(struct request_queue *q) { }
322 323
static inline int blk_throtl_init(struct request_queue *q) { return 0; }
static inline void blk_throtl_exit(struct request_queue *q) { }
324
static inline void blk_throtl_register_queue(struct request_queue *q) { }
325
#endif /* CONFIG_BLK_DEV_THROTTLING */
326 327 328 329
#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);
330
extern void blk_throtl_bio_endio(struct bio *bio);
331
extern void blk_throtl_stat_add(struct request *rq, u64 time);
332 333
#else
static inline void blk_throtl_bio_endio(struct bio *bio) { }
334
static inline void blk_throtl_stat_add(struct request *rq, u64 time) { }
335
#endif
336 337

#endif /* BLK_INTERNAL_H */