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 15:07:57 +01:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2015-12-01 09:06:30 +05:30
|
|
|
#ifndef _ASM_POWERPC_BOOK3S_64_HASH_4K_H
|
|
|
|
|
#define _ASM_POWERPC_BOOK3S_64_HASH_4K_H
|
2018-11-27 19:18:05 +11:00
|
|
|
|
2019-03-14 23:54:53 +11:00
|
|
|
#define H_PTE_INDEX_SIZE 9 // size: 8B << 9 = 4KB, maps: 2^9 x 4KB = 2MB
|
|
|
|
|
#define H_PMD_INDEX_SIZE 7 // size: 8B << 7 = 1KB, maps: 2^7 x 2MB = 256MB
|
|
|
|
|
#define H_PUD_INDEX_SIZE 9 // size: 8B << 9 = 4KB, maps: 2^9 x 256MB = 128GB
|
|
|
|
|
#define H_PGD_INDEX_SIZE 9 // size: 8B << 9 = 4KB, maps: 2^9 x 128GB = 64TB
|
2015-12-01 09:06:30 +05:30
|
|
|
|
2018-03-26 15:34:48 +05:30
|
|
|
/*
|
|
|
|
|
* Each context is 512TB. But on 4k we restrict our max TASK size to 64TB
|
|
|
|
|
* Hence also limit max EA bits to 64TB.
|
|
|
|
|
*/
|
|
|
|
|
#define MAX_EA_BITS_PER_CONTEXT 46
|
|
|
|
|
|
2019-04-17 18:29:17 +05:30
|
|
|
|
2019-04-17 18:29:14 +05:30
|
|
|
/*
|
2020-06-08 12:39:03 +05:30
|
|
|
* Our page table limit us to 64TB. For 64TB physical memory, we only need 64GB
|
|
|
|
|
* of vmemmap space. To better support sparse memory layout, we use 61TB
|
|
|
|
|
* linear map range, 1TB of vmalloc, 1TB of I/O and 1TB of vmememmap.
|
2019-04-17 18:29:14 +05:30
|
|
|
*/
|
2020-06-08 12:39:03 +05:30
|
|
|
#define REGION_SHIFT (40)
|
2019-04-17 18:29:17 +05:30
|
|
|
#define H_KERN_MAP_SIZE (ASM_CONST(1) << REGION_SHIFT)
|
2019-04-17 18:29:14 +05:30
|
|
|
|
2020-06-08 12:39:04 +05:30
|
|
|
/*
|
|
|
|
|
* Limits the linear mapping range
|
|
|
|
|
*/
|
|
|
|
|
#define H_MAX_PHYSMEM_BITS 46
|
|
|
|
|
|
2019-04-17 18:29:14 +05:30
|
|
|
/*
|
2020-06-08 12:39:03 +05:30
|
|
|
* Define the address range of the kernel non-linear virtual area (61TB)
|
2019-04-17 18:29:14 +05:30
|
|
|
*/
|
2020-06-08 12:39:03 +05:30
|
|
|
#define H_KERN_VIRT_START ASM_CONST(0xc0003d0000000000)
|
2019-04-17 18:29:14 +05:30
|
|
|
|
2015-12-01 09:06:30 +05:30
|
|
|
#ifndef __ASSEMBLY__
|
2016-04-29 23:25:49 +10:00
|
|
|
#define H_PTE_TABLE_SIZE (sizeof(pte_t) << H_PTE_INDEX_SIZE)
|
|
|
|
|
#define H_PMD_TABLE_SIZE (sizeof(pmd_t) << H_PMD_INDEX_SIZE)
|
|
|
|
|
#define H_PUD_TABLE_SIZE (sizeof(pud_t) << H_PUD_INDEX_SIZE)
|
|
|
|
|
#define H_PGD_TABLE_SIZE (sizeof(pgd_t) << H_PGD_INDEX_SIZE)
|
2015-12-01 09:06:30 +05:30
|
|
|
|
2020-07-09 08:59:27 +05:30
|
|
|
#define H_PAGE_F_GIX_SHIFT _PAGE_PA_MAX
|
|
|
|
|
#define H_PAGE_F_SECOND _RPAGE_PKEY_BIT0 /* HPTE is in 2ndary HPTEG */
|
|
|
|
|
#define H_PAGE_F_GIX (_RPAGE_RPN43 | _RPAGE_RPN42 | _RPAGE_RPN41)
|
|
|
|
|
#define H_PAGE_BUSY _RPAGE_RSV1
|
|
|
|
|
#define H_PAGE_HASHPTE _RPAGE_PKEY_BIT4
|
powerpc: Free up four 64K PTE bits in 4K backed HPTE pages
Rearrange 64K PTE bits to free up bits 3, 4, 5 and 6,
in the 4K backed HPTE pages.These bits continue to be used
for 64K backed HPTE pages in this patch, but will be freed
up in the next patch. The bit numbers are big-endian as
defined in the ISA3.0
The patch does the following change to the 4k HTPE backed
64K PTE's format.
H_PAGE_BUSY moves from bit 3 to bit 9 (B bit in the figure
below)
V0 which occupied bit 4 is not used anymore.
V1 which occupied bit 5 is not used anymore.
V2 which occupied bit 6 is not used anymore.
V3 which occupied bit 7 is not used anymore.
Before the patch, the 4k backed 64k PTE format was as follows
0 1 2 3 4 5 6 7 8 9 10...........................63
: : : : : : : : : : : :
v v v v v v v v v v v v
,-,-,-,-,--,--,--,--,-,-,-,-,-,------------------,-,-,-,
|x|x|x|B|V0|V1|V2|V3|x| | |x|x|................|x|x|x|x| <- primary pte
'_'_'_'_'__'__'__'__'_'_'_'_'_'________________'_'_'_'_'
|S|G|I|X|S |G |I |X |S|G|I|X|..................|S|G|I|X| <- secondary pte
'_'_'_'_'__'__'__'__'_'_'_'_'__________________'_'_'_'_'
After the patch, the 4k backed 64k PTE format is as follows
0 1 2 3 4 5 6 7 8 9 10...........................63
: : : : : : : : : : : :
v v v v v v v v v v v v
,-,-,-,-,--,--,--,--,-,-,-,-,-,------------------,-,-,-,
|x|x|x| | | | | |x|B| |x|x|................|.|.|.|.| <- primary pte
'_'_'_'_'__'__'__'__'_'_'_'_'_'________________'_'_'_'_'
|S|G|I|X|S |G |I |X |S|G|I|X|..................|S|G|I|X| <- secondary pte
'_'_'_'_'__'__'__'__'_'_'_'_'__________________'_'_'_'_'
the four bits S,G,I,X (one quadruplet per 4k HPTE) that
cache the hash-bucket slot value, is initialized to
1,1,1,1 indicating -- an invalid slot. If a HPTE gets
cached in a 1111 slot(i.e 7th slot of secondary hash
bucket), it is released immediately. In other words,
even though 1111 is a valid slot value in the hash
bucket, we consider it invalid and release the slot and
the HPTE. This gives us the opportunity to determine
the validity of S,G,I,X bits based on its contents and
not on any of the bits V0,V1,V2 or V3 in the primary PTE
When we release a HPTE cached in the 1111 slot
we also release a legitimate slot in the primary
hash bucket and unmap its corresponding HPTE. This
is to ensure that we do get a HPTE cached in a slot
of the primary hash bucket, the next time we retry.
Though treating 1111 slot as invalid, reduces the
number of available slots in the hash bucket and may
have an effect on the performance, the probabilty of
hitting a 1111 slot is extermely low.
Compared to the current scheme, the above scheme
reduces the number of false hash table updates
significantly and has the added advantage of releasing
four valuable PTE bits for other purpose.
NOTE:even though bits 3, 4, 5, 6, 7 are not used when
the 64K PTE is backed by 4k HPTE, they continue to be
used if the PTE gets backed by 64k HPTE. The next
patch will decouple that aswell, and truely release the
bits.
This idea was jointly developed by Paul Mackerras,
Aneesh, Michael Ellermen and myself.
4K PTE format remains unchanged currently.
The patch does the following code changes
a) PTE flags are split between 64k and 4k header files.
b) __hash_page_4K() is reimplemented to reflect the
above logic.
Acked-by: Balbir Singh <bsingharora@gmail.com>
Reviewed-by: Aneesh Kumar K.V <aneesh.kumar@linux.vnet.ibm.com>
Signed-off-by: Ram Pai <linuxram@us.ibm.com>
Signed-off-by: Michael Ellerman <mpe@ellerman.id.au>
2017-11-06 00:50:47 -08:00
|
|
|
|
2009-03-10 17:53:29 +00:00
|
|
|
/* PTE flags to conserve for HPTE identification */
|
2016-04-29 23:25:45 +10:00
|
|
|
#define _PAGE_HPTEFLAGS (H_PAGE_BUSY | H_PAGE_HASHPTE | \
|
|
|
|
|
H_PAGE_F_SECOND | H_PAGE_F_GIX)
|
|
|
|
|
/*
|
|
|
|
|
* Not supported by 4k linux page size
|
|
|
|
|
*/
|
|
|
|
|
#define H_PAGE_4K_PFN 0x0
|
|
|
|
|
#define H_PAGE_THP_HUGE 0x0
|
|
|
|
|
#define H_PAGE_COMBO 0x0
|
2018-04-16 16:57:20 +05:30
|
|
|
|
|
|
|
|
/* 8 bytes per each pte entry */
|
|
|
|
|
#define H_PTE_FRAG_SIZE_SHIFT (H_PTE_INDEX_SIZE + 3)
|
|
|
|
|
#define H_PTE_FRAG_NR (PAGE_SIZE >> H_PTE_FRAG_SIZE_SHIFT)
|
2018-04-16 16:57:22 +05:30
|
|
|
#define H_PMD_FRAG_SIZE_SHIFT (H_PMD_INDEX_SIZE + 3)
|
|
|
|
|
#define H_PMD_FRAG_NR (PAGE_SIZE >> H_PMD_FRAG_SIZE_SHIFT)
|
2018-03-07 19:06:44 +05:30
|
|
|
|
|
|
|
|
/* memory key bits, only 8 keys supported */
|
2020-07-09 08:59:25 +05:30
|
|
|
#define H_PTE_PKEY_BIT4 0
|
|
|
|
|
#define H_PTE_PKEY_BIT3 0
|
2020-07-09 08:59:27 +05:30
|
|
|
#define H_PTE_PKEY_BIT2 _RPAGE_PKEY_BIT3
|
|
|
|
|
#define H_PTE_PKEY_BIT1 _RPAGE_PKEY_BIT2
|
|
|
|
|
#define H_PTE_PKEY_BIT0 _RPAGE_PKEY_BIT1
|
2020-07-09 08:59:25 +05:30
|
|
|
|
2018-03-07 19:06:44 +05:30
|
|
|
|
2015-12-01 09:06:30 +05:30
|
|
|
/*
|
2016-03-01 09:45:13 +05:30
|
|
|
* On all 4K setups, remap_4k_pfn() equates to remap_pfn_range()
|
2015-12-01 09:06:30 +05:30
|
|
|
*/
|
|
|
|
|
#define remap_4k_pfn(vma, addr, pfn, prot) \
|
|
|
|
|
remap_pfn_range((vma), (addr), (pfn), PAGE_SIZE, (prot))
|
|
|
|
|
|
2024-08-21 18:07:29 +10:00
|
|
|
/*
|
|
|
|
|
* With 4K page size the real_pte machinery is all nops.
|
|
|
|
|
*/
|
2025-01-12 19:24:46 +01:00
|
|
|
static inline real_pte_t __real_pte(pte_t pte, pte_t *ptep, int offset)
|
|
|
|
|
{
|
|
|
|
|
return (real_pte_t){pte};
|
|
|
|
|
}
|
|
|
|
|
|
2024-08-21 18:07:29 +10:00
|
|
|
#define __rpte_to_pte(r) ((r).pte)
|
2025-01-12 19:24:46 +01:00
|
|
|
|
|
|
|
|
static inline unsigned long __rpte_to_hidx(real_pte_t rpte, unsigned long index)
|
|
|
|
|
{
|
|
|
|
|
return pte_val(__rpte_to_pte(rpte)) >> H_PAGE_F_GIX_SHIFT;
|
|
|
|
|
}
|
2024-08-21 18:07:29 +10:00
|
|
|
|
|
|
|
|
#define pte_iterate_hashed_subpages(rpte, psize, va, index, shift) \
|
|
|
|
|
do { \
|
|
|
|
|
index = 0; \
|
|
|
|
|
shift = mmu_psize_defs[psize].shift; \
|
|
|
|
|
|
|
|
|
|
#define pte_iterate_hashed_end() } while(0)
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* We expect this to be called only for user addresses or kernel virtual
|
|
|
|
|
* addresses other than the linear mapping.
|
|
|
|
|
*/
|
|
|
|
|
#define pte_pagesize_index(mm, addr, pte) MMU_PAGE_4K
|
|
|
|
|
|
2017-11-06 00:50:45 -08:00
|
|
|
/*
|
|
|
|
|
* 4K PTE format is different from 64K PTE format. Saving the hash_slot is just
|
|
|
|
|
* a matter of returning the PTE bits that need to be modified. On 64K PTE,
|
|
|
|
|
* things are a little more involved and hence needs many more parameters to
|
|
|
|
|
* accomplish the same. However we want to abstract this out from the caller by
|
|
|
|
|
* keeping the prototype consistent across the two formats.
|
|
|
|
|
*/
|
|
|
|
|
static inline unsigned long pte_set_hidx(pte_t *ptep, real_pte_t rpte,
|
2018-02-11 20:30:08 +05:30
|
|
|
unsigned int subpg_index, unsigned long hidx,
|
|
|
|
|
int offset)
|
2017-11-06 00:50:45 -08:00
|
|
|
{
|
|
|
|
|
return (hidx << H_PAGE_F_GIX_SHIFT) &
|
|
|
|
|
(H_PAGE_F_SECOND | H_PAGE_F_GIX);
|
|
|
|
|
}
|
|
|
|
|
|
2016-04-29 23:26:31 +10:00
|
|
|
#ifdef CONFIG_TRANSPARENT_HUGEPAGE
|
|
|
|
|
|
|
|
|
|
static inline char *get_hpte_slot_array(pmd_t *pmdp)
|
|
|
|
|
{
|
|
|
|
|
BUG();
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline unsigned int hpte_valid(unsigned char *hpte_slot_array, int index)
|
|
|
|
|
{
|
|
|
|
|
BUG();
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline unsigned int hpte_hash_index(unsigned char *hpte_slot_array,
|
|
|
|
|
int index)
|
|
|
|
|
{
|
|
|
|
|
BUG();
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline void mark_hpte_slot_valid(unsigned char *hpte_slot_array,
|
|
|
|
|
unsigned int index, unsigned int hidx)
|
|
|
|
|
{
|
|
|
|
|
BUG();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline int hash__pmd_trans_huge(pmd_t pmd)
|
|
|
|
|
{
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline pmd_t hash__pmd_mkhuge(pmd_t pmd)
|
|
|
|
|
{
|
|
|
|
|
BUG();
|
|
|
|
|
return pmd;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
extern unsigned long hash__pmd_hugepage_update(struct mm_struct *mm,
|
|
|
|
|
unsigned long addr, pmd_t *pmdp,
|
|
|
|
|
unsigned long clr, unsigned long set);
|
|
|
|
|
extern pmd_t hash__pmdp_collapse_flush(struct vm_area_struct *vma,
|
|
|
|
|
unsigned long address, pmd_t *pmdp);
|
|
|
|
|
extern void hash__pgtable_trans_huge_deposit(struct mm_struct *mm, pmd_t *pmdp,
|
|
|
|
|
pgtable_t pgtable);
|
|
|
|
|
extern pgtable_t hash__pgtable_trans_huge_withdraw(struct mm_struct *mm, pmd_t *pmdp);
|
|
|
|
|
extern pmd_t hash__pmdp_huge_get_and_clear(struct mm_struct *mm,
|
|
|
|
|
unsigned long addr, pmd_t *pmdp);
|
|
|
|
|
extern int hash__has_transparent_hugepage(void);
|
|
|
|
|
#endif
|
|
|
|
|
|
2015-12-01 09:06:30 +05:30
|
|
|
#endif /* !__ASSEMBLY__ */
|
|
|
|
|
|
|
|
|
|
#endif /* _ASM_POWERPC_BOOK3S_64_HASH_4K_H */
|