[deliverable/linux.git] / include / asm-m32r / pgtable.h

#ifndef _ASM_M32R_PGTABLE_H
#define _ASM_M32R_PGTABLE_H

#include <asm-generic/4level-fixup.h>

#ifdef __KERNEL__
/*
 * The Linux memory management assumes a three-level page table setup. On
 * the M32R, we use that, but "fold" the mid level into the top-level page
 * table, so that we physically have the same two-level page table as the
 * M32R mmu expects.
 *
 * This file contains the functions and defines necessary to modify and use
 * the M32R page table tree.
 */

/* CAUTION!: If you change macro definitions in this file, you might have to
 * change arch/m32r/mmu.S manually.
 */

#ifndef __ASSEMBLY__

#include <linux/threads.h>
#include <asm/processor.h>
#include <asm/addrspace.h>
#include <asm/bitops.h>
#include <asm/page.h>

struct mm_struct;
struct vm_area_struct;

extern pgd_t swapper_pg_dir[1024];
extern void paging_init(void);

/*
 * ZERO_PAGE is a global shared page that is always zero: used
 * for zero-mapped memory areas etc..
 */
extern unsigned long empty_zero_page[1024];
#define ZERO_PAGE(vaddr)	(virt_to_page(empty_zero_page))

#endif /* !__ASSEMBLY__ */

#ifndef __ASSEMBLY__
#include <asm/pgtable-2level.h>
#endif

#define pgtable_cache_init()	do { } while (0)

#define PMD_SIZE	(1UL << PMD_SHIFT)
#define PMD_MASK	(~(PMD_SIZE - 1))
#define PGDIR_SIZE	(1UL << PGDIR_SHIFT)
#define PGDIR_MASK	(~(PGDIR_SIZE - 1))

#define USER_PTRS_PER_PGD	(TASK_SIZE / PGDIR_SIZE)
#define FIRST_USER_ADDRESS	0

#ifndef __ASSEMBLY__
/* Just any arbitrary offset to the start of the vmalloc VM area: the
 * current 8MB value just means that there will be a 8MB "hole" after the
 * physical memory until the kernel virtual memory starts.  That means that
 * any out-of-bounds memory accesses will hopefully be caught.
 * The vmalloc() routines leaves a hole of 4kB between each vmalloced
 * area for the same reason. ;)
 */
#define VMALLOC_START		KSEG2
#define VMALLOC_END		KSEG3

/*
 *     M32R TLB format
 *
 *     [0]    [1:19]           [20:23]       [24:31]
 *     +-----------------------+----+-------------+
 *     |          VPN          |0000|    ASID     |
 *     +-----------------------+----+-------------+
 *     +-+---------------------+----+-+---+-+-+-+-+
 *     |0         PPN          |0000|N|AC |L|G|V| |
 *     +-+---------------------+----+-+---+-+-+-+-+
 *                                     RWX
 */

#define _PAGE_BIT_DIRTY		0	/* software: page changed */
#define _PAGE_BIT_FILE		0	/* when !present: nonlinear file
					   mapping */
#define _PAGE_BIT_PRESENT	1	/* Valid: page is valid */
#define _PAGE_BIT_GLOBAL	2	/* Global */
#define _PAGE_BIT_LARGE		3	/* Large */
#define _PAGE_BIT_EXEC		4	/* Execute */
#define _PAGE_BIT_WRITE		5	/* Write */
#define _PAGE_BIT_READ		6	/* Read */
#define _PAGE_BIT_NONCACHABLE	7	/* Non cachable */
#define _PAGE_BIT_ACCESSED	8	/* software: page referenced */
#define _PAGE_BIT_PROTNONE	9	/* software: if not present */

#define _PAGE_DIRTY		(1UL << _PAGE_BIT_DIRTY)
#define _PAGE_FILE		(1UL << _PAGE_BIT_FILE)
#define _PAGE_PRESENT		(1UL << _PAGE_BIT_PRESENT)
#define _PAGE_GLOBAL		(1UL << _PAGE_BIT_GLOBAL)
#define _PAGE_LARGE		(1UL << _PAGE_BIT_LARGE)
#define _PAGE_EXEC		(1UL << _PAGE_BIT_EXEC)
#define _PAGE_WRITE		(1UL << _PAGE_BIT_WRITE)
#define _PAGE_READ		(1UL << _PAGE_BIT_READ)
#define _PAGE_NONCACHABLE	(1UL << _PAGE_BIT_NONCACHABLE)
#define _PAGE_ACCESSED		(1UL << _PAGE_BIT_ACCESSED)
#define _PAGE_PROTNONE		(1UL << _PAGE_BIT_PROTNONE)

