2016-04-29 13:26:29 +00:00
|
|
|
/*
|
|
|
|
* Copyright 2015-2016, Aneesh Kumar K.V, IBM Corporation.
|
|
|
|
*
|
|
|
|
* 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/sched.h>
|
2017-02-03 23:16:44 +00:00
|
|
|
#include <linux/mm_types.h>
|
2018-04-16 11:27:14 +00:00
|
|
|
#include <linux/memblock.h>
|
2017-07-27 06:24:54 +00:00
|
|
|
#include <misc/cxl-base.h>
|
2017-02-03 23:16:44 +00:00
|
|
|
|
2016-04-29 13:26:29 +00:00
|
|
|
#include <asm/pgalloc.h>
|
|
|
|
#include <asm/tlb.h>
|
2018-04-16 11:27:14 +00:00
|
|
|
#include <asm/trace.h>
|
|
|
|
#include <asm/powernv.h>
|
2016-04-29 13:26:29 +00:00
|
|
|
|
|
|
|
#include "mmu_decl.h"
|
|
|
|
#include <trace/events/thp.h>
|
|
|
|
|
2016-08-04 05:32:06 +00:00
|
|
|
int (*register_process_table)(unsigned long base, unsigned long page_size,
|
|
|
|
unsigned long tbl_size);
|
|
|
|
|
2016-04-29 13:26:29 +00:00
|
|
|
#ifdef CONFIG_TRANSPARENT_HUGEPAGE
|
|
|
|
/*
|
|
|
|
* This is called when relaxing access to a hugepage. It's also called in the page
|
|
|
|
* fault path when we don't hit any of the major fault cases, ie, a minor
|
|
|
|
* update of _PAGE_ACCESSED, _PAGE_DIRTY, etc... The generic code will have
|
|
|
|
* handled those two for us, we additionally deal with missing execute
|
|
|
|
* permission here on some processors
|
|
|
|
*/
|
|
|
|
int pmdp_set_access_flags(struct vm_area_struct *vma, unsigned long address,
|
|
|
|
pmd_t *pmdp, pmd_t entry, int dirty)
|
|
|
|
{
|
|
|
|
int changed;
|
|
|
|
#ifdef CONFIG_DEBUG_VM
|
2017-06-28 01:32:34 +00:00
|
|
|
WARN_ON(!pmd_trans_huge(*pmdp) && !pmd_devmap(*pmdp));
|
2018-04-16 11:27:16 +00:00
|
|
|
assert_spin_locked(pmd_lockptr(vma->vm_mm, pmdp));
|
2016-04-29 13:26:29 +00:00
|
|
|
#endif
|
|
|
|
changed = !pmd_same(*(pmdp), entry);
|
|
|
|
if (changed) {
|
2016-11-28 06:17:02 +00:00
|
|
|
__ptep_set_access_flags(vma->vm_mm, pmdp_ptep(pmdp),
|
|
|
|
pmd_pte(entry), address);
|
2016-07-13 09:36:40 +00:00
|
|
|
flush_pmd_tlb_range(vma, address, address + HPAGE_PMD_SIZE);
|
2016-04-29 13:26:29 +00:00
|
|
|
}
|
|
|
|
return changed;
|
|
|
|
}
|
|
|
|
|
|
|
|
int pmdp_test_and_clear_young(struct vm_area_struct *vma,
|
|
|
|
unsigned long address, pmd_t *pmdp)
|
|
|
|
{
|
|
|
|
return __pmdp_test_and_clear_young(vma->vm_mm, address, pmdp);
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* set a new huge pmd. We should not be called for updating
|
|
|
|
* an existing pmd entry. That should go via pmd_hugepage_update.
|
|
|
|
*/
|
|
|
|
void set_pmd_at(struct mm_struct *mm, unsigned long addr,
|
|
|
|
pmd_t *pmdp, pmd_t pmd)
|
|
|
|
{
|
|
|
|
#ifdef CONFIG_DEBUG_VM
|
|
|
|
WARN_ON(pte_present(pmd_pte(*pmdp)) && !pte_protnone(pmd_pte(*pmdp)));
|
2018-04-16 11:27:16 +00:00
|
|
|
assert_spin_locked(pmd_lockptr(mm, pmdp));
|
2017-06-28 01:32:34 +00:00
|
|
|
WARN_ON(!(pmd_trans_huge(pmd) || pmd_devmap(pmd)));
|
2016-04-29 13:26:29 +00:00
|
|
|
#endif
|
|
|
|
trace_hugepage_set_pmd(addr, pmd_val(pmd));
|
|
|
|
return set_pte_at(mm, addr, pmdp_ptep(pmdp), pmd_pte(pmd));
|
|
|
|
}
|
2017-07-27 06:24:54 +00:00
|
|
|
|
|
|
|
static void do_nothing(void *unused)
|
|
|
|
{
|
|
|
|
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Serialize against find_current_mm_pte which does lock-less
|
|
|
|
* lookup in page tables with local interrupts disabled. For huge pages
|
|
|
|
* it casts pmd_t to pte_t. Since format of pte_t is different from
|
|
|
|
* pmd_t we want to prevent transit from pmd pointing to page table
|
|
|
|
* to pmd pointing to huge page (and back) while interrupts are disabled.
|
|
|
|
* We clear pmd to possibly replace it with page table pointer in
|
|
|
|
* different code paths. So make sure we wait for the parallel
|
|
|
|
* find_current_mm_pte to finish.
|
|
|
|
*/
|
|
|
|
void serialize_against_pte_lookup(struct mm_struct *mm)
|
|
|
|
{
|
|
|
|
smp_mb();
|
2017-07-27 06:24:55 +00:00
|
|
|
smp_call_function_many(mm_cpumask(mm), do_nothing, NULL, 1);
|
2017-07-27 06:24:54 +00:00
|
|
|
}
|
|
|
|
|
2016-04-29 13:26:29 +00:00
|
|
|
/*
|
|
|
|
* We use this to invalidate a pmdp entry before switching from a
|
|
|
|
* hugepte to regular pmd entry.
|
|
|
|
*/
|
2018-02-01 00:18:02 +00:00
|
|
|
pmd_t pmdp_invalidate(struct vm_area_struct *vma, unsigned long address,
|
2016-04-29 13:26:29 +00:00
|
|
|
pmd_t *pmdp)
|
|
|
|
{
|
2018-02-01 00:18:02 +00:00
|
|
|
unsigned long old_pmd;
|
|
|
|
|
|
|
|
old_pmd = pmd_hugepage_update(vma->vm_mm, address, pmdp, _PAGE_PRESENT, 0);
|
2016-07-13 09:36:40 +00:00
|
|
|
flush_pmd_tlb_range(vma, address, address + HPAGE_PMD_SIZE);
|
2016-04-29 13:26:29 +00:00
|
|
|
/*
|
|
|
|
* This ensures that generic code that rely on IRQ disabling
|
|
|
|
* to prevent a parallel THP split work as expected.
|
|
|
|
*/
|
2017-07-27 06:24:54 +00:00
|
|
|
serialize_against_pte_lookup(vma->vm_mm);
|
2018-02-01 00:18:02 +00:00
|
|
|
return __pmd(old_pmd);
|
2016-04-29 13:26:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static pmd_t pmd_set_protbits(pmd_t pmd, pgprot_t pgprot)
|
|
|
|
{
|
|
|
|
return __pmd(pmd_val(pmd) | pgprot_val(pgprot));
|
|
|
|
}
|
|
|
|
|
|
|
|
pmd_t pfn_pmd(unsigned long pfn, pgprot_t pgprot)
|
|
|
|
{
|
|
|
|
unsigned long pmdv;
|
|
|
|
|
|
|
|
pmdv = (pfn << PAGE_SHIFT) & PTE_RPN_MASK;
|
|
|
|
return pmd_set_protbits(__pmd(pmdv), pgprot);
|
|
|
|
}
|
|
|
|
|
|
|
|
pmd_t mk_pmd(struct page *page, pgprot_t pgprot)
|
|
|
|
{
|
|
|
|
return pfn_pmd(page_to_pfn(page), pgprot);
|
|
|
|
}
|
|
|
|
|
|
|
|
pmd_t pmd_modify(pmd_t pmd, pgprot_t newprot)
|
|
|
|
{
|
|
|
|
unsigned long pmdv;
|
|
|
|
|
|
|
|
pmdv = pmd_val(pmd);
|
|
|
|
pmdv &= _HPAGE_CHG_MASK;
|
|
|
|
return pmd_set_protbits(__pmd(pmdv), newprot);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is called at the end of handling a user page fault, when the
|
|
|
|
* fault has been handled by updating a HUGE PMD entry in the linux page tables.
|
|
|
|
* We use it to preload an HPTE into the hash table corresponding to
|
|
|
|
* the updated linux HUGE PMD entry.
|
|
|
|
*/
|
|
|
|
void update_mmu_cache_pmd(struct vm_area_struct *vma, unsigned long addr,
|
|
|
|
pmd_t *pmd)
|
|
|
|
{
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_TRANSPARENT_HUGEPAGE */
|
2016-08-19 08:52:37 +00:00
|
|
|
|
|
|
|
/* For use by kexec */
|
|
|
|
void mmu_cleanup_all(void)
|
|
|
|
{
|
|
|
|
if (radix_enabled())
|
|
|
|
radix__mmu_cleanup_all();
|
|
|
|
else if (mmu_hash_ops.hpte_clear_all)
|
|
|
|
mmu_hash_ops.hpte_clear_all();
|
|
|
|
}
|
2017-01-03 20:39:51 +00:00
|
|
|
|
|
|
|
#ifdef CONFIG_MEMORY_HOTPLUG
|
2018-03-30 13:11:24 +00:00
|
|
|
int __meminit create_section_mapping(unsigned long start, unsigned long end, int nid)
|
2017-01-03 20:39:51 +00:00
|
|
|
{
|
|
|
|
if (radix_enabled())
|
2018-02-13 15:08:22 +00:00
|
|
|
return radix__create_section_mapping(start, end, nid);
|
2017-01-03 20:39:51 +00:00
|
|
|
|
2018-02-13 15:08:22 +00:00
|
|
|
return hash__create_section_mapping(start, end, nid);
|
2017-01-03 20:39:51 +00:00
|
|
|
}
|
|
|
|
|
2018-03-09 20:45:58 +00:00
|
|
|
int __meminit remove_section_mapping(unsigned long start, unsigned long end)
|
2017-01-03 20:39:51 +00:00
|
|
|
{
|
|
|
|
if (radix_enabled())
|
2017-01-16 19:07:45 +00:00
|
|
|
return radix__remove_section_mapping(start, end);
|
2017-01-03 20:39:51 +00:00
|
|
|
|
|
|
|
return hash__remove_section_mapping(start, end);
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_MEMORY_HOTPLUG */
|
2018-04-16 11:27:14 +00:00
|
|
|
|
|
|
|
void __init mmu_partition_table_init(void)
|
|
|
|
{
|
|
|
|
unsigned long patb_size = 1UL << PATB_SIZE_SHIFT;
|
|
|
|
unsigned long ptcr;
|
|
|
|
|
|
|
|
BUILD_BUG_ON_MSG((PATB_SIZE_SHIFT > 36), "Partition table size too large.");
|
|
|
|
partition_tb = __va(memblock_alloc_base(patb_size, patb_size,
|
|
|
|
MEMBLOCK_ALLOC_ANYWHERE));
|
|
|
|
|
|
|
|
/* Initialize the Partition Table with no entries */
|
|
|
|
memset((void *)partition_tb, 0, patb_size);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* update partition table control register,
|
|
|
|
* 64 K size.
|
|
|
|
*/
|
|
|
|
ptcr = __pa(partition_tb) | (PATB_SIZE_SHIFT - 12);
|
|
|
|
mtspr(SPRN_PTCR, ptcr);
|
|
|
|
powernv_set_nmmu_ptcr(ptcr);
|
|
|
|
}
|
|
|
|
|
|
|
|
void mmu_partition_table_set_entry(unsigned int lpid, unsigned long dw0,
|
|
|
|
unsigned long dw1)
|
|
|
|
{
|
|
|
|
unsigned long old = be64_to_cpu(partition_tb[lpid].patb0);
|
|
|
|
|
|
|
|
partition_tb[lpid].patb0 = cpu_to_be64(dw0);
|
|
|
|
partition_tb[lpid].patb1 = cpu_to_be64(dw1);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Global flush of TLBs and partition table caches for this lpid.
|
|
|
|
* The type of flush (hash or radix) depends on what the previous
|
|
|
|
* use of this partition ID was, not the new use.
|
|
|
|
*/
|
|
|
|
asm volatile("ptesync" : : : "memory");
|
|
|
|
if (old & PATB_HR) {
|
|
|
|
asm volatile(PPC_TLBIE_5(%0,%1,2,0,1) : :
|
|
|
|
"r" (TLBIEL_INVAL_SET_LPID), "r" (lpid));
|
|
|
|
asm volatile(PPC_TLBIE_5(%0,%1,2,1,1) : :
|
|
|
|
"r" (TLBIEL_INVAL_SET_LPID), "r" (lpid));
|
|
|
|
trace_tlbie(lpid, 0, TLBIEL_INVAL_SET_LPID, lpid, 2, 0, 1);
|
|
|
|
} else {
|
|
|
|
asm volatile(PPC_TLBIE_5(%0,%1,2,0,0) : :
|
|
|
|
"r" (TLBIEL_INVAL_SET_LPID), "r" (lpid));
|
|
|
|
trace_tlbie(lpid, 0, TLBIEL_INVAL_SET_LPID, lpid, 2, 0, 0);
|
|
|
|
}
|
|
|
|
/* do we need fixup here ?*/
|
|
|
|
asm volatile("eieio; tlbsync; ptesync" : : : "memory");
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(mmu_partition_table_set_entry);
|
2018-04-16 11:27:20 +00:00
|
|
|
|
2018-04-16 11:27:19 +00:00
|
|
|
static pte_t *get_pte_from_cache(struct mm_struct *mm)
|
|
|
|
{
|
|
|
|
void *pte_frag, *ret;
|
|
|
|
|
|
|
|
spin_lock(&mm->page_table_lock);
|
|
|
|
ret = mm->context.pte_frag;
|
|
|
|
if (ret) {
|
|
|
|
pte_frag = ret + PTE_FRAG_SIZE;
|
|
|
|
/*
|
|
|
|
* If we have taken up all the fragments mark PTE page NULL
|
|
|
|
*/
|
|
|
|
if (((unsigned long)pte_frag & ~PAGE_MASK) == 0)
|
|
|
|
pte_frag = NULL;
|
|
|
|
mm->context.pte_frag = pte_frag;
|
|
|
|
}
|
|
|
|
spin_unlock(&mm->page_table_lock);
|
|
|
|
return (pte_t *)ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static pte_t *__alloc_for_ptecache(struct mm_struct *mm, int kernel)
|
|
|
|
{
|
|
|
|
void *ret = NULL;
|
|
|
|
struct page *page;
|
|
|
|
|
|
|
|
if (!kernel) {
|
|
|
|
page = alloc_page(PGALLOC_GFP | __GFP_ACCOUNT);
|
|
|
|
if (!page)
|
|
|
|
return NULL;
|
|
|
|
if (!pgtable_page_ctor(page)) {
|
|
|
|
__free_page(page);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
page = alloc_page(PGALLOC_GFP);
|
|
|
|
if (!page)
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2018-04-16 11:27:20 +00:00
|
|
|
|
2018-04-16 11:27:19 +00:00
|
|
|
ret = page_address(page);
|
2018-04-16 11:27:20 +00:00
|
|
|
/*
|
|
|
|
* if we support only one fragment just return the
|
|
|
|
* allocated page.
|
|
|
|
*/
|
|
|
|
if (PTE_FRAG_NR == 1)
|
|
|
|
return ret;
|
2018-04-16 11:27:19 +00:00
|
|
|
spin_lock(&mm->page_table_lock);
|
|
|
|
/*
|
|
|
|
* If we find pgtable_page set, we return
|
|
|
|
* the allocated page with single fragement
|
|
|
|
* count.
|
|
|
|
*/
|
|
|
|
if (likely(!mm->context.pte_frag)) {
|
|
|
|
set_page_count(page, PTE_FRAG_NR);
|
|
|
|
mm->context.pte_frag = ret + PTE_FRAG_SIZE;
|
|
|
|
}
|
|
|
|
spin_unlock(&mm->page_table_lock);
|
|
|
|
|
|
|
|
return (pte_t *)ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
pte_t *pte_fragment_alloc(struct mm_struct *mm, unsigned long vmaddr, int kernel)
|
|
|
|
{
|
|
|
|
pte_t *pte;
|
|
|
|
|
|
|
|
pte = get_pte_from_cache(mm);
|
|
|
|
if (pte)
|
|
|
|
return pte;
|
|
|
|
|
|
|
|
return __alloc_for_ptecache(mm, kernel);
|
|
|
|
}
|
|
|
|
|
|
|
|
void pte_fragment_free(unsigned long *table, int kernel)
|
|
|
|
{
|
|
|
|
struct page *page = virt_to_page(table);
|
|
|
|
|
|
|
|
if (put_page_testzero(page)) {
|
|
|
|
if (!kernel)
|
|
|
|
pgtable_page_dtor(page);
|
|
|
|
free_unref_page(page);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef CONFIG_SMP
|
|
|
|
void pgtable_free_tlb(struct mmu_gather *tlb, void *table, int shift)
|
|
|
|
{
|
|
|
|
unsigned long pgf = (unsigned long)table;
|
|
|
|
|
|
|
|
BUG_ON(shift > MAX_PGTABLE_INDEX_SIZE);
|
|
|
|
pgf |= shift;
|
|
|
|
tlb_remove_table(tlb, (void *)pgf);
|
|
|
|
}
|
|
|
|
|
|
|
|
void __tlb_remove_table(void *_table)
|
|
|
|
{
|
|
|
|
void *table = (void *)((unsigned long)_table & ~MAX_PGTABLE_INDEX_SIZE);
|
|
|
|
unsigned int shift = (unsigned long)_table & MAX_PGTABLE_INDEX_SIZE;
|
|
|
|
|
|
|
|
if (!shift)
|
|
|
|
/* PTE page needs special handling */
|
|
|
|
pte_fragment_free(table, 0);
|
|
|
|
else {
|
|
|
|
BUG_ON(shift > MAX_PGTABLE_INDEX_SIZE);
|
|
|
|
kmem_cache_free(PGT_CACHE(shift), table);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
void pgtable_free_tlb(struct mmu_gather *tlb, void *table, int shift)
|
|
|
|
{
|
|
|
|
if (!shift) {
|
|
|
|
/* PTE page needs special handling */
|
|
|
|
pte_fragment_free(table, 0);
|
|
|
|
} else {
|
|
|
|
BUG_ON(shift > MAX_PGTABLE_INDEX_SIZE);
|
|
|
|
kmem_cache_free(PGT_CACHE(shift), table);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|