2007-04-30 00:30:56 -06:00
|
|
|
#ifndef _ASM_POWERPC_PGALLOC_64_H
|
|
|
|
#define _ASM_POWERPC_PGALLOC_64_H
|
|
|
|
/*
|
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License
|
|
|
|
* as published by the Free Software Foundation; either version
|
|
|
|
* 2 of the License, or (at your option) any later version.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/slab.h>
|
|
|
|
#include <linux/cpumask.h>
|
|
|
|
#include <linux/percpu.h>
|
|
|
|
|
2009-10-28 10:27:18 -06:00
|
|
|
/*
|
|
|
|
* Functions that deal with pagetables that could be at any level of
|
|
|
|
* the table need to be passed an "index_size" so they know how to
|
|
|
|
* handle allocation. For PTE pages (which are linked to a struct
|
|
|
|
* page for now, and drawn from the main get_free_pages() pool), the
|
|
|
|
* allocation size will be (2^index_size * sizeof(pointer)) and
|
|
|
|
* allocations are drawn from the kmem_cache in PGT_CACHE(index_size).
|
|
|
|
*
|
|
|
|
* The maximum index size needs to be big enough to allow any
|
|
|
|
* pagetable sizes we need, but small enough to fit in the low bits of
|
|
|
|
* any page table pointer. In other words all pagetables, even tiny
|
|
|
|
* ones, must be aligned to allow at least enough low 0 bits to
|
|
|
|
* contain this value. This value is also used as a mask, so it must
|
|
|
|
* be one less than a power of two.
|
|
|
|
*/
|
|
|
|
#define MAX_PGTABLE_INDEX_SIZE 0xf
|
|
|
|
|
2007-04-30 00:30:56 -06:00
|
|
|
extern struct kmem_cache *pgtable_cache[];
|
2009-10-28 10:27:18 -06:00
|
|
|
#define PGT_CACHE(shift) (pgtable_cache[(shift)-1])
|
2007-04-30 00:30:56 -06:00
|
|
|
|
|
|
|
static inline pgd_t *pgd_alloc(struct mm_struct *mm)
|
|
|
|
{
|
2009-10-28 10:27:18 -06:00
|
|
|
return kmem_cache_alloc(PGT_CACHE(PGD_INDEX_SIZE), GFP_KERNEL);
|
2007-04-30 00:30:56 -06:00
|
|
|
}
|
|
|
|
|
2008-02-04 23:29:14 -07:00
|
|
|
static inline void pgd_free(struct mm_struct *mm, pgd_t *pgd)
|
2007-04-30 00:30:56 -06:00
|
|
|
{
|
2009-10-28 10:27:18 -06:00
|
|
|
kmem_cache_free(PGT_CACHE(PGD_INDEX_SIZE), pgd);
|
2007-04-30 00:30:56 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef CONFIG_PPC_64K_PAGES
|
|
|
|
|
|
|
|
#define pgd_populate(MM, PGD, PUD) pgd_set(PGD, PUD)
|
|
|
|
|
|
|
|
static inline pud_t *pud_alloc_one(struct mm_struct *mm, unsigned long addr)
|
|
|
|
{
|
2009-10-28 10:27:18 -06:00
|
|
|
return kmem_cache_alloc(PGT_CACHE(PUD_INDEX_SIZE),
|
2007-04-30 00:30:56 -06:00
|
|
|
GFP_KERNEL|__GFP_REPEAT);
|
|
|
|
}
|
|
|
|
|
2008-02-04 23:29:14 -07:00
|
|
|
static inline void pud_free(struct mm_struct *mm, pud_t *pud)
|
2007-04-30 00:30:56 -06:00
|
|
|
{
|
2009-10-28 10:27:18 -06:00
|
|
|
kmem_cache_free(PGT_CACHE(PUD_INDEX_SIZE), pud);
|
2007-04-30 00:30:56 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline void pud_populate(struct mm_struct *mm, pud_t *pud, pmd_t *pmd)
|
|
|
|
{
|
|
|
|
pud_set(pud, (unsigned long)pmd);
|
|
|
|
}
|
|
|
|
|
|
|
|
#define pmd_populate(mm, pmd, pte_page) \
|
|
|
|
pmd_populate_kernel(mm, pmd, page_address(pte_page))
|
|
|
|
#define pmd_populate_kernel(mm, pmd, pte) pmd_set(pmd, (unsigned long)(pte))
|
2008-02-08 05:22:04 -07:00
|
|
|
#define pmd_pgtable(pmd) pmd_page(pmd)
|
2007-04-30 00:30:56 -06:00
|
|
|
|
|
|
|
|
|
|
|
#else /* CONFIG_PPC_64K_PAGES */
|
|
|
|
|
|
|
|
#define pud_populate(mm, pud, pmd) pud_set(pud, (unsigned long)pmd)
|
|
|
|
|
|
|
|
static inline void pmd_populate_kernel(struct mm_struct *mm, pmd_t *pmd,
|
|
|
|
pte_t *pte)
|
|
|
|
{
|
|
|
|
pmd_set(pmd, (unsigned long)pte);
|
|
|
|
}
|
|
|
|
|
|
|
|
#define pmd_populate(mm, pmd, pte_page) \
|
|
|
|
pmd_populate_kernel(mm, pmd, page_address(pte_page))
|
2008-02-08 05:22:04 -07:00
|
|
|
#define pmd_pgtable(pmd) pmd_page(pmd)
|
2007-04-30 00:30:56 -06:00
|
|
|
|
|
|
|
#endif /* CONFIG_PPC_64K_PAGES */
|
|
|
|
|
|
|
|
static inline pmd_t *pmd_alloc_one(struct mm_struct *mm, unsigned long addr)
|
|
|
|
{
|
2009-10-28 10:27:18 -06:00
|
|
|
return kmem_cache_alloc(PGT_CACHE(PMD_INDEX_SIZE),
|
2007-04-30 00:30:56 -06:00
|
|
|
GFP_KERNEL|__GFP_REPEAT);
|
|
|
|
}
|
|
|
|
|
2008-02-04 23:29:14 -07:00
|
|
|
static inline void pmd_free(struct mm_struct *mm, pmd_t *pmd)
|
2007-04-30 00:30:56 -06:00
|
|
|
{
|
2009-10-28 10:27:18 -06:00
|
|
|
kmem_cache_free(PGT_CACHE(PMD_INDEX_SIZE), pmd);
|
2007-04-30 00:30:56 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline pte_t *pte_alloc_one_kernel(struct mm_struct *mm,
|
|
|
|
unsigned long address)
|
|
|
|
{
|
2007-05-08 22:38:48 -06:00
|
|
|
return (pte_t *)__get_free_page(GFP_KERNEL | __GFP_REPEAT | __GFP_ZERO);
|
2007-04-30 00:30:56 -06:00
|
|
|
}
|
|
|
|
|
2008-02-08 05:22:04 -07:00
|
|
|
static inline pgtable_t pte_alloc_one(struct mm_struct *mm,
|
|
|
|
unsigned long address)
|
2007-04-30 00:30:56 -06:00
|
|
|
{
|
2008-02-08 05:22:04 -07:00
|
|
|
struct page *page;
|
|
|
|
pte_t *pte;
|
|
|
|
|
|
|
|
pte = pte_alloc_one_kernel(mm, address);
|
|
|
|
if (!pte)
|
|
|
|
return NULL;
|
|
|
|
page = virt_to_page(pte);
|
|
|
|
pgtable_page_ctor(page);
|
|
|
|
return page;
|
2007-04-30 00:30:56 -06:00
|
|
|
}
|
|
|
|
|
2009-10-28 10:27:18 -06:00
|
|
|
static inline void pgtable_free(void *table, unsigned index_size)
|
2007-04-30 00:30:56 -06:00
|
|
|
{
|
2009-10-28 10:27:18 -06:00
|
|
|
if (!index_size)
|
|
|
|
free_page((unsigned long)table);
|
|
|
|
else {
|
|
|
|
BUG_ON(index_size > MAX_PGTABLE_INDEX_SIZE);
|
|
|
|
kmem_cache_free(PGT_CACHE(index_size), table);
|
|
|
|
}
|
2007-04-30 00:30:56 -06:00
|
|
|
}
|
|
|
|
|
2009-10-28 10:27:18 -06:00
|
|
|
#define __pmd_free_tlb(tlb, pmd, addr) \
|
|
|
|
pgtable_free_tlb(tlb, pmd, PMD_INDEX_SIZE)
|
2007-04-30 00:30:56 -06:00
|
|
|
#ifndef CONFIG_PPC_64K_PAGES
|
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-21 23:44:28 -06:00
|
|
|
#define __pud_free_tlb(tlb, pud, addr) \
|
2009-10-28 10:27:18 -06:00
|
|
|
pgtable_free_tlb(tlb, pud, PUD_INDEX_SIZE)
|
|
|
|
|
2007-04-30 00:30:56 -06:00
|
|
|
#endif /* CONFIG_PPC_64K_PAGES */
|
|
|
|
|
|
|
|
#define check_pgt_cache() do { } while (0)
|
|
|
|
|
|
|
|
#endif /* _ASM_POWERPC_PGALLOC_64_H */
|