#define _PAGE_TABLE	\
	( _PAGE_PRESENT | _PAGE_WRITE | _PAGE_READ | _PAGE_ACCESSED \
	| _PAGE_DIRTY )
#define _KERNPG_TABLE	\
	( _PAGE_PRESENT | _PAGE_WRITE | _PAGE_READ | _PAGE_ACCESSED \
	| _PAGE_DIRTY )
#define _PAGE_CHG_MASK	\
	( PTE_MASK | _PAGE_ACCESSED | _PAGE_DIRTY )

#ifdef CONFIG_MMU
#define PAGE_NONE	\
	__pgprot(_PAGE_PROTNONE | _PAGE_ACCESSED)
#define PAGE_SHARED	\
	__pgprot(_PAGE_PRESENT | _PAGE_WRITE | _PAGE_READ | _PAGE_ACCESSED)
#define PAGE_SHARED_EXEC \
	__pgprot(_PAGE_PRESENT | _PAGE_EXEC | _PAGE_WRITE | _PAGE_READ \
		| _PAGE_ACCESSED)
#define PAGE_COPY	\
	__pgprot(_PAGE_PRESENT | _PAGE_READ | _PAGE_ACCESSED)
#define PAGE_COPY_EXEC	\
	__pgprot(_PAGE_PRESENT | _PAGE_EXEC | _PAGE_READ | _PAGE_ACCESSED)
#define PAGE_READONLY	\
	__pgprot(_PAGE_PRESENT | _PAGE_READ | _PAGE_ACCESSED)
#define PAGE_READONLY_EXEC \
	__pgprot(_PAGE_PRESENT | _PAGE_EXEC | _PAGE_READ | _PAGE_ACCESSED)

#define __PAGE_KERNEL	\
	( _PAGE_PRESENT | _PAGE_EXEC | _PAGE_WRITE | _PAGE_READ | _PAGE_DIRTY \
	| _PAGE_ACCESSED )
#define __PAGE_KERNEL_RO	( __PAGE_KERNEL & ~_PAGE_WRITE )
#define __PAGE_KERNEL_NOCACHE	( __PAGE_KERNEL | _PAGE_NONCACHABLE)

#define MAKE_GLOBAL(x)	__pgprot((x) | _PAGE_GLOBAL)

#define PAGE_KERNEL		MAKE_GLOBAL(__PAGE_KERNEL)
#define PAGE_KERNEL_RO		MAKE_GLOBAL(__PAGE_KERNEL_RO)
#define PAGE_KERNEL_NOCACHE	MAKE_GLOBAL(__PAGE_KERNEL_NOCACHE)

#else
#define PAGE_NONE		__pgprot(0)
#define PAGE_SHARED		__pgprot(0)
#define PAGE_SHARED_EXEC	__pgprot(0)
#define PAGE_COPY		__pgprot(0)
#define PAGE_COPY_EXEC		__pgprot(0)
#define PAGE_READONLY		__pgprot(0)
#define PAGE_READONLY_EXEC	__pgprot(0)

#define PAGE_KERNEL		__pgprot(0)
#define PAGE_KERNEL_RO		__pgprot(0)
#define PAGE_KERNEL_NOCACHE	__pgprot(0)
#endif /* CONFIG_MMU */

	/* xwr */
#define __P000	PAGE_NONE
#define __P001	PAGE_READONLY
#define __P010	PAGE_COPY
#define __P011	PAGE_COPY
#define __P100	PAGE_READONLY_EXEC
#define __P101	PAGE_READONLY_EXEC
#define __P110	PAGE_COPY_EXEC
#define __P111	PAGE_COPY_EXEC

#define __S000	PAGE_NONE
#define __S001	PAGE_READONLY
#define __S010	PAGE_SHARED
#define __S011	PAGE_SHARED
#define __S100	PAGE_READONLY_EXEC
#define __S101	PAGE_READONLY_EXEC
#define __S110	PAGE_SHARED_EXEC
#define __S111	PAGE_SHARED_EXEC

/* page table for 0-4MB for everybody */

