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
|
|
|
#ifndef _PARISC_PGTABLE_H
|
|
|
|
|
#define _PARISC_PGTABLE_H
|
|
|
|
|
|
2019-08-25 08:54:43 +08:00
|
|
|
#include <asm/page.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <asm-generic/4level-fixup.h>
|
|
|
|
|
|
|
|
|
|
#include <asm/fixmap.h>
|
|
|
|
|
|
|
|
|
|
#ifndef __ASSEMBLY__
|
|
|
|
|
/*
|
|
|
|
|
* we simulate an x86-style page table for the linux mm code
|
|
|
|
|
*/
|
|
|
|
|
|
2007-10-19 14:40:25 +08:00
|
|
|
#include <linux/bitops.h>
|
2011-01-17 06:06:14 +08:00
|
|
|
#include <linux/spinlock.h>
|
2013-01-15 08:45:00 +08:00
|
|
|
#include <linux/mm_types.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <asm/processor.h>
|
|
|
|
|
#include <asm/cache.h>
|
|
|
|
|
|
2019-04-28 06:09:53 +08:00
|
|
|
static inline spinlock_t *pgd_spinlock(pgd_t *);
|
2013-04-24 04:42:07 +08:00
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
|
* 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 parisc.
|
|
|
|
|
*/
|
|
|
|
|
#define kern_addr_valid(addr) (1)
|
|
|
|
|
|
2019-04-28 06:09:53 +08:00
|
|
|
/* This is for the serialization of PxTLB broadcasts. At least on the N class
|
|
|
|
|
* systems, only one PxTLB inter processor broadcast can be active at any one
|
|
|
|
|
* time on the Merced bus.
|
|
|
|
|
|
|
|
|
|
* PTE updates are protected by locks in the PMD.
|
|
|
|
|
*/
|
|
|
|
|
extern spinlock_t pa_tlb_flush_lock;
|
|
|
|
|
extern spinlock_t pa_swapper_pg_lock;
|
|
|
|
|
#if defined(CONFIG_64BIT) && defined(CONFIG_SMP)
|
|
|
|
|
extern int pa_serialize_tlb_flushes;
|
|
|
|
|
#else
|
|
|
|
|
#define pa_serialize_tlb_flushes (0)
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#define purge_tlb_start(flags) do { \
|
|
|
|
|
if (pa_serialize_tlb_flushes) \
|
|
|
|
|
spin_lock_irqsave(&pa_tlb_flush_lock, flags); \
|
|
|
|
|
else \
|
|
|
|
|
local_irq_save(flags); \
|
|
|
|
|
} while (0)
|
|
|
|
|
#define purge_tlb_end(flags) do { \
|
|
|
|
|
if (pa_serialize_tlb_flushes) \
|
|
|
|
|
spin_unlock_irqrestore(&pa_tlb_flush_lock, flags); \
|
|
|
|
|
else \
|
|
|
|
|
local_irq_restore(flags); \
|
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
|
|
/* Purge data and instruction TLB entries. The TLB purge instructions
|
|
|
|
|
* are slow on SMP machines since the purge must be broadcast to all CPUs.
|
2015-07-02 05:18:37 +08:00
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
static inline void purge_tlb_entries(struct mm_struct *mm, unsigned long addr)
|
|
|
|
|
{
|
2019-04-28 06:09:53 +08:00
|
|
|
unsigned long flags;
|
|
|
|
|
|
|
|
|
|
purge_tlb_start(flags);
|
2015-07-02 05:18:37 +08:00
|
|
|
mtsp(mm->context, 1);
|
|
|
|
|
pdtlb(addr);
|
2018-10-17 04:38:22 +08:00
|
|
|
pitlb(addr);
|
2019-04-28 06:09:53 +08:00
|
|
|
purge_tlb_end(flags);
|
2015-07-02 05:18:37 +08:00
|
|
|
}
|
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/* Certain architectures need to do special things when PTEs
|
|
|
|
|
* within a page table are directly modified. Thus, the following
|
|
|
|
|
* hook is made available.
|
|
|
|
|
*/
|
|
|
|
|
#define set_pte(pteptr, pteval) \
|
|
|
|
|
do{ \
|
|
|
|
|
*(pteptr) = (pteval); \
|
|
|
|
|
} while(0)
|
2013-01-15 08:45:00 +08:00
|
|
|
|
2015-07-02 05:18:37 +08:00
|
|
|
#define set_pte_at(mm, addr, ptep, pteval) \
|
|
|
|
|
do { \
|
|
|
|
|
pte_t old_pte; \
|
2013-04-24 04:42:07 +08:00
|
|
|
unsigned long flags; \
|
2019-04-28 06:09:53 +08:00
|
|
|
spin_lock_irqsave(pgd_spinlock((mm)->pgd), flags);\
|
2015-07-02 05:18:37 +08:00
|
|
|
old_pte = *ptep; \
|
2018-09-21 10:31:48 +08:00
|
|
|
set_pte(ptep, pteval); \
|
2018-10-20 08:33:29 +08:00
|
|
|
purge_tlb_entries(mm, addr); \
|
2019-04-28 06:09:53 +08:00
|
|
|
spin_unlock_irqrestore(pgd_spinlock((mm)->pgd), flags);\
|
2013-01-15 08:45:00 +08:00
|
|
|
} while (0)
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
#endif /* !__ASSEMBLY__ */
|
|
|
|
|
|
|
|
|
|
#define pte_ERROR(e) \
|
|
|
|
|
printk("%s:%d: bad pte %08lx.\n", __FILE__, __LINE__, pte_val(e))
|
|
|
|
|
#define pmd_ERROR(e) \
|
|
|
|
|
printk("%s:%d: bad pmd %08lx.\n", __FILE__, __LINE__, (unsigned long)pmd_val(e))
|
|
|
|
|
#define pgd_ERROR(e) \
|
|
|
|
|
printk("%s:%d: bad pgd %08lx.\n", __FILE__, __LINE__, (unsigned long)pgd_val(e))
|
|
|
|
|
|
2006-04-21 04:40:23 +08:00
|
|
|
/* This is the size of the initially mapped kernel memory */
|
2016-10-09 15:57:54 +08:00
|
|
|
#if defined(CONFIG_64BIT)
|
|
|
|
|
#define KERNEL_INITIAL_ORDER 26 /* 1<<26 = 64MB */
|
2015-11-20 18:17:27 +08:00
|
|
|
#else
|
2016-10-09 15:57:54 +08:00
|
|
|
#define KERNEL_INITIAL_ORDER 25 /* 1<<25 = 32MB */
|
2015-11-20 18:17:27 +08:00
|
|
|
#endif
|
2005-04-17 06:20:36 +08:00
|
|
|
#define KERNEL_INITIAL_SIZE (1 << KERNEL_INITIAL_ORDER)
|
|
|
|
|
|
2015-04-15 06:45:54 +08:00
|
|
|
#if CONFIG_PGTABLE_LEVELS == 3
|
2005-04-17 06:20:36 +08:00
|
|
|
#define PGD_ORDER 1 /* Number of pages per pgd */
|
|
|
|
|
#define PMD_ORDER 1 /* Number of pages per pmd */
|
2019-04-28 06:09:53 +08:00
|
|
|
#define PGD_ALLOC_ORDER (2 + 1) /* first pgd contains pmd */
|
2005-04-17 06:20:36 +08:00
|
|
|
#else
|
|
|
|
|
#define PGD_ORDER 1 /* Number of pages per pgd */
|
2019-04-28 06:09:53 +08:00
|
|
|
#define PGD_ALLOC_ORDER (PGD_ORDER + 1)
|
2005-04-17 06:20:36 +08:00
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* Definitions for 3rd level (we use PLD here for Page Lower directory
|
|
|
|
|
* because PTE_SHIFT is used lower down to mean shift that has to be
|
|
|
|
|
* done to get usable bits out of the PTE) */
|
|
|
|
|
#define PLD_SHIFT PAGE_SHIFT
|
|
|
|
|
#define PLD_SIZE PAGE_SIZE
|
|
|
|
|
#define BITS_PER_PTE (PAGE_SHIFT - BITS_PER_PTE_ENTRY)
|
|
|
|
|
#define PTRS_PER_PTE (1UL << BITS_PER_PTE)
|
|
|
|
|
|
|
|
|
|
/* Definitions for 2nd level */
|
|
|
|
|
#define PMD_SHIFT (PLD_SHIFT + BITS_PER_PTE)
|
|
|
|
|
#define PMD_SIZE (1UL << PMD_SHIFT)
|
|
|
|
|
#define PMD_MASK (~(PMD_SIZE-1))
|
2015-04-15 06:45:54 +08:00
|
|
|
#if CONFIG_PGTABLE_LEVELS == 3
|
2005-04-17 06:20:36 +08:00
|
|
|
#define BITS_PER_PMD (PAGE_SHIFT + PMD_ORDER - BITS_PER_PMD_ENTRY)
|
|
|
|
|
#else
|
2018-10-31 19:11:48 +08:00
|
|
|
#define __PAGETABLE_PMD_FOLDED 1
|
2005-04-17 06:20:36 +08:00
|
|
|
#define BITS_PER_PMD 0
|
|
|
|
|
#endif
|
|
|
|
|
#define PTRS_PER_PMD (1UL << BITS_PER_PMD)
|
|
|
|
|
|
|
|
|
|
/* Definitions for 1st level */
|
|
|
|
|
#define PGDIR_SHIFT (PMD_SHIFT + BITS_PER_PMD)
|
parisc: fix usage of 32bit PTE page table entries on 32bit kernels
This patch fixes a long outstanding bug on 32bit parisc linux kernels
which prevented us from using 32bit PTE table entries (instead of 64bit
entries of which 32bit were unused).
The problem was caused by this assembler statement in the L2_ptep
macro in arch/parisc/kernel/entry.S:447:
EXTR \va,31-ASM_PGDIR_SHIFT,ASM_BITS_PER_PGD,\index
which expanded to
extrw,u r8,9,11,r1
and which has undefined behavior since the length value (11) extends
beyond the leftmost bit (11-1 > 9).
Interestingly PA2.0 processors seem to don't care and just zero-extend
the value, while PA1.1 processors don't.
Fix this problem by detecting an address space overflow with ASM_BITS_PER_PGD
and adjusting it accordingly. To prevent such problems in the future,
some compile time sanity checks in arch/parisc/mm/init.c were added.
Since the page table now only consumes half of it's old size, we can
use the freed memory to harmonize 32- and 64bit kernels and let both
map 16MB for the initial page table.
Signed-off-by: Helge Deller <deller@gmx.de>
Signed-off-by: Kyle McMartin <kyle@mcmartin.ca>
2009-01-19 02:16:16 +08:00
|
|
|
#if (PGDIR_SHIFT + PAGE_SHIFT + PGD_ORDER - BITS_PER_PGD_ENTRY) > BITS_PER_LONG
|
|
|
|
|
#define BITS_PER_PGD (BITS_PER_LONG - PGDIR_SHIFT)
|
|
|
|
|
#else
|
2005-04-17 06:20:36 +08:00
|
|
|
#define BITS_PER_PGD (PAGE_SHIFT + PGD_ORDER - BITS_PER_PGD_ENTRY)
|
parisc: fix usage of 32bit PTE page table entries on 32bit kernels
This patch fixes a long outstanding bug on 32bit parisc linux kernels
which prevented us from using 32bit PTE table entries (instead of 64bit
entries of which 32bit were unused).
The problem was caused by this assembler statement in the L2_ptep
macro in arch/parisc/kernel/entry.S:447:
EXTR \va,31-ASM_PGDIR_SHIFT,ASM_BITS_PER_PGD,\index
which expanded to
extrw,u r8,9,11,r1
and which has undefined behavior since the length value (11) extends
beyond the leftmost bit (11-1 > 9).
Interestingly PA2.0 processors seem to don't care and just zero-extend
the value, while PA1.1 processors don't.
Fix this problem by detecting an address space overflow with ASM_BITS_PER_PGD
and adjusting it accordingly. To prevent such problems in the future,
some compile time sanity checks in arch/parisc/mm/init.c were added.
Since the page table now only consumes half of it's old size, we can
use the freed memory to harmonize 32- and 64bit kernels and let both
map 16MB for the initial page table.
Signed-off-by: Helge Deller <deller@gmx.de>
Signed-off-by: Kyle McMartin <kyle@mcmartin.ca>
2009-01-19 02:16:16 +08:00
|
|
|
#endif
|
2005-04-17 06:20:36 +08:00
|
|
|
#define PGDIR_SIZE (1UL << PGDIR_SHIFT)
|
|
|
|
|
#define PGDIR_MASK (~(PGDIR_SIZE-1))
|
|
|
|
|
#define PTRS_PER_PGD (1UL << BITS_PER_PGD)
|
|
|
|
|
#define USER_PTRS_PER_PGD PTRS_PER_PGD
|
|
|
|
|
|
parisc: fix usage of 32bit PTE page table entries on 32bit kernels
This patch fixes a long outstanding bug on 32bit parisc linux kernels
which prevented us from using 32bit PTE table entries (instead of 64bit
entries of which 32bit were unused).
The problem was caused by this assembler statement in the L2_ptep
macro in arch/parisc/kernel/entry.S:447:
EXTR \va,31-ASM_PGDIR_SHIFT,ASM_BITS_PER_PGD,\index
which expanded to
extrw,u r8,9,11,r1
and which has undefined behavior since the length value (11) extends
beyond the leftmost bit (11-1 > 9).
Interestingly PA2.0 processors seem to don't care and just zero-extend
the value, while PA1.1 processors don't.
Fix this problem by detecting an address space overflow with ASM_BITS_PER_PGD
and adjusting it accordingly. To prevent such problems in the future,
some compile time sanity checks in arch/parisc/mm/init.c were added.
Since the page table now only consumes half of it's old size, we can
use the freed memory to harmonize 32- and 64bit kernels and let both
map 16MB for the initial page table.
Signed-off-by: Helge Deller <deller@gmx.de>
Signed-off-by: Kyle McMartin <kyle@mcmartin.ca>
2009-01-19 02:16:16 +08:00
|
|
|
#ifdef CONFIG_64BIT
|
2005-04-17 06:20:36 +08:00
|
|
|
#define MAX_ADDRBITS (PGDIR_SHIFT + BITS_PER_PGD)
|
|
|
|
|
#define MAX_ADDRESS (1UL << MAX_ADDRBITS)
|
2006-04-21 04:40:23 +08:00
|
|
|
#define SPACEID_SHIFT (MAX_ADDRBITS - 32)
|
parisc: fix usage of 32bit PTE page table entries on 32bit kernels
This patch fixes a long outstanding bug on 32bit parisc linux kernels
which prevented us from using 32bit PTE table entries (instead of 64bit
entries of which 32bit were unused).
The problem was caused by this assembler statement in the L2_ptep
macro in arch/parisc/kernel/entry.S:447:
EXTR \va,31-ASM_PGDIR_SHIFT,ASM_BITS_PER_PGD,\index
which expanded to
extrw,u r8,9,11,r1
and which has undefined behavior since the length value (11) extends
beyond the leftmost bit (11-1 > 9).
Interestingly PA2.0 processors seem to don't care and just zero-extend
the value, while PA1.1 processors don't.
Fix this problem by detecting an address space overflow with ASM_BITS_PER_PGD
and adjusting it accordingly. To prevent such problems in the future,
some compile time sanity checks in arch/parisc/mm/init.c were added.
Since the page table now only consumes half of it's old size, we can
use the freed memory to harmonize 32- and 64bit kernels and let both
map 16MB for the initial page table.
Signed-off-by: Helge Deller <deller@gmx.de>
Signed-off-by: Kyle McMartin <kyle@mcmartin.ca>
2009-01-19 02:16:16 +08:00
|
|
|
#else
|
|
|
|
|
#define MAX_ADDRBITS (BITS_PER_LONG)
|
|
|
|
|
#define MAX_ADDRESS (1UL << MAX_ADDRBITS)
|
|
|
|
|
#define SPACEID_SHIFT 0
|
|
|
|
|
#endif
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
/* This calculates the number of initial pages we need for the initial
|
|
|
|
|
* page tables */
|
2006-04-21 04:40:23 +08:00
|
|
|
#if (KERNEL_INITIAL_ORDER) >= (PMD_SHIFT)
|
|
|
|
|
# define PT_INITIAL (1 << (KERNEL_INITIAL_ORDER - PMD_SHIFT))
|
|
|
|
|
#else
|
|
|
|
|
# define PT_INITIAL (1) /* all initial PTEs fit into one page */
|
|
|
|
|
#endif
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* pgd entries used up by user/kernel:
|
|
|
|
|
*/
|
|
|
|
|
|
2015-02-12 07:26:41 +08:00
|
|
|
#define FIRST_USER_ADDRESS 0UL
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
/* NB: The tlb miss handlers make certain assumptions about the order */
|
|
|
|
|
/* of the following bits, so be careful (One example, bits 25-31 */
|
|
|
|
|
/* are moved together in one instruction). */
|
|
|
|
|
|
|
|
|
|
#define _PAGE_READ_BIT 31 /* (0x001) read access allowed */
|
|
|
|
|
#define _PAGE_WRITE_BIT 30 /* (0x002) write access allowed */
|
|
|
|
|
#define _PAGE_EXEC_BIT 29 /* (0x004) execute access allowed */
|
|
|
|
|
#define _PAGE_GATEWAY_BIT 28 /* (0x008) privilege promotion allowed */
|
|
|
|
|
#define _PAGE_DMB_BIT 27 /* (0x010) Data Memory Break enable (B bit) */
|
|
|
|
|
#define _PAGE_DIRTY_BIT 26 /* (0x020) Page Dirty (D bit) */
|
|
|
|
|
#define _PAGE_REFTRAP_BIT 25 /* (0x040) Page Ref. Trap enable (T bit) */
|
|
|
|
|
#define _PAGE_NO_CACHE_BIT 24 /* (0x080) Uncached Page (U bit) */
|
|
|
|
|
#define _PAGE_ACCESSED_BIT 23 /* (0x100) Software: Page Accessed */
|
|
|
|
|
#define _PAGE_PRESENT_BIT 22 /* (0x200) Software: translation valid */
|
2015-11-20 22:46:52 +08:00
|
|
|
#define _PAGE_HPAGE_BIT 21 /* (0x400) Software: Huge Page */
|
2005-04-17 06:20:36 +08:00
|
|
|
#define _PAGE_USER_BIT 20 /* (0x800) Software: User accessible page */
|
|
|
|
|
|
|
|
|
|
/* N.B. The bits are defined in terms of a 32 bit word above, so the */
|
|
|
|
|
/* following macro is ok for both 32 and 64 bit. */
|
|
|
|
|
|
|
|
|
|
#define xlate_pabit(x) (31 - x)
|
|
|
|
|
|
|
|
|
|
/* this defines the shift to the usable bits in the PTE it is set so
|
|
|
|
|
* that the valid bits _PAGE_PRESENT_BIT and _PAGE_USER_BIT are set
|
|
|
|
|
* to zero */
|
|
|
|
|
#define PTE_SHIFT xlate_pabit(_PAGE_USER_BIT)
|
|
|
|
|
|
2006-04-21 04:40:23 +08:00
|
|
|
/* PFN_PTE_SHIFT defines the shift of a PTE value to access the PFN field */
|
|
|
|
|
#define PFN_PTE_SHIFT 12
|
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
#define _PAGE_READ (1 << xlate_pabit(_PAGE_READ_BIT))
|
|
|
|
|
#define _PAGE_WRITE (1 << xlate_pabit(_PAGE_WRITE_BIT))
|
|
|
|
|
#define _PAGE_RW (_PAGE_READ | _PAGE_WRITE)
|
|
|
|
|
#define _PAGE_EXEC (1 << xlate_pabit(_PAGE_EXEC_BIT))
|
|
|
|
|
#define _PAGE_GATEWAY (1 << xlate_pabit(_PAGE_GATEWAY_BIT))
|
|
|
|
|
#define _PAGE_DMB (1 << xlate_pabit(_PAGE_DMB_BIT))
|
|
|
|
|
#define _PAGE_DIRTY (1 << xlate_pabit(_PAGE_DIRTY_BIT))
|
|
|
|
|
#define _PAGE_REFTRAP (1 << xlate_pabit(_PAGE_REFTRAP_BIT))
|
|
|
|
|
#define _PAGE_NO_CACHE (1 << xlate_pabit(_PAGE_NO_CACHE_BIT))
|
|
|
|
|
#define _PAGE_ACCESSED (1 << xlate_pabit(_PAGE_ACCESSED_BIT))
|
|
|
|
|
#define _PAGE_PRESENT (1 << xlate_pabit(_PAGE_PRESENT_BIT))
|
2015-11-20 22:46:52 +08:00
|
|
|
#define _PAGE_HUGE (1 << xlate_pabit(_PAGE_HPAGE_BIT))
|
2005-04-17 06:20:36 +08:00
|
|
|
#define _PAGE_USER (1 << xlate_pabit(_PAGE_USER_BIT))
|
|
|
|
|
|
2018-09-21 10:31:48 +08:00
|
|
|
#define _PAGE_TABLE (_PAGE_PRESENT | _PAGE_READ | _PAGE_WRITE | _PAGE_DIRTY | _PAGE_ACCESSED)
|
2005-04-17 06:20:36 +08:00
|
|
|
#define _PAGE_CHG_MASK (PAGE_MASK | _PAGE_ACCESSED | _PAGE_DIRTY)
|
2011-04-15 07:25:21 +08:00
|
|
|
#define _PAGE_KERNEL_RO (_PAGE_PRESENT | _PAGE_READ | _PAGE_DIRTY | _PAGE_ACCESSED)
|
|
|
|
|
#define _PAGE_KERNEL_EXEC (_PAGE_KERNEL_RO | _PAGE_EXEC)
|
|
|
|
|
#define _PAGE_KERNEL_RWX (_PAGE_KERNEL_EXEC | _PAGE_WRITE)
|
|
|
|
|
#define _PAGE_KERNEL (_PAGE_KERNEL_RO | _PAGE_WRITE)
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
/* The pgd/pmd contains a ptr (in phys addr space); since all pgds/pmds
|
|
|
|
|
* are page-aligned, we don't care about the PAGE_OFFSET bits, except
|
|
|
|
|
* for a few meta-information bits, so we shift the address to be
|
2006-04-21 04:40:23 +08:00
|
|
|
* able to effectively address 40/42/44-bits of physical address space
|
|
|
|
|
* depending on 4k/16k/64k PAGE_SIZE */
|
2005-04-17 06:20:36 +08:00
|
|
|
#define _PxD_PRESENT_BIT 31
|
|
|
|
|
#define _PxD_ATTACHED_BIT 30
|
|
|
|
|
#define _PxD_VALID_BIT 29
|
|
|
|
|
|
|
|
|
|
#define PxD_FLAG_PRESENT (1 << xlate_pabit(_PxD_PRESENT_BIT))
|
|
|
|
|
#define PxD_FLAG_ATTACHED (1 << xlate_pabit(_PxD_ATTACHED_BIT))
|
|
|
|
|
#define PxD_FLAG_VALID (1 << xlate_pabit(_PxD_VALID_BIT))
|
|
|
|
|
#define PxD_FLAG_MASK (0xf)
|
|
|
|
|
#define PxD_FLAG_SHIFT (4)
|
2015-11-20 22:46:52 +08:00
|
|
|
#define PxD_VALUE_SHIFT (PFN_PTE_SHIFT-PxD_FLAG_SHIFT)
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
#ifndef __ASSEMBLY__
|
|
|
|
|
|
2018-09-21 10:31:48 +08:00
|
|
|
#define PAGE_NONE __pgprot(_PAGE_PRESENT | _PAGE_USER)
|
|
|
|
|
#define PAGE_SHARED __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_READ | _PAGE_WRITE)
|
2005-04-17 06:20:36 +08:00
|
|
|
/* Others seem to make this executable, I don't know if that's correct
|
|
|
|
|
or not. The stack is mapped this way though so this is necessary
|
|
|
|
|
in the short term - dhd@linuxcare.com, 2000-08-08 */
|
2018-09-21 10:31:48 +08:00
|
|
|
#define PAGE_READONLY __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_READ)
|
|
|
|
|
#define PAGE_WRITEONLY __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_WRITE)
|
|
|
|
|
#define PAGE_EXECREAD __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_READ | _PAGE_EXEC)
|
2005-04-17 06:20:36 +08:00
|
|
|
#define PAGE_COPY PAGE_EXECREAD
|
2018-09-21 10:31:48 +08:00
|
|
|
#define PAGE_RWX __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_READ | _PAGE_WRITE | _PAGE_EXEC)
|
2005-04-17 06:20:36 +08:00
|
|
|
#define PAGE_KERNEL __pgprot(_PAGE_KERNEL)
|
2011-04-15 07:25:21 +08:00
|
|
|
#define PAGE_KERNEL_EXEC __pgprot(_PAGE_KERNEL_EXEC)
|
|
|
|
|
#define PAGE_KERNEL_RWX __pgprot(_PAGE_KERNEL_RWX)
|
|
|
|
|
#define PAGE_KERNEL_RO __pgprot(_PAGE_KERNEL_RO)
|
2005-04-17 06:20:36 +08:00
|
|
|
#define PAGE_KERNEL_UNC __pgprot(_PAGE_KERNEL | _PAGE_NO_CACHE)
|
2018-09-21 10:31:48 +08:00
|
|
|
#define PAGE_GATEWAY __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_GATEWAY| _PAGE_READ)
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* We could have an execute only page using "gateway - promote to priv
|
|
|
|
|
* level 3", but that is kind of silly. So, the way things are defined
|
|
|
|
|
* now, we must always have read permission for pages with execute
|
|
|
|
|
* permission. For the fun of it we'll go ahead and support write only
|
|
|
|
|
* pages.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
/*xwr*/
|
|
|
|
|
#define __P000 PAGE_NONE
|
|
|
|
|
#define __P001 PAGE_READONLY
|
|
|
|
|
#define __P010 __P000 /* copy on write */
|
|
|
|
|
#define __P011 __P001 /* copy on write */
|
|
|
|
|
#define __P100 PAGE_EXECREAD
|
|
|
|
|
#define __P101 PAGE_EXECREAD
|
|
|
|
|
#define __P110 __P100 /* copy on write */
|
|
|
|
|
#define __P111 __P101 /* copy on write */
|
|
|
|
|
|
|
|
|
|
#define __S000 PAGE_NONE
|
|
|
|
|
#define __S001 PAGE_READONLY
|
|
|
|
|
#define __S010 PAGE_WRITEONLY
|
|
|
|
|
#define __S011 PAGE_SHARED
|
|
|
|
|
#define __S100 PAGE_EXECREAD
|
|
|
|
|
#define __S101 PAGE_EXECREAD
|
|
|
|
|
#define __S110 PAGE_RWX
|
|
|
|
|
#define __S111 PAGE_RWX
|
|
|
|
|
|
2006-04-21 04:40:23 +08:00
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
extern pgd_t swapper_pg_dir[]; /* declared in init_task.c */
|
|
|
|
|
|
|
|
|
|
/* initial page tables for 0-8MB for kernel */
|
|
|
|
|
|
|
|
|
|
extern pte_t pg0[];
|
|
|
|
|
|
|
|
|
|
/* zero page used for uninitialized stuff */
|
|
|
|
|
|
|
|
|
|
extern unsigned long *empty_zero_page;
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* ZERO_PAGE is a global shared page that is always zero: used
|
|
|
|
|
* for zero-mapped memory areas etc..
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#define ZERO_PAGE(vaddr) (virt_to_page(empty_zero_page))
|
|
|
|
|
|
2010-12-23 00:24:36 +08:00
|
|
|
#define pte_none(x) (pte_val(x) == 0)
|
2005-04-17 06:20:36 +08:00
|
|
|
#define pte_present(x) (pte_val(x) & _PAGE_PRESENT)
|
2015-07-02 05:18:37 +08:00
|
|
|
#define pte_clear(mm, addr, xp) set_pte_at(mm, addr, xp, __pte(0))
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
#define pmd_flag(x) (pmd_val(x) & PxD_FLAG_MASK)
|
|
|
|
|
#define pmd_address(x) ((unsigned long)(pmd_val(x) &~ PxD_FLAG_MASK) << PxD_VALUE_SHIFT)
|
|
|
|
|
#define pgd_flag(x) (pgd_val(x) & PxD_FLAG_MASK)
|
|
|
|
|
#define pgd_address(x) ((unsigned long)(pgd_val(x) &~ PxD_FLAG_MASK) << PxD_VALUE_SHIFT)
|
|
|
|
|
|
2015-04-15 06:45:54 +08:00
|
|
|
#if CONFIG_PGTABLE_LEVELS == 3
|
2005-04-17 06:20:36 +08:00
|
|
|
/* The first entry of the permanent pmd is not there if it contains
|
|
|
|
|
* the gateway marker */
|
|
|
|
|
#define pmd_none(x) (!pmd_val(x) || pmd_flag(x) == PxD_FLAG_ATTACHED)
|
|
|
|
|
#else
|
|
|
|
|
#define pmd_none(x) (!pmd_val(x))
|
|
|
|
|
#endif
|
|
|
|
|
#define pmd_bad(x) (!(pmd_flag(x) & PxD_FLAG_VALID))
|
|
|
|
|
#define pmd_present(x) (pmd_flag(x) & PxD_FLAG_PRESENT)
|
|
|
|
|
static inline void pmd_clear(pmd_t *pmd) {
|
2015-04-15 06:45:54 +08:00
|
|
|
#if CONFIG_PGTABLE_LEVELS == 3
|
2005-04-17 06:20:36 +08:00
|
|
|
if (pmd_flag(*pmd) & PxD_FLAG_ATTACHED)
|
|
|
|
|
/* This is the entry pointing to the permanent pmd
|
|
|
|
|
* attached to the pgd; cannot clear it */
|
|
|
|
|
__pmd_val_set(*pmd, PxD_FLAG_ATTACHED);
|
|
|
|
|
else
|
|
|
|
|
#endif
|
|
|
|
|
__pmd_val_set(*pmd, 0);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2015-04-15 06:45:54 +08:00
|
|
|
#if CONFIG_PGTABLE_LEVELS == 3
|
2006-09-26 14:31:48 +08:00
|
|
|
#define pgd_page_vaddr(pgd) ((unsigned long) __va(pgd_address(pgd)))
|
|
|
|
|
#define pgd_page(pgd) virt_to_page((void *)pgd_page_vaddr(pgd))
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
/* For 64 bit we have three level tables */
|
|
|
|
|
|
|
|
|
|
#define pgd_none(x) (!pgd_val(x))
|
|
|
|
|
#define pgd_bad(x) (!(pgd_flag(x) & PxD_FLAG_VALID))
|
|
|
|
|
#define pgd_present(x) (pgd_flag(x) & PxD_FLAG_PRESENT)
|
|
|
|
|
static inline void pgd_clear(pgd_t *pgd) {
|
2015-04-15 06:45:54 +08:00
|
|
|
#if CONFIG_PGTABLE_LEVELS == 3
|
2005-04-17 06:20:36 +08:00
|
|
|
if(pgd_flag(*pgd) & PxD_FLAG_ATTACHED)
|
|
|
|
|
/* This is the permanent pmd attached to the pgd; cannot
|
|
|
|
|
* free it */
|
|
|
|
|
return;
|
|
|
|
|
#endif
|
|
|
|
|
__pgd_val_set(*pgd, 0);
|
|
|
|
|
}
|
|
|
|
|
#else
|
|
|
|
|
/*
|
|
|
|
|
* The "pgd_xxx()" functions here are trivial for a folded two-level
|
|
|
|
|
* setup: the pgd is never bad, and a pmd always exists (as it's folded
|
|
|
|
|
* into the pgd entry)
|
|
|
|
|
*/
|
2007-10-17 05:24:59 +08:00
|
|
|
static inline int pgd_none(pgd_t pgd) { return 0; }
|
|
|
|
|
static inline int pgd_bad(pgd_t pgd) { return 0; }
|
|
|
|
|
static inline int pgd_present(pgd_t pgd) { return 1; }
|
|
|
|
|
static inline void pgd_clear(pgd_t * pgdp) { }
|
2005-04-17 06:20:36 +08:00
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* The following only work if pte_present() is true.
|
|
|
|
|
* Undefined behaviour if not..
|
|
|
|
|
*/
|
2007-10-17 05:24:59 +08:00
|
|
|
static inline int pte_dirty(pte_t pte) { return pte_val(pte) & _PAGE_DIRTY; }
|
|
|
|
|
static inline int pte_young(pte_t pte) { return pte_val(pte) & _PAGE_ACCESSED; }
|
|
|
|
|
static inline int pte_write(pte_t pte) { return pte_val(pte) & _PAGE_WRITE; }
|
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 17:13:00 +08:00
|
|
|
static inline int pte_special(pte_t pte) { return 0; }
|
2007-10-17 05:24:59 +08:00
|
|
|
|
|
|
|
|
static inline pte_t pte_mkclean(pte_t pte) { pte_val(pte) &= ~_PAGE_DIRTY; return pte; }
|
|
|
|
|
static inline pte_t pte_mkold(pte_t pte) { pte_val(pte) &= ~_PAGE_ACCESSED; return pte; }
|
|
|
|
|
static inline pte_t pte_wrprotect(pte_t pte) { pte_val(pte) &= ~_PAGE_WRITE; return pte; }
|
|
|
|
|
static inline pte_t pte_mkdirty(pte_t pte) { pte_val(pte) |= _PAGE_DIRTY; return pte; }
|
|
|
|
|
static inline pte_t pte_mkyoung(pte_t pte) { pte_val(pte) |= _PAGE_ACCESSED; return pte; }
|
|
|
|
|
static inline pte_t pte_mkwrite(pte_t pte) { pte_val(pte) |= _PAGE_WRITE; return 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 17:13:00 +08:00
|
|
|
static inline pte_t pte_mkspecial(pte_t pte) { return pte; }
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2015-11-20 22:46:52 +08:00
|
|
|
/*
|
|
|
|
|
* Huge pte definitions.
|
|
|
|
|
*/
|
|
|
|
|
#ifdef CONFIG_HUGETLB_PAGE
|
|
|
|
|
#define pte_huge(pte) (pte_val(pte) & _PAGE_HUGE)
|
2015-12-07 04:25:20 +08:00
|
|
|
#define pte_mkhuge(pte) (__pte(pte_val(pte) | \
|
|
|
|
|
(parisc_requires_coherency() ? 0 : _PAGE_HUGE)))
|
2015-11-20 22:46:52 +08:00
|
|
|
#else
|
|
|
|
|
#define pte_huge(pte) (0)
|
|
|
|
|
#define pte_mkhuge(pte) (pte)
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
|
* Conversion functions: convert a page and protection to a page entry,
|
|
|
|
|
* and a page entry and page directory to the page they refer to.
|
|
|
|
|
*/
|
|
|
|
|
#define __mk_pte(addr,pgprot) \
|
|
|
|
|
({ \
|
|
|
|
|
pte_t __pte; \
|
|
|
|
|
\
|
2006-04-21 04:40:23 +08:00
|
|
|
pte_val(__pte) = ((((addr)>>PAGE_SHIFT)<<PFN_PTE_SHIFT) + pgprot_val(pgprot)); \
|
2005-04-17 06:20:36 +08:00
|
|
|
\
|
|
|
|
|
__pte; \
|
|
|
|
|
})
|
|
|
|
|
|
|
|
|
|
#define mk_pte(page, pgprot) pfn_pte(page_to_pfn(page), (pgprot))
|
|
|
|
|
|
|
|
|
|
static inline pte_t pfn_pte(unsigned long pfn, pgprot_t pgprot)
|
|
|
|
|
{
|
|
|
|
|
pte_t pte;
|
2006-04-21 04:40:23 +08:00
|
|
|
pte_val(pte) = (pfn << PFN_PTE_SHIFT) | pgprot_val(pgprot);
|
2005-04-17 06:20:36 +08:00
|
|
|
return pte;
|
|
|
|
|
}
|
|
|
|
|
|
2007-10-17 05:24:59 +08:00
|
|
|
static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
|
2005-04-17 06:20:36 +08:00
|
|
|
{ pte_val(pte) = (pte_val(pte) & _PAGE_CHG_MASK) | pgprot_val(newprot); return pte; }
|
|
|
|
|
|
|
|
|
|
/* Permanent address of a page. On parisc we don't have highmem. */
|
|
|
|
|
|
2006-04-21 04:40:23 +08:00
|
|
|
#define pte_pfn(x) (pte_val(x) >> PFN_PTE_SHIFT)
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
#define pte_page(pte) (pfn_to_page(pte_pfn(pte)))
|
|
|
|
|
|
2006-09-26 14:31:48 +08:00
|
|
|
#define pmd_page_vaddr(pmd) ((unsigned long) __va(pmd_address(pmd)))
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
#define __pmd_page(pmd) ((unsigned long) __va(pmd_address(pmd)))
|
|
|
|
|
#define pmd_page(pmd) virt_to_page((void *)__pmd_page(pmd))
|
|
|
|
|
|
|
|
|
|
#define pgd_index(address) ((address) >> PGDIR_SHIFT)
|
|
|
|
|
|
|
|
|
|
/* to find an entry in a page-table-directory */
|
|
|
|
|
#define pgd_offset(mm, address) \
|
|
|
|
|
((mm)->pgd + ((address) >> PGDIR_SHIFT))
|
|
|
|
|
|
|
|
|
|
/* to find an entry in a kernel page-table-directory */
|
|
|
|
|
#define pgd_offset_k(address) pgd_offset(&init_mm, address)
|
|
|
|
|
|
|
|
|
|
/* Find an entry in the second-level page table.. */
|
|
|
|
|
|
2015-04-15 06:45:54 +08:00
|
|
|
#if CONFIG_PGTABLE_LEVELS == 3
|
2015-11-20 22:46:52 +08:00
|
|
|
#define pmd_index(addr) (((addr) >> PMD_SHIFT) & (PTRS_PER_PMD - 1))
|
2005-04-17 06:20:36 +08:00
|
|
|
#define pmd_offset(dir,address) \
|
2015-11-20 22:46:52 +08:00
|
|
|
((pmd_t *) pgd_page_vaddr(*(dir)) + pmd_index(address))
|
2005-04-17 06:20:36 +08:00
|
|
|
#else
|
|
|
|
|
#define pmd_offset(dir,addr) ((pmd_t *) dir)
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* Find an entry in the third-level page table.. */
|
|
|
|
|
#define pte_index(address) (((address) >> PAGE_SHIFT) & (PTRS_PER_PTE-1))
|
|
|
|
|
#define pte_offset_kernel(pmd, address) \
|
2006-09-26 14:31:48 +08:00
|
|
|
((pte_t *) pmd_page_vaddr(*(pmd)) + pte_index(address))
|
2005-04-17 06:20:36 +08:00
|
|
|
#define pte_offset_map(pmd, address) pte_offset_kernel(pmd, address)
|
|
|
|
|
#define pte_unmap(pte) do { } while (0)
|
|
|
|
|
|
|
|
|
|
#define pte_unmap(pte) do { } while (0)
|
|
|
|
|
#define pte_unmap_nested(pte) do { } while (0)
|
|
|
|
|
|
|
|
|
|
extern void paging_init (void);
|
|
|
|
|
|
|
|
|
|
/* Used for deferring calls to flush_dcache_page() */
|
|
|
|
|
|
|
|
|
|
#define PG_dcache_dirty PG_arch_1
|
|
|
|
|
|
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-19 00:40:18 +08:00
|
|
|
extern void update_mmu_cache(struct vm_area_struct *, unsigned long, pte_t *);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
/* Encode and de-code a swap entry */
|
|
|
|
|
|
|
|
|
|
#define __swp_type(x) ((x).val & 0x1f)
|
|
|
|
|
#define __swp_offset(x) ( (((x).val >> 6) & 0x7) | \
|
|
|
|
|
(((x).val >> 8) & ~0x7) )
|
|
|
|
|
#define __swp_entry(type, offset) ((swp_entry_t) { (type) | \
|
|
|
|
|
((offset & 0x7) << 6) | \
|
|
|
|
|
((offset & ~0x7) << 8) })
|
|
|
|
|
#define __pte_to_swp_entry(pte) ((swp_entry_t) { pte_val(pte) })
|
|
|
|
|
#define __swp_entry_to_pte(x) ((pte_t) { (x).val })
|
|
|
|
|
|
2019-04-28 06:09:53 +08:00
|
|
|
|
|
|
|
|
static inline spinlock_t *pgd_spinlock(pgd_t *pgd)
|
|
|
|
|
{
|
|
|
|
|
if (unlikely(pgd == swapper_pg_dir))
|
|
|
|
|
return &pa_swapper_pg_lock;
|
|
|
|
|
return (spinlock_t *)((char *)pgd + (PAGE_SIZE << (PGD_ALLOC_ORDER - 1)));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
static inline int ptep_test_and_clear_young(struct vm_area_struct *vma, unsigned long addr, pte_t *ptep)
|
|
|
|
|
{
|
2013-04-24 04:42:07 +08:00
|
|
|
pte_t pte;
|
|
|
|
|
unsigned long flags;
|
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
if (!pte_young(*ptep))
|
|
|
|
|
return 0;
|
2013-04-24 04:42:07 +08:00
|
|
|
|
2019-04-28 06:09:53 +08:00
|
|
|
spin_lock_irqsave(pgd_spinlock(vma->vm_mm->pgd), flags);
|
2013-04-24 04:42:07 +08:00
|
|
|
pte = *ptep;
|
|
|
|
|
if (!pte_young(pte)) {
|
2019-04-28 06:09:53 +08:00
|
|
|
spin_unlock_irqrestore(pgd_spinlock(vma->vm_mm->pgd), flags);
|
2005-04-17 06:20:36 +08:00
|
|
|
return 0;
|
2013-04-24 04:42:07 +08:00
|
|
|
}
|
2016-12-07 10:47:04 +08:00
|
|
|
set_pte(ptep, pte_mkold(pte));
|
2018-09-21 10:31:48 +08:00
|
|
|
purge_tlb_entries(vma->vm_mm, addr);
|
2019-04-28 06:09:53 +08:00
|
|
|
spin_unlock_irqrestore(pgd_spinlock(vma->vm_mm->pgd), flags);
|
2005-04-17 06:20:36 +08:00
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
|
2005-11-07 16:59:43 +08:00
|
|
|
struct mm_struct;
|
2005-04-17 06:20:36 +08:00
|
|
|
static inline pte_t ptep_get_and_clear(struct mm_struct *mm, unsigned long addr, pte_t *ptep)
|
|
|
|
|
{
|
|
|
|
|
pte_t old_pte;
|
2013-04-24 04:42:07 +08:00
|
|
|
unsigned long flags;
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2019-04-28 06:09:53 +08:00
|
|
|
spin_lock_irqsave(pgd_spinlock(mm->pgd), flags);
|
2010-12-23 00:24:36 +08:00
|
|
|
old_pte = *ptep;
|
2018-09-21 10:31:48 +08:00
|
|
|
set_pte(ptep, __pte(0));
|
2018-10-20 08:33:29 +08:00
|
|
|
purge_tlb_entries(mm, addr);
|
2019-04-28 06:09:53 +08:00
|
|
|
spin_unlock_irqrestore(pgd_spinlock(mm->pgd), flags);
|
2005-04-17 06:20:36 +08:00
|
|
|
|
|
|
|
|
return old_pte;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static inline void ptep_set_wrprotect(struct mm_struct *mm, unsigned long addr, pte_t *ptep)
|
|
|
|
|
{
|
2013-04-24 04:42:07 +08:00
|
|
|
unsigned long flags;
|
2019-04-28 06:09:53 +08:00
|
|
|
spin_lock_irqsave(pgd_spinlock(mm->pgd), flags);
|
2016-12-07 10:47:04 +08:00
|
|
|
set_pte(ptep, pte_wrprotect(*ptep));
|
2018-09-21 10:31:48 +08:00
|
|
|
purge_tlb_entries(mm, addr);
|
2019-04-28 06:09:53 +08:00
|
|
|
spin_unlock_irqrestore(pgd_spinlock(mm->pgd), flags);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#define pte_same(A,B) (pte_val(A) == pte_val(B))
|
|
|
|
|
|
2017-05-12 04:24:15 +08:00
|
|
|
struct seq_file;
|
|
|
|
|
extern void arch_report_meminfo(struct seq_file *m);
|
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
#endif /* !__ASSEMBLY__ */
|
|
|
|
|
|
2006-04-21 04:40:23 +08:00
|
|
|
|
|
|
|
|
/* TLB page size encoding - see table 3-1 in parisc20.pdf */
|
|
|
|
|
#define _PAGE_SIZE_ENCODING_4K 0
|
2006-04-21 10:20:37 +08:00
|
|
|
#define _PAGE_SIZE_ENCODING_16K 1
|
|
|
|
|
#define _PAGE_SIZE_ENCODING_64K 2
|
2006-04-21 04:40:23 +08:00
|
|
|
#define _PAGE_SIZE_ENCODING_256K 3
|
|
|
|
|
#define _PAGE_SIZE_ENCODING_1M 4
|
|
|
|
|
#define _PAGE_SIZE_ENCODING_4M 5
|
2006-04-21 10:20:37 +08:00
|
|
|
#define _PAGE_SIZE_ENCODING_16M 6
|
|
|
|
|
#define _PAGE_SIZE_ENCODING_64M 7
|
2006-04-21 04:40:23 +08:00
|
|
|
|
|
|
|
|
#if defined(CONFIG_PARISC_PAGE_SIZE_4KB)
|
|
|
|
|
# define _PAGE_SIZE_ENCODING_DEFAULT _PAGE_SIZE_ENCODING_4K
|
|
|
|
|
#elif defined(CONFIG_PARISC_PAGE_SIZE_16KB)
|
|
|
|
|
# define _PAGE_SIZE_ENCODING_DEFAULT _PAGE_SIZE_ENCODING_16K
|
|
|
|
|
#elif defined(CONFIG_PARISC_PAGE_SIZE_64KB)
|
|
|
|
|
# define _PAGE_SIZE_ENCODING_DEFAULT _PAGE_SIZE_ENCODING_64K
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
2005-10-22 10:54:20 +08:00
|
|
|
#define pgprot_noncached(prot) __pgprot(pgprot_val(prot) | _PAGE_NO_CACHE)
|
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/* We provide our own get_unmapped_area to provide cache coherency */
|
|
|
|
|
|
|
|
|
|
#define HAVE_ARCH_UNMAPPED_AREA
|
2014-02-01 05:19:52 +08:00
|
|
|
#define HAVE_ARCH_UNMAPPED_AREA_TOPDOWN
|
2005-04-17 06:20:36 +08: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
|
|
|
|
|
#include <asm-generic/pgtable.h>
|
|
|
|
|
|
|
|
|
|
#endif /* _PARISC_PGTABLE_H */
|