2005-04-17 02:20:36 +04:00
|
|
|
/*
|
|
|
|
* PowerPC64 port by Mike Corrigan and Dave Engebretsen
|
|
|
|
* {mikejc|engebret}@us.ibm.com
|
|
|
|
*
|
|
|
|
* Copyright (c) 2000 Mike Corrigan <mikejc@us.ibm.com>
|
|
|
|
*
|
|
|
|
* SMP scalability work:
|
|
|
|
* Copyright (C) 2001 Anton Blanchard <anton@au.ibm.com>, IBM
|
|
|
|
*
|
|
|
|
* Module name: htab.c
|
|
|
|
*
|
|
|
|
* Description:
|
|
|
|
* PowerPC Hashed Page Table functions
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#undef DEBUG
|
2005-11-07 03:06:55 +03:00
|
|
|
#undef DEBUG_LOW
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
#include <linux/spinlock.h>
|
|
|
|
#include <linux/errno.h>
|
|
|
|
#include <linux/sched.h>
|
|
|
|
#include <linux/proc_fs.h>
|
|
|
|
#include <linux/stat.h>
|
|
|
|
#include <linux/sysctl.h>
|
|
|
|
#include <linux/ctype.h>
|
|
|
|
#include <linux/cache.h>
|
|
|
|
#include <linux/init.h>
|
|
|
|
#include <linux/signal.h>
|
2008-02-14 03:56:49 +03:00
|
|
|
#include <linux/lmb.h>
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
#include <asm/processor.h>
|
|
|
|
#include <asm/pgtable.h>
|
|
|
|
#include <asm/mmu.h>
|
|
|
|
#include <asm/mmu_context.h>
|
|
|
|
#include <asm/page.h>
|
|
|
|
#include <asm/types.h>
|
|
|
|
#include <asm/system.h>
|
|
|
|
#include <asm/uaccess.h>
|
|
|
|
#include <asm/machdep.h>
|
2008-02-14 03:56:49 +03:00
|
|
|
#include <asm/prom.h>
|
2005-04-17 02:20:36 +04:00
|
|
|
#include <asm/abs_addr.h>
|
|
|
|
#include <asm/tlbflush.h>
|
|
|
|
#include <asm/io.h>
|
|
|
|
#include <asm/eeh.h>
|
|
|
|
#include <asm/tlb.h>
|
|
|
|
#include <asm/cacheflush.h>
|
|
|
|
#include <asm/cputable.h>
|
|
|
|
#include <asm/sections.h>
|
2007-05-08 10:27:27 +04:00
|
|
|
#include <asm/spu.h>
|
2007-10-29 22:24:19 +03:00
|
|
|
#include <asm/udbg.h>
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
#define DBG(fmt...) udbg_printf(fmt)
|
|
|
|
#else
|
|
|
|
#define DBG(fmt...)
|
|
|
|
#endif
|
|
|
|
|
2005-11-07 03:06:55 +03:00
|
|
|
#ifdef DEBUG_LOW
|
|
|
|
#define DBG_LOW(fmt...) udbg_printf(fmt)
|
|
|
|
#else
|
|
|
|
#define DBG_LOW(fmt...)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#define KB (1024)
|
|
|
|
#define MB (1024*KB)
|
2008-07-24 08:27:54 +04:00
|
|
|
#define GB (1024L*MB)
|
2005-11-07 03:06:55 +03:00
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
/*
|
|
|
|
* Note: pte --> Linux PTE
|
|
|
|
* HPTE --> PowerPC Hashed Page Table Entry
|
|
|
|
*
|
|
|
|
* Execution context:
|
|
|
|
* htab_initialize is called with the MMU off (of course), but
|
|
|
|
* the kernel has been copied down to zero so it can directly
|
|
|
|
* reference global data. At this point it is very difficult
|
|
|
|
* to print debug info.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifdef CONFIG_U3_DART
|
|
|
|
extern unsigned long dart_tablebase;
|
|
|
|
#endif /* CONFIG_U3_DART */
|
|
|
|
|
2005-11-10 05:37:51 +03:00
|
|
|
static unsigned long _SDR1;
|
|
|
|
struct mmu_psize_def mmu_psize_defs[MMU_PAGE_COUNT];
|
|
|
|
|
2007-06-13 08:52:56 +04:00
|
|
|
struct hash_pte *htab_address;
|
2006-02-21 09:22:55 +03:00
|
|
|
unsigned long htab_size_bytes;
|
2005-07-13 12:11:42 +04:00
|
|
|
unsigned long htab_hash_mask;
|
2009-10-30 08:47:19 +03:00
|
|
|
EXPORT_SYMBOL_GPL(htab_hash_mask);
|
2005-11-07 03:06:55 +03:00
|
|
|
int mmu_linear_psize = MMU_PAGE_4K;
|
|
|
|
int mmu_virtual_psize = MMU_PAGE_4K;
|
2006-06-15 04:45:18 +04:00
|
|
|
int mmu_vmalloc_psize = MMU_PAGE_4K;
|
[POWERPC] vmemmap fixes to use smaller pages
This changes vmemmap to use a different region (region 0xf) of the
address space, and to configure the page size of that region
dynamically at boot.
The problem with the current approach of always using 16M pages is that
it's not well suited to machines that have small amounts of memory such
as small partitions on pseries, or PS3's.
In fact, on the PS3, failure to allocate the 16M page backing vmmemmap
tends to prevent hotplugging the HV's "additional" memory, thus limiting
the available memory even more, from my experience down to something
like 80M total, which makes it really not very useable.
The logic used by my match to choose the vmemmap page size is:
- If 16M pages are available and there's 1G or more RAM at boot,
use that size.
- Else if 64K pages are available, use that
- Else use 4K pages
I've tested on a POWER6 (16M pages) and on an iSeries POWER3 (4K pages)
and it seems to work fine.
Note that I intend to change the way we organize the kernel regions &
SLBs so the actual region will change from 0xf back to something else at
one point, as I simplify the SLB miss handler, but that will be for a
later patch.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2008-04-30 09:41:48 +04:00
|
|
|
#ifdef CONFIG_SPARSEMEM_VMEMMAP
|
|
|
|
int mmu_vmemmap_psize = MMU_PAGE_4K;
|
|
|
|
#endif
|
2006-06-15 04:45:18 +04:00
|
|
|
int mmu_io_psize = MMU_PAGE_4K;
|
2007-10-11 14:37:10 +04:00
|
|
|
int mmu_kernel_ssize = MMU_SEGSIZE_256M;
|
|
|
|
int mmu_highuser_ssize = MMU_SEGSIZE_256M;
|
2007-12-06 09:24:48 +03:00
|
|
|
u16 mmu_slb_size = 64;
|
2009-10-30 08:47:19 +03:00
|
|
|
EXPORT_SYMBOL_GPL(mmu_slb_size);
|
2005-11-07 03:06:55 +03:00
|
|
|
#ifdef CONFIG_HUGETLB_PAGE
|
|
|
|
unsigned int HPAGE_SHIFT;
|
|
|
|
#endif
|
2006-06-15 04:45:18 +04:00
|
|
|
#ifdef CONFIG_PPC_64K_PAGES
|
|
|
|
int mmu_ci_restrictions;
|
|
|
|
#endif
|
2007-04-12 09:30:23 +04:00
|
|
|
#ifdef CONFIG_DEBUG_PAGEALLOC
|
|
|
|
static u8 *linear_map_hash_slots;
|
|
|
|
static unsigned long linear_map_hash_count;
|
2007-04-18 05:50:09 +04:00
|
|
|
static DEFINE_SPINLOCK(linear_map_hash_lock);
|
2007-04-12 09:30:23 +04:00
|
|
|
#endif /* CONFIG_DEBUG_PAGEALLOC */
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2005-11-07 03:06:55 +03:00
|
|
|
/* There are definitions of page sizes arrays to be used when none
|
|
|
|
* is provided by the firmware.
|
|
|
|
*/
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2005-11-07 03:06:55 +03:00
|
|
|
/* Pre-POWER4 CPUs (4k pages only)
|
|
|
|
*/
|
2008-05-08 08:27:07 +04:00
|
|
|
static struct mmu_psize_def mmu_psize_defaults_old[] = {
|
2005-11-07 03:06:55 +03:00
|
|
|
[MMU_PAGE_4K] = {
|
|
|
|
.shift = 12,
|
|
|
|
.sllp = 0,
|
|
|
|
.penc = 0,
|
|
|
|
.avpnm = 0,
|
|
|
|
.tlbiel = 0,
|
|
|
|
},
|
|
|
|
};
|
|
|
|
|
|
|
|
/* POWER4, GPUL, POWER5
|
|
|
|
*
|
|
|
|
* Support for 16Mb large pages
|
|
|
|
*/
|
2008-05-08 08:27:07 +04:00
|
|
|
static struct mmu_psize_def mmu_psize_defaults_gp[] = {
|
2005-11-07 03:06:55 +03:00
|
|
|
[MMU_PAGE_4K] = {
|
|
|
|
.shift = 12,
|
|
|
|
.sllp = 0,
|
|
|
|
.penc = 0,
|
|
|
|
.avpnm = 0,
|
|
|
|
.tlbiel = 1,
|
|
|
|
},
|
|
|
|
[MMU_PAGE_16M] = {
|
|
|
|
.shift = 24,
|
|
|
|
.sllp = SLB_VSID_L,
|
|
|
|
.penc = 0,
|
|
|
|
.avpnm = 0x1UL,
|
|
|
|
.tlbiel = 0,
|
|
|
|
},
|
|
|
|
};
|
|
|
|
|
2008-08-05 10:19:56 +04:00
|
|
|
static unsigned long htab_convert_pte_flags(unsigned long pteflags)
|
|
|
|
{
|
|
|
|
unsigned long rflags = pteflags & 0x1fa;
|
|
|
|
|
|
|
|
/* _PAGE_EXEC -> NOEXEC */
|
|
|
|
if ((pteflags & _PAGE_EXEC) == 0)
|
|
|
|
rflags |= HPTE_R_N;
|
|
|
|
|
|
|
|
/* PP bits. PAGE_USER is already PP bit 0x2, so we only
|
|
|
|
* need to add in 0x1 if it's a read-only user page
|
|
|
|
*/
|
|
|
|
if ((pteflags & _PAGE_USER) && !((pteflags & _PAGE_RW) &&
|
|
|
|
(pteflags & _PAGE_DIRTY)))
|
|
|
|
rflags |= 1;
|
|
|
|
|
|
|
|
/* Always add C */
|
|
|
|
return rflags | HPTE_R_C;
|
|
|
|
}
|
2005-11-07 03:06:55 +03:00
|
|
|
|
|
|
|
int htab_bolt_mapping(unsigned long vstart, unsigned long vend,
|
2008-08-05 10:19:56 +04:00
|
|
|
unsigned long pstart, unsigned long prot,
|
2007-10-11 14:37:10 +04:00
|
|
|
int psize, int ssize)
|
2005-04-17 02:20:36 +04:00
|
|
|
{
|
2005-11-07 03:06:55 +03:00
|
|
|
unsigned long vaddr, paddr;
|
|
|
|
unsigned int step, shift;
|
|
|
|
int ret = 0;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2005-11-07 03:06:55 +03:00
|
|
|
shift = mmu_psize_defs[psize].shift;
|
|
|
|
step = 1 << shift;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2008-08-05 10:19:56 +04:00
|
|
|
prot = htab_convert_pte_flags(prot);
|
|
|
|
|
|
|
|
DBG("htab_bolt_mapping(%lx..%lx -> %lx (%lx,%d,%d)\n",
|
|
|
|
vstart, vend, pstart, prot, psize, ssize);
|
|
|
|
|
2005-11-07 03:06:55 +03:00
|
|
|
for (vaddr = vstart, paddr = pstart; vaddr < vend;
|
|
|
|
vaddr += step, paddr += step) {
|
2007-04-12 09:30:23 +04:00
|
|
|
unsigned long hash, hpteg;
|
2007-10-11 14:37:10 +04:00
|
|
|
unsigned long vsid = get_kernel_vsid(vaddr, ssize);
|
|
|
|
unsigned long va = hpt_va(vaddr, vsid, ssize);
|
2008-08-30 05:26:27 +04:00
|
|
|
unsigned long tprot = prot;
|
|
|
|
|
|
|
|
/* Make kernel text executable */
|
powerpc: Make the 64-bit kernel as a position-independent executable
This implements CONFIG_RELOCATABLE for 64-bit by making the kernel as
a position-independent executable (PIE) when it is set. This involves
processing the dynamic relocations in the image in the early stages of
booting, even if the kernel is being run at the address it is linked at,
since the linker does not necessarily fill in words in the image for
which there are dynamic relocations. (In fact the linker does fill in
such words for 64-bit executables, though not for 32-bit executables,
so in principle we could avoid calling relocate() entirely when we're
running a 64-bit kernel at the linked address.)
The dynamic relocations are processed by a new function relocate(addr),
where the addr parameter is the virtual address where the image will be
run. In fact we call it twice; once before calling prom_init, and again
when starting the main kernel. This means that reloc_offset() returns
0 in prom_init (since it has been relocated to the address it is running
at), which necessitated a few adjustments.
This also changes __va and __pa to use an equivalent definition that is
simpler. With the relocatable kernel, PAGE_OFFSET and MEMORY_START are
constants (for 64-bit) whereas PHYSICAL_START is a variable (and
KERNELBASE ideally should be too, but isn't yet).
With this, relocatable kernels still copy themselves down to physical
address 0 and run there.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2008-08-30 05:43:47 +04:00
|
|
|
if (overlaps_kernel_text(vaddr, vaddr + step))
|
2008-08-30 05:26:27 +04:00
|
|
|
tprot &= ~HPTE_R_N;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2007-10-11 14:37:10 +04:00
|
|
|
hash = hpt_hash(va, shift, ssize);
|
2005-04-17 02:20:36 +04:00
|
|
|
hpteg = ((hash & htab_hash_mask) * HPTES_PER_GROUP);
|
|
|
|
|
2006-06-23 12:16:39 +04:00
|
|
|
BUG_ON(!ppc_md.hpte_insert);
|
2008-08-30 05:26:27 +04:00
|
|
|
ret = ppc_md.hpte_insert(hpteg, va, paddr, tprot,
|
2008-08-05 10:19:56 +04:00
|
|
|
HPTE_V_BOLTED, psize, ssize);
|
2006-06-23 12:16:39 +04:00
|
|
|
|
2005-11-07 03:06:55 +03:00
|
|
|
if (ret < 0)
|
|
|
|
break;
|
2007-04-12 09:30:23 +04:00
|
|
|
#ifdef CONFIG_DEBUG_PAGEALLOC
|
|
|
|
if ((paddr >> PAGE_SHIFT) < linear_map_hash_count)
|
|
|
|
linear_map_hash_slots[paddr >> PAGE_SHIFT] = ret | 0x80;
|
|
|
|
#endif /* CONFIG_DEBUG_PAGEALLOC */
|
2005-11-07 03:06:55 +03:00
|
|
|
}
|
|
|
|
return ret < 0 ? ret : 0;
|
|
|
|
}
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2008-03-27 08:08:57 +03:00
|
|
|
#ifdef CONFIG_MEMORY_HOTPLUG
|
2008-03-28 03:37:21 +03:00
|
|
|
static int htab_remove_mapping(unsigned long vstart, unsigned long vend,
|
2008-01-29 01:19:24 +03:00
|
|
|
int psize, int ssize)
|
|
|
|
{
|
|
|
|
unsigned long vaddr;
|
|
|
|
unsigned int step, shift;
|
|
|
|
|
|
|
|
shift = mmu_psize_defs[psize].shift;
|
|
|
|
step = 1 << shift;
|
|
|
|
|
|
|
|
if (!ppc_md.hpte_removebolted) {
|
2008-03-28 03:37:21 +03:00
|
|
|
printk(KERN_WARNING "Platform doesn't implement "
|
|
|
|
"hpte_removebolted\n");
|
|
|
|
return -EINVAL;
|
2008-01-29 01:19:24 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
for (vaddr = vstart; vaddr < vend; vaddr += step)
|
|
|
|
ppc_md.hpte_removebolted(vaddr, psize, ssize);
|
2008-03-28 03:37:21 +03:00
|
|
|
|
|
|
|
return 0;
|
2008-01-29 01:19:24 +03:00
|
|
|
}
|
2008-03-27 08:08:57 +03:00
|
|
|
#endif /* CONFIG_MEMORY_HOTPLUG */
|
2008-01-29 01:19:24 +03:00
|
|
|
|
2007-10-11 14:37:10 +04:00
|
|
|
static int __init htab_dt_scan_seg_sizes(unsigned long node,
|
|
|
|
const char *uname, int depth,
|
|
|
|
void *data)
|
|
|
|
{
|
|
|
|
char *type = of_get_flat_dt_prop(node, "device_type", NULL);
|
|
|
|
u32 *prop;
|
|
|
|
unsigned long size = 0;
|
|
|
|
|
|
|
|
/* We are scanning "cpu" nodes only */
|
|
|
|
if (type == NULL || strcmp(type, "cpu") != 0)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
prop = (u32 *)of_get_flat_dt_prop(node, "ibm,processor-segment-sizes",
|
|
|
|
&size);
|
|
|
|
if (prop == NULL)
|
|
|
|
return 0;
|
|
|
|
for (; size >= 4; size -= 4, ++prop) {
|
|
|
|
if (prop[0] == 40) {
|
|
|
|
DBG("1T segment support detected\n");
|
|
|
|
cur_cpu_spec->cpu_features |= CPU_FTR_1T_SEGMENT;
|
2007-10-12 10:44:55 +04:00
|
|
|
return 1;
|
2007-10-11 14:37:10 +04:00
|
|
|
}
|
|
|
|
}
|
2007-10-15 18:58:59 +04:00
|
|
|
cur_cpu_spec->cpu_features &= ~CPU_FTR_NO_SLBIE_B;
|
2007-10-11 14:37:10 +04:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void __init htab_init_seg_sizes(void)
|
|
|
|
{
|
|
|
|
of_scan_flat_dt(htab_dt_scan_seg_sizes, NULL);
|
|
|
|
}
|
|
|
|
|
2005-11-07 03:06:55 +03:00
|
|
|
static int __init htab_dt_scan_page_sizes(unsigned long node,
|
|
|
|
const char *uname, int depth,
|
|
|
|
void *data)
|
|
|
|
{
|
|
|
|
char *type = of_get_flat_dt_prop(node, "device_type", NULL);
|
|
|
|
u32 *prop;
|
|
|
|
unsigned long size = 0;
|
|
|
|
|
|
|
|
/* We are scanning "cpu" nodes only */
|
|
|
|
if (type == NULL || strcmp(type, "cpu") != 0)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
prop = (u32 *)of_get_flat_dt_prop(node,
|
|
|
|
"ibm,segment-page-sizes", &size);
|
|
|
|
if (prop != NULL) {
|
|
|
|
DBG("Page sizes from device-tree:\n");
|
|
|
|
size /= 4;
|
|
|
|
cur_cpu_spec->cpu_features &= ~(CPU_FTR_16M_PAGE);
|
|
|
|
while(size > 0) {
|
|
|
|
unsigned int shift = prop[0];
|
|
|
|
unsigned int slbenc = prop[1];
|
|
|
|
unsigned int lpnum = prop[2];
|
|
|
|
unsigned int lpenc = 0;
|
|
|
|
struct mmu_psize_def *def;
|
|
|
|
int idx = -1;
|
|
|
|
|
|
|
|
size -= 3; prop += 3;
|
|
|
|
while(size > 0 && lpnum) {
|
|
|
|
if (prop[0] == shift)
|
|
|
|
lpenc = prop[1];
|
|
|
|
prop += 2; size -= 2;
|
|
|
|
lpnum--;
|
|
|
|
}
|
|
|
|
switch(shift) {
|
|
|
|
case 0xc:
|
|
|
|
idx = MMU_PAGE_4K;
|
|
|
|
break;
|
|
|
|
case 0x10:
|
|
|
|
idx = MMU_PAGE_64K;
|
|
|
|
break;
|
|
|
|
case 0x14:
|
|
|
|
idx = MMU_PAGE_1M;
|
|
|
|
break;
|
|
|
|
case 0x18:
|
|
|
|
idx = MMU_PAGE_16M;
|
|
|
|
cur_cpu_spec->cpu_features |= CPU_FTR_16M_PAGE;
|
|
|
|
break;
|
|
|
|
case 0x22:
|
|
|
|
idx = MMU_PAGE_16G;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (idx < 0)
|
|
|
|
continue;
|
|
|
|
def = &mmu_psize_defs[idx];
|
|
|
|
def->shift = shift;
|
|
|
|
if (shift <= 23)
|
|
|
|
def->avpnm = 0;
|
|
|
|
else
|
|
|
|
def->avpnm = (1 << (shift - 23)) - 1;
|
|
|
|
def->sllp = slbenc;
|
|
|
|
def->penc = lpenc;
|
|
|
|
/* We don't know for sure what's up with tlbiel, so
|
|
|
|
* for now we only set it for 4K and 64K pages
|
|
|
|
*/
|
|
|
|
if (idx == MMU_PAGE_4K || idx == MMU_PAGE_64K)
|
|
|
|
def->tlbiel = 1;
|
|
|
|
else
|
|
|
|
def->tlbiel = 0;
|
|
|
|
|
2009-12-14 00:15:12 +03:00
|
|
|
DBG(" %d: shift=%02x, sllp=%04lx, avpnm=%08lx, "
|
2005-11-07 03:06:55 +03:00
|
|
|
"tlbiel=%d, penc=%d\n",
|
|
|
|
idx, shift, def->sllp, def->avpnm, def->tlbiel,
|
|
|
|
def->penc);
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
2005-11-07 03:06:55 +03:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-07-31 07:51:42 +04:00
|
|
|
#ifdef CONFIG_HUGETLB_PAGE
|
2008-07-24 08:27:54 +04:00
|
|
|
/* Scan for 16G memory blocks that have been set aside for huge pages
|
|
|
|
* and reserve those blocks for 16G huge pages.
|
|
|
|
*/
|
|
|
|
static int __init htab_dt_scan_hugepage_blocks(unsigned long node,
|
|
|
|
const char *uname, int depth,
|
|
|
|
void *data) {
|
|
|
|
char *type = of_get_flat_dt_prop(node, "device_type", NULL);
|
|
|
|
unsigned long *addr_prop;
|
|
|
|
u32 *page_count_prop;
|
|
|
|
unsigned int expected_pages;
|
|
|
|
long unsigned int phys_addr;
|
|
|
|
long unsigned int block_size;
|
|
|
|
|
|
|
|
/* We are scanning "memory" nodes only */
|
|
|
|
if (type == NULL || strcmp(type, "memory") != 0)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* This property is the log base 2 of the number of virtual pages that
|
|
|
|
* will represent this memory block. */
|
|
|
|
page_count_prop = of_get_flat_dt_prop(node, "ibm,expected#pages", NULL);
|
|
|
|
if (page_count_prop == NULL)
|
|
|
|
return 0;
|
|
|
|
expected_pages = (1 << page_count_prop[0]);
|
|
|
|
addr_prop = of_get_flat_dt_prop(node, "reg", NULL);
|
|
|
|
if (addr_prop == NULL)
|
|
|
|
return 0;
|
|
|
|
phys_addr = addr_prop[0];
|
|
|
|
block_size = addr_prop[1];
|
|
|
|
if (block_size != (16 * GB))
|
|
|
|
return 0;
|
|
|
|
printk(KERN_INFO "Huge page(16GB) memory: "
|
|
|
|
"addr = 0x%lX size = 0x%lX pages = %d\n",
|
|
|
|
phys_addr, block_size, expected_pages);
|
2008-10-21 19:27:36 +04:00
|
|
|
if (phys_addr + (16 * GB) <= lmb_end_of_DRAM()) {
|
|
|
|
lmb_reserve(phys_addr, block_size * expected_pages);
|
|
|
|
add_gpage(phys_addr, block_size, expected_pages);
|
|
|
|
}
|
2008-07-24 08:27:54 +04:00
|
|
|
return 0;
|
|
|
|
}
|
2008-07-31 07:51:42 +04:00
|
|
|
#endif /* CONFIG_HUGETLB_PAGE */
|
2008-07-24 08:27:54 +04:00
|
|
|
|
2005-11-07 03:06:55 +03:00
|
|
|
static void __init htab_init_page_sizes(void)
|
|
|
|
{
|
|
|
|
int rc;
|
|
|
|
|
|
|
|
/* Default to 4K pages only */
|
|
|
|
memcpy(mmu_psize_defs, mmu_psize_defaults_old,
|
|
|
|
sizeof(mmu_psize_defaults_old));
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Try to find the available page sizes in the device-tree
|
|
|
|
*/
|
|
|
|
rc = of_scan_flat_dt(htab_dt_scan_page_sizes, NULL);
|
|
|
|
if (rc != 0) /* Found */
|
|
|
|
goto found;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Not in the device-tree, let's fallback on known size
|
|
|
|
* list for 16M capable GP & GR
|
|
|
|
*/
|
2006-11-30 03:46:22 +03:00
|
|
|
if (cpu_has_feature(CPU_FTR_16M_PAGE))
|
2005-11-07 03:06:55 +03:00
|
|
|
memcpy(mmu_psize_defs, mmu_psize_defaults_gp,
|
|
|
|
sizeof(mmu_psize_defaults_gp));
|
|
|
|
found:
|
2007-04-12 09:30:23 +04:00
|
|
|
#ifndef CONFIG_DEBUG_PAGEALLOC
|
2005-11-07 03:06:55 +03:00
|
|
|
/*
|
|
|
|
* Pick a size for the linear mapping. Currently, we only support
|
|
|
|
* 16M, 1M and 4K which is the default
|
|
|
|
*/
|
|
|
|
if (mmu_psize_defs[MMU_PAGE_16M].shift)
|
|
|
|
mmu_linear_psize = MMU_PAGE_16M;
|
|
|
|
else if (mmu_psize_defs[MMU_PAGE_1M].shift)
|
|
|
|
mmu_linear_psize = MMU_PAGE_1M;
|
2007-04-12 09:30:23 +04:00
|
|
|
#endif /* CONFIG_DEBUG_PAGEALLOC */
|
2005-11-07 03:06:55 +03:00
|
|
|
|
2006-06-15 04:45:18 +04:00
|
|
|
#ifdef CONFIG_PPC_64K_PAGES
|
2005-11-07 03:06:55 +03:00
|
|
|
/*
|
|
|
|
* Pick a size for the ordinary pages. Default is 4K, we support
|
2006-06-15 04:45:18 +04:00
|
|
|
* 64K for user mappings and vmalloc if supported by the processor.
|
|
|
|
* We only use 64k for ioremap if the processor
|
|
|
|
* (and firmware) support cache-inhibited large pages.
|
|
|
|
* If not, we use 4k and set mmu_ci_restrictions so that
|
|
|
|
* hash_page knows to switch processes that use cache-inhibited
|
|
|
|
* mappings to 4k pages.
|
2005-11-07 03:06:55 +03:00
|
|
|
*/
|
2006-06-15 04:45:18 +04:00
|
|
|
if (mmu_psize_defs[MMU_PAGE_64K].shift) {
|
2005-11-07 03:06:55 +03:00
|
|
|
mmu_virtual_psize = MMU_PAGE_64K;
|
2006-06-15 04:45:18 +04:00
|
|
|
mmu_vmalloc_psize = MMU_PAGE_64K;
|
2007-04-12 09:30:23 +04:00
|
|
|
if (mmu_linear_psize == MMU_PAGE_4K)
|
|
|
|
mmu_linear_psize = MMU_PAGE_64K;
|
2008-03-24 09:41:22 +03:00
|
|
|
if (cpu_has_feature(CPU_FTR_CI_LARGE_PAGE)) {
|
|
|
|
/*
|
|
|
|
* Don't use 64k pages for ioremap on pSeries, since
|
|
|
|
* that would stop us accessing the HEA ethernet.
|
|
|
|
*/
|
|
|
|
if (!machine_is(pseries))
|
|
|
|
mmu_io_psize = MMU_PAGE_64K;
|
|
|
|
} else
|
2006-06-15 04:45:18 +04:00
|
|
|
mmu_ci_restrictions = 1;
|
|
|
|
}
|
2007-04-12 09:30:23 +04:00
|
|
|
#endif /* CONFIG_PPC_64K_PAGES */
|
2005-11-07 03:06:55 +03:00
|
|
|
|
[POWERPC] vmemmap fixes to use smaller pages
This changes vmemmap to use a different region (region 0xf) of the
address space, and to configure the page size of that region
dynamically at boot.
The problem with the current approach of always using 16M pages is that
it's not well suited to machines that have small amounts of memory such
as small partitions on pseries, or PS3's.
In fact, on the PS3, failure to allocate the 16M page backing vmmemmap
tends to prevent hotplugging the HV's "additional" memory, thus limiting
the available memory even more, from my experience down to something
like 80M total, which makes it really not very useable.
The logic used by my match to choose the vmemmap page size is:
- If 16M pages are available and there's 1G or more RAM at boot,
use that size.
- Else if 64K pages are available, use that
- Else use 4K pages
I've tested on a POWER6 (16M pages) and on an iSeries POWER3 (4K pages)
and it seems to work fine.
Note that I intend to change the way we organize the kernel regions &
SLBs so the actual region will change from 0xf back to something else at
one point, as I simplify the SLB miss handler, but that will be for a
later patch.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2008-04-30 09:41:48 +04:00
|
|
|
#ifdef CONFIG_SPARSEMEM_VMEMMAP
|
|
|
|
/* We try to use 16M pages for vmemmap if that is supported
|
|
|
|
* and we have at least 1G of RAM at boot
|
|
|
|
*/
|
|
|
|
if (mmu_psize_defs[MMU_PAGE_16M].shift &&
|
|
|
|
lmb_phys_mem_size() >= 0x40000000)
|
|
|
|
mmu_vmemmap_psize = MMU_PAGE_16M;
|
|
|
|
else if (mmu_psize_defs[MMU_PAGE_64K].shift)
|
|
|
|
mmu_vmemmap_psize = MMU_PAGE_64K;
|
|
|
|
else
|
|
|
|
mmu_vmemmap_psize = MMU_PAGE_4K;
|
|
|
|
#endif /* CONFIG_SPARSEMEM_VMEMMAP */
|
|
|
|
|
2006-06-15 04:45:18 +04:00
|
|
|
printk(KERN_DEBUG "Page orders: linear mapping = %d, "
|
[POWERPC] vmemmap fixes to use smaller pages
This changes vmemmap to use a different region (region 0xf) of the
address space, and to configure the page size of that region
dynamically at boot.
The problem with the current approach of always using 16M pages is that
it's not well suited to machines that have small amounts of memory such
as small partitions on pseries, or PS3's.
In fact, on the PS3, failure to allocate the 16M page backing vmmemmap
tends to prevent hotplugging the HV's "additional" memory, thus limiting
the available memory even more, from my experience down to something
like 80M total, which makes it really not very useable.
The logic used by my match to choose the vmemmap page size is:
- If 16M pages are available and there's 1G or more RAM at boot,
use that size.
- Else if 64K pages are available, use that
- Else use 4K pages
I've tested on a POWER6 (16M pages) and on an iSeries POWER3 (4K pages)
and it seems to work fine.
Note that I intend to change the way we organize the kernel regions &
SLBs so the actual region will change from 0xf back to something else at
one point, as I simplify the SLB miss handler, but that will be for a
later patch.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2008-04-30 09:41:48 +04:00
|
|
|
"virtual = %d, io = %d"
|
|
|
|
#ifdef CONFIG_SPARSEMEM_VMEMMAP
|
|
|
|
", vmemmap = %d"
|
|
|
|
#endif
|
|
|
|
"\n",
|
2005-11-07 03:06:55 +03:00
|
|
|
mmu_psize_defs[mmu_linear_psize].shift,
|
2006-06-15 04:45:18 +04:00
|
|
|
mmu_psize_defs[mmu_virtual_psize].shift,
|
[POWERPC] vmemmap fixes to use smaller pages
This changes vmemmap to use a different region (region 0xf) of the
address space, and to configure the page size of that region
dynamically at boot.
The problem with the current approach of always using 16M pages is that
it's not well suited to machines that have small amounts of memory such
as small partitions on pseries, or PS3's.
In fact, on the PS3, failure to allocate the 16M page backing vmmemmap
tends to prevent hotplugging the HV's "additional" memory, thus limiting
the available memory even more, from my experience down to something
like 80M total, which makes it really not very useable.
The logic used by my match to choose the vmemmap page size is:
- If 16M pages are available and there's 1G or more RAM at boot,
use that size.
- Else if 64K pages are available, use that
- Else use 4K pages
I've tested on a POWER6 (16M pages) and on an iSeries POWER3 (4K pages)
and it seems to work fine.
Note that I intend to change the way we organize the kernel regions &
SLBs so the actual region will change from 0xf back to something else at
one point, as I simplify the SLB miss handler, but that will be for a
later patch.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2008-04-30 09:41:48 +04:00
|
|
|
mmu_psize_defs[mmu_io_psize].shift
|
|
|
|
#ifdef CONFIG_SPARSEMEM_VMEMMAP
|
|
|
|
,mmu_psize_defs[mmu_vmemmap_psize].shift
|
|
|
|
#endif
|
|
|
|
);
|
2005-11-07 03:06:55 +03:00
|
|
|
|
|
|
|
#ifdef CONFIG_HUGETLB_PAGE
|
2008-07-24 08:27:54 +04:00
|
|
|
/* Reserve 16G huge page memory sections for huge pages */
|
|
|
|
of_scan_flat_dt(htab_dt_scan_hugepage_blocks, NULL);
|
2005-11-07 03:06:55 +03:00
|
|
|
#endif /* CONFIG_HUGETLB_PAGE */
|
|
|
|
}
|
|
|
|
|
|
|
|
static int __init htab_dt_scan_pftsize(unsigned long node,
|
|
|
|
const char *uname, int depth,
|
|
|
|
void *data)
|
|
|
|
{
|
|
|
|
char *type = of_get_flat_dt_prop(node, "device_type", NULL);
|
|
|
|
u32 *prop;
|
|
|
|
|
|
|
|
/* We are scanning "cpu" nodes only */
|
|
|
|
if (type == NULL || strcmp(type, "cpu") != 0)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
prop = (u32 *)of_get_flat_dt_prop(node, "ibm,pft-size", NULL);
|
|
|
|
if (prop != NULL) {
|
|
|
|
/* pft_size[0] is the NUMA CEC cookie */
|
|
|
|
ppc64_pft_size = prop[1];
|
|
|
|
return 1;
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
2005-11-07 03:06:55 +03:00
|
|
|
return 0;
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
2005-11-07 03:06:55 +03:00
|
|
|
static unsigned long __init htab_get_table_size(void)
|
2005-10-12 10:58:53 +04:00
|
|
|
{
|
2009-02-13 14:57:30 +03:00
|
|
|
unsigned long mem_size, rnd_mem_size, pteg_count, psize;
|
2005-10-12 10:58:53 +04:00
|
|
|
|
2005-11-07 03:06:55 +03:00
|
|
|
/* If hash size isn't already provided by the platform, we try to
|
2006-01-10 02:10:13 +03:00
|
|
|
* retrieve it from the device-tree. If it's not there neither, we
|
2005-11-07 03:06:55 +03:00
|
|
|
* calculate it now based on the total RAM size
|
2005-10-12 10:58:53 +04:00
|
|
|
*/
|
2005-11-07 03:06:55 +03:00
|
|
|
if (ppc64_pft_size == 0)
|
|
|
|
of_scan_flat_dt(htab_dt_scan_pftsize, NULL);
|
2005-10-12 10:58:53 +04:00
|
|
|
if (ppc64_pft_size)
|
|
|
|
return 1UL << ppc64_pft_size;
|
|
|
|
|
|
|
|
/* round mem_size up to next power of 2 */
|
2005-11-10 05:37:51 +03:00
|
|
|
mem_size = lmb_phys_mem_size();
|
|
|
|
rnd_mem_size = 1UL << __ilog2(mem_size);
|
|
|
|
if (rnd_mem_size < mem_size)
|
2005-10-12 10:58:53 +04:00
|
|
|
rnd_mem_size <<= 1;
|
|
|
|
|
|
|
|
/* # pages / 2 */
|
2009-02-13 14:57:30 +03:00
|
|
|
psize = mmu_psize_defs[mmu_virtual_psize].shift;
|
|
|
|
pteg_count = max(rnd_mem_size >> (psize + 1), 1UL << 11);
|
2005-10-12 10:58:53 +04:00
|
|
|
|
|
|
|
return pteg_count << 7;
|
|
|
|
}
|
|
|
|
|
2005-11-08 03:25:48 +03:00
|
|
|
#ifdef CONFIG_MEMORY_HOTPLUG
|
|
|
|
void create_section_mapping(unsigned long start, unsigned long end)
|
|
|
|
{
|
2008-08-05 10:19:56 +04:00
|
|
|
BUG_ON(htab_bolt_mapping(start, end, __pa(start),
|
2008-10-12 21:54:24 +04:00
|
|
|
pgprot_val(PAGE_KERNEL), mmu_linear_psize,
|
2008-08-05 10:19:56 +04:00
|
|
|
mmu_kernel_ssize));
|
2005-11-08 03:25:48 +03:00
|
|
|
}
|
2008-01-29 01:19:24 +03:00
|
|
|
|
2008-03-28 03:37:21 +03:00
|
|
|
int remove_section_mapping(unsigned long start, unsigned long end)
|
2008-01-29 01:19:24 +03:00
|
|
|
{
|
2008-03-28 03:37:21 +03:00
|
|
|
return htab_remove_mapping(start, end, mmu_linear_psize,
|
|
|
|
mmu_kernel_ssize);
|
2008-01-29 01:19:24 +03:00
|
|
|
}
|
2005-11-08 03:25:48 +03:00
|
|
|
#endif /* CONFIG_MEMORY_HOTPLUG */
|
|
|
|
|
2006-06-23 12:16:38 +04:00
|
|
|
static inline void make_bl(unsigned int *insn_addr, void *func)
|
|
|
|
{
|
|
|
|
unsigned long funcp = *((unsigned long *)func);
|
|
|
|
int offset = funcp - (unsigned long)insn_addr;
|
|
|
|
|
|
|
|
*insn_addr = (unsigned int)(0x48000001 | (offset & 0x03fffffc));
|
|
|
|
flush_icache_range((unsigned long)insn_addr, 4+
|
|
|
|
(unsigned long)insn_addr);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void __init htab_finish_init(void)
|
|
|
|
{
|
|
|
|
extern unsigned int *htab_call_hpte_insert1;
|
|
|
|
extern unsigned int *htab_call_hpte_insert2;
|
|
|
|
extern unsigned int *htab_call_hpte_remove;
|
|
|
|
extern unsigned int *htab_call_hpte_updatepp;
|
|
|
|
|
2007-05-08 10:27:28 +04:00
|
|
|
#ifdef CONFIG_PPC_HAS_HASH_64K
|
2006-06-23 12:16:38 +04:00
|
|
|
extern unsigned int *ht64_call_hpte_insert1;
|
|
|
|
extern unsigned int *ht64_call_hpte_insert2;
|
|
|
|
extern unsigned int *ht64_call_hpte_remove;
|
|
|
|
extern unsigned int *ht64_call_hpte_updatepp;
|
|
|
|
|
|
|
|
make_bl(ht64_call_hpte_insert1, ppc_md.hpte_insert);
|
|
|
|
make_bl(ht64_call_hpte_insert2, ppc_md.hpte_insert);
|
|
|
|
make_bl(ht64_call_hpte_remove, ppc_md.hpte_remove);
|
|
|
|
make_bl(ht64_call_hpte_updatepp, ppc_md.hpte_updatepp);
|
2007-05-16 22:43:02 +04:00
|
|
|
#endif /* CONFIG_PPC_HAS_HASH_64K */
|
2006-06-23 12:16:38 +04:00
|
|
|
|
|
|
|
make_bl(htab_call_hpte_insert1, ppc_md.hpte_insert);
|
|
|
|
make_bl(htab_call_hpte_insert2, ppc_md.hpte_insert);
|
|
|
|
make_bl(htab_call_hpte_remove, ppc_md.hpte_remove);
|
|
|
|
make_bl(htab_call_hpte_updatepp, ppc_md.hpte_updatepp);
|
|
|
|
}
|
|
|
|
|
2009-03-19 22:34:16 +03:00
|
|
|
static void __init htab_initialize(void)
|
2005-04-17 02:20:36 +04:00
|
|
|
{
|
2006-02-21 09:22:55 +03:00
|
|
|
unsigned long table;
|
2005-04-17 02:20:36 +04:00
|
|
|
unsigned long pteg_count;
|
2008-08-30 05:26:27 +04:00
|
|
|
unsigned long prot;
|
2008-01-29 17:13:59 +03:00
|
|
|
unsigned long base = 0, size = 0, limit;
|
2005-11-07 03:06:55 +03:00
|
|
|
int i;
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
DBG(" -> htab_initialize()\n");
|
|
|
|
|
2007-10-11 14:37:10 +04:00
|
|
|
/* Initialize segment sizes */
|
|
|
|
htab_init_seg_sizes();
|
|
|
|
|
2005-11-07 03:06:55 +03:00
|
|
|
/* Initialize page sizes */
|
|
|
|
htab_init_page_sizes();
|
|
|
|
|
2007-10-11 14:37:10 +04:00
|
|
|
if (cpu_has_feature(CPU_FTR_1T_SEGMENT)) {
|
|
|
|
mmu_kernel_ssize = MMU_SEGSIZE_1T;
|
|
|
|
mmu_highuser_ssize = MMU_SEGSIZE_1T;
|
|
|
|
printk(KERN_INFO "Using 1TB segments\n");
|
|
|
|
}
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
/*
|
|
|
|
* Calculate the required size of the htab. We want the number of
|
|
|
|
* PTEGs to equal one half the number of real pages.
|
|
|
|
*/
|
2005-11-07 03:06:55 +03:00
|
|
|
htab_size_bytes = htab_get_table_size();
|
2005-04-17 02:20:36 +04:00
|
|
|
pteg_count = htab_size_bytes >> 7;
|
|
|
|
|
|
|
|
htab_hash_mask = pteg_count - 1;
|
|
|
|
|
2006-03-21 12:45:59 +03:00
|
|
|
if (firmware_has_feature(FW_FEATURE_LPAR)) {
|
2005-04-17 02:20:36 +04:00
|
|
|
/* Using a hypervisor which owns the htab */
|
|
|
|
htab_address = NULL;
|
|
|
|
_SDR1 = 0;
|
|
|
|
} else {
|
|
|
|
/* Find storage for the HPT. Must be contiguous in
|
2008-01-29 17:13:59 +03:00
|
|
|
* the absolute address space. On cell we want it to be
|
2008-03-12 10:03:24 +03:00
|
|
|
* in the first 2 Gig so we can use it for IOMMU hacks.
|
2005-04-17 02:20:36 +04:00
|
|
|
*/
|
2008-01-29 17:13:59 +03:00
|
|
|
if (machine_is(cell))
|
2008-03-12 10:03:24 +03:00
|
|
|
limit = 0x80000000;
|
2008-01-29 17:13:59 +03:00
|
|
|
else
|
|
|
|
limit = 0;
|
|
|
|
|
|
|
|
table = lmb_alloc_base(htab_size_bytes, htab_size_bytes, limit);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
DBG("Hash table allocated at %lx, size: %lx\n", table,
|
|
|
|
htab_size_bytes);
|
|
|
|
|
|
|
|
htab_address = abs_to_virt(table);
|
|
|
|
|
|
|
|
/* htab absolute addr + encoded htabsize */
|
|
|
|
_SDR1 = table + __ilog2(pteg_count) - 11;
|
|
|
|
|
|
|
|
/* Initialize the HPT with no entries */
|
|
|
|
memset((void *)table, 0, htab_size_bytes);
|
2005-11-10 05:37:51 +03:00
|
|
|
|
|
|
|
/* Set SDR1 */
|
|
|
|
mtspr(SPRN_SDR1, _SDR1);
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
2008-10-12 21:54:24 +04:00
|
|
|
prot = pgprot_val(PAGE_KERNEL);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2007-04-12 09:30:23 +04:00
|
|
|
#ifdef CONFIG_DEBUG_PAGEALLOC
|
|
|
|
linear_map_hash_count = lmb_end_of_DRAM() >> PAGE_SHIFT;
|
|
|
|
linear_map_hash_slots = __va(lmb_alloc_base(linear_map_hash_count,
|
|
|
|
1, lmb.rmo_size));
|
|
|
|
memset(linear_map_hash_slots, 0, linear_map_hash_count);
|
|
|
|
#endif /* CONFIG_DEBUG_PAGEALLOC */
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
/* On U3 based machines, we need to reserve the DART area and
|
|
|
|
* _NOT_ map it to avoid cache paradoxes as it's remapped non
|
|
|
|
* cacheable later on
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* create bolted the linear mapping in the hash table */
|
|
|
|
for (i=0; i < lmb.memory.cnt; i++) {
|
2005-12-05 19:24:33 +03:00
|
|
|
base = (unsigned long)__va(lmb.memory.region[i].base);
|
2005-04-17 02:20:36 +04:00
|
|
|
size = lmb.memory.region[i].size;
|
|
|
|
|
2009-12-14 00:15:12 +03:00
|
|
|
DBG("creating mapping for region: %lx..%lx (prot: %lx)\n",
|
2008-08-30 05:26:27 +04:00
|
|
|
base, size, prot);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
#ifdef CONFIG_U3_DART
|
|
|
|
/* Do not map the DART space. Fortunately, it will be aligned
|
2005-11-07 03:06:55 +03:00
|
|
|
* in such a way that it will not cross two lmb regions and
|
|
|
|
* will fit within a single 16Mb page.
|
|
|
|
* The DART space is assumed to be a full 16Mb region even if
|
|
|
|
* we only use 2Mb of that space. We will use more of it later
|
|
|
|
* for AGP GART. We have to use a full 16Mb large page.
|
2005-04-17 02:20:36 +04:00
|
|
|
*/
|
|
|
|
DBG("DART base: %lx\n", dart_tablebase);
|
|
|
|
|
|
|
|
if (dart_tablebase != 0 && dart_tablebase >= base
|
|
|
|
&& dart_tablebase < (base + size)) {
|
2006-03-21 12:45:51 +03:00
|
|
|
unsigned long dart_table_end = dart_tablebase + 16 * MB;
|
2005-04-17 02:20:36 +04:00
|
|
|
if (base != dart_tablebase)
|
2005-11-07 03:06:55 +03:00
|
|
|
BUG_ON(htab_bolt_mapping(base, dart_tablebase,
|
2008-08-30 05:26:27 +04:00
|
|
|
__pa(base), prot,
|
2007-10-11 14:37:10 +04:00
|
|
|
mmu_linear_psize,
|
|
|
|
mmu_kernel_ssize));
|
2006-03-21 12:45:51 +03:00
|
|
|
if ((base + size) > dart_table_end)
|
2005-11-07 03:06:55 +03:00
|
|
|
BUG_ON(htab_bolt_mapping(dart_tablebase+16*MB,
|
2006-03-21 12:45:51 +03:00
|
|
|
base + size,
|
|
|
|
__pa(dart_table_end),
|
2008-08-30 05:26:27 +04:00
|
|
|
prot,
|
2007-10-11 14:37:10 +04:00
|
|
|
mmu_linear_psize,
|
|
|
|
mmu_kernel_ssize));
|
2005-04-17 02:20:36 +04:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_U3_DART */
|
2006-03-21 12:45:51 +03:00
|
|
|
BUG_ON(htab_bolt_mapping(base, base + size, __pa(base),
|
2008-08-30 05:26:27 +04:00
|
|
|
prot, mmu_linear_psize, mmu_kernel_ssize));
|
2005-11-07 03:06:55 +03:00
|
|
|
}
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* If we have a memory_limit and we've allocated TCEs then we need to
|
|
|
|
* explicitly map the TCE area at the top of RAM. We also cope with the
|
|
|
|
* case that the TCEs start below memory_limit.
|
|
|
|
* tce_alloc_start/end are 16MB aligned so the mapping should work
|
|
|
|
* for either 4K or 16MB pages.
|
|
|
|
*/
|
|
|
|
if (tce_alloc_start) {
|
2005-12-05 19:24:33 +03:00
|
|
|
tce_alloc_start = (unsigned long)__va(tce_alloc_start);
|
|
|
|
tce_alloc_end = (unsigned long)__va(tce_alloc_end);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
if (base + size >= tce_alloc_start)
|
|
|
|
tce_alloc_start = base + size + 1;
|
|
|
|
|
2006-03-21 12:45:51 +03:00
|
|
|
BUG_ON(htab_bolt_mapping(tce_alloc_start, tce_alloc_end,
|
2008-08-05 10:19:56 +04:00
|
|
|
__pa(tce_alloc_start), prot,
|
2007-10-11 14:37:10 +04:00
|
|
|
mmu_linear_psize, mmu_kernel_ssize));
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
2006-06-23 12:16:38 +04:00
|
|
|
htab_finish_init();
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
DBG(" <- htab_initialize()\n");
|
|
|
|
}
|
|
|
|
#undef KB
|
|
|
|
#undef MB
|
|
|
|
|
2009-03-19 22:34:16 +03:00
|
|
|
void __init early_init_mmu(void)
|
2005-11-10 05:37:51 +03:00
|
|
|
{
|
2009-03-19 22:34:16 +03:00
|
|
|
/* Setup initial STAB address in the PACA */
|
|
|
|
get_paca()->stab_real = __pa((u64)&initial_stab);
|
|
|
|
get_paca()->stab_addr = (u64)&initial_stab;
|
|
|
|
|
|
|
|
/* Initialize the MMU Hash table and create the linear mapping
|
|
|
|
* of memory. Has to be done before stab/slb initialization as
|
|
|
|
* this is currently where the page size encoding is obtained
|
|
|
|
*/
|
|
|
|
htab_initialize();
|
|
|
|
|
|
|
|
/* Initialize stab / SLB management except on iSeries
|
|
|
|
*/
|
|
|
|
if (cpu_has_feature(CPU_FTR_SLB))
|
|
|
|
slb_initialize();
|
|
|
|
else if (!firmware_has_feature(FW_FEATURE_ISERIES))
|
|
|
|
stab_initialize(get_paca()->stab_real);
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef CONFIG_SMP
|
2009-04-16 08:47:32 +04:00
|
|
|
void __cpuinit early_init_mmu_secondary(void)
|
2009-03-19 22:34:16 +03:00
|
|
|
{
|
|
|
|
/* Initialize hash table for that CPU */
|
2006-03-21 12:45:59 +03:00
|
|
|
if (!firmware_has_feature(FW_FEATURE_LPAR))
|
2005-11-10 05:37:51 +03:00
|
|
|
mtspr(SPRN_SDR1, _SDR1);
|
2009-03-19 22:34:16 +03:00
|
|
|
|
|
|
|
/* Initialize STAB/SLB. We use a virtual address as it works
|
|
|
|
* in real mode on pSeries and we want a virutal address on
|
|
|
|
* iSeries anyway
|
|
|
|
*/
|
|
|
|
if (cpu_has_feature(CPU_FTR_SLB))
|
|
|
|
slb_initialize();
|
|
|
|
else
|
|
|
|
stab_initialize(get_paca()->stab_addr);
|
2005-11-10 05:37:51 +03:00
|
|
|
}
|
2009-03-19 22:34:16 +03:00
|
|
|
#endif /* CONFIG_SMP */
|
2005-11-10 05:37:51 +03:00
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
/*
|
|
|
|
* Called by asm hashtable.S for doing lazy icache flush
|
|
|
|
*/
|
|
|
|
unsigned int hash_page_do_lazy_icache(unsigned int pp, pte_t pte, int trap)
|
|
|
|
{
|
|
|
|
struct page *page;
|
|
|
|
|
2005-11-08 03:21:05 +03:00
|
|
|
if (!pfn_valid(pte_pfn(pte)))
|
|
|
|
return pp;
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
page = pte_page(pte);
|
|
|
|
|
|
|
|
/* page is dirty */
|
|
|
|
if (!test_bit(PG_arch_1, &page->flags) && !PageReserved(page)) {
|
|
|
|
if (trap == 0x400) {
|
2009-10-26 22:24:31 +03:00
|
|
|
flush_dcache_icache_page(page);
|
2005-04-17 02:20:36 +04:00
|
|
|
set_bit(PG_arch_1, &page->flags);
|
|
|
|
} else
|
2005-11-07 03:06:55 +03:00
|
|
|
pp |= HPTE_R_N;
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
return pp;
|
|
|
|
}
|
|
|
|
|
2008-06-18 09:29:12 +04:00
|
|
|
#ifdef CONFIG_PPC_MM_SLICES
|
|
|
|
unsigned int get_paca_psize(unsigned long addr)
|
|
|
|
{
|
|
|
|
unsigned long index, slices;
|
|
|
|
|
|
|
|
if (addr < SLICE_LOW_TOP) {
|
|
|
|
slices = get_paca()->context.low_slices_psize;
|
|
|
|
index = GET_LOW_SLICE_INDEX(addr);
|
|
|
|
} else {
|
|
|
|
slices = get_paca()->context.high_slices_psize;
|
|
|
|
index = GET_HIGH_SLICE_INDEX(addr);
|
|
|
|
}
|
|
|
|
return (slices >> (index * 4)) & 0xF;
|
|
|
|
}
|
|
|
|
|
|
|
|
#else
|
|
|
|
unsigned int get_paca_psize(unsigned long addr)
|
|
|
|
{
|
|
|
|
return get_paca()->context.user_psize;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
[POWERPC] Allow drivers to map individual 4k pages to userspace
Some drivers have resources that they want to be able to map into
userspace that are 4k in size. On a kernel configured with 64k pages
we currently end up mapping the 4k we want plus another 60k of
physical address space, which could contain anything. This can
introduce security problems, for example in the case of an infiniband
adaptor where the other 60k could contain registers that some other
program is using for its communications.
This patch adds a new function, remap_4k_pfn, which drivers can use to
map a single 4k page to userspace regardless of whether the kernel is
using a 4k or a 64k page size. Like remap_pfn_range, it would
typically be called in a driver's mmap function. It only maps a
single 4k page, which on a 64k page kernel appears replicated 16 times
throughout a 64k page. On a 4k page kernel it reduces to a call to
remap_pfn_range.
The way this works on a 64k kernel is that a new bit, _PAGE_4K_PFN,
gets set on the linux PTE. This alters the way that __hash_page_4K
computes the real address to put in the HPTE. The RPN field of the
linux PTE becomes the 4k RPN directly rather than being interpreted as
a 64k RPN. Since the RPN field is 32 bits, this means that physical
addresses being mapped with remap_4k_pfn have to be below 2^44,
i.e. 0x100000000000.
The patch also factors out the code in arch/powerpc/mm/hash_utils_64.c
that deals with demoting a process to use 4k pages into one function
that gets called in the various different places where we need to do
that. There were some discrepancies between exactly what was done in
the various places, such as a call to spu_flush_all_slbs in one case
but not in others.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-04-03 15:24:02 +04:00
|
|
|
/*
|
|
|
|
* Demote a segment to using 4k pages.
|
|
|
|
* For now this makes the whole process use 4k pages.
|
|
|
|
*/
|
|
|
|
#ifdef CONFIG_PPC_64K_PAGES
|
[POWERPC] Provide a way to protect 4k subpages when using 64k pages
Using 64k pages on 64-bit PowerPC systems makes life difficult for
emulators that are trying to emulate an ISA, such as x86, which use a
smaller page size, since the emulator can no longer use the MMU and
the normal system calls for controlling page protections. Of course,
the emulator can emulate the MMU by checking and possibly remapping
the address for each memory access in software, but that is pretty
slow.
This provides a facility for such programs to control the access
permissions on individual 4k sub-pages of 64k pages. The idea is
that the emulator supplies an array of protection masks to apply to a
specified range of virtual addresses. These masks are applied at the
level where hardware PTEs are inserted into the hardware page table
based on the Linux PTEs, so the Linux PTEs are not affected. Note
that this new mechanism does not allow any access that would otherwise
be prohibited; it can only prohibit accesses that would otherwise be
allowed. This new facility is only available on 64-bit PowerPC and
only when the kernel is configured for 64k pages.
The masks are supplied using a new subpage_prot system call, which
takes a starting virtual address and length, and a pointer to an array
of protection masks in memory. The array has a 32-bit word per 64k
page to be protected; each 32-bit word consists of 16 2-bit fields,
for which 0 allows any access (that is otherwise allowed), 1 prevents
write accesses, and 2 or 3 prevent any access.
Implicit in this is that the regions of the address space that are
protected are switched to use 4k hardware pages rather than 64k
hardware pages (on machines with hardware 64k page support). In fact
the whole process is switched to use 4k hardware pages when the
subpage_prot system call is used, but this could be improved in future
to switch only the affected segments.
The subpage protection bits are stored in a 3 level tree akin to the
page table tree. The top level of this tree is stored in a structure
that is appended to the top level of the page table tree, i.e., the
pgd array. Since it will often only be 32-bit addresses (below 4GB)
that are protected, the pointers to the first four bottom level pages
are also stored in this structure (each bottom level page contains the
protection bits for 1GB of address space), so the protection bits for
addresses below 4GB can be accessed with one fewer loads than those
for higher addresses.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2008-01-24 00:35:13 +03:00
|
|
|
void demote_segment_4k(struct mm_struct *mm, unsigned long addr)
|
2007-05-08 10:27:27 +04:00
|
|
|
{
|
2008-06-18 09:29:12 +04:00
|
|
|
if (get_slice_psize(mm, addr) == MMU_PAGE_4K)
|
[POWERPC] Allow drivers to map individual 4k pages to userspace
Some drivers have resources that they want to be able to map into
userspace that are 4k in size. On a kernel configured with 64k pages
we currently end up mapping the 4k we want plus another 60k of
physical address space, which could contain anything. This can
introduce security problems, for example in the case of an infiniband
adaptor where the other 60k could contain registers that some other
program is using for its communications.
This patch adds a new function, remap_4k_pfn, which drivers can use to
map a single 4k page to userspace regardless of whether the kernel is
using a 4k or a 64k page size. Like remap_pfn_range, it would
typically be called in a driver's mmap function. It only maps a
single 4k page, which on a 64k page kernel appears replicated 16 times
throughout a 64k page. On a 4k page kernel it reduces to a call to
remap_pfn_range.
The way this works on a 64k kernel is that a new bit, _PAGE_4K_PFN,
gets set on the linux PTE. This alters the way that __hash_page_4K
computes the real address to put in the HPTE. The RPN field of the
linux PTE becomes the 4k RPN directly rather than being interpreted as
a 64k RPN. Since the RPN field is 32 bits, this means that physical
addresses being mapped with remap_4k_pfn have to be below 2^44,
i.e. 0x100000000000.
The patch also factors out the code in arch/powerpc/mm/hash_utils_64.c
that deals with demoting a process to use 4k pages into one function
that gets called in the various different places where we need to do
that. There were some discrepancies between exactly what was done in
the various places, such as a call to spu_flush_all_slbs in one case
but not in others.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-04-03 15:24:02 +04:00
|
|
|
return;
|
2008-06-18 09:29:12 +04:00
|
|
|
slice_set_range_psize(mm, addr, 1, MMU_PAGE_4K);
|
2007-07-16 20:35:38 +04:00
|
|
|
#ifdef CONFIG_SPU_BASE
|
[POWERPC] Allow drivers to map individual 4k pages to userspace
Some drivers have resources that they want to be able to map into
userspace that are 4k in size. On a kernel configured with 64k pages
we currently end up mapping the 4k we want plus another 60k of
physical address space, which could contain anything. This can
introduce security problems, for example in the case of an infiniband
adaptor where the other 60k could contain registers that some other
program is using for its communications.
This patch adds a new function, remap_4k_pfn, which drivers can use to
map a single 4k page to userspace regardless of whether the kernel is
using a 4k or a 64k page size. Like remap_pfn_range, it would
typically be called in a driver's mmap function. It only maps a
single 4k page, which on a 64k page kernel appears replicated 16 times
throughout a 64k page. On a 4k page kernel it reduces to a call to
remap_pfn_range.
The way this works on a 64k kernel is that a new bit, _PAGE_4K_PFN,
gets set on the linux PTE. This alters the way that __hash_page_4K
computes the real address to put in the HPTE. The RPN field of the
linux PTE becomes the 4k RPN directly rather than being interpreted as
a 64k RPN. Since the RPN field is 32 bits, this means that physical
addresses being mapped with remap_4k_pfn have to be below 2^44,
i.e. 0x100000000000.
The patch also factors out the code in arch/powerpc/mm/hash_utils_64.c
that deals with demoting a process to use 4k pages into one function
that gets called in the various different places where we need to do
that. There were some discrepancies between exactly what was done in
the various places, such as a call to spu_flush_all_slbs in one case
but not in others.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-04-03 15:24:02 +04:00
|
|
|
spu_flush_all_slbs(mm);
|
|
|
|
#endif
|
2008-06-18 09:29:12 +04:00
|
|
|
if (get_paca_psize(addr) != MMU_PAGE_4K) {
|
[POWERPC] Provide a way to protect 4k subpages when using 64k pages
Using 64k pages on 64-bit PowerPC systems makes life difficult for
emulators that are trying to emulate an ISA, such as x86, which use a
smaller page size, since the emulator can no longer use the MMU and
the normal system calls for controlling page protections. Of course,
the emulator can emulate the MMU by checking and possibly remapping
the address for each memory access in software, but that is pretty
slow.
This provides a facility for such programs to control the access
permissions on individual 4k sub-pages of 64k pages. The idea is
that the emulator supplies an array of protection masks to apply to a
specified range of virtual addresses. These masks are applied at the
level where hardware PTEs are inserted into the hardware page table
based on the Linux PTEs, so the Linux PTEs are not affected. Note
that this new mechanism does not allow any access that would otherwise
be prohibited; it can only prohibit accesses that would otherwise be
allowed. This new facility is only available on 64-bit PowerPC and
only when the kernel is configured for 64k pages.
The masks are supplied using a new subpage_prot system call, which
takes a starting virtual address and length, and a pointer to an array
of protection masks in memory. The array has a 32-bit word per 64k
page to be protected; each 32-bit word consists of 16 2-bit fields,
for which 0 allows any access (that is otherwise allowed), 1 prevents
write accesses, and 2 or 3 prevent any access.
Implicit in this is that the regions of the address space that are
protected are switched to use 4k hardware pages rather than 64k
hardware pages (on machines with hardware 64k page support). In fact
the whole process is switched to use 4k hardware pages when the
subpage_prot system call is used, but this could be improved in future
to switch only the affected segments.
The subpage protection bits are stored in a 3 level tree akin to the
page table tree. The top level of this tree is stored in a structure
that is appended to the top level of the page table tree, i.e., the
pgd array. Since it will often only be 32-bit addresses (below 4GB)
that are protected, the pointers to the first four bottom level pages
are also stored in this structure (each bottom level page contains the
protection bits for 1GB of address space), so the protection bits for
addresses below 4GB can be accessed with one fewer loads than those
for higher addresses.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2008-01-24 00:35:13 +03:00
|
|
|
get_paca()->context = mm->context;
|
|
|
|
slb_flush_and_rebolt();
|
|
|
|
}
|
[POWERPC] Allow drivers to map individual 4k pages to userspace
Some drivers have resources that they want to be able to map into
userspace that are 4k in size. On a kernel configured with 64k pages
we currently end up mapping the 4k we want plus another 60k of
physical address space, which could contain anything. This can
introduce security problems, for example in the case of an infiniband
adaptor where the other 60k could contain registers that some other
program is using for its communications.
This patch adds a new function, remap_4k_pfn, which drivers can use to
map a single 4k page to userspace regardless of whether the kernel is
using a 4k or a 64k page size. Like remap_pfn_range, it would
typically be called in a driver's mmap function. It only maps a
single 4k page, which on a 64k page kernel appears replicated 16 times
throughout a 64k page. On a 4k page kernel it reduces to a call to
remap_pfn_range.
The way this works on a 64k kernel is that a new bit, _PAGE_4K_PFN,
gets set on the linux PTE. This alters the way that __hash_page_4K
computes the real address to put in the HPTE. The RPN field of the
linux PTE becomes the 4k RPN directly rather than being interpreted as
a 64k RPN. Since the RPN field is 32 bits, this means that physical
addresses being mapped with remap_4k_pfn have to be below 2^44,
i.e. 0x100000000000.
The patch also factors out the code in arch/powerpc/mm/hash_utils_64.c
that deals with demoting a process to use 4k pages into one function
that gets called in the various different places where we need to do
that. There were some discrepancies between exactly what was done in
the various places, such as a call to spu_flush_all_slbs in one case
but not in others.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-04-03 15:24:02 +04:00
|
|
|
}
|
2007-05-08 10:27:27 +04:00
|
|
|
#endif /* CONFIG_PPC_64K_PAGES */
|
[POWERPC] Allow drivers to map individual 4k pages to userspace
Some drivers have resources that they want to be able to map into
userspace that are 4k in size. On a kernel configured with 64k pages
we currently end up mapping the 4k we want plus another 60k of
physical address space, which could contain anything. This can
introduce security problems, for example in the case of an infiniband
adaptor where the other 60k could contain registers that some other
program is using for its communications.
This patch adds a new function, remap_4k_pfn, which drivers can use to
map a single 4k page to userspace regardless of whether the kernel is
using a 4k or a 64k page size. Like remap_pfn_range, it would
typically be called in a driver's mmap function. It only maps a
single 4k page, which on a 64k page kernel appears replicated 16 times
throughout a 64k page. On a 4k page kernel it reduces to a call to
remap_pfn_range.
The way this works on a 64k kernel is that a new bit, _PAGE_4K_PFN,
gets set on the linux PTE. This alters the way that __hash_page_4K
computes the real address to put in the HPTE. The RPN field of the
linux PTE becomes the 4k RPN directly rather than being interpreted as
a 64k RPN. Since the RPN field is 32 bits, this means that physical
addresses being mapped with remap_4k_pfn have to be below 2^44,
i.e. 0x100000000000.
The patch also factors out the code in arch/powerpc/mm/hash_utils_64.c
that deals with demoting a process to use 4k pages into one function
that gets called in the various different places where we need to do
that. There were some discrepancies between exactly what was done in
the various places, such as a call to spu_flush_all_slbs in one case
but not in others.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-04-03 15:24:02 +04:00
|
|
|
|
[POWERPC] Provide a way to protect 4k subpages when using 64k pages
Using 64k pages on 64-bit PowerPC systems makes life difficult for
emulators that are trying to emulate an ISA, such as x86, which use a
smaller page size, since the emulator can no longer use the MMU and
the normal system calls for controlling page protections. Of course,
the emulator can emulate the MMU by checking and possibly remapping
the address for each memory access in software, but that is pretty
slow.
This provides a facility for such programs to control the access
permissions on individual 4k sub-pages of 64k pages. The idea is
that the emulator supplies an array of protection masks to apply to a
specified range of virtual addresses. These masks are applied at the
level where hardware PTEs are inserted into the hardware page table
based on the Linux PTEs, so the Linux PTEs are not affected. Note
that this new mechanism does not allow any access that would otherwise
be prohibited; it can only prohibit accesses that would otherwise be
allowed. This new facility is only available on 64-bit PowerPC and
only when the kernel is configured for 64k pages.
The masks are supplied using a new subpage_prot system call, which
takes a starting virtual address and length, and a pointer to an array
of protection masks in memory. The array has a 32-bit word per 64k
page to be protected; each 32-bit word consists of 16 2-bit fields,
for which 0 allows any access (that is otherwise allowed), 1 prevents
write accesses, and 2 or 3 prevent any access.
Implicit in this is that the regions of the address space that are
protected are switched to use 4k hardware pages rather than 64k
hardware pages (on machines with hardware 64k page support). In fact
the whole process is switched to use 4k hardware pages when the
subpage_prot system call is used, but this could be improved in future
to switch only the affected segments.
The subpage protection bits are stored in a 3 level tree akin to the
page table tree. The top level of this tree is stored in a structure
that is appended to the top level of the page table tree, i.e., the
pgd array. Since it will often only be 32-bit addresses (below 4GB)
that are protected, the pointers to the first four bottom level pages
are also stored in this structure (each bottom level page contains the
protection bits for 1GB of address space), so the protection bits for
addresses below 4GB can be accessed with one fewer loads than those
for higher addresses.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2008-01-24 00:35:13 +03:00
|
|
|
#ifdef CONFIG_PPC_SUBPAGE_PROT
|
|
|
|
/*
|
|
|
|
* This looks up a 2-bit protection code for a 4k subpage of a 64k page.
|
|
|
|
* Userspace sets the subpage permissions using the subpage_prot system call.
|
|
|
|
*
|
|
|
|
* Result is 0: full permissions, _PAGE_RW: read-only,
|
|
|
|
* _PAGE_USER or _PAGE_USER|_PAGE_RW: no access.
|
|
|
|
*/
|
2009-11-26 21:56:04 +03:00
|
|
|
static int subpage_protection(struct mm_struct *mm, unsigned long ea)
|
[POWERPC] Provide a way to protect 4k subpages when using 64k pages
Using 64k pages on 64-bit PowerPC systems makes life difficult for
emulators that are trying to emulate an ISA, such as x86, which use a
smaller page size, since the emulator can no longer use the MMU and
the normal system calls for controlling page protections. Of course,
the emulator can emulate the MMU by checking and possibly remapping
the address for each memory access in software, but that is pretty
slow.
This provides a facility for such programs to control the access
permissions on individual 4k sub-pages of 64k pages. The idea is
that the emulator supplies an array of protection masks to apply to a
specified range of virtual addresses. These masks are applied at the
level where hardware PTEs are inserted into the hardware page table
based on the Linux PTEs, so the Linux PTEs are not affected. Note
that this new mechanism does not allow any access that would otherwise
be prohibited; it can only prohibit accesses that would otherwise be
allowed. This new facility is only available on 64-bit PowerPC and
only when the kernel is configured for 64k pages.
The masks are supplied using a new subpage_prot system call, which
takes a starting virtual address and length, and a pointer to an array
of protection masks in memory. The array has a 32-bit word per 64k
page to be protected; each 32-bit word consists of 16 2-bit fields,
for which 0 allows any access (that is otherwise allowed), 1 prevents
write accesses, and 2 or 3 prevent any access.
Implicit in this is that the regions of the address space that are
protected are switched to use 4k hardware pages rather than 64k
hardware pages (on machines with hardware 64k page support). In fact
the whole process is switched to use 4k hardware pages when the
subpage_prot system call is used, but this could be improved in future
to switch only the affected segments.
The subpage protection bits are stored in a 3 level tree akin to the
page table tree. The top level of this tree is stored in a structure
that is appended to the top level of the page table tree, i.e., the
pgd array. Since it will often only be 32-bit addresses (below 4GB)
that are protected, the pointers to the first four bottom level pages
are also stored in this structure (each bottom level page contains the
protection bits for 1GB of address space), so the protection bits for
addresses below 4GB can be accessed with one fewer loads than those
for higher addresses.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2008-01-24 00:35:13 +03:00
|
|
|
{
|
2009-11-26 21:56:04 +03:00
|
|
|
struct subpage_prot_table *spt = &mm->context.spt;
|
[POWERPC] Provide a way to protect 4k subpages when using 64k pages
Using 64k pages on 64-bit PowerPC systems makes life difficult for
emulators that are trying to emulate an ISA, such as x86, which use a
smaller page size, since the emulator can no longer use the MMU and
the normal system calls for controlling page protections. Of course,
the emulator can emulate the MMU by checking and possibly remapping
the address for each memory access in software, but that is pretty
slow.
This provides a facility for such programs to control the access
permissions on individual 4k sub-pages of 64k pages. The idea is
that the emulator supplies an array of protection masks to apply to a
specified range of virtual addresses. These masks are applied at the
level where hardware PTEs are inserted into the hardware page table
based on the Linux PTEs, so the Linux PTEs are not affected. Note
that this new mechanism does not allow any access that would otherwise
be prohibited; it can only prohibit accesses that would otherwise be
allowed. This new facility is only available on 64-bit PowerPC and
only when the kernel is configured for 64k pages.
The masks are supplied using a new subpage_prot system call, which
takes a starting virtual address and length, and a pointer to an array
of protection masks in memory. The array has a 32-bit word per 64k
page to be protected; each 32-bit word consists of 16 2-bit fields,
for which 0 allows any access (that is otherwise allowed), 1 prevents
write accesses, and 2 or 3 prevent any access.
Implicit in this is that the regions of the address space that are
protected are switched to use 4k hardware pages rather than 64k
hardware pages (on machines with hardware 64k page support). In fact
the whole process is switched to use 4k hardware pages when the
subpage_prot system call is used, but this could be improved in future
to switch only the affected segments.
The subpage protection bits are stored in a 3 level tree akin to the
page table tree. The top level of this tree is stored in a structure
that is appended to the top level of the page table tree, i.e., the
pgd array. Since it will often only be 32-bit addresses (below 4GB)
that are protected, the pointers to the first four bottom level pages
are also stored in this structure (each bottom level page contains the
protection bits for 1GB of address space), so the protection bits for
addresses below 4GB can be accessed with one fewer loads than those
for higher addresses.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2008-01-24 00:35:13 +03:00
|
|
|
u32 spp = 0;
|
|
|
|
u32 **sbpm, *sbpp;
|
|
|
|
|
|
|
|
if (ea >= spt->maxaddr)
|
|
|
|
return 0;
|
|
|
|
if (ea < 0x100000000) {
|
|
|
|
/* addresses below 4GB use spt->low_prot */
|
|
|
|
sbpm = spt->low_prot;
|
|
|
|
} else {
|
|
|
|
sbpm = spt->protptrs[ea >> SBP_L3_SHIFT];
|
|
|
|
if (!sbpm)
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
sbpp = sbpm[(ea >> SBP_L2_SHIFT) & (SBP_L2_COUNT - 1)];
|
|
|
|
if (!sbpp)
|
|
|
|
return 0;
|
|
|
|
spp = sbpp[(ea >> PAGE_SHIFT) & (SBP_L1_COUNT - 1)];
|
|
|
|
|
|
|
|
/* extract 2-bit bitfield for this 4k subpage */
|
|
|
|
spp >>= 30 - 2 * ((ea >> 12) & 0xf);
|
|
|
|
|
|
|
|
/* turn 0,1,2,3 into combination of _PAGE_USER and _PAGE_RW */
|
|
|
|
spp = ((spp & 2) ? _PAGE_USER : 0) | ((spp & 1) ? _PAGE_RW : 0);
|
|
|
|
return spp;
|
|
|
|
}
|
|
|
|
|
|
|
|
#else /* CONFIG_PPC_SUBPAGE_PROT */
|
2009-11-26 21:56:04 +03:00
|
|
|
static inline int subpage_protection(struct mm_struct *mm, unsigned long ea)
|
[POWERPC] Provide a way to protect 4k subpages when using 64k pages
Using 64k pages on 64-bit PowerPC systems makes life difficult for
emulators that are trying to emulate an ISA, such as x86, which use a
smaller page size, since the emulator can no longer use the MMU and
the normal system calls for controlling page protections. Of course,
the emulator can emulate the MMU by checking and possibly remapping
the address for each memory access in software, but that is pretty
slow.
This provides a facility for such programs to control the access
permissions on individual 4k sub-pages of 64k pages. The idea is
that the emulator supplies an array of protection masks to apply to a
specified range of virtual addresses. These masks are applied at the
level where hardware PTEs are inserted into the hardware page table
based on the Linux PTEs, so the Linux PTEs are not affected. Note
that this new mechanism does not allow any access that would otherwise
be prohibited; it can only prohibit accesses that would otherwise be
allowed. This new facility is only available on 64-bit PowerPC and
only when the kernel is configured for 64k pages.
The masks are supplied using a new subpage_prot system call, which
takes a starting virtual address and length, and a pointer to an array
of protection masks in memory. The array has a 32-bit word per 64k
page to be protected; each 32-bit word consists of 16 2-bit fields,
for which 0 allows any access (that is otherwise allowed), 1 prevents
write accesses, and 2 or 3 prevent any access.
Implicit in this is that the regions of the address space that are
protected are switched to use 4k hardware pages rather than 64k
hardware pages (on machines with hardware 64k page support). In fact
the whole process is switched to use 4k hardware pages when the
subpage_prot system call is used, but this could be improved in future
to switch only the affected segments.
The subpage protection bits are stored in a 3 level tree akin to the
page table tree. The top level of this tree is stored in a structure
that is appended to the top level of the page table tree, i.e., the
pgd array. Since it will often only be 32-bit addresses (below 4GB)
that are protected, the pointers to the first four bottom level pages
are also stored in this structure (each bottom level page contains the
protection bits for 1GB of address space), so the protection bits for
addresses below 4GB can be accessed with one fewer loads than those
for higher addresses.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2008-01-24 00:35:13 +03:00
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2005-04-17 02:20:36 +04:00
|
|
|
/* Result code is:
|
|
|
|
* 0 - handled
|
|
|
|
* 1 - normal page fault
|
|
|
|
* -1 - critical hash insertion error
|
[POWERPC] Provide a way to protect 4k subpages when using 64k pages
Using 64k pages on 64-bit PowerPC systems makes life difficult for
emulators that are trying to emulate an ISA, such as x86, which use a
smaller page size, since the emulator can no longer use the MMU and
the normal system calls for controlling page protections. Of course,
the emulator can emulate the MMU by checking and possibly remapping
the address for each memory access in software, but that is pretty
slow.
This provides a facility for such programs to control the access
permissions on individual 4k sub-pages of 64k pages. The idea is
that the emulator supplies an array of protection masks to apply to a
specified range of virtual addresses. These masks are applied at the
level where hardware PTEs are inserted into the hardware page table
based on the Linux PTEs, so the Linux PTEs are not affected. Note
that this new mechanism does not allow any access that would otherwise
be prohibited; it can only prohibit accesses that would otherwise be
allowed. This new facility is only available on 64-bit PowerPC and
only when the kernel is configured for 64k pages.
The masks are supplied using a new subpage_prot system call, which
takes a starting virtual address and length, and a pointer to an array
of protection masks in memory. The array has a 32-bit word per 64k
page to be protected; each 32-bit word consists of 16 2-bit fields,
for which 0 allows any access (that is otherwise allowed), 1 prevents
write accesses, and 2 or 3 prevent any access.
Implicit in this is that the regions of the address space that are
protected are switched to use 4k hardware pages rather than 64k
hardware pages (on machines with hardware 64k page support). In fact
the whole process is switched to use 4k hardware pages when the
subpage_prot system call is used, but this could be improved in future
to switch only the affected segments.
The subpage protection bits are stored in a 3 level tree akin to the
page table tree. The top level of this tree is stored in a structure
that is appended to the top level of the page table tree, i.e., the
pgd array. Since it will often only be 32-bit addresses (below 4GB)
that are protected, the pointers to the first four bottom level pages
are also stored in this structure (each bottom level page contains the
protection bits for 1GB of address space), so the protection bits for
addresses below 4GB can be accessed with one fewer loads than those
for higher addresses.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2008-01-24 00:35:13 +03:00
|
|
|
* -2 - access not permitted by subpage protection mechanism
|
2005-04-17 02:20:36 +04:00
|
|
|
*/
|
|
|
|
int hash_page(unsigned long ea, unsigned long access, unsigned long trap)
|
|
|
|
{
|
|
|
|
void *pgdir;
|
|
|
|
unsigned long vsid;
|
|
|
|
struct mm_struct *mm;
|
|
|
|
pte_t *ptep;
|
powerpc/mm: Allow more flexible layouts for hugepage pagetables
Currently each available hugepage size uses a slightly different
pagetable layout: that is, the bottem level table of pointers to
hugepages is a different size, and may branch off from the normal page
tables at a different level. Every hugepage aware path that needs to
walk the pagetables must therefore look up the hugepage size from the
slice info first, and work out the correct way to walk the pagetables
accordingly. Future hardware is likely to add more possible hugepage
sizes, more layout options and more mess.
This patch, therefore reworks the handling of hugepage pagetables to
reduce this complexity. In the new scheme, instead of having to
consult the slice mask, pagetable walking code can check a flag in the
PGD/PUD/PMD entries to see where to branch off to hugepage pagetables,
and the entry also contains the information (eseentially hugepage
shift) necessary to then interpret that table without recourse to the
slice mask. This scheme can be extended neatly to handle multiple
levels of self-describing "special" hugepage pagetables, although for
now we assume only one level exists.
This approach means that only the pagetable allocation path needs to
know how the pagetables should be set out. All other (hugepage)
pagetable walking paths can just interpret the structure as they go.
There already was a flag bit in PGD/PUD/PMD entries for hugepage
directory pointers, but it was only used for debug. We alter that
flag bit to instead be a 0 in the MSB to indicate a hugepage pagetable
pointer (normally it would be 1 since the pointer lies in the linear
mapping). This means that asm pagetable walking can test for (and
punt on) hugepage pointers with the same test that checks for
unpopulated page directory entries (beq becomes bge), since hugepage
pointers will always be positive, and normal pointers always negative.
While we're at it, we get rid of the confusing (and grep defeating)
#defining of hugepte_shift to be the same thing as mmu_huge_psizes.
Signed-off-by: David Gibson <dwg@au1.ibm.com>
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
2009-10-26 22:24:31 +03:00
|
|
|
unsigned hugeshift;
|
2009-03-15 21:16:43 +03:00
|
|
|
const struct cpumask *tmp;
|
2005-11-07 03:06:55 +03:00
|
|
|
int rc, user_region = 0, local = 0;
|
2007-10-11 14:37:10 +04:00
|
|
|
int psize, ssize;
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2005-11-07 03:06:55 +03:00
|
|
|
DBG_LOW("hash_page(ea=%016lx, access=%lx, trap=%lx\n",
|
|
|
|
ea, access, trap);
|
2005-05-06 03:15:13 +04:00
|
|
|
|
2005-11-07 03:06:55 +03:00
|
|
|
if ((ea & ~REGION_MASK) >= PGTABLE_RANGE) {
|
|
|
|
DBG_LOW(" out of pgtable range !\n");
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Get region & vsid */
|
2005-04-17 02:20:36 +04:00
|
|
|
switch (REGION_ID(ea)) {
|
|
|
|
case USER_REGION_ID:
|
|
|
|
user_region = 1;
|
|
|
|
mm = current->mm;
|
2005-11-07 03:06:55 +03:00
|
|
|
if (! mm) {
|
|
|
|
DBG_LOW(" user region with no mm !\n");
|
2005-04-17 02:20:36 +04:00
|
|
|
return 1;
|
2005-11-07 03:06:55 +03:00
|
|
|
}
|
2007-05-08 10:27:28 +04:00
|
|
|
psize = get_slice_psize(mm, ea);
|
2007-10-11 14:37:10 +04:00
|
|
|
ssize = user_segment_size(ea);
|
|
|
|
vsid = get_vsid(mm->context.id, ea, ssize);
|
2005-04-17 02:20:36 +04:00
|
|
|
break;
|
|
|
|
case VMALLOC_REGION_ID:
|
|
|
|
mm = &init_mm;
|
2007-10-11 14:37:10 +04:00
|
|
|
vsid = get_kernel_vsid(ea, mmu_kernel_ssize);
|
2006-06-15 04:45:18 +04:00
|
|
|
if (ea < VMALLOC_END)
|
|
|
|
psize = mmu_vmalloc_psize;
|
|
|
|
else
|
|
|
|
psize = mmu_io_psize;
|
2007-10-11 14:37:10 +04:00
|
|
|
ssize = mmu_kernel_ssize;
|
2005-04-17 02:20:36 +04:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
/* Not a valid range
|
|
|
|
* Send the problem up to do_page_fault
|
|
|
|
*/
|
|
|
|
return 1;
|
|
|
|
}
|
2005-11-07 03:06:55 +03:00
|
|
|
DBG_LOW(" mm=%p, mm->pgdir=%p, vsid=%016lx\n", mm, mm->pgd, vsid);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2005-11-07 03:06:55 +03:00
|
|
|
/* Get pgdir */
|
2005-04-17 02:20:36 +04:00
|
|
|
pgdir = mm->pgd;
|
|
|
|
if (pgdir == NULL)
|
|
|
|
return 1;
|
|
|
|
|
2005-11-07 03:06:55 +03:00
|
|
|
/* Check CPU locality */
|
2009-03-15 21:16:43 +03:00
|
|
|
tmp = cpumask_of(smp_processor_id());
|
|
|
|
if (user_region && cpumask_equal(mm_cpumask(mm), tmp))
|
2005-04-17 02:20:36 +04:00
|
|
|
local = 1;
|
|
|
|
|
2007-05-08 10:27:28 +04:00
|
|
|
#ifndef CONFIG_PPC_64K_PAGES
|
powerpc/mm: Allow more flexible layouts for hugepage pagetables
Currently each available hugepage size uses a slightly different
pagetable layout: that is, the bottem level table of pointers to
hugepages is a different size, and may branch off from the normal page
tables at a different level. Every hugepage aware path that needs to
walk the pagetables must therefore look up the hugepage size from the
slice info first, and work out the correct way to walk the pagetables
accordingly. Future hardware is likely to add more possible hugepage
sizes, more layout options and more mess.
This patch, therefore reworks the handling of hugepage pagetables to
reduce this complexity. In the new scheme, instead of having to
consult the slice mask, pagetable walking code can check a flag in the
PGD/PUD/PMD entries to see where to branch off to hugepage pagetables,
and the entry also contains the information (eseentially hugepage
shift) necessary to then interpret that table without recourse to the
slice mask. This scheme can be extended neatly to handle multiple
levels of self-describing "special" hugepage pagetables, although for
now we assume only one level exists.
This approach means that only the pagetable allocation path needs to
know how the pagetables should be set out. All other (hugepage)
pagetable walking paths can just interpret the structure as they go.
There already was a flag bit in PGD/PUD/PMD entries for hugepage
directory pointers, but it was only used for debug. We alter that
flag bit to instead be a 0 in the MSB to indicate a hugepage pagetable
pointer (normally it would be 1 since the pointer lies in the linear
mapping). This means that asm pagetable walking can test for (and
punt on) hugepage pointers with the same test that checks for
unpopulated page directory entries (beq becomes bge), since hugepage
pointers will always be positive, and normal pointers always negative.
While we're at it, we get rid of the confusing (and grep defeating)
#defining of hugepte_shift to be the same thing as mmu_huge_psizes.
Signed-off-by: David Gibson <dwg@au1.ibm.com>
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
2009-10-26 22:24:31 +03:00
|
|
|
/* If we use 4K pages and our psize is not 4K, then we might
|
|
|
|
* be hitting a special driver mapping, and need to align the
|
|
|
|
* address before we fetch the PTE.
|
|
|
|
*
|
|
|
|
* It could also be a hugepage mapping, in which case this is
|
|
|
|
* not necessary, but it's not harmful, either.
|
2007-05-08 10:27:28 +04:00
|
|
|
*/
|
|
|
|
if (psize != MMU_PAGE_4K)
|
|
|
|
ea &= ~((1ul << mmu_psize_defs[psize].shift) - 1);
|
|
|
|
#endif /* CONFIG_PPC_64K_PAGES */
|
|
|
|
|
2005-11-07 03:06:55 +03:00
|
|
|
/* Get PTE and page size from page tables */
|
powerpc/mm: Allow more flexible layouts for hugepage pagetables
Currently each available hugepage size uses a slightly different
pagetable layout: that is, the bottem level table of pointers to
hugepages is a different size, and may branch off from the normal page
tables at a different level. Every hugepage aware path that needs to
walk the pagetables must therefore look up the hugepage size from the
slice info first, and work out the correct way to walk the pagetables
accordingly. Future hardware is likely to add more possible hugepage
sizes, more layout options and more mess.
This patch, therefore reworks the handling of hugepage pagetables to
reduce this complexity. In the new scheme, instead of having to
consult the slice mask, pagetable walking code can check a flag in the
PGD/PUD/PMD entries to see where to branch off to hugepage pagetables,
and the entry also contains the information (eseentially hugepage
shift) necessary to then interpret that table without recourse to the
slice mask. This scheme can be extended neatly to handle multiple
levels of self-describing "special" hugepage pagetables, although for
now we assume only one level exists.
This approach means that only the pagetable allocation path needs to
know how the pagetables should be set out. All other (hugepage)
pagetable walking paths can just interpret the structure as they go.
There already was a flag bit in PGD/PUD/PMD entries for hugepage
directory pointers, but it was only used for debug. We alter that
flag bit to instead be a 0 in the MSB to indicate a hugepage pagetable
pointer (normally it would be 1 since the pointer lies in the linear
mapping). This means that asm pagetable walking can test for (and
punt on) hugepage pointers with the same test that checks for
unpopulated page directory entries (beq becomes bge), since hugepage
pointers will always be positive, and normal pointers always negative.
While we're at it, we get rid of the confusing (and grep defeating)
#defining of hugepte_shift to be the same thing as mmu_huge_psizes.
Signed-off-by: David Gibson <dwg@au1.ibm.com>
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
2009-10-26 22:24:31 +03:00
|
|
|
ptep = find_linux_pte_or_hugepte(pgdir, ea, &hugeshift);
|
2005-11-07 03:06:55 +03:00
|
|
|
if (ptep == NULL || !pte_present(*ptep)) {
|
|
|
|
DBG_LOW(" no PTE !\n");
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
powerpc/mm: Allow more flexible layouts for hugepage pagetables
Currently each available hugepage size uses a slightly different
pagetable layout: that is, the bottem level table of pointers to
hugepages is a different size, and may branch off from the normal page
tables at a different level. Every hugepage aware path that needs to
walk the pagetables must therefore look up the hugepage size from the
slice info first, and work out the correct way to walk the pagetables
accordingly. Future hardware is likely to add more possible hugepage
sizes, more layout options and more mess.
This patch, therefore reworks the handling of hugepage pagetables to
reduce this complexity. In the new scheme, instead of having to
consult the slice mask, pagetable walking code can check a flag in the
PGD/PUD/PMD entries to see where to branch off to hugepage pagetables,
and the entry also contains the information (eseentially hugepage
shift) necessary to then interpret that table without recourse to the
slice mask. This scheme can be extended neatly to handle multiple
levels of self-describing "special" hugepage pagetables, although for
now we assume only one level exists.
This approach means that only the pagetable allocation path needs to
know how the pagetables should be set out. All other (hugepage)
pagetable walking paths can just interpret the structure as they go.
There already was a flag bit in PGD/PUD/PMD entries for hugepage
directory pointers, but it was only used for debug. We alter that
flag bit to instead be a 0 in the MSB to indicate a hugepage pagetable
pointer (normally it would be 1 since the pointer lies in the linear
mapping). This means that asm pagetable walking can test for (and
punt on) hugepage pointers with the same test that checks for
unpopulated page directory entries (beq becomes bge), since hugepage
pointers will always be positive, and normal pointers always negative.
While we're at it, we get rid of the confusing (and grep defeating)
#defining of hugepte_shift to be the same thing as mmu_huge_psizes.
Signed-off-by: David Gibson <dwg@au1.ibm.com>
Signed-off-by: Benjamin Herrenschmidt <benh@kernel.crashing.org>
2009-10-26 22:24:31 +03:00
|
|
|
#ifdef CONFIG_HUGETLB_PAGE
|
|
|
|
if (hugeshift)
|
|
|
|
return __hash_page_huge(ea, access, vsid, ptep, trap, local,
|
|
|
|
ssize, hugeshift, psize);
|
|
|
|
#endif /* CONFIG_HUGETLB_PAGE */
|
|
|
|
|
2005-11-07 03:06:55 +03:00
|
|
|
#ifndef CONFIG_PPC_64K_PAGES
|
|
|
|
DBG_LOW(" i-pte: %016lx\n", pte_val(*ptep));
|
|
|
|
#else
|
|
|
|
DBG_LOW(" i-pte: %016lx %016lx\n", pte_val(*ptep),
|
|
|
|
pte_val(*(ptep + PTRS_PER_PTE)));
|
|
|
|
#endif
|
|
|
|
/* Pre-check access permissions (will be re-checked atomically
|
|
|
|
* in __hash_page_XX but this pre-check is a fast path
|
|
|
|
*/
|
|
|
|
if (access & ~pte_val(*ptep)) {
|
|
|
|
DBG_LOW(" no access !\n");
|
|
|
|
return 1;
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
2005-11-07 03:06:55 +03:00
|
|
|
/* Do actual hashing */
|
2007-05-08 10:27:28 +04:00
|
|
|
#ifdef CONFIG_PPC_64K_PAGES
|
[POWERPC] Allow drivers to map individual 4k pages to userspace
Some drivers have resources that they want to be able to map into
userspace that are 4k in size. On a kernel configured with 64k pages
we currently end up mapping the 4k we want plus another 60k of
physical address space, which could contain anything. This can
introduce security problems, for example in the case of an infiniband
adaptor where the other 60k could contain registers that some other
program is using for its communications.
This patch adds a new function, remap_4k_pfn, which drivers can use to
map a single 4k page to userspace regardless of whether the kernel is
using a 4k or a 64k page size. Like remap_pfn_range, it would
typically be called in a driver's mmap function. It only maps a
single 4k page, which on a 64k page kernel appears replicated 16 times
throughout a 64k page. On a 4k page kernel it reduces to a call to
remap_pfn_range.
The way this works on a 64k kernel is that a new bit, _PAGE_4K_PFN,
gets set on the linux PTE. This alters the way that __hash_page_4K
computes the real address to put in the HPTE. The RPN field of the
linux PTE becomes the 4k RPN directly rather than being interpreted as
a 64k RPN. Since the RPN field is 32 bits, this means that physical
addresses being mapped with remap_4k_pfn have to be below 2^44,
i.e. 0x100000000000.
The patch also factors out the code in arch/powerpc/mm/hash_utils_64.c
that deals with demoting a process to use 4k pages into one function
that gets called in the various different places where we need to do
that. There were some discrepancies between exactly what was done in
the various places, such as a call to spu_flush_all_slbs in one case
but not in others.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-04-03 15:24:02 +04:00
|
|
|
/* If _PAGE_4K_PFN is set, make sure this is a 4k segment */
|
2008-06-18 09:29:12 +04:00
|
|
|
if ((pte_val(*ptep) & _PAGE_4K_PFN) && psize == MMU_PAGE_64K) {
|
[POWERPC] Allow drivers to map individual 4k pages to userspace
Some drivers have resources that they want to be able to map into
userspace that are 4k in size. On a kernel configured with 64k pages
we currently end up mapping the 4k we want plus another 60k of
physical address space, which could contain anything. This can
introduce security problems, for example in the case of an infiniband
adaptor where the other 60k could contain registers that some other
program is using for its communications.
This patch adds a new function, remap_4k_pfn, which drivers can use to
map a single 4k page to userspace regardless of whether the kernel is
using a 4k or a 64k page size. Like remap_pfn_range, it would
typically be called in a driver's mmap function. It only maps a
single 4k page, which on a 64k page kernel appears replicated 16 times
throughout a 64k page. On a 4k page kernel it reduces to a call to
remap_pfn_range.
The way this works on a 64k kernel is that a new bit, _PAGE_4K_PFN,
gets set on the linux PTE. This alters the way that __hash_page_4K
computes the real address to put in the HPTE. The RPN field of the
linux PTE becomes the 4k RPN directly rather than being interpreted as
a 64k RPN. Since the RPN field is 32 bits, this means that physical
addresses being mapped with remap_4k_pfn have to be below 2^44,
i.e. 0x100000000000.
The patch also factors out the code in arch/powerpc/mm/hash_utils_64.c
that deals with demoting a process to use 4k pages into one function
that gets called in the various different places where we need to do
that. There were some discrepancies between exactly what was done in
the various places, such as a call to spu_flush_all_slbs in one case
but not in others.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2007-04-03 15:24:02 +04:00
|
|
|
demote_segment_4k(mm, ea);
|
|
|
|
psize = MMU_PAGE_4K;
|
|
|
|
}
|
|
|
|
|
2007-05-08 10:27:27 +04:00
|
|
|
/* If this PTE is non-cacheable and we have restrictions on
|
|
|
|
* using non cacheable large pages, then we switch to 4k
|
|
|
|
*/
|
|
|
|
if (mmu_ci_restrictions && psize == MMU_PAGE_64K &&
|
|
|
|
(pte_val(*ptep) & _PAGE_NO_CACHE)) {
|
|
|
|
if (user_region) {
|
|
|
|
demote_segment_4k(mm, ea);
|
|
|
|
psize = MMU_PAGE_4K;
|
|
|
|
} else if (ea < VMALLOC_END) {
|
|
|
|
/*
|
|
|
|
* some driver did a non-cacheable mapping
|
|
|
|
* in vmalloc space, so switch vmalloc
|
|
|
|
* to 4k pages
|
|
|
|
*/
|
|
|
|
printk(KERN_ALERT "Reducing vmalloc segment "
|
|
|
|
"to 4kB pages because of "
|
|
|
|
"non-cacheable mapping\n");
|
|
|
|
psize = mmu_vmalloc_psize = MMU_PAGE_4K;
|
2007-07-16 20:35:38 +04:00
|
|
|
#ifdef CONFIG_SPU_BASE
|
2007-03-10 02:05:37 +03:00
|
|
|
spu_flush_all_slbs(mm);
|
|
|
|
#endif
|
2006-06-15 04:45:18 +04:00
|
|
|
}
|
2007-05-08 10:27:27 +04:00
|
|
|
}
|
|
|
|
if (user_region) {
|
2008-06-18 09:29:12 +04:00
|
|
|
if (psize != get_paca_psize(ea)) {
|
2007-10-29 04:05:18 +03:00
|
|
|
get_paca()->context = mm->context;
|
2006-06-15 04:45:18 +04:00
|
|
|
slb_flush_and_rebolt();
|
|
|
|
}
|
2007-05-08 10:27:27 +04:00
|
|
|
} else if (get_paca()->vmalloc_sllp !=
|
|
|
|
mmu_psize_defs[mmu_vmalloc_psize].sllp) {
|
|
|
|
get_paca()->vmalloc_sllp =
|
|
|
|
mmu_psize_defs[mmu_vmalloc_psize].sllp;
|
2007-08-03 05:55:39 +04:00
|
|
|
slb_vmalloc_update();
|
2006-06-15 04:45:18 +04:00
|
|
|
}
|
2007-05-08 10:27:28 +04:00
|
|
|
#endif /* CONFIG_PPC_64K_PAGES */
|
2007-05-08 10:27:27 +04:00
|
|
|
|
2007-05-08 10:27:28 +04:00
|
|
|
#ifdef CONFIG_PPC_HAS_HASH_64K
|
2006-06-15 04:45:18 +04:00
|
|
|
if (psize == MMU_PAGE_64K)
|
2007-10-11 14:37:10 +04:00
|
|
|
rc = __hash_page_64K(ea, access, vsid, ptep, trap, local, ssize);
|
2005-11-07 03:06:55 +03:00
|
|
|
else
|
2007-05-08 10:27:28 +04:00
|
|
|
#endif /* CONFIG_PPC_HAS_HASH_64K */
|
[POWERPC] Provide a way to protect 4k subpages when using 64k pages
Using 64k pages on 64-bit PowerPC systems makes life difficult for
emulators that are trying to emulate an ISA, such as x86, which use a
smaller page size, since the emulator can no longer use the MMU and
the normal system calls for controlling page protections. Of course,
the emulator can emulate the MMU by checking and possibly remapping
the address for each memory access in software, but that is pretty
slow.
This provides a facility for such programs to control the access
permissions on individual 4k sub-pages of 64k pages. The idea is
that the emulator supplies an array of protection masks to apply to a
specified range of virtual addresses. These masks are applied at the
level where hardware PTEs are inserted into the hardware page table
based on the Linux PTEs, so the Linux PTEs are not affected. Note
that this new mechanism does not allow any access that would otherwise
be prohibited; it can only prohibit accesses that would otherwise be
allowed. This new facility is only available on 64-bit PowerPC and
only when the kernel is configured for 64k pages.
The masks are supplied using a new subpage_prot system call, which
takes a starting virtual address and length, and a pointer to an array
of protection masks in memory. The array has a 32-bit word per 64k
page to be protected; each 32-bit word consists of 16 2-bit fields,
for which 0 allows any access (that is otherwise allowed), 1 prevents
write accesses, and 2 or 3 prevent any access.
Implicit in this is that the regions of the address space that are
protected are switched to use 4k hardware pages rather than 64k
hardware pages (on machines with hardware 64k page support). In fact
the whole process is switched to use 4k hardware pages when the
subpage_prot system call is used, but this could be improved in future
to switch only the affected segments.
The subpage protection bits are stored in a 3 level tree akin to the
page table tree. The top level of this tree is stored in a structure
that is appended to the top level of the page table tree, i.e., the
pgd array. Since it will often only be 32-bit addresses (below 4GB)
that are protected, the pointers to the first four bottom level pages
are also stored in this structure (each bottom level page contains the
protection bits for 1GB of address space), so the protection bits for
addresses below 4GB can be accessed with one fewer loads than those
for higher addresses.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2008-01-24 00:35:13 +03:00
|
|
|
{
|
|
|
|
int spp = subpage_protection(pgdir, ea);
|
|
|
|
if (access & spp)
|
|
|
|
rc = -2;
|
|
|
|
else
|
|
|
|
rc = __hash_page_4K(ea, access, vsid, ptep, trap,
|
|
|
|
local, ssize, spp);
|
|
|
|
}
|
2005-11-07 03:06:55 +03:00
|
|
|
|
|
|
|
#ifndef CONFIG_PPC_64K_PAGES
|
|
|
|
DBG_LOW(" o-pte: %016lx\n", pte_val(*ptep));
|
|
|
|
#else
|
|
|
|
DBG_LOW(" o-pte: %016lx %016lx\n", pte_val(*ptep),
|
|
|
|
pte_val(*(ptep + PTRS_PER_PTE)));
|
|
|
|
#endif
|
|
|
|
DBG_LOW(" -> rc=%d\n", rc);
|
|
|
|
return rc;
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
2005-11-15 23:53:48 +03:00
|
|
|
EXPORT_SYMBOL_GPL(hash_page);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2005-11-07 03:06:55 +03:00
|
|
|
void hash_preload(struct mm_struct *mm, unsigned long ea,
|
|
|
|
unsigned long access, unsigned long trap)
|
2005-04-17 02:20:36 +04:00
|
|
|
{
|
2005-11-07 03:06:55 +03:00
|
|
|
unsigned long vsid;
|
|
|
|
void *pgdir;
|
|
|
|
pte_t *ptep;
|
|
|
|
unsigned long flags;
|
|
|
|
int local = 0;
|
2007-10-11 14:37:10 +04:00
|
|
|
int ssize;
|
2005-11-07 03:06:55 +03:00
|
|
|
|
2007-05-08 10:27:27 +04:00
|
|
|
BUG_ON(REGION_ID(ea) != USER_REGION_ID);
|
|
|
|
|
|
|
|
#ifdef CONFIG_PPC_MM_SLICES
|
|
|
|
/* We only prefault standard pages for now */
|
2007-08-16 02:03:35 +04:00
|
|
|
if (unlikely(get_slice_psize(mm, ea) != mm->context.user_psize))
|
2005-11-07 03:06:55 +03:00
|
|
|
return;
|
2007-05-08 10:27:27 +04:00
|
|
|
#endif
|
2005-11-07 03:06:55 +03:00
|
|
|
|
|
|
|
DBG_LOW("hash_preload(mm=%p, mm->pgdir=%p, ea=%016lx, access=%lx,"
|
|
|
|
" trap=%lx\n", mm, mm->pgd, ea, access, trap);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
2007-05-08 10:27:27 +04:00
|
|
|
/* Get Linux PTE if available */
|
2005-11-07 03:06:55 +03:00
|
|
|
pgdir = mm->pgd;
|
|
|
|
if (pgdir == NULL)
|
|
|
|
return;
|
|
|
|
ptep = find_linux_pte(pgdir, ea);
|
|
|
|
if (!ptep)
|
|
|
|
return;
|
2007-05-08 10:27:27 +04:00
|
|
|
|
|
|
|
#ifdef CONFIG_PPC_64K_PAGES
|
|
|
|
/* If either _PAGE_4K_PFN or _PAGE_NO_CACHE is set (and we are on
|
|
|
|
* a 64K kernel), then we don't preload, hash_page() will take
|
|
|
|
* care of it once we actually try to access the page.
|
|
|
|
* That way we don't have to duplicate all of the logic for segment
|
|
|
|
* page size demotion here
|
|
|
|
*/
|
|
|
|
if (pte_val(*ptep) & (_PAGE_4K_PFN | _PAGE_NO_CACHE))
|
|
|
|
return;
|
|
|
|
#endif /* CONFIG_PPC_64K_PAGES */
|
|
|
|
|
|
|
|
/* Get VSID */
|
2007-10-11 14:37:10 +04:00
|
|
|
ssize = user_segment_size(ea);
|
|
|
|
vsid = get_vsid(mm->context.id, ea, ssize);
|
2005-11-07 03:06:55 +03:00
|
|
|
|
2007-05-08 10:27:28 +04:00
|
|
|
/* Hash doesn't like irqs */
|
2005-11-07 03:06:55 +03:00
|
|
|
local_irq_save(flags);
|
2007-05-08 10:27:28 +04:00
|
|
|
|
|
|
|
/* Is that local to this CPU ? */
|
2009-03-15 21:16:43 +03:00
|
|
|
if (cpumask_equal(mm_cpumask(mm), cpumask_of(smp_processor_id())))
|
2005-11-07 03:06:55 +03:00
|
|
|
local = 1;
|
2007-05-08 10:27:28 +04:00
|
|
|
|
|
|
|
/* Hash it in */
|
|
|
|
#ifdef CONFIG_PPC_HAS_HASH_64K
|
2006-06-15 04:45:18 +04:00
|
|
|
if (mm->context.user_psize == MMU_PAGE_64K)
|
2007-10-11 14:37:10 +04:00
|
|
|
__hash_page_64K(ea, access, vsid, ptep, trap, local, ssize);
|
2005-04-17 02:20:36 +04:00
|
|
|
else
|
2007-05-16 22:43:02 +04:00
|
|
|
#endif /* CONFIG_PPC_HAS_HASH_64K */
|
[POWERPC] Provide a way to protect 4k subpages when using 64k pages
Using 64k pages on 64-bit PowerPC systems makes life difficult for
emulators that are trying to emulate an ISA, such as x86, which use a
smaller page size, since the emulator can no longer use the MMU and
the normal system calls for controlling page protections. Of course,
the emulator can emulate the MMU by checking and possibly remapping
the address for each memory access in software, but that is pretty
slow.
This provides a facility for such programs to control the access
permissions on individual 4k sub-pages of 64k pages. The idea is
that the emulator supplies an array of protection masks to apply to a
specified range of virtual addresses. These masks are applied at the
level where hardware PTEs are inserted into the hardware page table
based on the Linux PTEs, so the Linux PTEs are not affected. Note
that this new mechanism does not allow any access that would otherwise
be prohibited; it can only prohibit accesses that would otherwise be
allowed. This new facility is only available on 64-bit PowerPC and
only when the kernel is configured for 64k pages.
The masks are supplied using a new subpage_prot system call, which
takes a starting virtual address and length, and a pointer to an array
of protection masks in memory. The array has a 32-bit word per 64k
page to be protected; each 32-bit word consists of 16 2-bit fields,
for which 0 allows any access (that is otherwise allowed), 1 prevents
write accesses, and 2 or 3 prevent any access.
Implicit in this is that the regions of the address space that are
protected are switched to use 4k hardware pages rather than 64k
hardware pages (on machines with hardware 64k page support). In fact
the whole process is switched to use 4k hardware pages when the
subpage_prot system call is used, but this could be improved in future
to switch only the affected segments.
The subpage protection bits are stored in a 3 level tree akin to the
page table tree. The top level of this tree is stored in a structure
that is appended to the top level of the page table tree, i.e., the
pgd array. Since it will often only be 32-bit addresses (below 4GB)
that are protected, the pointers to the first four bottom level pages
are also stored in this structure (each bottom level page contains the
protection bits for 1GB of address space), so the protection bits for
addresses below 4GB can be accessed with one fewer loads than those
for higher addresses.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2008-01-24 00:35:13 +03:00
|
|
|
__hash_page_4K(ea, access, vsid, ptep, trap, local, ssize,
|
|
|
|
subpage_protection(pgdir, ea));
|
2007-05-08 10:27:28 +04:00
|
|
|
|
2005-11-07 03:06:55 +03:00
|
|
|
local_irq_restore(flags);
|
|
|
|
}
|
|
|
|
|
2007-10-29 04:05:18 +03:00
|
|
|
/* WARNING: This is called from hash_low_64.S, if you change this prototype,
|
|
|
|
* do not forget to update the assembly call site !
|
|
|
|
*/
|
2007-10-11 14:37:10 +04:00
|
|
|
void flush_hash_page(unsigned long va, real_pte_t pte, int psize, int ssize,
|
|
|
|
int local)
|
2005-11-07 03:06:55 +03:00
|
|
|
{
|
|
|
|
unsigned long hash, index, shift, hidx, slot;
|
|
|
|
|
2009-12-14 00:15:12 +03:00
|
|
|
DBG_LOW("flush_hash_page(va=%016lx)\n", va);
|
2005-11-07 03:06:55 +03:00
|
|
|
pte_iterate_hashed_subpages(pte, psize, va, index, shift) {
|
2007-10-11 14:37:10 +04:00
|
|
|
hash = hpt_hash(va, shift, ssize);
|
2005-11-07 03:06:55 +03:00
|
|
|
hidx = __rpte_to_hidx(pte, index);
|
|
|
|
if (hidx & _PTEIDX_SECONDARY)
|
|
|
|
hash = ~hash;
|
|
|
|
slot = (hash & htab_hash_mask) * HPTES_PER_GROUP;
|
|
|
|
slot += hidx & _PTEIDX_GROUP_IX;
|
2009-12-14 00:15:12 +03:00
|
|
|
DBG_LOW(" sub %ld: hash=%lx, hidx=%lx\n", index, slot, hidx);
|
2007-10-11 14:37:10 +04:00
|
|
|
ppc_md.hpte_invalidate(slot, va, psize, ssize, local);
|
2005-11-07 03:06:55 +03:00
|
|
|
} pte_iterate_hashed_end();
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
|
2005-09-20 07:52:50 +04:00
|
|
|
void flush_hash_range(unsigned long number, int local)
|
2005-04-17 02:20:36 +04:00
|
|
|
{
|
2005-11-07 03:06:55 +03:00
|
|
|
if (ppc_md.flush_hash_range)
|
2005-09-20 07:52:50 +04:00
|
|
|
ppc_md.flush_hash_range(number, local);
|
2005-11-07 03:06:55 +03:00
|
|
|
else {
|
2005-04-17 02:20:36 +04:00
|
|
|
int i;
|
2005-09-20 07:52:50 +04:00
|
|
|
struct ppc64_tlb_batch *batch =
|
|
|
|
&__get_cpu_var(ppc64_tlb_batch);
|
2005-04-17 02:20:36 +04:00
|
|
|
|
|
|
|
for (i = 0; i < number; i++)
|
2005-11-07 03:06:55 +03:00
|
|
|
flush_hash_page(batch->vaddr[i], batch->pte[i],
|
2007-10-11 14:37:10 +04:00
|
|
|
batch->psize, batch->ssize, local);
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* low_hash_fault is called when we the low level hash code failed
|
|
|
|
* to instert a PTE due to an hypervisor error
|
|
|
|
*/
|
[POWERPC] Provide a way to protect 4k subpages when using 64k pages
Using 64k pages on 64-bit PowerPC systems makes life difficult for
emulators that are trying to emulate an ISA, such as x86, which use a
smaller page size, since the emulator can no longer use the MMU and
the normal system calls for controlling page protections. Of course,
the emulator can emulate the MMU by checking and possibly remapping
the address for each memory access in software, but that is pretty
slow.
This provides a facility for such programs to control the access
permissions on individual 4k sub-pages of 64k pages. The idea is
that the emulator supplies an array of protection masks to apply to a
specified range of virtual addresses. These masks are applied at the
level where hardware PTEs are inserted into the hardware page table
based on the Linux PTEs, so the Linux PTEs are not affected. Note
that this new mechanism does not allow any access that would otherwise
be prohibited; it can only prohibit accesses that would otherwise be
allowed. This new facility is only available on 64-bit PowerPC and
only when the kernel is configured for 64k pages.
The masks are supplied using a new subpage_prot system call, which
takes a starting virtual address and length, and a pointer to an array
of protection masks in memory. The array has a 32-bit word per 64k
page to be protected; each 32-bit word consists of 16 2-bit fields,
for which 0 allows any access (that is otherwise allowed), 1 prevents
write accesses, and 2 or 3 prevent any access.
Implicit in this is that the regions of the address space that are
protected are switched to use 4k hardware pages rather than 64k
hardware pages (on machines with hardware 64k page support). In fact
the whole process is switched to use 4k hardware pages when the
subpage_prot system call is used, but this could be improved in future
to switch only the affected segments.
The subpage protection bits are stored in a 3 level tree akin to the
page table tree. The top level of this tree is stored in a structure
that is appended to the top level of the page table tree, i.e., the
pgd array. Since it will often only be 32-bit addresses (below 4GB)
that are protected, the pointers to the first four bottom level pages
are also stored in this structure (each bottom level page contains the
protection bits for 1GB of address space), so the protection bits for
addresses below 4GB can be accessed with one fewer loads than those
for higher addresses.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2008-01-24 00:35:13 +03:00
|
|
|
void low_hash_fault(struct pt_regs *regs, unsigned long address, int rc)
|
2005-04-17 02:20:36 +04:00
|
|
|
{
|
|
|
|
if (user_mode(regs)) {
|
[POWERPC] Provide a way to protect 4k subpages when using 64k pages
Using 64k pages on 64-bit PowerPC systems makes life difficult for
emulators that are trying to emulate an ISA, such as x86, which use a
smaller page size, since the emulator can no longer use the MMU and
the normal system calls for controlling page protections. Of course,
the emulator can emulate the MMU by checking and possibly remapping
the address for each memory access in software, but that is pretty
slow.
This provides a facility for such programs to control the access
permissions on individual 4k sub-pages of 64k pages. The idea is
that the emulator supplies an array of protection masks to apply to a
specified range of virtual addresses. These masks are applied at the
level where hardware PTEs are inserted into the hardware page table
based on the Linux PTEs, so the Linux PTEs are not affected. Note
that this new mechanism does not allow any access that would otherwise
be prohibited; it can only prohibit accesses that would otherwise be
allowed. This new facility is only available on 64-bit PowerPC and
only when the kernel is configured for 64k pages.
The masks are supplied using a new subpage_prot system call, which
takes a starting virtual address and length, and a pointer to an array
of protection masks in memory. The array has a 32-bit word per 64k
page to be protected; each 32-bit word consists of 16 2-bit fields,
for which 0 allows any access (that is otherwise allowed), 1 prevents
write accesses, and 2 or 3 prevent any access.
Implicit in this is that the regions of the address space that are
protected are switched to use 4k hardware pages rather than 64k
hardware pages (on machines with hardware 64k page support). In fact
the whole process is switched to use 4k hardware pages when the
subpage_prot system call is used, but this could be improved in future
to switch only the affected segments.
The subpage protection bits are stored in a 3 level tree akin to the
page table tree. The top level of this tree is stored in a structure
that is appended to the top level of the page table tree, i.e., the
pgd array. Since it will often only be 32-bit addresses (below 4GB)
that are protected, the pointers to the first four bottom level pages
are also stored in this structure (each bottom level page contains the
protection bits for 1GB of address space), so the protection bits for
addresses below 4GB can be accessed with one fewer loads than those
for higher addresses.
Signed-off-by: Paul Mackerras <paulus@samba.org>
2008-01-24 00:35:13 +03:00
|
|
|
#ifdef CONFIG_PPC_SUBPAGE_PROT
|
|
|
|
if (rc == -2)
|
|
|
|
_exception(SIGSEGV, regs, SEGV_ACCERR, address);
|
|
|
|
else
|
|
|
|
#endif
|
|
|
|
_exception(SIGBUS, regs, BUS_ADRERR, address);
|
|
|
|
} else
|
|
|
|
bad_page_fault(regs, address, SIGBUS);
|
2005-04-17 02:20:36 +04:00
|
|
|
}
|
2007-04-12 09:30:23 +04:00
|
|
|
|
|
|
|
#ifdef CONFIG_DEBUG_PAGEALLOC
|
|
|
|
static void kernel_map_linear_page(unsigned long vaddr, unsigned long lmi)
|
|
|
|
{
|
2007-10-11 14:37:10 +04:00
|
|
|
unsigned long hash, hpteg;
|
|
|
|
unsigned long vsid = get_kernel_vsid(vaddr, mmu_kernel_ssize);
|
|
|
|
unsigned long va = hpt_va(vaddr, vsid, mmu_kernel_ssize);
|
2008-08-05 10:19:56 +04:00
|
|
|
unsigned long mode = htab_convert_pte_flags(PAGE_KERNEL);
|
2007-04-12 09:30:23 +04:00
|
|
|
int ret;
|
|
|
|
|
2007-10-11 14:37:10 +04:00
|
|
|
hash = hpt_hash(va, PAGE_SHIFT, mmu_kernel_ssize);
|
2007-04-12 09:30:23 +04:00
|
|
|
hpteg = ((hash & htab_hash_mask) * HPTES_PER_GROUP);
|
|
|
|
|
|
|
|
ret = ppc_md.hpte_insert(hpteg, va, __pa(vaddr),
|
2007-10-11 14:37:10 +04:00
|
|
|
mode, HPTE_V_BOLTED,
|
|
|
|
mmu_linear_psize, mmu_kernel_ssize);
|
2007-04-12 09:30:23 +04:00
|
|
|
BUG_ON (ret < 0);
|
|
|
|
spin_lock(&linear_map_hash_lock);
|
|
|
|
BUG_ON(linear_map_hash_slots[lmi] & 0x80);
|
|
|
|
linear_map_hash_slots[lmi] = ret | 0x80;
|
|
|
|
spin_unlock(&linear_map_hash_lock);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void kernel_unmap_linear_page(unsigned long vaddr, unsigned long lmi)
|
|
|
|
{
|
2007-10-11 14:37:10 +04:00
|
|
|
unsigned long hash, hidx, slot;
|
|
|
|
unsigned long vsid = get_kernel_vsid(vaddr, mmu_kernel_ssize);
|
|
|
|
unsigned long va = hpt_va(vaddr, vsid, mmu_kernel_ssize);
|
2007-04-12 09:30:23 +04:00
|
|
|
|
2007-10-11 14:37:10 +04:00
|
|
|
hash = hpt_hash(va, PAGE_SHIFT, mmu_kernel_ssize);
|
2007-04-12 09:30:23 +04:00
|
|
|
spin_lock(&linear_map_hash_lock);
|
|
|
|
BUG_ON(!(linear_map_hash_slots[lmi] & 0x80));
|
|
|
|
hidx = linear_map_hash_slots[lmi] & 0x7f;
|
|
|
|
linear_map_hash_slots[lmi] = 0;
|
|
|
|
spin_unlock(&linear_map_hash_lock);
|
|
|
|
if (hidx & _PTEIDX_SECONDARY)
|
|
|
|
hash = ~hash;
|
|
|
|
slot = (hash & htab_hash_mask) * HPTES_PER_GROUP;
|
|
|
|
slot += hidx & _PTEIDX_GROUP_IX;
|
2007-10-11 14:37:10 +04:00
|
|
|
ppc_md.hpte_invalidate(slot, va, mmu_linear_psize, mmu_kernel_ssize, 0);
|
2007-04-12 09:30:23 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
void kernel_map_pages(struct page *page, int numpages, int enable)
|
|
|
|
{
|
|
|
|
unsigned long flags, vaddr, lmi;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
local_irq_save(flags);
|
|
|
|
for (i = 0; i < numpages; i++, page++) {
|
|
|
|
vaddr = (unsigned long)page_address(page);
|
|
|
|
lmi = __pa(vaddr) >> PAGE_SHIFT;
|
|
|
|
if (lmi >= linear_map_hash_count)
|
|
|
|
continue;
|
|
|
|
if (enable)
|
|
|
|
kernel_map_linear_page(vaddr, lmi);
|
|
|
|
else
|
|
|
|
kernel_unmap_linear_page(vaddr, lmi);
|
|
|
|
}
|
|
|
|
local_irq_restore(flags);
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_DEBUG_PAGEALLOC */
|