#define pte_present(x)	(pte_val(x) & (_PAGE_PRESENT | _PAGE_PROTNONE))
#define pte_clear(mm,addr,xp)	do { set_pte_at(mm, addr, xp, __pte(0)); } while (0)

#define pmd_none(x)	(!pmd_val(x))
#define pmd_present(x)	(pmd_val(x) & _PAGE_PRESENT)
#define pmd_clear(xp)	do { set_pmd(xp, __pmd(0)); } while (0)
#define	pmd_bad(x)	((pmd_val(x) & ~PAGE_MASK) != _KERNPG_TABLE)

#define pages_to_mb(x)	((x) >> (20 - PAGE_SHIFT))

/*
 * The following only work if pte_present() is true.
 * Undefined behaviour if not..
 */
static inline int pte_read(pte_t pte)
{
	return pte_val(pte) & _PAGE_READ;
}

static inline int pte_exec(pte_t pte)
{
	return pte_val(pte) & _PAGE_EXEC;
}

static inline int pte_dirty(pte_t pte)
{
	return pte_val(pte) & _PAGE_DIRTY;
}

static inline int pte_young(pte_t pte)
{
	return pte_val(pte) & _PAGE_ACCESSED;
}

static inline int pte_write(pte_t pte)
{
	return pte_val(pte) & _PAGE_WRITE;
}

/*
 * The following only works if pte_present() is not true.
 */
static inline int pte_file(pte_t pte)
{
	return pte_val(pte) & _PAGE_FILE;
}

static inline pte_t pte_rdprotect(pte_t pte)
{
	pte_val(pte) &= ~_PAGE_READ;
	return pte;
}

static inline pte_t pte_exprotect(pte_t pte)
{
	pte_val(pte) &= ~_PAGE_EXEC;
	return pte;
}

static inline pte_t pte_mkclean(pte_t pte)
{
	pte_val(pte) &= ~_PAGE_DIRTY;
	return pte;
}

static inline pte_t pte_mkold(pte_t pte)
{
	pte_val(pte) &= ~_PAGE_ACCESSED;
	return pte;
}

static inline pte_t pte_wrprotect(pte_t pte)
{
	pte_val(pte) &= ~_PAGE_WRITE;
	return pte;
}

static inline pte_t pte_mkread(pte_t pte)
{
	pte_val(pte) |= _PAGE_READ;
	return pte;
}

static inline pte_t pte_mkexec(pte_t pte)
{
	pte_val(pte) |= _PAGE_EXEC;
	return pte;
}

static inline pte_t pte_mkdirty(pte_t pte)
{
	pte_val(pte) |= _PAGE_DIRTY;
	return pte;
}

static inline pte_t pte_mkyoung(pte_t pte)
{
	pte_val(pte) |= _PAGE_ACCESSED;
	return pte;
}

static inline pte_t pte_mkwrite(pte_t pte)
{
	pte_val(pte) |= _PAGE_WRITE;
	return pte;
}

static inline  int ptep_test_and_clear_dirty(struct vm_area_struct *vma, unsigned long addr, pte_t *ptep)
{
	return test_and_clear_bit(_PAGE_BIT_DIRTY, ptep);
}

static inline  int ptep_test_and_clear_young(struct vm_area_struct *vma, unsigned long addr, pte_t *ptep)
{
	return test_and_clear_bit(_PAGE_BIT_ACCESSED, ptep);
}

static inline void ptep_set_wrprotect(struct mm_struct *mm, unsigned long addr, pte_t *ptep)
{
	clear_bit(_PAGE_BIT_WRITE, ptep);
}

/*
 * Macro and implementation to make a page protection as uncachable.
 */
static inline pgprot_t pgprot_noncached(pgprot_t _prot)
{
	unsigned long prot = pgprot_val(_prot);

	prot |= _PAGE_NONCACHABLE;
	return __pgprot(prot);
}

#define pgprot_writecombine(prot) pgprot_noncached(prot)

/*
 * Conversion functions: convert a page and protection to a page entry,
 * and a page entry and page directory to the page they refer to.
 */
#define mk_pte(page, pgprot)	pfn_pte(page_to_pfn(page), pgprot)

static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
{
	set_pte(&pte, __pte((pte_val(pte) & _PAGE_CHG_MASK) \
		| pgprot_val(newprot)));

	return pte;
}

