blkdev.h 60.8 KB
Newer Older
1
/* SPDX-License-Identifier: GPL-2.0 */
L
Linus Torvalds 已提交
2 3 4
#ifndef _LINUX_BLKDEV_H
#define _LINUX_BLKDEV_H

5
#include <linux/sched.h>
6
#include <linux/sched/clock.h>
7

J
Jens Axboe 已提交
8 9
#ifdef CONFIG_BLOCK

L
Linus Torvalds 已提交
10 11 12
#include <linux/major.h>
#include <linux/genhd.h>
#include <linux/list.h>
13
#include <linux/llist.h>
L
Linus Torvalds 已提交
14 15 16
#include <linux/timer.h>
#include <linux/workqueue.h>
#include <linux/pagemap.h>
17
#include <linux/backing-dev-defs.h>
L
Linus Torvalds 已提交
18 19
#include <linux/wait.h>
#include <linux/mempool.h>
D
Dan Williams 已提交
20
#include <linux/pfn.h>
L
Linus Torvalds 已提交
21 22
#include <linux/bio.h>
#include <linux/stringify.h>
23
#include <linux/gfp.h>
24
#include <linux/bsg.h>
25
#include <linux/smp.h>
T
Tejun Heo 已提交
26
#include <linux/rcupdate.h>
27
#include <linux/percpu-refcount.h>
C
Christoph Hellwig 已提交
28
#include <linux/scatterlist.h>
29
#include <linux/blkzoned.h>
L
Linus Torvalds 已提交
30

31
struct module;
32 33
struct scsi_ioctl_command;

L
Linus Torvalds 已提交
34 35
struct request_queue;
struct elevator_queue;
36
struct blk_trace;
37 38
struct request;
struct sg_io_hdr;
M
Mike Christie 已提交
39
struct bsg_job;
T
Tejun Heo 已提交
40
struct blkcg_gq;
41
struct blk_flush_queue;
42
struct pr_ops;
J
Jens Axboe 已提交
43
struct rq_wb;
44 45
struct blk_queue_stats;
struct blk_stat_callback;
L
Linus Torvalds 已提交
46 47 48 49

#define BLKDEV_MIN_RQ	4
#define BLKDEV_MAX_RQ	128	/* Default maximum */

50 51 52
/* Must be consisitent with blk_mq_poll_stats_bkt() */
#define BLK_MQ_POLL_STATS_BKTS 16

T
Tejun Heo 已提交
53 54 55 56
/*
 * Maximum number of blkcg policies allowed to be registered concurrently.
 * Defined here to simplify include dependency.
 */
57
#define BLKCG_MAX_POLS		3
T
Tejun Heo 已提交
58

59
typedef void (rq_end_io_fn)(struct request *, blk_status_t);
L
Linus Torvalds 已提交
60

61 62 63
#define BLK_RL_SYNCFULL		(1U << 0)
#define BLK_RL_ASYNCFULL	(1U << 1)

L
Linus Torvalds 已提交
64
struct request_list {
65
	struct request_queue	*q;	/* the queue this rl belongs to */
66 67 68
#ifdef CONFIG_BLK_CGROUP
	struct blkcg_gq		*blkg;	/* blkg this request pool belongs to */
#endif
69 70 71 72
	/*
	 * count[], starved[], and wait[] are indexed by
	 * BLK_RW_SYNC/BLK_RW_ASYNC
	 */
73 74 75 76
	int			count[2];
	int			starved[2];
	mempool_t		*rq_pool;
	wait_queue_head_t	wait[2];
77
	unsigned int		flags;
L
Linus Torvalds 已提交
78 79
};

80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118
/*
 * request flags */
typedef __u32 __bitwise req_flags_t;

/* elevator knows about this request */
#define RQF_SORTED		((__force req_flags_t)(1 << 0))
/* drive already may have started this one */
#define RQF_STARTED		((__force req_flags_t)(1 << 1))
/* uses tagged queueing */
#define RQF_QUEUED		((__force req_flags_t)(1 << 2))
/* may not be passed by ioscheduler */
#define RQF_SOFTBARRIER		((__force req_flags_t)(1 << 3))
/* request for flush sequence */
#define RQF_FLUSH_SEQ		((__force req_flags_t)(1 << 4))
/* merge of different types, fail separately */
#define RQF_MIXED_MERGE		((__force req_flags_t)(1 << 5))
/* track inflight for MQ */
#define RQF_MQ_INFLIGHT		((__force req_flags_t)(1 << 6))
/* don't call prep for this one */
#define RQF_DONTPREP		((__force req_flags_t)(1 << 7))
/* set for "ide_preempt" requests and also for requests for which the SCSI
   "quiesce" state must be ignored. */
#define RQF_PREEMPT		((__force req_flags_t)(1 << 8))
/* contains copies of user pages */
#define RQF_COPY_USER		((__force req_flags_t)(1 << 9))
/* vaguely specified driver internal error.  Ignored by the block layer */
#define RQF_FAILED		((__force req_flags_t)(1 << 10))
/* don't warn about errors */
#define RQF_QUIET		((__force req_flags_t)(1 << 11))
/* elevator private data attached */
#define RQF_ELVPRIV		((__force req_flags_t)(1 << 12))
/* account I/O stat */
#define RQF_IO_STAT		((__force req_flags_t)(1 << 13))
/* request came from our alloc pool */
#define RQF_ALLOCED		((__force req_flags_t)(1 << 14))
/* runtime pm request */
#define RQF_PM			((__force req_flags_t)(1 << 15))
/* on IO scheduler merge hash */
#define RQF_HASHED		((__force req_flags_t)(1 << 16))
119 120
/* IO stats tracking on */
#define RQF_STATS		((__force req_flags_t)(1 << 17))
121 122 123
/* Look at ->special_vec for the actual data payload instead of the
   bio chain. */
#define RQF_SPECIAL_PAYLOAD	((__force req_flags_t)(1 << 18))
124 125
/* The per-zone write lock is held for this request */
#define RQF_ZONE_WRITE_LOCKED	((__force req_flags_t)(1 << 19))
126 127 128

/* flags that prevent us from merging requests: */
#define RQF_NOMERGE_FLAGS \
129
	(RQF_STARTED | RQF_SOFTBARRIER | RQF_FLUSH_SEQ | RQF_SPECIAL_PAYLOAD)
130

L
Linus Torvalds 已提交
131
/*
132 133 134 135
 * Try to put the fields that are referenced together in the same cacheline.
 *
 * If you modify this structure, make sure to update blk_rq_init() and
 * especially blk_mq_rq_ctx_init() to take care of the added fields.
L
Linus Torvalds 已提交
136 137
 */
struct request {
138
	struct list_head queuelist;
139
	union {
140
		call_single_data_t csd;
141
		u64 fifo_time;
142
	};
143

144
	struct request_queue *q;
145
	struct blk_mq_ctx *mq_ctx;
146

147
	int cpu;
148
	unsigned int cmd_flags;		/* op and common flags */
149
	req_flags_t rq_flags;
150 151 152

	int internal_tag;

J
Jens Axboe 已提交
153
	unsigned long atomic_flags;
L
Linus Torvalds 已提交
154

155 156
	/* the following two fields are internal, NEVER access directly */
	unsigned int __data_len;	/* total data len */
157
	int tag;
158
	sector_t __sector;		/* sector cursor */
L
Linus Torvalds 已提交
159 160 161 162

	struct bio *bio;
	struct bio *biotail;

163 164 165 166 167 168 169 170 171 172 173 174
	/*
	 * The hash is used inside the scheduler, and killed once the
	 * request reaches the dispatch list. The ipi_list is only used
	 * to queue the request for softirq completion, which is long
	 * after the request has been unhashed (and even removed from
	 * the dispatch list).
	 */
	union {
		struct hlist_node hash;	/* merge hash */
		struct list_head ipi_list;
	};

175 176 177
	/*
	 * The rb_node is only used inside the io scheduler, requests
	 * are pruned when moved to the dispatch queue. So let the
178
	 * completion_data share space with the rb_node.
179 180 181
	 */
	union {
		struct rb_node rb_node;	/* sort/lookup */
182
		struct bio_vec special_vec;
183
		void *completion_data;
184
		int error_count; /* for legacy drivers, don't use */
185
	};
186

187
	/*
188
	 * Three pointers are available for the IO schedulers, if they need
189 190
	 * more they have to dynamically allocate it.  Flush requests are
	 * never put on the IO scheduler. So let the flush fields share
191
	 * space with the elevator data.
192
	 */
193
	union {
194 195 196 197 198
		struct {
			struct io_cq		*icq;
			void			*priv[2];
		} elv;

199 200 201
		struct {
			unsigned int		seq;
			struct list_head	list;
202
			rq_end_io_fn		*saved_end_io;
203 204
		} flush;
	};
205

206
	struct gendisk *rq_disk;
207
	struct hd_struct *part;
L
Linus Torvalds 已提交
208
	unsigned long start_time;
209
	struct blk_issue_stat issue_stat;
210
#ifdef CONFIG_BLK_CGROUP
211
	struct request_list *rl;		/* rl this rq is alloced from */
212 213 214
	unsigned long long start_time_ns;
	unsigned long long io_start_time_ns;    /* when passed to hardware */
#endif
L
Linus Torvalds 已提交
215 216 217 218
	/* Number of scatter-gather DMA addr+len pairs after
	 * physical address coalescing is performed.
	 */
	unsigned short nr_phys_segments;
219 220 221
#if defined(CONFIG_BLK_DEV_INTEGRITY)
	unsigned short nr_integrity_segments;
#endif
L
Linus Torvalds 已提交
222

223 224
	unsigned short ioprio;

225
	unsigned int timeout;
L
Linus Torvalds 已提交
226

T
Tejun Heo 已提交
227
	void *special;		/* opaque pointer available for LLD use */
228

229
	unsigned int extra_len;	/* length of alignment and padding */
L
Linus Torvalds 已提交
230

231 232
	unsigned short write_hint;

J
Jens Axboe 已提交
233 234
	unsigned long deadline;
	struct list_head timeout_list;
L
Linus Torvalds 已提交
235 236

	/*
237
	 * completion callback.
L
Linus Torvalds 已提交
238 239 240
	 */
	rq_end_io_fn *end_io;
	void *end_io_data;
241 242 243

	/* for bidi */
	struct request *next_rq;
L
Linus Torvalds 已提交
244 245
};

246 247 248 249 250 251 252 253 254 255
static inline bool blk_rq_is_scsi(struct request *rq)
{
	return req_op(rq) == REQ_OP_SCSI_IN || req_op(rq) == REQ_OP_SCSI_OUT;
}

static inline bool blk_rq_is_private(struct request *rq)
{
	return req_op(rq) == REQ_OP_DRV_IN || req_op(rq) == REQ_OP_DRV_OUT;
}

256 257
static inline bool blk_rq_is_passthrough(struct request *rq)
{
258
	return blk_rq_is_scsi(rq) || blk_rq_is_private(rq);
259 260
}

261 262 263 264 265
static inline unsigned short req_get_ioprio(struct request *req)
{
	return req->ioprio;
}

L
Linus Torvalds 已提交
266 267
#include <linux/elevator.h>

268 269
struct blk_queue_ctx;

