[linux-2.6-block.git] / arch / powerpc / include / asm / pgtable-ppc64.h

#ifndef _ASM_POWERPC_PGTABLE_PPC64_H_
#define _ASM_POWERPC_PGTABLE_PPC64_H_
/*
 * This file contains the functions and defines necessary to modify and use
 * the ppc64 hashed page table.
 */

#ifdef CONFIG_PPC_64K_PAGES
#include <asm/pgtable-ppc64-64k.h>
#else
#include <asm/pgtable-ppc64-4k.h>
#endif

#define FIRST_USER_ADDRESS	0

/*
 * Size of EA range mapped by our pagetables.
 */
#define PGTABLE_EADDR_SIZE (PTE_INDEX_SIZE + PMD_INDEX_SIZE + \
                	    PUD_INDEX_SIZE + PGD_INDEX_SIZE + PAGE_SHIFT)
#define PGTABLE_RANGE (ASM_CONST(1) << PGTABLE_EADDR_SIZE)


/* Some sanity checking */
#if TASK_SIZE_USER64 > PGTABLE_RANGE
#error TASK_SIZE_USER64 exceeds pagetable range
#endif

#ifdef CONFIG_PPC_STD_MMU_64
#if TASK_SIZE_USER64 > (1UL << (USER_ESID_BITS + SID_SHIFT))
#error TASK_SIZE_USER64 exceeds user VSID range
#endif
#endif

/*
 * Define the address range of the kernel non-linear virtual area
 */

#ifdef CONFIG_PPC_BOOK3E
#define KERN_VIRT_START ASM_CONST(0x8000000000000000)
#else
#define KERN_VIRT_START ASM_CONST(0xD000000000000000)
#endif
#define KERN_VIRT_SIZE	PGTABLE_RANGE

/*
 * The vmalloc space starts at the beginning of that region, and
 * occupies half of it on hash CPUs and a quarter of it on Book3E
 * (we keep a quarter for the virtual memmap)
 */
#define VMALLOC_START	KERN_VIRT_START
#ifdef CONFIG_PPC_BOOK3E
#define VMALLOC_SIZE	(KERN_VIRT_SIZE >> 2)
#else
#define VMALLOC_SIZE	(KERN_VIRT_SIZE >> 1)
#endif
#define VMALLOC_END	(VMALLOC_START + VMALLOC_SIZE)

/*
 * The second half of the kernel virtual space is used for IO mappings,
 * it's itself carved into the PIO region (ISA and PHB IO space) and
 * the ioremap space
 *
 *  ISA_IO_BASE = KERN_IO_START, 64K reserved area
 *  PHB_IO_BASE = ISA_IO_BASE + 64K to ISA_IO_BASE + 2G, PHB IO spaces
 * IOREMAP_BASE = ISA_IO_BASE + 2G to VMALLOC_START + PGTABLE_RANGE
 */
#define KERN_IO_START	(KERN_VIRT_START + (KERN_VIRT_SIZE >> 1))
#define FULL_IO_SIZE	0x80000000ul
#define  ISA_IO_BASE	(KERN_IO_START)
#define  ISA_IO_END	(KERN_IO_START + 0x10000ul)
#define  PHB_IO_BASE	(ISA_IO_END)
#define  PHB_IO_END	(KERN_IO_START + FULL_IO_SIZE)
#define IOREMAP_BASE	(PHB_IO_END)
#define IOREMAP_END	(KERN_VIRT_START + KERN_VIRT_SIZE)


/*
 * Region IDs
 */
#define REGION_SHIFT		60UL
#define REGION_MASK		(0xfUL << REGION_SHIFT)
#define REGION_ID(ea)		(((unsigned long)(ea)) >> REGION_SHIFT)

#define VMALLOC_REGION_ID	(REGION_ID(VMALLOC_START))
#define KERNEL_REGION_ID	(REGION_ID(PAGE_OFFSET))
#define VMEMMAP_REGION_ID	(0xfUL)	/* Server only */
#define USER_REGION_ID		(0UL)

/*
 * Defines the address of the vmemap area, in its own region on
 * hash table CPUs and after the vmalloc space on Book3E
 */
#ifdef CONFIG_PPC_BOOK3E
#define VMEMMAP_BASE		VMALLOC_END
#define VMEMMAP_END		KERN_IO_START
#else
#define VMEMMAP_BASE		(VMEMMAP_REGION_ID << REGION_SHIFT)
#endif
#define vmemmap			((struct page *)VMEMMAP_BASE)


/*
 * Include the PTE bits definitions
 */
#ifdef CONFIG_PPC_BOOK3S
#include <asm/pte-hash64.h>
#else
#include <asm/pte-book3e.h>
#endif
#include <asm/pte-common.h>