/*
 * Conversion functions: convert a page and protection to a page entry,
 * and a page entry and page directory to the page they refer to.
 */

static inline void pmd_set(pmd_t * pmdp, pte_t * ptep)
{
	pmd_val(*pmdp) = (((unsigned long) ptep) & PAGE_MASK);
}

#define pmd_page_vaddr(pmd)	\
	((unsigned long) __va(pmd_val(pmd) & PAGE_MASK))

#ifndef CONFIG_DISCONTIGMEM
#define pmd_page(pmd)	(mem_map + ((pmd_val(pmd) >> PAGE_SHIFT) - PFN_BASE))
#endif /* !CONFIG_DISCONTIGMEM */

/* to find an entry in a page-table-directory. */
#define pgd_index(address)	\
	(((address) >> PGDIR_SHIFT) & (PTRS_PER_PGD - 1))

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

/* to find an entry in a kernel page-table-directory */
#define pgd_offset_k(address)	pgd_offset(&init_mm, address)

#define pmd_index(address)	\
	(((address) >> PMD_SHIFT) & (PTRS_PER_PMD - 1))

#define pte_index(address)	\
	(((address) >> PAGE_SHIFT) & (PTRS_PER_PTE - 1))
#define pte_offset_kernel(dir, address)	\
	((pte_t *)pmd_page_vaddr(*(dir)) + pte_index(address))
#define pte_offset_map(dir, address)	\
	((pte_t *)page_address(pmd_page(*(dir))) + pte_index(address))
#define pte_offset_map_nested(dir, address)	pte_offset_map(dir, address)
#define pte_unmap(pte)		do { } while (0)
#define pte_unmap_nested(pte)	do { } while (0)

/* Encode and de-code a swap entry */
#define __swp_type(x)			(((x).val >> 2) & 0x3f)
#define __swp_offset(x)			((x).val >> 10)
#define __swp_entry(type, offset)	\
	((swp_entry_t) { ((type) << 2) | ((offset) << 10) })
#define __pte_to_swp_entry(pte)		((swp_entry_t) { pte_val(pte) })
#define __swp_entry_to_pte(x)		((pte_t) { (x).val })

#endif /* !__ASSEMBLY__ */

/* Needs to be defined here and not in linux/mm.h, as it is arch dependent */
#define kern_addr_valid(addr)	(1)

#define io_remap_pfn_range(vma, vaddr, pfn, size, prot)	\
		remap_pfn_range(vma, vaddr, pfn, size, prot)

#define MK_IOSPACE_PFN(space, pfn)	(pfn)
#define GET_IOSPACE(pfn)		0
#define GET_PFN(pfn)			(pfn)

#define __HAVE_ARCH_PTEP_TEST_AND_CLEAR_YOUNG
#define __HAVE_ARCH_PTEP_TEST_AND_CLEAR_DIRTY
#define __HAVE_ARCH_PTEP_GET_AND_CLEAR
#define __HAVE_ARCH_PTEP_SET_WRPROTECT
#define __HAVE_ARCH_PTE_SAME
#include <asm-generic/pgtable.h>

#endif /* __KERNEL__ */

#endif /* _ASM_M32R_PGTABLE_H */
Commit	Line	Data
1da177e4 LT	1	#ifndef _ASM_M32R_PGTABLE_H
	2	#define _ASM_M32R_PGTABLE_H
	3
	4	#include <asm-generic/4level-fixup.h>
	5
	6	#ifdef __KERNEL__
	7	/*
	8	* The Linux memory management assumes a three-level page table setup. On
	9	* the M32R, we use that, but "fold" the mid level into the top-level page
	10	* table, so that we physically have the same two-level page table as the
	11	* M32R mmu expects.
	12	*
	13	* This file contains the functions and defines necessary to modify and use
	14	* the M32R page table tree.
	15	*/
	16
	17	/* CAUTION!: If you change macro definitions in this file, you might have to
	18	* change arch/m32r/mmu.S manually.
	19	*/
	20
	21	#ifndef __ASSEMBLY__
	22
1da177e4 LT	23	#include <linux/threads.h>
	24	#include <asm/processor.h>
	25	#include <asm/addrspace.h>
	26	#include <asm/bitops.h>
	27	#include <asm/page.h>
	28
8c65b4a6 TS	29	struct mm_struct;
	30	struct vm_area_struct;
	31
