blob: 0483cf4133152fd1a3167ce3a122b8355c2690ad [file] [log] [blame]
Thomas Gleixnerd2912cb2019-06-04 10:11:33 +02001/* SPDX-License-Identifier: GPL-2.0-only */
Linus Torvalds1da177e2005-04-16 15:20:36 -07002/*
Russell King4baa9922008-08-02 10:55:55 +01003 * arch/arm/include/asm/pgtable.h
Linus Torvalds1da177e2005-04-16 15:20:36 -07004 *
5 * Copyright (C) 1995-2002 Russell King
Linus Torvalds1da177e2005-04-16 15:20:36 -07006 */
7#ifndef _ASMARM_PGTABLE_H
8#define _ASMARM_PGTABLE_H
9
Russell Kingf6e33542010-11-16 00:22:09 +000010#include <linux/const.h>
Russell King002547b2006-06-20 20:46:52 +010011#include <asm/proc-fns.h>
12
13#ifndef CONFIG_MMU
14
Mike Rapoportaa662822019-12-04 16:53:48 -080015#include <asm-generic/pgtable-nopud.h>
David Howellsa1ce3922012-10-02 18:01:25 +010016#include <asm/pgtable-nommu.h>
Russell King002547b2006-06-20 20:46:52 +010017
18#else
Linus Torvalds1da177e2005-04-16 15:20:36 -070019
Kirill A. Shutemov9849a562017-03-09 17:24:05 +030020#define __ARCH_USE_5LEVEL_HACK
Russell Kinga32618d2011-11-22 17:30:28 +000021#include <asm-generic/pgtable-nopud.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070022#include <asm/memory.h>
Russell Kingad1ae2f2006-12-13 14:34:43 +000023#include <asm/pgtable-hwdef.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070024
Catalin Marinas8d962502012-07-25 14:39:26 +010025
26#include <asm/tlbflush.h>
27
Catalin Marinasdcfdae02011-11-22 17:30:29 +000028#ifdef CONFIG_ARM_LPAE
29#include <asm/pgtable-3level.h>
30#else
Catalin Marinas17f57212011-09-05 17:41:02 +010031#include <asm/pgtable-2level.h>
Catalin Marinasdcfdae02011-11-22 17:30:29 +000032#endif
Catalin Marinas17f57212011-09-05 17:41:02 +010033
Linus Torvalds1da177e2005-04-16 15:20:36 -070034/*
Russell King5c3073e2005-05-03 12:20:29 +010035 * Just any arbitrary offset to the start of the vmalloc VM area: the
36 * current 8MB value just means that there will be a 8MB "hole" after the
37 * physical memory until the kernel virtual memory starts. That means that
38 * any out-of-bounds memory accesses will hopefully be caught.
39 * The vmalloc() routines leaves a hole of 4kB between each vmalloced
40 * area for the same reason. ;)
Russell King5c3073e2005-05-03 12:20:29 +010041 */
Russell King5c3073e2005-05-03 12:20:29 +010042#define VMALLOC_OFFSET (8*1024*1024)
43#define VMALLOC_START (((unsigned long)high_memory + VMALLOC_OFFSET) & ~(VMALLOC_OFFSET-1))
Nicolas Pitre6ff09662015-09-13 03:25:26 +010044#define VMALLOC_END 0xff800000UL
Russell King5c3073e2005-05-03 12:20:29 +010045
Linus Torvalds1da177e2005-04-16 15:20:36 -070046#define LIBRARY_TEXT_START 0x0c000000
47
48#ifndef __ASSEMBLY__
Russell King69529c02010-11-16 00:19:55 +000049extern void __pte_error(const char *file, int line, pte_t);
50extern void __pmd_error(const char *file, int line, pmd_t);
51extern void __pgd_error(const char *file, int line, pgd_t);
Linus Torvalds1da177e2005-04-16 15:20:36 -070052
Russell King69529c02010-11-16 00:19:55 +000053#define pte_ERROR(pte) __pte_error(__FILE__, __LINE__, pte)
54#define pmd_ERROR(pmd) __pmd_error(__FILE__, __LINE__, pmd)
55#define pgd_ERROR(pgd) __pgd_error(__FILE__, __LINE__, pgd)
Linus Torvalds1da177e2005-04-16 15:20:36 -070056
Hugh Dickins6119be02005-04-19 13:29:21 -070057/*
58 * This is the lowest virtual address we can permit any user space
59 * mapping to be mapped at. This is particularly important for
60 * non-high vector CPUs.
61 */
Russell Kingd8aa7122013-11-28 21:43:40 +000062#define FIRST_USER_ADDRESS (PAGE_SIZE * 2)
Hugh Dickins6119be02005-04-19 13:29:21 -070063
Linus Torvalds1da177e2005-04-16 15:20:36 -070064/*
Catalin Marinas104ad3b2013-04-29 15:07:45 -070065 * Use TASK_SIZE as the ceiling argument for free_pgtables() and
66 * free_pgd_range() to avoid freeing the modules pmd when LPAE is enabled (pmd
67 * page shared between user and kernel).
68 */
69#ifdef CONFIG_ARM_LPAE
70#define USER_PGTABLES_CEILING TASK_SIZE
71#endif
72
73/*
Imre_Deak44b18692007-02-11 13:45:13 +010074 * The pgprot_* and protection_map entries will be fixed up in runtime
75 * to include the cachable and bufferable bits based on memory policy,
76 * as well as any architecture dependent bits like global/ASID and SMP
77 * shared mapping bits.
Linus Torvalds1da177e2005-04-16 15:20:36 -070078 */
Russell Kingbb30f362008-09-06 20:04:59 +010079#define _L_PTE_DEFAULT L_PTE_PRESENT | L_PTE_YOUNG
Linus Torvalds1da177e2005-04-16 15:20:36 -070080
Imre_Deak44b18692007-02-11 13:45:13 +010081extern pgprot_t pgprot_user;
Linus Torvalds1da177e2005-04-16 15:20:36 -070082extern pgprot_t pgprot_kernel;
83
Russell King8ec53662008-09-07 17:16:54 +010084#define _MOD_PROT(p, b) __pgprot(pgprot_val(p) | (b))
Linus Torvalds1da177e2005-04-16 15:20:36 -070085
Will Deacon26ffd0d2012-09-01 05:22:12 +010086#define PAGE_NONE _MOD_PROT(pgprot_user, L_PTE_XN | L_PTE_RDONLY | L_PTE_NONE)
Russell King36bb94b2010-11-16 08:40:36 +000087#define PAGE_SHARED _MOD_PROT(pgprot_user, L_PTE_USER | L_PTE_XN)
88#define PAGE_SHARED_EXEC _MOD_PROT(pgprot_user, L_PTE_USER)
89#define PAGE_COPY _MOD_PROT(pgprot_user, L_PTE_USER | L_PTE_RDONLY | L_PTE_XN)
90#define PAGE_COPY_EXEC _MOD_PROT(pgprot_user, L_PTE_USER | L_PTE_RDONLY)
91#define PAGE_READONLY _MOD_PROT(pgprot_user, L_PTE_USER | L_PTE_RDONLY | L_PTE_XN)
92#define PAGE_READONLY_EXEC _MOD_PROT(pgprot_user, L_PTE_USER | L_PTE_RDONLY)
Russell King9522d7e2010-11-16 00:23:31 +000093#define PAGE_KERNEL _MOD_PROT(pgprot_kernel, L_PTE_XN)
94#define PAGE_KERNEL_EXEC pgprot_kernel
Russell King8ec53662008-09-07 17:16:54 +010095
Will Deacon26ffd0d2012-09-01 05:22:12 +010096#define __PAGE_NONE __pgprot(_L_PTE_DEFAULT | L_PTE_RDONLY | L_PTE_XN | L_PTE_NONE)
Russell King36bb94b2010-11-16 08:40:36 +000097#define __PAGE_SHARED __pgprot(_L_PTE_DEFAULT | L_PTE_USER | L_PTE_XN)
98#define __PAGE_SHARED_EXEC __pgprot(_L_PTE_DEFAULT | L_PTE_USER)
99#define __PAGE_COPY __pgprot(_L_PTE_DEFAULT | L_PTE_USER | L_PTE_RDONLY | L_PTE_XN)
100#define __PAGE_COPY_EXEC __pgprot(_L_PTE_DEFAULT | L_PTE_USER | L_PTE_RDONLY)
101#define __PAGE_READONLY __pgprot(_L_PTE_DEFAULT | L_PTE_USER | L_PTE_RDONLY | L_PTE_XN)
102#define __PAGE_READONLY_EXEC __pgprot(_L_PTE_DEFAULT | L_PTE_USER | L_PTE_RDONLY)
Imre_Deak44b18692007-02-11 13:45:13 +0100103
Russell Kingeb9b2b62010-11-26 17:39:28 +0000104#define __pgprot_modify(prot,mask,bits) \
105 __pgprot((pgprot_val(prot) & ~(mask)) | (bits))
106
107#define pgprot_noncached(prot) \
108 __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_UNCACHED)
109
110#define pgprot_writecombine(prot) \
111 __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_BUFFERABLE)
112
Santosh Shilimkar8fb54282011-06-28 12:42:56 -0700113#define pgprot_stronglyordered(prot) \
114 __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_UNCACHED)
115
Vincent Whitchurch58ca3382019-01-16 13:31:41 +0100116#define pgprot_device(prot) \
117 __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_DEV_SHARED | L_PTE_SHARED | L_PTE_DIRTY | L_PTE_XN)
118
Russell Kingeb9b2b62010-11-26 17:39:28 +0000119#ifdef CONFIG_ARM_DMA_MEM_BUFFERABLE
120#define pgprot_dmacoherent(prot) \
Russell King9522d7e2010-11-16 00:23:31 +0000121 __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_BUFFERABLE | L_PTE_XN)
Russell Kingeb9b2b62010-11-26 17:39:28 +0000122#define __HAVE_PHYS_MEM_ACCESS_PROT
123struct file;
124extern pgprot_t phys_mem_access_prot(struct file *file, unsigned long pfn,
125 unsigned long size, pgprot_t vma_prot);
126#else
127#define pgprot_dmacoherent(prot) \
Russell King9522d7e2010-11-16 00:23:31 +0000128 __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_UNCACHED | L_PTE_XN)
Russell Kingeb9b2b62010-11-26 17:39:28 +0000129#endif
130
Linus Torvalds1da177e2005-04-16 15:20:36 -0700131#endif /* __ASSEMBLY__ */
132
133/*
134 * The table below defines the page protection levels that we insert into our
135 * Linux page table version. These get translated into the best that the
136 * architecture can perform. Note that on most ARM hardware:
137 * 1) We cannot do execute protection
138 * 2) If we could do execute protection, then read is implied
139 * 3) write implies read permissions
140 */
Imre_Deak44b18692007-02-11 13:45:13 +0100141#define __P000 __PAGE_NONE
142#define __P001 __PAGE_READONLY
143#define __P010 __PAGE_COPY
144#define __P011 __PAGE_COPY
Russell King8ec53662008-09-07 17:16:54 +0100145#define __P100 __PAGE_READONLY_EXEC
146#define __P101 __PAGE_READONLY_EXEC
147#define __P110 __PAGE_COPY_EXEC
148#define __P111 __PAGE_COPY_EXEC
Linus Torvalds1da177e2005-04-16 15:20:36 -0700149
Imre_Deak44b18692007-02-11 13:45:13 +0100150#define __S000 __PAGE_NONE
151#define __S001 __PAGE_READONLY
152#define __S010 __PAGE_SHARED
153#define __S011 __PAGE_SHARED
Russell King8ec53662008-09-07 17:16:54 +0100154#define __S100 __PAGE_READONLY_EXEC
155#define __S101 __PAGE_READONLY_EXEC
156#define __S110 __PAGE_SHARED_EXEC
157#define __S111 __PAGE_SHARED_EXEC
Linus Torvalds1da177e2005-04-16 15:20:36 -0700158
159#ifndef __ASSEMBLY__
160/*
161 * ZERO_PAGE is a global shared page that is always zero: used
162 * for zero-mapped memory areas etc..
163 */
164extern struct page *empty_zero_page;
165#define ZERO_PAGE(vaddr) (empty_zero_page)
166
Russell King4eec4b12010-11-26 20:12:12 +0000167
168extern pgd_t swapper_pg_dir[PTRS_PER_PGD];
169
170/* to find an entry in a page-table-directory */
171#define pgd_index(addr) ((addr) >> PGDIR_SHIFT)
172
173#define pgd_offset(mm, addr) ((mm)->pgd + pgd_index(addr))
174
175/* to find an entry in a kernel page-table-directory */
176#define pgd_offset_k(addr) pgd_offset(&init_mm, addr)
177
Linus Torvalds1da177e2005-04-16 15:20:36 -0700178#define pmd_none(pmd) (!pmd_val(pmd))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700179
Dave McCracken46a82b22006-09-25 23:31:48 -0700180static inline pte_t *pmd_page_vaddr(pmd_t pmd)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700181{
Catalin Marinasd7c5d0d2011-09-05 17:52:36 +0100182 return __va(pmd_val(pmd) & PHYS_MASK & (s32)PAGE_MASK);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700183}
184
Catalin Marinasd7c5d0d2011-09-05 17:52:36 +0100185#define pmd_page(pmd) pfn_to_page(__phys_to_pfn(pmd_val(pmd) & PHYS_MASK))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700186
Russell Kingb510b0492010-11-26 20:35:25 +0000187#ifndef CONFIG_HIGHPTE
188#define __pte_map(pmd) pmd_page_vaddr(*(pmd))
189#define __pte_unmap(pte) do { } while (0)
190#else
Russell Kingd30e45e2010-11-16 00:16:01 +0000191#define __pte_map(pmd) (pte_t *)kmap_atomic(pmd_page(*(pmd)))
192#define __pte_unmap(pte) kunmap_atomic(pte)
Russell Kingb510b0492010-11-26 20:35:25 +0000193#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700194
Russell Kingb510b0492010-11-26 20:35:25 +0000195#define pte_index(addr) (((addr) >> PAGE_SHIFT) & (PTRS_PER_PTE - 1))
196
197#define pte_offset_kernel(pmd,addr) (pmd_page_vaddr(*(pmd)) + pte_index(addr))
198
199#define pte_offset_map(pmd,addr) (__pte_map(pmd) + pte_index(addr))
200#define pte_unmap(pte) __pte_unmap(pte)
201
Catalin Marinasd7c5d0d2011-09-05 17:52:36 +0100202#define pte_pfn(pte) ((pte_val(pte) & PHYS_MASK) >> PAGE_SHIFT)
Will Deaconcae62922011-02-15 12:42:57 +0100203#define pfn_pte(pfn,prot) __pte(__pfn_to_phys(pfn) | pgprot_val(prot))
Russell Kingb510b0492010-11-26 20:35:25 +0000204
205#define pte_page(pte) pfn_to_page(pte_pfn(pte))
206#define mk_pte(page,prot) pfn_pte(page_to_pfn(page), prot)
207
Russell Kingb510b0492010-11-26 20:35:25 +0000208#define pte_clear(mm,addr,ptep) set_pte_ext(ptep, __pte(0), 0)
209
Steven Capperf2950702014-07-18 16:15:27 +0100210#define pte_isset(pte, val) ((u32)(val) == (val) ? pte_val(pte) & (val) \
211 : !!(pte_val(pte) & (val)))
212#define pte_isclear(pte, val) (!(pte_val(pte) & (val)))
213
Russell Kingb510b0492010-11-26 20:35:25 +0000214#define pte_none(pte) (!pte_val(pte))
Steven Capperf2950702014-07-18 16:15:27 +0100215#define pte_present(pte) (pte_isset((pte), L_PTE_PRESENT))
216#define pte_valid(pte) (pte_isset((pte), L_PTE_VALID))
Will Deacon19711882014-02-21 17:01:48 +0100217#define pte_accessible(mm, pte) (mm_tlb_flush_pending(mm) ? pte_present(pte) : pte_valid(pte))
Steven Capperf2950702014-07-18 16:15:27 +0100218#define pte_write(pte) (pte_isclear((pte), L_PTE_RDONLY))
219#define pte_dirty(pte) (pte_isset((pte), L_PTE_DIRTY))
220#define pte_young(pte) (pte_isset((pte), L_PTE_YOUNG))
221#define pte_exec(pte) (pte_isclear((pte), L_PTE_XN))
Russell Kingb510b0492010-11-26 20:35:25 +0000222
Will Deacon19711882014-02-21 17:01:48 +0100223#define pte_valid_user(pte) \
Steven Capperf2950702014-07-18 16:15:27 +0100224 (pte_valid(pte) && pte_isset((pte), L_PTE_USER) && pte_young(pte))
Russell Kingb510b0492010-11-26 20:35:25 +0000225
Russell King1ee5e872017-10-25 11:04:14 +0100226static inline bool pte_access_permitted(pte_t pte, bool write)
227{
228 pteval_t mask = L_PTE_PRESENT | L_PTE_USER;
229 pteval_t needed = mask;
230
231 if (write)
232 mask |= L_PTE_RDONLY;
233
234 return (pte_val(pte) & mask) == needed;
235}
236#define pte_access_permitted pte_access_permitted
237
Will Deacon47f12042012-08-10 17:51:18 +0100238#if __LINUX_ARM_ARCH__ < 6
239static inline void __sync_icache_dcache(pte_t pteval)
240{
241}
242#else
243extern void __sync_icache_dcache(pte_t pteval);
244#endif
245
246static inline void set_pte_at(struct mm_struct *mm, unsigned long addr,
247 pte_t *ptep, pte_t pteval)
248{
249 unsigned long ext = 0;
250
Will Deacon19711882014-02-21 17:01:48 +0100251 if (addr < TASK_SIZE && pte_valid_user(pteval)) {
Steve Capperbd951302014-10-09 15:29:16 -0700252 if (!pte_special(pteval))
253 __sync_icache_dcache(pteval);
Will Deacon47f12042012-08-10 17:51:18 +0100254 ext |= PTE_EXT_NG;
255 }
256
257 set_pte_ext(ptep, pteval, ext);
258}
259
Jungseung Lee1f92f772014-11-29 03:03:51 +0100260static inline pte_t clear_pte_bit(pte_t pte, pgprot_t prot)
261{
262 pte_val(pte) &= ~pgprot_val(prot);
263 return pte;
264}
Russell Kingb510b0492010-11-26 20:35:25 +0000265
Jungseung Lee1f92f772014-11-29 03:03:51 +0100266static inline pte_t set_pte_bit(pte_t pte, pgprot_t prot)
267{
268 pte_val(pte) |= pgprot_val(prot);
269 return pte;
270}
271
272static inline pte_t pte_wrprotect(pte_t pte)
273{
274 return set_pte_bit(pte, __pgprot(L_PTE_RDONLY));
275}
276
277static inline pte_t pte_mkwrite(pte_t pte)
278{
279 return clear_pte_bit(pte, __pgprot(L_PTE_RDONLY));
280}
281
282static inline pte_t pte_mkclean(pte_t pte)
283{
284 return clear_pte_bit(pte, __pgprot(L_PTE_DIRTY));
285}
286
287static inline pte_t pte_mkdirty(pte_t pte)
288{
289 return set_pte_bit(pte, __pgprot(L_PTE_DIRTY));
290}
291
292static inline pte_t pte_mkold(pte_t pte)
293{
294 return clear_pte_bit(pte, __pgprot(L_PTE_YOUNG));
295}
296
297static inline pte_t pte_mkyoung(pte_t pte)
298{
299 return set_pte_bit(pte, __pgprot(L_PTE_YOUNG));
300}
301
302static inline pte_t pte_mkexec(pte_t pte)
303{
304 return clear_pte_bit(pte, __pgprot(L_PTE_XN));
305}
306
307static inline pte_t pte_mknexec(pte_t pte)
308{
309 return set_pte_bit(pte, __pgprot(L_PTE_XN));
310}
Russell Kingb510b0492010-11-26 20:35:25 +0000311
Linus Torvalds1da177e2005-04-16 15:20:36 -0700312static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
313{
Catalin Marinas69dde4c2013-02-18 17:51:20 +0100314 const pteval_t mask = L_PTE_XN | L_PTE_RDONLY | L_PTE_USER |
315 L_PTE_NONE | L_PTE_VALID;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700316 pte_val(pte) = (pte_val(pte) & ~mask) | (pgprot_val(newprot) & mask);
317 return pte;
318}
319
Russell Kingfb93a1c2009-07-05 11:30:15 +0100320/*
321 * Encode and decode a swap entry. Swap entries are stored in the Linux
322 * page tables as follows:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700323 *
Russell Kingfb93a1c2009-07-05 11:30:15 +0100324 * 3 3 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1
325 * 1 0 9 8 7 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0
Kirill A. Shutemovb007ea72015-02-10 14:10:17 -0800326 * <--------------- offset ------------------------> < type -> 0 0
Russell Kingfb93a1c2009-07-05 11:30:15 +0100327 *
Kirill A. Shutemovb007ea72015-02-10 14:10:17 -0800328 * This gives us up to 31 swap files and 128GB per swap file. Note that
Russell Kingfb93a1c2009-07-05 11:30:15 +0100329 * the offset field is always non-zero.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700330 */
Kirill A. Shutemovb007ea72015-02-10 14:10:17 -0800331#define __SWP_TYPE_SHIFT 2
Will Deaconf5f20252012-08-10 17:51:19 +0100332#define __SWP_TYPE_BITS 5
Russell Kingfb93a1c2009-07-05 11:30:15 +0100333#define __SWP_TYPE_MASK ((1 << __SWP_TYPE_BITS) - 1)
334#define __SWP_OFFSET_SHIFT (__SWP_TYPE_BITS + __SWP_TYPE_SHIFT)
335
336#define __swp_type(x) (((x).val >> __SWP_TYPE_SHIFT) & __SWP_TYPE_MASK)
337#define __swp_offset(x) ((x).val >> __SWP_OFFSET_SHIFT)
338#define __swp_entry(type,offset) ((swp_entry_t) { ((type) << __SWP_TYPE_SHIFT) | ((offset) << __SWP_OFFSET_SHIFT) })
339
Linus Torvalds1da177e2005-04-16 15:20:36 -0700340#define __pte_to_swp_entry(pte) ((swp_entry_t) { pte_val(pte) })
341#define __swp_entry_to_pte(swp) ((pte_t) { (swp).val })
342
Russell Kingfb93a1c2009-07-05 11:30:15 +0100343/*
344 * It is an error for the kernel to have more swap files than we can
345 * encode in the PTEs. This ensures that we know when MAX_SWAPFILES
346 * is increased beyond what we presently support.
347 */
348#define MAX_SWAPFILES_CHECK() BUILD_BUG_ON(MAX_SWAPFILES_SHIFT > __SWP_TYPE_BITS)
349
Linus Torvalds1da177e2005-04-16 15:20:36 -0700350/* Needs to be defined here and not in linux/mm.h, as it is arch dependent */
351/* FIXME: this is not correct */
352#define kern_addr_valid(addr) (1)
353
354#include <asm-generic/pgtable.h>
355
356/*
357 * We provide our own arch_get_unmapped_area to cope with VIPT caches.
358 */
359#define HAVE_ARCH_UNMAPPED_AREA
Rob Herring7dbaa462011-11-22 04:01:07 +0100360#define HAVE_ARCH_UNMAPPED_AREA_TOPDOWN
Linus Torvalds1da177e2005-04-16 15:20:36 -0700361
Linus Torvalds1da177e2005-04-16 15:20:36 -0700362#endif /* !__ASSEMBLY__ */
363
Russell King002547b2006-06-20 20:46:52 +0100364#endif /* CONFIG_MMU */
365
Linus Torvalds1da177e2005-04-16 15:20:36 -0700366#endif /* _ASMARM_PGTABLE_H */