270
typedef void (request_fn_proc) (struct request_queue *q);
271
typedef blk_qc_t (make_request_fn) (struct request_queue *q, struct bio *bio);
272
typedef bool (poll_q_fn) (struct request_queue *q, blk_qc_t);
273
typedef int (prep_rq_fn) (struct request_queue *, struct request *);
274
typedef void (unprep_rq_fn) (struct request_queue *, struct request *);
L
Linus Torvalds 已提交
275 276

struct bio_vec;
277
typedef void (softirq_done_fn)(struct request *);
278
typedef int (dma_drain_needed_fn)(struct request *);
279
typedef int (lld_busy_fn) (struct request_queue *q);
M
Mike Christie 已提交
280
typedef int (bsg_job_fn) (struct bsg_job *);
281 282
typedef int (init_rq_fn)(struct request_queue *, struct request *, gfp_t);
typedef void (exit_rq_fn)(struct request_queue *, struct request *);
L
Linus Torvalds 已提交
283

J
Jens Axboe 已提交
284 285 286 287 288 289 290 291
enum blk_eh_timer_return {
	BLK_EH_NOT_HANDLED,
	BLK_EH_HANDLED,
	BLK_EH_RESET_TIMER,
};

typedef enum blk_eh_timer_return (rq_timed_out_fn)(struct request *);

L
Linus Torvalds 已提交
292 293 294 295 296 297 298 299 300
enum blk_queue_state {
	Queue_down,
	Queue_up,
};

struct blk_queue_tag {
	struct request **tag_index;	/* map of busy tags */
	unsigned long *tag_map;		/* bit map of free/busy tags */
	int max_depth;			/* what we will send to device */
301
	int real_max_depth;		/* what the array can hold */
L
Linus Torvalds 已提交
302
	atomic_t refcnt;		/* map can be shared */
303 304
	int alloc_policy;		/* tag allocation policy */
	int next_tag;			/* next tag */
L
Linus Torvalds 已提交
305
};
306 307
#define BLK_TAG_ALLOC_FIFO 0 /* allocate starting from 0 */
#define BLK_TAG_ALLOC_RR 1 /* allocate starting from last allocated tag */
L
Linus Torvalds 已提交
308

309 310 311
#define BLK_SCSI_MAX_CMDS	(256)
#define BLK_SCSI_CMD_PER_LONG	(BLK_SCSI_MAX_CMDS / (sizeof(long) * 8))

D
Damien Le Moal 已提交
312 313 314 315 316 317 318 319 320
/*
 * Zoned block device models (zoned limit).
 */
enum blk_zoned_model {
	BLK_ZONED_NONE,	/* Regular block device */
	BLK_ZONED_HA,	/* Host-aware zoned block device */
	BLK_ZONED_HM,	/* Host-managed zoned block device */
};

321 322 323
struct queue_limits {
	unsigned long		bounce_pfn;
	unsigned long		seg_boundary_mask;
324
	unsigned long		virt_boundary_mask;
325 326

	unsigned int		max_hw_sectors;
327
	unsigned int		max_dev_sectors;
328
	unsigned int		chunk_sectors;
329 330
	unsigned int		max_sectors;
	unsigned int		max_segment_size;
331 332 333 334
	unsigned int		physical_block_size;
	unsigned int		alignment_offset;
	unsigned int		io_min;
	unsigned int		io_opt;
335
	unsigned int		max_discard_sectors;
336
	unsigned int		max_hw_discard_sectors;
337
	unsigned int		max_write_same_sectors;
338
	unsigned int		max_write_zeroes_sectors;
339 340
	unsigned int		discard_granularity;
	unsigned int		discard_alignment;
341 342

	unsigned short		logical_block_size;
343
	unsigned short		max_segments;
344
	unsigned short		max_integrity_segments;
345
	unsigned short		max_discard_segments;
346

347
	unsigned char		misaligned;
348
	unsigned char		discard_misaligned;
349
	unsigned char		cluster;
350
	unsigned char		raid_partial_stripes_expensive;
D
Damien Le Moal 已提交
351
	enum blk_zoned_model	zoned;
352 353
};

354 355 356 357 358 359 360 361 362 363 364 365 366
#ifdef CONFIG_BLK_DEV_ZONED

struct blk_zone_report_hdr {
	unsigned int	nr_zones;
	u8		padding[60];
};

extern int blkdev_report_zones(struct block_device *bdev,
			       sector_t sector, struct blk_zone *zones,
			       unsigned int *nr_zones, gfp_t gfp_mask);
extern int blkdev_reset_zones(struct block_device *bdev, sector_t sectors,
			      sector_t nr_sectors, gfp_t gfp_mask);

S
Shaun Tancheff 已提交
367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387
extern int blkdev_report_zones_ioctl(struct block_device *bdev, fmode_t mode,
				     unsigned int cmd, unsigned long arg);
extern int blkdev_reset_zones_ioctl(struct block_device *bdev, fmode_t mode,
				    unsigned int cmd, unsigned long arg);

#else /* CONFIG_BLK_DEV_ZONED */

static inline int blkdev_report_zones_ioctl(struct block_device *bdev,
					    fmode_t mode, unsigned int cmd,
					    unsigned long arg)
{
	return -ENOTTY;
}

static inline int blkdev_reset_zones_ioctl(struct block_device *bdev,
					   fmode_t mode, unsigned int cmd,
					   unsigned long arg)
{
	return -ENOTTY;
}

388 389
#endif /* CONFIG_BLK_DEV_ZONED */

390
struct request_queue {
L
Linus Torvalds 已提交
391 392 393 394 395
	/*
	 * Together with queue_head for cacheline sharing
	 */
	struct list_head	queue_head;
	struct request		*last_merge;
J
Jens Axboe 已提交
396
	struct elevator_queue	*elevator;
397 398
	int			nr_rqs[2];	/* # allocated [a]sync rqs */
	int			nr_rqs_elvpriv;	/* # allocated rqs w/ elvpriv */
L
Linus Torvalds 已提交
399

400 401
	atomic_t		shared_hctx_restart;

402
	struct blk_queue_stats	*stats;
J
Jens Axboe 已提交
403 404
	struct rq_wb		*rq_wb;

L
Linus Torvalds 已提交
405
	/*
406 407 408 409
	 * If blkcg is not used, @q->root_rl serves all requests.  If blkcg
	 * is used, root blkg allocates from @q->root_rl and all other
	 * blkgs from their own blkg->rl.  Which one to use should be
	 * determined using bio_request_list().
L
Linus Torvalds 已提交
410
	 */
411
	struct request_list	root_rl;
L
Linus Torvalds 已提交
412 413 414

	request_fn_proc		*request_fn;
	make_request_fn		*make_request_fn;
415
	poll_q_fn		*poll_fn;
L
Linus Torvalds 已提交
416
	prep_rq_fn		*prep_rq_fn;
417
	unprep_rq_fn		*unprep_rq_fn;
418
	softirq_done_fn		*softirq_done_fn;
J
Jens Axboe 已提交
419
	rq_timed_out_fn		*rq_timed_out_fn;
420
	dma_drain_needed_fn	*dma_drain_needed;
421
	lld_busy_fn		*lld_busy_fn;
422
	/* Called just after a request is allocated */
423
	init_rq_fn		*init_rq_fn;
424
	/* Called just before a request is freed */
425
	exit_rq_fn		*exit_rq_fn;
426 427
	/* Called from inside blk_get_request() */
	void (*initialize_rq_fn)(struct request *rq);
L
Linus Torvalds 已提交
428

J
Jens Axboe 已提交
429
	const struct blk_mq_ops	*mq_ops;
430 431 432 433

	unsigned int		*mq_map;

	/* sw queues */
434
	struct blk_mq_ctx __percpu	*queue_ctx;
435 436
	unsigned int		nr_queues;

437 438
	unsigned int		queue_depth;

439 440 441 442
	/* hw dispatch queues */
	struct blk_mq_hw_ctx	**queue_hw_ctx;
	unsigned int		nr_hw_queues;

443 444 445
	/*
	 * Dispatch queue sorting
	 */
J
Jens Axboe 已提交
446
	sector_t		end_sector;
447 448
	struct request		*boundary_rq;

L
Linus Torvalds 已提交
449
	/*
450
	 * Delayed queue handling
L
Linus Torvalds 已提交
451
	 */
452
	struct delayed_work	delay_work;
L
Linus Torvalds 已提交
453

454
	struct backing_dev_info	*backing_dev_info;
L
Linus Torvalds 已提交
455 456 457 458 459 460 461 462

	/*
	 * The queue owner gets to use this for whatever they like.
	 * ll_rw_blk doesn't touch it.
	 */
	void			*queuedata;

	/*
463
	 * various queue flags, see QUEUE_* below
L
Linus Torvalds 已提交
464
	 */
465
	unsigned long		queue_flags;
L
Linus Torvalds 已提交
466

467 468 469 470 471 472
	/*
	 * ida allocated id for this queue.  Used to index queues from
	 * ioctx.
	 */
	int			id;

L
Linus Torvalds 已提交
473
	/*
474
	 * queue needs bounce pages for pages above this limit
L
Linus Torvalds 已提交
475
	 */
476
	gfp_t			bounce_gfp;
L
Linus Torvalds 已提交
477 478

	/*
已提交
479 480 481
	 * protects queue structures from reentrancy. ->__queue_lock should
	 * _never_ be used directly, it is queue private. always use
	 * ->queue_lock.
L
Linus Torvalds 已提交
482
	 */
已提交
483
	spinlock_t		__queue_lock;
L
Linus Torvalds 已提交
484 485 486 487 488 489 490
	spinlock_t		*queue_lock;

	/*
	 * queue kobject
	 */
	struct kobject kobj;

491 492 493 494 495
	/*
	 * mq queue kobject
	 */
	struct kobject mq_kobj;

496 497 498 499
#ifdef  CONFIG_BLK_DEV_INTEGRITY
	struct blk_integrity integrity;
#endif	/* CONFIG_BLK_DEV_INTEGRITY */

500
#ifdef CONFIG_PM
L
Lin Ming 已提交
501 502 503 504 505
	struct device		*dev;
	int			rpm_status;
	unsigned int		nr_pending;
#endif

L
Linus Torvalds 已提交
506 507 508 509 510 511 512 513
	/*
	 * queue settings
	 */
	unsigned long		nr_requests;	/* Max # of requests */
	unsigned int		nr_congestion_on;
	unsigned int		nr_congestion_off;
	unsigned int		nr_batching;

J
James Bottomley 已提交
514
	unsigned int		dma_drain_size;
515
	void			*dma_drain_buffer;
516
	unsigned int		dma_pad_mask;
L
Linus Torvalds 已提交
517 518 519
	unsigned int		dma_alignment;

	struct blk_queue_tag	*queue_tags;
520
	struct list_head	tag_busy_list;
L
Linus Torvalds 已提交
521

522
	unsigned int		nr_sorted;
523
	unsigned int		in_flight[2];
524

525 526 527 528 529 530
	/*
	 * Number of active block driver functions for which blk_drain_queue()
	 * must wait. Must be incremented around functions that unlock the
	 * queue_lock internally, e.g. scsi_request_fn().
	 */
	unsigned int		request_fn_active;
L
Linus Torvalds 已提交
531

J
Jens Axboe 已提交
532
	unsigned int		rq_timeout;
533
	int			poll_nsec;
534 535