1da177e4 LT	32	extern pgd_t swapper_pg_dir[1024];
	33	extern void paging_init(void);
	34
	35	/*
	36	* ZERO_PAGE is a global shared page that is always zero: used
	37	* for zero-mapped memory areas etc..
	38	*/
	39	extern unsigned long empty_zero_page[1024];
	40	#define ZERO_PAGE(vaddr) (virt_to_page(empty_zero_page))
	41
	42	#endif /* !__ASSEMBLY__ */
	43
	44	#ifndef __ASSEMBLY__
	45	#include <asm/pgtable-2level.h>
	46	#endif
	47
	48	#define pgtable_cache_init() do { } while (0)
	49
	50	#define PMD_SIZE (1UL << PMD_SHIFT)
	51	#define PMD_MASK (~(PMD_SIZE - 1))
	52	#define PGDIR_SIZE (1UL << PGDIR_SHIFT)
	53	#define PGDIR_MASK (~(PGDIR_SIZE - 1))
	54
	55	#define USER_PTRS_PER_PGD (TASK_SIZE / PGDIR_SIZE)
d455a369	56	#define FIRST_USER_ADDRESS 0
1da177e4 LT	57
	58	#ifndef __ASSEMBLY__
	59	/* Just any arbitrary offset to the start of the vmalloc VM area: the
	60	* current 8MB value just means that there will be a 8MB "hole" after the
	61	* physical memory until the kernel virtual memory starts. That means that
	62	* any out-of-bounds memory accesses will hopefully be caught.
	63	* The vmalloc() routines leaves a hole of 4kB between each vmalloced
	64	* area for the same reason. ;)
	65	*/
	66	#define VMALLOC_START KSEG2
	67	#define VMALLOC_END KSEG3
	68
	69	/*
	70	* M32R TLB format
	71	*
	72	* [0] [1:19] [20:23] [24:31]
	73	* +-----------------------+----+-------------+
	74	* \| VPN \|0000\| ASID \|
	75	* +-----------------------+----+-------------+
	76	* +-+---------------------+----+-+---+-+-+-+-+
	77	* \|0 PPN \|0000\|N\|AC \|L\|G\|V\| \|
	78	* +-+---------------------+----+-+---+-+-+-+-+
	79	* RWX
	80	*/
	81
	82	#define _PAGE_BIT_DIRTY 0 /* software: page changed */
	83	#define _PAGE_BIT_FILE 0 /* when !present: nonlinear file
	84	mapping */
	85	#define _PAGE_BIT_PRESENT 1 /* Valid: page is valid */
	86	#define _PAGE_BIT_GLOBAL 2 /* Global */
	87	#define _PAGE_BIT_LARGE 3 /* Large */
	88	#define _PAGE_BIT_EXEC 4 /* Execute */
	89	#define _PAGE_BIT_WRITE 5 /* Write */
	90	#define _PAGE_BIT_READ 6 /* Read */
	91	#define _PAGE_BIT_NONCACHABLE 7 /* Non cachable */
	92	#define _PAGE_BIT_ACCESSED 8 /* software: page referenced */
	93	#define _PAGE_BIT_PROTNONE 9 /* software: if not present */
	94
	95	#define _PAGE_DIRTY (1UL << _PAGE_BIT_DIRTY)
	96	#define _PAGE_FILE (1UL << _PAGE_BIT_FILE)
	97	#define _PAGE_PRESENT (1UL << _PAGE_BIT_PRESENT)
	98	#define _PAGE_GLOBAL (1UL << _PAGE_BIT_GLOBAL)
	99	#define _PAGE_LARGE (1UL << _PAGE_BIT_LARGE)
	100	#define _PAGE_EXEC (1UL << _PAGE_BIT_EXEC)
	101	#define _PAGE_WRITE (1UL << _PAGE_BIT_WRITE)
	102	#define _PAGE_READ (1UL << _PAGE_BIT_READ)
	103	#define _PAGE_NONCACHABLE (1UL << _PAGE_BIT_NONCACHABLE)
	104	#define _PAGE_ACCESSED (1UL << _PAGE_BIT_ACCESSED)
	105	#define _PAGE_PROTNONE (1UL << _PAGE_BIT_PROTNONE)
	106
	107	#define _PAGE_TABLE \
	108	( _PAGE_PRESENT \| _PAGE_WRITE \| _PAGE_READ \| _PAGE_ACCESSED \
	109	\| _PAGE_DIRTY )
	110	#define _KERNPG_TABLE \
	111	( _PAGE_PRESENT \| _PAGE_WRITE \| _PAGE_READ \| _PAGE_ACCESSED \
	112	\| _PAGE_DIRTY )
	113	#define _PAGE_CHG_MASK \
	114	( PTE_MASK \| _PAGE_ACCESSED \| _PAGE_DIRTY )
	115
	116	#ifdef CONFIG_MMU
	117	#define PAGE_NONE \
	118	__pgprot(_PAGE_PROTNONE \| _PAGE_ACCESSED)
	119	#define PAGE_SHARED \
	120	__pgprot(_PAGE_PRESENT \| _PAGE_WRITE \| _PAGE_READ \| _PAGE_ACCESSED)
