blob: 3ddcf66f5e04ee4089f73504790d08217c6dfa1b [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
Russell King4baa9922008-08-02 10:55:55 +01002 * arch/arm/include/asm/pgtable.h
Linus Torvalds1da177e2005-04-16 15:20:36 -07003 *
4 * Copyright (C) 1995-2002 Russell King
5 *
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 as
8 * published by the Free Software Foundation.
9 */
10#ifndef _ASMARM_PGTABLE_H
11#define _ASMARM_PGTABLE_H
12
Russell Kingf6e33542010-11-16 00:22:09 +000013#include <linux/const.h>
Russell King002547b2006-06-20 20:46:52 +010014#include <asm/proc-fns.h>
15
16#ifndef CONFIG_MMU
17
Russell Kinga32618d2011-11-22 17:30:28 +000018#include <asm-generic/4level-fixup.h>
Russell King002547b2006-06-20 20:46:52 +010019#include "pgtable-nommu.h"
20
21#else
Linus Torvalds1da177e2005-04-16 15:20:36 -070022
Russell Kinga32618d2011-11-22 17:30:28 +000023#include <asm-generic/pgtable-nopud.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070024#include <asm/memory.h>
Russell Kinga09e64f2008-08-05 16:14:15 +010025#include <mach/vmalloc.h>
Russell Kingad1ae2f2006-12-13 14:34:43 +000026#include <asm/pgtable-hwdef.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070027
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. ;)
41 *
42 * Note that platforms may override VMALLOC_START, but they must provide
43 * VMALLOC_END. VMALLOC_END defines the (exclusive) limit of this space,
44 * which may not overlap IO space.
45 */
46#ifndef VMALLOC_START
47#define VMALLOC_OFFSET (8*1024*1024)
48#define VMALLOC_START (((unsigned long)high_memory + VMALLOC_OFFSET) & ~(VMALLOC_OFFSET-1))
49#endif
50
Linus Torvalds1da177e2005-04-16 15:20:36 -070051#define LIBRARY_TEXT_START 0x0c000000
52
53#ifndef __ASSEMBLY__
Russell King69529c02010-11-16 00:19:55 +000054extern void __pte_error(const char *file, int line, pte_t);
55extern void __pmd_error(const char *file, int line, pmd_t);
56extern void __pgd_error(const char *file, int line, pgd_t);
Linus Torvalds1da177e2005-04-16 15:20:36 -070057
Russell King69529c02010-11-16 00:19:55 +000058#define pte_ERROR(pte) __pte_error(__FILE__, __LINE__, pte)
59#define pmd_ERROR(pmd) __pmd_error(__FILE__, __LINE__, pmd)
60#define pgd_ERROR(pgd) __pgd_error(__FILE__, __LINE__, pgd)
Linus Torvalds1da177e2005-04-16 15:20:36 -070061
Hugh Dickins6119be02005-04-19 13:29:21 -070062/*
63 * This is the lowest virtual address we can permit any user space
64 * mapping to be mapped at. This is particularly important for
65 * non-high vector CPUs.
66 */
67#define FIRST_USER_ADDRESS PAGE_SIZE
68
Linus Torvalds1da177e2005-04-16 15:20:36 -070069/*
Imre_Deak44b18692007-02-11 13:45:13 +010070 * The pgprot_* and protection_map entries will be fixed up in runtime
71 * to include the cachable and bufferable bits based on memory policy,
72 * as well as any architecture dependent bits like global/ASID and SMP
73 * shared mapping bits.
Linus Torvalds1da177e2005-04-16 15:20:36 -070074 */
Russell Kingbb30f362008-09-06 20:04:59 +010075#define _L_PTE_DEFAULT L_PTE_PRESENT | L_PTE_YOUNG
Linus Torvalds1da177e2005-04-16 15:20:36 -070076
Imre_Deak44b18692007-02-11 13:45:13 +010077extern pgprot_t pgprot_user;
Linus Torvalds1da177e2005-04-16 15:20:36 -070078extern pgprot_t pgprot_kernel;
79
Russell King8ec53662008-09-07 17:16:54 +010080#define _MOD_PROT(p, b) __pgprot(pgprot_val(p) | (b))
Linus Torvalds1da177e2005-04-16 15:20:36 -070081
Russell King36bb94b2010-11-16 08:40:36 +000082#define PAGE_NONE _MOD_PROT(pgprot_user, L_PTE_XN | L_PTE_RDONLY)
83#define PAGE_SHARED _MOD_PROT(pgprot_user, L_PTE_USER | L_PTE_XN)
84#define PAGE_SHARED_EXEC _MOD_PROT(pgprot_user, L_PTE_USER)
85#define PAGE_COPY _MOD_PROT(pgprot_user, L_PTE_USER | L_PTE_RDONLY | L_PTE_XN)
86#define PAGE_COPY_EXEC _MOD_PROT(pgprot_user, L_PTE_USER | L_PTE_RDONLY)
87#define PAGE_READONLY _MOD_PROT(pgprot_user, L_PTE_USER | L_PTE_RDONLY | L_PTE_XN)
88#define PAGE_READONLY_EXEC _MOD_PROT(pgprot_user, L_PTE_USER | L_PTE_RDONLY)
Russell King9522d7e2010-11-16 00:23:31 +000089#define PAGE_KERNEL _MOD_PROT(pgprot_kernel, L_PTE_XN)
90#define PAGE_KERNEL_EXEC pgprot_kernel
Russell King8ec53662008-09-07 17:16:54 +010091
Russell King36bb94b2010-11-16 08:40:36 +000092#define __PAGE_NONE __pgprot(_L_PTE_DEFAULT | L_PTE_RDONLY | L_PTE_XN)
93#define __PAGE_SHARED __pgprot(_L_PTE_DEFAULT | L_PTE_USER | L_PTE_XN)
94#define __PAGE_SHARED_EXEC __pgprot(_L_PTE_DEFAULT | L_PTE_USER)
95#define __PAGE_COPY __pgprot(_L_PTE_DEFAULT | L_PTE_USER | L_PTE_RDONLY | L_PTE_XN)
96#define __PAGE_COPY_EXEC __pgprot(_L_PTE_DEFAULT | L_PTE_USER | L_PTE_RDONLY)
97#define __PAGE_READONLY __pgprot(_L_PTE_DEFAULT | L_PTE_USER | L_PTE_RDONLY | L_PTE_XN)
98#define __PAGE_READONLY_EXEC __pgprot(_L_PTE_DEFAULT | L_PTE_USER | L_PTE_RDONLY)
Imre_Deak44b18692007-02-11 13:45:13 +010099
Russell Kingeb9b2b62010-11-26 17:39:28 +0000100#define __pgprot_modify(prot,mask,bits) \
101 __pgprot((pgprot_val(prot) & ~(mask)) | (bits))
102
103#define pgprot_noncached(prot) \
104 __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_UNCACHED)
105
106#define pgprot_writecombine(prot) \
107 __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_BUFFERABLE)
108
Santosh Shilimkar8fb54282011-06-28 12:42:56 -0700109#define pgprot_stronglyordered(prot) \
110 __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_UNCACHED)
111
Russell Kingeb9b2b62010-11-26 17:39:28 +0000112#ifdef CONFIG_ARM_DMA_MEM_BUFFERABLE
113#define pgprot_dmacoherent(prot) \
Russell King9522d7e2010-11-16 00:23:31 +0000114 __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_BUFFERABLE | L_PTE_XN)
Russell Kingeb9b2b62010-11-26 17:39:28 +0000115#define __HAVE_PHYS_MEM_ACCESS_PROT
116struct file;
117extern pgprot_t phys_mem_access_prot(struct file *file, unsigned long pfn,
118 unsigned long size, pgprot_t vma_prot);
119#else
120#define pgprot_dmacoherent(prot) \
Russell King9522d7e2010-11-16 00:23:31 +0000121 __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_UNCACHED | L_PTE_XN)
Russell Kingeb9b2b62010-11-26 17:39:28 +0000122#endif
123
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124#endif /* __ASSEMBLY__ */
125
126/*
127 * The table below defines the page protection levels that we insert into our
128 * Linux page table version. These get translated into the best that the
129 * architecture can perform. Note that on most ARM hardware:
130 * 1) We cannot do execute protection
131 * 2) If we could do execute protection, then read is implied
132 * 3) write implies read permissions
133 */
Imre_Deak44b18692007-02-11 13:45:13 +0100134#define __P000 __PAGE_NONE
135#define __P001 __PAGE_READONLY
136#define __P010 __PAGE_COPY
137#define __P011 __PAGE_COPY
Russell King8ec53662008-09-07 17:16:54 +0100138#define __P100 __PAGE_READONLY_EXEC
139#define __P101 __PAGE_READONLY_EXEC
140#define __P110 __PAGE_COPY_EXEC
141#define __P111 __PAGE_COPY_EXEC
Linus Torvalds1da177e2005-04-16 15:20:36 -0700142
Imre_Deak44b18692007-02-11 13:45:13 +0100143#define __S000 __PAGE_NONE
144#define __S001 __PAGE_READONLY
145#define __S010 __PAGE_SHARED
146#define __S011 __PAGE_SHARED
Russell King8ec53662008-09-07 17:16:54 +0100147#define __S100 __PAGE_READONLY_EXEC
148#define __S101 __PAGE_READONLY_EXEC
149#define __S110 __PAGE_SHARED_EXEC
150#define __S111 __PAGE_SHARED_EXEC
Linus Torvalds1da177e2005-04-16 15:20:36 -0700151
152#ifndef __ASSEMBLY__
153/*
154 * ZERO_PAGE is a global shared page that is always zero: used
155 * for zero-mapped memory areas etc..
156 */
157extern struct page *empty_zero_page;
158#define ZERO_PAGE(vaddr) (empty_zero_page)
159
Russell King4eec4b12010-11-26 20:12:12 +0000160
161extern pgd_t swapper_pg_dir[PTRS_PER_PGD];
162
163/* to find an entry in a page-table-directory */
164#define pgd_index(addr) ((addr) >> PGDIR_SHIFT)
165
166#define pgd_offset(mm, addr) ((mm)->pgd + pgd_index(addr))
167
168/* to find an entry in a kernel page-table-directory */
169#define pgd_offset_k(addr) pgd_offset(&init_mm, addr)
170
Linus Torvalds1da177e2005-04-16 15:20:36 -0700171#define pmd_none(pmd) (!pmd_val(pmd))
172#define pmd_present(pmd) (pmd_val(pmd))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700173
Dave McCracken46a82b22006-09-25 23:31:48 -0700174static inline pte_t *pmd_page_vaddr(pmd_t pmd)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700175{
Catalin Marinasd7c5d0d2011-09-05 17:52:36 +0100176 return __va(pmd_val(pmd) & PHYS_MASK & (s32)PAGE_MASK);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700177}
178
Catalin Marinasd7c5d0d2011-09-05 17:52:36 +0100179#define pmd_page(pmd) pfn_to_page(__phys_to_pfn(pmd_val(pmd) & PHYS_MASK))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700180
Russell Kingb510b0492010-11-26 20:35:25 +0000181#ifndef CONFIG_HIGHPTE
182#define __pte_map(pmd) pmd_page_vaddr(*(pmd))
183#define __pte_unmap(pte) do { } while (0)
184#else
Russell Kingd30e45e2010-11-16 00:16:01 +0000185#define __pte_map(pmd) (pte_t *)kmap_atomic(pmd_page(*(pmd)))
186#define __pte_unmap(pte) kunmap_atomic(pte)
Russell Kingb510b0492010-11-26 20:35:25 +0000187#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700188
Russell Kingb510b0492010-11-26 20:35:25 +0000189#define pte_index(addr) (((addr) >> PAGE_SHIFT) & (PTRS_PER_PTE - 1))
190
191#define pte_offset_kernel(pmd,addr) (pmd_page_vaddr(*(pmd)) + pte_index(addr))
192
193#define pte_offset_map(pmd,addr) (__pte_map(pmd) + pte_index(addr))
194#define pte_unmap(pte) __pte_unmap(pte)
195
Catalin Marinasd7c5d0d2011-09-05 17:52:36 +0100196#define pte_pfn(pte) ((pte_val(pte) & PHYS_MASK) >> PAGE_SHIFT)
Will Deaconcae62922011-02-15 12:42:57 +0100197#define pfn_pte(pfn,prot) __pte(__pfn_to_phys(pfn) | pgprot_val(prot))
Russell Kingb510b0492010-11-26 20:35:25 +0000198
199#define pte_page(pte) pfn_to_page(pte_pfn(pte))
200#define mk_pte(page,prot) pfn_pte(page_to_pfn(page), prot)
201
Russell Kingb510b0492010-11-26 20:35:25 +0000202#define pte_clear(mm,addr,ptep) set_pte_ext(ptep, __pte(0), 0)
203
204#if __LINUX_ARM_ARCH__ < 6
205static inline void __sync_icache_dcache(pte_t pteval)
206{
207}
208#else
209extern void __sync_icache_dcache(pte_t pteval);
210#endif
211
212static inline void set_pte_at(struct mm_struct *mm, unsigned long addr,
213 pte_t *ptep, pte_t pteval)
214{
215 if (addr >= TASK_SIZE)
216 set_pte_ext(ptep, pteval, 0);
217 else {
218 __sync_icache_dcache(pteval);
219 set_pte_ext(ptep, pteval, PTE_EXT_NG);
220 }
221}
222
223#define pte_none(pte) (!pte_val(pte))
224#define pte_present(pte) (pte_val(pte) & L_PTE_PRESENT)
Russell King36bb94b2010-11-16 08:40:36 +0000225#define pte_write(pte) (!(pte_val(pte) & L_PTE_RDONLY))
Russell Kingb510b0492010-11-26 20:35:25 +0000226#define pte_dirty(pte) (pte_val(pte) & L_PTE_DIRTY)
227#define pte_young(pte) (pte_val(pte) & L_PTE_YOUNG)
Russell King9522d7e2010-11-16 00:23:31 +0000228#define pte_exec(pte) (!(pte_val(pte) & L_PTE_XN))
Russell Kingb510b0492010-11-26 20:35:25 +0000229#define pte_special(pte) (0)
230
231#define pte_present_user(pte) \
232 ((pte_val(pte) & (L_PTE_PRESENT | L_PTE_USER)) == \
233 (L_PTE_PRESENT | L_PTE_USER))
234
235#define PTE_BIT_FUNC(fn,op) \
236static inline pte_t pte_##fn(pte_t pte) { pte_val(pte) op; return pte; }
237
Russell King36bb94b2010-11-16 08:40:36 +0000238PTE_BIT_FUNC(wrprotect, |= L_PTE_RDONLY);
239PTE_BIT_FUNC(mkwrite, &= ~L_PTE_RDONLY);
Russell Kingb510b0492010-11-26 20:35:25 +0000240PTE_BIT_FUNC(mkclean, &= ~L_PTE_DIRTY);
241PTE_BIT_FUNC(mkdirty, |= L_PTE_DIRTY);
242PTE_BIT_FUNC(mkold, &= ~L_PTE_YOUNG);
243PTE_BIT_FUNC(mkyoung, |= L_PTE_YOUNG);
244
245static inline pte_t pte_mkspecial(pte_t pte) { return pte; }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700246
247static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
248{
Russell King36bb94b2010-11-16 08:40:36 +0000249 const pteval_t mask = L_PTE_XN | L_PTE_RDONLY | L_PTE_USER;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700250 pte_val(pte) = (pte_val(pte) & ~mask) | (pgprot_val(newprot) & mask);
251 return pte;
252}
253
Russell Kingfb93a1c2009-07-05 11:30:15 +0100254/*
255 * Encode and decode a swap entry. Swap entries are stored in the Linux
256 * page tables as follows:
Linus Torvalds1da177e2005-04-16 15:20:36 -0700257 *
Russell Kingfb93a1c2009-07-05 11:30:15 +0100258 * 3 3 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1
259 * 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
Russell King6a00cde2009-07-11 16:57:20 +0100260 * <--------------- offset --------------------> <- type --> 0 0 0
Russell Kingfb93a1c2009-07-05 11:30:15 +0100261 *
Russell King6a00cde2009-07-11 16:57:20 +0100262 * This gives us up to 63 swap files and 32GB per swap file. Note that
Russell Kingfb93a1c2009-07-05 11:30:15 +0100263 * the offset field is always non-zero.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700264 */
Russell King6a00cde2009-07-11 16:57:20 +0100265#define __SWP_TYPE_SHIFT 3
266#define __SWP_TYPE_BITS 6
Russell Kingfb93a1c2009-07-05 11:30:15 +0100267#define __SWP_TYPE_MASK ((1 << __SWP_TYPE_BITS) - 1)
268#define __SWP_OFFSET_SHIFT (__SWP_TYPE_BITS + __SWP_TYPE_SHIFT)
269
270#define __swp_type(x) (((x).val >> __SWP_TYPE_SHIFT) & __SWP_TYPE_MASK)
271#define __swp_offset(x) ((x).val >> __SWP_OFFSET_SHIFT)
272#define __swp_entry(type,offset) ((swp_entry_t) { ((type) << __SWP_TYPE_SHIFT) | ((offset) << __SWP_OFFSET_SHIFT) })
273
Linus Torvalds1da177e2005-04-16 15:20:36 -0700274#define __pte_to_swp_entry(pte) ((swp_entry_t) { pte_val(pte) })
275#define __swp_entry_to_pte(swp) ((pte_t) { (swp).val })
276
Russell Kingfb93a1c2009-07-05 11:30:15 +0100277/*
278 * It is an error for the kernel to have more swap files than we can
279 * encode in the PTEs. This ensures that we know when MAX_SWAPFILES
280 * is increased beyond what we presently support.
281 */
282#define MAX_SWAPFILES_CHECK() BUILD_BUG_ON(MAX_SWAPFILES_SHIFT > __SWP_TYPE_BITS)
283
Russell King65b1bfc2009-07-05 11:52:21 +0100284/*
285 * Encode and decode a file entry. File entries are stored in the Linux
286 * page tables as follows:
287 *
288 * 3 3 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1
289 * 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
Russell King6a00cde2009-07-11 16:57:20 +0100290 * <----------------------- offset ------------------------> 1 0 0
Russell King65b1bfc2009-07-05 11:52:21 +0100291 */
292#define pte_file(pte) (pte_val(pte) & L_PTE_FILE)
Russell King6a00cde2009-07-11 16:57:20 +0100293#define pte_to_pgoff(x) (pte_val(x) >> 3)
294#define pgoff_to_pte(x) __pte(((x) << 3) | L_PTE_FILE)
Russell King65b1bfc2009-07-05 11:52:21 +0100295
Russell King6a00cde2009-07-11 16:57:20 +0100296#define PTE_FILE_MAX_BITS 29
Russell King65b1bfc2009-07-05 11:52:21 +0100297
Linus Torvalds1da177e2005-04-16 15:20:36 -0700298/* Needs to be defined here and not in linux/mm.h, as it is arch dependent */
299/* FIXME: this is not correct */
300#define kern_addr_valid(addr) (1)
301
302#include <asm-generic/pgtable.h>
303
304/*
305 * We provide our own arch_get_unmapped_area to cope with VIPT caches.
306 */
307#define HAVE_ARCH_UNMAPPED_AREA
308
309/*
Randy Dunlap33bf5612005-09-13 01:25:50 -0700310 * remap a physical page `pfn' of size `size' with page protection `prot'
Linus Torvalds1da177e2005-04-16 15:20:36 -0700311 * into virtual address `from'
312 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700313#define io_remap_pfn_range(vma,from,pfn,size,prot) \
314 remap_pfn_range(vma, from, pfn, size, prot)
315
Linus Torvalds1da177e2005-04-16 15:20:36 -0700316#define pgtable_cache_init() do { } while (0)
317
318#endif /* !__ASSEMBLY__ */
319
Russell King002547b2006-06-20 20:46:52 +0100320#endif /* CONFIG_MMU */
321
Linus Torvalds1da177e2005-04-16 15:20:36 -0700322#endif /* _ASMARM_PGTABLE_H */