#ifdef CONFIG_PPC_MM_SLICES
#define HAVE_ARCH_UNMAPPED_AREA
#define HAVE_ARCH_UNMAPPED_AREA_TOPDOWN
#endif /* CONFIG_PPC_MM_SLICES */

#ifndef __ASSEMBLY__

#include <linux/stddef.h>
#include <asm/tlbflush.h>

/*
 * This is the default implementation of various PTE accessors, it's
 * used in all cases except Book3S with 64K pages where we have a
 * concept of sub-pages
 */
#ifndef __real_pte

#ifdef STRICT_MM_TYPECHECKS
#define __real_pte(e,p)		((real_pte_t){(e)})
#define __rpte_to_pte(r)	((r).pte)
#else
#define __real_pte(e,p)		(e)
#define __rpte_to_pte(r)	(__pte(r))
#endif
#define __rpte_to_hidx(r,index)	(pte_val(__rpte_to_pte(r)) >> 12)

#define pte_iterate_hashed_subpages(rpte, psize, va, index, shift)       \
	do {							         \
		index = 0;					         \
		shift = mmu_psize_defs[psize].shift;		         \

#define pte_iterate_hashed_end() } while(0)

#ifdef CONFIG_PPC_HAS_HASH_64K
#define pte_pagesize_index(mm, addr, pte)	get_slice_psize(mm, addr)
#else
#define pte_pagesize_index(mm, addr, pte)	MMU_PAGE_4K
#endif

#endif /* __real_pte */


/* pte_clear moved to later in this file */

#define PMD_BAD_BITS		(PTE_TABLE_SIZE-1)
#define PUD_BAD_BITS		(PMD_TABLE_SIZE-1)

#define pmd_set(pmdp, pmdval) 	(pmd_val(*(pmdp)) = (pmdval))
#define pmd_none(pmd)		(!pmd_val(pmd))
#define	pmd_bad(pmd)		(!is_kernel_addr(pmd_val(pmd)) \
				 || (pmd_val(pmd) & PMD_BAD_BITS))
#define	pmd_present(pmd)	(pmd_val(pmd) != 0)
#define	pmd_clear(pmdp)		(pmd_val(*(pmdp)) = 0)
#define pmd_page_vaddr(pmd)	(pmd_val(pmd) & ~PMD_MASKED_BITS)
#define pmd_page(pmd)		virt_to_page(pmd_page_vaddr(pmd))

#define pud_set(pudp, pudval)	(pud_val(*(pudp)) = (pudval))
#define pud_none(pud)		(!pud_val(pud))
#define	pud_bad(pud)		(!is_kernel_addr(pud_val(pud)) \
				 || (pud_val(pud) & PUD_BAD_BITS))
#define pud_present(pud)	(pud_val(pud) != 0)
#define pud_clear(pudp)		(pud_val(*(pudp)) = 0)
#define pud_page_vaddr(pud)	(pud_val(pud) & ~PUD_MASKED_BITS)
#define pud_page(pud)		virt_to_page(pud_page_vaddr(pud))

#define pgd_set(pgdp, pudp)	({pgd_val(*(pgdp)) = (unsigned long)(pudp);})

/*
 * Find an entry in a page-table-directory.  We combine the address region
 * (the high order N bits) and the pgd portion of the address.
 */
/* to avoid overflow in free_pgtables we don't use PTRS_PER_PGD here */
#define pgd_index(address) (((address) >> (PGDIR_SHIFT)) & 0x1ff)

#define pgd_offset(mm, address)	 ((mm)->pgd + pgd_index(address))

#define pmd_offset(pudp,addr) \
  (((pmd_t *) pud_page_vaddr(*(pudp))) + (((addr) >> PMD_SHIFT) & (PTRS_PER_PMD - 1)))

#define pte_offset_kernel(dir,addr) \
  (((pte_t *) pmd_page_vaddr(*(dir))) + (((addr) >> PAGE_SHIFT) & (PTRS_PER_PTE - 1)))

#define pte_offset_map(dir,addr)	pte_offset_kernel((dir), (addr))
#define pte_offset_map_nested(dir,addr)	pte_offset_kernel((dir), (addr))
#define pte_unmap(pte)			do { } while(0)
#define pte_unmap_nested(pte)		do { } while(0)

/* to find an entry in a kernel page-table-directory */
/* This now only contains the vmalloc pages */
#define pgd_offset_k(address) pgd_offset(&init_mm, address)