121	#define PAGE_SHARED_EXEC \
122	__pgprot(_PAGE_PRESENT \| _PAGE_EXEC \| _PAGE_WRITE \| _PAGE_READ \
123	\| _PAGE_ACCESSED)
124	#define PAGE_COPY \
125	__pgprot(_PAGE_PRESENT \| _PAGE_READ \| _PAGE_ACCESSED)
126	#define PAGE_COPY_EXEC \
127	__pgprot(_PAGE_PRESENT \| _PAGE_EXEC \| _PAGE_READ \| _PAGE_ACCESSED)
128	#define PAGE_READONLY \
129	__pgprot(_PAGE_PRESENT \| _PAGE_READ \| _PAGE_ACCESSED)
130	#define PAGE_READONLY_EXEC \
131	__pgprot(_PAGE_PRESENT \| _PAGE_EXEC \| _PAGE_READ \| _PAGE_ACCESSED)
132
133	#define __PAGE_KERNEL \
134	( _PAGE_PRESENT \| _PAGE_EXEC \| _PAGE_WRITE \| _PAGE_READ \| _PAGE_DIRTY \
135	\| _PAGE_ACCESSED )
136	#define __PAGE_KERNEL_RO ( __PAGE_KERNEL & ~_PAGE_WRITE )
137	#define __PAGE_KERNEL_NOCACHE ( __PAGE_KERNEL \| _PAGE_NONCACHABLE)
138
139	#define MAKE_GLOBAL(x) __pgprot((x) \| _PAGE_GLOBAL)
140
141	#define PAGE_KERNEL MAKE_GLOBAL(__PAGE_KERNEL)
142	#define PAGE_KERNEL_RO MAKE_GLOBAL(__PAGE_KERNEL_RO)
143	#define PAGE_KERNEL_NOCACHE MAKE_GLOBAL(__PAGE_KERNEL_NOCACHE)
144
145	#else
146	#define PAGE_NONE __pgprot(0)
147	#define PAGE_SHARED __pgprot(0)
148	#define PAGE_SHARED_EXEC __pgprot(0)
149	#define PAGE_COPY __pgprot(0)
150	#define PAGE_COPY_EXEC __pgprot(0)
151	#define PAGE_READONLY __pgprot(0)
152	#define PAGE_READONLY_EXEC __pgprot(0)
153
154	#define PAGE_KERNEL __pgprot(0)
155	#define PAGE_KERNEL_RO __pgprot(0)
156	#define PAGE_KERNEL_NOCACHE __pgprot(0)
157	#endif /* CONFIG_MMU */
158
159	/* xwr */
160	#define __P000 PAGE_NONE
161	#define __P001 PAGE_READONLY
162	#define __P010 PAGE_COPY
163	#define __P011 PAGE_COPY
164	#define __P100 PAGE_READONLY_EXEC
165	#define __P101 PAGE_READONLY_EXEC
166	#define __P110 PAGE_COPY_EXEC
167	#define __P111 PAGE_COPY_EXEC
168
169	#define __S000 PAGE_NONE
170	#define __S001 PAGE_READONLY
171	#define __S010 PAGE_SHARED
172	#define __S011 PAGE_SHARED
173	#define __S100 PAGE_READONLY_EXEC
174	#define __S101 PAGE_READONLY_EXEC
175	#define __S110 PAGE_SHARED_EXEC
176	#define __S111 PAGE_SHARED_EXEC
177
178	/* page table for 0-4MB for everybody */
179
180	#define pte_present(x) (pte_val(x) & (_PAGE_PRESENT \| _PAGE_PROTNONE))
181	#define pte_clear(mm,addr,xp) do { set_pte_at(mm, addr, xp, __pte(0)); } while (0)
182
183	#define pmd_none(x) (!pmd_val(x))
184	#define pmd_present(x) (pmd_val(x) & _PAGE_PRESENT)
185	#define pmd_clear(xp) do { set_pmd(xp, __pmd(0)); } while (0)
186	#define pmd_bad(x) ((pmd_val(x) & ~PAGE_MASK) != _KERNPG_TABLE)
187
188	#define pages_to_mb(x) ((x) >> (20 - PAGE_SHIFT))
189
190	/*
191	* The following only work if pte_present() is true.
192	* Undefined behaviour if not..
193	*/
194	static inline int pte_read(pte_t pte)
195	{
196	return pte_val(pte) & _PAGE_READ;
197	}
198
199	static inline int pte_exec(pte_t pte)
200	{
201	return pte_val(pte) & _PAGE_EXEC;
202	}
203
204	static inline int pte_dirty(pte_t pte)
205	{
206	return pte_val(pte) & _PAGE_DIRTY;
207	}
208
209	static inline int pte_young(pte_t pte)
210	{
211	return pte_val(pte) & _PAGE_ACCESSED;
212	}
213
214	static inline int pte_write(pte_t pte)
215	{
216	return pte_val(pte) & _PAGE_WRITE;
217	}
218
219	/*
220	* The following only works if pte_present() is not true.
221	*/
222	static inline int pte_file(pte_t pte)
223	{
224	return pte_val(pte) & _PAGE_FILE;
225	}
226
227	static inline pte_t pte_rdprotect(pte_t pte)
228	{
229	pte_val(pte) &= ~_PAGE_READ;
230	return pte;
231	}
232
233	static inline pte_t pte_exprotect(pte_t pte)
234	{
235	pte_val(pte) &= ~_PAGE_EXEC;
236	return pte;
237	}
238
239	static inline pte_t pte_mkclean(pte_t pte)
240	{
241	pte_val(pte) &= ~_PAGE_DIRTY;
242	return pte;
243	}
244
245	static inline pte_t pte_mkold(pte_t pte)
246	{
247	pte_val(pte) &= ~_PAGE_ACCESSED;
248	return pte;
249	}
250
251	static inline pte_t pte_wrprotect(pte_t pte)
252	{
253	pte_val(pte) &= ~_PAGE_WRITE;
254	return pte;
255	}
256
257	static inline pte_t pte_mkread(pte_t pte)
258	{
259	pte_val(pte) \|= _PAGE_READ;
260	return pte;
261	}
262
263	static inline pte_t pte_mkexec(pte_t pte)
264	{
265	pte_val(pte) \|= _PAGE_EXEC;
266	return pte;
267	}
268
269	static inline pte_t pte_mkdirty(pte_t pte)
270	{
271	pte_val(pte) \|= _PAGE_DIRTY;
272	return pte;
273	}
274
275	static inline pte_t pte_mkyoung(pte_t pte)
276	{
277	pte_val(pte) \|= _PAGE_ACCESSED;
278	return pte;
279	}
280
281	static inline pte_t pte_mkwrite(pte_t pte)
282	{
283	pte_val(pte) \|= _PAGE_WRITE;
284	return pte;
285	}
286
287	static inline int ptep_test_and_clear_dirty(struct vm_area_struct vma, unsigned long addr, pte_t ptep)
288	{
289	return test_and_clear_bit(_PAGE_BIT_DIRTY, ptep);
290	}
291
292	static inline int ptep_test_and_clear_young(struct vm_area_struct vma, unsigned long addr, pte_t ptep)
293	{
294	return test_and_clear_bit(_PAGE_BIT_ACCESSED, ptep);
295	}
296
297	static inline void ptep_set_wrprotect(struct mm_struct mm, unsigned long addr, pte_t ptep)
298	{
299	clear_bit(_PAGE_BIT_WRITE, ptep);
300	}
301
302	/*
303	* Macro and implementation to make a page protection as uncachable.
304	*/
305	static inline pgprot_t pgprot_noncached(pgprot_t _prot)
306	{
307	unsigned long prot = pgprot_val(_prot);
308
309	prot \|= _PAGE_NONCACHABLE;
310	return __pgprot(prot);
311	}
312
313	#define pgprot_writecombine(prot) pgprot_noncached(prot)
314
315	/*
316	* Conversion functions: convert a page and protection to a page entry,
317	* and a page entry and page directory to the page they refer to.
318	*/
319	#define mk_pte(page, pgprot) pfn_pte(page_to_pfn(page), pgprot)
320
321	static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
322	{
323	set_pte(&pte, __pte((pte_val(pte) & _PAGE_CHG_MASK) \
324	\| pgprot_val(newprot)));
325
326	return pte;
327	}
328
1da177e4 LT	329	/*
	330	* Conversion functions: convert a page and protection to a page entry,
	331	* and a page entry and page directory to the page they refer to.
	332	*/
	333
	334	static inline void pmd_set(pmd_t * pmdp, pte_t * ptep)
	335	{
	336	pmd_val(*pmdp) = (((unsigned long) ptep) & PAGE_MASK);
	337	}
	338
