pgtable.h 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433
  1. /*
  2. * linux/include/asm-arm/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 <asm-generic/4level-fixup.h>
  13. #include <asm/memory.h>
  14. #include <asm/proc-fns.h>
  15. #include <asm/arch/vmalloc.h>
  16. /*
  17. * Hardware-wise, we have a two level page table structure, where the first
  18. * level has 4096 entries, and the second level has 256 entries. Each entry
  19. * is one 32-bit word. Most of the bits in the second level entry are used
  20. * by hardware, and there aren't any "accessed" and "dirty" bits.
  21. *
  22. * Linux on the other hand has a three level page table structure, which can
  23. * be wrapped to fit a two level page table structure easily - using the PGD
  24. * and PTE only. However, Linux also expects one "PTE" table per page, and
  25. * at least a "dirty" bit.
  26. *
  27. * Therefore, we tweak the implementation slightly - we tell Linux that we
  28. * have 2048 entries in the first level, each of which is 8 bytes (iow, two
  29. * hardware pointers to the second level.) The second level contains two
  30. * hardware PTE tables arranged contiguously, followed by Linux versions
  31. * which contain the state information Linux needs. We, therefore, end up
  32. * with 512 entries in the "PTE" level.
  33. *
  34. * This leads to the page tables having the following layout:
  35. *
  36. * pgd pte
  37. * | |
  38. * +--------+ +0
  39. * | |-----> +------------+ +0
  40. * +- - - - + +4 | h/w pt 0 |
  41. * | |-----> +------------+ +1024
  42. * +--------+ +8 | h/w pt 1 |
  43. * | | +------------+ +2048
  44. * +- - - - + | Linux pt 0 |
  45. * | | +------------+ +3072
  46. * +--------+ | Linux pt 1 |
  47. * | | +------------+ +4096
  48. *
  49. * See L_PTE_xxx below for definitions of bits in the "Linux pt", and
  50. * PTE_xxx for definitions of bits appearing in the "h/w pt".
  51. *
  52. * PMD_xxx definitions refer to bits in the first level page table.
  53. *
  54. * The "dirty" bit is emulated by only granting hardware write permission
  55. * iff the page is marked "writable" and "dirty" in the Linux PTE. This
  56. * means that a write to a clean page will cause a permission fault, and
  57. * the Linux MM layer will mark the page dirty via handle_pte_fault().
  58. * For the hardware to notice the permission change, the TLB entry must
  59. * be flushed, and ptep_establish() does that for us.
  60. *
  61. * The "accessed" or "young" bit is emulated by a similar method; we only
  62. * allow accesses to the page if the "young" bit is set. Accesses to the
  63. * page will cause a fault, and handle_pte_fault() will set the young bit
  64. * for us as long as the page is marked present in the corresponding Linux
  65. * PTE entry. Again, ptep_establish() will ensure that the TLB is up to
  66. * date.
  67. *
  68. * However, when the "young" bit is cleared, we deny access to the page
  69. * by clearing the hardware PTE. Currently Linux does not flush the TLB
  70. * for us in this case, which means the TLB will retain the transation
  71. * until either the TLB entry is evicted under pressure, or a context
  72. * switch which changes the user space mapping occurs.
  73. */
  74. #define PTRS_PER_PTE 512
  75. #define PTRS_PER_PMD 1
  76. #define PTRS_PER_PGD 2048
  77. /*
  78. * PMD_SHIFT determines the size of the area a second-level page table can map
  79. * PGDIR_SHIFT determines what a third-level page table entry can map
  80. */
  81. #define PMD_SHIFT 21
  82. #define PGDIR_SHIFT 21
  83. #define LIBRARY_TEXT_START 0x0c000000
  84. #ifndef __ASSEMBLY__
  85. extern void __pte_error(const char *file, int line, unsigned long val);
  86. extern void __pmd_error(const char *file, int line, unsigned long val);
  87. extern void __pgd_error(const char *file, int line, unsigned long val);
  88. #define pte_ERROR(pte) __pte_error(__FILE__, __LINE__, pte_val(pte))
  89. #define pmd_ERROR(pmd) __pmd_error(__FILE__, __LINE__, pmd_val(pmd))
  90. #define pgd_ERROR(pgd) __pgd_error(__FILE__, __LINE__, pgd_val(pgd))
  91. #endif /* !__ASSEMBLY__ */
  92. #define PMD_SIZE (1UL << PMD_SHIFT)
  93. #define PMD_MASK (~(PMD_SIZE-1))
  94. #define PGDIR_SIZE (1UL << PGDIR_SHIFT)
  95. #define PGDIR_MASK (~(PGDIR_SIZE-1))
  96. #define FIRST_USER_PGD_NR 1
  97. #define USER_PTRS_PER_PGD ((TASK_SIZE/PGDIR_SIZE) - FIRST_USER_PGD_NR)
  98. /*
  99. * ARMv6 supersection address mask and size definitions.
  100. */
  101. #define SUPERSECTION_SHIFT 24
  102. #define SUPERSECTION_SIZE (1UL << SUPERSECTION_SHIFT)
  103. #define SUPERSECTION_MASK (~(SUPERSECTION_SIZE-1))
  104. /*
  105. * Hardware page table definitions.
  106. *
  107. * + Level 1 descriptor (PMD)
  108. * - common
  109. */
  110. #define PMD_TYPE_MASK (3 << 0)
  111. #define PMD_TYPE_FAULT (0 << 0)
  112. #define PMD_TYPE_TABLE (1 << 0)
  113. #define PMD_TYPE_SECT (2 << 0)
  114. #define PMD_BIT4 (1 << 4)
  115. #define PMD_DOMAIN(x) ((x) << 5)
  116. #define PMD_PROTECTION (1 << 9) /* v5 */
  117. /*
  118. * - section
  119. */
  120. #define PMD_SECT_BUFFERABLE (1 << 2)
  121. #define PMD_SECT_CACHEABLE (1 << 3)
  122. #define PMD_SECT_AP_WRITE (1 << 10)
  123. #define PMD_SECT_AP_READ (1 << 11)
  124. #define PMD_SECT_TEX(x) ((x) << 12) /* v5 */
  125. #define PMD_SECT_APX (1 << 15) /* v6 */
  126. #define PMD_SECT_S (1 << 16) /* v6 */
  127. #define PMD_SECT_nG (1 << 17) /* v6 */
  128. #define PMD_SECT_SUPER (1 << 18) /* v6 */
  129. #define PMD_SECT_UNCACHED (0)
  130. #define PMD_SECT_BUFFERED (PMD_SECT_BUFFERABLE)
  131. #define PMD_SECT_WT (PMD_SECT_CACHEABLE)
  132. #define PMD_SECT_WB (PMD_SECT_CACHEABLE | PMD_SECT_BUFFERABLE)
  133. #define PMD_SECT_MINICACHE (PMD_SECT_TEX(1) | PMD_SECT_CACHEABLE)
  134. #define PMD_SECT_WBWA (PMD_SECT_TEX(1) | PMD_SECT_CACHEABLE | PMD_SECT_BUFFERABLE)
  135. /*
  136. * - coarse table (not used)
  137. */
  138. /*
  139. * + Level 2 descriptor (PTE)
  140. * - common
  141. */
  142. #define PTE_TYPE_MASK (3 << 0)
  143. #define PTE_TYPE_FAULT (0 << 0)
  144. #define PTE_TYPE_LARGE (1 << 0)
  145. #define PTE_TYPE_SMALL (2 << 0)
  146. #define PTE_TYPE_EXT (3 << 0) /* v5 */
  147. #define PTE_BUFFERABLE (1 << 2)
  148. #define PTE_CACHEABLE (1 << 3)
  149. /*
  150. * - extended small page/tiny page
  151. */
  152. #define PTE_EXT_AP_MASK (3 << 4)
  153. #define PTE_EXT_AP_UNO_SRO (0 << 4)
  154. #define PTE_EXT_AP_UNO_SRW (1 << 4)
  155. #define PTE_EXT_AP_URO_SRW (2 << 4)
  156. #define PTE_EXT_AP_URW_SRW (3 << 4)
  157. #define PTE_EXT_TEX(x) ((x) << 6) /* v5 */
  158. /*
  159. * - small page
  160. */
  161. #define PTE_SMALL_AP_MASK (0xff << 4)
  162. #define PTE_SMALL_AP_UNO_SRO (0x00 << 4)
  163. #define PTE_SMALL_AP_UNO_SRW (0x55 << 4)
  164. #define PTE_SMALL_AP_URO_SRW (0xaa << 4)
  165. #define PTE_SMALL_AP_URW_SRW (0xff << 4)
  166. /*
  167. * "Linux" PTE definitions.
  168. *
  169. * We keep two sets of PTEs - the hardware and the linux version.
  170. * This allows greater flexibility in the way we map the Linux bits
  171. * onto the hardware tables, and allows us to have YOUNG and DIRTY
  172. * bits.
  173. *
  174. * The PTE table pointer refers to the hardware entries; the "Linux"
  175. * entries are stored 1024 bytes below.
  176. */
  177. #define L_PTE_PRESENT (1 << 0)
  178. #define L_PTE_FILE (1 << 1) /* only when !PRESENT */
  179. #define L_PTE_YOUNG (1 << 1)
  180. #define L_PTE_BUFFERABLE (1 << 2) /* matches PTE */
  181. #define L_PTE_CACHEABLE (1 << 3) /* matches PTE */
  182. #define L_PTE_USER (1 << 4)
  183. #define L_PTE_WRITE (1 << 5)
  184. #define L_PTE_EXEC (1 << 6)
  185. #define L_PTE_DIRTY (1 << 7)
  186. #ifndef __ASSEMBLY__
  187. #include <asm/domain.h>
  188. #define _PAGE_USER_TABLE (PMD_TYPE_TABLE | PMD_BIT4 | PMD_DOMAIN(DOMAIN_USER))
  189. #define _PAGE_KERNEL_TABLE (PMD_TYPE_TABLE | PMD_BIT4 | PMD_DOMAIN(DOMAIN_KERNEL))
  190. /*
  191. * The following macros handle the cache and bufferable bits...
  192. */
  193. #define _L_PTE_DEFAULT L_PTE_PRESENT | L_PTE_YOUNG | L_PTE_CACHEABLE | L_PTE_BUFFERABLE
  194. #define _L_PTE_READ L_PTE_USER | L_PTE_EXEC
  195. extern pgprot_t pgprot_kernel;
  196. #define PAGE_NONE __pgprot(_L_PTE_DEFAULT)
  197. #define PAGE_COPY __pgprot(_L_PTE_DEFAULT | _L_PTE_READ)
  198. #define PAGE_SHARED __pgprot(_L_PTE_DEFAULT | _L_PTE_READ | L_PTE_WRITE)
  199. #define PAGE_READONLY __pgprot(_L_PTE_DEFAULT | _L_PTE_READ)
  200. #define PAGE_KERNEL pgprot_kernel
  201. #endif /* __ASSEMBLY__ */
  202. /*
  203. * The table below defines the page protection levels that we insert into our
  204. * Linux page table version. These get translated into the best that the
  205. * architecture can perform. Note that on most ARM hardware:
  206. * 1) We cannot do execute protection
  207. * 2) If we could do execute protection, then read is implied
  208. * 3) write implies read permissions
  209. */
  210. #define __P000 PAGE_NONE
  211. #define __P001 PAGE_READONLY
  212. #define __P010 PAGE_COPY
  213. #define __P011 PAGE_COPY
  214. #define __P100 PAGE_READONLY
  215. #define __P101 PAGE_READONLY
  216. #define __P110 PAGE_COPY
  217. #define __P111 PAGE_COPY
  218. #define __S000 PAGE_NONE
  219. #define __S001 PAGE_READONLY
  220. #define __S010 PAGE_SHARED
  221. #define __S011 PAGE_SHARED
  222. #define __S100 PAGE_READONLY
  223. #define __S101 PAGE_READONLY
  224. #define __S110 PAGE_SHARED
  225. #define __S111 PAGE_SHARED
  226. #ifndef __ASSEMBLY__
  227. /*
  228. * ZERO_PAGE is a global shared page that is always zero: used
  229. * for zero-mapped memory areas etc..
  230. */
  231. extern struct page *empty_zero_page;
  232. #define ZERO_PAGE(vaddr) (empty_zero_page)
  233. #define pte_pfn(pte) (pte_val(pte) >> PAGE_SHIFT)
  234. #define pfn_pte(pfn,prot) (__pte(((pfn) << PAGE_SHIFT) | pgprot_val(prot)))
  235. #define pte_none(pte) (!pte_val(pte))
  236. #define pte_clear(mm,addr,ptep) set_pte_at((mm),(addr),(ptep), __pte(0))
  237. #define pte_page(pte) (pfn_to_page(pte_pfn(pte)))
  238. #define pte_offset_kernel(dir,addr) (pmd_page_kernel(*(dir)) + __pte_index(addr))
  239. #define pte_offset_map(dir,addr) (pmd_page_kernel(*(dir)) + __pte_index(addr))
  240. #define pte_offset_map_nested(dir,addr) (pmd_page_kernel(*(dir)) + __pte_index(addr))
  241. #define pte_unmap(pte) do { } while (0)
  242. #define pte_unmap_nested(pte) do { } while (0)
  243. #define set_pte(ptep, pte) cpu_set_pte(ptep,pte)
  244. #define set_pte_at(mm,addr,ptep,pteval) set_pte(ptep,pteval)
  245. /*
  246. * The following only work if pte_present() is true.
  247. * Undefined behaviour if not..
  248. */
  249. #define pte_present(pte) (pte_val(pte) & L_PTE_PRESENT)
  250. #define pte_read(pte) (pte_val(pte) & L_PTE_USER)
  251. #define pte_write(pte) (pte_val(pte) & L_PTE_WRITE)
  252. #define pte_exec(pte) (pte_val(pte) & L_PTE_EXEC)
  253. #define pte_dirty(pte) (pte_val(pte) & L_PTE_DIRTY)
  254. #define pte_young(pte) (pte_val(pte) & L_PTE_YOUNG)
  255. /*
  256. * The following only works if pte_present() is not true.
  257. */
  258. #define pte_file(pte) (pte_val(pte) & L_PTE_FILE)
  259. #define pte_to_pgoff(x) (pte_val(x) >> 2)
  260. #define pgoff_to_pte(x) __pte(((x) << 2) | L_PTE_FILE)
  261. #define PTE_FILE_MAX_BITS 30
  262. #define PTE_BIT_FUNC(fn,op) \
  263. static inline pte_t pte_##fn(pte_t pte) { pte_val(pte) op; return pte; }
  264. /*PTE_BIT_FUNC(rdprotect, &= ~L_PTE_USER);*/
  265. /*PTE_BIT_FUNC(mkread, |= L_PTE_USER);*/
  266. PTE_BIT_FUNC(wrprotect, &= ~L_PTE_WRITE);
  267. PTE_BIT_FUNC(mkwrite, |= L_PTE_WRITE);
  268. PTE_BIT_FUNC(exprotect, &= ~L_PTE_EXEC);
  269. PTE_BIT_FUNC(mkexec, |= L_PTE_EXEC);
  270. PTE_BIT_FUNC(mkclean, &= ~L_PTE_DIRTY);
  271. PTE_BIT_FUNC(mkdirty, |= L_PTE_DIRTY);
  272. PTE_BIT_FUNC(mkold, &= ~L_PTE_YOUNG);
  273. PTE_BIT_FUNC(mkyoung, |= L_PTE_YOUNG);
  274. /*
  275. * Mark the prot value as uncacheable and unbufferable.
  276. */
  277. #define pgprot_noncached(prot) __pgprot(pgprot_val(prot) & ~(L_PTE_CACHEABLE | L_PTE_BUFFERABLE))
  278. #define pgprot_writecombine(prot) __pgprot(pgprot_val(prot) & ~L_PTE_CACHEABLE)
  279. #define pmd_none(pmd) (!pmd_val(pmd))
  280. #define pmd_present(pmd) (pmd_val(pmd))
  281. #define pmd_bad(pmd) (pmd_val(pmd) & 2)
  282. #define copy_pmd(pmdpd,pmdps) \
  283. do { \
  284. pmdpd[0] = pmdps[0]; \
  285. pmdpd[1] = pmdps[1]; \
  286. flush_pmd_entry(pmdpd); \
  287. } while (0)
  288. #define pmd_clear(pmdp) \
  289. do { \
  290. pmdp[0] = __pmd(0); \
  291. pmdp[1] = __pmd(0); \
  292. clean_pmd_entry(pmdp); \
  293. } while (0)
  294. static inline pte_t *pmd_page_kernel(pmd_t pmd)
  295. {
  296. unsigned long ptr;
  297. ptr = pmd_val(pmd) & ~(PTRS_PER_PTE * sizeof(void *) - 1);
  298. ptr += PTRS_PER_PTE * sizeof(void *);
  299. return __va(ptr);
  300. }
  301. #define pmd_page(pmd) virt_to_page(__va(pmd_val(pmd)))
  302. /*
  303. * Permanent address of a page. We never have highmem, so this is trivial.
  304. */
  305. #define pages_to_mb(x) ((x) >> (20 - PAGE_SHIFT))
  306. /*
  307. * Conversion functions: convert a page and protection to a page entry,
  308. * and a page entry and page directory to the page they refer to.
  309. */
  310. #define mk_pte(page,prot) pfn_pte(page_to_pfn(page),prot)
  311. /*
  312. * The "pgd_xxx()" functions here are trivial for a folded two-level
  313. * setup: the pgd is never bad, and a pmd always exists (as it's folded
  314. * into the pgd entry)
  315. */
  316. #define pgd_none(pgd) (0)
  317. #define pgd_bad(pgd) (0)
  318. #define pgd_present(pgd) (1)
  319. #define pgd_clear(pgdp) do { } while (0)
  320. #define set_pgd(pgd,pgdp) do { } while (0)
  321. #define page_pte_prot(page,prot) mk_pte(page, prot)
  322. #define page_pte(page) mk_pte(page, __pgprot(0))
  323. /* to find an entry in a page-table-directory */
  324. #define pgd_index(addr) ((addr) >> PGDIR_SHIFT)
  325. #define pgd_offset(mm, addr) ((mm)->pgd+pgd_index(addr))
  326. /* to find an entry in a kernel page-table-directory */
  327. #define pgd_offset_k(addr) pgd_offset(&init_mm, addr)
  328. /* Find an entry in the second-level page table.. */
  329. #define pmd_offset(dir, addr) ((pmd_t *)(dir))
  330. /* Find an entry in the third-level page table.. */
  331. #define __pte_index(addr) (((addr) >> PAGE_SHIFT) & (PTRS_PER_PTE - 1))
  332. static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
  333. {
  334. const unsigned long mask = L_PTE_EXEC | L_PTE_WRITE | L_PTE_USER;
  335. pte_val(pte) = (pte_val(pte) & ~mask) | (pgprot_val(newprot) & mask);
  336. return pte;
  337. }
  338. extern pgd_t swapper_pg_dir[PTRS_PER_PGD];
  339. /* Encode and decode a swap entry.
  340. *
  341. * We support up to 32GB of swap on 4k machines
  342. */
  343. #define __swp_type(x) (((x).val >> 2) & 0x7f)
  344. #define __swp_offset(x) ((x).val >> 9)
  345. #define __swp_entry(type,offset) ((swp_entry_t) { ((type) << 2) | ((offset) << 9) })
  346. #define __pte_to_swp_entry(pte) ((swp_entry_t) { pte_val(pte) })
  347. #define __swp_entry_to_pte(swp) ((pte_t) { (swp).val })
  348. /* Needs to be defined here and not in linux/mm.h, as it is arch dependent */
  349. /* FIXME: this is not correct */
  350. #define kern_addr_valid(addr) (1)
  351. #include <asm-generic/pgtable.h>
  352. /*
  353. * We provide our own arch_get_unmapped_area to cope with VIPT caches.
  354. */
  355. #define HAVE_ARCH_UNMAPPED_AREA
  356. /*
  357. * remap a physical address `phys' of size `size' with page protection `prot'
  358. * into virtual address `from'
  359. */
  360. #define io_remap_page_range(vma,from,phys,size,prot) \
  361. remap_pfn_range(vma, from, (phys) >> PAGE_SHIFT, size, prot)
  362. #define io_remap_pfn_range(vma,from,pfn,size,prot) \
  363. remap_pfn_range(vma, from, pfn, size, prot)
  364. #define MK_IOSPACE_PFN(space, pfn) (pfn)
  365. #define GET_IOSPACE(pfn) 0
  366. #define GET_PFN(pfn) (pfn)
  367. #define pgtable_cache_init() do { } while (0)
  368. #endif /* !__ASSEMBLY__ */
  369. #endif /* _ASMARM_PGTABLE_H */