pgtable.h 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317
  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. * The pgprot_* and protection_map entries will be fixed up in runtime
  53. * to include the cachable and bufferable bits based on memory policy,
  54. * as well as any architecture dependent bits like global/ASID and SMP
  55. * shared mapping bits.
  56. */
  57. #define _L_PTE_DEFAULT L_PTE_PRESENT | L_PTE_YOUNG
  58. extern pgprot_t pgprot_user;
  59. extern pgprot_t pgprot_kernel;
  60. #define _MOD_PROT(p, b) __pgprot(pgprot_val(p) | (b))
  61. #define PAGE_NONE _MOD_PROT(pgprot_user, L_PTE_XN | L_PTE_RDONLY)
  62. #define PAGE_SHARED _MOD_PROT(pgprot_user, L_PTE_USER | L_PTE_XN)
  63. #define PAGE_SHARED_EXEC _MOD_PROT(pgprot_user, L_PTE_USER)
  64. #define PAGE_COPY _MOD_PROT(pgprot_user, L_PTE_USER | L_PTE_RDONLY | L_PTE_XN)
  65. #define PAGE_COPY_EXEC _MOD_PROT(pgprot_user, L_PTE_USER | L_PTE_RDONLY)
  66. #define PAGE_READONLY _MOD_PROT(pgprot_user, L_PTE_USER | L_PTE_RDONLY | L_PTE_XN)
  67. #define PAGE_READONLY_EXEC _MOD_PROT(pgprot_user, L_PTE_USER | L_PTE_RDONLY)
  68. #define PAGE_KERNEL _MOD_PROT(pgprot_kernel, L_PTE_XN)
  69. #define PAGE_KERNEL_EXEC pgprot_kernel
  70. #define __PAGE_NONE __pgprot(_L_PTE_DEFAULT | L_PTE_RDONLY | L_PTE_XN)
  71. #define __PAGE_SHARED __pgprot(_L_PTE_DEFAULT | L_PTE_USER | L_PTE_XN)
  72. #define __PAGE_SHARED_EXEC __pgprot(_L_PTE_DEFAULT | L_PTE_USER)
  73. #define __PAGE_COPY __pgprot(_L_PTE_DEFAULT | L_PTE_USER | L_PTE_RDONLY | L_PTE_XN)
  74. #define __PAGE_COPY_EXEC __pgprot(_L_PTE_DEFAULT | L_PTE_USER | L_PTE_RDONLY)
  75. #define __PAGE_READONLY __pgprot(_L_PTE_DEFAULT | L_PTE_USER | L_PTE_RDONLY | L_PTE_XN)
  76. #define __PAGE_READONLY_EXEC __pgprot(_L_PTE_DEFAULT | L_PTE_USER | L_PTE_RDONLY)
  77. #define __pgprot_modify(prot,mask,bits) \
  78. __pgprot((pgprot_val(prot) & ~(mask)) | (bits))
  79. #define pgprot_noncached(prot) \
  80. __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_UNCACHED)
  81. #define pgprot_writecombine(prot) \
  82. __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_BUFFERABLE)
  83. #define pgprot_stronglyordered(prot) \
  84. __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_UNCACHED)
  85. #ifdef CONFIG_ARM_DMA_MEM_BUFFERABLE
  86. #define pgprot_dmacoherent(prot) \
  87. __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_BUFFERABLE | L_PTE_XN)
  88. #define __HAVE_PHYS_MEM_ACCESS_PROT
  89. struct file;
  90. extern pgprot_t phys_mem_access_prot(struct file *file, unsigned long pfn,
  91. unsigned long size, pgprot_t vma_prot);
  92. #else
  93. #define pgprot_dmacoherent(prot) \
  94. __pgprot_modify(prot, L_PTE_MT_MASK, L_PTE_MT_UNCACHED | L_PTE_XN)
  95. #endif
  96. #endif /* __ASSEMBLY__ */
  97. /*
  98. * The table below defines the page protection levels that we insert into our
  99. * Linux page table version. These get translated into the best that the
  100. * architecture can perform. Note that on most ARM hardware:
  101. * 1) We cannot do execute protection
  102. * 2) If we could do execute protection, then read is implied
  103. * 3) write implies read permissions
  104. */
  105. #define __P000 __PAGE_NONE
  106. #define __P001 __PAGE_READONLY
  107. #define __P010 __PAGE_COPY
  108. #define __P011 __PAGE_COPY
  109. #define __P100 __PAGE_READONLY_EXEC
  110. #define __P101 __PAGE_READONLY_EXEC
  111. #define __P110 __PAGE_COPY_EXEC
  112. #define __P111 __PAGE_COPY_EXEC
  113. #define __S000 __PAGE_NONE
  114. #define __S001 __PAGE_READONLY
  115. #define __S010 __PAGE_SHARED
  116. #define __S011 __PAGE_SHARED
  117. #define __S100 __PAGE_READONLY_EXEC
  118. #define __S101 __PAGE_READONLY_EXEC
  119. #define __S110 __PAGE_SHARED_EXEC
  120. #define __S111 __PAGE_SHARED_EXEC
  121. #ifndef __ASSEMBLY__
  122. /*
  123. * ZERO_PAGE is a global shared page that is always zero: used
  124. * for zero-mapped memory areas etc..
  125. */
  126. extern struct page *empty_zero_page;
  127. #define ZERO_PAGE(vaddr) (empty_zero_page)
  128. extern pgd_t swapper_pg_dir[PTRS_PER_PGD];
  129. /* to find an entry in a page-table-directory */
  130. #define pgd_index(addr) ((addr) >> PGDIR_SHIFT)
  131. #define pgd_offset(mm, addr) ((mm)->pgd + pgd_index(addr))
  132. /* to find an entry in a kernel page-table-directory */
  133. #define pgd_offset_k(addr) pgd_offset(&init_mm, addr)
  134. #define pmd_none(pmd) (!pmd_val(pmd))
  135. #define pmd_present(pmd) (pmd_val(pmd))
  136. static inline pte_t *pmd_page_vaddr(pmd_t pmd)
  137. {
  138. return __va(pmd_val(pmd) & PHYS_MASK & (s32)PAGE_MASK);
  139. }
  140. #define pmd_page(pmd) pfn_to_page(__phys_to_pfn(pmd_val(pmd) & PHYS_MASK))
  141. #ifndef CONFIG_HIGHPTE
  142. #define __pte_map(pmd) pmd_page_vaddr(*(pmd))
  143. #define __pte_unmap(pte) do { } while (0)
  144. #else
  145. #define __pte_map(pmd) (pte_t *)kmap_atomic(pmd_page(*(pmd)))
  146. #define __pte_unmap(pte) kunmap_atomic(pte)
  147. #endif
  148. #define pte_index(addr) (((addr) >> PAGE_SHIFT) & (PTRS_PER_PTE - 1))
  149. #define pte_offset_kernel(pmd,addr) (pmd_page_vaddr(*(pmd)) + pte_index(addr))
  150. #define pte_offset_map(pmd,addr) (__pte_map(pmd) + pte_index(addr))
  151. #define pte_unmap(pte) __pte_unmap(pte)
  152. #define pte_pfn(pte) ((pte_val(pte) & PHYS_MASK) >> PAGE_SHIFT)
  153. #define pfn_pte(pfn,prot) __pte(__pfn_to_phys(pfn) | pgprot_val(prot))
  154. #define pte_page(pte) pfn_to_page(pte_pfn(pte))
  155. #define mk_pte(page,prot) pfn_pte(page_to_pfn(page), prot)
  156. #define pte_clear(mm,addr,ptep) set_pte_ext(ptep, __pte(0), 0)
  157. #if __LINUX_ARM_ARCH__ < 6
  158. static inline void __sync_icache_dcache(pte_t pteval)
  159. {
  160. }
  161. #else
  162. extern void __sync_icache_dcache(pte_t pteval);
  163. #endif
  164. static inline void set_pte_at(struct mm_struct *mm, unsigned long addr,
  165. pte_t *ptep, pte_t pteval)
  166. {
  167. if (addr >= TASK_SIZE)
  168. set_pte_ext(ptep, pteval, 0);
  169. else {
  170. __sync_icache_dcache(pteval);
  171. set_pte_ext(ptep, pteval, PTE_EXT_NG);
  172. }
  173. }
  174. #define pte_none(pte) (!pte_val(pte))
  175. #define pte_present(pte) (pte_val(pte) & L_PTE_PRESENT)
  176. #define pte_write(pte) (!(pte_val(pte) & L_PTE_RDONLY))
  177. #define pte_dirty(pte) (pte_val(pte) & L_PTE_DIRTY)
  178. #define pte_young(pte) (pte_val(pte) & L_PTE_YOUNG)
  179. #define pte_exec(pte) (!(pte_val(pte) & L_PTE_XN))
  180. #define pte_special(pte) (0)
  181. #define pte_present_user(pte) \
  182. ((pte_val(pte) & (L_PTE_PRESENT | L_PTE_USER)) == \
  183. (L_PTE_PRESENT | L_PTE_USER))
  184. #define PTE_BIT_FUNC(fn,op) \
  185. static inline pte_t pte_##fn(pte_t pte) { pte_val(pte) op; return pte; }
  186. PTE_BIT_FUNC(wrprotect, |= L_PTE_RDONLY);
  187. PTE_BIT_FUNC(mkwrite, &= ~L_PTE_RDONLY);
  188. PTE_BIT_FUNC(mkclean, &= ~L_PTE_DIRTY);
  189. PTE_BIT_FUNC(mkdirty, |= L_PTE_DIRTY);
  190. PTE_BIT_FUNC(mkold, &= ~L_PTE_YOUNG);
  191. PTE_BIT_FUNC(mkyoung, |= L_PTE_YOUNG);
  192. static inline pte_t pte_mkspecial(pte_t pte) { return pte; }
  193. static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
  194. {
  195. const pteval_t mask = L_PTE_XN | L_PTE_RDONLY | L_PTE_USER;
  196. pte_val(pte) = (pte_val(pte) & ~mask) | (pgprot_val(newprot) & mask);
  197. return pte;
  198. }
  199. /*
  200. * Encode and decode a swap entry. Swap entries are stored in the Linux
  201. * page tables as follows:
  202. *
  203. * 3 3 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1
  204. * 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
  205. * <--------------- offset --------------------> <- type --> 0 0 0
  206. *
  207. * This gives us up to 63 swap files and 32GB per swap file. Note that
  208. * the offset field is always non-zero.
  209. */
  210. #define __SWP_TYPE_SHIFT 3
  211. #define __SWP_TYPE_BITS 6
  212. #define __SWP_TYPE_MASK ((1 << __SWP_TYPE_BITS) - 1)
  213. #define __SWP_OFFSET_SHIFT (__SWP_TYPE_BITS + __SWP_TYPE_SHIFT)
  214. #define __swp_type(x) (((x).val >> __SWP_TYPE_SHIFT) & __SWP_TYPE_MASK)
  215. #define __swp_offset(x) ((x).val >> __SWP_OFFSET_SHIFT)
  216. #define __swp_entry(type,offset) ((swp_entry_t) { ((type) << __SWP_TYPE_SHIFT) | ((offset) << __SWP_OFFSET_SHIFT) })
  217. #define __pte_to_swp_entry(pte) ((swp_entry_t) { pte_val(pte) })
  218. #define __swp_entry_to_pte(swp) ((pte_t) { (swp).val })
  219. /*
  220. * It is an error for the kernel to have more swap files than we can
  221. * encode in the PTEs. This ensures that we know when MAX_SWAPFILES
  222. * is increased beyond what we presently support.
  223. */
  224. #define MAX_SWAPFILES_CHECK() BUILD_BUG_ON(MAX_SWAPFILES_SHIFT > __SWP_TYPE_BITS)
  225. /*
  226. * Encode and decode a file entry. File entries are stored in the Linux
  227. * page tables as follows:
  228. *
  229. * 3 3 2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1
  230. * 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
  231. * <----------------------- offset ------------------------> 1 0 0
  232. */
  233. #define pte_file(pte) (pte_val(pte) & L_PTE_FILE)
  234. #define pte_to_pgoff(x) (pte_val(x) >> 3)
  235. #define pgoff_to_pte(x) __pte(((x) << 3) | L_PTE_FILE)
  236. #define PTE_FILE_MAX_BITS 29
  237. /* Needs to be defined here and not in linux/mm.h, as it is arch dependent */
  238. /* FIXME: this is not correct */
  239. #define kern_addr_valid(addr) (1)
  240. #include <asm-generic/pgtable.h>
  241. /*
  242. * We provide our own arch_get_unmapped_area to cope with VIPT caches.
  243. */
  244. #define HAVE_ARCH_UNMAPPED_AREA
  245. #define HAVE_ARCH_UNMAPPED_AREA_TOPDOWN
  246. /*
  247. * remap a physical page `pfn' of size `size' with page protection `prot'
  248. * into virtual address `from'
  249. */
  250. #define io_remap_pfn_range(vma,from,pfn,size,prot) \
  251. remap_pfn_range(vma, from, pfn, size, prot)
  252. #define pgtable_cache_init() do { } while (0)
  253. #endif /* !__ASSEMBLY__ */
  254. #endif /* CONFIG_MMU */
  255. #endif /* _ASMARM_PGTABLE_H */