pgtable.h 8.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310
  1. /* SPDX-License-Identifier: GPL-2.0 */
  2. /*
  3. * Copyright (C) 2000 - 2007 Jeff Dike (jdike@{addtoit,linux.intel}.com)
  4. * Copyright 2003 PathScale, Inc.
  5. * Derived from include/asm-i386/pgtable.h
  6. */
  7. #ifndef __UM_PGTABLE_H
  8. #define __UM_PGTABLE_H
  9. #include <asm/fixmap.h>
  10. #define _PAGE_PRESENT 0x001
  11. #define _PAGE_NEWPAGE 0x002
  12. #define _PAGE_NEWPROT 0x004
  13. #define _PAGE_RW 0x020
  14. #define _PAGE_USER 0x040
  15. #define _PAGE_ACCESSED 0x080
  16. #define _PAGE_DIRTY 0x100
  17. /* If _PAGE_PRESENT is clear, we use these: */
  18. #define _PAGE_PROTNONE 0x010 /* if the user mapped it with PROT_NONE;
  19. pte_present gives true */
  20. #ifdef CONFIG_3_LEVEL_PGTABLES
  21. #include <asm/pgtable-3level.h>
  22. #else
  23. #include <asm/pgtable-2level.h>
  24. #endif
  25. extern pgd_t swapper_pg_dir[PTRS_PER_PGD];
  26. /* zero page used for uninitialized stuff */
  27. extern unsigned long *empty_zero_page;
  28. /* Just any arbitrary offset to the start of the vmalloc VM area: the
  29. * current 8MB value just means that there will be a 8MB "hole" after the
  30. * physical memory until the kernel virtual memory starts. That means that
  31. * any out-of-bounds memory accesses will hopefully be caught.
  32. * The vmalloc() routines leaves a hole of 4kB between each vmalloced
  33. * area for the same reason. ;)
  34. */
  35. extern unsigned long end_iomem;
  36. #define VMALLOC_OFFSET (__va_space)
  37. #define VMALLOC_START ((end_iomem + VMALLOC_OFFSET) & ~(VMALLOC_OFFSET-1))
  38. #define PKMAP_BASE ((FIXADDR_START - LAST_PKMAP * PAGE_SIZE) & PMD_MASK)
  39. #define VMALLOC_END (FIXADDR_START-2*PAGE_SIZE)
  40. #define MODULES_VADDR VMALLOC_START
  41. #define MODULES_END VMALLOC_END
  42. #define MODULES_LEN (MODULES_VADDR - MODULES_END)
  43. #define _PAGE_TABLE (_PAGE_PRESENT | _PAGE_RW | _PAGE_USER | _PAGE_ACCESSED | _PAGE_DIRTY)
  44. #define _KERNPG_TABLE (_PAGE_PRESENT | _PAGE_RW | _PAGE_ACCESSED | _PAGE_DIRTY)
  45. #define _PAGE_CHG_MASK (PAGE_MASK | _PAGE_ACCESSED | _PAGE_DIRTY)
  46. #define __PAGE_KERNEL_EXEC \
  47. (_PAGE_PRESENT | _PAGE_RW | _PAGE_DIRTY | _PAGE_ACCESSED)
  48. #define PAGE_NONE __pgprot(_PAGE_PROTNONE | _PAGE_ACCESSED)
  49. #define PAGE_SHARED __pgprot(_PAGE_PRESENT | _PAGE_RW | _PAGE_USER | _PAGE_ACCESSED)
  50. #define PAGE_COPY __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_ACCESSED)
  51. #define PAGE_READONLY __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_ACCESSED)
  52. #define PAGE_KERNEL __pgprot(_PAGE_PRESENT | _PAGE_RW | _PAGE_DIRTY | _PAGE_ACCESSED)
  53. #define PAGE_KERNEL_EXEC __pgprot(__PAGE_KERNEL_EXEC)
  54. /*
  55. * The i386 can't do page protection for execute, and considers that the same
  56. * are read.
  57. * Also, write permissions imply read permissions. This is the closest we can
  58. * get..
  59. */
  60. /*
  61. * ZERO_PAGE is a global shared page that is always zero: used
  62. * for zero-mapped memory areas etc..
  63. */
  64. #define ZERO_PAGE(vaddr) virt_to_page(empty_zero_page)
  65. #define pte_clear(mm,addr,xp) pte_set_val(*(xp), (phys_t) 0, __pgprot(_PAGE_NEWPAGE))
  66. #define pmd_none(x) (!((unsigned long)pmd_val(x) & ~_PAGE_NEWPAGE))
  67. #define pmd_bad(x) ((pmd_val(x) & (~PAGE_MASK & ~_PAGE_USER)) != _KERNPG_TABLE)
  68. #define pmd_present(x) (pmd_val(x) & _PAGE_PRESENT)
  69. #define pmd_clear(xp) do { pmd_val(*(xp)) = _PAGE_NEWPAGE; } while (0)
  70. #define pmd_newpage(x) (pmd_val(x) & _PAGE_NEWPAGE)
  71. #define pmd_mkuptodate(x) (pmd_val(x) &= ~_PAGE_NEWPAGE)
  72. #define pud_newpage(x) (pud_val(x) & _PAGE_NEWPAGE)
  73. #define pud_mkuptodate(x) (pud_val(x) &= ~_PAGE_NEWPAGE)
  74. #define p4d_newpage(x) (p4d_val(x) & _PAGE_NEWPAGE)
  75. #define p4d_mkuptodate(x) (p4d_val(x) &= ~_PAGE_NEWPAGE)
  76. #define pmd_pfn(pmd) (pmd_val(pmd) >> PAGE_SHIFT)
  77. #define pmd_page(pmd) phys_to_page(pmd_val(pmd) & PAGE_MASK)
  78. #define pte_page(x) pfn_to_page(pte_pfn(x))
  79. #define pte_present(x) pte_get_bits(x, (_PAGE_PRESENT | _PAGE_PROTNONE))
  80. /*
  81. * =================================
  82. * Flags checking section.
  83. * =================================
  84. */
  85. static inline int pte_none(pte_t pte)
  86. {
  87. return pte_is_zero(pte);
  88. }
  89. /*
  90. * The following only work if pte_present() is true.
  91. * Undefined behaviour if not..
  92. */
  93. static inline int pte_read(pte_t pte)
  94. {
  95. return((pte_get_bits(pte, _PAGE_USER)) &&
  96. !(pte_get_bits(pte, _PAGE_PROTNONE)));
  97. }
  98. static inline int pte_exec(pte_t pte){
  99. return((pte_get_bits(pte, _PAGE_USER)) &&
  100. !(pte_get_bits(pte, _PAGE_PROTNONE)));
  101. }
  102. static inline int pte_write(pte_t pte)
  103. {
  104. return((pte_get_bits(pte, _PAGE_RW)) &&
  105. !(pte_get_bits(pte, _PAGE_PROTNONE)));
  106. }
  107. static inline int pte_dirty(pte_t pte)
  108. {
  109. return pte_get_bits(pte, _PAGE_DIRTY);
  110. }
  111. static inline int pte_young(pte_t pte)
  112. {
  113. return pte_get_bits(pte, _PAGE_ACCESSED);
  114. }
  115. static inline int pte_newpage(pte_t pte)
  116. {
  117. return pte_get_bits(pte, _PAGE_NEWPAGE);
  118. }
  119. static inline int pte_newprot(pte_t pte)
  120. {
  121. return(pte_present(pte) && (pte_get_bits(pte, _PAGE_NEWPROT)));
  122. }
  123. /*
  124. * =================================
  125. * Flags setting section.
  126. * =================================
  127. */
  128. static inline pte_t pte_mknewprot(pte_t pte)
  129. {
  130. pte_set_bits(pte, _PAGE_NEWPROT);
  131. return(pte);
  132. }
  133. static inline pte_t pte_mkclean(pte_t pte)
  134. {
  135. pte_clear_bits(pte, _PAGE_DIRTY);
  136. return(pte);
  137. }
  138. static inline pte_t pte_mkold(pte_t pte)
  139. {
  140. pte_clear_bits(pte, _PAGE_ACCESSED);
  141. return(pte);
  142. }
  143. static inline pte_t pte_wrprotect(pte_t pte)
  144. {
  145. if (likely(pte_get_bits(pte, _PAGE_RW)))
  146. pte_clear_bits(pte, _PAGE_RW);
  147. else
  148. return pte;
  149. return(pte_mknewprot(pte));
  150. }
  151. static inline pte_t pte_mkread(pte_t pte)
  152. {
  153. if (unlikely(pte_get_bits(pte, _PAGE_USER)))
  154. return pte;
  155. pte_set_bits(pte, _PAGE_USER);
  156. return(pte_mknewprot(pte));
  157. }
  158. static inline pte_t pte_mkdirty(pte_t pte)
  159. {
  160. pte_set_bits(pte, _PAGE_DIRTY);
  161. return(pte);
  162. }
  163. static inline pte_t pte_mkyoung(pte_t pte)
  164. {
  165. pte_set_bits(pte, _PAGE_ACCESSED);
  166. return(pte);
  167. }
  168. static inline pte_t pte_mkwrite(pte_t pte)
  169. {
  170. if (unlikely(pte_get_bits(pte, _PAGE_RW)))
  171. return pte;
  172. pte_set_bits(pte, _PAGE_RW);
  173. return(pte_mknewprot(pte));
  174. }
  175. static inline pte_t pte_mkuptodate(pte_t pte)
  176. {
  177. pte_clear_bits(pte, _PAGE_NEWPAGE);
  178. if(pte_present(pte))
  179. pte_clear_bits(pte, _PAGE_NEWPROT);
  180. return(pte);
  181. }
  182. static inline pte_t pte_mknewpage(pte_t pte)
  183. {
  184. pte_set_bits(pte, _PAGE_NEWPAGE);
  185. return(pte);
  186. }
  187. static inline void set_pte(pte_t *pteptr, pte_t pteval)
  188. {
  189. pte_copy(*pteptr, pteval);
  190. /* If it's a swap entry, it needs to be marked _PAGE_NEWPAGE so
  191. * fix_range knows to unmap it. _PAGE_NEWPROT is specific to
  192. * mapped pages.
  193. */
  194. *pteptr = pte_mknewpage(*pteptr);
  195. if(pte_present(*pteptr)) *pteptr = pte_mknewprot(*pteptr);
  196. }
  197. static inline void set_pte_at(struct mm_struct *mm, unsigned long addr,
  198. pte_t *pteptr, pte_t pteval)
  199. {
  200. set_pte(pteptr, pteval);
  201. }
  202. #define __HAVE_ARCH_PTE_SAME
  203. static inline int pte_same(pte_t pte_a, pte_t pte_b)
  204. {
  205. return !((pte_val(pte_a) ^ pte_val(pte_b)) & ~_PAGE_NEWPAGE);
  206. }
  207. /*
  208. * Conversion functions: convert a page and protection to a page entry,
  209. * and a page entry and page directory to the page they refer to.
  210. */
  211. #define phys_to_page(phys) pfn_to_page(phys_to_pfn(phys))
  212. #define __virt_to_page(virt) phys_to_page(__pa(virt))
  213. #define page_to_phys(page) pfn_to_phys(page_to_pfn(page))
  214. #define virt_to_page(addr) __virt_to_page((const unsigned long) addr)
  215. #define mk_pte(page, pgprot) \
  216. ({ pte_t pte; \
  217. \
  218. pte_set_val(pte, page_to_phys(page), (pgprot)); \
  219. if (pte_present(pte)) \
  220. pte_mknewprot(pte_mknewpage(pte)); \
  221. pte;})
  222. static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
  223. {
  224. pte_set_val(pte, (pte_val(pte) & _PAGE_CHG_MASK), newprot);
  225. return pte;
  226. }
  227. /*
  228. * the pmd page can be thought of an array like this: pmd_t[PTRS_PER_PMD]
  229. *
  230. * this macro returns the index of the entry in the pmd page which would
  231. * control the given virtual address
  232. */
  233. #define pmd_page_vaddr(pmd) ((unsigned long) __va(pmd_val(pmd) & PAGE_MASK))
  234. struct mm_struct;
  235. extern pte_t *virt_to_pte(struct mm_struct *mm, unsigned long addr);
  236. #define update_mmu_cache(vma,address,ptep) do {} while (0)
  237. /* Encode and de-code a swap entry */
  238. #define __swp_type(x) (((x).val >> 5) & 0x1f)
  239. #define __swp_offset(x) ((x).val >> 11)
  240. #define __swp_entry(type, offset) \
  241. ((swp_entry_t) { ((type) << 5) | ((offset) << 11) })
  242. #define __pte_to_swp_entry(pte) \
  243. ((swp_entry_t) { pte_val(pte_mkuptodate(pte)) })
  244. #define __swp_entry_to_pte(x) ((pte_t) { (x).val })
  245. #define kern_addr_valid(addr) (1)
  246. /* Clear a kernel PTE and flush it from the TLB */
  247. #define kpte_clear_flush(ptep, vaddr) \
  248. do { \
  249. pte_clear(&init_mm, (vaddr), (ptep)); \
  250. __flush_tlb_one((vaddr)); \
  251. } while (0)
  252. #endif