	struct blk_stat_callback	*poll_cb;
536
	struct blk_rq_stat	poll_stat[BLK_MQ_POLL_STATS_BKTS];
537

J
Jens Axboe 已提交
538
	struct timer_list	timeout;
539
	struct work_struct	timeout_work;
J
Jens Axboe 已提交
540 541
	struct list_head	timeout_list;

542
	struct list_head	icq_list;
543
#ifdef CONFIG_BLK_CGROUP
544
	DECLARE_BITMAP		(blkcg_pols, BLKCG_MAX_POLS);
T
Tejun Heo 已提交
545
	struct blkcg_gq		*root_blkg;
546
	struct list_head	blkg_list;
547
#endif
548

549 550
	struct queue_limits	limits;

551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566
	/*
	 * Zoned block device information for request dispatch control.
	 * nr_zones is the total number of zones of the device. This is always
	 * 0 for regular block devices. seq_zones_bitmap is a bitmap of nr_zones
	 * bits which indicates if a zone is conventional (bit clear) or
	 * sequential (bit set). seq_zones_wlock is a bitmap of nr_zones
	 * bits which indicates if a zone is write locked, that is, if a write
	 * request targeting the zone was dispatched. All three fields are
	 * initialized by the low level device driver (e.g. scsi/sd.c).
	 * Stacking drivers (device mappers) may or may not initialize
	 * these fields.
	 */
	unsigned int		nr_zones;
	unsigned long		*seq_zones_bitmap;
	unsigned long		*seq_zones_wlock;

L
Linus Torvalds 已提交
567 568 569 570 571
	/*
	 * sg stuff
	 */
	unsigned int		sg_timeout;
	unsigned int		sg_reserved_size;
572
	int			node;
573
#ifdef CONFIG_BLK_DEV_IO_TRACE
574
	struct blk_trace	*blk_trace;
575
	struct mutex		blk_trace_mutex;
576
#endif
L
Linus Torvalds 已提交
577
	/*
578
	 * for flush operations
L
Linus Torvalds 已提交
579
	 */
580
	struct blk_flush_queue	*fq;
581

582 583
	struct list_head	requeue_list;
	spinlock_t		requeue_lock;
584
	struct delayed_work	requeue_work;
585

586
	struct mutex		sysfs_lock;
587

588
	int			bypass_depth;
589
	atomic_t		mq_freeze_depth;
590

591
#if defined(CONFIG_BLK_DEV_BSG)
M
Mike Christie 已提交
592
	bsg_job_fn		*bsg_job_fn;
593 594
	struct bsg_class_device bsg_dev;
#endif
595 596 597 598 599

#ifdef CONFIG_BLK_DEV_THROTTLING
	/* Throttle data */
	struct throtl_data *td;
#endif
T
Tejun Heo 已提交
600
	struct rcu_head		rcu_head;
601
	wait_queue_head_t	mq_freeze_wq;
602
	struct percpu_ref	q_usage_counter;
603
	struct list_head	all_q_node;
604 605 606

	struct blk_mq_tag_set	*tag_set;
	struct list_head	tag_set_list;
607
	struct bio_set		*bio_split;
608

609
#ifdef CONFIG_BLK_DEBUG_FS
610
	struct dentry		*debugfs_dir;
611
	struct dentry		*sched_debugfs_dir;
612 613
#endif

614
	bool			mq_sysfs_init_done;
615 616 617

	size_t			cmd_size;
	void			*rq_alloc_data;
618 619

	struct work_struct	release_work;
620 621 622

#define BLK_MAX_WRITE_HINTS	5
	u64			write_hints[BLK_MAX_WRITE_HINTS];
L
Linus Torvalds 已提交
623 624
};

625 626 627 628 629 630 631 632 633
#define QUEUE_FLAG_QUEUED	0	/* uses generic tag queueing */
#define QUEUE_FLAG_STOPPED	1	/* queue is stopped */
#define QUEUE_FLAG_DYING	2	/* queue being torn down */
#define QUEUE_FLAG_BYPASS	3	/* act as dumb FIFO queue */
#define QUEUE_FLAG_BIDI		4	/* queue supports bidi requests */
#define QUEUE_FLAG_NOMERGES     5	/* disable merge attempts */
#define QUEUE_FLAG_SAME_COMP	6	/* complete on same CPU-group */
#define QUEUE_FLAG_FAIL_IO	7	/* fake timeout */
#define QUEUE_FLAG_NONROT	9	/* non-rotational device (SSD) */
634
#define QUEUE_FLAG_VIRT        QUEUE_FLAG_NONROT /* paravirt device */
635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653
#define QUEUE_FLAG_IO_STAT     10	/* do IO stats */
#define QUEUE_FLAG_DISCARD     11	/* supports DISCARD */
#define QUEUE_FLAG_NOXMERGES   12	/* No extended merges */
#define QUEUE_FLAG_ADD_RANDOM  13	/* Contributes to random pool */
#define QUEUE_FLAG_SECERASE    14	/* supports secure erase */
#define QUEUE_FLAG_SAME_FORCE  15	/* force complete on same CPU */
#define QUEUE_FLAG_DEAD        16	/* queue tear-down finished */
#define QUEUE_FLAG_INIT_DONE   17	/* queue is initialized */
#define QUEUE_FLAG_NO_SG_MERGE 18	/* don't attempt to merge SG segments*/
#define QUEUE_FLAG_POLL	       19	/* IO polling enabled if set */
#define QUEUE_FLAG_WC	       20	/* Write back caching */
#define QUEUE_FLAG_FUA	       21	/* device supports FUA writes */
#define QUEUE_FLAG_FLUSH_NQ    22	/* flush not queueuable */
#define QUEUE_FLAG_DAX         23	/* device supports DAX */
#define QUEUE_FLAG_STATS       24	/* track rq completion times */
#define QUEUE_FLAG_POLL_STATS  25	/* collecting stats for hybrid polling */
#define QUEUE_FLAG_REGISTERED  26	/* queue has been registered to a disk */
#define QUEUE_FLAG_SCSI_PASSTHROUGH 27	/* queue supports SCSI commands */
#define QUEUE_FLAG_QUIESCED    28	/* queue has been quiesced */
654
#define QUEUE_FLAG_PREEMPT_ONLY	29	/* only process REQ_PREEMPT requests */
655 656

#define QUEUE_FLAG_DEFAULT	((1 << QUEUE_FLAG_IO_STAT) |		\
657 658
				 (1 << QUEUE_FLAG_SAME_COMP)	|	\
				 (1 << QUEUE_FLAG_ADD_RANDOM))
659

660
#define QUEUE_FLAG_MQ_DEFAULT	((1 << QUEUE_FLAG_IO_STAT) |		\
661 662
				 (1 << QUEUE_FLAG_SAME_COMP)	|	\
				 (1 << QUEUE_FLAG_POLL))
663

664 665 666 667 668 669 670
/*
 * @q->queue_lock is set while a queue is being initialized. Since we know
 * that no other threads access the queue object before @q->queue_lock has
 * been set, it is safe to manipulate queue flags without holding the
 * queue_lock if @q->queue_lock == NULL. See also blk_alloc_queue_node() and
 * blk_init_allocated_queue().
 */
671
static inline void queue_lockdep_assert_held(struct request_queue *q)
672
{
673 674
	if (q->queue_lock)
		lockdep_assert_held(q->queue_lock);
675 676
}

N
Nick Piggin 已提交
677 678 679 680 681 682
static inline void queue_flag_set_unlocked(unsigned int flag,
					   struct request_queue *q)
{
	__set_bit(flag, &q->queue_flags);
}

J
Jens Axboe 已提交
683 684 685
static inline int queue_flag_test_and_clear(unsigned int flag,
					    struct request_queue *q)
{
686
	queue_lockdep_assert_held(q);
J
Jens Axboe 已提交
687 688 689 690 691 692 693 694 695 696 697 698

	if (test_bit(flag, &q->queue_flags)) {
		__clear_bit(flag, &q->queue_flags);
		return 1;
	}

	return 0;
}

static inline int queue_flag_test_and_set(unsigned int flag,
					  struct request_queue *q)
{
699
	queue_lockdep_assert_held(q);
J
Jens Axboe 已提交
700 701 702 703 704 705 706 707 708

	if (!test_bit(flag, &q->queue_flags)) {
		__set_bit(flag, &q->queue_flags);
		return 0;
	}

	return 1;
}

N
Nick Piggin 已提交
709 710
static inline void queue_flag_set(unsigned int flag, struct request_queue *q)
{
711
	queue_lockdep_assert_held(q);
N
Nick Piggin 已提交
712 713 714 715 716 717 718 719 720
	__set_bit(flag, &q->queue_flags);
}

static inline void queue_flag_clear_unlocked(unsigned int flag,
					     struct request_queue *q)
{
	__clear_bit(flag, &q->queue_flags);
}

721 722 723 724 725
static inline int queue_in_flight(struct request_queue *q)
{
	return q->in_flight[0] + q->in_flight[1];
}

N
Nick Piggin 已提交
726 727
static inline void queue_flag_clear(unsigned int flag, struct request_queue *q)
{
728
	queue_lockdep_assert_held(q);
N
Nick Piggin 已提交
729 730 731
	__clear_bit(flag, &q->queue_flags);
}

L
Linus Torvalds 已提交
732 733
#define blk_queue_tagged(q)	test_bit(QUEUE_FLAG_QUEUED, &(q)->queue_flags)
#define blk_queue_stopped(q)	test_bit(QUEUE_FLAG_STOPPED, &(q)->queue_flags)
B
Bart Van Assche 已提交
734
#define blk_queue_dying(q)	test_bit(QUEUE_FLAG_DYING, &(q)->queue_flags)
735
#define blk_queue_dead(q)	test_bit(QUEUE_FLAG_DEAD, &(q)->queue_flags)
736
#define blk_queue_bypass(q)	test_bit(QUEUE_FLAG_BYPASS, &(q)->queue_flags)
737
#define blk_queue_init_done(q)	test_bit(QUEUE_FLAG_INIT_DONE, &(q)->queue_flags)
738
#define blk_queue_nomerges(q)	test_bit(QUEUE_FLAG_NOMERGES, &(q)->queue_flags)
739 740
#define blk_queue_noxmerges(q)	\
	test_bit(QUEUE_FLAG_NOXMERGES, &(q)->queue_flags)
741
#define blk_queue_nonrot(q)	test_bit(QUEUE_FLAG_NONROT, &(q)->queue_flags)
742
#define blk_queue_io_stat(q)	test_bit(QUEUE_FLAG_IO_STAT, &(q)->queue_flags)
743
#define blk_queue_add_random(q)	test_bit(QUEUE_FLAG_ADD_RANDOM, &(q)->queue_flags)
744
#define blk_queue_discard(q)	test_bit(QUEUE_FLAG_DISCARD, &(q)->queue_flags)
745 746
#define blk_queue_secure_erase(q) \
	(test_bit(QUEUE_FLAG_SECERASE, &(q)->queue_flags))
747
#define blk_queue_dax(q)	test_bit(QUEUE_FLAG_DAX, &(q)->queue_flags)
748 749
#define blk_queue_scsi_passthrough(q)	\
	test_bit(QUEUE_FLAG_SCSI_PASSTHROUGH, &(q)->queue_flags)
L
Linus Torvalds 已提交
750