/* Atomic PTE updates */
static inline unsigned long pte_update(struct mm_struct *mm,
				       unsigned long addr,
				       pte_t *ptep, unsigned long clr,
				       int huge)
{
#ifdef PTE_ATOMIC_UPDATES
	unsigned long old, tmp;

	__asm__ __volatile__(
	"1:	ldarx	%0,0,%3		# pte_update\n\
	andi.	%1,%0,%6\n\
	bne-	1b \n\
	andc	%1,%0,%4 \n\
	stdcx.	%1,0,%3 \n\
	bne-	1b"
	: "=&r" (old), "=&r" (tmp), "=m" (*ptep)
	: "r" (ptep), "r" (clr), "m" (*ptep), "i" (_PAGE_BUSY)
	: "cc" );
#else
	unsigned long old = pte_val(*ptep);
	*ptep = __pte(old & ~clr);
#endif
	/* huge pages use the old page table lock */
	if (!huge)
		assert_pte_locked(mm, addr);

#ifdef CONFIG_PPC_STD_MMU_64
	if (old & _PAGE_HASHPTE)
		hpte_need_flush(mm, addr, ptep, old, huge);
#endif

	return old;
}

static inline int __ptep_test_and_clear_young(struct mm_struct *mm,
					      unsigned long addr, pte_t *ptep)
{
	unsigned long old;

       	if ((pte_val(*ptep) & (_PAGE_ACCESSED | _PAGE_HASHPTE)) == 0)
		return 0;
	old = pte_update(mm, addr, ptep, _PAGE_ACCESSED, 0);
	return (old & _PAGE_ACCESSED) != 0;
}
#define __HAVE_ARCH_PTEP_TEST_AND_CLEAR_YOUNG
#define ptep_test_and_clear_young(__vma, __addr, __ptep)		   \
({									   \
	int __r;							   \
	__r = __ptep_test_and_clear_young((__vma)->vm_mm, __addr, __ptep); \
	__r;								   \
})

#define __HAVE_ARCH_PTEP_SET_WRPROTECT
static inline void ptep_set_wrprotect(struct mm_struct *mm, unsigned long addr,
				      pte_t *ptep)
{
	unsigned long old;

       	if ((pte_val(*ptep) & _PAGE_RW) == 0)
       		return;
	old = pte_update(mm, addr, ptep, _PAGE_RW, 0);
}

static inline void huge_ptep_set_wrprotect(struct mm_struct *mm,
					   unsigned long addr, pte_t *ptep)
{
	unsigned long old;

	if ((pte_val(*ptep) & _PAGE_RW) == 0)
		return;
	old = pte_update(mm, addr, ptep, _PAGE_RW, 1);
}

/*
 * We currently remove entries from the hashtable regardless of whether
 * the entry was young or dirty. The generic routines only flush if the
 * entry was young or dirty which is not good enough.
 *
 * We should be more intelligent about this but for the moment we override
 * these functions and force a tlb flush unconditionally
 */
#define __HAVE_ARCH_PTEP_CLEAR_YOUNG_FLUSH
#define ptep_clear_flush_young(__vma, __address, __ptep)		\
({									\
	int __young = __ptep_test_and_clear_young((__vma)->vm_mm, __address, \
						  __ptep);		\
	__young;							\
})

#define __HAVE_ARCH_PTEP_GET_AND_CLEAR
static inline pte_t ptep_get_and_clear(struct mm_struct *mm,
				       unsigned long addr, pte_t *ptep)
{
	unsigned long old = pte_update(mm, addr, ptep, ~0UL, 0);
	return __pte(old);
}

static inline void pte_clear(struct mm_struct *mm, unsigned long addr,
			     pte_t * ptep)
{
	pte_update(mm, addr, ptep, ~0UL, 0);
}


/* Set the dirty and/or accessed bits atomically in a linux PTE, this
 * function doesn't need to flush the hash entry
 */
static inline void __ptep_set_access_flags(pte_t *ptep, pte_t entry)
{
	unsigned long bits = pte_val(entry) &
		(_PAGE_DIRTY | _PAGE_ACCESSED | _PAGE_RW | _PAGE_EXEC);

#ifdef PTE_ATOMIC_UPDATES
	unsigned long old, tmp;

	__asm__ __volatile__(
	"1:	ldarx	%0,0,%4\n\
		andi.	%1,%0,%6\n\
		bne-	1b \n\
		or	%0,%3,%0\n\
		stdcx.	%0,0,%4\n\
		bne-	1b"
	:"=&r" (old), "=&r" (tmp), "=m" (*ptep)
	:"r" (bits), "r" (ptep), "m" (*ptep), "i" (_PAGE_BUSY)
	:"cc");
#else
	unsigned long old = pte_val(*ptep);
	*ptep = __pte(old | bits);
#endif
}

#define __HAVE_ARCH_PTE_SAME
#define pte_same(A,B)	(((pte_val(A) ^ pte_val(B)) & ~_PAGE_HPTEFLAGS) == 0)

