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 17:07:57 +03:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
2005-04-17 02:20:36 +04:00
|
|
|
#ifndef _ASM_IA64_PGTABLE_H
|
|
|
|
#define _ASM_IA64_PGTABLE_H
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This file contains the functions and defines necessary to modify and use
|
|
|
|
* the IA-64 page table tree.
|
|
|
|
*
|
|
|
|
* This hopefully works with any (fixed) IA-64 page-size, as defined
|
|
|
|
* in <asm/page.h>.
|
|
|
|
*
|
2005-06-08 21:45:00 +04:00
|
|
|
* Copyright (C) 1998-2005 Hewlett-Packard Co
|
2005-04-17 02:20:36 +04:00
|
|
|
* David Mosberger-Tang <davidm@hpl.hp.com>
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#include <asm/mman.h>
|
|
|
|
#include <asm/page.h>
|
|
|
|
#include <asm/processor.h>
|
|
|
|
#include <asm/types.h>
|
|
|
|
|
|
|
|
#define IA64_MAX_PHYS_BITS 50 /* max. number of physical address bits (architected) */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* First, define the various bits in a PTE. Note that the PTE format
|
|
|
|
* matches the VHPT short format, the firt doubleword of the VHPD long
|
|
|
|
* format, and the first doubleword of the TLB insertion format.
|
|
|
|
*/
|
|
|
|
#define _PAGE_P_BIT 0
|
|
|
|
#define _PAGE_A_BIT 5
|
|
|
|
#define _PAGE_D_BIT 6
|
|
|
|
|
|
|
|
#define _PAGE_P (1 << _PAGE_P_BIT) /* page present bit */
|
|
|
|
#define _PAGE_MA_WB (0x0 << 2) /* write back memory attribute */
|
|
|
|
#define _PAGE_MA_UC (0x4 << 2) /* uncacheable memory attribute */
|
|
|
|
#define _PAGE_MA_UCE (0x5 << 2) /* UC exported attribute */
|
|
|
|
#define _PAGE_MA_WC (0x6 << 2) /* write coalescing memory attribute */
|
|
|
|
#define _PAGE_MA_NAT (0x7 << 2) /* not-a-thing attribute */
|
|
|
|
#define _PAGE_MA_MASK (0x7 << 2)
|
|
|
|
#define _PAGE_PL_0 (0 << 7) /* privilege level 0 (kernel) */
|
|
|
|
#define _PAGE_PL_1 (1 << 7) /* privilege level 1 (unused) */
|
|
|
|
#define _PAGE_PL_2 (2 << 7) /* privilege level 2 (unused) */
|
|
|
|
#define _PAGE_PL_3 (3 << 7) /* privilege level 3 (user) */
|
|
|
|
#define _PAGE_PL_MASK (3 << 7)
|
|
|
|
#define _PAGE_AR_R (0 << 9) /* read only */
|
|
|
|
#define _PAGE_AR_RX (1 << 9) /* read & execute */
|
|
|
|
#define _PAGE_AR_RW (2 << 9) /* read & write */
|
|
|
|
#define _PAGE_AR_RWX (3 << 9) /* read, write & execute */
|
|
|
|
#define _PAGE_AR_R_RW (4 << 9) /* read / read & write */
|
|
|
|
#define _PAGE_AR_RX_RWX (5 << 9) /* read & exec / read, write & exec */
|
|
|
|
#define _PAGE_AR_RWX_RW (6 << 9) /* read, write & exec / read & write */
|
|
|
|
#define _PAGE_AR_X_RX (7 << 9) /* exec & promote / read & exec */
|
|
|
|
#define _PAGE_AR_MASK (7 << 9)
|
|
|
|
#define _PAGE_AR_SHIFT 9
|
|
|
|
#define _PAGE_A (1 << _PAGE_A_BIT) /* page accessed bit */
|
|
|
|
#define _PAGE_D (1 << _PAGE_D_BIT) /* page dirty bit */
|
|
|
|
#define _PAGE_PPN_MASK (((__IA64_UL(1) << IA64_MAX_PHYS_BITS) - 1) & ~0xfffUL)
|
|
|
|
#define _PAGE_ED (__IA64_UL(1) << 52) /* exception deferral */
|
|
|
|
#define _PAGE_PROTNONE (__IA64_UL(1) << 63)
|
|
|
|
|
|
|
|
#define _PFN_MASK _PAGE_PPN_MASK
|
|
|
|
/* Mask of bits which may be changed by pte_modify(); the odd bits are there for _PAGE_PROTNONE */
|
|
|
|
#define _PAGE_CHG_MASK (_PAGE_P | _PAGE_PROTNONE | _PAGE_PL_MASK | _PAGE_AR_MASK | _PAGE_ED)
|
|
|
|
|
|
|
|
#define _PAGE_SIZE_4K 12
|
|
|
|
#define _PAGE_SIZE_8K 13
|
|
|
|
#define _PAGE_SIZE_16K 14
|
|
|
|
#define _PAGE_SIZE_64K 16
|
|
|
|
#define _PAGE_SIZE_256K 18
|
|
|
|
#define _PAGE_SIZE_1M 20
|
|
|
|
#define _PAGE_SIZE_4M 22
|
|
|
|
#define _PAGE_SIZE_16M 24
|
|
|
|
#define _PAGE_SIZE_64M 26
|
|
|
|
#define _PAGE_SIZE_256M 28
|
|
|
|
#define _PAGE_SIZE_1G 30
|
|
|
|
#define _PAGE_SIZE_4G 32
|
|
|
|
|
|
|
|
#define __ACCESS_BITS _PAGE_ED | _PAGE_A | _PAGE_P | _PAGE_MA_WB
|
|
|
|
#define __DIRTY_BITS_NO_ED _PAGE_A | _PAGE_P | _PAGE_D | _PAGE_MA_WB
|
|
|
|
#define __DIRTY_BITS _PAGE_ED | __DIRTY_BITS_NO_ED
|
|
|
|
|
|
|
|
/*
|
2005-11-11 18:35:43 +03:00
|
|
|
* How many pointers will a page table level hold expressed in shift
|
2005-04-17 02:20:36 +04:00
|
|
|
*/
|
2005-11-11 18:35:43 +03:00
|
|
|
#define PTRS_PER_PTD_SHIFT (PAGE_SHIFT-3)
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/*
|
2005-11-11 18:35:43 +03:00
|
|
|
* Definitions for fourth level:
|
|
|
|
*/
|
|
|
|
#define PTRS_PER_PTE (__IA64_UL(1) << (PTRS_PER_PTD_SHIFT))
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Definitions for third level:
|
2005-04-17 02:20:36 +04:00
|
|
|
*
|
2005-11-11 18:35:43 +03:00
|
|
|
* PMD_SHIFT determines the size of the area a third-level page table
|
2005-04-17 02:20:36 +04:00
|
|
|
* can map.
|
|
|
|
*/
|
2005-11-11 18:35:43 +03:00
|
|
|
#define PMD_SHIFT (PAGE_SHIFT + (PTRS_PER_PTD_SHIFT))
|
2005-04-17 02:20:36 +04:00
|
|
|
#define PMD_SIZE (1UL << PMD_SHIFT)
|
|
|
|
#define PMD_MASK (~(PMD_SIZE-1))
|
2005-11-11 18:35:43 +03:00
|
|
|
#define PTRS_PER_PMD (1UL << (PTRS_PER_PTD_SHIFT))
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2015-04-15 01:45:45 +03:00
|
|
|
#if CONFIG_PGTABLE_LEVELS == 4
|
2005-04-17 02:20:36 +04:00
|
|
|
/*
|
2005-11-11 18:35:43 +03:00
|
|
|
* Definitions for second level:
|
|
|
|
*
|
|
|
|
* PUD_SHIFT determines the size of the area a second-level page table
|
|
|
|
* can map.
|
2005-04-17 02:20:36 +04:00
|
|
|
*/
|
2005-11-11 18:35:43 +03:00
|
|
|
#define PUD_SHIFT (PMD_SHIFT + (PTRS_PER_PTD_SHIFT))
|
|
|
|
#define PUD_SIZE (1UL << PUD_SHIFT)
|
|
|
|
#define PUD_MASK (~(PUD_SIZE-1))
|
|
|
|
#define PTRS_PER_PUD (1UL << (PTRS_PER_PTD_SHIFT))
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Definitions for first level:
|
|
|
|
*
|
|
|
|
* PGDIR_SHIFT determines what a first-level page table entry can map.
|
|
|
|
*/
|
2015-04-15 01:45:45 +03:00
|
|
|
#if CONFIG_PGTABLE_LEVELS == 4
|
2005-11-11 18:35:43 +03:00
|
|
|
#define PGDIR_SHIFT (PUD_SHIFT + (PTRS_PER_PTD_SHIFT))
|
|
|
|
#else
|
|
|
|
#define PGDIR_SHIFT (PMD_SHIFT + (PTRS_PER_PTD_SHIFT))
|
|
|
|
#endif
|
|
|
|
#define PGDIR_SIZE (__IA64_UL(1) << PGDIR_SHIFT)
|
|
|
|
#define PGDIR_MASK (~(PGDIR_SIZE-1))
|
|
|
|
#define PTRS_PER_PGD_SHIFT PTRS_PER_PTD_SHIFT
|
|
|
|
#define PTRS_PER_PGD (1UL << PTRS_PER_PGD_SHIFT)
|
|
|
|
#define USER_PTRS_PER_PGD (5*PTRS_PER_PGD/8) /* regions 0-4 are user regions */
|
2015-02-12 02:26:41 +03:00
|
|
|
#define FIRST_USER_ADDRESS 0UL
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* All the normal masks have the "page accessed" bits on, as any time
|
|
|
|
* they are used, the page is accessed. They are cleared only by the
|
|
|
|
* page-out routines.
|
|
|
|
*/
|
|
|
|
#define PAGE_NONE __pgprot(_PAGE_PROTNONE | _PAGE_A)
|
|
|
|
#define PAGE_SHARED __pgprot(__ACCESS_BITS | _PAGE_PL_3 | _PAGE_AR_RW)
|
|
|
|
#define PAGE_READONLY __pgprot(__ACCESS_BITS | _PAGE_PL_3 | _PAGE_AR_R)
|
|
|
|
#define PAGE_COPY __pgprot(__ACCESS_BITS | _PAGE_PL_3 | _PAGE_AR_R)
|
|
|
|
#define PAGE_COPY_EXEC __pgprot(__ACCESS_BITS | _PAGE_PL_3 | _PAGE_AR_RX)
|
|
|
|
#define PAGE_GATE __pgprot(__ACCESS_BITS | _PAGE_PL_0 | _PAGE_AR_X_RX)
|
|
|
|
#define PAGE_KERNEL __pgprot(__DIRTY_BITS | _PAGE_PL_0 | _PAGE_AR_RWX)
|
|
|
|
#define PAGE_KERNELRX __pgprot(__ACCESS_BITS | _PAGE_PL_0 | _PAGE_AR_RX)
|
2009-02-25 19:38:52 +03:00
|
|
|
#define PAGE_KERNEL_UC __pgprot(__DIRTY_BITS | _PAGE_PL_0 | _PAGE_AR_RWX | \
|
|
|
|
_PAGE_MA_UC)
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
# ifndef __ASSEMBLY__
|
|
|
|
|
2017-02-04 02:16:44 +03:00
|
|
|
#include <linux/sched/mm.h> /* for mm_struct */
|
2007-10-19 10:40:25 +04:00
|
|
|
#include <linux/bitops.h>
|
2005-04-17 02:20:36 +04:00
|
|
|
#include <asm/cacheflush.h>
|
|
|
|
#include <asm/mmu_context.h>
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Next come the mappings that determine how mmap() protection bits
|
|
|
|
* (PROT_EXEC, PROT_READ, PROT_WRITE, PROT_NONE) get implemented. The
|
|
|
|
* _P version gets used for a private shared memory segment, the _S
|
|
|
|
* version gets used for a shared memory segment with MAP_SHARED on.
|
|
|
|
* In a private shared memory segment, we do a copy-on-write if a task
|
|
|
|
* attempts to write to the page.
|
|
|
|
*/
|
|
|
|
/* xwr */
|
|
|
|
#define __P000 PAGE_NONE
|
|
|
|
#define __P001 PAGE_READONLY
|
|
|
|
#define __P010 PAGE_READONLY /* write to priv pg -> copy & make writable */
|
|
|
|
#define __P011 PAGE_READONLY /* ditto */
|
|
|
|
#define __P100 __pgprot(__ACCESS_BITS | _PAGE_PL_3 | _PAGE_AR_X_RX)
|
|
|
|
#define __P101 __pgprot(__ACCESS_BITS | _PAGE_PL_3 | _PAGE_AR_RX)
|
|
|
|
#define __P110 PAGE_COPY_EXEC
|
|
|
|
#define __P111 PAGE_COPY_EXEC
|
|
|
|
|
|
|
|
#define __S000 PAGE_NONE
|
|
|
|
#define __S001 PAGE_READONLY
|
|
|
|
#define __S010 PAGE_SHARED /* we don't have (and don't need) write-only */
|
|
|
|
#define __S011 PAGE_SHARED
|
|
|
|
#define __S100 __pgprot(__ACCESS_BITS | _PAGE_PL_3 | _PAGE_AR_X_RX)
|
|
|
|
#define __S101 __pgprot(__ACCESS_BITS | _PAGE_PL_3 | _PAGE_AR_RX)
|
|
|
|
#define __S110 __pgprot(__ACCESS_BITS | _PAGE_PL_3 | _PAGE_AR_RWX)
|
|
|
|
#define __S111 __pgprot(__ACCESS_BITS | _PAGE_PL_3 | _PAGE_AR_RWX)
|
|
|
|
|
|
|
|
#define pgd_ERROR(e) printk("%s:%d: bad pgd %016lx.\n", __FILE__, __LINE__, pgd_val(e))
|
2015-04-15 01:45:45 +03:00
|
|
|
#if CONFIG_PGTABLE_LEVELS == 4
|
2005-11-11 18:35:43 +03:00
|
|
|
#define pud_ERROR(e) printk("%s:%d: bad pud %016lx.\n", __FILE__, __LINE__, pud_val(e))
|
|
|
|
#endif
|
2005-04-17 02:20:36 +04:00
|
|
|
#define pmd_ERROR(e) printk("%s:%d: bad pmd %016lx.\n", __FILE__, __LINE__, pmd_val(e))
|
|
|
|
#define pte_ERROR(e) printk("%s:%d: bad pte %016lx.\n", __FILE__, __LINE__, pte_val(e))
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Some definitions to translate between mem_map, PTEs, and page addresses:
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
/* Quick test to see if ADDR is a (potentially) valid physical address. */
|
|
|
|
static inline long
|
|
|
|
ia64_phys_addr_valid (unsigned long addr)
|
|
|
|
{
|
|
|
|
return (addr & (local_cpu_data->unimpl_pa_mask)) == 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* kern_addr_valid(ADDR) tests if ADDR is pointing to valid kernel
|
|
|
|
* memory. For the return value to be meaningful, ADDR must be >=
|
|
|
|
* PAGE_OFFSET. This operation can be relatively expensive (e.g.,
|
|
|
|
* require a hash-, or multi-level tree-lookup or something of that
|
|
|
|
* sort) but it guarantees to return TRUE only if accessing the page
|
|
|
|
* at that address does not cause an error. Note that there may be
|
|
|
|
* addresses for which kern_addr_valid() returns FALSE even though an
|
|
|
|
* access would not cause an error (e.g., this is typically true for
|
|
|
|
* memory mapped I/O regions.
|
|
|
|
*
|
|
|
|
* XXX Need to implement this for IA-64.
|
|
|
|
*/
|
|
|
|
#define kern_addr_valid(addr) (1)
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Now come the defines and routines to manage and access the three-level
|
|
|
|
* page table.
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
2005-08-17 06:54:00 +04:00
|
|
|
#define VMALLOC_START (RGN_BASE(RGN_GATE) + 0x200000000UL)
|
2005-04-17 02:20:36 +04:00
|
|
|
#ifdef CONFIG_VIRTUAL_MEM_MAP
|
2005-08-17 06:54:00 +04:00
|
|
|
# define VMALLOC_END_INIT (RGN_BASE(RGN_GATE) + (1UL << (4*PAGE_SHIFT - 9)))
|
2009-10-02 08:28:55 +04:00
|
|
|
extern unsigned long VMALLOC_END;
|
2005-04-17 02:20:36 +04:00
|
|
|
#else
|
2007-10-16 12:24:15 +04:00
|
|
|
#if defined(CONFIG_SPARSEMEM) && defined(CONFIG_SPARSEMEM_VMEMMAP)
|
|
|
|
/* SPARSEMEM_VMEMMAP uses half of vmalloc... */
|
|
|
|
# define VMALLOC_END (RGN_BASE(RGN_GATE) + (1UL << (4*PAGE_SHIFT - 10)))
|
|
|
|
# define vmemmap ((struct page *)VMALLOC_END)
|
|
|
|
#else
|
2005-08-17 06:54:00 +04:00
|
|
|
# define VMALLOC_END (RGN_BASE(RGN_GATE) + (1UL << (4*PAGE_SHIFT - 9)))
|
2005-04-17 02:20:36 +04:00
|
|
|
#endif
|
2007-10-16 12:24:15 +04:00
|
|
|
#endif
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/* fs/proc/kcore.c */
|
2005-08-17 06:54:00 +04:00
|
|
|
#define kc_vaddr_to_offset(v) ((v) - RGN_BASE(RGN_GATE))
|
|
|
|
#define kc_offset_to_vaddr(o) ((o) + RGN_BASE(RGN_GATE))
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2005-11-11 18:35:43 +03:00
|
|
|
#define RGN_MAP_SHIFT (PGDIR_SHIFT + PTRS_PER_PGD_SHIFT - 3)
|
|
|
|
#define RGN_MAP_LIMIT ((1UL << RGN_MAP_SHIFT) - PAGE_SIZE) /* per region addr limit */
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
/*
|
|
|
|
* Conversion functions: convert page frame number (pfn) and a protection value to a page
|
|
|
|
* table entry (pte).
|
|
|
|
*/
|
|
|
|
#define pfn_pte(pfn, pgprot) \
|
|
|
|
({ pte_t __pte; pte_val(__pte) = ((pfn) << PAGE_SHIFT) | pgprot_val(pgprot); __pte; })
|
|
|
|
|
|
|
|
/* Extract pfn from pte. */
|
|
|
|
#define pte_pfn(_pte) ((pte_val(_pte) & _PFN_MASK) >> PAGE_SHIFT)
|
|
|
|
|
|
|
|
#define mk_pte(page, pgprot) pfn_pte(page_to_pfn(page), (pgprot))
|
|
|
|
|
|
|
|
/* This takes a physical page address that is used by the remapping functions */
|
|
|
|
#define mk_pte_phys(physpage, pgprot) \
|
|
|
|
({ pte_t __pte; pte_val(__pte) = physpage + pgprot_val(pgprot); __pte; })
|
|
|
|
|
|
|
|
#define pte_modify(_pte, newprot) \
|
|
|
|
(__pte((pte_val(_pte) & ~_PAGE_CHG_MASK) | (pgprot_val(newprot) & _PAGE_CHG_MASK)))
|
|
|
|
|
|
|
|
#define pte_none(pte) (!pte_val(pte))
|
|
|
|
#define pte_present(pte) (pte_val(pte) & (_PAGE_P | _PAGE_PROTNONE))
|
|
|
|
#define pte_clear(mm,addr,pte) (pte_val(*(pte)) = 0UL)
|
|
|
|
/* pte_page() returns the "struct page *" corresponding to the PTE: */
|
|
|
|
#define pte_page(pte) virt_to_page(((pte_val(pte) & _PFN_MASK) + PAGE_OFFSET))
|
|
|
|
|
|
|
|
#define pmd_none(pmd) (!pmd_val(pmd))
|
|
|
|
#define pmd_bad(pmd) (!ia64_phys_addr_valid(pmd_val(pmd)))
|
|
|
|
#define pmd_present(pmd) (pmd_val(pmd) != 0UL)
|
|
|
|
#define pmd_clear(pmdp) (pmd_val(*(pmdp)) = 0UL)
|
2006-09-26 10:31:48 +04:00
|
|
|
#define pmd_page_vaddr(pmd) ((unsigned long) __va(pmd_val(pmd) & _PFN_MASK))
|
2005-04-17 02:20:36 +04:00
|
|
|
#define pmd_page(pmd) virt_to_page((pmd_val(pmd) + PAGE_OFFSET))
|
|
|
|
|
|
|
|
#define pud_none(pud) (!pud_val(pud))
|
|
|
|
#define pud_bad(pud) (!ia64_phys_addr_valid(pud_val(pud)))
|
|
|
|
#define pud_present(pud) (pud_val(pud) != 0UL)
|
|
|
|
#define pud_clear(pudp) (pud_val(*(pudp)) = 0UL)
|
2006-09-26 10:31:48 +04:00
|
|
|
#define pud_page_vaddr(pud) ((unsigned long) __va(pud_val(pud) & _PFN_MASK))
|
|
|
|
#define pud_page(pud) virt_to_page((pud_val(pud) + PAGE_OFFSET))
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2015-04-15 01:45:45 +03:00
|
|
|
#if CONFIG_PGTABLE_LEVELS == 4
|
2005-11-11 18:35:43 +03:00
|
|
|
#define pgd_none(pgd) (!pgd_val(pgd))
|
|
|
|
#define pgd_bad(pgd) (!ia64_phys_addr_valid(pgd_val(pgd)))
|
|
|
|
#define pgd_present(pgd) (pgd_val(pgd) != 0UL)
|
|
|
|
#define pgd_clear(pgdp) (pgd_val(*(pgdp)) = 0UL)
|
2006-09-26 10:31:48 +04:00
|
|
|
#define pgd_page_vaddr(pgd) ((unsigned long) __va(pgd_val(pgd) & _PFN_MASK))
|
|
|
|
#define pgd_page(pgd) virt_to_page((pgd_val(pgd) + PAGE_OFFSET))
|
2005-11-11 18:35:43 +03:00
|
|
|
#endif
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
/*
|
|
|
|
* The following have defined behavior only work if pte_present() is true.
|
|
|
|
*/
|
|
|
|
#define pte_write(pte) ((unsigned) (((pte_val(pte) & _PAGE_AR_MASK) >> _PAGE_AR_SHIFT) - 2) <= 4)
|
|
|
|
#define pte_exec(pte) ((pte_val(pte) & _PAGE_AR_RX) != 0)
|
|
|
|
#define pte_dirty(pte) ((pte_val(pte) & _PAGE_D) != 0)
|
|
|
|
#define pte_young(pte) ((pte_val(pte) & _PAGE_A) != 0)
|
mm: introduce pte_special pte bit
s390 for one, cannot implement VM_MIXEDMAP with pfn_valid, due to their memory
model (which is more dynamic than most). Instead, they had proposed to
implement it with an additional path through vm_normal_page(), using a bit in
the pte to determine whether or not the page should be refcounted:
vm_normal_page()
{
...
if (unlikely(vma->vm_flags & (VM_PFNMAP|VM_MIXEDMAP))) {
if (vma->vm_flags & VM_MIXEDMAP) {
#ifdef s390
if (!mixedmap_refcount_pte(pte))
return NULL;
#else
if (!pfn_valid(pfn))
return NULL;
#endif
goto out;
}
...
}
This is fine, however if we are allowed to use a bit in the pte to determine
refcountedness, we can use that to _completely_ replace all the vma based
schemes. So instead of adding more cases to the already complex vma-based
scheme, we can have a clearly seperate and simple pte-based scheme (and get
slightly better code generation in the process):
vm_normal_page()
{
#ifdef s390
if (!mixedmap_refcount_pte(pte))
return NULL;
return pte_page(pte);
#else
...
#endif
}
And finally, we may rather make this concept usable by any architecture rather
than making it s390 only, so implement a new type of pte state for this.
Unfortunately the old vma based code must stay, because some architectures may
not be able to spare pte bits. This makes vm_normal_page a little bit more
ugly than we would like, but the 2 cases are clearly seperate.
So introduce a pte_special pte state, and use it in mm/memory.c. It is
currently a noop for all architectures, so this doesn't actually result in any
compiled code changes to mm/memory.o.
BTW:
I haven't put vm_normal_page() into arch code as-per an earlier suggestion.
The reason is that, regardless of where vm_normal_page is actually
implemented, the *abstraction* is still exactly the same. Also, while it
depends on whether the architecture has pte_special or not, that is the
only two possible cases, and it really isn't an arch specific function --
the role of the arch code should be to provide primitive functions and
accessors with which to build the core code; pte_special does that. We do
not want architectures to know or care about vm_normal_page itself, and
we definitely don't want them being able to invent something new there
out of sight of mm/ code. If we made vm_normal_page an arch function, then
we have to make vm_insert_mixed (next patch) an arch function too. So I
don't think moving it to arch code fundamentally improves any abstractions,
while it does practically make the code more difficult to follow, for both
mm and arch developers, and easier to misuse.
[akpm@linux-foundation.org: build fix]
Signed-off-by: Nick Piggin <npiggin@suse.de>
Acked-by: Carsten Otte <cotte@de.ibm.com>
Cc: Jared Hulbert <jaredeh@gmail.com>
Cc: Martin Schwidefsky <schwidefsky@de.ibm.com>
Cc: Heiko Carstens <heiko.carstens@de.ibm.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2008-04-28 13:13:00 +04:00
|
|
|
#define pte_special(pte) 0
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
/*
|
|
|
|
* Note: we convert AR_RWX to AR_RX and AR_RW to AR_R by clearing the 2nd bit in the
|
|
|
|
* access rights:
|
|
|
|
*/
|
|
|
|
#define pte_wrprotect(pte) (__pte(pte_val(pte) & ~_PAGE_AR_RW))
|
|
|
|
#define pte_mkwrite(pte) (__pte(pte_val(pte) | _PAGE_AR_RW))
|
|
|
|
#define pte_mkold(pte) (__pte(pte_val(pte) & ~_PAGE_A))
|
|
|
|
#define pte_mkyoung(pte) (__pte(pte_val(pte) | _PAGE_A))
|
|
|
|
#define pte_mkclean(pte) (__pte(pte_val(pte) & ~_PAGE_D))
|
|
|
|
#define pte_mkdirty(pte) (__pte(pte_val(pte) | _PAGE_D))
|
2006-03-22 11:08:50 +03:00
|
|
|
#define pte_mkhuge(pte) (__pte(pte_val(pte)))
|
mm: introduce pte_special pte bit
s390 for one, cannot implement VM_MIXEDMAP with pfn_valid, due to their memory
model (which is more dynamic than most). Instead, they had proposed to
implement it with an additional path through vm_normal_page(), using a bit in
the pte to determine whether or not the page should be refcounted:
vm_normal_page()
{
...
if (unlikely(vma->vm_flags & (VM_PFNMAP|VM_MIXEDMAP))) {
if (vma->vm_flags & VM_MIXEDMAP) {
#ifdef s390
if (!mixedmap_refcount_pte(pte))
return NULL;
#else
if (!pfn_valid(pfn))
return NULL;
#endif
goto out;
}
...
}
This is fine, however if we are allowed to use a bit in the pte to determine
refcountedness, we can use that to _completely_ replace all the vma based
schemes. So instead of adding more cases to the already complex vma-based
scheme, we can have a clearly seperate and simple pte-based scheme (and get
slightly better code generation in the process):
vm_normal_page()
{
#ifdef s390
if (!mixedmap_refcount_pte(pte))
return NULL;
return pte_page(pte);
#else
...
#endif
}
And finally, we may rather make this concept usable by any architecture rather
than making it s390 only, so implement a new type of pte state for this.
Unfortunately the old vma based code must stay, because some architectures may
not be able to spare pte bits. This makes vm_normal_page a little bit more
ugly than we would like, but the 2 cases are clearly seperate.
So introduce a pte_special pte state, and use it in mm/memory.c. It is
currently a noop for all architectures, so this doesn't actually result in any
compiled code changes to mm/memory.o.
BTW:
I haven't put vm_normal_page() into arch code as-per an earlier suggestion.
The reason is that, regardless of where vm_normal_page is actually
implemented, the *abstraction* is still exactly the same. Also, while it
depends on whether the architecture has pte_special or not, that is the
only two possible cases, and it really isn't an arch specific function --
the role of the arch code should be to provide primitive functions and
accessors with which to build the core code; pte_special does that. We do
not want architectures to know or care about vm_normal_page itself, and
we definitely don't want them being able to invent something new there
out of sight of mm/ code. If we made vm_normal_page an arch function, then
we have to make vm_insert_mixed (next patch) an arch function too. So I
don't think moving it to arch code fundamentally improves any abstractions,
while it does practically make the code more difficult to follow, for both
mm and arch developers, and easier to misuse.
[akpm@linux-foundation.org: build fix]
Signed-off-by: Nick Piggin <npiggin@suse.de>
Acked-by: Carsten Otte <cotte@de.ibm.com>
Cc: Jared Hulbert <jaredeh@gmail.com>
Cc: Martin Schwidefsky <schwidefsky@de.ibm.com>
Cc: Heiko Carstens <heiko.carstens@de.ibm.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2008-04-28 13:13:00 +04:00
|
|
|
#define pte_mkspecial(pte) (pte)
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2007-10-16 12:25:44 +04:00
|
|
|
/*
|
|
|
|
* Because ia64's Icache and Dcache is not coherent (on a cpu), we need to
|
|
|
|
* sync icache and dcache when we insert *new* executable page.
|
|
|
|
* __ia64_sync_icache_dcache() check Pg_arch_1 bit and flush icache
|
|
|
|
* if necessary.
|
|
|
|
*
|
|
|
|
* set_pte() is also called by the kernel, but we can expect that the kernel
|
|
|
|
* flushes icache explicitly if necessary.
|
|
|
|
*/
|
|
|
|
#define pte_present_exec_user(pte)\
|
|
|
|
((pte_val(pte) & (_PAGE_P | _PAGE_PL_MASK | _PAGE_AR_RX)) == \
|
|
|
|
(_PAGE_P | _PAGE_PL_3 | _PAGE_AR_RX))
|
|
|
|
|
|
|
|
extern void __ia64_sync_icache_dcache(pte_t pteval);
|
|
|
|
static inline void set_pte(pte_t *ptep, pte_t pteval)
|
|
|
|
{
|
|
|
|
/* page is present && page is user && page is executable
|
|
|
|
* && (page swapin or new page or page migraton
|
|
|
|
* || copy_on_write with page copying.)
|
|
|
|
*/
|
|
|
|
if (pte_present_exec_user(pteval) &&
|
|
|
|
(!pte_present(*ptep) ||
|
|
|
|
pte_pfn(*ptep) != pte_pfn(pteval)))
|
|
|
|
/* load_module() calles flush_icache_range() explicitly*/
|
|
|
|
__ia64_sync_icache_dcache(pteval);
|
|
|
|
*ptep = pteval;
|
|
|
|
}
|
|
|
|
|
|
|
|
#define set_pte_at(mm,addr,ptep,pteval) set_pte(ptep,pteval)
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
/*
|
2006-05-06 03:19:50 +04:00
|
|
|
* Make page protection values cacheable, uncacheable, or write-
|
|
|
|
* combining. Note that "protection" is really a misnomer here as the
|
|
|
|
* protection value contains the memory attribute bits, dirty bits, and
|
|
|
|
* various other bits as well.
|
2005-04-17 02:20:36 +04:00
|
|
|
*/
|
2006-05-06 03:19:50 +04:00
|
|
|
#define pgprot_cacheable(prot) __pgprot((pgprot_val(prot) & ~_PAGE_MA_MASK) | _PAGE_MA_WB)
|
2005-04-17 02:20:36 +04:00
|
|
|
#define pgprot_noncached(prot) __pgprot((pgprot_val(prot) & ~_PAGE_MA_MASK) | _PAGE_MA_UC)
|
|
|
|
#define pgprot_writecombine(prot) __pgprot((pgprot_val(prot) & ~_PAGE_MA_MASK) | _PAGE_MA_WC)
|
|
|
|
|
2006-05-06 03:19:50 +04:00
|
|
|
struct file;
|
|
|
|
extern pgprot_t phys_mem_access_prot(struct file *file, unsigned long pfn,
|
|
|
|
unsigned long size, pgprot_t vma_prot);
|
|
|
|
#define __HAVE_PHYS_MEM_ACCESS_PROT
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
static inline unsigned long
|
|
|
|
pgd_index (unsigned long address)
|
|
|
|
{
|
|
|
|
unsigned long region = address >> 61;
|
|
|
|
unsigned long l1index = (address >> PGDIR_SHIFT) & ((PTRS_PER_PGD >> 3) - 1);
|
|
|
|
|
|
|
|
return (region << (PAGE_SHIFT - 6)) | l1index;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* The offset in the 1-level directory is given by the 3 region bits
|
|
|
|
(61..63) and the level-1 bits. */
|
|
|
|
static inline pgd_t*
|
2008-04-09 07:26:10 +04:00
|
|
|
pgd_offset (const struct mm_struct *mm, unsigned long address)
|
2005-04-17 02:20:36 +04:00
|
|
|
{
|
|
|
|
return mm->pgd + pgd_index(address);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* In the kernel's mapped region we completely ignore the region number
|
|
|
|
(since we know it's in region number 5). */
|
|
|
|
#define pgd_offset_k(addr) \
|
|
|
|
(init_mm.pgd + (((addr) >> PGDIR_SHIFT) & (PTRS_PER_PGD - 1)))
|
|
|
|
|
|
|
|
/* Look up a pgd entry in the gate area. On IA-64, the gate-area
|
|
|
|
resides in the kernel-mapped segment, hence we use pgd_offset_k()
|
|
|
|
here. */
|
|
|
|
#define pgd_offset_gate(mm, addr) pgd_offset_k(addr)
|
|
|
|
|
2015-04-15 01:45:45 +03:00
|
|
|
#if CONFIG_PGTABLE_LEVELS == 4
|
2005-04-17 02:20:36 +04:00
|
|
|
/* Find an entry in the second-level page table.. */
|
2005-11-11 18:35:43 +03:00
|
|
|
#define pud_offset(dir,addr) \
|
2006-09-26 10:31:48 +04:00
|
|
|
((pud_t *) pgd_page_vaddr(*(dir)) + (((addr) >> PUD_SHIFT) & (PTRS_PER_PUD - 1)))
|
2005-11-11 18:35:43 +03:00
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Find an entry in the third-level page table.. */
|
2005-04-17 02:20:36 +04:00
|
|
|
#define pmd_offset(dir,addr) \
|
2006-09-26 10:31:48 +04:00
|
|
|
((pmd_t *) pud_page_vaddr(*(dir)) + (((addr) >> PMD_SHIFT) & (PTRS_PER_PMD - 1)))
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Find an entry in the third-level page table. This looks more complicated than it
|
|
|
|
* should be because some platforms place page tables in high memory.
|
|
|
|
*/
|
|
|
|
#define pte_index(addr) (((addr) >> PAGE_SHIFT) & (PTRS_PER_PTE - 1))
|
2006-09-26 10:31:48 +04:00
|
|
|
#define pte_offset_kernel(dir,addr) ((pte_t *) pmd_page_vaddr(*(dir)) + pte_index(addr))
|
2005-04-17 02:20:36 +04:00
|
|
|
#define pte_offset_map(dir,addr) pte_offset_kernel(dir, addr)
|
|
|
|
#define pte_unmap(pte) do { } while (0)
|
|
|
|
|
|
|
|
/* atomic versions of the some PTE manipulations: */
|
|
|
|
|
|
|
|
static inline int
|
|
|
|
ptep_test_and_clear_young (struct vm_area_struct *vma, unsigned long addr, pte_t *ptep)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_SMP
|
|
|
|
if (!pte_young(*ptep))
|
|
|
|
return 0;
|
|
|
|
return test_and_clear_bit(_PAGE_A_BIT, ptep);
|
|
|
|
#else
|
|
|
|
pte_t pte = *ptep;
|
|
|
|
if (!pte_young(pte))
|
|
|
|
return 0;
|
|
|
|
set_pte_at(vma->vm_mm, addr, ptep, pte_mkold(pte));
|
|
|
|
return 1;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline pte_t
|
|
|
|
ptep_get_and_clear(struct mm_struct *mm, unsigned long addr, pte_t *ptep)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_SMP
|
|
|
|
return __pte(xchg((long *) ptep, 0));
|
|
|
|
#else
|
|
|
|
pte_t pte = *ptep;
|
|
|
|
pte_clear(mm, addr, ptep);
|
|
|
|
return pte;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void
|
|
|
|
ptep_set_wrprotect(struct mm_struct *mm, unsigned long addr, pte_t *ptep)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_SMP
|
|
|
|
unsigned long new, old;
|
|
|
|
|
|
|
|
do {
|
|
|
|
old = pte_val(*ptep);
|
|
|
|
new = pte_val(pte_wrprotect(__pte (old)));
|
|
|
|
} while (cmpxchg((unsigned long *) ptep, old, new) != old);
|
|
|
|
#else
|
|
|
|
pte_t old_pte = *ptep;
|
|
|
|
set_pte_at(mm, addr, ptep, pte_wrprotect(old_pte));
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int
|
|
|
|
pte_same (pte_t a, pte_t b)
|
|
|
|
{
|
|
|
|
return pte_val(a) == pte_val(b);
|
|
|
|
}
|
|
|
|
|
MM: Pass a PTE pointer to update_mmu_cache() rather than the PTE itself
On VIVT ARM, when we have multiple shared mappings of the same file
in the same MM, we need to ensure that we have coherency across all
copies. We do this via make_coherent() by making the pages
uncacheable.
This used to work fine, until we allowed highmem with highpte - we
now have a page table which is mapped as required, and is not available
for modification via update_mmu_cache().
Ralf Beache suggested getting rid of the PTE value passed to
update_mmu_cache():
On MIPS update_mmu_cache() calls __update_tlb() which walks pagetables
to construct a pointer to the pte again. Passing a pte_t * is much
more elegant. Maybe we might even replace the pte argument with the
pte_t?
Ben Herrenschmidt would also like the pte pointer for PowerPC:
Passing the ptep in there is exactly what I want. I want that
-instead- of the PTE value, because I have issue on some ppc cases,
for I$/D$ coherency, where set_pte_at() may decide to mask out the
_PAGE_EXEC.
So, pass in the mapped page table pointer into update_mmu_cache(), and
remove the PTE value, updating all implementations and call sites to
suit.
Includes a fix from Stephen Rothwell:
sparc: fix fallout from update_mmu_cache API change
Signed-off-by: Stephen Rothwell <sfr@canb.auug.org.au>
Acked-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Signed-off-by: Russell King <rmk+kernel@arm.linux.org.uk>
2009-12-18 19:40:18 +03:00
|
|
|
#define update_mmu_cache(vma, address, ptep) do { } while (0)
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
extern pgd_t swapper_pg_dir[PTRS_PER_PGD];
|
|
|
|
extern void paging_init (void);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Note: The macros below rely on the fact that MAX_SWAPFILES_SHIFT <= number of
|
|
|
|
* bits in the swap-type field of the swap pte. It would be nice to
|
|
|
|
* enforce that, but we can't easily include <linux/swap.h> here.
|
|
|
|
* (Of course, better still would be to define MAX_SWAPFILES_SHIFT here...).
|
|
|
|
*
|
|
|
|
* Format of swap pte:
|
|
|
|
* bit 0 : present bit (must be zero)
|
2015-02-11 01:10:36 +03:00
|
|
|
* bits 1- 7: swap-type
|
|
|
|
* bits 8-62: swap offset
|
2005-04-17 02:20:36 +04:00
|
|
|
* bit 63 : _PAGE_PROTNONE bit
|
|
|
|
*/
|
2015-02-11 01:10:36 +03:00
|
|
|
#define __swp_type(entry) (((entry).val >> 1) & 0x7f)
|
|
|
|
#define __swp_offset(entry) (((entry).val << 1) >> 9)
|
|
|
|
#define __swp_entry(type,offset) ((swp_entry_t) { ((type) << 1) | ((long) (offset) << 8) })
|
2005-04-17 02:20:36 +04:00
|
|
|
#define __pte_to_swp_entry(pte) ((swp_entry_t) { pte_val(pte) })
|
|
|
|
#define __swp_entry_to_pte(x) ((pte_t) { (x).val })
|
|
|
|
|
|
|
|
/*
|
|
|
|
* ZERO_PAGE is a global shared page that is always zero: used
|
|
|
|
* for zero-mapped memory areas etc..
|
|
|
|
*/
|
|
|
|
extern unsigned long empty_zero_page[PAGE_SIZE/sizeof(unsigned long)];
|
|
|
|
extern struct page *zero_page_memmap_ptr;
|
|
|
|
#define ZERO_PAGE(vaddr) (zero_page_memmap_ptr)
|
|
|
|
|
|
|
|
/* We provide our own get_unmapped_area to cope with VA holes for userland */
|
|
|
|
#define HAVE_ARCH_UNMAPPED_AREA
|
|
|
|
|
|
|
|
#ifdef CONFIG_HUGETLB_PAGE
|
|
|
|
#define HUGETLB_PGDIR_SHIFT (HPAGE_SHIFT + 2*(PAGE_SHIFT-3))
|
|
|
|
#define HUGETLB_PGDIR_SIZE (__IA64_UL(1) << HUGETLB_PGDIR_SHIFT)
|
|
|
|
#define HUGETLB_PGDIR_MASK (~(HUGETLB_PGDIR_SIZE-1))
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
#define __HAVE_ARCH_PTEP_SET_ACCESS_FLAGS
|
|
|
|
/*
|
|
|
|
* Update PTEP with ENTRY, which is guaranteed to be a less
|
|
|
|
* restrictive PTE. That is, ENTRY may have the ACCESSED, DIRTY, and
|
|
|
|
* WRITABLE bits turned on, when the value at PTEP did not. The
|
|
|
|
* WRITABLE bit may only be turned if SAFELY_WRITABLE is TRUE.
|
|
|
|
*
|
|
|
|
* SAFELY_WRITABLE is TRUE if we can update the value at PTEP without
|
|
|
|
* having to worry about races. On SMP machines, there are only two
|
|
|
|
* cases where this is true:
|
|
|
|
*
|
|
|
|
* (1) *PTEP has the PRESENT bit turned OFF
|
|
|
|
* (2) ENTRY has the DIRTY bit turned ON
|
|
|
|
*
|
|
|
|
* On ia64, we could implement this routine with a cmpxchg()-loop
|
|
|
|
* which ORs in the _PAGE_A/_PAGE_D bit if they're set in ENTRY.
|
|
|
|
* However, like on x86, we can get a more streamlined version by
|
|
|
|
* observing that it is OK to drop ACCESSED bit updates when
|
|
|
|
* SAFELY_WRITABLE is FALSE. Besides being rare, all that would do is
|
|
|
|
* result in an extra Access-bit fault, which would then turn on the
|
|
|
|
* ACCESSED bit in the low-level fault handler (iaccess_bit or
|
|
|
|
* daccess_bit in ivt.S).
|
|
|
|
*/
|
|
|
|
#ifdef CONFIG_SMP
|
2007-06-16 21:16:12 +04:00
|
|
|
# define ptep_set_access_flags(__vma, __addr, __ptep, __entry, __safely_writable) \
|
|
|
|
({ \
|
|
|
|
int __changed = !pte_same(*(__ptep), __entry); \
|
|
|
|
if (__changed && __safely_writable) { \
|
|
|
|
set_pte(__ptep, __entry); \
|
|
|
|
flush_tlb_page(__vma, __addr); \
|
|
|
|
} \
|
|
|
|
__changed; \
|
|
|
|
})
|
2005-04-17 02:20:36 +04:00
|
|
|
#else
|
2007-06-16 21:16:12 +04:00
|
|
|
# define ptep_set_access_flags(__vma, __addr, __ptep, __entry, __safely_writable) \
|
|
|
|
({ \
|
|
|
|
int __changed = !pte_same(*(__ptep), __entry); \
|
2007-07-17 15:03:03 +04:00
|
|
|
if (__changed) { \
|
|
|
|
set_pte_at((__vma)->vm_mm, (__addr), __ptep, __entry); \
|
|
|
|
flush_tlb_page(__vma, __addr); \
|
|
|
|
} \
|
2007-06-16 21:16:12 +04:00
|
|
|
__changed; \
|
|
|
|
})
|
2005-04-17 02:20:36 +04:00
|
|
|
#endif
|
|
|
|
|
|
|
|
# ifdef CONFIG_VIRTUAL_MEM_MAP
|
|
|
|
/* arch mem_map init routine is needed due to holes in a virtual mem_map */
|
|
|
|
# define __HAVE_ARCH_MEMMAP_INIT
|
|
|
|
extern void memmap_init (unsigned long size, int nid, unsigned long zone,
|
|
|
|
unsigned long start_pfn);
|
|
|
|
# endif /* CONFIG_VIRTUAL_MEM_MAP */
|
|
|
|
# endif /* !__ASSEMBLY__ */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Identity-mapped regions use a large page size. We'll call such large pages
|
|
|
|
* "granules". If you can think of a better name that's unambiguous, let me
|
|
|
|
* know...
|
|
|
|
*/
|
|
|
|
#if defined(CONFIG_IA64_GRANULE_64MB)
|
|
|
|
# define IA64_GRANULE_SHIFT _PAGE_SIZE_64M
|
|
|
|
#elif defined(CONFIG_IA64_GRANULE_16MB)
|
|
|
|
# define IA64_GRANULE_SHIFT _PAGE_SIZE_16M
|
|
|
|
#endif
|
|
|
|
#define IA64_GRANULE_SIZE (1 << IA64_GRANULE_SHIFT)
|
|
|
|
/*
|
|
|
|
* log2() of the page size we use to map the kernel image (IA64_TR_KERNEL):
|
|
|
|
*/
|
|
|
|
#define KERNEL_TR_PAGE_SHIFT _PAGE_SIZE_64M
|
|
|
|
#define KERNEL_TR_PAGE_SIZE (1 << KERNEL_TR_PAGE_SHIFT)
|
|
|
|
|
|
|
|
/*
|
|
|
|
* No page table caches to initialise
|
|
|
|
*/
|
|
|
|
#define pgtable_cache_init() do { } while (0)
|
|
|
|
|
|
|
|
/* These tell get_user_pages() that the first gate page is accessible from user-level. */
|
|
|
|
#define FIXADDR_USER_START GATE_ADDR
|
2005-06-08 21:45:00 +04:00
|
|
|
#ifdef HAVE_BUGGY_SEGREL
|
|
|
|
# define FIXADDR_USER_END (GATE_ADDR + 2*PAGE_SIZE)
|
|
|
|
#else
|
|
|
|
# define FIXADDR_USER_END (GATE_ADDR + 2*PERCPU_PAGE_SIZE)
|
|
|
|
#endif
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
#define __HAVE_ARCH_PTEP_TEST_AND_CLEAR_YOUNG
|
|
|
|
#define __HAVE_ARCH_PTEP_GET_AND_CLEAR
|
|
|
|
#define __HAVE_ARCH_PTEP_SET_WRPROTECT
|
|
|
|
#define __HAVE_ARCH_PTE_SAME
|
|
|
|
#define __HAVE_ARCH_PGD_OFFSET_GATE
|
2007-10-16 12:25:44 +04:00
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2015-04-15 01:45:45 +03:00
|
|
|
#if CONFIG_PGTABLE_LEVELS == 3
|
2017-03-09 17:24:05 +03:00
|
|
|
#define __ARCH_USE_5LEVEL_HACK
|
2005-04-17 02:20:36 +04:00
|
|
|
#include <asm-generic/pgtable-nopud.h>
|
2005-11-11 18:35:43 +03:00
|
|
|
#endif
|
2017-03-09 17:24:05 +03:00
|
|
|
#include <asm-generic/5level-fixup.h>
|
2005-04-17 02:20:36 +04:00
|
|
|
#include <asm-generic/pgtable.h>
|
|
|
|
|
|
|
|
#endif /* _ASM_IA64_PGTABLE_H */
|