pgtable.h 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372
  1. /*
  2. * arch/arm/include/asm/pgtable.h
  3. *
  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. #include <linux/const.h>
  13. #include <asm/proc-fns.h>
  14. #ifndef CONFIG_MMU
  15. #include <asm-generic/4level-fixup.h>
  16. #include "pgtable-nommu.h"
  17. #else
  18. #include <asm-generic/pgtable-nopud.h>
  19. #include <asm/memory.h>
  20. #include <asm/pgtable-hwdef.h>
  21. #ifdef CONFIG_ARM_LPAE
  22. #include <asm/pgtable-3level.h>
  23. #else
  24. #include <asm/pgtable-2level.h>
  25. #endif
  26. /*
  27. * Just any arbitrary offset to the start of the vmalloc VM area: the
  28. * current 8MB value just means that there will be a 8MB "hole" after the
  29. * physical memory until the kernel virtual memory starts. That means that
  30. * any out-of-bounds memory accesses will hopefully be caught.
  31. * The vmalloc() routines leaves a hole of 4kB between each vmalloced
  32. * area for the same reason. ;)
  33. */
  34. #define VMALLOC_OFFSET (8*1024*1024)
  35. #define VMALLOC_START (((unsigned long)high_memory + VMALLOC_OFFSET) & ~(VMALLOC_OFFSET-1))
  36. #define VMALLOC_END 0xff000000UL
  37. #define LIBRARY_TEXT_START 0x0c000000
  38. #ifndef __ASSEMBLY__
  39. extern void __pte_error(const char *file, int line, pte_t);
  40. extern void __pmd_error(const char *file, int line, pmd_t);
  41. extern void __pgd_error(const char *file, int line, pgd_t);
  42. #define pte_ERROR(pte) __pte_error(__FILE__, __LINE__, pte)
  43. #define pmd_ERROR(pmd) __pmd_error(__FILE__, __LINE__, pmd)
  44. #define pgd_ERROR(pgd) __pgd_error(__FILE__, __LINE__, pgd)
  45. /*
  46. * This is the lowest virtual address we can permit any user space
  47. * mapping to be mapped at. This is particularly important for
  48. * non-high vector CPUs.
  49. */
  50. #define FIRST_USER_ADDRESS PAGE_SIZE
  51. /*
  52. * Use TASK_SIZE as the ceiling argument for free_pgtables() and
  53. * free_pgd_range() to avoid freeing the modules pmd when LPAE is enabled (pmd
  54. * page shared between user and kernel).
  55. */
  56. #ifdef CONFIG_ARM_LPAE
  57. #define USER_PGTABLES_CEILING TASK_SIZE
  58. #endif
  59. /*
  60. * The pgprot_* and protection_map entries will be fixed up in runtime
  61. * to include the cachable and bufferable bits based on memory policy,
  62. * as well as any architecture dependent bits like global/ASID and SMP
  63. * shared mapping bits.
  64. */
  65. #define _L_PTE_DEFAULT L_PTE_PRESENT | L_PTE_YOUNG
  66. extern pgprot_t pgprot_user;
  67. extern pgprot_t pgprot_kernel;
  68. #define _MOD_PROT(p, b) __pgprot(pgprot_val(p) | (b))
  69. #define PAGE_NONE _MOD_PROT(pgprot_user, L_PTE_XN | L_PTE_RDONLY)
  70. #define PAGE_SHARED _MOD_PROT(pgprot_user, L_PTE_USER | L_PTE_XN)
  71. #define PAGE_SHARED_EXEC _MOD_PROT(pgprot_user, L_PTE_USER)
  72. #define PAGE_COPY _MOD_PROT(pgprot_user, L_PTE_USER | L_PTE_RDONLY | L_PTE_XN)
  73. #define PAGE_COPY_EXEC _MOD_PROT(pgprot_user, L_PTE_USER | L_PTE_RDONLY)
  74. #define PAGE_READONLY _MOD_PROT(pgprot_user, L_PTE_USER | L_PTE_RDONLY | L_PTE_XN)
  75. #define PAGE_READONLY_EXEC _MOD_PROT(pgprot_user, L_PTE_USER | L_PTE_RDONLY)
  76. #define PAGE_KERNEL _MOD_PROT(pgprot_kernel, L_PTE_XN)
  77. #define PAGE_KERNEL_EXEC pgprot_kernel
  78. #define __PAGE_NONE __pgprot(_L_PTE_DEFAULT | L_PTE_RDONLY | L_PTE_XN)
  79. #define __PAGE_SHARED __pgprot(_L_PTE_DEFAULT | L_PTE_USER | L_PTE_XN)
  80. #define __PAGE_SHARED_EXEC __pgprot(_L_PTE_DEFAULT | L_PTE_USER)
  81. #define __PAGE_COPY __pgprot(_L_PTE_DEFAULT | L_PTE_USER | L_PTE_RDONLY | L_PTE_XN)
  82. #define __PAGE_COPY_EXEC __pgprot(_L_PTE_DEFAULT | L_PTE_USER | L_PTE_RDONLY)
  83. #define __PAGE_READONLY __pgprot(_L_PTE_DEFAULT | L_PTE_USER | L_PTE_RDONLY | L_PTE_XN)
  84. #define __PAGE_READONLY_EXEC __pgprot(_L_PTE_DEFAULT | L_PTE_USER | L_PTE_RDONLY)
  85. #define __pgprot_modify(prot,mask,bits) \
  86. __pgprot((pgprot_val(prot) & ~(mask)) | (bits))
  87. #define pgprot_noncached(prot) \
  88. __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_UNCACHED)
  89. #define pgprot_writecombine(prot) \
  90. __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_BUFFERABLE)
  91. #define pgprot_stronglyordered(prot) \
  92. __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_UNCACHED | L_PTE_XN)
  93. #define pgprot_device(prot) \
  94. __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_DEV_NONSHARED)
  95. #define pgprot_writethroughcache(prot) \
  96. __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_WRITETHROUGH)
  97. #define pgprot_writebackcache(prot) \
  98. __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_WRITEBACK)
  99. #define pgprot_writebackwacache(prot) \
  100. __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_WRITEALLOC)
  101. #ifdef CONFIG_ARM_DMA_MEM_BUFFERABLE
  102. #define pgprot_dmacoherent(prot) \
  103. __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_BUFFERABLE | L_PTE_XN)
  104. #define __HAVE_PHYS_MEM_ACCESS_PROT
  105. #define COHERENT_IS_NORMAL 1
  106. struct file;
  107. extern pgprot_t phys_mem_access_prot(struct file *file, unsigned long pfn,
  108. unsigned long size, pgprot_t vma_prot);
  109. #else
  110. #define pgprot_dmacoherent(prot) \
  111. __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_UNCACHED | L_PTE_XN)
  112. #define COHERENT_IS_NORMAL 0
  113. #endif
  114. #endif /* __ASSEMBLY__ */
  115. /*
  116. * The table below defines the page protection levels that we insert into our
  117. * Linux page table version. These get translated into the best that the
  118. * architecture can perform. Note that on most ARM hardware:
  119. * 1) We cannot do execute protection
  120. * 2) If we could do execute protection, then read is implied
  121. * 3) write implies read permissions
  122. */
  123. #define __P000 __PAGE_NONE
  124. #define __P001 __PAGE_READONLY
  125. #define __P010 __PAGE_COPY
  126. #define __P011 __PAGE_COPY
  127. #define __P100 __PAGE_READONLY_EXEC
  128. #define __P101 __PAGE_READONLY_EXEC
  129. #define __P110 __PAGE_COPY_EXEC
  130. #define __P111 __PAGE_COPY_EXEC
  131. #define __S000 __PAGE_NONE
  132. #define __S001 __PAGE_READONLY
  133. #define __S010 __PAGE_SHARED
  134. #define __S011 __PAGE_SHARED
  135. #define __S100 __PAGE_READONLY_EXEC
  136. #define __S101 __PAGE_READONLY_EXEC
  137. #define __S110 __PAGE_SHARED_EXEC
  138. #define __S111 __PAGE_SHARED_EXEC
  139. #ifndef __ASSEMBLY__
  140. /*
  141. * ZERO_PAGE is a global shared page that is always zero: used
  142. * for zero-mapped memory areas etc..
  143. */
  144. extern struct page *empty_zero_page;
  145. #define ZERO_PAGE(vaddr) (empty_zero_page)
  146. extern pgd_t swapper_pg_dir[PTRS_PER_PGD];
  147. /* to find an entry in a page-table-directory */
  148. #define pgd_index(addr) ((addr) >> PGDIR_SHIFT)
  149. #define pgd_offset(mm, addr) ((mm)->pgd + pgd_index(addr))
  150. /* to find an entry in a kernel page-table-directory */
  151. #define pgd_offset_k(addr) pgd_offset(&init_mm, addr)
  152. #define pmd_none(pmd) (!pmd_val(pmd))
  153. #define pmd_present(pmd) (pmd_val(pmd))
  154. static inline pte_t *pmd_page_vaddr(pmd_t pmd)
  155. {
  156. return __va(pmd_val(pmd) & PHYS_MASK & (s32)PAGE_MASK);
  157. }
  158. #define pmd_page(pmd) pfn_to_page(__phys_to_pfn(pmd_val(pmd) & PHYS_MASK))
  159. #ifndef CONFIG_HIGHPTE
  160. #define __pte_map(pmd) pmd_page_vaddr(*(pmd))
  161. #define __pte_unmap(pte) do { } while (0)
  162. #else
  163. #define __pte_map(pmd) (pte_t *)kmap_atomic(pmd_page(*(pmd)))
  164. #define __pte_unmap(pte) kunmap_atomic(pte)
  165. #endif
  166. #define pte_index(addr) (((addr) >> PAGE_SHIFT) & (PTRS_PER_PTE - 1))
  167. #define pte_offset_kernel(pmd,addr) (pmd_page_vaddr(*(pmd)) + pte_index(addr))
  168. #define pte_offset_map(pmd,addr) (__pte_map(pmd) + pte_index(addr))
  169. #define pte_unmap(pte) __pte_unmap(pte)
  170. #define pte_pfn(pte) ((pte_val(pte) & PHYS_MASK) >> PAGE_SHIFT)
  171. #define pfn_pte(pfn,prot) __pte(__pfn_to_phys(pfn) | pgprot_val(prot))
  172. #define pte_page(pte) pfn_to_page(pte_pfn(pte))
  173. #define mk_pte(page,prot) pfn_pte(page_to_pfn(page), prot)
  174. #define pte_clear(mm,addr,ptep) set_pte_ext(ptep, __pte(0), 0)
  175. #ifdef CONFIG_TIMA_RKP_L2_GROUP
  176. #define timal2group_pte_clear(mm,addr,ptep,tima_l2group_entry_ptr) cpu_v7_timal2group_set_pte_ext(ptep, __pte(0), 0, tima_l2group_entry_ptr)
  177. #endif /* CONFIG_TIMA_RKP_L2_GROUP */
  178. #define pte_none(pte) (!pte_val(pte))
  179. #define pte_present(pte) (pte_val(pte) & L_PTE_PRESENT)
  180. #define pte_write(pte) (!(pte_val(pte) & L_PTE_RDONLY))
  181. #define pte_dirty(pte) (pte_val(pte) & L_PTE_DIRTY)
  182. #define pte_young(pte) (pte_val(pte) & L_PTE_YOUNG)
  183. #define pte_exec(pte) (!(pte_val(pte) & L_PTE_XN))
  184. #define pte_special(pte) (0)
  185. #define pte_present_user(pte) \
  186. ((pte_val(pte) & (L_PTE_PRESENT | L_PTE_USER)) == \
  187. (L_PTE_PRESENT | L_PTE_USER))
  188. #if __LINUX_ARM_ARCH__ < 6
  189. static inline void __sync_icache_dcache(pte_t pteval)
  190. {
  191. }
  192. #else
  193. extern void __sync_icache_dcache(pte_t pteval);
  194. #endif
  195. static inline void set_pte_at(struct mm_struct *mm, unsigned long addr,
  196. pte_t *ptep, pte_t pteval)
  197. {
  198. unsigned long ext = 0;
  199. if (addr < TASK_SIZE && pte_present_user(pteval)) {
  200. __sync_icache_dcache(pteval);
  201. ext |= PTE_EXT_NG;
  202. }
  203. set_pte_ext(ptep, pteval, ext);
  204. }
  205. #ifdef CONFIG_TIMA_RKP_L2_GROUP
  206. static inline void timal2group_set_pte_at(pte_t *ptep, pte_t pteval,
  207. unsigned long tima_l2group_entry_ptr, unsigned long addr,
  208. unsigned long *tima_l2group_buffer_index)
  209. {
  210. int ret;
  211. if (addr >= TASK_SIZE) {
  212. ret = cpu_v7_timal2group_set_pte_ext(ptep, pteval, 0, tima_l2group_entry_ptr);
  213. if (ret == 0)
  214. (*tima_l2group_buffer_index)++;
  215. } else {
  216. __sync_icache_dcache(pteval);
  217. ret = cpu_v7_timal2group_set_pte_ext(ptep, pteval, PTE_EXT_NG, tima_l2group_entry_ptr);
  218. if (ret == 0)
  219. (*tima_l2group_buffer_index)++;
  220. }
  221. }
  222. static inline void timal2group_set_pte_commit(void *tima_l2group_entry_ptr,
  223. unsigned long tima_l2group_entries_count)
  224. {
  225. cpu_v7_timal2group_set_pte_commit(tima_l2group_entry_ptr,
  226. tima_l2group_entries_count);
  227. }
  228. #endif /* CONFIG_TIMA_RKP_L2_GROUP */
  229. #define PTE_BIT_FUNC(fn,op) \
  230. static inline pte_t pte_##fn(pte_t pte) { pte_val(pte) op; return pte; }
  231. PTE_BIT_FUNC(wrprotect, |= L_PTE_RDONLY);
  232. PTE_BIT_FUNC(mkwrite, &= ~L_PTE_RDONLY);
  233. PTE_BIT_FUNC(mkclean, &= ~L_PTE_DIRTY);
  234. PTE_BIT_FUNC(mkdirty, |= L_PTE_DIRTY);
  235. PTE_BIT_FUNC(mkold, &= ~L_PTE_YOUNG);
  236. PTE_BIT_FUNC(mkyoung, |= L_PTE_YOUNG);
  237. PTE_BIT_FUNC(mkexec, &= ~L_PTE_XN);
  238. PTE_BIT_FUNC(mknexec, |= L_PTE_XN);
  239. static inline pte_t pte_mkspecial(pte_t pte) { return pte; }
  240. static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
  241. {
  242. const pteval_t mask = L_PTE_XN | L_PTE_RDONLY | L_PTE_USER;
  243. pte_val(pte) = (pte_val(pte) & ~mask) | (pgprot_val(newprot) & mask);
  244. return pte;
  245. }
  246. /*
  247. * Encode and decode a swap entry. Swap entries are stored in the Linux
  248. * page tables as follows:
  249. *
  250. * 3 3 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1
  251. * 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
  252. * <--------------- offset ----------------------> < type -> 0 0 0
  253. *
  254. * This gives us up to 31 swap files and 64GB per swap file. Note that
  255. * the offset field is always non-zero.
  256. */
  257. #define __SWP_TYPE_SHIFT 3
  258. #define __SWP_TYPE_BITS 5
  259. #define __SWP_TYPE_MASK ((1 << __SWP_TYPE_BITS) - 1)
  260. #define __SWP_OFFSET_SHIFT (__SWP_TYPE_BITS + __SWP_TYPE_SHIFT)
  261. #define __swp_type(x) (((x).val >> __SWP_TYPE_SHIFT) & __SWP_TYPE_MASK)
  262. #define __swp_offset(x) ((x).val >> __SWP_OFFSET_SHIFT)
  263. #define __swp_entry(type,offset) ((swp_entry_t) { ((type) << __SWP_TYPE_SHIFT) | ((offset) << __SWP_OFFSET_SHIFT) })
  264. #define __pte_to_swp_entry(pte) ((swp_entry_t) { pte_val(pte) })
  265. #define __swp_entry_to_pte(swp) ((pte_t) { (swp).val })
  266. /*
  267. * It is an error for the kernel to have more swap files than we can
  268. * encode in the PTEs. This ensures that we know when MAX_SWAPFILES
  269. * is increased beyond what we presently support.
  270. */
  271. #define MAX_SWAPFILES_CHECK() BUILD_BUG_ON(MAX_SWAPFILES_SHIFT > __SWP_TYPE_BITS)
  272. /*
  273. * Encode and decode a file entry. File entries are stored in the Linux
  274. * page tables as follows:
  275. *
  276. * 3 3 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1
  277. * 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
  278. * <----------------------- offset ------------------------> 1 0 0
  279. */
  280. #define pte_file(pte) (pte_val(pte) & L_PTE_FILE)
  281. #define pte_to_pgoff(x) (pte_val(x) >> 3)
  282. #define pgoff_to_pte(x) __pte(((x) << 3) | L_PTE_FILE)
  283. #define PTE_FILE_MAX_BITS 29
  284. /* Needs to be defined here and not in linux/mm.h, as it is arch dependent */
  285. /* FIXME: this is not correct */
  286. #define kern_addr_valid(addr) (1)
  287. #include <asm-generic/pgtable.h>
  288. /*
  289. * We provide our own arch_get_unmapped_area to cope with VIPT caches.
  290. */
  291. #define HAVE_ARCH_UNMAPPED_AREA
  292. #define HAVE_ARCH_UNMAPPED_AREA_TOPDOWN
  293. /*
  294. * remap a physical page `pfn' of size `size' with page protection `prot'
  295. * into virtual address `from'
  296. */
  297. #define io_remap_pfn_range(vma,from,pfn,size,prot) \
  298. remap_pfn_range(vma,from,pfn,size,prot)
  299. #define pgtable_cache_init() do { } while (0)
  300. #endif /* !__ASSEMBLY__ */
  301. #endif /* CONFIG_MMU */
  302. #endif /* _ASMARM_PGTABLE_H */