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 */
|
2005-04-16 22:20:36 +00:00
|
|
|
#ifndef __LINUX_PERCPU_H
|
|
|
|
#define __LINUX_PERCPU_H
|
2006-09-26 06:31:21 +00:00
|
|
|
|
2014-01-23 23:52:54 +00:00
|
|
|
#include <linux/mmdebug.h>
|
2007-07-16 06:39:57 +00:00
|
|
|
#include <linux/preempt.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/smp.h>
|
2006-09-26 06:31:21 +00:00
|
|
|
#include <linux/cpumask.h>
|
2014-11-21 14:16:58 +00:00
|
|
|
#include <linux/printk.h>
|
2009-03-06 05:33:58 +00:00
|
|
|
#include <linux/pfn.h>
|
2010-03-24 08:06:43 +00:00
|
|
|
#include <linux/init.h>
|
2006-09-26 06:31:21 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <asm/percpu.h>
|
|
|
|
|
2009-03-06 05:33:58 +00:00
|
|
|
/* enough to cover all DEFINE_PER_CPUs in modules */
|
2007-05-02 17:27:11 +00:00
|
|
|
#ifdef CONFIG_MODULES
|
2009-03-06 05:33:58 +00:00
|
|
|
#define PERCPU_MODULE_RESERVE (8 << 10)
|
2007-05-02 17:27:11 +00:00
|
|
|
#else
|
2009-03-06 05:33:58 +00:00
|
|
|
#define PERCPU_MODULE_RESERVE 0
|
2005-04-16 22:20:36 +00:00
|
|
|
#endif
|
|
|
|
|
2009-02-24 02:57:21 +00:00
|
|
|
/* minimum unit size, also is the maximum supported allocation size */
|
2010-09-03 16:22:47 +00:00
|
|
|
#define PCPU_MIN_UNIT_SIZE PFN_ALIGN(32 << 10)
|
2009-02-24 02:57:21 +00:00
|
|
|
|
2017-07-24 23:02:09 +00:00
|
|
|
/* minimum allocation size and shift in bytes */
|
|
|
|
#define PCPU_MIN_ALLOC_SHIFT 2
|
|
|
|
#define PCPU_MIN_ALLOC_SIZE (1 << PCPU_MIN_ALLOC_SHIFT)
|
|
|
|
|
2017-07-24 23:02:12 +00:00
|
|
|
/*
|
2019-02-13 19:10:30 +00:00
|
|
|
* The PCPU_BITMAP_BLOCK_SIZE must be the same size as PAGE_SIZE as the
|
|
|
|
* updating of hints is used to manage the nr_empty_pop_pages in both
|
|
|
|
* the chunk and globally.
|
2017-07-24 23:02:12 +00:00
|
|
|
*/
|
|
|
|
#define PCPU_BITMAP_BLOCK_SIZE PAGE_SIZE
|
|
|
|
#define PCPU_BITMAP_BLOCK_BITS (PCPU_BITMAP_BLOCK_SIZE >> \
|
|
|
|
PCPU_MIN_ALLOC_SHIFT)
|
|
|
|
|
2010-06-27 16:50:00 +00:00
|
|
|
/*
|
|
|
|
* Percpu allocator can serve percpu allocations before slab is
|
|
|
|
* initialized which allows slab to depend on the percpu allocator.
|
|
|
|
* The following two parameters decide how much resource to
|
|
|
|
* preallocate for this. Keep PERCPU_DYNAMIC_RESERVE equal to or
|
|
|
|
* larger than PERCPU_DYNAMIC_EARLY_SIZE.
|
|
|
|
*/
|
|
|
|
#define PERCPU_DYNAMIC_EARLY_SLOTS 128
|
|
|
|
#define PERCPU_DYNAMIC_EARLY_SIZE (12 << 10)
|
|
|
|
|
2009-02-24 02:57:21 +00:00
|
|
|
/*
|
|
|
|
* PERCPU_DYNAMIC_RESERVE indicates the amount of free area to piggy
|
2009-03-06 05:33:59 +00:00
|
|
|
* back on the first chunk for dynamic percpu allocation if arch is
|
|
|
|
* manually allocating and mapping it for faster access (as a part of
|
|
|
|
* large page mapping for example).
|
2009-02-24 02:57:21 +00:00
|
|
|
*
|
2009-03-06 05:33:59 +00:00
|
|
|
* The following values give between one and two pages of free space
|
|
|
|
* after typical minimal boot (2-way SMP, single disk and NIC) with
|
|
|
|
* both defconfig and a distro config on x86_64 and 32. More
|
|
|
|
* intelligent way to determine this would be nice.
|
2009-02-24 02:57:21 +00:00
|
|
|
*/
|
2009-03-06 05:33:59 +00:00
|
|
|
#if BITS_PER_LONG > 32
|
2014-09-02 18:46:05 +00:00
|
|
|
#define PERCPU_DYNAMIC_RESERVE (28 << 10)
|
2009-03-06 05:33:59 +00:00
|
|
|
#else
|
2014-09-02 18:46:05 +00:00
|
|
|
#define PERCPU_DYNAMIC_RESERVE (20 << 10)
|
2009-03-06 05:33:59 +00:00
|
|
|
#endif
|
2009-02-24 02:57:21 +00:00
|
|
|
|
2009-02-20 07:29:08 +00:00
|
|
|
extern void *pcpu_base_addr;
|
2009-08-14 06:00:51 +00:00
|
|
|
extern const unsigned long *pcpu_unit_offsets;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
percpu: introduce pcpu_alloc_info and pcpu_group_info
Till now, non-linear cpu->unit map was expressed using an integer
array which maps each cpu to a unit and used only by lpage allocator.
Although how many units have been placed in a single contiguos area
(group) is known while building unit_map, the information is lost when
the result is recorded into the unit_map array. For lpage allocator,
as all allocations are done by lpages and whether two adjacent lpages
are in the same group or not is irrelevant, this didn't cause any
problem. Non-linear cpu->unit mapping will be used for sparse
embedding and this grouping information is necessary for that.
This patch introduces pcpu_alloc_info which contains all the
information necessary for initializing percpu allocator.
pcpu_alloc_info contains array of pcpu_group_info which describes how
units are grouped and mapped to cpus. pcpu_group_info also has
base_offset field to specify its offset from the chunk's base address.
pcpu_build_alloc_info() initializes this field as if all groups are
allocated back-to-back as is currently done but this will be used to
sparsely place groups.
pcpu_alloc_info is a rather complex data structure which contains a
flexible array which in turn points to nested cpu_map arrays.
* pcpu_alloc_alloc_info() and pcpu_free_alloc_info() are provided to
help dealing with pcpu_alloc_info.
* pcpu_lpage_build_unit_map() is updated to build pcpu_alloc_info,
generalized and renamed to pcpu_build_alloc_info().
@cpu_distance_fn may be NULL indicating that all cpus are of
LOCAL_DISTANCE.
* pcpul_lpage_dump_cfg() is updated to process pcpu_alloc_info,
generalized and renamed to pcpu_dump_alloc_info(). It now also
prints which group each alloc unit belongs to.
* pcpu_setup_first_chunk() now takes pcpu_alloc_info instead of the
separate parameters. All first chunk allocators are updated to use
pcpu_build_alloc_info() to build alloc_info and call
pcpu_setup_first_chunk() with it. This has the side effect of
packing units for sparse possible cpus. ie. if cpus 0, 2 and 4 are
possible, they'll be assigned unit 0, 1 and 2 instead of 0, 2 and 4.
* x86 setup_pcpu_lpage() is updated to deal with alloc_info.
* sparc64 setup_per_cpu_areas() is updated to build alloc_info.
Although the changes made by this patch are pretty pervasive, it
doesn't cause any behavior difference other than packing of sparse
cpus. It mostly changes how information is passed among
initialization functions and makes room for more flexibility.
Signed-off-by: Tejun Heo <tj@kernel.org>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: David Miller <davem@davemloft.net>
2009-08-14 06:00:51 +00:00
|
|
|
struct pcpu_group_info {
|
|
|
|
int nr_units; /* aligned # of units */
|
|
|
|
unsigned long base_offset; /* base address offset */
|
|
|
|
unsigned int *cpu_map; /* unit->cpu map, empty
|
|
|
|
* entries contain NR_CPUS */
|
|
|
|
};
|
|
|
|
|
|
|
|
struct pcpu_alloc_info {
|
|
|
|
size_t static_size;
|
|
|
|
size_t reserved_size;
|
|
|
|
size_t dyn_size;
|
|
|
|
size_t unit_size;
|
|
|
|
size_t atom_size;
|
|
|
|
size_t alloc_size;
|
|
|
|
size_t __ai_size; /* internal, don't use */
|
|
|
|
int nr_groups; /* 0 if grouping unnecessary */
|
|
|
|
struct pcpu_group_info groups[];
|
|
|
|
};
|
|
|
|
|
2009-08-14 06:00:50 +00:00
|
|
|
enum pcpu_fc {
|
|
|
|
PCPU_FC_AUTO,
|
|
|
|
PCPU_FC_EMBED,
|
|
|
|
PCPU_FC_PAGE,
|
|
|
|
|
|
|
|
PCPU_FC_NR,
|
|
|
|
};
|
2012-10-05 00:12:07 +00:00
|
|
|
extern const char * const pcpu_fc_names[PCPU_FC_NR];
|
2009-08-14 06:00:50 +00:00
|
|
|
|
|
|
|
extern enum pcpu_fc pcpu_chosen_fc;
|
|
|
|
|
2009-08-14 06:00:50 +00:00
|
|
|
typedef void * (*pcpu_fc_alloc_fn_t)(unsigned int cpu, size_t size,
|
|
|
|
size_t align);
|
2009-07-03 23:10:59 +00:00
|
|
|
typedef void (*pcpu_fc_free_fn_t)(void *ptr, size_t size);
|
|
|
|
typedef void (*pcpu_fc_populate_pte_fn_t)(unsigned long addr);
|
2009-07-03 23:11:00 +00:00
|
|
|
typedef int (pcpu_fc_cpu_distance_fn_t)(unsigned int from, unsigned int to);
|
2009-02-20 07:29:08 +00:00
|
|
|
|
percpu: introduce pcpu_alloc_info and pcpu_group_info
Till now, non-linear cpu->unit map was expressed using an integer
array which maps each cpu to a unit and used only by lpage allocator.
Although how many units have been placed in a single contiguos area
(group) is known while building unit_map, the information is lost when
the result is recorded into the unit_map array. For lpage allocator,
as all allocations are done by lpages and whether two adjacent lpages
are in the same group or not is irrelevant, this didn't cause any
problem. Non-linear cpu->unit mapping will be used for sparse
embedding and this grouping information is necessary for that.
This patch introduces pcpu_alloc_info which contains all the
information necessary for initializing percpu allocator.
pcpu_alloc_info contains array of pcpu_group_info which describes how
units are grouped and mapped to cpus. pcpu_group_info also has
base_offset field to specify its offset from the chunk's base address.
pcpu_build_alloc_info() initializes this field as if all groups are
allocated back-to-back as is currently done but this will be used to
sparsely place groups.
pcpu_alloc_info is a rather complex data structure which contains a
flexible array which in turn points to nested cpu_map arrays.
* pcpu_alloc_alloc_info() and pcpu_free_alloc_info() are provided to
help dealing with pcpu_alloc_info.
* pcpu_lpage_build_unit_map() is updated to build pcpu_alloc_info,
generalized and renamed to pcpu_build_alloc_info().
@cpu_distance_fn may be NULL indicating that all cpus are of
LOCAL_DISTANCE.
* pcpul_lpage_dump_cfg() is updated to process pcpu_alloc_info,
generalized and renamed to pcpu_dump_alloc_info(). It now also
prints which group each alloc unit belongs to.
* pcpu_setup_first_chunk() now takes pcpu_alloc_info instead of the
separate parameters. All first chunk allocators are updated to use
pcpu_build_alloc_info() to build alloc_info and call
pcpu_setup_first_chunk() with it. This has the side effect of
packing units for sparse possible cpus. ie. if cpus 0, 2 and 4 are
possible, they'll be assigned unit 0, 1 and 2 instead of 0, 2 and 4.
* x86 setup_pcpu_lpage() is updated to deal with alloc_info.
* sparc64 setup_per_cpu_areas() is updated to build alloc_info.
Although the changes made by this patch are pretty pervasive, it
doesn't cause any behavior difference other than packing of sparse
cpus. It mostly changes how information is passed among
initialization functions and makes room for more flexibility.
Signed-off-by: Tejun Heo <tj@kernel.org>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: David Miller <davem@davemloft.net>
2009-08-14 06:00:51 +00:00
|
|
|
extern struct pcpu_alloc_info * __init pcpu_alloc_alloc_info(int nr_groups,
|
|
|
|
int nr_units);
|
|
|
|
extern void __init pcpu_free_alloc_info(struct pcpu_alloc_info *ai);
|
|
|
|
|
2009-08-14 06:00:51 +00:00
|
|
|
extern int __init pcpu_setup_first_chunk(const struct pcpu_alloc_info *ai,
|
|
|
|
void *base_addr);
|
2009-02-24 02:57:21 +00:00
|
|
|
|
2009-08-14 06:00:49 +00:00
|
|
|
#ifdef CONFIG_NEED_PER_CPU_EMBED_FIRST_CHUNK
|
2010-06-27 16:49:59 +00:00
|
|
|
extern int __init pcpu_embed_first_chunk(size_t reserved_size, size_t dyn_size,
|
2009-08-14 06:00:52 +00:00
|
|
|
size_t atom_size,
|
|
|
|
pcpu_fc_cpu_distance_fn_t cpu_distance_fn,
|
|
|
|
pcpu_fc_alloc_fn_t alloc_fn,
|
|
|
|
pcpu_fc_free_fn_t free_fn);
|
2009-08-14 06:00:49 +00:00
|
|
|
#endif
|
2009-03-10 07:27:48 +00:00
|
|
|
|
2009-08-14 06:00:49 +00:00
|
|
|
#ifdef CONFIG_NEED_PER_CPU_PAGE_FIRST_CHUNK
|
2009-08-14 06:00:51 +00:00
|
|
|
extern int __init pcpu_page_first_chunk(size_t reserved_size,
|
2009-07-03 23:10:59 +00:00
|
|
|
pcpu_fc_alloc_fn_t alloc_fn,
|
|
|
|
pcpu_fc_free_fn_t free_fn,
|
|
|
|
pcpu_fc_populate_pte_fn_t populate_pte_fn);
|
2009-08-14 06:00:49 +00:00
|
|
|
#endif
|
2009-07-03 23:10:59 +00:00
|
|
|
|
2009-10-29 13:34:15 +00:00
|
|
|
extern void __percpu *__alloc_reserved_percpu(size_t size, size_t align);
|
2017-02-27 14:37:36 +00:00
|
|
|
extern bool __is_kernel_percpu_address(unsigned long addr, unsigned long *can_addr);
|
2010-03-10 09:57:54 +00:00
|
|
|
extern bool is_kernel_percpu_address(unsigned long addr);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2010-09-03 16:22:48 +00:00
|
|
|
#if !defined(CONFIG_SMP) || !defined(CONFIG_HAVE_SETUP_PER_CPU_AREA)
|
2009-03-30 10:07:44 +00:00
|
|
|
extern void __init setup_per_cpu_areas(void);
|
|
|
|
#endif
|
|
|
|
|
2014-09-02 18:46:04 +00:00
|
|
|
extern void __percpu *__alloc_percpu_gfp(size_t size, size_t align, gfp_t gfp);
|
2010-03-24 08:06:43 +00:00
|
|
|
extern void __percpu *__alloc_percpu(size_t size, size_t align);
|
|
|
|
extern void free_percpu(void __percpu *__pdata);
|
|
|
|
extern phys_addr_t per_cpu_ptr_to_phys(void *addr);
|
|
|
|
|
2014-09-02 18:46:04 +00:00
|
|
|
#define alloc_percpu_gfp(type, gfp) \
|
|
|
|
(typeof(type) __percpu *)__alloc_percpu_gfp(sizeof(type), \
|
|
|
|
__alignof__(type), gfp)
|
|
|
|
#define alloc_percpu(type) \
|
|
|
|
(typeof(type) __percpu *)__alloc_percpu(sizeof(type), \
|
|
|
|
__alignof__(type))
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2018-08-22 04:53:58 +00:00
|
|
|
extern unsigned long pcpu_nr_pages(void);
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
#endif /* __LINUX_PERCPU_H */
|