#define pte_ERROR(e) \
	printk("%s:%d: bad pte %08lx.\n", __FILE__, __LINE__, pte_val(e))
#define pmd_ERROR(e) \
	printk("%s:%d: bad pmd %08lx.\n", __FILE__, __LINE__, pmd_val(e))
#define pgd_ERROR(e) \
	printk("%s:%d: bad pgd %08lx.\n", __FILE__, __LINE__, pgd_val(e))

/* Encode and de-code a swap entry */
#define __swp_type(entry)	(((entry).val >> 1) & 0x3f)
#define __swp_offset(entry)	((entry).val >> 8)
#define __swp_entry(type, offset) ((swp_entry_t){((type)<< 1)|((offset)<<8)})
#define __pte_to_swp_entry(pte)	((swp_entry_t){pte_val(pte) >> PTE_RPN_SHIFT})
#define __swp_entry_to_pte(x)	((pte_t) { (x).val << PTE_RPN_SHIFT })
#define pte_to_pgoff(pte)	(pte_val(pte) >> PTE_RPN_SHIFT)
#define pgoff_to_pte(off)	((pte_t) {((off) << PTE_RPN_SHIFT)|_PAGE_FILE})
#define PTE_FILE_MAX_BITS	(BITS_PER_LONG - PTE_RPN_SHIFT)

void pgtable_cache_add(unsigned shift, void (*ctor)(void *));
void pgtable_cache_init(void);

/*
 * find_linux_pte returns the address of a linux pte for a given
 * effective address and directory.  If not found, it returns zero.
 */static inline pte_t *find_linux_pte(pgd_t *pgdir, unsigned long ea)
{
	pgd_t *pg;
	pud_t *pu;
	pmd_t *pm;
	pte_t *pt = NULL;

	pg = pgdir + pgd_index(ea);
	if (!pgd_none(*pg)) {
		pu = pud_offset(pg, ea);
		if (!pud_none(*pu)) {
			pm = pmd_offset(pu, ea);
			if (pmd_present(*pm))
				pt = pte_offset_kernel(pm, ea);
		}
	}
	return pt;
}

#ifdef CONFIG_HUGETLB_PAGE
pte_t *find_linux_pte_or_hugepte(pgd_t *pgdir, unsigned long ea,
				 unsigned *shift);
#else
static inline pte_t *find_linux_pte_or_hugepte(pgd_t *pgdir, unsigned long ea,
					       unsigned *shift)
{
	if (shift)
		*shift = 0;
	return find_linux_pte(pgdir, ea);
}
#endif /* !CONFIG_HUGETLB_PAGE */

#endif /* __ASSEMBLY__ */

#endif /* _ASM_POWERPC_PGTABLE_PPC64_H_ */
Commit	Line	Data
f88df14b DG	1	#ifndef _ASM_POWERPC_PGTABLE_PPC64_H_
	2	#define _ASM_POWERPC_PGTABLE_PPC64_H_
	3	/*
	4	* This file contains the functions and defines necessary to modify and use
	5	* the ppc64 hashed page table.
	6	*/
	7
f88df14b	8	#ifdef CONFIG_PPC_64K_PAGES
c605782b	9	#include <asm/pgtable-ppc64-64k.h>
f88df14b	10	#else
c605782b	11	#include <asm/pgtable-ppc64-4k.h>
f88df14b DG	12	#endif
	13
	14	#define FIRST_USER_ADDRESS 0
	15
	16	/*
	17	* Size of EA range mapped by our pagetables.
	18	*/
	19	#define PGTABLE_EADDR_SIZE (PTE_INDEX_SIZE + PMD_INDEX_SIZE + \
	20	PUD_INDEX_SIZE + PGD_INDEX_SIZE + PAGE_SHIFT)
3d5134ee	21	#define PGTABLE_RANGE (ASM_CONST(1) << PGTABLE_EADDR_SIZE)
f88df14b	22
c605782b BH	23
c605782b BH	24	/* Some sanity checking */
f88df14b DG	25	#if TASK_SIZE_USER64 > PGTABLE_RANGE
	26	#error TASK_SIZE_USER64 exceeds pagetable range
	27	#endif
	28
94491685	29	#ifdef CONFIG_PPC_STD_MMU_64
f88df14b DG	30	#if TASK_SIZE_USER64 > (1UL << (USER_ESID_BITS + SID_SHIFT))
	31	#error TASK_SIZE_USER64 exceeds user VSID range
	32	#endif
94491685	33	#endif
f88df14b DG	34
f88df14b DG	35	/*
57e2a99f	36	* Define the address range of the kernel non-linear virtual area
f88df14b	37	*/
57e2a99f BH	38
	39	#ifdef CONFIG_PPC_BOOK3E
	40	#define KERN_VIRT_START ASM_CONST(0x8000000000000000)
	41	#else
	42	#define KERN_VIRT_START ASM_CONST(0xD000000000000000)
	43	#endif
	44	#define KERN_VIRT_SIZE PGTABLE_RANGE
