License cleanup: add SPDX GPL-2.0 license identifier to files with no license
Many source files in the tree are missing licensing information, which
makes it harder for compliance tools to determine the correct license.
By default all files without license information are under the default
license of the kernel, which is GPL version 2.
Update the files which contain no license information with the 'GPL-2.0'
SPDX license identifier. The SPDX identifier is a legally binding
shorthand, which can be used instead of the full boiler plate text.
This patch is based on work done by Thomas Gleixner and Kate Stewart and
Philippe Ombredanne.
How this work was done:
Patches were generated and checked against linux-4.14-rc6 for a subset of
the use cases:
- file had no licensing information it it.
- file was a */uapi/* one with no licensing information in it,
- file was a */uapi/* one with existing licensing information,
Further patches will be generated in subsequent months to fix up cases
where non-standard license headers were used, and references to license
had to be inferred by heuristics based on keywords.
The analysis to determine which SPDX License Identifier to be applied to
a file was done in a spreadsheet of side by side results from of the
output of two independent scanners (ScanCode & Windriver) producing SPDX
tag:value files created by Philippe Ombredanne. Philippe prepared the
base worksheet, and did an initial spot review of a few 1000 files.
The 4.13 kernel was the starting point of the analysis with 60,537 files
assessed. Kate Stewart did a file by file comparison of the scanner
results in the spreadsheet to determine which SPDX license identifier(s)
to be applied to the file. She confirmed any determination that was not
immediately clear with lawyers working with the Linux Foundation.
Criteria used to select files for SPDX license identifier tagging was:
- Files considered eligible had to be source code files.
- Make and config files were included as candidates if they contained >5
lines of source
- File already had some variant of a license header in it (even if <5
lines).
All documentation files were explicitly excluded.
The following heuristics were used to determine which SPDX license
identifiers to apply.
- when both scanners couldn't find any license traces, file was
considered to have no license information in it, and the top level
COPYING file license applied.
For non */uapi/* files that summary was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 11139
and resulted in the first patch in this series.
If that file was a */uapi/* path one, it was "GPL-2.0 WITH
Linux-syscall-note" otherwise it was "GPL-2.0". Results of that was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 WITH Linux-syscall-note 930
and resulted in the second patch in this series.
- if a file had some form of licensing information in it, and was one
of the */uapi/* ones, it was denoted with the Linux-syscall-note if
any GPL family license was found in the file or had no licensing in
it (per prior point). Results summary:
SPDX license identifier # files
---------------------------------------------------|------
GPL-2.0 WITH Linux-syscall-note 270
GPL-2.0+ WITH Linux-syscall-note 169
((GPL-2.0 WITH Linux-syscall-note) OR BSD-2-Clause) 21
((GPL-2.0 WITH Linux-syscall-note) OR BSD-3-Clause) 17
LGPL-2.1+ WITH Linux-syscall-note 15
GPL-1.0+ WITH Linux-syscall-note 14
((GPL-2.0+ WITH Linux-syscall-note) OR BSD-3-Clause) 5
LGPL-2.0+ WITH Linux-syscall-note 4
LGPL-2.1 WITH Linux-syscall-note 3
((GPL-2.0 WITH Linux-syscall-note) OR MIT) 3
((GPL-2.0 WITH Linux-syscall-note) AND MIT) 1
and that resulted in the third patch in this series.
- when the two scanners agreed on the detected license(s), that became
the concluded license(s).
- when there was disagreement between the two scanners (one detected a
license but the other didn't, or they both detected different
licenses) a manual inspection of the file occurred.
- In most cases a manual inspection of the information in the file
resulted in a clear resolution of the license that should apply (and
which scanner probably needed to revisit its heuristics).
- When it was not immediately clear, the license identifier was
confirmed with lawyers working with the Linux Foundation.
- If there was any question as to the appropriate license identifier,
the file was flagged for further research and to be revisited later
in time.
In total, over 70 hours of logged manual review was done on the
spreadsheet to determine the SPDX license identifiers to apply to the
source files by Kate, Philippe, Thomas and, in some cases, confirmation
by lawyers working with the Linux Foundation.
Kate also obtained a third independent scan of the 4.13 code base from
FOSSology, and compared selected files where the other two scanners
disagreed against that SPDX file, to see if there was new insights. The
Windriver scanner is based on an older version of FOSSology in part, so
they are related.
Thomas did random spot checks in about 500 files from the spreadsheets
for the uapi headers and agreed with SPDX license identifier in the
files he inspected. For the non-uapi files Thomas did random spot checks
in about 15000 files.
In initial set of patches against 4.14-rc6, 3 files were found to have
copy/paste license identifier errors, and have been fixed to reflect the
correct identifier.
Additionally Philippe spent 10 hours this week doing a detailed manual
inspection and review of the 12,461 patched files from the initial patch
version early this week with:
- a full scancode scan run, collecting the matched texts, detected
license ids and scores
- reviewing anything where there was a license detected (about 500+
files) to ensure that the applied SPDX license was correct
- reviewing anything where there was no detection but the patch license
was not GPL-2.0 WITH Linux-syscall-note to ensure that the applied
SPDX license was correct
This produced a worksheet with 20 files needing minor correction. This
worksheet was then exported into 3 different .csv files for the
different types of files to be modified.
These .csv files were then reviewed by Greg. Thomas wrote a script to
parse the csv files and add the proper SPDX tag to the file, in the
format that the file expected. This script was further refined by Greg
based on the output to detect more types of files automatically and to
distinguish between header and source .c files (which need different
comment types.) Finally Greg ran the script using the .csv files to
generate the patches.
Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org>
Reviewed-by: Philippe Ombredanne <pombredanne@nexb.com>
Reviewed-by: Thomas Gleixner <tglx@linutronix.de>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
2017-11-01 14:07:57 +00:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2010-08-03 11:14:58 +00:00
|
|
|
/*
|
|
|
|
* Block data types and constants. Directly include this file only to
|
|
|
|
* break include dependency loop.
|
|
|
|
*/
|
|
|
|
#ifndef __LINUX_BLK_TYPES_H
|
|
|
|
#define __LINUX_BLK_TYPES_H
|
|
|
|
|
|
|
|
#include <linux/types.h>
|
2016-05-30 13:34:30 +00:00
|
|
|
#include <linux/bvec.h>
|
2018-05-09 09:08:49 +00:00
|
|
|
#include <linux/ktime.h>
|
2010-08-03 11:14:58 +00:00
|
|
|
|
|
|
|
struct bio_set;
|
|
|
|
struct bio;
|
|
|
|
struct bio_integrity_payload;
|
|
|
|
struct page;
|
|
|
|
struct block_device;
|
2012-03-05 21:15:27 +00:00
|
|
|
struct io_context;
|
|
|
|
struct cgroup_subsys_state;
|
2015-07-20 13:29:37 +00:00
|
|
|
typedef void (bio_end_io_t) (struct bio *);
|
2010-08-03 11:14:58 +00:00
|
|
|
|
2017-06-03 07:38:04 +00:00
|
|
|
/*
|
|
|
|
* Block error status values. See block/blk-core:blk_errors for the details.
|
2018-03-21 16:42:25 +00:00
|
|
|
* Alpha cannot write a byte atomically, so we need to use 32-bit value.
|
2017-06-03 07:38:04 +00:00
|
|
|
*/
|
2018-03-21 16:42:25 +00:00
|
|
|
#if defined(CONFIG_ALPHA) && !defined(__alpha_bwx__)
|
|
|
|
typedef u32 __bitwise blk_status_t;
|
|
|
|
#else
|
2017-06-03 07:38:04 +00:00
|
|
|
typedef u8 __bitwise blk_status_t;
|
2018-03-21 16:42:25 +00:00
|
|
|
#endif
|
2017-06-03 07:38:04 +00:00
|
|
|
#define BLK_STS_OK 0
|
|
|
|
#define BLK_STS_NOTSUPP ((__force blk_status_t)1)
|
|
|
|
#define BLK_STS_TIMEOUT ((__force blk_status_t)2)
|
|
|
|
#define BLK_STS_NOSPC ((__force blk_status_t)3)
|
|
|
|
#define BLK_STS_TRANSPORT ((__force blk_status_t)4)
|
|
|
|
#define BLK_STS_TARGET ((__force blk_status_t)5)
|
|
|
|
#define BLK_STS_NEXUS ((__force blk_status_t)6)
|
|
|
|
#define BLK_STS_MEDIUM ((__force blk_status_t)7)
|
|
|
|
#define BLK_STS_PROTECTION ((__force blk_status_t)8)
|
|
|
|
#define BLK_STS_RESOURCE ((__force blk_status_t)9)
|
|
|
|
#define BLK_STS_IOERR ((__force blk_status_t)10)
|
|
|
|
|
2017-06-03 07:38:06 +00:00
|
|
|
/* hack for device mapper, don't use elsewhere: */
|
|
|
|
#define BLK_STS_DM_REQUEUE ((__force blk_status_t)11)
|
|
|
|
|
2017-06-20 12:05:46 +00:00
|
|
|
#define BLK_STS_AGAIN ((__force blk_status_t)12)
|
|
|
|
|
2018-01-31 03:04:57 +00:00
|
|
|
/*
|
|
|
|
* BLK_STS_DEV_RESOURCE is returned from the driver to the block layer if
|
|
|
|
* device related resources are unavailable, but the driver can guarantee
|
|
|
|
* that the queue will be rerun in the future once resources become
|
|
|
|
* available again. This is typically the case for device specific
|
|
|
|
* resources that are consumed for IO. If the driver fails allocating these
|
|
|
|
* resources, we know that inflight (or pending) IO will free these
|
|
|
|
* resource upon completion.
|
|
|
|
*
|
|
|
|
* This is different from BLK_STS_RESOURCE in that it explicitly references
|
|
|
|
* a device specific resource. For resources of wider scope, allocation
|
|
|
|
* failure can happen without having pending IO. This means that we can't
|
|
|
|
* rely on request completions freeing these resources, as IO may not be in
|
|
|
|
* flight. Examples of that are kernel memory allocations, DMA mappings, or
|
|
|
|
* any other system wide resources.
|
|
|
|
*/
|
|
|
|
#define BLK_STS_DEV_RESOURCE ((__force blk_status_t)13)
|
|
|
|
|
2018-01-09 19:04:16 +00:00
|
|
|
/**
|
|
|
|
* blk_path_error - returns true if error may be path related
|
|
|
|
* @error: status the request was completed with
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* This classifies block error status into non-retryable errors and ones
|
|
|
|
* that may be successful if retried on a failover path.
|
|
|
|
*
|
|
|
|
* Return:
|
|
|
|
* %false - retrying failover path will not help
|
|
|
|
* %true - may succeed if retried
|
|
|
|
*/
|
|
|
|
static inline bool blk_path_error(blk_status_t error)
|
|
|
|
{
|
|
|
|
switch (error) {
|
|
|
|
case BLK_STS_NOTSUPP:
|
|
|
|
case BLK_STS_NOSPC:
|
|
|
|
case BLK_STS_TARGET:
|
|
|
|
case BLK_STS_NEXUS:
|
|
|
|
case BLK_STS_MEDIUM:
|
|
|
|
case BLK_STS_PROTECTION:
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Anything else could be a path failure, so should be retried */
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2018-05-09 09:08:49 +00:00
|
|
|
/*
|
|
|
|
* From most significant bit:
|
|
|
|
* 1 bit: reserved for other usage, see below
|
|
|
|
* 12 bits: original size of bio
|
|
|
|
* 51 bits: issue time of bio
|
|
|
|
*/
|
|
|
|
#define BIO_ISSUE_RES_BITS 1
|
|
|
|
#define BIO_ISSUE_SIZE_BITS 12
|
|
|
|
#define BIO_ISSUE_RES_SHIFT (64 - BIO_ISSUE_RES_BITS)
|
|
|
|
#define BIO_ISSUE_SIZE_SHIFT (BIO_ISSUE_RES_SHIFT - BIO_ISSUE_SIZE_BITS)
|
|
|
|
#define BIO_ISSUE_TIME_MASK ((1ULL << BIO_ISSUE_SIZE_SHIFT) - 1)
|
|
|
|
#define BIO_ISSUE_SIZE_MASK \
|
|
|
|
(((1ULL << BIO_ISSUE_SIZE_BITS) - 1) << BIO_ISSUE_SIZE_SHIFT)
|
|
|
|
#define BIO_ISSUE_RES_MASK (~((1ULL << BIO_ISSUE_RES_SHIFT) - 1))
|
|
|
|
|
|
|
|
/* Reserved bit for blk-throtl */
|
|
|
|
#define BIO_ISSUE_THROTL_SKIP_LATENCY (1ULL << 63)
|
|
|
|
|
|
|
|
struct bio_issue {
|
|
|
|
u64 value;
|
|
|
|
};
|
|
|
|
|
|
|
|
static inline u64 __bio_issue_time(u64 time)
|
|
|
|
{
|
|
|
|
return time & BIO_ISSUE_TIME_MASK;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline u64 bio_issue_time(struct bio_issue *issue)
|
|
|
|
{
|
|
|
|
return __bio_issue_time(issue->value);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline sector_t bio_issue_size(struct bio_issue *issue)
|
|
|
|
{
|
|
|
|
return ((issue->value & BIO_ISSUE_SIZE_MASK) >> BIO_ISSUE_SIZE_SHIFT);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void bio_issue_init(struct bio_issue *issue,
|
|
|
|
sector_t size)
|
|
|
|
{
|
|
|
|
size &= (1ULL << BIO_ISSUE_SIZE_BITS) - 1;
|
|
|
|
issue->value = ((issue->value & BIO_ISSUE_RES_MASK) |
|
|
|
|
(ktime_get_ns() & BIO_ISSUE_TIME_MASK) |
|
|
|
|
((u64)size << BIO_ISSUE_SIZE_SHIFT));
|
|
|
|
}
|
|
|
|
|
2010-08-03 11:14:58 +00:00
|
|
|
/*
|
|
|
|
* main unit of I/O for the block layer and lower layers (ie drivers and
|
|
|
|
* stacking drivers)
|
|
|
|
*/
|
|
|
|
struct bio {
|
|
|
|
struct bio *bi_next; /* request queue link */
|
2017-08-23 17:10:32 +00:00
|
|
|
struct gendisk *bi_disk;
|
2016-08-05 21:35:16 +00:00
|
|
|
unsigned int bi_opf; /* bottom bits req flags,
|
|
|
|
* top bits REQ_OP. Use
|
|
|
|
* accessors.
|
2016-06-05 19:32:22 +00:00
|
|
|
*/
|
2017-04-07 01:10:44 +00:00
|
|
|
unsigned short bi_flags; /* status, etc and bvec pool number */
|
2016-06-05 19:32:20 +00:00
|
|
|
unsigned short bi_ioprio;
|
2017-06-27 15:22:02 +00:00
|
|
|
unsigned short bi_write_hint;
|
2017-12-20 18:10:17 +00:00
|
|
|
blk_status_t bi_status;
|
|
|
|
u8 bi_partno;
|
2010-08-03 11:14:58 +00:00
|
|
|
|
2017-12-20 18:10:17 +00:00
|
|
|
struct bvec_iter bi_iter;
|
2013-11-24 02:34:15 +00:00
|
|
|
|
2017-12-20 18:10:17 +00:00
|
|
|
atomic_t __bi_remaining;
|
2010-08-03 11:14:58 +00:00
|
|
|
bio_end_io_t *bi_end_io;
|
|
|
|
|
|
|
|
void *bi_private;
|
2012-03-05 21:15:27 +00:00
|
|
|
#ifdef CONFIG_BLK_CGROUP
|
|
|
|
/*
|
2018-12-05 17:10:35 +00:00
|
|
|
* Represents the association of the css and request_queue for the bio.
|
|
|
|
* If a bio goes direct to device, it will not have a blkg as it will
|
|
|
|
* not have a request_queue associated with it. The reference is put
|
|
|
|
* on release of the bio.
|
2012-03-05 21:15:27 +00:00
|
|
|
*/
|
2018-07-03 15:14:50 +00:00
|
|
|
struct blkcg_gq *bi_blkg;
|
2018-05-09 09:08:49 +00:00
|
|
|
struct bio_issue bi_issue;
|
2019-08-28 22:05:58 +00:00
|
|
|
#ifdef CONFIG_BLK_CGROUP_IOCOST
|
|
|
|
u64 bi_iocost_cost;
|
|
|
|
#endif
|
2012-03-05 21:15:27 +00:00
|
|
|
#endif
|
2014-09-26 23:19:56 +00:00
|
|
|
union {
|
2010-08-03 11:14:58 +00:00
|
|
|
#if defined(CONFIG_BLK_DEV_INTEGRITY)
|
2014-09-26 23:19:56 +00:00
|
|
|
struct bio_integrity_payload *bi_integrity; /* data integrity */
|
2010-08-03 11:14:58 +00:00
|
|
|
#endif
|
2014-09-26 23:19:56 +00:00
|
|
|
};
|
2010-08-03 11:14:58 +00:00
|
|
|
|
2013-10-11 22:44:27 +00:00
|
|
|
unsigned short bi_vcnt; /* how many bio_vec's */
|
|
|
|
|
2012-09-06 22:34:58 +00:00
|
|
|
/*
|
|
|
|
* Everything starting with bi_max_vecs will be preserved by bio_reset()
|
|
|
|
*/
|
|
|
|
|
2013-10-11 22:44:27 +00:00
|
|
|
unsigned short bi_max_vecs; /* max bvl_vecs we can hold */
|
2012-09-06 22:34:58 +00:00
|
|
|
|
2015-04-17 22:23:59 +00:00
|
|
|
atomic_t __bi_cnt; /* pin count */
|
2012-09-06 22:34:58 +00:00
|
|
|
|
|
|
|
struct bio_vec *bi_io_vec; /* the actual vec list */
|
|
|
|
|
2012-09-06 22:34:55 +00:00
|
|
|
struct bio_set *bi_pool;
|
|
|
|
|
2010-08-03 11:14:58 +00:00
|
|
|
/*
|
|
|
|
* We can inline a number of vecs at the end of the bio, to avoid
|
|
|
|
* double allocations for a small number of bio_vecs. This member
|
|
|
|
* MUST obviously be kept at the very end of the bio.
|
|
|
|
*/
|
|
|
|
struct bio_vec bi_inline_vecs[0];
|
|
|
|
};
|
|
|
|
|
2012-09-06 22:34:58 +00:00
|
|
|
#define BIO_RESET_BYTES offsetof(struct bio, bi_max_vecs)
|
|
|
|
|
2010-08-03 11:14:58 +00:00
|
|
|
/*
|
|
|
|
* bio flags
|
|
|
|
*/
|
2019-04-03 09:15:19 +00:00
|
|
|
enum {
|
|
|
|
BIO_NO_PAGE_REF, /* don't put release vec pages */
|
|
|
|
BIO_CLONED, /* doesn't own data */
|
|
|
|
BIO_BOUNCED, /* bio is a bounce bio */
|
|
|
|
BIO_USER_MAPPED, /* contains user pages */
|
|
|
|
BIO_NULL_MAPPED, /* contains invalid user pages */
|
2019-08-08 19:03:00 +00:00
|
|
|
BIO_WORKINGSET, /* contains userspace workingset pages */
|
2019-04-03 09:15:19 +00:00
|
|
|
BIO_QUIET, /* Make BIO Quiet */
|
|
|
|
BIO_CHAIN, /* chained bio, ->bi_remaining in effect */
|
|
|
|
BIO_REFFED, /* bio has elevated ->bi_cnt */
|
|
|
|
BIO_THROTTLED, /* This bio has already been subjected to
|
2016-10-20 13:12:12 +00:00
|
|
|
* throttling rules. Don't do it again. */
|
2019-04-03 09:15:19 +00:00
|
|
|
BIO_TRACE_COMPLETION, /* bio_endio() should trace the final completion
|
block: trace completion of all bios.
Currently only dm and md/raid5 bios trigger
trace_block_bio_complete(). Now that we have bio_chain() and
bio_inc_remaining(), it is not possible, in general, for a driver to
know when the bio is really complete. Only bio_endio() knows that.
So move the trace_block_bio_complete() call to bio_endio().
Now trace_block_bio_complete() pairs with trace_block_bio_queue().
Any bio for which a 'queue' event is traced, will subsequently
generate a 'complete' event.
There are a few cases where completion tracing is not wanted.
1/ If blk_update_request() has already generated a completion
trace event at the 'request' level, there is no point generating
one at the bio level too. In this case the bi_sector and bi_size
will have changed, so the bio level event would be wrong
2/ If the bio hasn't actually been queued yet, but is being aborted
early, then a trace event could be confusing. Some filesystems
call bio_endio() but do not want tracing.
3/ The bio_integrity code interposes itself by replacing bi_end_io,
then restoring it and calling bio_endio() again. This would produce
two identical trace events if left like that.
To handle these, we introduce a flag BIO_TRACE_COMPLETION and only
produce the trace event when this is set.
We address point 1 above by clearing the flag in blk_update_request().
We address point 2 above by only setting the flag when
generic_make_request() is called.
We address point 3 above by clearing the flag after generating a
completion event.
When bio_split() is used on a bio, particularly in blk_queue_split(),
there is an extra complication. A new bio is split off the front, and
may be handle directly without going through generic_make_request().
The old bio, which has been advanced, is passed to
generic_make_request(), so it will trigger a trace event a second
time.
Probably the best result when a split happens is to see a single
'queue' event for the whole bio, then multiple 'complete' events - one
for each component. To achieve this was can:
- copy the BIO_TRACE_COMPLETION flag to the new bio in bio_split()
- avoid generating a 'queue' event if BIO_TRACE_COMPLETION is already set.
This way, the split-off bio won't create a queue event, the original
won't either even if it re-submitted to generic_make_request(),
but both will produce completion events, each for their own range.
So if generic_make_request() is called (which generates a QUEUED
event), then bi_endio() will create a single COMPLETE event for each
range that the bio is split into, unless the driver has explicitly
requested it not to.
Signed-off-by: NeilBrown <neilb@suse.com>
Signed-off-by: Jens Axboe <axboe@fb.com>
2017-04-07 15:40:52 +00:00
|
|
|
* of this bio. */
|
2019-04-03 09:15:19 +00:00
|
|
|
BIO_QUEUE_ENTERED, /* can use blk_queue_enter_live() */
|
|
|
|
BIO_TRACKED, /* set if bio goes through the rq_qos path */
|
|
|
|
BIO_FLAG_LAST
|
|
|
|
};
|
2018-06-02 20:04:07 +00:00
|
|
|
|
2017-04-07 01:10:44 +00:00
|
|
|
/* See BVEC_POOL_OFFSET below before adding new flags */
|
2012-09-06 22:34:58 +00:00
|
|
|
|
2010-08-03 11:14:58 +00:00
|
|
|
/*
|
2016-07-19 09:28:42 +00:00
|
|
|
* We support 6 different bvec pools, the last one is magic in that it
|
|
|
|
* is backed by a mempool.
|
2010-08-03 11:14:58 +00:00
|
|
|
*/
|
2016-07-19 09:28:42 +00:00
|
|
|
#define BVEC_POOL_NR 6
|
|
|
|
#define BVEC_POOL_MAX (BVEC_POOL_NR - 1)
|
|
|
|
|
|
|
|
/*
|
2017-04-07 01:10:44 +00:00
|
|
|
* Top 3 bits of bio flags indicate the pool the bvecs came from. We add
|
2016-07-19 09:28:42 +00:00
|
|
|
* 1 to the actual index so that 0 indicates that there are no bvecs to be
|
|
|
|
* freed.
|
|
|
|
*/
|
2017-04-07 01:10:44 +00:00
|
|
|
#define BVEC_POOL_BITS (3)
|
2016-07-19 09:28:43 +00:00
|
|
|
#define BVEC_POOL_OFFSET (16 - BVEC_POOL_BITS)
|
2016-07-19 09:28:42 +00:00
|
|
|
#define BVEC_POOL_IDX(bio) ((bio)->bi_flags >> BVEC_POOL_OFFSET)
|
2017-04-07 01:10:44 +00:00
|
|
|
#if (1<< BVEC_POOL_BITS) < (BVEC_POOL_NR+1)
|
|
|
|
# error "BVEC_POOL_BITS is too small"
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Flags starting here get preserved by bio_reset() - this includes
|
|
|
|
* only BVEC_POOL_IDX()
|
|
|
|
*/
|
|
|
|
#define BIO_RESET_BITS BVEC_POOL_OFFSET
|
2010-08-03 11:14:58 +00:00
|
|
|
|
2017-11-09 18:49:59 +00:00
|
|
|
typedef __u32 __bitwise blk_mq_req_flags_t;
|
|
|
|
|
2010-08-03 11:14:58 +00:00
|
|
|
/*
|
2016-10-28 14:48:16 +00:00
|
|
|
* Operations and flags common to the bio and request structures.
|
|
|
|
* We use 8 bits for encoding the operation, and the remaining 24 for flags.
|
2016-10-20 13:12:15 +00:00
|
|
|
*
|
|
|
|
* The least significant bit of the operation number indicates the data
|
|
|
|
* transfer direction:
|
|
|
|
*
|
|
|
|
* - if the least significant bit is set transfers are TO the device
|
|
|
|
* - if the least significant bit is not set transfers are FROM the device
|
|
|
|
*
|
|
|
|
* If a operation does not transfer data the least significant bit has no
|
|
|
|
* meaning.
|
2010-08-03 11:14:58 +00:00
|
|
|
*/
|
2016-10-28 14:48:16 +00:00
|
|
|
#define REQ_OP_BITS 8
|
|
|
|
#define REQ_OP_MASK ((1 << REQ_OP_BITS) - 1)
|
|
|
|
#define REQ_FLAG_BITS 24
|
|
|
|
|
|
|
|
enum req_opf {
|
2016-10-20 13:12:15 +00:00
|
|
|
/* read sectors from the device */
|
|
|
|
REQ_OP_READ = 0,
|
|
|
|
/* write sectors to the device */
|
|
|
|
REQ_OP_WRITE = 1,
|
|
|
|
/* flush the volatile write cache */
|
|
|
|
REQ_OP_FLUSH = 2,
|
|
|
|
/* discard sectors */
|
|
|
|
REQ_OP_DISCARD = 3,
|
|
|
|
/* securely erase sectors */
|
|
|
|
REQ_OP_SECURE_ERASE = 5,
|
2019-01-24 09:20:14 +00:00
|
|
|
/* reset a zone write pointer */
|
2016-10-20 13:12:15 +00:00
|
|
|
REQ_OP_ZONE_RESET = 6,
|
|
|
|
/* write the same sector many times */
|
|
|
|
REQ_OP_WRITE_SAME = 7,
|
2019-08-01 17:26:35 +00:00
|
|
|
/* reset all the zone present on the device */
|
|
|
|
REQ_OP_ZONE_RESET_ALL = 8,
|
2016-11-30 20:28:59 +00:00
|
|
|
/* write the zero filled sector many times */
|
2017-04-05 17:21:00 +00:00
|
|
|
REQ_OP_WRITE_ZEROES = 9,
|
2016-10-28 14:48:16 +00:00
|
|
|
|
2017-01-31 15:57:31 +00:00
|
|
|
/* SCSI passthrough using struct scsi_request */
|
|
|
|
REQ_OP_SCSI_IN = 32,
|
|
|
|
REQ_OP_SCSI_OUT = 33,
|
|
|
|
/* Driver private requests */
|
|
|
|
REQ_OP_DRV_IN = 34,
|
|
|
|
REQ_OP_DRV_OUT = 35,
|
|
|
|
|
2016-10-28 14:48:16 +00:00
|
|
|
REQ_OP_LAST,
|
|
|
|
};
|
|
|
|
|
|
|
|
enum req_flag_bits {
|
|
|
|
__REQ_FAILFAST_DEV = /* no driver retries of device errors */
|
|
|
|
REQ_OP_BITS,
|
2010-08-03 11:14:58 +00:00
|
|
|
__REQ_FAILFAST_TRANSPORT, /* no driver retries of transport errors */
|
|
|
|
__REQ_FAILFAST_DRIVER, /* no driver retries of driver errors */
|
|
|
|
__REQ_SYNC, /* request is sync (sync write or read) */
|
|
|
|
__REQ_META, /* metadata io request */
|
2011-08-23 12:50:29 +00:00
|
|
|
__REQ_PRIO, /* boost priority in cfq */
|
2016-10-20 13:12:10 +00:00
|
|
|
__REQ_NOMERGE, /* don't touch this for merging */
|
2016-11-01 13:40:09 +00:00
|
|
|
__REQ_IDLE, /* anticipate more IO after this one */
|
2014-09-26 23:19:56 +00:00
|
|
|
__REQ_INTEGRITY, /* I/O includes block integrity payload */
|
2011-08-11 08:36:03 +00:00
|
|
|
__REQ_FUA, /* forced unit access */
|
2016-06-05 19:32:25 +00:00
|
|
|
__REQ_PREFLUSH, /* request for cache flush */
|
2016-10-20 13:12:11 +00:00
|
|
|
__REQ_RAHEAD, /* read ahead, can fail anytime */
|
2016-11-01 15:52:57 +00:00
|
|
|
__REQ_BACKGROUND, /* background IO */
|
2017-11-02 18:29:48 +00:00
|
|
|
__REQ_NOWAIT, /* Don't wait if request will block */
|
2019-07-16 19:55:23 +00:00
|
|
|
__REQ_NOWAIT_INLINE, /* Return would-block error inline */
|
2019-06-27 20:39:52 +00:00
|
|
|
/*
|
|
|
|
* When a shared kthread needs to issue a bio for a cgroup, doing
|
|
|
|
* so synchronously can lead to priority inversions as the kthread
|
|
|
|
* can be trapped waiting for that cgroup. CGROUP_PUNT flag makes
|
|
|
|
* submit_bio() punt the actual issuing to a dedicated per-blkcg
|
|
|
|
* work item to avoid such priority inversions.
|
|
|
|
*/
|
|
|
|
__REQ_CGROUP_PUNT,
|
2017-04-05 17:21:09 +00:00
|
|
|
|
|
|
|
/* command specific flags for REQ_OP_WRITE_ZEROES: */
|
|
|
|
__REQ_NOUNMAP, /* do not free blocks when zeroing */
|
|
|
|
|
2018-08-29 16:36:56 +00:00
|
|
|
__REQ_HIPRI,
|
|
|
|
|
2017-11-02 18:29:49 +00:00
|
|
|
/* for driver use */
|
|
|
|
__REQ_DRV,
|
2018-07-03 15:14:53 +00:00
|
|
|
__REQ_SWAP, /* swapping request. */
|
2010-08-03 11:14:58 +00:00
|
|
|
__REQ_NR_BITS, /* stops here */
|
|
|
|
};
|
|
|
|
|
2013-05-23 10:25:08 +00:00
|
|
|
#define REQ_FAILFAST_DEV (1ULL << __REQ_FAILFAST_DEV)
|
|
|
|
#define REQ_FAILFAST_TRANSPORT (1ULL << __REQ_FAILFAST_TRANSPORT)
|
|
|
|
#define REQ_FAILFAST_DRIVER (1ULL << __REQ_FAILFAST_DRIVER)
|
|
|
|
#define REQ_SYNC (1ULL << __REQ_SYNC)
|
|
|
|
#define REQ_META (1ULL << __REQ_META)
|
|
|
|
#define REQ_PRIO (1ULL << __REQ_PRIO)
|
2016-10-28 14:48:16 +00:00
|
|
|
#define REQ_NOMERGE (1ULL << __REQ_NOMERGE)
|
2016-11-01 13:40:09 +00:00
|
|
|
#define REQ_IDLE (1ULL << __REQ_IDLE)
|
2014-09-26 23:19:56 +00:00
|
|
|
#define REQ_INTEGRITY (1ULL << __REQ_INTEGRITY)
|
2016-10-28 14:48:16 +00:00
|
|
|
#define REQ_FUA (1ULL << __REQ_FUA)
|
|
|
|
#define REQ_PREFLUSH (1ULL << __REQ_PREFLUSH)
|
|
|
|
#define REQ_RAHEAD (1ULL << __REQ_RAHEAD)
|
2016-11-01 15:52:57 +00:00
|
|
|
#define REQ_BACKGROUND (1ULL << __REQ_BACKGROUND)
|
2017-11-02 18:29:48 +00:00
|
|
|
#define REQ_NOWAIT (1ULL << __REQ_NOWAIT)
|
2019-07-16 19:55:23 +00:00
|
|
|
#define REQ_NOWAIT_INLINE (1ULL << __REQ_NOWAIT_INLINE)
|
2019-06-27 20:39:52 +00:00
|
|
|
#define REQ_CGROUP_PUNT (1ULL << __REQ_CGROUP_PUNT)
|
|
|
|
|
2017-04-05 17:21:09 +00:00
|
|
|
#define REQ_NOUNMAP (1ULL << __REQ_NOUNMAP)
|
2018-08-29 16:36:56 +00:00
|
|
|
#define REQ_HIPRI (1ULL << __REQ_HIPRI)
|
2017-04-05 17:21:09 +00:00
|
|
|
|
2017-11-02 18:29:49 +00:00
|
|
|
#define REQ_DRV (1ULL << __REQ_DRV)
|
2018-07-03 15:14:53 +00:00
|
|
|
#define REQ_SWAP (1ULL << __REQ_SWAP)
|
2017-04-05 17:21:09 +00:00
|
|
|
|
2010-08-03 11:14:58 +00:00
|
|
|
#define REQ_FAILFAST_MASK \
|
|
|
|
(REQ_FAILFAST_DEV | REQ_FAILFAST_TRANSPORT | REQ_FAILFAST_DRIVER)
|
|
|
|
|
2012-09-18 16:19:25 +00:00
|
|
|
#define REQ_NOMERGE_FLAGS \
|
2016-10-20 13:12:13 +00:00
|
|
|
(REQ_NOMERGE | REQ_PREFLUSH | REQ_FUA)
|
2012-09-18 16:19:25 +00:00
|
|
|
|
2018-07-18 11:47:38 +00:00
|
|
|
enum stat_group {
|
|
|
|
STAT_READ,
|
|
|
|
STAT_WRITE,
|
2018-07-18 11:47:40 +00:00
|
|
|
STAT_DISCARD,
|
2018-07-18 11:47:38 +00:00
|
|
|
|
|
|
|
NR_STAT_GROUPS
|
|
|
|
};
|
|
|
|
|
2016-10-28 14:48:16 +00:00
|
|
|
#define bio_op(bio) \
|
|
|
|
((bio)->bi_opf & REQ_OP_MASK)
|
|
|
|
#define req_op(req) \
|
|
|
|
((req)->cmd_flags & REQ_OP_MASK)
|
2010-08-03 11:14:58 +00:00
|
|
|
|
2016-10-28 14:48:16 +00:00
|
|
|
/* obsolete, don't use in new code */
|
2016-11-21 15:18:18 +00:00
|
|
|
static inline void bio_set_op_attrs(struct bio *bio, unsigned op,
|
|
|
|
unsigned op_flags)
|
|
|
|
{
|
|
|
|
bio->bi_opf = op | op_flags;
|
|
|
|
}
|
2016-08-05 14:11:04 +00:00
|
|
|
|
2016-10-20 13:12:15 +00:00
|
|
|
static inline bool op_is_write(unsigned int op)
|
|
|
|
{
|
|
|
|
return (op & 1);
|
|
|
|
}
|
|
|
|
|
2017-01-27 15:30:47 +00:00
|
|
|
/*
|
|
|
|
* Check if the bio or request is one that needs special treatment in the
|
|
|
|
* flush state machine.
|
|
|
|
*/
|
|
|
|
static inline bool op_is_flush(unsigned int op)
|
|
|
|
{
|
|
|
|
return op & (REQ_FUA | REQ_PREFLUSH);
|
|
|
|
}
|
|
|
|
|
2016-11-01 13:40:08 +00:00
|
|
|
/*
|
|
|
|
* Reads are always treated as synchronous, as are requests with the FUA or
|
|
|
|
* PREFLUSH flag. Other operations may be marked as synchronous using the
|
|
|
|
* REQ_SYNC flag.
|
|
|
|
*/
|
2016-10-28 14:48:16 +00:00
|
|
|
static inline bool op_is_sync(unsigned int op)
|
|
|
|
{
|
2016-11-01 13:40:08 +00:00
|
|
|
return (op & REQ_OP_MASK) == REQ_OP_READ ||
|
|
|
|
(op & (REQ_SYNC | REQ_FUA | REQ_PREFLUSH));
|
2016-10-28 14:48:16 +00:00
|
|
|
}
|
2016-08-05 14:11:04 +00:00
|
|
|
|
2018-07-18 11:47:40 +00:00
|
|
|
static inline bool op_is_discard(unsigned int op)
|
|
|
|
{
|
|
|
|
return (op & REQ_OP_MASK) == REQ_OP_DISCARD;
|
|
|
|
}
|
|
|
|
|
2018-07-18 11:47:39 +00:00
|
|
|
static inline int op_stat_group(unsigned int op)
|
|
|
|
{
|
2018-07-18 11:47:40 +00:00
|
|
|
if (op_is_discard(op))
|
|
|
|
return STAT_DISCARD;
|
2018-07-18 11:47:39 +00:00
|
|
|
return op_is_write(op);
|
|
|
|
}
|
|
|
|
|
2015-11-05 17:41:16 +00:00
|
|
|
typedef unsigned int blk_qc_t;
|
2017-01-12 17:04:45 +00:00
|
|
|
#define BLK_QC_T_NONE -1U
|
2019-07-16 19:55:23 +00:00
|
|
|
#define BLK_QC_T_EAGAIN -2U
|
2017-01-12 17:04:45 +00:00
|
|
|
#define BLK_QC_T_SHIFT 16
|
|
|
|
#define BLK_QC_T_INTERNAL (1U << 31)
|
2015-11-05 17:41:16 +00:00
|
|
|
|
|
|
|
static inline bool blk_qc_t_valid(blk_qc_t cookie)
|
|
|
|
{
|
2019-07-16 19:55:23 +00:00
|
|
|
return cookie != BLK_QC_T_NONE && cookie != BLK_QC_T_EAGAIN;
|
2015-11-05 17:41:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline unsigned int blk_qc_t_to_queue_num(blk_qc_t cookie)
|
|
|
|
{
|
2017-01-12 17:04:45 +00:00
|
|
|
return (cookie & ~BLK_QC_T_INTERNAL) >> BLK_QC_T_SHIFT;
|
2015-11-05 17:41:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline unsigned int blk_qc_t_to_tag(blk_qc_t cookie)
|
|
|
|
{
|
2015-11-11 16:37:34 +00:00
|
|
|
return cookie & ((1u << BLK_QC_T_SHIFT) - 1);
|
2015-11-05 17:41:16 +00:00
|
|
|
}
|
|
|
|
|
2017-01-12 17:04:45 +00:00
|
|
|
static inline bool blk_qc_t_is_internal(blk_qc_t cookie)
|
|
|
|
{
|
|
|
|
return (cookie & BLK_QC_T_INTERNAL) != 0;
|
|
|
|
}
|
|
|
|
|
2016-11-08 04:32:37 +00:00
|
|
|
struct blk_rq_stat {
|
2017-10-07 00:55:59 +00:00
|
|
|
u64 mean;
|
2016-11-08 04:32:37 +00:00
|
|
|
u64 min;
|
|
|
|
u64 max;
|
2017-10-07 00:55:59 +00:00
|
|
|
u32 nr_samples;
|
2016-11-08 04:32:37 +00:00
|
|
|
u64 batch;
|
|
|
|
};
|
|
|
|
|
2010-08-03 11:14:58 +00:00
|
|
|
#endif /* __LINUX_BLK_TYPES_H */
|