751 752 753
#define blk_noretry_request(rq) \
	((rq)->cmd_flags & (REQ_FAILFAST_DEV|REQ_FAILFAST_TRANSPORT| \
			     REQ_FAILFAST_DRIVER))
754
#define blk_queue_quiesced(q)	test_bit(QUEUE_FLAG_QUIESCED, &(q)->queue_flags)
755 756 757 758 759
#define blk_queue_preempt_only(q)				\
	test_bit(QUEUE_FLAG_PREEMPT_ONLY, &(q)->queue_flags)

extern int blk_set_preempt_only(struct request_queue *q);
extern void blk_clear_preempt_only(struct request_queue *q);
760

761 762 763 764
static inline bool blk_account_rq(struct request *rq)
{
	return (rq->rq_flags & RQF_STARTED) && !blk_rq_is_passthrough(rq);
}
765

766
#define blk_rq_cpu_valid(rq)	((rq)->cpu != -1)
767
#define blk_bidi_rq(rq)		((rq)->next_rq != NULL)
768 769
/* rq->queuelist of dequeued request must be list_empty() */
#define blk_queued_rq(rq)	(!list_empty(&(rq)->queuelist))
L
Linus Torvalds 已提交
770 771 772

#define list_entry_rq(ptr)	list_entry((ptr), struct request, queuelist)

773
#define rq_data_dir(rq)		(op_is_write(req_op(rq)) ? WRITE : READ)
L
Linus Torvalds 已提交
774

775 776 777 778 779 780 781 782 783
/*
 * Driver can handle struct request, if it either has an old style
 * request_fn defined, or is blk-mq based.
 */
static inline bool queue_is_rq_based(struct request_queue *q)
{
	return q->request_fn || q->mq_ops;
}

784 785 786 787 788
static inline unsigned int blk_queue_cluster(struct request_queue *q)
{
	return q->limits.cluster;
}

D
Damien Le Moal 已提交
789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805
static inline enum blk_zoned_model
blk_queue_zoned_model(struct request_queue *q)
{
	return q->limits.zoned;
}

static inline bool blk_queue_is_zoned(struct request_queue *q)
{
	switch (blk_queue_zoned_model(q)) {
	case BLK_ZONED_HA:
	case BLK_ZONED_HM:
		return true;
	default:
		return false;
	}
}

806
static inline unsigned int blk_queue_zone_sectors(struct request_queue *q)
807 808 809 810
{
	return blk_queue_is_zoned(q) ? q->limits.chunk_sectors : 0;
}

811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831
static inline unsigned int blk_queue_nr_zones(struct request_queue *q)
{
	return q->nr_zones;
}

static inline unsigned int blk_queue_zone_no(struct request_queue *q,
					     sector_t sector)
{
	if (!blk_queue_is_zoned(q))
		return 0;
	return sector >> ilog2(q->limits.chunk_sectors);
}

static inline bool blk_queue_zone_is_seq(struct request_queue *q,
					 sector_t sector)
{
	if (!blk_queue_is_zoned(q) || !q->seq_zones_bitmap)
		return false;
	return test_bit(blk_queue_zone_no(q, sector), q->seq_zones_bitmap);
}

832 833
static inline bool rq_is_sync(struct request *rq)
{
834
	return op_is_sync(rq->cmd_flags);
835 836
}

837
static inline bool blk_rl_full(struct request_list *rl, bool sync)
L
Linus Torvalds 已提交
838
{
839 840 841
	unsigned int flag = sync ? BLK_RL_SYNCFULL : BLK_RL_ASYNCFULL;

	return rl->flags & flag;
L
Linus Torvalds 已提交
842 843
}

844
static inline void blk_set_rl_full(struct request_list *rl, bool sync)
L
Linus Torvalds 已提交
845
{
846 847 848
	unsigned int flag = sync ? BLK_RL_SYNCFULL : BLK_RL_ASYNCFULL;

	rl->flags |= flag;
L
Linus Torvalds 已提交
849 850
}

851
static inline void blk_clear_rl_full(struct request_list *rl, bool sync)
L
Linus Torvalds 已提交
852
{
853 854 855
	unsigned int flag = sync ? BLK_RL_SYNCFULL : BLK_RL_ASYNCFULL;

	rl->flags &= ~flag;
L
Linus Torvalds 已提交
856 857
}

858 859
static inline bool rq_mergeable(struct request *rq)
{
860
	if (blk_rq_is_passthrough(rq))
861
		return false;
L
Linus Torvalds 已提交
862

863 864 865
	if (req_op(rq) == REQ_OP_FLUSH)
		return false;

866 867 868
	if (req_op(rq) == REQ_OP_WRITE_ZEROES)
		return false;

869
	if (rq->cmd_flags & REQ_NOMERGE_FLAGS)
870 871
		return false;
	if (rq->rq_flags & RQF_NOMERGE_FLAGS)
872 873 874 875
		return false;

	return true;
}
L
Linus Torvalds 已提交
876

877 878
static inline bool blk_write_same_mergeable(struct bio *a, struct bio *b)
{
879 880
	if (bio_page(a) == bio_page(b) &&
	    bio_offset(a) == bio_offset(b))
881 882 883 884 885
		return true;

	return false;
}

886 887 888 889 890 891 892 893
static inline unsigned int blk_queue_depth(struct request_queue *q)
{
	if (q->queue_depth)
		return q->queue_depth;

	return q->nr_requests;
}

L
Linus Torvalds 已提交
894 895 896
/*
 * q->prep_rq_fn return values
 */
897 898 899 900 901 902
enum {
	BLKPREP_OK,		/* serve it */
	BLKPREP_KILL,		/* fatal error, kill, return -EIO */
	BLKPREP_DEFER,		/* leave on queue */
	BLKPREP_INVALID,	/* invalid command, kill, return -EREMOTEIO */
};
L
Linus Torvalds 已提交
903 904 905 906 907 908 909 910 911 912

extern unsigned long blk_max_low_pfn, blk_max_pfn;

/*
 * standard bounce addresses:
 *
 * BLK_BOUNCE_HIGH	: bounce all highmem pages
 * BLK_BOUNCE_ANY	: don't bounce anything
 * BLK_BOUNCE_ISA	: bounce pages above ISA DMA boundary
 */
913 914

#if BITS_PER_LONG == 32
L
Linus Torvalds 已提交
915
#define BLK_BOUNCE_HIGH		((u64)blk_max_low_pfn << PAGE_SHIFT)
916 917 918 919
#else
#define BLK_BOUNCE_HIGH		-1ULL
#endif
#define BLK_BOUNCE_ANY		(-1ULL)
920
#define BLK_BOUNCE_ISA		(DMA_BIT_MASK(24))
L
Linus Torvalds 已提交
921

922 923 924 925
/*
 * default timeout for SG_IO if none specified
 */
#define BLK_DEFAULT_SG_TIMEOUT	(60 * HZ)
L
Linus Torvalds 已提交
926
#define BLK_MIN_SG_TIMEOUT	(7 * HZ)
927

928 929 930 931
struct rq_map_data {
	struct page **pages;
	int page_order;
	int nr_entries;
932
	unsigned long offset;
933
	int null_mapped;
934
	int from_user;
935 936
};

937
struct req_iterator {
938
	struct bvec_iter iter;
939 940 941 942
	struct bio *bio;
};

/* This should not be used directly - use rq_for_each_segment */
943 944
#define for_each_bio(_bio)		\
	for (; _bio; _bio = _bio->bi_next)
945
#define __rq_for_each_bio(_bio, rq)	\
L
Linus Torvalds 已提交
946 947 948
	if ((rq->bio))			\
		for (_bio = (rq)->bio; _bio; _bio = _bio->bi_next)

949 950
#define rq_for_each_segment(bvl, _rq, _iter)			\
	__rq_for_each_bio(_iter.bio, _rq)			\
951
		bio_for_each_segment(bvl, _iter.bio, _iter.iter)
952

K
Kent Overstreet 已提交
953
#define rq_iter_last(bvec, _iter)				\
954
		(_iter.bio->bi_next == NULL &&			\
K
Kent Overstreet 已提交
955
		 bio_iter_last(bvec, _iter.iter))
956

957 958 959 960 961 962 963 964 965 966 967
#ifndef ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
# error	"You should define ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE for your platform"
#endif
#if ARCH_IMPLEMENTS_FLUSH_DCACHE_PAGE
extern void rq_flush_dcache_pages(struct request *rq);
#else
static inline void rq_flush_dcache_pages(struct request *rq)
{
}
#endif

L
Linus Torvalds 已提交
968 969
extern int blk_register_queue(struct gendisk *disk);
extern void blk_unregister_queue(struct gendisk *disk);
970
extern blk_qc_t generic_make_request(struct bio *bio);
971
extern blk_qc_t direct_make_request(struct bio *bio);
972
extern void blk_rq_init(struct request_queue *q, struct request *rq);
973
extern void blk_init_request_from_bio(struct request *req, struct bio *bio);
L
Linus Torvalds 已提交
974
extern void blk_put_request(struct request *);
975
extern void __blk_put_request(struct request_queue *, struct request *);
976 977
extern struct request *blk_get_request_flags(struct request_queue *,
					     unsigned int op,
978
					     blk_mq_req_flags_t flags);
979 980
extern struct request *blk_get_request(struct request_queue *, unsigned int op,
				       gfp_t gfp_mask);
981
extern void blk_requeue_request(struct request_queue *, struct request *);
982
extern int blk_lld_busy(struct request_queue *q);
983 984 985 986 987
extern int blk_rq_prep_clone(struct request *rq, struct request *rq_src,
			     struct bio_set *bs, gfp_t gfp_mask,
			     int (*bio_ctr)(struct bio *, struct bio *, void *),
			     void *data);
extern void blk_rq_unprep_clone(struct request *rq);
988
extern blk_status_t blk_insert_cloned_request(struct request_queue *q,
989
				     struct request *rq);
990
extern int blk_rq_append_bio(struct request *rq, struct bio *bio);
991
extern void blk_delay_queue(struct request_queue *, unsigned long);
992
extern void blk_queue_split(struct request_queue *, struct bio **);
993
extern void blk_recount_segments(struct request_queue *, struct bio *);
994
extern int scsi_verify_blk_ioctl(struct block_device *, unsigned int);
995 996
extern int scsi_cmd_blk_ioctl(struct block_device *, fmode_t,
			      unsigned int, void __user *);
997 998
extern int scsi_cmd_ioctl(struct request_queue *, struct gendisk *, fmode_t,
			  unsigned int, void __user *);
999 1000
extern int sg_scsi_ioctl(struct request_queue *, struct gendisk *, fmode_t,
			 struct scsi_ioctl_command __user *);
1001

1002
extern int blk_queue_enter(struct request_queue *q, blk_mq_req_flags_t flags);
1003
extern void blk_queue_exit(struct request_queue *q);
1004
extern void blk_start_queue(struct request_queue *q);
J
Jens Axboe 已提交
1005
extern void blk_start_queue_async(struct request_queue *q);
1006
extern void blk_stop_queue(struct request_queue *q);
L
Linus Torvalds 已提交
1007
extern void blk_sync_queue(struct request_queue *q);
1008
extern void __blk_stop_queue(struct request_queue *q);
1009
extern void __blk_run_queue(struct request_queue *q);
1010
extern void __blk_run_queue_uncond(struct request_queue *q);
1011
extern void blk_run_queue(struct request_queue *);
1012
extern void blk_run_queue_async(struct request_queue *q);
1013
extern int blk_rq_map_user(struct request_queue *, struct request *,
1014 1015
			   struct rq_map_data *, void __user *, unsigned long,
			   gfp_t);