f88df14b DG	45
f88df14b DG	46	/*
57e2a99f BH	47	* The vmalloc space starts at the beginning of that region, and
57e2a99f BH	48	* occupies half of it on hash CPUs and a quarter of it on Book3E
32a74949	49	* (we keep a quarter for the virtual memmap)
57e2a99f BH	50	*/
	51	#define VMALLOC_START KERN_VIRT_START
	52	#ifdef CONFIG_PPC_BOOK3E
	53	#define VMALLOC_SIZE (KERN_VIRT_SIZE >> 2)
	54	#else
	55	#define VMALLOC_SIZE (KERN_VIRT_SIZE >> 1)
	56	#endif
	57	#define VMALLOC_END (VMALLOC_START + VMALLOC_SIZE)
	58
	59	/*
	60	* The second half of the kernel virtual space is used for IO mappings,
	61	* it's itself carved into the PIO region (ISA and PHB IO space) and
	62	* the ioremap space
3d5134ee	63	*
57e2a99f	64	* ISA_IO_BASE = KERN_IO_START, 64K reserved area
3d5134ee BH	65	* PHB_IO_BASE = ISA_IO_BASE + 64K to ISA_IO_BASE + 2G, PHB IO spaces
3d5134ee BH	66	* IOREMAP_BASE = ISA_IO_BASE + 2G to VMALLOC_START + PGTABLE_RANGE
f88df14b	67	*/
57e2a99f	68	#define KERN_IO_START (KERN_VIRT_START + (KERN_VIRT_SIZE >> 1))
3d5134ee	69	#define FULL_IO_SIZE 0x80000000ul
57e2a99f BH	70	#define ISA_IO_BASE (KERN_IO_START)
57e2a99f BH	71	#define ISA_IO_END (KERN_IO_START + 0x10000ul)
3d5134ee	72	#define PHB_IO_BASE (ISA_IO_END)
57e2a99f	73	#define PHB_IO_END (KERN_IO_START + FULL_IO_SIZE)
3d5134ee	74	#define IOREMAP_BASE (PHB_IO_END)
57e2a99f BH	75	#define IOREMAP_END (KERN_VIRT_START + KERN_VIRT_SIZE)
57e2a99f BH	76
f88df14b DG	77
	78	/*
	79	* Region IDs
	80	*/
	81	#define REGION_SHIFT 60UL
	82	#define REGION_MASK (0xfUL << REGION_SHIFT)
	83	#define REGION_ID(ea) (((unsigned long)(ea)) >> REGION_SHIFT)
	84
	85	#define VMALLOC_REGION_ID (REGION_ID(VMALLOC_START))
	86	#define KERNEL_REGION_ID (REGION_ID(PAGE_OFFSET))
32a74949	87	#define VMEMMAP_REGION_ID (0xfUL) /* Server only */
f88df14b DG	88	#define USER_REGION_ID (0UL)
f88df14b DG	89
d29eff7b	90	/*
57e2a99f BH	91	* Defines the address of the vmemap area, in its own region on
57e2a99f BH	92	* hash table CPUs and after the vmalloc space on Book3E
d29eff7b	93	*/
57e2a99f BH	94	#ifdef CONFIG_PPC_BOOK3E
	95	#define VMEMMAP_BASE VMALLOC_END
	96	#define VMEMMAP_END KERN_IO_START
	97	#else
cec08e7a	98	#define VMEMMAP_BASE (VMEMMAP_REGION_ID << REGION_SHIFT)
57e2a99f	99	#endif
cec08e7a BH	100	#define vmemmap ((struct page *)VMEMMAP_BASE)
cec08e7a BH	101
d29eff7b	102
f88df14b	103	/*
c605782b	104	* Include the PTE bits definitions
f88df14b	105	*/
57e2a99f	106	#ifdef CONFIG_PPC_BOOK3S
c605782b	107	#include <asm/pte-hash64.h>
57e2a99f BH	108	#else
	109	#include <asm/pte-book3e.h>
	110	#endif
71087002	111	#include <asm/pte-common.h>
c605782b	112
94ee815c	113	#ifdef CONFIG_PPC_MM_SLICES
f88df14b DG	114	#define HAVE_ARCH_UNMAPPED_AREA
f88df14b DG	115	#define HAVE_ARCH_UNMAPPED_AREA_TOPDOWN
94ee815c	116	#endif /* CONFIG_PPC_MM_SLICES */
f88df14b DG	117
	118	#ifndef __ASSEMBLY__
	119
