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 21:07:57 +07:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2008-01-24 14:52:45 +07:00
|
|
|
#ifndef IOCONTEXT_H
|
|
|
|
#define IOCONTEXT_H
|
|
|
|
|
2008-01-24 14:44:49 +07:00
|
|
|
#include <linux/radix-tree.h>
|
2008-04-02 19:31:02 +07:00
|
|
|
#include <linux/rcupdate.h>
|
2011-12-14 06:33:39 +07:00
|
|
|
#include <linux/workqueue.h>
|
2008-01-24 14:44:49 +07:00
|
|
|
|
2011-12-14 06:33:38 +07:00
|
|
|
enum {
|
block: exit_io_context() should call elevator_exit_icq_fn()
While updating locking, b2efa05265 "block, cfq: unlink
cfq_io_context's immediately" moved elevator_exit_icq_fn() invocation
from exit_io_context() to the final ioc put. While this doesn't cause
catastrophic failure, it effectively removes task exit notification to
elevator and cause noticeable IO performance degradation with CFQ.
On task exit, CFQ used to immediately expire the slice if it was being
used by the exiting task as no more IO would be issued by the task;
however, after b2efa05265, the notification is lost and disk could sit
idle needlessly, leading to noticeable IO performance degradation for
certain workloads.
This patch renames ioc_exit_icq() to ioc_destroy_icq(), separates
elevator_exit_icq_fn() invocation into ioc_exit_icq() and invokes it
from exit_io_context(). ICQ_EXITED flag is added to avoid invoking
the callback more than once for the same icq.
Walking icq_list from ioc side and invoking elevator callback requires
reverse double locking. This may be better implemented using RCU;
unfortunately, using RCU isn't trivial. e.g. RCU protection would
need to cover request_queue and queue_lock switch on cleanup makes
grabbing queue_lock from RCU unsafe. Reverse double locking should
do, at least for now.
Signed-off-by: Tejun Heo <tj@kernel.org>
Reported-and-bisected-by: Shaohua Li <shli@kernel.org>
LKML-Reference: <CANejiEVzs=pUhQSTvUppkDcc2TNZyfohBRLygW5zFmXyk5A-xQ@mail.gmail.com>
Tested-by: Shaohua Li <shaohua.li@intel.com>
Signed-off-by: Jens Axboe <axboe@kernel.dk>
2012-02-15 15:45:53 +07:00
|
|
|
ICQ_EXITED = 1 << 2,
|
2011-12-14 06:33:38 +07:00
|
|
|
};
|
|
|
|
|
2011-12-14 06:33:42 +07:00
|
|
|
/*
|
|
|
|
* An io_cq (icq) is association between an io_context (ioc) and a
|
|
|
|
* request_queue (q). This is used by elevators which need to track
|
|
|
|
* information per ioc - q pair.
|
|
|
|
*
|
|
|
|
* Elevator can request use of icq by setting elevator_type->icq_size and
|
|
|
|
* ->icq_align. Both size and align must be larger than that of struct
|
|
|
|
* io_cq and elevator can use the tail area for private information. The
|
|
|
|
* recommended way to do this is defining a struct which contains io_cq as
|
|
|
|
* the first member followed by private members and using its size and
|
|
|
|
* align. For example,
|
|
|
|
*
|
|
|
|
* struct snail_io_cq {
|
|
|
|
* struct io_cq icq;
|
|
|
|
* int poke_snail;
|
|
|
|
* int feed_snail;
|
|
|
|
* };
|
|
|
|
*
|
|
|
|
* struct elevator_type snail_elv_type {
|
|
|
|
* .ops = { ... },
|
|
|
|
* .icq_size = sizeof(struct snail_io_cq),
|
|
|
|
* .icq_align = __alignof__(struct snail_io_cq),
|
|
|
|
* ...
|
|
|
|
* };
|
|
|
|
*
|
|
|
|
* If icq_size is set, block core will manage icq's. All requests will
|
|
|
|
* have its ->elv.icq field set before elevator_ops->elevator_set_req_fn()
|
|
|
|
* is called and be holding a reference to the associated io_context.
|
|
|
|
*
|
|
|
|
* Whenever a new icq is created, elevator_ops->elevator_init_icq_fn() is
|
|
|
|
* called and, on destruction, ->elevator_exit_icq_fn(). Both functions
|
|
|
|
* are called with both the associated io_context and queue locks held.
|
|
|
|
*
|
|
|
|
* Elevator is allowed to lookup icq using ioc_lookup_icq() while holding
|
|
|
|
* queue lock but the returned icq is valid only until the queue lock is
|
|
|
|
* released. Elevators can not and should not try to create or destroy
|
|
|
|
* icq's.
|
|
|
|
*
|
|
|
|
* As icq's are linked from both ioc and q, the locking rules are a bit
|
|
|
|
* complex.
|
|
|
|
*
|
|
|
|
* - ioc lock nests inside q lock.
|
|
|
|
*
|
|
|
|
* - ioc->icq_list and icq->ioc_node are protected by ioc lock.
|
|
|
|
* q->icq_list and icq->q_node by q lock.
|
|
|
|
*
|
|
|
|
* - ioc->icq_tree and ioc->icq_hint are protected by ioc lock, while icq
|
|
|
|
* itself is protected by q lock. However, both the indexes and icq
|
|
|
|
* itself are also RCU managed and lookup can be performed holding only
|
|
|
|
* the q lock.
|
|
|
|
*
|
|
|
|
* - icq's are not reference counted. They are destroyed when either the
|
|
|
|
* ioc or q goes away. Each request with icq set holds an extra
|
|
|
|
* reference to ioc to ensure it stays until the request is completed.
|
|
|
|
*
|
|
|
|
* - Linking and unlinking icq's are performed while holding both ioc and q
|
|
|
|
* locks. Due to the lock ordering, q exit is simple but ioc exit
|
|
|
|
* requires reverse-order double lock dance.
|
|
|
|
*/
|
2011-12-14 06:33:41 +07:00
|
|
|
struct io_cq {
|
|
|
|
struct request_queue *q;
|
|
|
|
struct io_context *ioc;
|
2008-01-24 14:52:45 +07:00
|
|
|
|
2011-12-14 06:33:42 +07:00
|
|
|
/*
|
|
|
|
* q_node and ioc_node link io_cq through icq_list of q and ioc
|
|
|
|
* respectively. Both fields are unused once ioc_exit_icq() is
|
|
|
|
* called and shared with __rcu_icq_cache and __rcu_head which are
|
|
|
|
* used for RCU free of io_cq.
|
|
|
|
*/
|
|
|
|
union {
|
|
|
|
struct list_head q_node;
|
|
|
|
struct kmem_cache *__rcu_icq_cache;
|
|
|
|
};
|
|
|
|
union {
|
|
|
|
struct hlist_node ioc_node;
|
|
|
|
struct rcu_head __rcu_head;
|
|
|
|
};
|
2011-12-14 06:33:38 +07:00
|
|
|
|
2012-02-15 15:45:49 +07:00
|
|
|
unsigned int flags;
|
2008-01-24 14:52:45 +07:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
2008-01-24 14:53:35 +07:00
|
|
|
* I/O subsystem state of the associated processes. It is refcounted
|
|
|
|
* and kmalloc'ed. These could be shared between processes.
|
2008-01-24 14:52:45 +07:00
|
|
|
*/
|
|
|
|
struct io_context {
|
2009-06-11 02:57:06 +07:00
|
|
|
atomic_long_t refcount;
|
2012-03-06 04:15:26 +07:00
|
|
|
atomic_t active_ref;
|
2008-01-24 14:53:35 +07:00
|
|
|
atomic_t nr_tasks;
|
|
|
|
|
|
|
|
/* all the fields below are protected by this lock */
|
|
|
|
spinlock_t lock;
|
2008-01-24 14:52:45 +07:00
|
|
|
|
|
|
|
unsigned short ioprio;
|
2009-12-04 00:59:42 +07:00
|
|
|
|
2008-01-24 14:52:45 +07:00
|
|
|
/*
|
|
|
|
* For request batching
|
|
|
|
*/
|
|
|
|
int nr_batch_requests; /* Number of requests left in the batch */
|
2010-02-26 20:00:43 +07:00
|
|
|
unsigned long last_waited; /* Time last woken after wait for request */
|
2008-01-24 14:52:45 +07:00
|
|
|
|
2011-12-14 06:33:41 +07:00
|
|
|
struct radix_tree_root icq_tree;
|
|
|
|
struct io_cq __rcu *icq_hint;
|
|
|
|
struct hlist_head icq_list;
|
2011-12-14 06:33:39 +07:00
|
|
|
|
|
|
|
struct work_struct release_work;
|
2008-01-24 14:52:45 +07:00
|
|
|
};
|
|
|
|
|
2012-03-06 04:15:26 +07:00
|
|
|
/**
|
|
|
|
* get_io_context_active - get active reference on ioc
|
|
|
|
* @ioc: ioc of interest
|
|
|
|
*
|
|
|
|
* Only iocs with active reference can issue new IOs. This function
|
|
|
|
* acquires an active reference on @ioc. The caller must already have an
|
|
|
|
* active reference on @ioc.
|
|
|
|
*/
|
|
|
|
static inline void get_io_context_active(struct io_context *ioc)
|
2008-01-24 14:53:35 +07:00
|
|
|
{
|
2012-03-06 04:15:25 +07:00
|
|
|
WARN_ON_ONCE(atomic_long_read(&ioc->refcount) <= 0);
|
2012-03-06 04:15:26 +07:00
|
|
|
WARN_ON_ONCE(atomic_read(&ioc->active_ref) <= 0);
|
2012-03-06 04:15:25 +07:00
|
|
|
atomic_long_inc(&ioc->refcount);
|
2012-03-06 04:15:26 +07:00
|
|
|
atomic_inc(&ioc->active_ref);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void ioc_task_link(struct io_context *ioc)
|
|
|
|
{
|
|
|
|
get_io_context_active(ioc);
|
|
|
|
|
|
|
|
WARN_ON_ONCE(atomic_read(&ioc->nr_tasks) <= 0);
|
2012-03-06 04:15:25 +07:00
|
|
|
atomic_inc(&ioc->nr_tasks);
|
2008-01-24 14:53:35 +07:00
|
|
|
}
|
|
|
|
|
2009-12-04 20:52:42 +07:00
|
|
|
struct task_struct;
|
2008-07-01 01:42:08 +07:00
|
|
|
#ifdef CONFIG_BLOCK
|
2012-02-07 13:51:30 +07:00
|
|
|
void put_io_context(struct io_context *ioc);
|
2012-03-06 04:15:26 +07:00
|
|
|
void put_io_context_active(struct io_context *ioc);
|
2009-12-04 20:52:42 +07:00
|
|
|
void exit_io_context(struct task_struct *task);
|
block: make ioc get/put interface more conventional and fix race on alloction
Ignoring copy_io() during fork, io_context can be allocated from two
places - current_io_context() and set_task_ioprio(). The former is
always called from local task while the latter can be called from
different task. The synchornization between them are peculiar and
dubious.
* current_io_context() doesn't grab task_lock() and assumes that if it
saw %NULL ->io_context, it would stay that way until allocation and
assignment is complete. It has smp_wmb() between alloc/init and
assignment.
* set_task_ioprio() grabs task_lock() for assignment and does
smp_read_barrier_depends() between "ioc = task->io_context" and "if
(ioc)". Unfortunately, this doesn't achieve anything - the latter
is not a dependent load of the former. ie, if ioc itself were being
dereferenced "ioc->xxx", it would mean something (not sure what tho)
but as the code currently stands, the dependent read barrier is
noop.
As only one of the the two test-assignment sequences is task_lock()
protected, the task_lock() can't do much about race between the two.
Nothing prevents current_io_context() and set_task_ioprio() allocating
its own ioc for the same task and overwriting the other's.
Also, set_task_ioprio() can race with exiting task and create a new
ioc after exit_io_context() is finished.
ioc get/put doesn't have any reason to be complex. The only hot path
is accessing the existing ioc of %current, which is simple to achieve
given that ->io_context is never destroyed as long as the task is
alive. All other paths can happily go through task_lock() like all
other task sub structures without impacting anything.
This patch updates ioc get/put so that it becomes more conventional.
* alloc_io_context() is replaced with get_task_io_context(). This is
the only interface which can acquire access to ioc of another task.
On return, the caller has an explicit reference to the object which
should be put using put_io_context() afterwards.
* The functionality of current_io_context() remains the same but when
creating a new ioc, it shares the code path with
get_task_io_context() and always goes through task_lock().
* get_io_context() now means incrementing ref on an ioc which the
caller already has access to (be that an explicit refcnt or implicit
%current one).
* PF_EXITING inhibits creation of new io_context and once
exit_io_context() is finished, it's guaranteed that both ioc
acquisition functions return %NULL.
* All users are updated. Most are trivial but
smp_read_barrier_depends() removal from cfq_get_io_context() needs a
bit of explanation. I suppose the original intention was to ensure
ioc->ioprio is visible when set_task_ioprio() allocates new
io_context and installs it; however, this wouldn't have worked
because set_task_ioprio() doesn't have wmb between init and install.
There are other problems with this which will be fixed in another
patch.
* While at it, use NUMA_NO_NODE instead of -1 for wildcard node
specification.
-v2: Vivek spotted contamination from debug patch. Removed.
Signed-off-by: Tejun Heo <tj@kernel.org>
Cc: Vivek Goyal <vgoyal@redhat.com>
Signed-off-by: Jens Axboe <axboe@kernel.dk>
2011-12-14 06:33:38 +07:00
|
|
|
struct io_context *get_task_io_context(struct task_struct *task,
|
|
|
|
gfp_t gfp_flags, int node);
|
2008-07-01 01:42:08 +07:00
|
|
|
#else
|
|
|
|
struct io_context;
|
2012-02-07 13:51:30 +07:00
|
|
|
static inline void put_io_context(struct io_context *ioc) { }
|
2011-12-14 06:33:37 +07:00
|
|
|
static inline void exit_io_context(struct task_struct *task) { }
|
2008-07-01 01:42:08 +07:00
|
|
|
#endif
|
|
|
|
|
2008-01-24 14:52:45 +07:00
|
|
|
#endif
|