J
Jens Axboe 已提交
1016
extern int blk_rq_unmap_user(struct bio *);
1017 1018
extern int blk_rq_map_kern(struct request_queue *, struct request *, void *, unsigned int, gfp_t);
extern int blk_rq_map_user_iov(struct request_queue *, struct request *,
1019 1020
			       struct rq_map_data *, const struct iov_iter *,
			       gfp_t);
1021
extern void blk_execute_rq(struct request_queue *, struct gendisk *,
1022
			  struct request *, int);
1023
extern void blk_execute_rq_nowait(struct request_queue *, struct gendisk *,
1024
				  struct request *, int, rq_end_io_fn *);
1025

1026 1027 1028
int blk_status_to_errno(blk_status_t status);
blk_status_t errno_to_blk_status(int errno);

1029
bool blk_poll(struct request_queue *q, blk_qc_t cookie);
J
Jens Axboe 已提交
1030

1031
static inline struct request_queue *bdev_get_queue(struct block_device *bdev)
L
Linus Torvalds 已提交
1032
{
1033
	return bdev->bd_disk->queue;	/* this is never NULL */
L
Linus Torvalds 已提交
1034 1035
}

1036
/*
1037 1038 1039 1040 1041 1042
 * blk_rq_pos()			: the current sector
 * blk_rq_bytes()		: bytes left in the entire request
 * blk_rq_cur_bytes()		: bytes left in the current segment
 * blk_rq_err_bytes()		: bytes left till the next error boundary
 * blk_rq_sectors()		: sectors left in the entire request
 * blk_rq_cur_sectors()		: sectors left in the current segment
1043
 */
1044 1045
static inline sector_t blk_rq_pos(const struct request *rq)
{
1046
	return rq->__sector;
1047 1048 1049 1050
}

static inline unsigned int blk_rq_bytes(const struct request *rq)
{
1051
	return rq->__data_len;
1052 1053
}

1054 1055 1056 1057
static inline int blk_rq_cur_bytes(const struct request *rq)
{
	return rq->bio ? bio_cur_bytes(rq->bio) : 0;
}
1058

1059 1060
extern unsigned int blk_rq_err_bytes(const struct request *rq);

1061 1062
static inline unsigned int blk_rq_sectors(const struct request *rq)
{
1063
	return blk_rq_bytes(rq) >> 9;
1064 1065 1066 1067
}

static inline unsigned int blk_rq_cur_sectors(const struct request *rq)
{
1068
	return blk_rq_cur_bytes(rq) >> 9;
1069 1070
}

1071 1072 1073 1074 1075 1076 1077 1078 1079 1080
static inline unsigned int blk_rq_zone_no(struct request *rq)
{
	return blk_queue_zone_no(rq->q, blk_rq_pos(rq));
}

static inline unsigned int blk_rq_zone_is_seq(struct request *rq)
{
	return blk_queue_zone_is_seq(rq->q, blk_rq_pos(rq));
}

1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093
/*
 * Some commands like WRITE SAME have a payload or data transfer size which
 * is different from the size of the request.  Any driver that supports such
 * commands using the RQF_SPECIAL_PAYLOAD flag needs to use this helper to
 * calculate the data transfer size.
 */
static inline unsigned int blk_rq_payload_bytes(struct request *rq)
{
	if (rq->rq_flags & RQF_SPECIAL_PAYLOAD)
		return rq->special_vec.bv_len;
	return blk_rq_bytes(rq);
}

1094
static inline unsigned int blk_queue_get_max_sectors(struct request_queue *q,
1095
						     int op)
1096
{
A
Adrian Hunter 已提交
1097
	if (unlikely(op == REQ_OP_DISCARD || op == REQ_OP_SECURE_ERASE))
1098
		return min(q->limits.max_discard_sectors, UINT_MAX >> 9);
1099

1100
	if (unlikely(op == REQ_OP_WRITE_SAME))
1101 1102
		return q->limits.max_write_same_sectors;

1103 1104 1105
	if (unlikely(op == REQ_OP_WRITE_ZEROES))
		return q->limits.max_write_zeroes_sectors;

1106 1107 1108
	return q->limits.max_sectors;
}

1109 1110 1111 1112 1113 1114 1115 1116
/*
 * Return maximum size of a request at given offset. Only valid for
 * file system requests.
 */
static inline unsigned int blk_max_size_offset(struct request_queue *q,
					       sector_t offset)
{
	if (!q->limits.chunk_sectors)
1117
		return q->limits.max_sectors;
1118 1119 1120 1121 1122

	return q->limits.chunk_sectors -
			(offset & (q->limits.chunk_sectors - 1));
}

D
Damien Le Moal 已提交
1123 1124
static inline unsigned int blk_rq_get_max_sectors(struct request *rq,
						  sector_t offset)
1125 1126 1127
{
	struct request_queue *q = rq->q;

1128
	if (blk_rq_is_passthrough(rq))
1129 1130
		return q->limits.max_hw_sectors;

A
Adrian Hunter 已提交
1131 1132 1133
	if (!q->limits.chunk_sectors ||
	    req_op(rq) == REQ_OP_DISCARD ||
	    req_op(rq) == REQ_OP_SECURE_ERASE)
1134
		return blk_queue_get_max_sectors(q, req_op(rq));
1135

D
Damien Le Moal 已提交
1136
	return min(blk_max_size_offset(q, offset),
1137
			blk_queue_get_max_sectors(q, req_op(rq)));
1138 1139
}

1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150
static inline unsigned int blk_rq_count_bios(struct request *rq)
{
	unsigned int nr_bios = 0;
	struct bio *bio;

	__rq_for_each_bio(bio, rq)
		nr_bios++;

	return nr_bios;
}

1151 1152 1153 1154 1155 1156 1157
/*
 * Request issue related functions.
 */
extern struct request *blk_peek_request(struct request_queue *q);
extern void blk_start_request(struct request *rq);
extern struct request *blk_fetch_request(struct request_queue *q);

1158 1159
void blk_steal_bios(struct bio_list *list, struct request *rq);

L
Linus Torvalds 已提交
1160
/*
1161 1162 1163 1164 1165
 * Request completion related functions.
 *
 * blk_update_request() completes given number of bytes and updates
 * the request without completing it.
 *
1166 1167
 * blk_end_request() and friends.  __blk_end_request() must be called
 * with the request queue spinlock acquired.
L
Linus Torvalds 已提交
1168 1169
 *
 * Several drivers define their own end_request and call
1170 1171
 * blk_end_request() for parts of the original function.
 * This prevents code duplication in drivers.
L
Linus Torvalds 已提交
1172
 */
1173
extern bool blk_update_request(struct request *rq, blk_status_t error,
1174
			       unsigned int nr_bytes);
1175 1176
extern void blk_finish_request(struct request *rq, blk_status_t error);
extern bool blk_end_request(struct request *rq, blk_status_t error,
1177
			    unsigned int nr_bytes);
1178 1179
extern void blk_end_request_all(struct request *rq, blk_status_t error);
extern bool __blk_end_request(struct request *rq, blk_status_t error,
1180
			      unsigned int nr_bytes);
1181 1182
extern void __blk_end_request_all(struct request *rq, blk_status_t error);
extern bool __blk_end_request_cur(struct request *rq, blk_status_t error);
1183

1184
extern void blk_complete_request(struct request *);
J
Jens Axboe 已提交
1185 1186
extern void __blk_complete_request(struct request *);
extern void blk_abort_request(struct request *);
1187
extern void blk_unprep_request(struct request *);
1188

L
Linus Torvalds 已提交
1189 1190 1191
/*
 * Access functions for manipulating queue properties
 */
1192
extern struct request_queue *blk_init_queue_node(request_fn_proc *rfn,
1193
					spinlock_t *lock, int node_id);
1194
extern struct request_queue *blk_init_queue(request_fn_proc *, spinlock_t *);
1195
extern int blk_init_allocated_queue(struct request_queue *);
1196 1197 1198
extern void blk_cleanup_queue(struct request_queue *);
extern void blk_queue_make_request(struct request_queue *, make_request_fn *);
extern void blk_queue_bounce_limit(struct request_queue *, u64);
1199
extern void blk_queue_max_hw_sectors(struct request_queue *, unsigned int);
1200
extern void blk_queue_chunk_sectors(struct request_queue *, unsigned int);
1201
extern void blk_queue_max_segments(struct request_queue *, unsigned short);
1202 1203
extern void blk_queue_max_discard_segments(struct request_queue *,
		unsigned short);
1204
extern void blk_queue_max_segment_size(struct request_queue *, unsigned int);
1205 1206
extern void blk_queue_max_discard_sectors(struct request_queue *q,
		unsigned int max_discard_sectors);
1207 1208
extern void blk_queue_max_write_same_sectors(struct request_queue *q,
		unsigned int max_write_same_sectors);
1209 1210
extern void blk_queue_max_write_zeroes_sectors(struct request_queue *q,
		unsigned int max_write_same_sectors);
1211
extern void blk_queue_logical_block_size(struct request_queue *, unsigned short);
1212
extern void blk_queue_physical_block_size(struct request_queue *, unsigned int);
1213 1214
extern void blk_queue_alignment_offset(struct request_queue *q,
				       unsigned int alignment);
1215
extern void blk_limits_io_min(struct queue_limits *limits, unsigned int min);
1216
extern void blk_queue_io_min(struct request_queue *q, unsigned int min);
1217
extern void blk_limits_io_opt(struct queue_limits *limits, unsigned int opt);
1218
extern void blk_queue_io_opt(struct request_queue *q, unsigned int opt);
1219
extern void blk_set_queue_depth(struct request_queue *q, unsigned int depth);
1220
extern void blk_set_default_limits(struct queue_limits *lim);
1221
extern void blk_set_stacking_limits(struct queue_limits *lim);
1222 1223
extern int blk_stack_limits(struct queue_limits *t, struct queue_limits *b,
			    sector_t offset);
1224 1225
extern int bdev_stack_limits(struct queue_limits *t, struct block_device *bdev,
			    sector_t offset);
1226 1227
extern void disk_stack_limits(struct gendisk *disk, struct block_device *bdev,
			      sector_t offset);
1228
extern void blk_queue_stack_limits(struct request_queue *t, struct request_queue *b);
1229
extern void blk_queue_dma_pad(struct request_queue *, unsigned int);
1230
extern void blk_queue_update_dma_pad(struct request_queue *, unsigned int);
1231 1232 1233
extern int blk_queue_dma_drain(struct request_queue *q,
			       dma_drain_needed_fn *dma_drain_needed,
			       void *buf, unsigned int size);