46a82b2d	339	#define pmd_page_vaddr(pmd) \
1da177e4 LT	340	((unsigned long) __va(pmd_val(pmd) & PAGE_MASK))
	341
	342	#ifndef CONFIG_DISCONTIGMEM
	343	#define pmd_page(pmd) (mem_map + ((pmd_val(pmd) >> PAGE_SHIFT) - PFN_BASE))
	344	#endif /* !CONFIG_DISCONTIGMEM */
	345
	346	/* to find an entry in a page-table-directory. */
	347	#define pgd_index(address) \
	348	(((address) >> PGDIR_SHIFT) & (PTRS_PER_PGD - 1))
	349
	350	#define pgd_offset(mm, address) ((mm)->pgd + pgd_index(address))
	351
	352	/* to find an entry in a kernel page-table-directory */
	353	#define pgd_offset_k(address) pgd_offset(&init_mm, address)
	354
	355	#define pmd_index(address) \
	356	(((address) >> PMD_SHIFT) & (PTRS_PER_PMD - 1))
	357
	358	#define pte_index(address) \
	359	(((address) >> PAGE_SHIFT) & (PTRS_PER_PTE - 1))
	360	#define pte_offset_kernel(dir, address) \
46a82b2d	361	((pte_t )pmd_page_vaddr((dir)) + pte_index(address))
1da177e4 LT	362	#define pte_offset_map(dir, address) \
	363	((pte_t )page_address(pmd_page((dir))) + pte_index(address))
	364	#define pte_offset_map_nested(dir, address) pte_offset_map(dir, address)
	365	#define pte_unmap(pte) do { } while (0)
	366	#define pte_unmap_nested(pte) do { } while (0)
	367
	368	/* Encode and de-code a swap entry */
	369	#define __swp_type(x) (((x).val >> 2) & 0x3f)
	370	#define __swp_offset(x) ((x).val >> 10)
	371	#define __swp_entry(type, offset) \
	372	((swp_entry_t) { ((type) << 2) \| ((offset) << 10) })
	373	#define __pte_to_swp_entry(pte) ((swp_entry_t) { pte_val(pte) })
	374	#define __swp_entry_to_pte(x) ((pte_t) { (x).val })
	375
	376	#endif /* !__ASSEMBLY__ */
	377
	378	/* Needs to be defined here and not in linux/mm.h, as it is arch dependent */
	379	#define kern_addr_valid(addr) (1)
	380
1da177e4 LT	381	#define io_remap_pfn_range(vma, vaddr, pfn, size, prot) \
	382	remap_pfn_range(vma, vaddr, pfn, size, prot)
	383
	384	#define MK_IOSPACE_PFN(space, pfn) (pfn)
	385	#define GET_IOSPACE(pfn) 0
	386	#define GET_PFN(pfn) (pfn)
	387
	388	#define __HAVE_ARCH_PTEP_TEST_AND_CLEAR_YOUNG
	389	#define __HAVE_ARCH_PTEP_TEST_AND_CLEAR_DIRTY
	390	#define __HAVE_ARCH_PTEP_GET_AND_CLEAR
	391	#define __HAVE_ARCH_PTEP_SET_WRPROTECT
	392	#define __HAVE_ARCH_PTE_SAME
	393	#include <asm-generic/pgtable.h>
	394
	395	#endif /* __KERNEL__ */
	396
	397	#endif /* _ASM_M32R_PGTABLE_H */