57e2a99f BH	120	#include <linux/stddef.h>
	121	#include <asm/tlbflush.h>
	122
c605782b BH	123	/*
	124	* This is the default implementation of various PTE accessors, it's
	125	* used in all cases except Book3S with 64K pages where we have a
	126	* concept of sub-pages
	127	*/
	128	#ifndef __real_pte
	129
	130	#ifdef STRICT_MM_TYPECHECKS
	131	#define __real_pte(e,p) ((real_pte_t){(e)})
	132	#define __rpte_to_pte(r) ((r).pte)
	133	#else
	134	#define __real_pte(e,p) (e)
	135	#define __rpte_to_pte(r) (__pte(r))
	136	#endif
	137	#define __rpte_to_hidx(r,index) (pte_val(__rpte_to_pte(r)) >> 12)
	138
	139	#define pte_iterate_hashed_subpages(rpte, psize, va, index, shift) \
	140	do { \
	141	index = 0; \
	142	shift = mmu_psize_defs[psize].shift; \
	143
	144	#define pte_iterate_hashed_end() } while(0)
	145
	146	#ifdef CONFIG_PPC_HAS_HASH_64K
	147	#define pte_pagesize_index(mm, addr, pte) get_slice_psize(mm, addr)
	148	#else
	149	#define pte_pagesize_index(mm, addr, pte) MMU_PAGE_4K
	150	#endif
	151
	152	#endif /* __real_pte */
	153
	154
f88df14b DG	155	/* pte_clear moved to later in this file */
f88df14b DG	156
f88df14b DG	157	#define PMD_BAD_BITS (PTE_TABLE_SIZE-1)
	158	#define PUD_BAD_BITS (PMD_TABLE_SIZE-1)
	159
	160	#define pmd_set(pmdp, pmdval) (pmd_val(*(pmdp)) = (pmdval))
	161	#define pmd_none(pmd) (!pmd_val(pmd))
	162	#define pmd_bad(pmd) (!is_kernel_addr(pmd_val(pmd)) \
	163	\|\| (pmd_val(pmd) & PMD_BAD_BITS))
	164	#define pmd_present(pmd) (pmd_val(pmd) != 0)
	165	#define pmd_clear(pmdp) (pmd_val(*(pmdp)) = 0)
	166	#define pmd_page_vaddr(pmd) (pmd_val(pmd) & ~PMD_MASKED_BITS)
	167	#define pmd_page(pmd) virt_to_page(pmd_page_vaddr(pmd))
	168
	169	#define pud_set(pudp, pudval) (pud_val(*(pudp)) = (pudval))
	170	#define pud_none(pud) (!pud_val(pud))
	171	#define pud_bad(pud) (!is_kernel_addr(pud_val(pud)) \
	172	\|\| (pud_val(pud) & PUD_BAD_BITS))
	173	#define pud_present(pud) (pud_val(pud) != 0)
	174	#define pud_clear(pudp) (pud_val(*(pudp)) = 0)
	175	#define pud_page_vaddr(pud) (pud_val(pud) & ~PUD_MASKED_BITS)
	176	#define pud_page(pud) virt_to_page(pud_page_vaddr(pud))
	177
	178	#define pgd_set(pgdp, pudp) ({pgd_val(*(pgdp)) = (unsigned long)(pudp);})
	179
	180	/*
	181	* Find an entry in a page-table-directory. We combine the address region
	182	* (the high order N bits) and the pgd portion of the address.
	183	*/
	184	/* to avoid overflow in free_pgtables we don't use PTRS_PER_PGD here */
	185	#define pgd_index(address) (((address) >> (PGDIR_SHIFT)) & 0x1ff)
	186
	187	#define pgd_offset(mm, address) ((mm)->pgd + pgd_index(address))
	188
	189	#define pmd_offset(pudp,addr) \
	190	(((pmd_t ) pud_page_vaddr((pudp))) + (((addr) >> PMD_SHIFT) & (PTRS_PER_PMD - 1)))
	191
	192	#define pte_offset_kernel(dir,addr) \
	193	(((pte_t ) pmd_page_vaddr((dir))) + (((addr) >> PAGE_SHIFT) & (PTRS_PER_PTE - 1)))
	194
	195	#define pte_offset_map(dir,addr) pte_offset_kernel((dir), (addr))
	196	#define pte_offset_map_nested(dir,addr) pte_offset_kernel((dir), (addr))
	197	#define pte_unmap(pte) do { } while(0)
	198	#define pte_unmap_nested(pte) do { } while(0)
	199
	200	/* to find an entry in a kernel page-table-directory */
	201	/* This now only contains the vmalloc pages */
	202	#define pgd_offset_k(address) pgd_offset(&init_mm, address)
	203
