2008-03-18 06:36:55 +07:00
|
|
|
#include <linux/mm.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 15:04:11 +07:00
|
|
|
#include <linux/gfp.h>
|
2008-03-18 06:36:55 +07:00
|
|
|
#include <asm/pgalloc.h>
|
2008-03-18 06:37:03 +07:00
|
|
|
#include <asm/pgtable.h>
|
2008-03-18 06:36:55 +07:00
|
|
|
#include <asm/tlb.h>
|
2008-06-20 20:34:46 +07:00
|
|
|
#include <asm/fixmap.h>
|
2008-03-18 06:36:55 +07:00
|
|
|
|
2009-02-22 17:28:25 +07:00
|
|
|
#define PGALLOC_GFP GFP_KERNEL | __GFP_NOTRACK | __GFP_REPEAT | __GFP_ZERO
|
|
|
|
|
2010-02-17 17:38:10 +07:00
|
|
|
#ifdef CONFIG_HIGHPTE
|
|
|
|
#define PGALLOC_USER_GFP __GFP_HIGHMEM
|
|
|
|
#else
|
|
|
|
#define PGALLOC_USER_GFP 0
|
|
|
|
#endif
|
|
|
|
|
|
|
|
gfp_t __userpte_alloc_gfp = PGALLOC_GFP | PGALLOC_USER_GFP;
|
|
|
|
|
2008-03-18 06:36:55 +07:00
|
|
|
pte_t *pte_alloc_one_kernel(struct mm_struct *mm, unsigned long address)
|
|
|
|
{
|
2009-02-22 17:28:25 +07:00
|
|
|
return (pte_t *)__get_free_page(PGALLOC_GFP);
|
2008-03-18 06:36:55 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
pgtable_t pte_alloc_one(struct mm_struct *mm, unsigned long address)
|
|
|
|
{
|
|
|
|
struct page *pte;
|
|
|
|
|
2010-02-17 17:38:10 +07:00
|
|
|
pte = alloc_pages(__userpte_alloc_gfp, 0);
|
2008-03-18 06:36:55 +07:00
|
|
|
if (pte)
|
|
|
|
pgtable_page_ctor(pte);
|
|
|
|
return pte;
|
|
|
|
}
|
|
|
|
|
2010-02-17 17:38:10 +07:00
|
|
|
static int __init setup_userpte(char *arg)
|
|
|
|
{
|
|
|
|
if (!arg)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* "userpte=nohigh" disables allocation of user pagetables in
|
|
|
|
* high memory.
|
|
|
|
*/
|
|
|
|
if (strcmp(arg, "nohigh") == 0)
|
|
|
|
__userpte_alloc_gfp &= ~__GFP_HIGHMEM;
|
|
|
|
else
|
|
|
|
return -EINVAL;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
early_param("userpte", setup_userpte);
|
|
|
|
|
mm: Pass virtual address to [__]p{te,ud,md}_free_tlb()
mm: Pass virtual address to [__]p{te,ud,md}_free_tlb()
Upcoming paches to support the new 64-bit "BookE" powerpc architecture
will need to have the virtual address corresponding to PTE page when
freeing it, due to the way the HW table walker works.
Basically, the TLB can be loaded with "large" pages that cover the whole
virtual space (well, sort-of, half of it actually) represented by a PTE
page, and which contain an "indirect" bit indicating that this TLB entry
RPN points to an array of PTEs from which the TLB can then create direct
entries. Thus, in order to invalidate those when PTE pages are deleted,
we need the virtual address to pass to tlbilx or tlbivax instructions.
The old trick of sticking it somewhere in the PTE page struct page sucks
too much, the address is almost readily available in all call sites and
almost everybody implemets these as macros, so we may as well add the
argument everywhere. I added it to the pmd and pud variants for consistency.
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Acked-by: David Howells <dhowells@redhat.com> [MN10300 & FRV]
Acked-by: Nick Piggin <npiggin@suse.de>
Acked-by: Martin Schwidefsky <schwidefsky@de.ibm.com> [s390]
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2009-07-22 12:44:28 +07:00
|
|
|
void ___pte_free_tlb(struct mmu_gather *tlb, struct page *pte)
|
2008-03-18 06:36:57 +07:00
|
|
|
{
|
|
|
|
pgtable_page_dtor(pte);
|
2008-03-18 06:37:01 +07:00
|
|
|
paravirt_release_pte(page_to_pfn(pte));
|
2008-03-18 06:36:57 +07:00
|
|
|
tlb_remove_page(tlb, pte);
|
|
|
|
}
|
|
|
|
|
2008-03-18 06:36:58 +07:00
|
|
|
#if PAGETABLE_LEVELS > 2
|
mm: Pass virtual address to [__]p{te,ud,md}_free_tlb()
mm: Pass virtual address to [__]p{te,ud,md}_free_tlb()
Upcoming paches to support the new 64-bit "BookE" powerpc architecture
will need to have the virtual address corresponding to PTE page when
freeing it, due to the way the HW table walker works.
Basically, the TLB can be loaded with "large" pages that cover the whole
virtual space (well, sort-of, half of it actually) represented by a PTE
page, and which contain an "indirect" bit indicating that this TLB entry
RPN points to an array of PTEs from which the TLB can then create direct
entries. Thus, in order to invalidate those when PTE pages are deleted,
we need the virtual address to pass to tlbilx or tlbivax instructions.
The old trick of sticking it somewhere in the PTE page struct page sucks
too much, the address is almost readily available in all call sites and
almost everybody implemets these as macros, so we may as well add the
argument everywhere. I added it to the pmd and pud variants for consistency.
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Acked-by: David Howells <dhowells@redhat.com> [MN10300 & FRV]
Acked-by: Nick Piggin <npiggin@suse.de>
Acked-by: Martin Schwidefsky <schwidefsky@de.ibm.com> [s390]
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2009-07-22 12:44:28 +07:00
|
|
|
void ___pmd_free_tlb(struct mmu_gather *tlb, pmd_t *pmd)
|
2008-03-18 06:36:58 +07:00
|
|
|
{
|
2008-03-18 06:37:01 +07:00
|
|
|
paravirt_release_pmd(__pa(pmd) >> PAGE_SHIFT);
|
2008-03-18 06:36:58 +07:00
|
|
|
tlb_remove_page(tlb, virt_to_page(pmd));
|
|
|
|
}
|
2008-03-18 06:36:59 +07:00
|
|
|
|
|
|
|
#if PAGETABLE_LEVELS > 3
|
mm: Pass virtual address to [__]p{te,ud,md}_free_tlb()
mm: Pass virtual address to [__]p{te,ud,md}_free_tlb()
Upcoming paches to support the new 64-bit "BookE" powerpc architecture
will need to have the virtual address corresponding to PTE page when
freeing it, due to the way the HW table walker works.
Basically, the TLB can be loaded with "large" pages that cover the whole
virtual space (well, sort-of, half of it actually) represented by a PTE
page, and which contain an "indirect" bit indicating that this TLB entry
RPN points to an array of PTEs from which the TLB can then create direct
entries. Thus, in order to invalidate those when PTE pages are deleted,
we need the virtual address to pass to tlbilx or tlbivax instructions.
The old trick of sticking it somewhere in the PTE page struct page sucks
too much, the address is almost readily available in all call sites and
almost everybody implemets these as macros, so we may as well add the
argument everywhere. I added it to the pmd and pud variants for consistency.
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
Acked-by: David Howells <dhowells@redhat.com> [MN10300 & FRV]
Acked-by: Nick Piggin <npiggin@suse.de>
Acked-by: Martin Schwidefsky <schwidefsky@de.ibm.com> [s390]
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2009-07-22 12:44:28 +07:00
|
|
|
void ___pud_free_tlb(struct mmu_gather *tlb, pud_t *pud)
|
2008-03-18 06:36:59 +07:00
|
|
|
{
|
2008-03-18 06:37:02 +07:00
|
|
|
paravirt_release_pud(__pa(pud) >> PAGE_SHIFT);
|
2008-03-18 06:36:59 +07:00
|
|
|
tlb_remove_page(tlb, virt_to_page(pud));
|
|
|
|
}
|
|
|
|
#endif /* PAGETABLE_LEVELS > 3 */
|
2008-03-18 06:36:58 +07:00
|
|
|
#endif /* PAGETABLE_LEVELS > 2 */
|
|
|
|
|
2008-03-18 06:36:55 +07:00
|
|
|
static inline void pgd_list_add(pgd_t *pgd)
|
|
|
|
{
|
|
|
|
struct page *page = virt_to_page(pgd);
|
|
|
|
|
|
|
|
list_add(&page->lru, &pgd_list);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void pgd_list_del(pgd_t *pgd)
|
|
|
|
{
|
|
|
|
struct page *page = virt_to_page(pgd);
|
|
|
|
|
|
|
|
list_del(&page->lru);
|
|
|
|
}
|
|
|
|
|
|
|
|
#define UNSHARED_PTRS_PER_PGD \
|
2008-03-18 06:37:13 +07:00
|
|
|
(SHARED_KERNEL_PMD ? KERNEL_PGD_BOUNDARY : PTRS_PER_PGD)
|
2008-03-18 06:36:55 +07:00
|
|
|
|
2010-09-22 02:01:51 +07:00
|
|
|
|
|
|
|
static void pgd_set_mm(pgd_t *pgd, struct mm_struct *mm)
|
|
|
|
{
|
|
|
|
BUILD_BUG_ON(sizeof(virt_to_page(pgd)->index) < sizeof(mm));
|
|
|
|
virt_to_page(pgd)->index = (pgoff_t)mm;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct mm_struct *pgd_page_get_mm(struct page *page)
|
|
|
|
{
|
|
|
|
return (struct mm_struct *)page->index;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void pgd_ctor(struct mm_struct *mm, pgd_t *pgd)
|
2008-03-18 06:36:55 +07:00
|
|
|
{
|
|
|
|
/* If the pgd points to a shared pagetable level (either the
|
|
|
|
ptes in non-PAE, or shared PMD in PAE), then just copy the
|
|
|
|
references from swapper_pg_dir. */
|
|
|
|
if (PAGETABLE_LEVELS == 2 ||
|
2008-03-18 06:37:14 +07:00
|
|
|
(PAGETABLE_LEVELS == 3 && SHARED_KERNEL_PMD) ||
|
|
|
|
PAGETABLE_LEVELS == 4) {
|
2008-03-18 06:37:13 +07:00
|
|
|
clone_pgd_range(pgd + KERNEL_PGD_BOUNDARY,
|
|
|
|
swapper_pg_dir + KERNEL_PGD_BOUNDARY,
|
2008-03-18 06:36:55 +07:00
|
|
|
KERNEL_PGD_PTRS);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* list required to sync kernel mapping updates */
|
2010-09-22 02:01:51 +07:00
|
|
|
if (!SHARED_KERNEL_PMD) {
|
|
|
|
pgd_set_mm(pgd, mm);
|
2008-03-18 06:36:55 +07:00
|
|
|
pgd_list_add(pgd);
|
2010-09-22 02:01:51 +07:00
|
|
|
}
|
2008-03-18 06:36:55 +07:00
|
|
|
}
|
|
|
|
|
2008-08-29 18:51:32 +07:00
|
|
|
static void pgd_dtor(pgd_t *pgd)
|
2008-03-18 06:36:55 +07:00
|
|
|
{
|
|
|
|
if (SHARED_KERNEL_PMD)
|
|
|
|
return;
|
|
|
|
|
2011-02-17 06:45:22 +07:00
|
|
|
spin_lock(&pgd_lock);
|
2008-03-18 06:36:55 +07:00
|
|
|
pgd_list_del(pgd);
|
2011-02-17 06:45:22 +07:00
|
|
|
spin_unlock(&pgd_lock);
|
2008-03-18 06:36:55 +07:00
|
|
|
}
|
|
|
|
|
2008-03-18 06:37:14 +07:00
|
|
|
/*
|
|
|
|
* List of all pgd's needed for non-PAE so it can invalidate entries
|
|
|
|
* in both cached and uncached pgd's; not needed for PAE since the
|
|
|
|
* kernel pmd is shared. If PAE were not to share the pmd a similar
|
|
|
|
* tactic would be needed. This is essentially codepath-based locking
|
|
|
|
* against pageattr.c; it is the unique case in which a valid change
|
|
|
|
* of kernel pagetables can't be lazily synchronized by vmalloc faults.
|
|
|
|
* vmalloc faults work because attached pagetables are never freed.
|
|
|
|
* -- wli
|
|
|
|
*/
|
|
|
|
|
2008-03-18 06:36:55 +07:00
|
|
|
#ifdef CONFIG_X86_PAE
|
2008-06-25 11:19:13 +07:00
|
|
|
/*
|
|
|
|
* In PAE mode, we need to do a cr3 reload (=tlb flush) when
|
|
|
|
* updating the top-level pagetable entries to guarantee the
|
|
|
|
* processor notices the update. Since this is expensive, and
|
|
|
|
* all 4 top-level entries are used almost immediately in a
|
|
|
|
* new process's life, we just pre-populate them here.
|
|
|
|
*
|
|
|
|
* Also, if we're in a paravirt environment where the kernel pmd is
|
|
|
|
* not shared between pagetables (!SHARED_KERNEL_PMDS), we allocate
|
|
|
|
* and initialize the kernel pmds here.
|
|
|
|
*/
|
|
|
|
#define PREALLOCATED_PMDS UNSHARED_PTRS_PER_PGD
|
|
|
|
|
|
|
|
void pud_populate(struct mm_struct *mm, pud_t *pudp, pmd_t *pmd)
|
|
|
|
{
|
|
|
|
paravirt_alloc_pmd(mm, __pa(pmd) >> PAGE_SHIFT);
|
|
|
|
|
|
|
|
/* Note: almost everything apart from _PAGE_PRESENT is
|
|
|
|
reserved at the pmd (PDPT) level. */
|
|
|
|
set_pud(pudp, __pud(__pa(pmd) | _PAGE_PRESENT));
|
|
|
|
|
|
|
|
/*
|
|
|
|
* According to Intel App note "TLBs, Paging-Structure Caches,
|
|
|
|
* and Their Invalidation", April 2007, document 317080-001,
|
|
|
|
* section 8.1: in PAE mode we explicitly have to flush the
|
|
|
|
* TLB via cr3 if the top-level pgd is changed...
|
|
|
|
*/
|
2011-03-16 10:37:29 +07:00
|
|
|
flush_tlb_mm(mm);
|
2008-06-25 11:19:13 +07:00
|
|
|
}
|
|
|
|
#else /* !CONFIG_X86_PAE */
|
|
|
|
|
|
|
|
/* No need to prepopulate any pagetable entries in non-PAE modes. */
|
|
|
|
#define PREALLOCATED_PMDS 0
|
|
|
|
|
|
|
|
#endif /* CONFIG_X86_PAE */
|
|
|
|
|
|
|
|
static void free_pmds(pmd_t *pmds[])
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for(i = 0; i < PREALLOCATED_PMDS; i++)
|
|
|
|
if (pmds[i])
|
|
|
|
free_page((unsigned long)pmds[i]);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int preallocate_pmds(pmd_t *pmds[])
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
bool failed = false;
|
|
|
|
|
|
|
|
for(i = 0; i < PREALLOCATED_PMDS; i++) {
|
2009-02-22 17:28:25 +07:00
|
|
|
pmd_t *pmd = (pmd_t *)__get_free_page(PGALLOC_GFP);
|
2008-06-25 11:19:13 +07:00
|
|
|
if (pmd == NULL)
|
|
|
|
failed = true;
|
|
|
|
pmds[i] = pmd;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (failed) {
|
|
|
|
free_pmds(pmds);
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-03-18 06:36:55 +07:00
|
|
|
/*
|
|
|
|
* Mop up any pmd pages which may still be attached to the pgd.
|
|
|
|
* Normally they will be freed by munmap/exit_mmap, but any pmd we
|
|
|
|
* preallocate which never got a corresponding vma will need to be
|
|
|
|
* freed manually.
|
|
|
|
*/
|
|
|
|
static void pgd_mop_up_pmds(struct mm_struct *mm, pgd_t *pgdp)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
2008-06-25 11:19:13 +07:00
|
|
|
for(i = 0; i < PREALLOCATED_PMDS; i++) {
|
2008-03-18 06:36:55 +07:00
|
|
|
pgd_t pgd = pgdp[i];
|
|
|
|
|
|
|
|
if (pgd_val(pgd) != 0) {
|
|
|
|
pmd_t *pmd = (pmd_t *)pgd_page_vaddr(pgd);
|
|
|
|
|
|
|
|
pgdp[i] = native_make_pgd(0);
|
|
|
|
|
2008-03-18 06:37:01 +07:00
|
|
|
paravirt_release_pmd(pgd_val(pgd) >> PAGE_SHIFT);
|
2008-03-18 06:36:55 +07:00
|
|
|
pmd_free(mm, pmd);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-06-25 11:19:13 +07:00
|
|
|
static void pgd_prepopulate_pmd(struct mm_struct *mm, pgd_t *pgd, pmd_t *pmds[])
|
2008-03-18 06:36:55 +07:00
|
|
|
{
|
|
|
|
pud_t *pud;
|
|
|
|
unsigned long addr;
|
|
|
|
int i;
|
|
|
|
|
2008-08-09 03:46:07 +07:00
|
|
|
if (PREALLOCATED_PMDS == 0) /* Work around gcc-3.4.x bug */
|
|
|
|
return;
|
|
|
|
|
2008-03-18 06:36:55 +07:00
|
|
|
pud = pud_offset(pgd, 0);
|
|
|
|
|
2008-06-25 11:19:13 +07:00
|
|
|
for (addr = i = 0; i < PREALLOCATED_PMDS;
|
|
|
|
i++, pud++, addr += PUD_SIZE) {
|
|
|
|
pmd_t *pmd = pmds[i];
|
2008-03-18 06:36:55 +07:00
|
|
|
|
2008-03-18 06:37:13 +07:00
|
|
|
if (i >= KERNEL_PGD_BOUNDARY)
|
2008-03-18 06:36:55 +07:00
|
|
|
memcpy(pmd, (pmd_t *)pgd_page_vaddr(swapper_pg_dir[i]),
|
|
|
|
sizeof(pmd_t) * PTRS_PER_PMD);
|
|
|
|
|
|
|
|
pud_populate(mm, pud, pmd);
|
|
|
|
}
|
|
|
|
}
|
2008-03-20 02:30:40 +07:00
|
|
|
|
2008-06-25 11:19:13 +07:00
|
|
|
pgd_t *pgd_alloc(struct mm_struct *mm)
|
2008-03-20 02:30:40 +07:00
|
|
|
{
|
2008-06-25 11:19:13 +07:00
|
|
|
pgd_t *pgd;
|
|
|
|
pmd_t *pmds[PREALLOCATED_PMDS];
|
2008-03-20 02:30:40 +07:00
|
|
|
|
2009-02-22 17:28:25 +07:00
|
|
|
pgd = (pgd_t *)__get_free_page(PGALLOC_GFP);
|
2008-06-25 11:19:13 +07:00
|
|
|
|
|
|
|
if (pgd == NULL)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
mm->pgd = pgd;
|
|
|
|
|
|
|
|
if (preallocate_pmds(pmds) != 0)
|
|
|
|
goto out_free_pgd;
|
|
|
|
|
|
|
|
if (paravirt_pgd_alloc(mm) != 0)
|
|
|
|
goto out_free_pmds;
|
2008-03-20 02:30:40 +07:00
|
|
|
|
|
|
|
/*
|
2008-06-25 11:19:13 +07:00
|
|
|
* Make sure that pre-populating the pmds is atomic with
|
|
|
|
* respect to anything walking the pgd_list, so that they
|
|
|
|
* never see a partially populated pgd.
|
2008-03-20 02:30:40 +07:00
|
|
|
*/
|
2011-02-17 06:45:22 +07:00
|
|
|
spin_lock(&pgd_lock);
|
2008-03-18 06:36:55 +07:00
|
|
|
|
2010-09-22 02:01:51 +07:00
|
|
|
pgd_ctor(mm, pgd);
|
2008-06-25 11:19:13 +07:00
|
|
|
pgd_prepopulate_pmd(mm, pgd, pmds);
|
2008-03-18 06:36:55 +07:00
|
|
|
|
2011-02-17 06:45:22 +07:00
|
|
|
spin_unlock(&pgd_lock);
|
2008-03-18 06:36:55 +07:00
|
|
|
|
|
|
|
return pgd;
|
2008-06-25 11:19:13 +07:00
|
|
|
|
|
|
|
out_free_pmds:
|
|
|
|
free_pmds(pmds);
|
|
|
|
out_free_pgd:
|
|
|
|
free_page((unsigned long)pgd);
|
|
|
|
out:
|
|
|
|
return NULL;
|
2008-03-18 06:36:55 +07:00
|
|
|
}
|
|
|
|
|
|
|
|
void pgd_free(struct mm_struct *mm, pgd_t *pgd)
|
|
|
|
{
|
|
|
|
pgd_mop_up_pmds(mm, pgd);
|
|
|
|
pgd_dtor(pgd);
|
2008-06-25 11:19:12 +07:00
|
|
|
paravirt_pgd_free(mm, pgd);
|
2008-03-18 06:36:55 +07:00
|
|
|
free_page((unsigned long)pgd);
|
|
|
|
}
|
2008-03-18 06:37:03 +07:00
|
|
|
|
|
|
|
int ptep_set_access_flags(struct vm_area_struct *vma,
|
|
|
|
unsigned long address, pte_t *ptep,
|
|
|
|
pte_t entry, int dirty)
|
|
|
|
{
|
|
|
|
int changed = !pte_same(*ptep, entry);
|
|
|
|
|
|
|
|
if (changed && dirty) {
|
|
|
|
*ptep = entry;
|
|
|
|
pte_update_defer(vma->vm_mm, address, ptep);
|
|
|
|
flush_tlb_page(vma, address);
|
|
|
|
}
|
|
|
|
|
|
|
|
return changed;
|
|
|
|
}
|
2008-03-18 06:37:04 +07:00
|
|
|
|
2011-01-14 06:46:41 +07:00
|
|
|
#ifdef CONFIG_TRANSPARENT_HUGEPAGE
|
|
|
|
int pmdp_set_access_flags(struct vm_area_struct *vma,
|
|
|
|
unsigned long address, pmd_t *pmdp,
|
|
|
|
pmd_t entry, int dirty)
|
|
|
|
{
|
|
|
|
int changed = !pmd_same(*pmdp, entry);
|
|
|
|
|
|
|
|
VM_BUG_ON(address & ~HPAGE_PMD_MASK);
|
|
|
|
|
|
|
|
if (changed && dirty) {
|
|
|
|
*pmdp = entry;
|
|
|
|
pmd_update_defer(vma->vm_mm, address, pmdp);
|
|
|
|
flush_tlb_range(vma, address, address + HPAGE_PMD_SIZE);
|
|
|
|
}
|
|
|
|
|
|
|
|
return changed;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2008-03-18 06:37:04 +07:00
|
|
|
int ptep_test_and_clear_young(struct vm_area_struct *vma,
|
|
|
|
unsigned long addr, pte_t *ptep)
|
|
|
|
{
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
if (pte_young(*ptep))
|
|
|
|
ret = test_and_clear_bit(_PAGE_BIT_ACCESSED,
|
2008-05-24 22:24:34 +07:00
|
|
|
(unsigned long *) &ptep->pte);
|
2008-03-18 06:37:04 +07:00
|
|
|
|
|
|
|
if (ret)
|
|
|
|
pte_update(vma->vm_mm, addr, ptep);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
2008-03-18 06:37:05 +07:00
|
|
|
|
2011-01-14 06:46:41 +07:00
|
|
|
#ifdef CONFIG_TRANSPARENT_HUGEPAGE
|
|
|
|
int pmdp_test_and_clear_young(struct vm_area_struct *vma,
|
|
|
|
unsigned long addr, pmd_t *pmdp)
|
|
|
|
{
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
if (pmd_young(*pmdp))
|
|
|
|
ret = test_and_clear_bit(_PAGE_BIT_ACCESSED,
|
2011-01-14 06:47:01 +07:00
|
|
|
(unsigned long *)pmdp);
|
2011-01-14 06:46:41 +07:00
|
|
|
|
|
|
|
if (ret)
|
|
|
|
pmd_update(vma->vm_mm, addr, pmdp);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2008-03-18 06:37:05 +07:00
|
|
|
int ptep_clear_flush_young(struct vm_area_struct *vma,
|
|
|
|
unsigned long address, pte_t *ptep)
|
|
|
|
{
|
|
|
|
int young;
|
|
|
|
|
|
|
|
young = ptep_test_and_clear_young(vma, address, ptep);
|
|
|
|
if (young)
|
|
|
|
flush_tlb_page(vma, address);
|
|
|
|
|
|
|
|
return young;
|
|
|
|
}
|
2008-06-18 01:41:54 +07:00
|
|
|
|
2011-01-14 06:46:41 +07:00
|
|
|
#ifdef CONFIG_TRANSPARENT_HUGEPAGE
|
|
|
|
int pmdp_clear_flush_young(struct vm_area_struct *vma,
|
|
|
|
unsigned long address, pmd_t *pmdp)
|
|
|
|
{
|
|
|
|
int young;
|
|
|
|
|
|
|
|
VM_BUG_ON(address & ~HPAGE_PMD_MASK);
|
|
|
|
|
|
|
|
young = pmdp_test_and_clear_young(vma, address, pmdp);
|
|
|
|
if (young)
|
|
|
|
flush_tlb_range(vma, address, address + HPAGE_PMD_SIZE);
|
|
|
|
|
|
|
|
return young;
|
|
|
|
}
|
|
|
|
|
|
|
|
void pmdp_splitting_flush(struct vm_area_struct *vma,
|
|
|
|
unsigned long address, pmd_t *pmdp)
|
|
|
|
{
|
|
|
|
int set;
|
|
|
|
VM_BUG_ON(address & ~HPAGE_PMD_MASK);
|
|
|
|
set = !test_and_set_bit(_PAGE_BIT_SPLITTING,
|
2011-01-14 06:47:01 +07:00
|
|
|
(unsigned long *)pmdp);
|
2011-01-14 06:46:41 +07:00
|
|
|
if (set) {
|
|
|
|
pmd_update(vma->vm_mm, address, pmdp);
|
|
|
|
/* need tlb flush only to serialize against gup-fast */
|
|
|
|
flush_tlb_range(vma, address, address + HPAGE_PMD_SIZE);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2009-02-16 07:48:54 +07:00
|
|
|
/**
|
|
|
|
* reserve_top_address - reserves a hole in the top of kernel address space
|
|
|
|
* @reserve - size of hole to reserve
|
|
|
|
*
|
|
|
|
* Can be used to relocate the fixmap area and poke a hole in the top
|
|
|
|
* of kernel address space to make room for a hypervisor.
|
|
|
|
*/
|
|
|
|
void __init reserve_top_address(unsigned long reserve)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_X86_32
|
|
|
|
BUG_ON(fixmaps_set > 0);
|
|
|
|
printk(KERN_INFO "Reserving virtual address space above 0x%08x\n",
|
|
|
|
(int)-reserve);
|
|
|
|
__FIXADDR_TOP = -reserve - PAGE_SIZE;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2008-06-18 01:41:54 +07:00
|
|
|
int fixmaps_set;
|
|
|
|
|
2008-06-18 01:42:01 +07:00
|
|
|
void __native_set_fixmap(enum fixed_addresses idx, pte_t pte)
|
2008-06-18 01:41:54 +07:00
|
|
|
{
|
|
|
|
unsigned long address = __fix_to_virt(idx);
|
|
|
|
|
|
|
|
if (idx >= __end_of_fixed_addresses) {
|
|
|
|
BUG();
|
|
|
|
return;
|
|
|
|
}
|
2008-06-18 01:42:01 +07:00
|
|
|
set_pte_vaddr(address, pte);
|
2008-06-18 01:41:54 +07:00
|
|
|
fixmaps_set++;
|
|
|
|
}
|
2008-06-18 01:42:01 +07:00
|
|
|
|
2009-04-10 00:55:33 +07:00
|
|
|
void native_set_fixmap(enum fixed_addresses idx, phys_addr_t phys,
|
|
|
|
pgprot_t flags)
|
2008-06-18 01:42:01 +07:00
|
|
|
{
|
|
|
|
__native_set_fixmap(idx, pfn_pte(phys >> PAGE_SHIFT, flags));
|
|
|
|
}
|