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-04-30 18:38:46 +07:00
|
|
|
/*
|
|
|
|
|
* IBM System z Huge TLB Page Support for Kernel.
|
|
|
|
|
*
|
s390/mm: fix dynamic pagetable upgrade for hugetlbfs
Commit ee71d16d22bb ("s390/mm: make TASK_SIZE independent from the number
of page table levels") changed the logic of TASK_SIZE and also removed the
arch_mmap_check() implementation for s390. This combination has a subtle
effect on how get_unmapped_area() for hugetlbfs pages works. It is now
possible that a user process establishes a hugetlbfs mapping at an address
above 4 TB, without triggering a dynamic pagetable upgrade from 3 to 4
levels.
This is because hugetlbfs mappings will not use mm->get_unmapped_area, but
rather file->f_op->get_unmapped_area, which currently is the generic
implementation of hugetlb_get_unmapped_area() that does not know about s390
dynamic pagetable upgrades, but with the new definition of TASK_SIZE, it
will now allow mappings above 4 TB.
Subsequent access to such a mapped address above 4 TB will result in a page
fault loop, because the CPU cannot translate such a large address with 3
pagetable levels. The fault handler will try to map in a hugepage at the
address, but due to the folded pagetable logic it will end up with creating
entries in the 3 level pagetable, possibly overwriting existing mappings,
and then it all repeats when the access is retried.
Apart from the page fault loop, this can have various nasty effects, e.g.
kernel panic from one of the BUG_ON() checks in memory management code,
or even data loss if an existing mapping gets overwritten.
Fix this by implementing HAVE_ARCH_HUGETLB_UNMAPPED_AREA support for s390,
providing an s390 version for hugetlb_get_unmapped_area() with pagetable
upgrade support similar to arch_get_unmapped_area(), which will then be
used instead of the generic version.
Fixes: ee71d16d22bb ("s390/mm: make TASK_SIZE independent from the number of page table levels")
Cc: <stable@vger.kernel.org> # 4.12+
Signed-off-by: Gerald Schaefer <gerald.schaefer@de.ibm.com>
Signed-off-by: Vasily Gorbik <gor@linux.ibm.com>
2020-01-17 01:59:04 +07:00
|
|
|
* Copyright IBM Corp. 2007,2020
|
2008-04-30 18:38:46 +07:00
|
|
|
* Author(s): Gerald Schaefer <gerald.schaefer@de.ibm.com>
|
|
|
|
|
*/
|
|
|
|
|
|
2016-07-04 19:47:01 +07:00
|
|
|
#define KMSG_COMPONENT "hugetlb"
|
|
|
|
|
#define pr_fmt(fmt) KMSG_COMPONENT ": " fmt
|
|
|
|
|
|
2008-04-30 18:38:46 +07:00
|
|
|
#include <linux/mm.h>
|
|
|
|
|
#include <linux/hugetlb.h>
|
s390/mm: fix dynamic pagetable upgrade for hugetlbfs
Commit ee71d16d22bb ("s390/mm: make TASK_SIZE independent from the number
of page table levels") changed the logic of TASK_SIZE and also removed the
arch_mmap_check() implementation for s390. This combination has a subtle
effect on how get_unmapped_area() for hugetlbfs pages works. It is now
possible that a user process establishes a hugetlbfs mapping at an address
above 4 TB, without triggering a dynamic pagetable upgrade from 3 to 4
levels.
This is because hugetlbfs mappings will not use mm->get_unmapped_area, but
rather file->f_op->get_unmapped_area, which currently is the generic
implementation of hugetlb_get_unmapped_area() that does not know about s390
dynamic pagetable upgrades, but with the new definition of TASK_SIZE, it
will now allow mappings above 4 TB.
Subsequent access to such a mapped address above 4 TB will result in a page
fault loop, because the CPU cannot translate such a large address with 3
pagetable levels. The fault handler will try to map in a hugepage at the
address, but due to the folded pagetable logic it will end up with creating
entries in the 3 level pagetable, possibly overwriting existing mappings,
and then it all repeats when the access is retried.
Apart from the page fault loop, this can have various nasty effects, e.g.
kernel panic from one of the BUG_ON() checks in memory management code,
or even data loss if an existing mapping gets overwritten.
Fix this by implementing HAVE_ARCH_HUGETLB_UNMAPPED_AREA support for s390,
providing an s390 version for hugetlb_get_unmapped_area() with pagetable
upgrade support similar to arch_get_unmapped_area(), which will then be
used instead of the generic version.
Fixes: ee71d16d22bb ("s390/mm: make TASK_SIZE independent from the number of page table levels")
Cc: <stable@vger.kernel.org> # 4.12+
Signed-off-by: Gerald Schaefer <gerald.schaefer@de.ibm.com>
Signed-off-by: Vasily Gorbik <gor@linux.ibm.com>
2020-01-17 01:59:04 +07:00
|
|
|
#include <linux/mman.h>
|
|
|
|
|
#include <linux/sched/mm.h>
|
|
|
|
|
#include <linux/security.h>
|
2008-04-30 18:38:46 +07:00
|
|
|
|
2016-07-18 19:35:13 +07:00
|
|
|
/*
|
|
|
|
|
* If the bit selected by single-bit bitmask "a" is set within "x", move
|
|
|
|
|
* it to the position indicated by single-bit bitmask "b".
|
|
|
|
|
*/
|
|
|
|
|
#define move_set_bit(x, a, b) (((x) & (a)) >> ilog2(a) << ilog2(b))
|
|
|
|
|
|
2016-07-04 19:47:01 +07:00
|
|
|
static inline unsigned long __pte_to_rste(pte_t pte)
|
2013-07-24 01:57:57 +07:00
|
|
|
{
|
2016-07-04 19:47:01 +07:00
|
|
|
unsigned long rste;
|
2013-07-24 01:57:57 +07:00
|
|
|
|
|
|
|
|
/*
|
2016-07-04 19:47:01 +07:00
|
|
|
* Convert encoding pte bits pmd / pud bits
|
2015-04-22 18:55:59 +07:00
|
|
|
* lIR.uswrdy.p dy..R...I...wr
|
|
|
|
|
* empty 010.000000.0 -> 00..0...1...00
|
|
|
|
|
* prot-none, clean, old 111.000000.1 -> 00..1...1...00
|
|
|
|
|
* prot-none, clean, young 111.000001.1 -> 01..1...1...00
|
|
|
|
|
* prot-none, dirty, old 111.000010.1 -> 10..1...1...00
|
|
|
|
|
* prot-none, dirty, young 111.000011.1 -> 11..1...1...00
|
|
|
|
|
* read-only, clean, old 111.000100.1 -> 00..1...1...01
|
|
|
|
|
* read-only, clean, young 101.000101.1 -> 01..1...0...01
|
|
|
|
|
* read-only, dirty, old 111.000110.1 -> 10..1...1...01
|
|
|
|
|
* read-only, dirty, young 101.000111.1 -> 11..1...0...01
|
|
|
|
|
* read-write, clean, old 111.001100.1 -> 00..1...1...11
|
|
|
|
|
* read-write, clean, young 101.001101.1 -> 01..1...0...11
|
|
|
|
|
* read-write, dirty, old 110.001110.1 -> 10..0...1...11
|
|
|
|
|
* read-write, dirty, young 100.001111.1 -> 11..0...0...11
|
|
|
|
|
* HW-bits: R read-only, I invalid
|
|
|
|
|
* SW-bits: p present, y young, d dirty, r read, w write, s special,
|
|
|
|
|
* u unused, l large
|
2013-07-24 01:57:57 +07:00
|
|
|
*/
|
|
|
|
|
if (pte_present(pte)) {
|
2016-07-04 19:47:01 +07:00
|
|
|
rste = pte_val(pte) & PAGE_MASK;
|
2016-07-18 19:35:13 +07:00
|
|
|
rste |= move_set_bit(pte_val(pte), _PAGE_READ,
|
|
|
|
|
_SEGMENT_ENTRY_READ);
|
|
|
|
|
rste |= move_set_bit(pte_val(pte), _PAGE_WRITE,
|
|
|
|
|
_SEGMENT_ENTRY_WRITE);
|
|
|
|
|
rste |= move_set_bit(pte_val(pte), _PAGE_INVALID,
|
|
|
|
|
_SEGMENT_ENTRY_INVALID);
|
|
|
|
|
rste |= move_set_bit(pte_val(pte), _PAGE_PROTECT,
|
|
|
|
|
_SEGMENT_ENTRY_PROTECT);
|
|
|
|
|
rste |= move_set_bit(pte_val(pte), _PAGE_DIRTY,
|
|
|
|
|
_SEGMENT_ENTRY_DIRTY);
|
|
|
|
|
rste |= move_set_bit(pte_val(pte), _PAGE_YOUNG,
|
|
|
|
|
_SEGMENT_ENTRY_YOUNG);
|
|
|
|
|
#ifdef CONFIG_MEM_SOFT_DIRTY
|
|
|
|
|
rste |= move_set_bit(pte_val(pte), _PAGE_SOFT_DIRTY,
|
|
|
|
|
_SEGMENT_ENTRY_SOFT_DIRTY);
|
|
|
|
|
#endif
|
2016-03-22 16:54:24 +07:00
|
|
|
rste |= move_set_bit(pte_val(pte), _PAGE_NOEXEC,
|
|
|
|
|
_SEGMENT_ENTRY_NOEXEC);
|
2013-07-24 01:57:57 +07:00
|
|
|
} else
|
2016-04-27 16:43:07 +07:00
|
|
|
rste = _SEGMENT_ENTRY_EMPTY;
|
2016-07-04 19:47:01 +07:00
|
|
|
return rste;
|
2013-07-24 01:57:57 +07:00
|
|
|
}
|
|
|
|
|
|
2016-07-04 19:47:01 +07:00
|
|
|
static inline pte_t __rste_to_pte(unsigned long rste)
|
2013-07-24 01:57:57 +07:00
|
|
|
{
|
2016-07-04 19:47:01 +07:00
|
|
|
int present;
|
2013-07-24 01:57:57 +07:00
|
|
|
pte_t pte;
|
|
|
|
|
|
2016-07-04 19:47:01 +07:00
|
|
|
if ((rste & _REGION_ENTRY_TYPE_MASK) == _REGION_ENTRY_TYPE_R3)
|
|
|
|
|
present = pud_present(__pud(rste));
|
|
|
|
|
else
|
|
|
|
|
present = pmd_present(__pmd(rste));
|
|
|
|
|
|
2013-07-24 01:57:57 +07:00
|
|
|
/*
|
2016-07-04 19:47:01 +07:00
|
|
|
* Convert encoding pmd / pud bits pte bits
|
2015-04-22 18:55:59 +07:00
|
|
|
* dy..R...I...wr lIR.uswrdy.p
|
|
|
|
|
* empty 00..0...1...00 -> 010.000000.0
|
|
|
|
|
* prot-none, clean, old 00..1...1...00 -> 111.000000.1
|
|
|
|
|
* prot-none, clean, young 01..1...1...00 -> 111.000001.1
|
|
|
|
|
* prot-none, dirty, old 10..1...1...00 -> 111.000010.1
|
|
|
|
|
* prot-none, dirty, young 11..1...1...00 -> 111.000011.1
|
|
|
|
|
* read-only, clean, old 00..1...1...01 -> 111.000100.1
|
|
|
|
|
* read-only, clean, young 01..1...0...01 -> 101.000101.1
|
|
|
|
|
* read-only, dirty, old 10..1...1...01 -> 111.000110.1
|
|
|
|
|
* read-only, dirty, young 11..1...0...01 -> 101.000111.1
|
|
|
|
|
* read-write, clean, old 00..1...1...11 -> 111.001100.1
|
|
|
|
|
* read-write, clean, young 01..1...0...11 -> 101.001101.1
|
|
|
|
|
* read-write, dirty, old 10..0...1...11 -> 110.001110.1
|
|
|
|
|
* read-write, dirty, young 11..0...0...11 -> 100.001111.1
|
|
|
|
|
* HW-bits: R read-only, I invalid
|
|
|
|
|
* SW-bits: p present, y young, d dirty, r read, w write, s special,
|
|
|
|
|
* u unused, l large
|
2013-07-24 01:57:57 +07:00
|
|
|
*/
|
2016-07-04 19:47:01 +07:00
|
|
|
if (present) {
|
|
|
|
|
pte_val(pte) = rste & _SEGMENT_ENTRY_ORIGIN_LARGE;
|
2014-07-24 16:03:41 +07:00
|
|
|
pte_val(pte) |= _PAGE_LARGE | _PAGE_PRESENT;
|
2016-07-18 19:35:13 +07:00
|
|
|
pte_val(pte) |= move_set_bit(rste, _SEGMENT_ENTRY_READ,
|
|
|
|
|
_PAGE_READ);
|
|
|
|
|
pte_val(pte) |= move_set_bit(rste, _SEGMENT_ENTRY_WRITE,
|
|
|
|
|
_PAGE_WRITE);
|
|
|
|
|
pte_val(pte) |= move_set_bit(rste, _SEGMENT_ENTRY_INVALID,
|
|
|
|
|
_PAGE_INVALID);
|
|
|
|
|
pte_val(pte) |= move_set_bit(rste, _SEGMENT_ENTRY_PROTECT,
|
|
|
|
|
_PAGE_PROTECT);
|
|
|
|
|
pte_val(pte) |= move_set_bit(rste, _SEGMENT_ENTRY_DIRTY,
|
|
|
|
|
_PAGE_DIRTY);
|
|
|
|
|
pte_val(pte) |= move_set_bit(rste, _SEGMENT_ENTRY_YOUNG,
|
|
|
|
|
_PAGE_YOUNG);
|
|
|
|
|
#ifdef CONFIG_MEM_SOFT_DIRTY
|
|
|
|
|
pte_val(pte) |= move_set_bit(rste, _SEGMENT_ENTRY_SOFT_DIRTY,
|
|
|
|
|
_PAGE_DIRTY);
|
|
|
|
|
#endif
|
2016-03-22 16:54:24 +07:00
|
|
|
pte_val(pte) |= move_set_bit(rste, _SEGMENT_ENTRY_NOEXEC,
|
|
|
|
|
_PAGE_NOEXEC);
|
2013-07-24 01:57:57 +07:00
|
|
|
} else
|
|
|
|
|
pte_val(pte) = _PAGE_INVALID;
|
|
|
|
|
return pte;
|
|
|
|
|
}
|
2008-04-30 18:38:46 +07:00
|
|
|
|
2018-07-13 17:28:26 +07:00
|
|
|
static void clear_huge_pte_skeys(struct mm_struct *mm, unsigned long rste)
|
|
|
|
|
{
|
|
|
|
|
struct page *page;
|
|
|
|
|
unsigned long size, paddr;
|
|
|
|
|
|
|
|
|
|
if (!mm_uses_skeys(mm) ||
|
|
|
|
|
rste & _SEGMENT_ENTRY_INVALID)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
if ((rste & _REGION_ENTRY_TYPE_MASK) == _REGION_ENTRY_TYPE_R3) {
|
|
|
|
|
page = pud_page(__pud(rste));
|
|
|
|
|
size = PUD_SIZE;
|
|
|
|
|
paddr = rste & PUD_MASK;
|
|
|
|
|
} else {
|
|
|
|
|
page = pmd_page(__pmd(rste));
|
|
|
|
|
size = PMD_SIZE;
|
|
|
|
|
paddr = rste & PMD_MASK;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (!test_and_set_bit(PG_arch_1, &page->flags))
|
|
|
|
|
__storage_key_init_range(paddr, paddr + size - 1);
|
|
|
|
|
}
|
|
|
|
|
|
2008-04-30 18:38:46 +07:00
|
|
|
void set_huge_pte_at(struct mm_struct *mm, unsigned long addr,
|
2013-07-24 01:57:57 +07:00
|
|
|
pte_t *ptep, pte_t pte)
|
2008-04-30 18:38:46 +07:00
|
|
|
{
|
2016-03-22 16:54:24 +07:00
|
|
|
unsigned long rste;
|
|
|
|
|
|
|
|
|
|
rste = __pte_to_rste(pte);
|
|
|
|
|
if (!MACHINE_HAS_NX)
|
|
|
|
|
rste &= ~_SEGMENT_ENTRY_NOEXEC;
|
2016-07-04 19:47:01 +07:00
|
|
|
|
|
|
|
|
/* Set correct table type for 2G hugepages */
|
|
|
|
|
if ((pte_val(*ptep) & _REGION_ENTRY_TYPE_MASK) == _REGION_ENTRY_TYPE_R3)
|
|
|
|
|
rste |= _REGION_ENTRY_TYPE_R3 | _REGION3_ENTRY_LARGE;
|
|
|
|
|
else
|
|
|
|
|
rste |= _SEGMENT_ENTRY_LARGE;
|
2018-07-13 17:28:26 +07:00
|
|
|
clear_huge_pte_skeys(mm, rste);
|
2016-07-04 19:47:01 +07:00
|
|
|
pte_val(*ptep) = rste;
|
2013-07-24 01:57:57 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
pte_t huge_ptep_get(pte_t *ptep)
|
|
|
|
|
{
|
2016-07-04 19:47:01 +07:00
|
|
|
return __rste_to_pte(pte_val(*ptep));
|
2013-07-24 01:57:57 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
pte_t huge_ptep_get_and_clear(struct mm_struct *mm,
|
|
|
|
|
unsigned long addr, pte_t *ptep)
|
|
|
|
|
{
|
2016-07-04 19:47:01 +07:00
|
|
|
pte_t pte = huge_ptep_get(ptep);
|
2013-07-24 01:57:57 +07:00
|
|
|
pmd_t *pmdp = (pmd_t *) ptep;
|
2016-07-04 19:47:01 +07:00
|
|
|
pud_t *pudp = (pud_t *) ptep;
|
2008-04-30 18:38:46 +07:00
|
|
|
|
2016-07-04 19:47:01 +07:00
|
|
|
if ((pte_val(*ptep) & _REGION_ENTRY_TYPE_MASK) == _REGION_ENTRY_TYPE_R3)
|
|
|
|
|
pudp_xchg_direct(mm, addr, pudp, __pud(_REGION3_ENTRY_EMPTY));
|
|
|
|
|
else
|
|
|
|
|
pmdp_xchg_direct(mm, addr, pmdp, __pmd(_SEGMENT_ENTRY_EMPTY));
|
|
|
|
|
return pte;
|
2008-04-30 18:38:46 +07:00
|
|
|
}
|
|
|
|
|
|
2008-07-24 11:27:41 +07:00
|
|
|
pte_t *huge_pte_alloc(struct mm_struct *mm,
|
|
|
|
|
unsigned long addr, unsigned long sz)
|
2008-04-30 18:38:46 +07:00
|
|
|
{
|
|
|
|
|
pgd_t *pgdp;
|
2017-04-24 23:19:10 +07:00
|
|
|
p4d_t *p4dp;
|
2008-04-30 18:38:46 +07:00
|
|
|
pud_t *pudp;
|
|
|
|
|
pmd_t *pmdp = NULL;
|
|
|
|
|
|
|
|
|
|
pgdp = pgd_offset(mm, addr);
|
2017-04-24 23:19:10 +07:00
|
|
|
p4dp = p4d_alloc(mm, pgdp, addr);
|
|
|
|
|
if (p4dp) {
|
|
|
|
|
pudp = pud_alloc(mm, p4dp, addr);
|
|
|
|
|
if (pudp) {
|
|
|
|
|
if (sz == PUD_SIZE)
|
|
|
|
|
return (pte_t *) pudp;
|
|
|
|
|
else if (sz == PMD_SIZE)
|
|
|
|
|
pmdp = pmd_alloc(mm, pudp, addr);
|
|
|
|
|
}
|
2016-07-04 19:47:01 +07:00
|
|
|
}
|
2008-04-30 18:38:46 +07:00
|
|
|
return (pte_t *) pmdp;
|
|
|
|
|
}
|
|
|
|
|
|
2017-07-07 05:39:42 +07:00
|
|
|
pte_t *huge_pte_offset(struct mm_struct *mm,
|
|
|
|
|
unsigned long addr, unsigned long sz)
|
2008-04-30 18:38:46 +07:00
|
|
|
{
|
|
|
|
|
pgd_t *pgdp;
|
2017-04-24 23:19:10 +07:00
|
|
|
p4d_t *p4dp;
|
2008-04-30 18:38:46 +07:00
|
|
|
pud_t *pudp;
|
|
|
|
|
pmd_t *pmdp = NULL;
|
|
|
|
|
|
|
|
|
|
pgdp = pgd_offset(mm, addr);
|
|
|
|
|
if (pgd_present(*pgdp)) {
|
2017-04-24 23:19:10 +07:00
|
|
|
p4dp = p4d_offset(pgdp, addr);
|
|
|
|
|
if (p4d_present(*p4dp)) {
|
|
|
|
|
pudp = pud_offset(p4dp, addr);
|
|
|
|
|
if (pud_present(*pudp)) {
|
|
|
|
|
if (pud_large(*pudp))
|
|
|
|
|
return (pte_t *) pudp;
|
|
|
|
|
pmdp = pmd_offset(pudp, addr);
|
|
|
|
|
}
|
2016-07-04 19:47:01 +07:00
|
|
|
}
|
2008-04-30 18:38:46 +07:00
|
|
|
}
|
|
|
|
|
return (pte_t *) pmdp;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
int pmd_huge(pmd_t pmd)
|
|
|
|
|
{
|
2015-06-26 04:59:49 +07:00
|
|
|
return pmd_large(pmd);
|
2008-04-30 18:38:46 +07:00
|
|
|
}
|
|
|
|
|
|
2008-07-24 11:27:50 +07:00
|
|
|
int pud_huge(pud_t pud)
|
|
|
|
|
{
|
2016-07-04 19:47:01 +07:00
|
|
|
return pud_large(pud);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
struct page *
|
|
|
|
|
follow_huge_pud(struct mm_struct *mm, unsigned long address,
|
|
|
|
|
pud_t *pud, int flags)
|
|
|
|
|
{
|
|
|
|
|
if (flags & FOLL_GET)
|
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
|
|
return pud_page(*pud) + ((address & ~PUD_MASK) >> PAGE_SHIFT);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static __init int setup_hugepagesz(char *opt)
|
|
|
|
|
{
|
|
|
|
|
unsigned long size;
|
|
|
|
|
char *string = opt;
|
|
|
|
|
|
|
|
|
|
size = memparse(opt, &opt);
|
|
|
|
|
if (MACHINE_HAS_EDAT1 && size == PMD_SIZE) {
|
|
|
|
|
hugetlb_add_hstate(PMD_SHIFT - PAGE_SHIFT);
|
|
|
|
|
} else if (MACHINE_HAS_EDAT2 && size == PUD_SIZE) {
|
|
|
|
|
hugetlb_add_hstate(PUD_SHIFT - PAGE_SHIFT);
|
|
|
|
|
} else {
|
2016-10-13 23:20:07 +07:00
|
|
|
hugetlb_bad_size();
|
2016-07-04 19:47:01 +07:00
|
|
|
pr_err("hugepagesz= specifies an unsupported page size %s\n",
|
|
|
|
|
string);
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
return 1;
|
2008-07-24 11:27:50 +07:00
|
|
|
}
|
2016-07-04 19:47:01 +07:00
|
|
|
__setup("hugepagesz=", setup_hugepagesz);
|
s390/mm: fix dynamic pagetable upgrade for hugetlbfs
Commit ee71d16d22bb ("s390/mm: make TASK_SIZE independent from the number
of page table levels") changed the logic of TASK_SIZE and also removed the
arch_mmap_check() implementation for s390. This combination has a subtle
effect on how get_unmapped_area() for hugetlbfs pages works. It is now
possible that a user process establishes a hugetlbfs mapping at an address
above 4 TB, without triggering a dynamic pagetable upgrade from 3 to 4
levels.
This is because hugetlbfs mappings will not use mm->get_unmapped_area, but
rather file->f_op->get_unmapped_area, which currently is the generic
implementation of hugetlb_get_unmapped_area() that does not know about s390
dynamic pagetable upgrades, but with the new definition of TASK_SIZE, it
will now allow mappings above 4 TB.
Subsequent access to such a mapped address above 4 TB will result in a page
fault loop, because the CPU cannot translate such a large address with 3
pagetable levels. The fault handler will try to map in a hugepage at the
address, but due to the folded pagetable logic it will end up with creating
entries in the 3 level pagetable, possibly overwriting existing mappings,
and then it all repeats when the access is retried.
Apart from the page fault loop, this can have various nasty effects, e.g.
kernel panic from one of the BUG_ON() checks in memory management code,
or even data loss if an existing mapping gets overwritten.
Fix this by implementing HAVE_ARCH_HUGETLB_UNMAPPED_AREA support for s390,
providing an s390 version for hugetlb_get_unmapped_area() with pagetable
upgrade support similar to arch_get_unmapped_area(), which will then be
used instead of the generic version.
Fixes: ee71d16d22bb ("s390/mm: make TASK_SIZE independent from the number of page table levels")
Cc: <stable@vger.kernel.org> # 4.12+
Signed-off-by: Gerald Schaefer <gerald.schaefer@de.ibm.com>
Signed-off-by: Vasily Gorbik <gor@linux.ibm.com>
2020-01-17 01:59:04 +07:00
|
|
|
|
|
|
|
|
static unsigned long hugetlb_get_unmapped_area_bottomup(struct file *file,
|
|
|
|
|
unsigned long addr, unsigned long len,
|
|
|
|
|
unsigned long pgoff, unsigned long flags)
|
|
|
|
|
{
|
|
|
|
|
struct hstate *h = hstate_file(file);
|
|
|
|
|
struct vm_unmapped_area_info info;
|
|
|
|
|
|
|
|
|
|
info.flags = 0;
|
|
|
|
|
info.length = len;
|
|
|
|
|
info.low_limit = current->mm->mmap_base;
|
|
|
|
|
info.high_limit = TASK_SIZE;
|
|
|
|
|
info.align_mask = PAGE_MASK & ~huge_page_mask(h);
|
|
|
|
|
info.align_offset = 0;
|
|
|
|
|
return vm_unmapped_area(&info);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static unsigned long hugetlb_get_unmapped_area_topdown(struct file *file,
|
|
|
|
|
unsigned long addr0, unsigned long len,
|
|
|
|
|
unsigned long pgoff, unsigned long flags)
|
|
|
|
|
{
|
|
|
|
|
struct hstate *h = hstate_file(file);
|
|
|
|
|
struct vm_unmapped_area_info info;
|
|
|
|
|
unsigned long addr;
|
|
|
|
|
|
|
|
|
|
info.flags = VM_UNMAPPED_AREA_TOPDOWN;
|
|
|
|
|
info.length = len;
|
|
|
|
|
info.low_limit = max(PAGE_SIZE, mmap_min_addr);
|
|
|
|
|
info.high_limit = current->mm->mmap_base;
|
|
|
|
|
info.align_mask = PAGE_MASK & ~huge_page_mask(h);
|
|
|
|
|
info.align_offset = 0;
|
|
|
|
|
addr = vm_unmapped_area(&info);
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* A failed mmap() very likely causes application failure,
|
|
|
|
|
* so fall back to the bottom-up function here. This scenario
|
|
|
|
|
* can happen with large stack limits and large mmap()
|
|
|
|
|
* allocations.
|
|
|
|
|
*/
|
|
|
|
|
if (addr & ~PAGE_MASK) {
|
|
|
|
|
VM_BUG_ON(addr != -ENOMEM);
|
|
|
|
|
info.flags = 0;
|
|
|
|
|
info.low_limit = TASK_UNMAPPED_BASE;
|
|
|
|
|
info.high_limit = TASK_SIZE;
|
|
|
|
|
addr = vm_unmapped_area(&info);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return addr;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
unsigned long hugetlb_get_unmapped_area(struct file *file, unsigned long addr,
|
|
|
|
|
unsigned long len, unsigned long pgoff, unsigned long flags)
|
|
|
|
|
{
|
|
|
|
|
struct hstate *h = hstate_file(file);
|
|
|
|
|
struct mm_struct *mm = current->mm;
|
|
|
|
|
struct vm_area_struct *vma;
|
|
|
|
|
|
|
|
|
|
if (len & ~huge_page_mask(h))
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
if (len > TASK_SIZE - mmap_min_addr)
|
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
|
|
if (flags & MAP_FIXED) {
|
|
|
|
|
if (prepare_hugepage_range(file, addr, len))
|
|
|
|
|
return -EINVAL;
|
|
|
|
|
goto check_asce_limit;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (addr) {
|
|
|
|
|
addr = ALIGN(addr, huge_page_size(h));
|
|
|
|
|
vma = find_vma(mm, addr);
|
|
|
|
|
if (TASK_SIZE - len >= addr && addr >= mmap_min_addr &&
|
|
|
|
|
(!vma || addr + len <= vm_start_gap(vma)))
|
|
|
|
|
goto check_asce_limit;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (mm->get_unmapped_area == arch_get_unmapped_area)
|
|
|
|
|
addr = hugetlb_get_unmapped_area_bottomup(file, addr, len,
|
|
|
|
|
pgoff, flags);
|
|
|
|
|
else
|
|
|
|
|
addr = hugetlb_get_unmapped_area_topdown(file, addr, len,
|
|
|
|
|
pgoff, flags);
|
2020-03-23 15:38:37 +07:00
|
|
|
if (offset_in_page(addr))
|
s390/mm: fix dynamic pagetable upgrade for hugetlbfs
Commit ee71d16d22bb ("s390/mm: make TASK_SIZE independent from the number
of page table levels") changed the logic of TASK_SIZE and also removed the
arch_mmap_check() implementation for s390. This combination has a subtle
effect on how get_unmapped_area() for hugetlbfs pages works. It is now
possible that a user process establishes a hugetlbfs mapping at an address
above 4 TB, without triggering a dynamic pagetable upgrade from 3 to 4
levels.
This is because hugetlbfs mappings will not use mm->get_unmapped_area, but
rather file->f_op->get_unmapped_area, which currently is the generic
implementation of hugetlb_get_unmapped_area() that does not know about s390
dynamic pagetable upgrades, but with the new definition of TASK_SIZE, it
will now allow mappings above 4 TB.
Subsequent access to such a mapped address above 4 TB will result in a page
fault loop, because the CPU cannot translate such a large address with 3
pagetable levels. The fault handler will try to map in a hugepage at the
address, but due to the folded pagetable logic it will end up with creating
entries in the 3 level pagetable, possibly overwriting existing mappings,
and then it all repeats when the access is retried.
Apart from the page fault loop, this can have various nasty effects, e.g.
kernel panic from one of the BUG_ON() checks in memory management code,
or even data loss if an existing mapping gets overwritten.
Fix this by implementing HAVE_ARCH_HUGETLB_UNMAPPED_AREA support for s390,
providing an s390 version for hugetlb_get_unmapped_area() with pagetable
upgrade support similar to arch_get_unmapped_area(), which will then be
used instead of the generic version.
Fixes: ee71d16d22bb ("s390/mm: make TASK_SIZE independent from the number of page table levels")
Cc: <stable@vger.kernel.org> # 4.12+
Signed-off-by: Gerald Schaefer <gerald.schaefer@de.ibm.com>
Signed-off-by: Vasily Gorbik <gor@linux.ibm.com>
2020-01-17 01:59:04 +07:00
|
|
|
return addr;
|
|
|
|
|
|
|
|
|
|
check_asce_limit:
|
2020-03-23 15:38:37 +07:00
|
|
|
return check_asce_limit(mm, addr, len);
|
s390/mm: fix dynamic pagetable upgrade for hugetlbfs
Commit ee71d16d22bb ("s390/mm: make TASK_SIZE independent from the number
of page table levels") changed the logic of TASK_SIZE and also removed the
arch_mmap_check() implementation for s390. This combination has a subtle
effect on how get_unmapped_area() for hugetlbfs pages works. It is now
possible that a user process establishes a hugetlbfs mapping at an address
above 4 TB, without triggering a dynamic pagetable upgrade from 3 to 4
levels.
This is because hugetlbfs mappings will not use mm->get_unmapped_area, but
rather file->f_op->get_unmapped_area, which currently is the generic
implementation of hugetlb_get_unmapped_area() that does not know about s390
dynamic pagetable upgrades, but with the new definition of TASK_SIZE, it
will now allow mappings above 4 TB.
Subsequent access to such a mapped address above 4 TB will result in a page
fault loop, because the CPU cannot translate such a large address with 3
pagetable levels. The fault handler will try to map in a hugepage at the
address, but due to the folded pagetable logic it will end up with creating
entries in the 3 level pagetable, possibly overwriting existing mappings,
and then it all repeats when the access is retried.
Apart from the page fault loop, this can have various nasty effects, e.g.
kernel panic from one of the BUG_ON() checks in memory management code,
or even data loss if an existing mapping gets overwritten.
Fix this by implementing HAVE_ARCH_HUGETLB_UNMAPPED_AREA support for s390,
providing an s390 version for hugetlb_get_unmapped_area() with pagetable
upgrade support similar to arch_get_unmapped_area(), which will then be
used instead of the generic version.
Fixes: ee71d16d22bb ("s390/mm: make TASK_SIZE independent from the number of page table levels")
Cc: <stable@vger.kernel.org> # 4.12+
Signed-off-by: Gerald Schaefer <gerald.schaefer@de.ibm.com>
Signed-off-by: Vasily Gorbik <gor@linux.ibm.com>
2020-01-17 01:59:04 +07:00
|
|
|
}
|