f88df14b DG	204
	205	/* Atomic PTE updates */
	206	static inline unsigned long pte_update(struct mm_struct *mm,
	207	unsigned long addr,
	208	pte_t *ptep, unsigned long clr,
	209	int huge)
	210	{
a033a487	211	#ifdef PTE_ATOMIC_UPDATES
f88df14b DG	212	unsigned long old, tmp;
	213
	214	__asm__ __volatile__(
	215	"1: ldarx %0,0,%3 # pte_update\n\
	216	andi. %1,%0,%6\n\
	217	bne- 1b \n\
	218	andc %1,%0,%4 \n\
	219	stdcx. %1,0,%3 \n\
	220	bne- 1b"
	221	: "=&r" (old), "=&r" (tmp), "=m" (*ptep)
	222	: "r" (ptep), "r" (clr), "m" (*ptep), "i" (_PAGE_BUSY)
	223	: "cc" );
a033a487 BH	224	#else
	225	unsigned long old = pte_val(*ptep);
	226	*ptep = __pte(old & ~clr);
	227	#endif
8d30c14c BH	228	/* huge pages use the old page table lock */
	229	if (!huge)
	230	assert_pte_locked(mm, addr);
	231
94491685	232	#ifdef CONFIG_PPC_STD_MMU_64
f88df14b DG	233	if (old & _PAGE_HASHPTE)
f88df14b DG	234	hpte_need_flush(mm, addr, ptep, old, huge);
94491685 BH	235	#endif
94491685 BH	236
f88df14b DG	237	return old;
	238	}
	239
	240	static inline int __ptep_test_and_clear_young(struct mm_struct *mm,
	241	unsigned long addr, pte_t *ptep)
	242	{
	243	unsigned long old;
	244
	245	if ((pte_val(*ptep) & (_PAGE_ACCESSED \| _PAGE_HASHPTE)) == 0)
	246	return 0;
	247	old = pte_update(mm, addr, ptep, _PAGE_ACCESSED, 0);
	248	return (old & _PAGE_ACCESSED) != 0;
	249	}
	250	#define __HAVE_ARCH_PTEP_TEST_AND_CLEAR_YOUNG
	251	#define ptep_test_and_clear_young(__vma, __addr, __ptep) \
	252	({ \
	253	int __r; \
	254	__r = __ptep_test_and_clear_young((__vma)->vm_mm, __addr, __ptep); \
	255	__r; \
	256	})
	257
f88df14b DG	258	#define __HAVE_ARCH_PTEP_SET_WRPROTECT
	259	static inline void ptep_set_wrprotect(struct mm_struct *mm, unsigned long addr,
	260	pte_t *ptep)
	261	{
	262	unsigned long old;
	263
	264	if ((pte_val(*ptep) & _PAGE_RW) == 0)
	265	return;
	266	old = pte_update(mm, addr, ptep, _PAGE_RW, 0);
	267	}
	268
016b33c4 AW	269	static inline void huge_ptep_set_wrprotect(struct mm_struct *mm,
	270	unsigned long addr, pte_t *ptep)
	271	{
	272	unsigned long old;
	273
86df8642 DG	274	if ((pte_val(*ptep) & _PAGE_RW) == 0)
86df8642 DG	275	return;
016b33c4 AW	276	old = pte_update(mm, addr, ptep, _PAGE_RW, 1);
016b33c4 AW	277	}
f88df14b DG	278
	279	/*
	280	* We currently remove entries from the hashtable regardless of whether
	281	* the entry was young or dirty. The generic routines only flush if the
	282	* entry was young or dirty which is not good enough.
	283	*
	284	* We should be more intelligent about this but for the moment we override
	285	* these functions and force a tlb flush unconditionally
	286	*/
	287	#define __HAVE_ARCH_PTEP_CLEAR_YOUNG_FLUSH
	288	#define ptep_clear_flush_young(__vma, __address, __ptep) \
	289	({ \
	290	int __young = __ptep_test_and_clear_young((__vma)->vm_mm, __address, \
	291	__ptep); \
	292	__young; \
	293	})
	294
f88df14b DG	295	#define __HAVE_ARCH_PTEP_GET_AND_CLEAR
	296	static inline pte_t ptep_get_and_clear(struct mm_struct *mm,
	297	unsigned long addr, pte_t *ptep)
	298	{
	299	unsigned long old = pte_update(mm, addr, ptep, ~0UL, 0);
	300	return __pte(old);
	301	}
	302
	303	static inline void pte_clear(struct mm_struct *mm, unsigned long addr,
	304	pte_t * ptep)
	305	{
	306	pte_update(mm, addr, ptep, ~0UL, 0);
	307	}
	308