1234
extern void blk_queue_lld_busy(struct request_queue *q, lld_busy_fn *fn);
1235
extern void blk_queue_segment_boundary(struct request_queue *, unsigned long);
1236
extern void blk_queue_virt_boundary(struct request_queue *, unsigned long);
1237
extern void blk_queue_prep_rq(struct request_queue *, prep_rq_fn *pfn);
1238
extern void blk_queue_unprep_rq(struct request_queue *, unprep_rq_fn *ufn);
1239
extern void blk_queue_dma_alignment(struct request_queue *, int);
1240
extern void blk_queue_update_dma_alignment(struct request_queue *, int);
1241
extern void blk_queue_softirq_done(struct request_queue *, softirq_done_fn *);
J
Jens Axboe 已提交
1242 1243
extern void blk_queue_rq_timed_out(struct request_queue *, rq_timed_out_fn *);
extern void blk_queue_rq_timeout(struct request_queue *, unsigned int);
1244
extern void blk_queue_flush_queueable(struct request_queue *q, bool queueable);
1245
extern void blk_queue_write_cache(struct request_queue *q, bool enabled, bool fua);
L
Linus Torvalds 已提交
1246

1247 1248 1249 1250 1251 1252 1253 1254 1255
/*
 * Number of physical segments as sent to the device.
 *
 * Normally this is the number of discontiguous data segments sent by the
 * submitter.  But for data-less command like discard we might have no
 * actual data segments submitted, but the driver might have to add it's
 * own special payload.  In that case we still return 1 here so that this
 * special payload will be mapped.
 */
1256 1257 1258 1259 1260 1261 1262
static inline unsigned short blk_rq_nr_phys_segments(struct request *rq)
{
	if (rq->rq_flags & RQF_SPECIAL_PAYLOAD)
		return 1;
	return rq->nr_phys_segments;
}

1263 1264 1265 1266 1267 1268 1269 1270 1271
/*
 * Number of discard segments (or ranges) the driver needs to fill in.
 * Each discard bio merged into a request is counted as one segment.
 */
static inline unsigned short blk_rq_nr_discard_segments(struct request *rq)
{
	return max_t(unsigned short, rq->nr_phys_segments, 1);
}

1272
extern int blk_rq_map_sg(struct request_queue *, struct request *, struct scatterlist *);
L
Linus Torvalds 已提交
1273 1274 1275
extern void blk_dump_rq_flags(struct request *, char *);
extern long nr_blockdev_pages(void);

T
Tejun Heo 已提交
1276
bool __must_check blk_get_queue(struct request_queue *);
1277 1278 1279
struct request_queue *blk_alloc_queue(gfp_t);
struct request_queue *blk_alloc_queue_node(gfp_t, int);
extern void blk_put_queue(struct request_queue *);
1280
extern void blk_set_queue_dying(struct request_queue *);
L
Linus Torvalds 已提交
1281

L
Lin Ming 已提交
1282 1283 1284
/*
 * block layer runtime pm functions
 */
1285
#ifdef CONFIG_PM
L
Lin Ming 已提交
1286 1287 1288 1289 1290
extern void blk_pm_runtime_init(struct request_queue *q, struct device *dev);
extern int blk_pre_runtime_suspend(struct request_queue *q);
extern void blk_post_runtime_suspend(struct request_queue *q, int err);
extern void blk_pre_runtime_resume(struct request_queue *q);
extern void blk_post_runtime_resume(struct request_queue *q, int err);
1291
extern void blk_set_runtime_active(struct request_queue *q);
L
Lin Ming 已提交
1292 1293 1294 1295 1296 1297 1298 1299 1300 1301
#else
static inline void blk_pm_runtime_init(struct request_queue *q,
	struct device *dev) {}
static inline int blk_pre_runtime_suspend(struct request_queue *q)
{
	return -ENOSYS;
}
static inline void blk_post_runtime_suspend(struct request_queue *q, int err) {}
static inline void blk_pre_runtime_resume(struct request_queue *q) {}
static inline void blk_post_runtime_resume(struct request_queue *q, int err) {}
1302
static inline void blk_set_runtime_active(struct request_queue *q) {}
L
Lin Ming 已提交
1303 1304
#endif

1305
/*
S
Suresh Jayaraman 已提交
1306 1307 1308 1309 1310 1311 1312 1313 1314 1315
 * blk_plug permits building a queue of related requests by holding the I/O
 * fragments for a short period. This allows merging of sequential requests
 * into single larger request. As the requests are moved from a per-task list to
 * the device's request_queue in a batch, this results in improved scalability
 * as the lock contention for request_queue lock is reduced.
 *
 * It is ok not to disable preemption when adding the request to the plug list
 * or when attempting a merge, because blk_schedule_flush_list() will only flush
 * the plug list when the task sleeps by itself. For details, please see
 * schedule() where blk_schedule_flush_plug() is called.
1316
 */
1317
struct blk_plug {
S
Suresh Jayaraman 已提交
1318
	struct list_head list; /* requests */
1319
	struct list_head mq_list; /* blk-mq requests */
S
Suresh Jayaraman 已提交
1320
	struct list_head cb_list; /* md requires an unplug callback */
1321
};
1322
#define BLK_MAX_REQUEST_COUNT 16
1323
#define BLK_PLUG_FLUSH_SIZE (128 * 1024)
1324

1325
struct blk_plug_cb;
1326
typedef void (*blk_plug_cb_fn)(struct blk_plug_cb *, bool);
1327 1328
struct blk_plug_cb {
	struct list_head list;
1329 1330
	blk_plug_cb_fn callback;
	void *data;
1331
};
1332 1333
extern struct blk_plug_cb *blk_check_plugged(blk_plug_cb_fn unplug,
					     void *data, int size);
1334 1335
extern void blk_start_plug(struct blk_plug *);
extern void blk_finish_plug(struct blk_plug *);
1336
extern void blk_flush_plug_list(struct blk_plug *, bool);
1337 1338 1339 1340 1341

static inline void blk_flush_plug(struct task_struct *tsk)
{
	struct blk_plug *plug = tsk->plug;

1342 1343 1344 1345 1346 1347 1348 1349
	if (plug)
		blk_flush_plug_list(plug, false);
}

static inline void blk_schedule_flush_plug(struct task_struct *tsk)
{
	struct blk_plug *plug = tsk->plug;

1350
	if (plug)
1351
		blk_flush_plug_list(plug, true);
1352 1353 1354 1355 1356 1357
}

static inline bool blk_needs_flush_plug(struct task_struct *tsk)
{
	struct blk_plug *plug = tsk->plug;

1358 1359 1360 1361
	return plug &&
		(!list_empty(&plug->list) ||
		 !list_empty(&plug->mq_list) ||
		 !list_empty(&plug->cb_list));
1362 1363
}

L
Linus Torvalds 已提交
1364 1365 1366
/*
 * tag stuff
 */
1367 1368 1369
extern int blk_queue_start_tag(struct request_queue *, struct request *);
extern struct request *blk_queue_find_tag(struct request_queue *, int);
extern void blk_queue_end_tag(struct request_queue *, struct request *);
1370
extern int blk_queue_init_tags(struct request_queue *, int, struct blk_queue_tag *, int);
1371 1372 1373
extern void blk_queue_free_tags(struct request_queue *);
extern int blk_queue_resize_tags(struct request_queue *, int);
extern void blk_queue_invalidate_tags(struct request_queue *);
1374
extern struct blk_queue_tag *blk_init_tags(int, int);
1375
extern void blk_free_tags(struct blk_queue_tag *);
L
Linus Torvalds 已提交
1376

1377 1378 1379 1380 1381 1382 1383
static inline struct request *blk_map_queue_find_tag(struct blk_queue_tag *bqt,
						int tag)
{
	if (unlikely(bqt == NULL || tag >= bqt->real_max_depth))
		return NULL;
	return bqt->tag_index[tag];
}
1384

1385 1386 1387
extern int blkdev_issue_flush(struct block_device *, gfp_t, sector_t *);
extern int blkdev_issue_write_same(struct block_device *bdev, sector_t sector,
		sector_t nr_sects, gfp_t gfp_mask, struct page *page);
1388 1389

#define BLKDEV_DISCARD_SECURE	(1 << 0)	/* issue a secure erase */
1390

1391 1392
extern int blkdev_issue_discard(struct block_device *bdev, sector_t sector,
		sector_t nr_sects, gfp_t gfp_mask, unsigned long flags);
1393
extern int __blkdev_issue_discard(struct block_device *bdev, sector_t sector,
1394
		sector_t nr_sects, gfp_t gfp_mask, int flags,
1395
		struct bio **biop);
1396 1397

#define BLKDEV_ZERO_NOUNMAP	(1 << 0)  /* do not free blocks */
1398
#define BLKDEV_ZERO_NOFALLBACK	(1 << 1)  /* don't write explicit zeroes */
1399

1400 1401
extern int __blkdev_issue_zeroout(struct block_device *bdev, sector_t sector,
		sector_t nr_sects, gfp_t gfp_mask, struct bio **biop,
1402
		unsigned flags);
1403
extern int blkdev_issue_zeroout(struct block_device *bdev, sector_t sector,
1404 1405
		sector_t nr_sects, gfp_t gfp_mask, unsigned flags);

1406 1407
static inline int sb_issue_discard(struct super_block *sb, sector_t block,
		sector_t nr_blocks, gfp_t gfp_mask, unsigned long flags)
D
David Woodhouse 已提交
1408
{
1409 1410 1411
	return blkdev_issue_discard(sb->s_bdev, block << (sb->s_blocksize_bits - 9),
				    nr_blocks << (sb->s_blocksize_bits - 9),
				    gfp_mask, flags);
D
David Woodhouse 已提交
1412
}
1413
static inline int sb_issue_zeroout(struct super_block *sb, sector_t block,
1414
		sector_t nr_blocks, gfp_t gfp_mask)
1415 1416 1417 1418
{
	return blkdev_issue_zeroout(sb->s_bdev,
				    block << (sb->s_blocksize_bits - 9),
				    nr_blocks << (sb->s_blocksize_bits - 9),
1419
				    gfp_mask, 0);
1420
}
L
Linus Torvalds 已提交
1421

1422
extern int blk_verify_command(unsigned char *cmd, fmode_t mode);
1423

1424 1425 1426
enum blk_default_limits {
	BLK_MAX_SEGMENTS	= 128,
	BLK_SAFE_MAX_SECTORS	= 255,
1427
	BLK_DEF_MAX_SECTORS	= 2560,
1428 1429 1430
	BLK_MAX_SEGMENT_SIZE	= 65536,
	BLK_SEG_BOUNDARY_MASK	= 0xFFFFFFFFUL,
};
1431

L
Linus Torvalds 已提交
1432 1433
#define blkdev_entry_to_request(entry) list_entry((entry), struct request, queuelist)

1434 1435
static inline unsigned long queue_segment_boundary(struct request_queue *q)
{
1436
	return q->limits.seg_boundary_mask;
1437 1438
}

1439 1440 1441 1442 1443
static inline unsigned long queue_virt_boundary(struct request_queue *q)
{
	return q->limits.virt_boundary_mask;
}

1444 1445
static inline unsigned int queue_max_sectors(struct request_queue *q)
{
1446
	return q->limits.max_sectors;
1447 1448 1449 1450
}

static inline unsigned int queue_max_hw_sectors(struct request_queue *q)
{
1451
	return q->limits.max_hw_sectors;
1452 1453
}

1454
static inline unsigned short queue_max_segments(struct request_queue *q)
1455
{
1456
	return q->limits.max_segments;
1457 1458
}

1459 1460 1461 1462 1463
static inline unsigned short queue_max_discard_segments(struct request_queue *q)
{
	return q->limits.max_discard_segments;
}

1464 1465
static inline unsigned int queue_max_segment_size(struct request_queue *q)
{
1466
	return q->limits.max_segment_size;
1467 1468
}

