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 22:07:57 +08:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
* Initialize MMU support.
|
|
|
|
*
|
|
|
|
* Copyright (C) 1998-2003 Hewlett-Packard Co
|
|
|
|
* David Mosberger-Tang <davidm@hpl.hp.com>
|
|
|
|
*/
|
|
|
|
#include <linux/kernel.h>
|
|
|
|
#include <linux/init.h>
|
|
|
|
|
2018-12-06 23:06:04 +08:00
|
|
|
#include <linux/dma-noncoherent.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <linux/efi.h>
|
|
|
|
#include <linux/elf.h>
|
2011-12-09 02:22:08 +08:00
|
|
|
#include <linux/memblock.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <linux/mm.h>
|
2017-02-09 01:51:30 +08:00
|
|
|
#include <linux/sched/signal.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <linux/mmzone.h>
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/personality.h>
|
|
|
|
#include <linux/reboot.h>
|
|
|
|
#include <linux/slab.h>
|
|
|
|
#include <linux/swap.h>
|
|
|
|
#include <linux/proc_fs.h>
|
|
|
|
#include <linux/bitops.h>
|
2007-01-30 18:11:09 +08:00
|
|
|
#include <linux/kexec.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
#include <asm/dma.h>
|
|
|
|
#include <asm/io.h>
|
|
|
|
#include <asm/machvec.h>
|
|
|
|
#include <asm/numa.h>
|
|
|
|
#include <asm/patch.h>
|
|
|
|
#include <asm/pgalloc.h>
|
|
|
|
#include <asm/sal.h>
|
|
|
|
#include <asm/sections.h>
|
|
|
|
#include <asm/tlb.h>
|
2016-12-25 03:46:01 +08:00
|
|
|
#include <linux/uaccess.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <asm/unistd.h>
|
|
|
|
#include <asm/mca.h>
|
|
|
|
|
|
|
|
extern void ia64_tlb_init (void);
|
|
|
|
|
|
|
|
unsigned long MAX_DMA_ADDRESS = PAGE_OFFSET + 0x100000000UL;
|
|
|
|
|
|
|
|
#ifdef CONFIG_VIRTUAL_MEM_MAP
|
2009-10-02 12:28:55 +08:00
|
|
|
unsigned long VMALLOC_END = VMALLOC_END_INIT;
|
|
|
|
EXPORT_SYMBOL(VMALLOC_END);
|
2005-04-17 06:20:36 +08:00
|
|
|
struct page *vmem_map;
|
|
|
|
EXPORT_SYMBOL(vmem_map);
|
|
|
|
#endif
|
|
|
|
|
2005-04-26 04:13:16 +08:00
|
|
|
struct page *zero_page_memmap_ptr; /* map entry for zero page */
|
2005-04-17 06:20:36 +08:00
|
|
|
EXPORT_SYMBOL(zero_page_memmap_ptr);
|
|
|
|
|
|
|
|
void
|
2007-10-16 16:25:44 +08:00
|
|
|
__ia64_sync_icache_dcache (pte_t pte)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
unsigned long addr;
|
|
|
|
struct page *page;
|
|
|
|
|
|
|
|
page = pte_page(pte);
|
|
|
|
addr = (unsigned long) page_address(page);
|
|
|
|
|
|
|
|
if (test_bit(PG_arch_1, &page->flags))
|
|
|
|
return; /* i-cache is already coherent with d-cache */
|
|
|
|
|
2008-04-10 04:05:41 +08:00
|
|
|
flush_icache_range(addr, addr + (PAGE_SIZE << compound_order(page)));
|
2005-04-17 06:20:36 +08:00
|
|
|
set_bit(PG_arch_1, &page->flags); /* mark page as clean */
|
|
|
|
}
|
|
|
|
|
2007-02-06 10:46:40 +08:00
|
|
|
/*
|
|
|
|
* Since DMA is i-cache coherent, any (complete) pages that were written via
|
|
|
|
* DMA can be marked as "clean" so that lazy_mmu_prot_update() doesn't have to
|
|
|
|
* flush them when they get mapped into an executable vm-area.
|
|
|
|
*/
|
2018-12-06 23:06:04 +08:00
|
|
|
void arch_sync_dma_for_cpu(struct device *dev, phys_addr_t paddr,
|
|
|
|
size_t size, enum dma_data_direction dir)
|
2007-02-06 10:46:40 +08:00
|
|
|
{
|
2018-12-06 23:06:04 +08:00
|
|
|
unsigned long pfn = PHYS_PFN(paddr);
|
|
|
|
|
|
|
|
do {
|
|
|
|
set_bit(PG_arch_1, &pfn_to_page(pfn)->flags);
|
|
|
|
} while (++pfn <= PHYS_PFN(paddr + size - 1));
|
2007-02-06 10:46:40 +08:00
|
|
|
}
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
inline void
|
|
|
|
ia64_set_rbs_bot (void)
|
|
|
|
{
|
2010-01-06 23:24:30 +08:00
|
|
|
unsigned long stack_size = rlimit_max(RLIMIT_STACK) & -16;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
if (stack_size > MAX_USER_STACK_SIZE)
|
|
|
|
stack_size = MAX_USER_STACK_SIZE;
|
2007-03-23 11:17:46 +08:00
|
|
|
current->thread.rbs_bot = PAGE_ALIGN(current->mm->start_stack - stack_size);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This performs some platform-dependent address space initialization.
|
|
|
|
* On IA-64, we want to setup the VM area for the register backing
|
|
|
|
* store (which grows upwards) and install the gateway page which is
|
|
|
|
* used for signal trampolines, etc.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
ia64_init_addr_space (void)
|
|
|
|
{
|
|
|
|
struct vm_area_struct *vma;
|
|
|
|
|
|
|
|
ia64_set_rbs_bot();
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If we're out of memory and kmem_cache_alloc() returns NULL, we simply ignore
|
|
|
|
* the problem. When the process attempts to write to the register backing store
|
|
|
|
* for the first time, it will get a SEGFAULT in this case.
|
|
|
|
*/
|
2018-07-22 06:24:03 +08:00
|
|
|
vma = vm_area_alloc(current->mm);
|
2005-04-17 06:20:36 +08:00
|
|
|
if (vma) {
|
2018-08-02 00:57:50 +08:00
|
|
|
vma_set_anonymous(vma);
|
2005-04-17 06:20:36 +08:00
|
|
|
vma->vm_start = current->thread.rbs_bot & PAGE_MASK;
|
|
|
|
vma->vm_end = vma->vm_start + PAGE_SIZE;
|
2005-10-30 09:16:20 +08:00
|
|
|
vma->vm_flags = VM_DATA_DEFAULT_FLAGS|VM_GROWSUP|VM_ACCOUNT;
|
2007-10-19 14:39:15 +08:00
|
|
|
vma->vm_page_prot = vm_get_page_prot(vma->vm_flags);
|
2005-04-17 06:20:36 +08:00
|
|
|
down_write(¤t->mm->mmap_sem);
|
|
|
|
if (insert_vm_struct(current->mm, vma)) {
|
|
|
|
up_write(¤t->mm->mmap_sem);
|
2018-07-22 04:48:51 +08:00
|
|
|
vm_area_free(vma);
|
2005-04-17 06:20:36 +08:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
up_write(¤t->mm->mmap_sem);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* map NaT-page at address zero to speed up speculative dereferencing of NULL: */
|
|
|
|
if (!(current->personality & MMAP_PAGE_ZERO)) {
|
2018-07-22 06:24:03 +08:00
|
|
|
vma = vm_area_alloc(current->mm);
|
2005-04-17 06:20:36 +08:00
|
|
|
if (vma) {
|
2018-08-02 00:57:50 +08:00
|
|
|
vma_set_anonymous(vma);
|
2005-04-17 06:20:36 +08:00
|
|
|
vma->vm_end = PAGE_SIZE;
|
|
|
|
vma->vm_page_prot = __pgprot(pgprot_val(PAGE_READONLY) | _PAGE_MA_NAT);
|
mm: kill vma flag VM_RESERVED and mm->reserved_vm counter
A long time ago, in v2.4, VM_RESERVED kept swapout process off VMA,
currently it lost original meaning but still has some effects:
| effect | alternative flags
-+------------------------+---------------------------------------------
1| account as reserved_vm | VM_IO
2| skip in core dump | VM_IO, VM_DONTDUMP
3| do not merge or expand | VM_IO, VM_DONTEXPAND, VM_HUGETLB, VM_PFNMAP
4| do not mlock | VM_IO, VM_DONTEXPAND, VM_HUGETLB, VM_PFNMAP
This patch removes reserved_vm counter from mm_struct. Seems like nobody
cares about it, it does not exported into userspace directly, it only
reduces total_vm showed in proc.
Thus VM_RESERVED can be replaced with VM_IO or pair VM_DONTEXPAND | VM_DONTDUMP.
remap_pfn_range() and io_remap_pfn_range() set VM_IO|VM_DONTEXPAND|VM_DONTDUMP.
remap_vmalloc_range() set VM_DONTEXPAND | VM_DONTDUMP.
[akpm@linux-foundation.org: drivers/vfio/pci/vfio_pci.c fixup]
Signed-off-by: Konstantin Khlebnikov <khlebnikov@openvz.org>
Cc: Alexander Viro <viro@zeniv.linux.org.uk>
Cc: Carsten Otte <cotte@de.ibm.com>
Cc: Chris Metcalf <cmetcalf@tilera.com>
Cc: Cyrill Gorcunov <gorcunov@openvz.org>
Cc: Eric Paris <eparis@redhat.com>
Cc: H. Peter Anvin <hpa@zytor.com>
Cc: Hugh Dickins <hughd@google.com>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: James Morris <james.l.morris@oracle.com>
Cc: Jason Baron <jbaron@redhat.com>
Cc: Kentaro Takeda <takedakn@nttdata.co.jp>
Cc: Matt Helsley <matthltc@us.ibm.com>
Cc: Nick Piggin <npiggin@kernel.dk>
Cc: Oleg Nesterov <oleg@redhat.com>
Cc: Peter Zijlstra <a.p.zijlstra@chello.nl>
Cc: Robert Richter <robert.richter@amd.com>
Cc: Suresh Siddha <suresh.b.siddha@intel.com>
Cc: Tetsuo Handa <penguin-kernel@I-love.SAKURA.ne.jp>
Cc: Venkatesh Pallipadi <venki@google.com>
Acked-by: Linus Torvalds <torvalds@linux-foundation.org>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2012-10-09 07:29:02 +08:00
|
|
|
vma->vm_flags = VM_READ | VM_MAYREAD | VM_IO |
|
|
|
|
VM_DONTEXPAND | VM_DONTDUMP;
|
2005-04-17 06:20:36 +08:00
|
|
|
down_write(¤t->mm->mmap_sem);
|
|
|
|
if (insert_vm_struct(current->mm, vma)) {
|
|
|
|
up_write(¤t->mm->mmap_sem);
|
2018-07-22 04:48:51 +08:00
|
|
|
vm_area_free(vma);
|
2005-04-17 06:20:36 +08:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
up_write(¤t->mm->mmap_sem);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
free_initmem (void)
|
|
|
|
{
|
mm: change signature of free_reserved_area() to fix building warnings
Change signature of free_reserved_area() according to Russell King's
suggestion to fix following build warnings:
arch/arm/mm/init.c: In function 'mem_init':
arch/arm/mm/init.c:603:2: warning: passing argument 1 of 'free_reserved_area' makes integer from pointer without a cast [enabled by default]
free_reserved_area(__va(PHYS_PFN_OFFSET), swapper_pg_dir, 0, NULL);
^
In file included from include/linux/mman.h:4:0,
from arch/arm/mm/init.c:15:
include/linux/mm.h:1301:22: note: expected 'long unsigned int' but argument is of type 'void *'
extern unsigned long free_reserved_area(unsigned long start, unsigned long end,
mm/page_alloc.c: In function 'free_reserved_area':
>> mm/page_alloc.c:5134:3: warning: passing argument 1 of 'virt_to_phys' makes pointer from integer without a cast [enabled by default]
In file included from arch/mips/include/asm/page.h:49:0,
from include/linux/mmzone.h:20,
from include/linux/gfp.h:4,
from include/linux/mm.h:8,
from mm/page_alloc.c:18:
arch/mips/include/asm/io.h:119:29: note: expected 'const volatile void *' but argument is of type 'long unsigned int'
mm/page_alloc.c: In function 'free_area_init_nodes':
mm/page_alloc.c:5030:34: warning: array subscript is below array bounds [-Warray-bounds]
Also address some minor code review comments.
Signed-off-by: Jiang Liu <jiang.liu@huawei.com>
Reported-by: Arnd Bergmann <arnd@arndb.de>
Cc: "H. Peter Anvin" <hpa@zytor.com>
Cc: "Michael S. Tsirkin" <mst@redhat.com>
Cc: <sworddragon2@aol.com>
Cc: Catalin Marinas <catalin.marinas@arm.com>
Cc: Chris Metcalf <cmetcalf@tilera.com>
Cc: David Howells <dhowells@redhat.com>
Cc: Geert Uytterhoeven <geert@linux-m68k.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Jeremy Fitzhardinge <jeremy@goop.org>
Cc: Jianguo Wu <wujianguo@huawei.com>
Cc: Joonsoo Kim <js1304@gmail.com>
Cc: Kamezawa Hiroyuki <kamezawa.hiroyu@jp.fujitsu.com>
Cc: Konrad Rzeszutek Wilk <konrad.wilk@oracle.com>
Cc: Marek Szyprowski <m.szyprowski@samsung.com>
Cc: Mel Gorman <mel@csn.ul.ie>
Cc: Michel Lespinasse <walken@google.com>
Cc: Minchan Kim <minchan@kernel.org>
Cc: Rik van Riel <riel@redhat.com>
Cc: Rusty Russell <rusty@rustcorp.com.au>
Cc: Tang Chen <tangchen@cn.fujitsu.com>
Cc: Tejun Heo <tj@kernel.org>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Wen Congyang <wency@cn.fujitsu.com>
Cc: Will Deacon <will.deacon@arm.com>
Cc: Yasuaki Ishimatsu <isimatu.yasuaki@jp.fujitsu.com>
Cc: Yinghai Lu <yinghai@kernel.org>
Cc: Russell King <rmk@arm.linux.org.uk>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-07-04 06:02:48 +08:00
|
|
|
free_reserved_area(ia64_imva(__init_begin), ia64_imva(__init_end),
|
2013-07-04 06:02:51 +08:00
|
|
|
-1, "unused kernel");
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
2006-03-23 08:54:15 +08:00
|
|
|
void __init
|
2005-04-17 06:20:36 +08:00
|
|
|
free_initrd_mem (unsigned long start, unsigned long end)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* EFI uses 4KB pages while the kernel can use 4KB or bigger.
|
|
|
|
* Thus EFI and the kernel may have different page sizes. It is
|
|
|
|
* therefore possible to have the initrd share the same page as
|
|
|
|
* the end of the kernel (given current setup).
|
|
|
|
*
|
|
|
|
* To avoid freeing/using the wrong page (kernel sized) we:
|
|
|
|
* - align up the beginning of initrd
|
|
|
|
* - align down the end of initrd
|
|
|
|
*
|
|
|
|
* | |
|
|
|
|
* |=============| a000
|
|
|
|
* | |
|
|
|
|
* | |
|
|
|
|
* | | 9000
|
|
|
|
* |/////////////|
|
|
|
|
* |/////////////|
|
|
|
|
* |=============| 8000
|
|
|
|
* |///INITRD////|
|
|
|
|
* |/////////////|
|
|
|
|
* |/////////////| 7000
|
|
|
|
* | |
|
|
|
|
* |KKKKKKKKKKKKK|
|
|
|
|
* |=============| 6000
|
|
|
|
* |KKKKKKKKKKKKK|
|
|
|
|
* |KKKKKKKKKKKKK|
|
|
|
|
* K=kernel using 8KB pages
|
|
|
|
*
|
|
|
|
* In this example, we must free page 8000 ONLY. So we must align up
|
|
|
|
* initrd_start and keep initrd_end as is.
|
|
|
|
*/
|
|
|
|
start = PAGE_ALIGN(start);
|
|
|
|
end = end & PAGE_MASK;
|
|
|
|
|
|
|
|
if (start < end)
|
|
|
|
printk(KERN_INFO "Freeing initrd memory: %ldkB freed\n", (end - start) >> 10);
|
|
|
|
|
|
|
|
for (; start < end; start += PAGE_SIZE) {
|
|
|
|
if (!virt_addr_valid(start))
|
|
|
|
continue;
|
2013-04-30 06:06:39 +08:00
|
|
|
free_reserved_page(virt_to_page(start));
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This installs a clean page in the kernel's page table.
|
|
|
|
*/
|
2006-03-23 08:54:15 +08:00
|
|
|
static struct page * __init
|
2005-04-17 06:20:36 +08:00
|
|
|
put_kernel_page (struct page *page, unsigned long address, pgprot_t pgprot)
|
|
|
|
{
|
|
|
|
pgd_t *pgd;
|
|
|
|
pud_t *pud;
|
|
|
|
pmd_t *pmd;
|
|
|
|
pte_t *pte;
|
|
|
|
|
|
|
|
pgd = pgd_offset_k(address); /* note: this is NOT pgd_offset()! */
|
|
|
|
|
|
|
|
{
|
|
|
|
pud = pud_alloc(&init_mm, pgd, address);
|
|
|
|
if (!pud)
|
|
|
|
goto out;
|
|
|
|
pmd = pmd_alloc(&init_mm, pud, address);
|
|
|
|
if (!pmd)
|
|
|
|
goto out;
|
[PATCH] mm: init_mm without ptlock
First step in pushing down the page_table_lock. init_mm.page_table_lock has
been used throughout the architectures (usually for ioremap): not to serialize
kernel address space allocation (that's usually vmlist_lock), but because
pud_alloc,pmd_alloc,pte_alloc_kernel expect caller holds it.
Reverse that: don't lock or unlock init_mm.page_table_lock in any of the
architectures; instead rely on pud_alloc,pmd_alloc,pte_alloc_kernel to take
and drop it when allocating a new one, to check lest a racing task already
did. Similarly no page_table_lock in vmalloc's map_vm_area.
Some temporary ugliness in __pud_alloc and __pmd_alloc: since they also handle
user mms, which are converted only by a later patch, for now they have to lock
differently according to whether or not it's init_mm.
If sources get muddled, there's a danger that an arch source taking
init_mm.page_table_lock will be mixed with common source also taking it (or
neither take it). So break the rules and make another change, which should
break the build for such a mismatch: remove the redundant mm arg from
pte_alloc_kernel (ppc64 scrapped its distinct ioremap_mm in 2.6.13).
Exceptions: arm26 used pte_alloc_kernel on user mm, now pte_alloc_map; ia64
used pte_alloc_map on init_mm, now pte_alloc_kernel; parisc had bad args to
pmd_alloc and pte_alloc_kernel in unused USE_HPPA_IOREMAP code; ppc64
map_io_page forgot to unlock on failure; ppc mmu_mapin_ram and ppc64 im_free
took page_table_lock for no good reason.
Signed-off-by: Hugh Dickins <hugh@veritas.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-10-30 09:16:21 +08:00
|
|
|
pte = pte_alloc_kernel(pmd, address);
|
2005-04-17 06:20:36 +08:00
|
|
|
if (!pte)
|
|
|
|
goto out;
|
[PATCH] mm: init_mm without ptlock
First step in pushing down the page_table_lock. init_mm.page_table_lock has
been used throughout the architectures (usually for ioremap): not to serialize
kernel address space allocation (that's usually vmlist_lock), but because
pud_alloc,pmd_alloc,pte_alloc_kernel expect caller holds it.
Reverse that: don't lock or unlock init_mm.page_table_lock in any of the
architectures; instead rely on pud_alloc,pmd_alloc,pte_alloc_kernel to take
and drop it when allocating a new one, to check lest a racing task already
did. Similarly no page_table_lock in vmalloc's map_vm_area.
Some temporary ugliness in __pud_alloc and __pmd_alloc: since they also handle
user mms, which are converted only by a later patch, for now they have to lock
differently according to whether or not it's init_mm.
If sources get muddled, there's a danger that an arch source taking
init_mm.page_table_lock will be mixed with common source also taking it (or
neither take it). So break the rules and make another change, which should
break the build for such a mismatch: remove the redundant mm arg from
pte_alloc_kernel (ppc64 scrapped its distinct ioremap_mm in 2.6.13).
Exceptions: arm26 used pte_alloc_kernel on user mm, now pte_alloc_map; ia64
used pte_alloc_map on init_mm, now pte_alloc_kernel; parisc had bad args to
pmd_alloc and pte_alloc_kernel in unused USE_HPPA_IOREMAP code; ppc64
map_io_page forgot to unlock on failure; ppc mmu_mapin_ram and ppc64 im_free
took page_table_lock for no good reason.
Signed-off-by: Hugh Dickins <hugh@veritas.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-10-30 09:16:21 +08:00
|
|
|
if (!pte_none(*pte))
|
2005-04-17 06:20:36 +08:00
|
|
|
goto out;
|
|
|
|
set_pte(pte, mk_pte(page, pgprot));
|
|
|
|
}
|
[PATCH] mm: init_mm without ptlock
First step in pushing down the page_table_lock. init_mm.page_table_lock has
been used throughout the architectures (usually for ioremap): not to serialize
kernel address space allocation (that's usually vmlist_lock), but because
pud_alloc,pmd_alloc,pte_alloc_kernel expect caller holds it.
Reverse that: don't lock or unlock init_mm.page_table_lock in any of the
architectures; instead rely on pud_alloc,pmd_alloc,pte_alloc_kernel to take
and drop it when allocating a new one, to check lest a racing task already
did. Similarly no page_table_lock in vmalloc's map_vm_area.
Some temporary ugliness in __pud_alloc and __pmd_alloc: since they also handle
user mms, which are converted only by a later patch, for now they have to lock
differently according to whether or not it's init_mm.
If sources get muddled, there's a danger that an arch source taking
init_mm.page_table_lock will be mixed with common source also taking it (or
neither take it). So break the rules and make another change, which should
break the build for such a mismatch: remove the redundant mm arg from
pte_alloc_kernel (ppc64 scrapped its distinct ioremap_mm in 2.6.13).
Exceptions: arm26 used pte_alloc_kernel on user mm, now pte_alloc_map; ia64
used pte_alloc_map on init_mm, now pte_alloc_kernel; parisc had bad args to
pmd_alloc and pte_alloc_kernel in unused USE_HPPA_IOREMAP code; ppc64
map_io_page forgot to unlock on failure; ppc mmu_mapin_ram and ppc64 im_free
took page_table_lock for no good reason.
Signed-off-by: Hugh Dickins <hugh@veritas.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-10-30 09:16:21 +08:00
|
|
|
out:
|
2005-04-17 06:20:36 +08:00
|
|
|
/* no need for flush_tlb */
|
|
|
|
return page;
|
|
|
|
}
|
|
|
|
|
2006-03-13 01:08:26 +08:00
|
|
|
static void __init
|
2005-04-17 06:20:36 +08:00
|
|
|
setup_gate (void)
|
|
|
|
{
|
|
|
|
struct page *page;
|
|
|
|
|
|
|
|
/*
|
2005-06-09 01:45:00 +08:00
|
|
|
* Map the gate page twice: once read-only to export the ELF
|
|
|
|
* headers etc. and once execute-only page to enable
|
|
|
|
* privilege-promotion via "epc":
|
2005-04-17 06:20:36 +08:00
|
|
|
*/
|
2015-06-03 02:42:02 +08:00
|
|
|
page = virt_to_page(ia64_imva(__start_gate_section));
|
2005-04-17 06:20:36 +08:00
|
|
|
put_kernel_page(page, GATE_ADDR, PAGE_READONLY);
|
|
|
|
#ifdef HAVE_BUGGY_SEGREL
|
2015-06-03 02:42:02 +08:00
|
|
|
page = virt_to_page(ia64_imva(__start_gate_section + PAGE_SIZE));
|
2005-04-17 06:20:36 +08:00
|
|
|
put_kernel_page(page, GATE_ADDR + PAGE_SIZE, PAGE_GATE);
|
|
|
|
#else
|
|
|
|
put_kernel_page(page, GATE_ADDR + PERCPU_PAGE_SIZE, PAGE_GATE);
|
2005-06-09 01:45:00 +08:00
|
|
|
/* Fill in the holes (if any) with read-only zero pages: */
|
|
|
|
{
|
|
|
|
unsigned long addr;
|
|
|
|
|
|
|
|
for (addr = GATE_ADDR + PAGE_SIZE;
|
|
|
|
addr < GATE_ADDR + PERCPU_PAGE_SIZE;
|
|
|
|
addr += PAGE_SIZE)
|
|
|
|
{
|
|
|
|
put_kernel_page(ZERO_PAGE(0), addr,
|
|
|
|
PAGE_READONLY);
|
|
|
|
put_kernel_page(ZERO_PAGE(0), addr + PERCPU_PAGE_SIZE,
|
|
|
|
PAGE_READONLY);
|
|
|
|
}
|
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
#endif
|
|
|
|
ia64_patch_gate();
|
|
|
|
}
|
|
|
|
|
arm64,ia64,ppc,s390,sh,tile,um,x86,mm: remove default gate area
The core mm code will provide a default gate area based on
FIXADDR_USER_START and FIXADDR_USER_END if
!defined(__HAVE_ARCH_GATE_AREA) && defined(AT_SYSINFO_EHDR).
This default is only useful for ia64. arm64, ppc, s390, sh, tile, 64-bit
UML, and x86_32 have their own code just to disable it. arm, 32-bit UML,
and x86_64 have gate areas, but they have their own implementations.
This gets rid of the default and moves the code into ia64.
This should save some code on architectures without a gate area: it's now
possible to inline the gate_area functions in the default case.
Signed-off-by: Andy Lutomirski <luto@amacapital.net>
Acked-by: Nathan Lynch <nathan_lynch@mentor.com>
Acked-by: H. Peter Anvin <hpa@linux.intel.com>
Acked-by: Benjamin Herrenschmidt <benh@kernel.crashing.org> [in principle]
Acked-by: Richard Weinberger <richard@nod.at> [for um]
Acked-by: Will Deacon <will.deacon@arm.com> [for arm64]
Cc: Catalin Marinas <catalin.marinas@arm.com>
Cc: Will Deacon <will.deacon@arm.com>
Cc: Tony Luck <tony.luck@intel.com>
Cc: Fenghua Yu <fenghua.yu@intel.com>
Cc: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Cc: Paul Mackerras <paulus@samba.org>
Cc: Martin Schwidefsky <schwidefsky@de.ibm.com>
Cc: Heiko Carstens <heiko.carstens@de.ibm.com>
Cc: Chris Metcalf <cmetcalf@tilera.com>
Cc: Jeff Dike <jdike@addtoit.com>
Cc: Richard Weinberger <richard@nod.at>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: "H. Peter Anvin" <hpa@zytor.com>
Cc: Nathan Lynch <Nathan_Lynch@mentor.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2014-08-09 05:23:40 +08:00
|
|
|
static struct vm_area_struct gate_vma;
|
|
|
|
|
|
|
|
static int __init gate_vma_init(void)
|
|
|
|
{
|
2018-07-27 07:37:30 +08:00
|
|
|
vma_init(&gate_vma, NULL);
|
arm64,ia64,ppc,s390,sh,tile,um,x86,mm: remove default gate area
The core mm code will provide a default gate area based on
FIXADDR_USER_START and FIXADDR_USER_END if
!defined(__HAVE_ARCH_GATE_AREA) && defined(AT_SYSINFO_EHDR).
This default is only useful for ia64. arm64, ppc, s390, sh, tile, 64-bit
UML, and x86_32 have their own code just to disable it. arm, 32-bit UML,
and x86_64 have gate areas, but they have their own implementations.
This gets rid of the default and moves the code into ia64.
This should save some code on architectures without a gate area: it's now
possible to inline the gate_area functions in the default case.
Signed-off-by: Andy Lutomirski <luto@amacapital.net>
Acked-by: Nathan Lynch <nathan_lynch@mentor.com>
Acked-by: H. Peter Anvin <hpa@linux.intel.com>
Acked-by: Benjamin Herrenschmidt <benh@kernel.crashing.org> [in principle]
Acked-by: Richard Weinberger <richard@nod.at> [for um]
Acked-by: Will Deacon <will.deacon@arm.com> [for arm64]
Cc: Catalin Marinas <catalin.marinas@arm.com>
Cc: Will Deacon <will.deacon@arm.com>
Cc: Tony Luck <tony.luck@intel.com>
Cc: Fenghua Yu <fenghua.yu@intel.com>
Cc: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Cc: Paul Mackerras <paulus@samba.org>
Cc: Martin Schwidefsky <schwidefsky@de.ibm.com>
Cc: Heiko Carstens <heiko.carstens@de.ibm.com>
Cc: Chris Metcalf <cmetcalf@tilera.com>
Cc: Jeff Dike <jdike@addtoit.com>
Cc: Richard Weinberger <richard@nod.at>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: "H. Peter Anvin" <hpa@zytor.com>
Cc: Nathan Lynch <Nathan_Lynch@mentor.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2014-08-09 05:23:40 +08:00
|
|
|
gate_vma.vm_start = FIXADDR_USER_START;
|
|
|
|
gate_vma.vm_end = FIXADDR_USER_END;
|
|
|
|
gate_vma.vm_flags = VM_READ | VM_MAYREAD | VM_EXEC | VM_MAYEXEC;
|
|
|
|
gate_vma.vm_page_prot = __P101;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
__initcall(gate_vma_init);
|
|
|
|
|
|
|
|
struct vm_area_struct *get_gate_vma(struct mm_struct *mm)
|
|
|
|
{
|
|
|
|
return &gate_vma;
|
|
|
|
}
|
|
|
|
|
|
|
|
int in_gate_area_no_mm(unsigned long addr)
|
|
|
|
{
|
|
|
|
if ((addr >= FIXADDR_USER_START) && (addr < FIXADDR_USER_END))
|
|
|
|
return 1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int in_gate_area(struct mm_struct *mm, unsigned long addr)
|
|
|
|
{
|
|
|
|
return in_gate_area_no_mm(addr);
|
|
|
|
}
|
|
|
|
|
2012-12-22 06:05:13 +08:00
|
|
|
void ia64_mmu_init(void *my_cpu_data)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2006-10-14 01:08:13 +08:00
|
|
|
unsigned long pta, impl_va_bits;
|
2012-12-22 06:05:13 +08:00
|
|
|
extern void tlb_init(void);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
#ifdef CONFIG_DISABLE_VHPT
|
|
|
|
# define VHPT_ENABLE_BIT 0
|
|
|
|
#else
|
|
|
|
# define VHPT_ENABLE_BIT 1
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check if the virtually mapped linear page table (VMLPT) overlaps with a mapped
|
|
|
|
* address space. The IA-64 architecture guarantees that at least 50 bits of
|
|
|
|
* virtual address space are implemented but if we pick a large enough page size
|
|
|
|
* (e.g., 64KB), the mapped address space is big enough that it will overlap with
|
|
|
|
* VMLPT. I assume that once we run on machines big enough to warrant 64KB pages,
|
|
|
|
* IMPL_VA_MSB will be significantly bigger, so this is unlikely to become a
|
|
|
|
* problem in practice. Alternatively, we could truncate the top of the mapped
|
|
|
|
* address space to not permit mappings that would overlap with the VMLPT.
|
|
|
|
* --davidm 00/12/06
|
|
|
|
*/
|
|
|
|
# define pte_bits 3
|
|
|
|
# define mapped_space_bits (3*(PAGE_SHIFT - pte_bits) + PAGE_SHIFT)
|
|
|
|
/*
|
|
|
|
* The virtual page table has to cover the entire implemented address space within
|
|
|
|
* a region even though not all of this space may be mappable. The reason for
|
|
|
|
* this is that the Access bit and Dirty bit fault handlers perform
|
|
|
|
* non-speculative accesses to the virtual page table, so the address range of the
|
|
|
|
* virtual page table itself needs to be covered by virtual page table.
|
|
|
|
*/
|
|
|
|
# define vmlpt_bits (impl_va_bits - PAGE_SHIFT + pte_bits)
|
|
|
|
# define POW2(n) (1ULL << (n))
|
|
|
|
|
|
|
|
impl_va_bits = ffz(~(local_cpu_data->unimpl_va_mask | (7UL << 61)));
|
|
|
|
|
|
|
|
if (impl_va_bits < 51 || impl_va_bits > 61)
|
|
|
|
panic("CPU has bogus IMPL_VA_MSB value of %lu!\n", impl_va_bits - 1);
|
2005-08-24 11:07:00 +08:00
|
|
|
/*
|
|
|
|
* mapped_space_bits - PAGE_SHIFT is the total number of ptes we need,
|
|
|
|
* which must fit into "vmlpt_bits - pte_bits" slots. Second half of
|
|
|
|
* the test makes sure that our mapped space doesn't overlap the
|
|
|
|
* unimplemented hole in the middle of the region.
|
|
|
|
*/
|
|
|
|
if ((mapped_space_bits - PAGE_SHIFT > vmlpt_bits - pte_bits) ||
|
|
|
|
(mapped_space_bits > impl_va_bits - 1))
|
|
|
|
panic("Cannot build a big enough virtual-linear page table"
|
|
|
|
" to cover mapped address space.\n"
|
|
|
|
" Try using a smaller page size.\n");
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/* place the VMLPT at the end of each page-table mapped region: */
|
|
|
|
pta = POW2(61) - POW2(vmlpt_bits);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Set the (virtually mapped linear) page table address. Bit
|
|
|
|
* 8 selects between the short and long format, bits 2-7 the
|
|
|
|
* size of the table, and bit 0 whether the VHPT walker is
|
|
|
|
* enabled.
|
|
|
|
*/
|
|
|
|
ia64_set_pta(pta | (0 << 8) | (vmlpt_bits << 2) | VHPT_ENABLE_BIT);
|
|
|
|
|
|
|
|
ia64_tlb_init();
|
|
|
|
|
|
|
|
#ifdef CONFIG_HUGETLB_PAGE
|
|
|
|
ia64_set_rr(HPAGE_REGION_BASE, HPAGE_SHIFT << 2);
|
|
|
|
ia64_srlz_d();
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef CONFIG_VIRTUAL_MEM_MAP
|
2006-06-29 00:55:43 +08:00
|
|
|
int vmemmap_find_next_valid_pfn(int node, int i)
|
|
|
|
{
|
|
|
|
unsigned long end_address, hole_next_pfn;
|
|
|
|
unsigned long stop_address;
|
|
|
|
pg_data_t *pgdat = NODE_DATA(node);
|
|
|
|
|
|
|
|
end_address = (unsigned long) &vmem_map[pgdat->node_start_pfn + i];
|
|
|
|
end_address = PAGE_ALIGN(end_address);
|
2013-11-13 07:07:17 +08:00
|
|
|
stop_address = (unsigned long) &vmem_map[pgdat_end_pfn(pgdat)];
|
2006-06-29 00:55:43 +08:00
|
|
|
|
|
|
|
do {
|
|
|
|
pgd_t *pgd;
|
|
|
|
pud_t *pud;
|
|
|
|
pmd_t *pmd;
|
|
|
|
pte_t *pte;
|
|
|
|
|
|
|
|
pgd = pgd_offset_k(end_address);
|
|
|
|
if (pgd_none(*pgd)) {
|
|
|
|
end_address += PGDIR_SIZE;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
pud = pud_offset(pgd, end_address);
|
|
|
|
if (pud_none(*pud)) {
|
|
|
|
end_address += PUD_SIZE;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
pmd = pmd_offset(pud, end_address);
|
|
|
|
if (pmd_none(*pmd)) {
|
|
|
|
end_address += PMD_SIZE;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
pte = pte_offset_kernel(pmd, end_address);
|
|
|
|
retry_pte:
|
|
|
|
if (pte_none(*pte)) {
|
|
|
|
end_address += PAGE_SIZE;
|
|
|
|
pte++;
|
|
|
|
if ((end_address < stop_address) &&
|
|
|
|
(end_address != ALIGN(end_address, 1UL << PMD_SHIFT)))
|
|
|
|
goto retry_pte;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
/* Found next valid vmem_map page */
|
|
|
|
break;
|
|
|
|
} while (end_address < stop_address);
|
|
|
|
|
|
|
|
end_address = min(end_address, stop_address);
|
|
|
|
end_address = end_address - (unsigned long) vmem_map + sizeof(struct page) - 1;
|
|
|
|
hole_next_pfn = end_address / sizeof(struct page);
|
|
|
|
return hole_next_pfn - pgdat->node_start_pfn;
|
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2009-05-23 04:49:49 +08:00
|
|
|
int __init create_mem_map_page_table(u64 start, u64 end, void *arg)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
unsigned long address, start_page, end_page;
|
|
|
|
struct page *map_start, *map_end;
|
|
|
|
int node;
|
|
|
|
pgd_t *pgd;
|
|
|
|
pud_t *pud;
|
|
|
|
pmd_t *pmd;
|
|
|
|
pte_t *pte;
|
|
|
|
|
|
|
|
map_start = vmem_map + (__pa(start) >> PAGE_SHIFT);
|
|
|
|
map_end = vmem_map + (__pa(end) >> PAGE_SHIFT);
|
|
|
|
|
|
|
|
start_page = (unsigned long) map_start & PAGE_MASK;
|
|
|
|
end_page = PAGE_ALIGN((unsigned long) map_end);
|
|
|
|
node = paddr_to_nid(__pa(start));
|
|
|
|
|
|
|
|
for (address = start_page; address < end_page; address += PAGE_SIZE) {
|
|
|
|
pgd = pgd_offset_k(address);
|
|
|
|
if (pgd_none(*pgd))
|
2018-10-31 06:08:41 +08:00
|
|
|
pgd_populate(&init_mm, pgd, memblock_alloc_node(PAGE_SIZE, PAGE_SIZE, node));
|
2005-04-17 06:20:36 +08:00
|
|
|
pud = pud_offset(pgd, address);
|
|
|
|
|
|
|
|
if (pud_none(*pud))
|
2018-10-31 06:08:41 +08:00
|
|
|
pud_populate(&init_mm, pud, memblock_alloc_node(PAGE_SIZE, PAGE_SIZE, node));
|
2005-04-17 06:20:36 +08:00
|
|
|
pmd = pmd_offset(pud, address);
|
|
|
|
|
|
|
|
if (pmd_none(*pmd))
|
2018-10-31 06:08:41 +08:00
|
|
|
pmd_populate_kernel(&init_mm, pmd, memblock_alloc_node(PAGE_SIZE, PAGE_SIZE, node));
|
2005-04-17 06:20:36 +08:00
|
|
|
pte = pte_offset_kernel(pmd, address);
|
|
|
|
|
|
|
|
if (pte_none(*pte))
|
2018-10-31 06:08:41 +08:00
|
|
|
set_pte(pte, pfn_pte(__pa(memblock_alloc_node(PAGE_SIZE, PAGE_SIZE, node)) >> PAGE_SHIFT,
|
2005-04-17 06:20:36 +08:00
|
|
|
PAGE_KERNEL));
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct memmap_init_callback_data {
|
|
|
|
struct page *start;
|
|
|
|
struct page *end;
|
|
|
|
int nid;
|
|
|
|
unsigned long zone;
|
|
|
|
};
|
|
|
|
|
2007-10-29 20:49:47 +08:00
|
|
|
static int __meminit
|
2009-05-23 04:49:49 +08:00
|
|
|
virtual_memmap_init(u64 start, u64 end, void *arg)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
struct memmap_init_callback_data *args;
|
|
|
|
struct page *map_start, *map_end;
|
|
|
|
|
|
|
|
args = (struct memmap_init_callback_data *) arg;
|
|
|
|
map_start = vmem_map + (__pa(start) >> PAGE_SHIFT);
|
|
|
|
map_end = vmem_map + (__pa(end) >> PAGE_SHIFT);
|
|
|
|
|
|
|
|
if (map_start < args->start)
|
|
|
|
map_start = args->start;
|
|
|
|
if (map_end > args->end)
|
|
|
|
map_end = args->end;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We have to initialize "out of bounds" struct page elements that fit completely
|
|
|
|
* on the same pages that were allocated for the "in bounds" elements because they
|
|
|
|
* may be referenced later (and found to be "reserved").
|
|
|
|
*/
|
|
|
|
map_start -= ((unsigned long) map_start & (PAGE_SIZE - 1)) / sizeof(struct page);
|
|
|
|
map_end += ((PAGE_ALIGN((unsigned long) map_end) - (unsigned long) map_end)
|
|
|
|
/ sizeof(struct page));
|
|
|
|
|
|
|
|
if (map_start < map_end)
|
|
|
|
memmap_init_zone((unsigned long)(map_end - map_start),
|
2007-01-11 15:15:30 +08:00
|
|
|
args->nid, args->zone, page_to_pfn(map_start),
|
2017-12-29 15:53:57 +08:00
|
|
|
MEMMAP_EARLY, NULL);
|
2005-04-17 06:20:36 +08:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-10-29 20:49:47 +08:00
|
|
|
void __meminit
|
2005-04-17 06:20:36 +08:00
|
|
|
memmap_init (unsigned long size, int nid, unsigned long zone,
|
|
|
|
unsigned long start_pfn)
|
|
|
|
{
|
2017-12-29 15:53:57 +08:00
|
|
|
if (!vmem_map) {
|
|
|
|
memmap_init_zone(size, nid, zone, start_pfn, MEMMAP_EARLY,
|
|
|
|
NULL);
|
|
|
|
} else {
|
2005-04-17 06:20:36 +08:00
|
|
|
struct page *start;
|
|
|
|
struct memmap_init_callback_data args;
|
|
|
|
|
|
|
|
start = pfn_to_page(start_pfn);
|
|
|
|
args.start = start;
|
|
|
|
args.end = start + size;
|
|
|
|
args.nid = nid;
|
|
|
|
args.zone = zone;
|
|
|
|
|
|
|
|
efi_memmap_walk(virtual_memmap_init, &args);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
ia64_pfn_valid (unsigned long pfn)
|
|
|
|
{
|
|
|
|
char byte;
|
|
|
|
struct page *pg = pfn_to_page(pfn);
|
|
|
|
|
|
|
|
return (__get_user(byte, (char __user *) pg) == 0)
|
|
|
|
&& ((((u64)pg & PAGE_MASK) == (((u64)(pg + 1) - 1) & PAGE_MASK))
|
|
|
|
|| (__get_user(byte, (char __user *) (pg + 1) - 1) == 0));
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(ia64_pfn_valid);
|
|
|
|
|
2009-05-23 04:49:49 +08:00
|
|
|
int __init find_largest_hole(u64 start, u64 end, void *arg)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
|
|
|
u64 *max_gap = arg;
|
|
|
|
|
|
|
|
static u64 last_end = PAGE_OFFSET;
|
|
|
|
|
|
|
|
/* NOTE: this algorithm assumes efi memmap table is ordered */
|
|
|
|
|
|
|
|
if (*max_gap < (start - last_end))
|
|
|
|
*max_gap = start - last_end;
|
|
|
|
last_end = end;
|
|
|
|
return 0;
|
|
|
|
}
|
2006-09-27 16:49:54 +08:00
|
|
|
|
2007-01-30 18:11:09 +08:00
|
|
|
#endif /* CONFIG_VIRTUAL_MEM_MAP */
|
|
|
|
|
2009-05-23 04:49:49 +08:00
|
|
|
int __init register_active_ranges(u64 start, u64 len, int nid)
|
2006-09-27 16:49:54 +08:00
|
|
|
{
|
2008-04-12 06:21:35 +08:00
|
|
|
u64 end = start + len;
|
2007-01-30 18:11:09 +08:00
|
|
|
|
|
|
|
#ifdef CONFIG_KEXEC
|
|
|
|
if (start > crashk_res.start && start < crashk_res.end)
|
|
|
|
start = crashk_res.end;
|
|
|
|
if (end > crashk_res.start && end < crashk_res.end)
|
|
|
|
end = crashk_res.start;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
if (start < end)
|
2011-12-09 02:22:08 +08:00
|
|
|
memblock_add_node(__pa(start), end - start, nid);
|
2006-09-27 16:49:54 +08:00
|
|
|
return 0;
|
|
|
|
}
|
2005-04-17 06:20:36 +08:00
|
|
|
|
[IA64] min_low_pfn and max_low_pfn calculation fix
We have seen bad_pte_print when testing crashdump on an SN machine in
recent 2.6.20 kernel. There are tons of bad pte print (pfn < max_low_pfn)
reports when the crash kernel boots up, all those reported bad pages
are inside initmem range; That is because if the crash kernel code and
data happens to be at the beginning of the 1st node. build_node_maps in
discontig.c will bypass reserved regions with filter_rsvd_memory. Since
min_low_pfn is calculated in build_node_map, so in this case, min_low_pfn
will be greater than kernel code and data.
Because pages inside initmem are freed and reused later, we saw
pfn_valid check fail on those pages.
I think this theoretically happen on a normal kernel. When I check
min_low_pfn and max_low_pfn calculation in contig.c and discontig.c.
I found more issues than this.
1. min_low_pfn and max_low_pfn calculation is inconsistent between
contig.c and discontig.c,
min_low_pfn is calculated as the first page number of boot memmap in
contig.c (Why? Though this may work at the most of the time, I don't
think it is the right logic). It is calculated as the lowest physical
memory page number bypass reserved regions in discontig.c.
max_low_pfn is calculated include reserved regions in contig.c. It is
calculated exclude reserved regions in discontig.c.
2. If kernel code and data region is happen to be at the begin or the
end of physical memory, when min_low_pfn and max_low_pfn calculation is
bypassed kernel code and data, pages in initmem will report bad.
3. initrd is also in reserved regions, if it is at the begin or at the
end of physical memory, kernel will refuse to reuse the memory. Because
the virt_addr_valid check in free_initrd_mem.
So it is better to fix and clean up those issues.
Calculate min_low_pfn and max_low_pfn in a consistent way.
Signed-off-by: Zou Nan hai <nanhai.zou@intel.com>
Acked-by: Jay Lan <jlan@sgi.com>
Signed-off-by: Tony Luck <tony.luck@intel.com>
2007-03-21 04:41:57 +08:00
|
|
|
int
|
2009-05-23 04:49:49 +08:00
|
|
|
find_max_min_low_pfn (u64 start, u64 end, void *arg)
|
[IA64] min_low_pfn and max_low_pfn calculation fix
We have seen bad_pte_print when testing crashdump on an SN machine in
recent 2.6.20 kernel. There are tons of bad pte print (pfn < max_low_pfn)
reports when the crash kernel boots up, all those reported bad pages
are inside initmem range; That is because if the crash kernel code and
data happens to be at the beginning of the 1st node. build_node_maps in
discontig.c will bypass reserved regions with filter_rsvd_memory. Since
min_low_pfn is calculated in build_node_map, so in this case, min_low_pfn
will be greater than kernel code and data.
Because pages inside initmem are freed and reused later, we saw
pfn_valid check fail on those pages.
I think this theoretically happen on a normal kernel. When I check
min_low_pfn and max_low_pfn calculation in contig.c and discontig.c.
I found more issues than this.
1. min_low_pfn and max_low_pfn calculation is inconsistent between
contig.c and discontig.c,
min_low_pfn is calculated as the first page number of boot memmap in
contig.c (Why? Though this may work at the most of the time, I don't
think it is the right logic). It is calculated as the lowest physical
memory page number bypass reserved regions in discontig.c.
max_low_pfn is calculated include reserved regions in contig.c. It is
calculated exclude reserved regions in discontig.c.
2. If kernel code and data region is happen to be at the begin or the
end of physical memory, when min_low_pfn and max_low_pfn calculation is
bypassed kernel code and data, pages in initmem will report bad.
3. initrd is also in reserved regions, if it is at the begin or at the
end of physical memory, kernel will refuse to reuse the memory. Because
the virt_addr_valid check in free_initrd_mem.
So it is better to fix and clean up those issues.
Calculate min_low_pfn and max_low_pfn in a consistent way.
Signed-off-by: Zou Nan hai <nanhai.zou@intel.com>
Acked-by: Jay Lan <jlan@sgi.com>
Signed-off-by: Tony Luck <tony.luck@intel.com>
2007-03-21 04:41:57 +08:00
|
|
|
{
|
|
|
|
unsigned long pfn_start, pfn_end;
|
|
|
|
#ifdef CONFIG_FLATMEM
|
|
|
|
pfn_start = (PAGE_ALIGN(__pa(start))) >> PAGE_SHIFT;
|
|
|
|
pfn_end = (PAGE_ALIGN(__pa(end - 1))) >> PAGE_SHIFT;
|
|
|
|
#else
|
|
|
|
pfn_start = GRANULEROUNDDOWN(__pa(start)) >> PAGE_SHIFT;
|
|
|
|
pfn_end = GRANULEROUNDUP(__pa(end - 1)) >> PAGE_SHIFT;
|
|
|
|
#endif
|
|
|
|
min_low_pfn = min(min_low_pfn, pfn_start);
|
|
|
|
max_low_pfn = max(max_low_pfn, pfn_end);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
* Boot command-line option "nolwsys" can be used to disable the use of any light-weight
|
|
|
|
* system call handler. When this option is in effect, all fsyscalls will end up bubbling
|
|
|
|
* down into the kernel and calling the normal (heavy-weight) syscall handler. This is
|
|
|
|
* useful for performance testing, but conceivably could also come in handy for debugging
|
|
|
|
* purposes.
|
|
|
|
*/
|
|
|
|
|
2006-03-13 01:10:59 +08:00
|
|
|
static int nolwsys __initdata;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
static int __init
|
|
|
|
nolwsys_setup (char *s)
|
|
|
|
{
|
|
|
|
nolwsys = 1;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
__setup("nolwsys", nolwsys_setup);
|
|
|
|
|
2006-03-23 08:54:15 +08:00
|
|
|
void __init
|
2005-04-17 06:20:36 +08:00
|
|
|
mem_init (void)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
2005-04-26 04:13:16 +08:00
|
|
|
BUG_ON(PTRS_PER_PGD * sizeof(pgd_t) != PAGE_SIZE);
|
|
|
|
BUG_ON(PTRS_PER_PMD * sizeof(pmd_t) != PAGE_SIZE);
|
|
|
|
BUG_ON(PTRS_PER_PTE * sizeof(pte_t) != PAGE_SIZE);
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
#ifdef CONFIG_PCI
|
|
|
|
/*
|
|
|
|
* This needs to be called _after_ the command line has been parsed but _before_
|
|
|
|
* any drivers that may need the PCI DMA interface are initialized or bootmem has
|
|
|
|
* been freed.
|
|
|
|
*/
|
|
|
|
platform_dma_init();
|
|
|
|
#endif
|
|
|
|
|
2005-10-05 03:13:57 +08:00
|
|
|
#ifdef CONFIG_FLATMEM
|
2009-03-10 13:10:30 +08:00
|
|
|
BUG_ON(!mem_map);
|
2005-04-17 06:20:36 +08:00
|
|
|
#endif
|
|
|
|
|
2013-07-04 06:04:25 +08:00
|
|
|
set_max_mapnr(max_low_pfn);
|
2005-04-17 06:20:36 +08:00
|
|
|
high_memory = __va(max_low_pfn * PAGE_SIZE);
|
2018-10-31 06:09:30 +08:00
|
|
|
memblock_free_all();
|
2013-07-04 06:03:58 +08:00
|
|
|
mem_init_print_info(NULL);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* For fsyscall entrpoints with no light-weight handler, use the ordinary
|
|
|
|
* (heavy-weight) handler, but mark it by setting bit 0, so the fsyscall entry
|
|
|
|
* code can tell them apart.
|
|
|
|
*/
|
|
|
|
for (i = 0; i < NR_syscalls; ++i) {
|
2015-06-03 02:42:02 +08:00
|
|
|
extern unsigned long fsyscall_table[NR_syscalls];
|
2005-04-17 06:20:36 +08:00
|
|
|
extern unsigned long sys_call_table[NR_syscalls];
|
|
|
|
|
|
|
|
if (!fsyscall_table[i] || nolwsys)
|
|
|
|
fsyscall_table[i] = sys_call_table[i] | 1;
|
|
|
|
}
|
|
|
|
setup_gate();
|
|
|
|
}
|
2006-01-07 10:50:38 +08:00
|
|
|
|
|
|
|
#ifdef CONFIG_MEMORY_HOTPLUG
|
2017-12-29 15:53:53 +08:00
|
|
|
int arch_add_memory(int nid, u64 start, u64 size, struct vmem_altmap *altmap,
|
|
|
|
bool want_memblock)
|
2006-01-07 10:50:38 +08:00
|
|
|
{
|
|
|
|
unsigned long start_pfn = start >> PAGE_SHIFT;
|
|
|
|
unsigned long nr_pages = size >> PAGE_SHIFT;
|
|
|
|
int ret;
|
|
|
|
|
2017-12-29 15:53:53 +08:00
|
|
|
ret = __add_pages(nid, start_pfn, nr_pages, altmap, want_memblock);
|
2006-01-07 10:50:38 +08:00
|
|
|
if (ret)
|
|
|
|
printk("%s: Problem encountered in __add_pages() as ret=%d\n",
|
2008-03-05 07:15:00 +08:00
|
|
|
__func__, ret);
|
2006-01-07 10:50:38 +08:00
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
2013-02-23 08:32:58 +08:00
|
|
|
|
|
|
|
#ifdef CONFIG_MEMORY_HOTREMOVE
|
2017-12-29 15:53:55 +08:00
|
|
|
int arch_remove_memory(u64 start, u64 size, struct vmem_altmap *altmap)
|
2013-02-23 08:32:58 +08:00
|
|
|
{
|
|
|
|
unsigned long start_pfn = start >> PAGE_SHIFT;
|
|
|
|
unsigned long nr_pages = size >> PAGE_SHIFT;
|
|
|
|
struct zone *zone;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
zone = page_zone(pfn_to_page(start_pfn));
|
2017-12-29 15:53:55 +08:00
|
|
|
ret = __remove_pages(zone, start_pfn, nr_pages, altmap);
|
2013-02-23 08:32:58 +08:00
|
|
|
if (ret)
|
|
|
|
pr_warn("%s: Problem encountered in __remove_pages() as"
|
|
|
|
" ret=%d\n", __func__, ret);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
#endif
|
2006-01-07 10:50:38 +08:00
|
|
|
#endif
|