f88df14b DG	309
	310	/* Set the dirty and/or accessed bits atomically in a linux PTE, this
	311	* function doesn't need to flush the hash entry
	312	*/
8d30c14c	313	static inline void __ptep_set_access_flags(pte_t *ptep, pte_t entry)
f88df14b DG	314	{
f88df14b DG	315	unsigned long bits = pte_val(entry) &
ea3cc330	316	(_PAGE_DIRTY \| _PAGE_ACCESSED \| _PAGE_RW \| _PAGE_EXEC);
a033a487 BH	317
a033a487 BH	318	#ifdef PTE_ATOMIC_UPDATES
f88df14b DG	319	unsigned long old, tmp;
	320
	321	__asm__ __volatile__(
	322	"1: ldarx %0,0,%4\n\
	323	andi. %1,%0,%6\n\
	324	bne- 1b \n\
	325	or %0,%3,%0\n\
	326	stdcx. %0,0,%4\n\
	327	bne- 1b"
	328	:"=&r" (old), "=&r" (tmp), "=m" (*ptep)
	329	:"r" (bits), "r" (ptep), "m" (*ptep), "i" (_PAGE_BUSY)
	330	:"cc");
a033a487 BH	331	#else
	332	unsigned long old = pte_val(*ptep);
	333	*ptep = __pte(old \| bits);
	334	#endif
f88df14b	335	}
f88df14b	336
f88df14b DG	337	#define __HAVE_ARCH_PTE_SAME
	338	#define pte_same(A,B) (((pte_val(A) ^ pte_val(B)) & ~_PAGE_HPTEFLAGS) == 0)
	339
	340	#define pte_ERROR(e) \
	341	printk("%s:%d: bad pte %08lx.\n", __FILE__, __LINE__, pte_val(e))
	342	#define pmd_ERROR(e) \
	343	printk("%s:%d: bad pmd %08lx.\n", __FILE__, __LINE__, pmd_val(e))
	344	#define pgd_ERROR(e) \
	345	printk("%s:%d: bad pgd %08lx.\n", __FILE__, __LINE__, pgd_val(e))
	346
f88df14b DG	347	/* Encode and de-code a swap entry */
	348	#define __swp_type(entry) (((entry).val >> 1) & 0x3f)
	349	#define __swp_offset(entry) ((entry).val >> 8)
	350	#define __swp_entry(type, offset) ((swp_entry_t){((type)<< 1)\|((offset)<<8)})
	351	#define __pte_to_swp_entry(pte) ((swp_entry_t){pte_val(pte) >> PTE_RPN_SHIFT})
	352	#define __swp_entry_to_pte(x) ((pte_t) { (x).val << PTE_RPN_SHIFT })
	353	#define pte_to_pgoff(pte) (pte_val(pte) >> PTE_RPN_SHIFT)
	354	#define pgoff_to_pte(off) ((pte_t) {((off) << PTE_RPN_SHIFT)\|_PAGE_FILE})
	355	#define PTE_FILE_MAX_BITS (BITS_PER_LONG - PTE_RPN_SHIFT)
	356
a0668cdc	357	void pgtable_cache_add(unsigned shift, void (ctor)(void ));
f88df14b DG	358	void pgtable_cache_init(void);
	359
	360	/*
	361	* find_linux_pte returns the address of a linux pte for a given
	362	* effective address and directory. If not found, it returns zero.
	363	/static inline pte_t find_linux_pte(pgd_t *pgdir, unsigned long ea)
	364	{
	365	pgd_t *pg;
	366	pud_t *pu;
	367	pmd_t *pm;
	368	pte_t *pt = NULL;
	369
	370	pg = pgdir + pgd_index(ea);
	371	if (!pgd_none(*pg)) {
	372	pu = pud_offset(pg, ea);
	373	if (!pud_none(*pu)) {
	374	pm = pmd_offset(pu, ea);
	375	if (pmd_present(*pm))
	376	pt = pte_offset_kernel(pm, ea);
	377	}
	378	}
	379	return pt;
	380	}
	381
a4fe3ce7 DG	382	#ifdef CONFIG_HUGETLB_PAGE
	383	pte_t find_linux_pte_or_hugepte(pgd_t pgdir, unsigned long ea,
	384	unsigned *shift);
	385	#else
	386	static inline pte_t find_linux_pte_or_hugepte(pgd_t pgdir, unsigned long ea,
	387	unsigned *shift)
	388	{
	389	if (shift)
	390	*shift = 0;
	391	return find_linux_pte(pgdir, ea);
	392	}
	393	#endif /* !CONFIG_HUGETLB_PAGE */
ce0ad7f0	394
f88df14b DG	395	#endif /* __ASSEMBLY__ */
	396
	397	#endif /* _ASM_POWERPC_PGTABLE_PPC64_H_ */