net: Protect dev->name by seqlock.
[linux-2.6-block.git] / block / blk.h
CommitLineData
b2441318 1/* SPDX-License-Identifier: GPL-2.0 */
8324aa91
JA
2#ifndef BLK_INTERNAL_H
3#define BLK_INTERNAL_H
4
a892c8d5 5#include <linux/blk-crypto.h>
9bb33f24 6#include <linux/memblock.h> /* for max_pfn/max_low_pfn */
0eb4db47 7#include <linux/sched/sysctl.h>
08420cf7 8#include <linux/timekeeping.h>
c39ae60d 9#include <xen/xen.h>
a892c8d5 10#include "blk-crypto-internal.h"
a73f730d 11
2e9bc346
CH
12struct elevator_type;
13
0d2602ca
JA
14/* Max future timer expiry for timeouts */
15#define BLK_MAX_TIMEOUT (5 * HZ)
16
18fbda91 17extern struct dentry *blk_debugfs_root;
18fbda91 18
7c94e1c1 19struct blk_flush_queue {
b175c867 20 spinlock_t mq_flush_lock;
7c94e1c1
ML
21 unsigned int flush_pending_idx:1;
22 unsigned int flush_running_idx:1;
8d699663 23 blk_status_t rq_status;
7c94e1c1
ML
24 unsigned long flush_pending_since;
25 struct list_head flush_queue[2];
b175c867 26 unsigned long flush_data_in_flight;
7c94e1c1 27 struct request *flush_rq;
7c94e1c1
ML
28};
29
a9ed27a7 30bool is_flush_rq(struct request *req);
8d699663 31
754a1572
GJ
32struct blk_flush_queue *blk_alloc_flush_queue(int node, int cmd_size,
33 gfp_t flags);
f70ced09 34void blk_free_flush_queue(struct blk_flush_queue *q);
f3552655 35
3ef28e83 36void blk_freeze_queue(struct request_queue *q);
aec89dc5 37void __blk_mq_unfreeze_queue(struct request_queue *q, bool force_atomic);
8e141f9e 38void blk_queue_start_drain(struct request_queue *q);
c98cb5bb 39int __bio_queue_enter(struct request_queue *q, struct bio *bio);
3f98c753 40void submit_bio_noacct_nocheck(struct bio *bio);
c98cb5bb
JA
41
42static inline bool blk_try_enter_queue(struct request_queue *q, bool pm)
43{
44 rcu_read_lock();
45 if (!percpu_ref_tryget_live_rcu(&q->q_usage_counter))
46 goto fail;
47
48 /*
49 * The code that increments the pm_only counter must ensure that the
50 * counter is globally visible before the queue is unfrozen.
51 */
52 if (blk_queue_pm_only(q) &&
53 (!pm || queue_rpm_status(q) == RPM_SUSPENDED))
54 goto fail_put;
55
56 rcu_read_unlock();
57 return true;
58
59fail_put:
60 blk_queue_exit(q);
61fail:
62 rcu_read_unlock();
63 return false;
64}
65
66static inline int bio_queue_enter(struct bio *bio)
67{
68 struct request_queue *q = bdev_get_queue(bio->bi_bdev);
69
70 if (blk_try_enter_queue(q, false))
71 return 0;
72 return __bio_queue_enter(q, bio);
73}
3ef28e83 74
0eb4db47
KB
75static inline void blk_wait_io(struct completion *done)
76{
77 /* Prevent hang_check timer from firing at us during very long I/O */
78 unsigned long timeout = sysctl_hung_task_timeout_secs * HZ / 2;
79
80 if (timeout)
81 while (!wait_for_completion_io_timeout(done, timeout))
82 ;
83 else
84 wait_for_completion_io(done);
85}
86
dc0b8a57 87#define BIO_INLINE_VECS 4
7a800a20
CH
88struct bio_vec *bvec_alloc(mempool_t *pool, unsigned short *nr_vecs,
89 gfp_t gfp_mask);
90void bvec_free(mempool_t *pool, struct bio_vec *bv, unsigned short nr_vecs);
eec716a1 91
7c8998f7
JC
92bool bvec_try_merge_hw_page(struct request_queue *q, struct bio_vec *bv,
93 struct page *page, unsigned len, unsigned offset,
94 bool *same_page);
95
3dccdae5
CH
96static inline bool biovec_phys_mergeable(struct request_queue *q,
97 struct bio_vec *vec1, struct bio_vec *vec2)
6a9f5f24 98{
3dccdae5 99 unsigned long mask = queue_segment_boundary(q);
6e768461
CH
100 phys_addr_t addr1 = page_to_phys(vec1->bv_page) + vec1->bv_offset;
101 phys_addr_t addr2 = page_to_phys(vec2->bv_page) + vec2->bv_offset;
3dccdae5 102
f630a5d0
AP
103 /*
104 * Merging adjacent physical pages may not work correctly under KMSAN
105 * if their metadata pages aren't adjacent. Just disable merging.
106 */
107 if (IS_ENABLED(CONFIG_KMSAN))
108 return false;
109
3dccdae5 110 if (addr1 + vec1->bv_len != addr2)
6a9f5f24 111 return false;
0383ad43 112 if (xen_domain() && !xen_biovec_phys_mergeable(vec1, vec2->bv_page))
6a9f5f24 113 return false;
3dccdae5
CH
114 if ((addr1 | mask) != ((addr2 + vec2->bv_len - 1) | mask))
115 return false;
6a9f5f24
CH
116 return true;
117}
118
aa261f20 119static inline bool __bvec_gap_to_prev(const struct queue_limits *lim,
27ca1d4e
CH
120 struct bio_vec *bprv, unsigned int offset)
121{
c55ddd90
CH
122 return (offset & lim->virt_boundary_mask) ||
123 ((bprv->bv_offset + bprv->bv_len) & lim->virt_boundary_mask);
27ca1d4e
CH
124}
125
126/*
127 * Check if adding a bio_vec after bprv with offset would create a gap in
128 * the SG list. Most drivers don't care about this, but some do.
129 */
aa261f20 130static inline bool bvec_gap_to_prev(const struct queue_limits *lim,
27ca1d4e
CH
131 struct bio_vec *bprv, unsigned int offset)
132{
c55ddd90 133 if (!lim->virt_boundary_mask)
27ca1d4e 134 return false;
c55ddd90 135 return __bvec_gap_to_prev(lim, bprv, offset);
27ca1d4e
CH
136}
137
badf7f64
CH
138static inline bool rq_mergeable(struct request *rq)
139{
140 if (blk_rq_is_passthrough(rq))
141 return false;
142
143 if (req_op(rq) == REQ_OP_FLUSH)
144 return false;
145
146 if (req_op(rq) == REQ_OP_WRITE_ZEROES)
147 return false;
148
149 if (req_op(rq) == REQ_OP_ZONE_APPEND)
150 return false;
151
152 if (rq->cmd_flags & REQ_NOMERGE_FLAGS)
153 return false;
154 if (rq->rq_flags & RQF_NOMERGE_FLAGS)
155 return false;
156
157 return true;
158}
159
160/*
161 * There are two different ways to handle DISCARD merges:
162 * 1) If max_discard_segments > 1, the driver treats every bio as a range and
163 * send the bios to controller together. The ranges don't need to be
164 * contiguous.
165 * 2) Otherwise, the request will be normal read/write requests. The ranges
166 * need to be contiguous.
167 */
168static inline bool blk_discard_mergable(struct request *req)
169{
170 if (req_op(req) == REQ_OP_DISCARD &&
171 queue_max_discard_segments(req->q) > 1)
172 return true;
173 return false;
174}
175
49d24398
US
176static inline unsigned int blk_rq_get_max_segments(struct request *rq)
177{
178 if (req_op(rq) == REQ_OP_DISCARD)
179 return queue_max_discard_segments(rq->q);
180 return queue_max_segments(rq->q);
181}
182
2a9336c4 183static inline unsigned int blk_queue_get_max_sectors(struct request_queue *q,
77e7ffd7 184 enum req_op op)
2a9336c4
CH
185{
186 if (unlikely(op == REQ_OP_DISCARD || op == REQ_OP_SECURE_ERASE))
187 return min(q->limits.max_discard_sectors,
188 UINT_MAX >> SECTOR_SHIFT);
189
190 if (unlikely(op == REQ_OP_WRITE_ZEROES))
191 return q->limits.max_write_zeroes_sectors;
192
193 return q->limits.max_sectors;
194}
195
5a48fc14
DW
196#ifdef CONFIG_BLK_DEV_INTEGRITY
197void blk_flush_integrity(void);
7c20f116 198bool __bio_integrity_endio(struct bio *);
ece841ab 199void bio_integrity_free(struct bio *bio);
7c20f116
CH
200static inline bool bio_integrity_endio(struct bio *bio)
201{
202 if (bio_integrity(bio))
203 return __bio_integrity_endio(bio);
204 return true;
205}
43b729bf 206
92cf2fd1
CH
207bool blk_integrity_merge_rq(struct request_queue *, struct request *,
208 struct request *);
d59da419
CH
209bool blk_integrity_merge_bio(struct request_queue *, struct request *,
210 struct bio *);
92cf2fd1 211
43b729bf
CH
212static inline bool integrity_req_gap_back_merge(struct request *req,
213 struct bio *next)
214{
215 struct bio_integrity_payload *bip = bio_integrity(req->bio);
216 struct bio_integrity_payload *bip_next = bio_integrity(next);
217
c55ddd90
CH
218 return bvec_gap_to_prev(&req->q->limits,
219 &bip->bip_vec[bip->bip_vcnt - 1],
43b729bf
CH
220 bip_next->bip_vec[0].bv_offset);
221}
222
223static inline bool integrity_req_gap_front_merge(struct request *req,
224 struct bio *bio)
225{
226 struct bio_integrity_payload *bip = bio_integrity(bio);
227 struct bio_integrity_payload *bip_next = bio_integrity(req->bio);
228
c55ddd90
CH
229 return bvec_gap_to_prev(&req->q->limits,
230 &bip->bip_vec[bip->bip_vcnt - 1],
43b729bf
CH
231 bip_next->bip_vec[0].bv_offset);
232}
581e2600 233
ff53cd52 234extern const struct attribute_group blk_integrity_attr_group;
43b729bf 235#else /* CONFIG_BLK_DEV_INTEGRITY */
92cf2fd1
CH
236static inline bool blk_integrity_merge_rq(struct request_queue *rq,
237 struct request *r1, struct request *r2)
238{
239 return true;
240}
d59da419
CH
241static inline bool blk_integrity_merge_bio(struct request_queue *rq,
242 struct request *r, struct bio *b)
243{
244 return true;
245}
43b729bf
CH
246static inline bool integrity_req_gap_back_merge(struct request *req,
247 struct bio *next)
248{
249 return false;
250}
251static inline bool integrity_req_gap_front_merge(struct request *req,
252 struct bio *bio)
253{
254 return false;
255}
256
5a48fc14
DW
257static inline void blk_flush_integrity(void)
258{
259}
7c20f116
CH
260static inline bool bio_integrity_endio(struct bio *bio)
261{
262 return true;
263}
ece841ab
JT
264static inline void bio_integrity_free(struct bio *bio)
265{
266}
43b729bf 267#endif /* CONFIG_BLK_DEV_INTEGRITY */
8324aa91 268
0d2602ca 269unsigned long blk_rq_timeout(unsigned long timeout);
87ee7b11 270void blk_add_timer(struct request *req);
320ae51f 271
320ae51f 272bool blk_attempt_plug_merge(struct request_queue *q, struct bio *bio,
0c5bcc92 273 unsigned int nr_segs);
bdc6a287
BW
274bool blk_bio_list_merge(struct request_queue *q, struct list_head *list,
275 struct bio *bio, unsigned int nr_segs);
320ae51f 276
ba0ffdd8
JA
277/*
278 * Plug flush limits
279 */
280#define BLK_MAX_REQUEST_COUNT 32
281#define BLK_PLUG_FLUSH_SIZE (128 * 1024)
282
158dbda0
TH
283/*
284 * Internal elevator interface
285 */
e8064021 286#define ELV_ON_HASH(rq) ((rq)->rq_flags & RQF_HASHED)
158dbda0 287
360f2648 288bool blk_insert_flush(struct request *rq);
dd831006 289
8237c01f 290int elevator_switch(struct request_queue *q, struct elevator_type *new_e);
64b36075 291void elevator_disable(struct request_queue *q);
0c6cb3a2 292void elevator_exit(struct request_queue *q);
cecf5d87 293int elv_register_queue(struct request_queue *q, bool uevent);
83d016ac
BVA
294void elv_unregister_queue(struct request_queue *q);
295
3ad5cee5
CH
296ssize_t part_size_show(struct device *dev, struct device_attribute *attr,
297 char *buf);
298ssize_t part_stat_show(struct device *dev, struct device_attribute *attr,
299 char *buf);
300ssize_t part_inflight_show(struct device *dev, struct device_attribute *attr,
301 char *buf);
302ssize_t part_fail_show(struct device *dev, struct device_attribute *attr,
303 char *buf);
304ssize_t part_fail_store(struct device *dev, struct device_attribute *attr,
305 const char *buf, size_t count);
581d4e28
JA
306ssize_t part_timeout_show(struct device *, struct device_attribute *, char *);
307ssize_t part_timeout_store(struct device *, struct device_attribute *,
308 const char *, size_t);
581d4e28 309
c55ddd90 310static inline bool bio_may_exceed_limits(struct bio *bio,
aa261f20 311 const struct queue_limits *lim)
abd45c15
JA
312{
313 switch (bio_op(bio)) {
314 case REQ_OP_DISCARD:
315 case REQ_OP_SECURE_ERASE:
316 case REQ_OP_WRITE_ZEROES:
abd45c15
JA
317 return true; /* non-trivial splitting decisions */
318 default:
319 break;
320 }
321
322 /*
323 * All drivers must accept single-segments bios that are <= PAGE_SIZE.
324 * This is a quick and dirty check that relies on the fact that
325 * bi_io_vec[0] is always valid if a bio has data. The check might
326 * lead to occasional false negatives when bios are cloned, but compared
327 * to the performance impact of cloned bios themselves the loop below
328 * doesn't matter anyway.
329 */
c55ddd90 330 return lim->chunk_sectors || bio->bi_vcnt != 1 ||
abd45c15
JA
331 bio->bi_io_vec->bv_len + bio->bi_io_vec->bv_offset > PAGE_SIZE;
332}
333
aa261f20
BVA
334struct bio *__bio_split_to_limits(struct bio *bio,
335 const struct queue_limits *lim,
336 unsigned int *nr_segs);
14ccb66b
CH
337int ll_back_merge_fn(struct request *req, struct bio *bio,
338 unsigned int nr_segs);
fd2ef39c 339bool blk_attempt_req_merge(struct request_queue *q, struct request *rq,
5e84ea3a 340 struct request *next);
e9cd19c0 341unsigned int blk_recalc_rq_segments(struct request *rq);
050c8ea8 342bool blk_rq_merge_ok(struct request *rq, struct bio *bio);
34fe7c05 343enum elv_merge blk_try_merge(struct request *rq, struct bio *bio);
d6d48196 344
d690cb8a 345int blk_set_default_limits(struct queue_limits *lim);
ff88972c
AB
346int blk_dev_init(void);
347
c2553b58
JA
348/*
349 * Contribute to IO statistics IFF:
350 *
351 * a) it's attached to a gendisk, and
48d9b0d4 352 * b) the queue had IO stats enabled when this request was started
c2553b58 353 */
599d067d 354static inline bool blk_do_io_stat(struct request *rq)
fb8ec18c 355{
41fa7222 356 return (rq->rq_flags & RQF_IO_STAT) && !blk_rq_is_passthrough(rq);
be6bfe36
PB
357}
358
450b7879 359void update_io_ticks(struct block_device *part, unsigned long now, bool end);
fb8ec18c 360
6cf7677f
CH
361static inline void req_set_nomerge(struct request_queue *q, struct request *req)
362{
363 req->cmd_flags |= REQ_NOMERGE;
364 if (req == q->last_merge)
365 q->last_merge = NULL;
366}
367
f2dbd76a
TH
368/*
369 * Internal io_context interface
370 */
87dd1d63 371struct io_cq *ioc_find_get_icq(struct request_queue *q);
eca5892a 372struct io_cq *ioc_lookup_icq(struct request_queue *q);
5ef16305 373#ifdef CONFIG_BLK_ICQ
7e5a8794 374void ioc_clear_queue(struct request_queue *q);
5ef16305
CH
375#else
376static inline void ioc_clear_queue(struct request_queue *q)
377{
378}
379#endif /* CONFIG_BLK_ICQ */
f2dbd76a 380
297e3d85
SL
381#ifdef CONFIG_BLK_DEV_THROTTLING_LOW
382extern ssize_t blk_throtl_sample_time_show(struct request_queue *q, char *page);
383extern ssize_t blk_throtl_sample_time_store(struct request_queue *q,
384 const char *page, size_t count);
9e234eea 385extern void blk_throtl_bio_endio(struct bio *bio);
b9147dd1 386extern void blk_throtl_stat_add(struct request *rq, u64 time);
9e234eea
SL
387#else
388static inline void blk_throtl_bio_endio(struct bio *bio) { }
b9147dd1 389static inline void blk_throtl_stat_add(struct request *rq, u64 time) { }
297e3d85 390#endif
bc9fcbf9 391
51d798cd 392struct bio *__blk_queue_bounce(struct bio *bio, struct request_queue *q);
9bb33f24
CH
393
394static inline bool blk_queue_may_bounce(struct request_queue *q)
395{
396 return IS_ENABLED(CONFIG_BOUNCE) &&
397 q->limits.bounce == BLK_BOUNCE_HIGH &&
398 max_low_pfn >= max_pfn;
399}
400
51d798cd
CH
401static inline struct bio *blk_queue_bounce(struct bio *bio,
402 struct request_queue *q)
3bce016a 403{
51d798cd
CH
404 if (unlikely(blk_queue_may_bounce(q) && bio_has_data(bio)))
405 return __blk_queue_bounce(bio, q);
406 return bio;
3bce016a 407}
3bce016a 408
bf505456 409#ifdef CONFIG_BLK_DEV_ZONED
5d400665 410void disk_free_zone_bitmaps(struct gendisk *disk);
5e4ea834
CH
411int blkdev_report_zones_ioctl(struct block_device *bdev, unsigned int cmd,
412 unsigned long arg);
05bdb996 413int blkdev_zone_mgmt_ioctl(struct block_device *bdev, blk_mode_t mode,
cfb42576
CH
414 unsigned int cmd, unsigned long arg);
415#else /* CONFIG_BLK_DEV_ZONED */
5d400665 416static inline void disk_free_zone_bitmaps(struct gendisk *disk) {}
cfb42576 417static inline int blkdev_report_zones_ioctl(struct block_device *bdev,
5e4ea834 418 unsigned int cmd, unsigned long arg)
cfb42576
CH
419{
420 return -ENOTTY;
421}
422static inline int blkdev_zone_mgmt_ioctl(struct block_device *bdev,
05bdb996 423 blk_mode_t mode, unsigned int cmd, unsigned long arg)
cfb42576
CH
424{
425 return -ENOTTY;
426}
427#endif /* CONFIG_BLK_DEV_ZONED */
428
429struct block_device *bdev_alloc(struct gendisk *disk, u8 partno);
430void bdev_add(struct block_device *bdev, dev_t dev);
bf505456 431
7c3f828b
CH
432int blk_alloc_ext_minor(void);
433void blk_free_ext_minor(unsigned int minor);
581e2600
CH
434#define ADDPART_FLAG_NONE 0
435#define ADDPART_FLAG_RAID 1
436#define ADDPART_FLAG_WHOLEDISK 2
7f6be376
CH
437int bdev_add_partition(struct gendisk *disk, int partno, sector_t start,
438 sector_t length);
926fbb16 439int bdev_del_partition(struct gendisk *disk, int partno);
3d2e7989
CH
440int bdev_resize_partition(struct gendisk *disk, int partno, sector_t start,
441 sector_t length);
eec1be4c 442void drop_partition(struct block_device *part);
581e2600 443
83794367
DLM
444void bdev_set_nr_sectors(struct block_device *bdev, sector_t sectors);
445
6f8191fd
CH
446struct gendisk *__alloc_disk_node(struct request_queue *q, int node_id,
447 struct lock_class_key *lkclass);
448
e4581105 449int bio_add_hw_page(struct request_queue *q, struct bio *bio,
130879f1 450 struct page *page, unsigned int len, unsigned int offset,
e4581105 451 unsigned int max_sectors, bool *same_page);
130879f1 452
fd363244
DH
453/*
454 * Clean up a page appropriately, where the page may be pinned, may have a
455 * ref taken on it or neither.
456 */
457static inline void bio_release_page(struct bio *bio, struct page *page)
458{
459 if (bio_flagged(bio, BIO_PAGE_PINNED))
460 unpin_user_page(page);
fd363244
DH
461}
462
ad751ba1 463struct request_queue *blk_alloc_queue(struct queue_limits *lim, int node_id);
704b914f 464
05bdb996 465int disk_scan_partitions(struct gendisk *disk, blk_mode_t mode);
da7ba729 466
92e7755e 467int disk_alloc_events(struct gendisk *disk);
d5870edf
CH
468void disk_add_events(struct gendisk *disk);
469void disk_del_events(struct gendisk *disk);
470void disk_release_events(struct gendisk *disk);
926597ff
CH
471void disk_block_events(struct gendisk *disk);
472void disk_unblock_events(struct gendisk *disk);
473void disk_flush_events(struct gendisk *disk, unsigned int mask);
2bc8cda5
CH
474extern struct device_attribute dev_attr_events;
475extern struct device_attribute dev_attr_events_async;
476extern struct device_attribute dev_attr_events_poll_msecs;
d5870edf 477
cc5c516d
CH
478extern struct attribute_group blk_trace_attr_group;
479
05bdb996
CH
480blk_mode_t file_to_blk_mode(struct file *file);
481int truncate_bdev_range(struct block_device *bdev, blk_mode_t mode,
482 loff_t lstart, loff_t lend);
8a709512 483long blkdev_ioctl(struct file *file, unsigned cmd, unsigned long arg);
84b8514b
CH
484long compat_blkdev_ioctl(struct file *file, unsigned cmd, unsigned long arg);
485
cd82cca7
CH
486extern const struct address_space_operations def_blk_aops;
487
22d0c408 488int disk_register_independent_access_ranges(struct gendisk *disk);
a2247f19
DLM
489void disk_unregister_independent_access_ranges(struct gendisk *disk);
490
06c8c691
CH
491#ifdef CONFIG_FAIL_MAKE_REQUEST
492bool should_fail_request(struct block_device *part, unsigned int bytes);
493#else /* CONFIG_FAIL_MAKE_REQUEST */
494static inline bool should_fail_request(struct block_device *part,
495 unsigned int bytes)
496{
497 return false;
498}
499#endif /* CONFIG_FAIL_MAKE_REQUEST */
500
0a467d0f
JA
501/*
502 * Optimized request reference counting. Ideally we'd make timeouts be more
503 * clever, as that's the only reason we need references at all... But until
504 * this happens, this is faster than using refcount_t. Also see:
505 *
506 * abc54d634334 ("io_uring: switch to atomic_t for io_kiocb reference count")
507 */
508#define req_ref_zero_or_close_to_overflow(req) \
509 ((unsigned int) atomic_read(&(req->ref)) + 127u <= 127u)
510
511static inline bool req_ref_inc_not_zero(struct request *req)
512{
513 return atomic_inc_not_zero(&req->ref);
514}
515
516static inline bool req_ref_put_and_test(struct request *req)
517{
518 WARN_ON_ONCE(req_ref_zero_or_close_to_overflow(req));
519 return atomic_dec_and_test(&req->ref);
520}
521
522static inline void req_ref_set(struct request *req, int value)
523{
524 atomic_set(&req->ref, value);
525}
526
527static inline int req_ref_read(struct request *req)
528{
529 return atomic_read(&req->ref);
530}
531
08420cf7
JA
532static inline u64 blk_time_get_ns(void)
533{
da4c8c3d
JA
534 struct blk_plug *plug = current->plug;
535
b874d4aa 536 if (!plug || !in_task())
da4c8c3d
JA
537 return ktime_get_ns();
538
539 /*
540 * 0 could very well be a valid time, but rather than flag "this is
541 * a valid timestamp" separately, just accept that we'll do an extra
542 * ktime_get_ns() if we just happen to get 0 as the current time.
543 */
06b23f92 544 if (!plug->cur_ktime) {
da4c8c3d 545 plug->cur_ktime = ktime_get_ns();
06b23f92
JA
546 current->flags |= PF_BLOCK_TS;
547 }
da4c8c3d 548 return plug->cur_ktime;
08420cf7
JA
549}
550
551static inline ktime_t blk_time_get(void)
552{
553 return ns_to_ktime(blk_time_get_ns());
554}
555
c4e47bbb
JA
556/*
557 * From most significant bit:
558 * 1 bit: reserved for other usage, see below
559 * 12 bits: original size of bio
560 * 51 bits: issue time of bio
561 */
562#define BIO_ISSUE_RES_BITS 1
563#define BIO_ISSUE_SIZE_BITS 12
564#define BIO_ISSUE_RES_SHIFT (64 - BIO_ISSUE_RES_BITS)
565#define BIO_ISSUE_SIZE_SHIFT (BIO_ISSUE_RES_SHIFT - BIO_ISSUE_SIZE_BITS)
566#define BIO_ISSUE_TIME_MASK ((1ULL << BIO_ISSUE_SIZE_SHIFT) - 1)
567#define BIO_ISSUE_SIZE_MASK \
568 (((1ULL << BIO_ISSUE_SIZE_BITS) - 1) << BIO_ISSUE_SIZE_SHIFT)
569#define BIO_ISSUE_RES_MASK (~((1ULL << BIO_ISSUE_RES_SHIFT) - 1))
570
571/* Reserved bit for blk-throtl */
572#define BIO_ISSUE_THROTL_SKIP_LATENCY (1ULL << 63)
573
574static inline u64 __bio_issue_time(u64 time)
575{
576 return time & BIO_ISSUE_TIME_MASK;
577}
578
579static inline u64 bio_issue_time(struct bio_issue *issue)
580{
581 return __bio_issue_time(issue->value);
582}
583
584static inline sector_t bio_issue_size(struct bio_issue *issue)
585{
586 return ((issue->value & BIO_ISSUE_SIZE_MASK) >> BIO_ISSUE_SIZE_SHIFT);
587}
588
589static inline void bio_issue_init(struct bio_issue *issue,
590 sector_t size)
591{
592 size &= (1ULL << BIO_ISSUE_SIZE_BITS) - 1;
593 issue->value = ((issue->value & BIO_ISSUE_RES_MASK) |
08420cf7 594 (blk_time_get_ns() & BIO_ISSUE_TIME_MASK) |
c4e47bbb
JA
595 ((u64)size << BIO_ISSUE_SIZE_SHIFT));
596}
597
7c09a4ed 598void bdev_release(struct file *bdev_file);
a56aefca
CB
599int bdev_open(struct block_device *bdev, blk_mode_t mode, void *holder,
600 const struct blk_holder_ops *hops, struct file *bdev_file);
601int bdev_permission(dev_t dev, blk_mode_t mode, void *holder);
1ddeeb2a 602
bc9fcbf9 603#endif /* BLK_INTERNAL_H */