1469
static inline unsigned short queue_logical_block_size(struct request_queue *q)
L
Linus Torvalds 已提交
1470 1471 1472
{
	int retval = 512;

1473 1474
	if (q && q->limits.logical_block_size)
		retval = q->limits.logical_block_size;
L
Linus Torvalds 已提交
1475 1476 1477 1478

	return retval;
}

1479
static inline unsigned short bdev_logical_block_size(struct block_device *bdev)
L
Linus Torvalds 已提交
1480
{
1481
	return queue_logical_block_size(bdev_get_queue(bdev));
L
Linus Torvalds 已提交
1482 1483
}

1484 1485 1486 1487 1488
static inline unsigned int queue_physical_block_size(struct request_queue *q)
{
	return q->limits.physical_block_size;
}

1489
static inline unsigned int bdev_physical_block_size(struct block_device *bdev)
M
Martin K. Petersen 已提交
1490 1491 1492 1493
{
	return queue_physical_block_size(bdev_get_queue(bdev));
}

1494 1495 1496 1497 1498
static inline unsigned int queue_io_min(struct request_queue *q)
{
	return q->limits.io_min;
}

M
Martin K. Petersen 已提交
1499 1500 1501 1502 1503
static inline int bdev_io_min(struct block_device *bdev)
{
	return queue_io_min(bdev_get_queue(bdev));
}

1504 1505 1506 1507 1508
static inline unsigned int queue_io_opt(struct request_queue *q)
{
	return q->limits.io_opt;
}

M
Martin K. Petersen 已提交
1509 1510 1511 1512 1513
static inline int bdev_io_opt(struct block_device *bdev)
{
	return queue_io_opt(bdev_get_queue(bdev));
}

1514 1515
static inline int queue_alignment_offset(struct request_queue *q)
{
M
Martin K. Petersen 已提交
1516
	if (q->limits.misaligned)
1517 1518
		return -1;

M
Martin K. Petersen 已提交
1519
	return q->limits.alignment_offset;
1520 1521
}

1522
static inline int queue_limit_alignment_offset(struct queue_limits *lim, sector_t sector)
1523 1524
{
	unsigned int granularity = max(lim->physical_block_size, lim->io_min);
1525
	unsigned int alignment = sector_div(sector, granularity >> 9) << 9;
1526

1527
	return (granularity + lim->alignment_offset - alignment) % granularity;
1528 1529
}

M
Martin K. Petersen 已提交
1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542
static inline int bdev_alignment_offset(struct block_device *bdev)
{
	struct request_queue *q = bdev_get_queue(bdev);

	if (q->limits.misaligned)
		return -1;

	if (bdev != bdev->bd_contains)
		return bdev->bd_part->alignment_offset;

	return q->limits.alignment_offset;
}

1543 1544 1545 1546 1547 1548 1549 1550
static inline int queue_discard_alignment(struct request_queue *q)
{
	if (q->limits.discard_misaligned)
		return -1;

	return q->limits.discard_alignment;
}

1551
static inline int queue_limit_discard_alignment(struct queue_limits *lim, sector_t sector)
1552
{
1553
	unsigned int alignment, granularity, offset;
1554

1555 1556 1557
	if (!lim->max_discard_sectors)
		return 0;

1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571
	/* Why are these in bytes, not sectors? */
	alignment = lim->discard_alignment >> 9;
	granularity = lim->discard_granularity >> 9;
	if (!granularity)
		return 0;

	/* Offset of the partition start in 'granularity' sectors */
	offset = sector_div(sector, granularity);

	/* And why do we do this modulus *again* in blkdev_issue_discard()? */
	offset = (granularity + alignment - offset) % granularity;

	/* Turn it back into bytes, gaah */
	return offset << 9;
1572 1573
}

1574 1575 1576 1577 1578 1579 1580 1581 1582 1583
static inline int bdev_discard_alignment(struct block_device *bdev)
{
	struct request_queue *q = bdev_get_queue(bdev);

	if (bdev != bdev->bd_contains)
		return bdev->bd_part->discard_alignment;

	return q->limits.discard_alignment;
}

1584 1585 1586 1587 1588 1589 1590 1591 1592 1593
static inline unsigned int bdev_write_same(struct block_device *bdev)
{
	struct request_queue *q = bdev_get_queue(bdev);

	if (q)
		return q->limits.max_write_same_sectors;

	return 0;
}

1594 1595 1596 1597 1598 1599 1600 1601 1602 1603
static inline unsigned int bdev_write_zeroes_sectors(struct block_device *bdev)
{
	struct request_queue *q = bdev_get_queue(bdev);

	if (q)
		return q->limits.max_write_zeroes_sectors;

	return 0;
}

D
Damien Le Moal 已提交
1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623
static inline enum blk_zoned_model bdev_zoned_model(struct block_device *bdev)
{
	struct request_queue *q = bdev_get_queue(bdev);

	if (q)
		return blk_queue_zoned_model(q);

	return BLK_ZONED_NONE;
}

static inline bool bdev_is_zoned(struct block_device *bdev)
{
	struct request_queue *q = bdev_get_queue(bdev);

	if (q)
		return blk_queue_is_zoned(q);

	return false;
}

1624
static inline unsigned int bdev_zone_sectors(struct block_device *bdev)
1625 1626 1627 1628
{
	struct request_queue *q = bdev_get_queue(bdev);

	if (q)
1629
		return blk_queue_zone_sectors(q);
1630 1631
	return 0;
}
1632

1633 1634 1635 1636 1637 1638
static inline unsigned int bdev_nr_zones(struct block_device *bdev)
{
	struct request_queue *q = bdev_get_queue(bdev);

	if (q)
		return blk_queue_nr_zones(q);
1639 1640 1641
	return 0;
}

1642
static inline int queue_dma_alignment(struct request_queue *q)
L
Linus Torvalds 已提交
1643
{
1644
	return q ? q->dma_alignment : 511;
L
Linus Torvalds 已提交
1645 1646
}

1647
static inline int blk_rq_aligned(struct request_queue *q, unsigned long addr,
1648 1649 1650
				 unsigned int len)
{
	unsigned int alignment = queue_dma_alignment(q) | q->dma_pad_mask;
1651
	return !(addr & alignment) && !(len & alignment);
1652 1653
}

L
Linus Torvalds 已提交
1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664
/* assumes size > 256 */
static inline unsigned int blksize_bits(unsigned int size)
{
	unsigned int bits = 8;
	do {
		bits++;
		size >>= 1;
	} while (size > 256);
	return bits;
}

1665
static inline unsigned int block_size(struct block_device *bdev)
L
Linus Torvalds 已提交
1666 1667 1668 1669
{
	return bdev->bd_block_size;
}

1670 1671
static inline bool queue_flush_queueable(struct request_queue *q)
{
J
Jens Axboe 已提交
1672
	return !test_bit(QUEUE_FLAG_FLUSH_NQ, &q->queue_flags);
1673 1674
}

L
Linus Torvalds 已提交
1675 1676 1677 1678 1679 1680
typedef struct {struct page *v;} Sector;

unsigned char *read_dev_sector(struct block_device *, sector_t, Sector *);

static inline void put_dev_sector(Sector p)
{
1681
	put_page(p.v);
L
Linus Torvalds 已提交
1682 1683
}

1684 1685 1686 1687 1688 1689 1690
static inline bool __bvec_gap_to_prev(struct request_queue *q,
				struct bio_vec *bprv, unsigned int offset)
{
	return offset ||
		((bprv->bv_offset + bprv->bv_len) & queue_virt_boundary(q));
}

1691 1692 1693 1694 1695 1696 1697 1698 1699
/*
 * Check if adding a bio_vec after bprv with offset would create a gap in
 * the SG list. Most drivers don't care about this, but some do.
 */
static inline bool bvec_gap_to_prev(struct request_queue *q,
				struct bio_vec *bprv, unsigned int offset)
{
	if (!queue_virt_boundary(q))
		return false;
1700
	return __bvec_gap_to_prev(q, bprv, offset);
1701 1702
}

M
Ming Lei 已提交
1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721
/*
 * Check if the two bvecs from two bios can be merged to one segment.
 * If yes, no need to check gap between the two bios since the 1st bio
 * and the 1st bvec in the 2nd bio can be handled in one segment.
 */
static inline bool bios_segs_mergeable(struct request_queue *q,
		struct bio *prev, struct bio_vec *prev_last_bv,
		struct bio_vec *next_first_bv)
{
	if (!BIOVEC_PHYS_MERGEABLE(prev_last_bv, next_first_bv))
		return false;
	if (!BIOVEC_SEG_BOUNDARY(q, prev_last_bv, next_first_bv))
		return false;
	if (prev->bi_seg_back_size + next_first_bv->bv_len >
			queue_max_segment_size(q))
		return false;
	return true;
}

1722 1723 1724 1725
static inline bool bio_will_gap(struct request_queue *q,
				struct request *prev_rq,
				struct bio *prev,
				struct bio *next)
1726
{
1727 1728 1729
	if (bio_has_data(prev) && queue_virt_boundary(q)) {
		struct bio_vec pb, nb;

1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751
		/*
		 * don't merge if the 1st bio starts with non-zero
		 * offset, otherwise it is quite difficult to respect
		 * sg gap limit. We work hard to merge a huge number of small
		 * single bios in case of mkfs.
		 */
		if (prev_rq)
			bio_get_first_bvec(prev_rq->bio, &pb);
		else
			bio_get_first_bvec(prev, &pb);
		if (pb.bv_offset)
			return true;

		/*
		 * We don't need to worry about the situation that the
		 * merged segment ends in unaligned virt boundary:
		 *
		 * - if 'pb' ends aligned, the merged segment ends aligned
		 * - if 'pb' ends unaligned, the next bio must include
		 *   one single bvec of 'nb', otherwise the 'nb' can't
		 *   merge with 'pb'
		 */
1752 1753
		bio_get_last_bvec(prev, &pb);
		bio_get_first_bvec(next, &nb);
1754

M
Ming Lei 已提交
1755 1756
		if (!bios_segs_mergeable(q, prev, &pb, &nb))
			return __bvec_gap_to_prev(q, &pb, nb.bv_offset);
1757 1758 1759
	}

	return false;
1760 1761 1762 1763
}

static inline bool req_gap_back_merge(struct request *req, struct bio *bio)
{
1764
	return bio_will_gap(req->q, req, req->biotail, bio);
1765 1766 1767 1768
}

static inline bool req_gap_front_merge(struct request *req, struct bio *bio)
{
1769
	return bio_will_gap(req->q, NULL, bio, req->bio);
1770 1771
}

1772
int kblockd_schedule_work(struct work_struct *work);
1773
int kblockd_schedule_work_on(int cpu, struct work_struct *work);
1774
int kblockd_schedule_delayed_work(struct delayed_work *dwork, unsigned long delay);
1775
int kblockd_schedule_delayed_work_on(int cpu, struct delayed_work *dwork, unsigned long delay);
1776
int kblockd_mod_delayed_work_on(int cpu, struct delayed_work *dwork, unsigned long delay);
L
Linus Torvalds 已提交
1777

1778
#ifdef CONFIG_BLK_CGROUP
1779 1780 1781 1782 1783
/*
 * This should not be using sched_clock(). A real patch is in progress
 * to fix this up, until that is in place we need to disable preemption
 * around sched_clock() in this function and set_io_start_time_ns().
 */
1784 1785
static inline void set_start_time_ns(struct request *req)
{
1786
	preempt_disable();
1787
	req->start_time_ns = sched_clock();
1788
	preempt_enable();
1789 1790 1791 1792
}

static inline void set_io_start_time_ns(struct request *req)
{
1793
	preempt_disable();
1794
	req->io_start_time_ns = sched_clock();
1795
	preempt_enable();
1796
}
1797 1798 1799 1800 1801 1802 1803 1804 1805 1806

static inline uint64_t rq_start_time_ns(struct request *req)
{
        return req->start_time_ns;
}

static inline uint64_t rq_io_start_time_ns(struct request *req)
{
        return req->io_start_time_ns;
}
1807 1808 1809
#else
static inline void set_start_time_ns(struct request *req) {}
static inline void set_io_start_time_ns(struct request *req) {}
1810 1811 1812 1813 1814 1815 1816 1817
static inline uint64_t rq_start_time_ns(struct request *req)
{
	return 0;
}
static inline uint64_t rq_io_start_time_ns(struct request *req)
{
	return 0;
}
1818 1819
#endif

L
Linus Torvalds 已提交
1820 1821 1822 1823 1824
#define MODULE_ALIAS_BLOCKDEV(major,minor) \
	MODULE_ALIAS("block-major-" __stringify(major) "-" __stringify(minor))
#define MODULE_ALIAS_BLOCKDEV_MAJOR(major) \
	MODULE_ALIAS("block-major-" __stringify(major) "-*")

1825 1826
#if defined(CONFIG_BLK_DEV_INTEGRITY)

1827 1828 1829
enum blk_integrity_flags {
	BLK_INTEGRITY_VERIFY		= 1 << 0,
	BLK_INTEGRITY_GENERATE		= 1 << 1,
1830
	BLK_INTEGRITY_DEVICE_CAPABLE	= 1 << 2,
1831
	BLK_INTEGRITY_IP_CHECKSUM	= 1 << 3,
1832
};
1833

1834
struct blk_integrity_iter {
1835 1836
	void			*prot_buf;
	void			*data_buf;
1837
	sector_t		seed;
1838
	unsigned int		data_size;
1839
	unsigned short		interval;
1840 1841 1842
	const char		*disk_name;
};

1843
typedef blk_status_t (integrity_processing_fn) (struct blk_integrity_iter *);
1844

1845 1846 1847 1848 1849
struct blk_integrity_profile {
	integrity_processing_fn		*generate_fn;
	integrity_processing_fn		*verify_fn;
	const char			*name;
};
1850

1851
extern void blk_integrity_register(struct gendisk *, struct blk_integrity *);
1852
extern void blk_integrity_unregister(struct gendisk *);
1853
extern int blk_integrity_compare(struct gendisk *, struct gendisk *);
1854 1855 1856
extern int blk_rq_map_integrity_sg(struct request_queue *, struct bio *,
				   struct scatterlist *);
extern int blk_rq_count_integrity_sg(struct request_queue *, struct bio *);
1857 1858 1859 1860
extern bool blk_integrity_merge_rq(struct request_queue *, struct request *,
				   struct request *);
extern bool blk_integrity_merge_bio(struct request_queue *, struct request *,
				    struct bio *);
1861

1862
static inline struct blk_integrity *blk_get_integrity(struct gendisk *disk)
1863
{
1864
	struct blk_integrity *bi = &disk->queue->integrity;
1865 1866 1867 1868 1869

	if (!bi->profile)
		return NULL;

	return bi;
1870 1871
}

1872 1873
static inline
struct blk_integrity *bdev_get_integrity(struct block_device *bdev)
1874
{
1875
	return blk_get_integrity(bdev->bd_disk);
1876 1877
}

1878
static inline bool blk_integrity_rq(struct request *rq)
1879
{
1880
	return rq->cmd_flags & REQ_INTEGRITY;
1881 1882
}

1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894
static inline void blk_queue_max_integrity_segments(struct request_queue *q,
						    unsigned int segs)
{
	q->limits.max_integrity_segments = segs;
}

static inline unsigned short
queue_max_integrity_segments(struct request_queue *q)
{
	return q->limits.max_integrity_segments;
}

1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914
static inline bool integrity_req_gap_back_merge(struct request *req,
						struct bio *next)
{
	struct bio_integrity_payload *bip = bio_integrity(req->bio);
	struct bio_integrity_payload *bip_next = bio_integrity(next);

	return bvec_gap_to_prev(req->q, &bip->bip_vec[bip->bip_vcnt - 1],
				bip_next->bip_vec[0].bv_offset);
}

static inline bool integrity_req_gap_front_merge(struct request *req,
						 struct bio *bio)
{
	struct bio_integrity_payload *bip = bio_integrity(bio);
	struct bio_integrity_payload *bip_next = bio_integrity(req->bio);

	return bvec_gap_to_prev(req->q, &bip->bip_vec[bip->bip_vcnt - 1],
				bip_next->bip_vec[0].bv_offset);
}

1915 1916
#else /* CONFIG_BLK_DEV_INTEGRITY */

1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938
struct bio;
struct block_device;
struct gendisk;
struct blk_integrity;

static inline int blk_integrity_rq(struct request *rq)
{
	return 0;
}
static inline int blk_rq_count_integrity_sg(struct request_queue *q,
					    struct bio *b)
{
	return 0;
}
static inline int blk_rq_map_integrity_sg(struct request_queue *q,
					  struct bio *b,
					  struct scatterlist *s)
{
	return 0;
}
static inline struct blk_integrity *bdev_get_integrity(struct block_device *b)
{
1939
	return NULL;
1940 1941 1942 1943 1944 1945 1946 1947 1948
}
static inline struct blk_integrity *blk_get_integrity(struct gendisk *disk)
{
	return NULL;
}
static inline int blk_integrity_compare(struct gendisk *a, struct gendisk *b)
{
	return 0;
}
1949
static inline void blk_integrity_register(struct gendisk *d,
1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963
					 struct blk_integrity *b)
{
}
static inline void blk_integrity_unregister(struct gendisk *d)
{
}
static inline void blk_queue_max_integrity_segments(struct request_queue *q,
						    unsigned int segs)
{
}
static inline unsigned short queue_max_integrity_segments(struct request_queue *q)
{
	return 0;
}
1964 1965 1966
static inline bool blk_integrity_merge_rq(struct request_queue *rq,
					  struct request *r1,
					  struct request *r2)
1967
{
1968
	return true;
1969
}
1970 1971 1972
static inline bool blk_integrity_merge_bio(struct request_queue *rq,
					   struct request *r,
					   struct bio *b)
1973
{
1974
	return true;
1975
}
1976

1977 1978 1979 1980 1981 1982 1983 1984 1985 1986
static inline bool integrity_req_gap_back_merge(struct request *req,
						struct bio *next)
{
	return false;
}
static inline bool integrity_req_gap_front_merge(struct request *req,
						 struct bio *bio)
{
	return false;
}
1987 1988 1989

#endif /* CONFIG_BLK_DEV_INTEGRITY */

1990
struct block_device_operations {
A
Al Viro 已提交
1991
	int (*open) (struct block_device *, fmode_t);
1992
	void (*release) (struct gendisk *, fmode_t);
1993
	int (*rw_page)(struct block_device *, sector_t, struct page *, bool);
A
Al Viro 已提交
1994 1995
	int (*ioctl) (struct block_device *, fmode_t, unsigned, unsigned long);
	int (*compat_ioctl) (struct block_device *, fmode_t, unsigned, unsigned long);
1996 1997 1998
	unsigned int (*check_events) (struct gendisk *disk,
				      unsigned int clearing);
	/* ->media_changed() is DEPRECATED, use ->check_events() instead */
1999
	int (*media_changed) (struct gendisk *);
2000
	void (*unlock_native_capacity) (struct gendisk *);
2001 2002
	int (*revalidate_disk) (struct gendisk *);
	int (*getgeo)(struct block_device *, struct hd_geometry *);
2003 2004
	/* this callback is with swap_lock and sometimes page table lock held */
	void (*swap_slot_free_notify) (struct block_device *, unsigned long);
2005
	struct module *owner;
2006
	const struct pr_ops *pr_ops;
2007 2008
};

2009 2010
extern int __blkdev_driver_ioctl(struct block_device *, fmode_t, unsigned int,
				 unsigned long);
2011 2012 2013
extern int bdev_read_page(struct block_device *, sector_t, struct page *);
extern int bdev_write_page(struct block_device *, sector_t, struct page *,
						struct writeback_control *);
2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067

#ifdef CONFIG_BLK_DEV_ZONED
bool blk_req_needs_zone_write_lock(struct request *rq);
void __blk_req_zone_write_lock(struct request *rq);
void __blk_req_zone_write_unlock(struct request *rq);

static inline void blk_req_zone_write_lock(struct request *rq)
{
	if (blk_req_needs_zone_write_lock(rq))
		__blk_req_zone_write_lock(rq);
}

static inline void blk_req_zone_write_unlock(struct request *rq)
{
	if (rq->rq_flags & RQF_ZONE_WRITE_LOCKED)
		__blk_req_zone_write_unlock(rq);
}

static inline bool blk_req_zone_is_write_locked(struct request *rq)
{
	return rq->q->seq_zones_wlock &&
		test_bit(blk_rq_zone_no(rq), rq->q->seq_zones_wlock);
}

static inline bool blk_req_can_dispatch_to_zone(struct request *rq)
{
	if (!blk_req_needs_zone_write_lock(rq))
		return true;
	return !blk_req_zone_is_write_locked(rq);
}
#else
static inline bool blk_req_needs_zone_write_lock(struct request *rq)
{
	return false;
}

static inline void blk_req_zone_write_lock(struct request *rq)
{
}

static inline void blk_req_zone_write_unlock(struct request *rq)
{
}
static inline bool blk_req_zone_is_write_locked(struct request *rq)
{
	return false;
}

static inline bool blk_req_can_dispatch_to_zone(struct request *rq)
{
	return true;
}
#endif /* CONFIG_BLK_DEV_ZONED */

2068
#else /* CONFIG_BLOCK */
2069 2070 2071

struct block_device;

2072 2073 2074 2075 2076 2077 2078 2079 2080 2081
/*
 * stubs for when the block layer is configured out
 */
#define buffer_heads_over_limit 0

static inline long nr_blockdev_pages(void)
{
	return 0;
}

2082 2083 2084 2085
struct blk_plug {
};

static inline void blk_start_plug(struct blk_plug *plug)
2086 2087 2088
{
}

2089
static inline void blk_finish_plug(struct blk_plug *plug)
2090 2091 2092
{
}

2093
static inline void blk_flush_plug(struct task_struct *task)
2094 2095 2096
{
}

2097 2098 2099 2100 2101
static inline void blk_schedule_flush_plug(struct task_struct *task)
{
}


2102 2103 2104 2105 2106
static inline bool blk_needs_flush_plug(struct task_struct *tsk)
{
	return false;
}

2107 2108 2109 2110 2111 2112
static inline int blkdev_issue_flush(struct block_device *bdev, gfp_t gfp_mask,
				     sector_t *error_sector)
{
	return 0;
}

2113 2114
#endif /* CONFIG_BLOCK */

L
Linus Torvalds 已提交
2115
#endif