hiddenDangerAnalysis.h 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211
  1. /*
  2. * This file is subject to the terms and conditions of the GNU General Public
  3. * License. See the file "COPYING" in the main directory of this archive
  4. * for more details.
  5. *
  6. * Copyright (C) 1994, 95, 96, 97, 98, 99, 2000, 2003 Ralf Baechle
  7. * Copyright (C) 1999, 2000, 2001 Silicon Graphics, Inc.
  8. */
  9. #ifndef _ASM_PGTABLE_64_H
  10. #define _ASM_PGTABLE_64_H
  11. #include <linux/compiler.h>
  12. #include <linux/linkage.h>
  13. #include <asm/addrspace.h>
  14. #include <asm/page.h>
  15. #include <asm/cachectl.h>
  16. #include <asm/fixmap.h>
  17. #ifdef CONFIG_PAGE_SIZE_64KB
  18. #include <asm-generic/pgtable-nopmd.h>
  19. #else
  20. #include <asm-generic/pgtable-nopud.h>
  21. #endif
  22. /*
  23. * Each address space has 2 4K pages as its page directory, giving 1024
  24. * (== PTRS_PER_PGD) 8 byte pointers to pmd tables. Each pmd table is a
  25. * single 4K page, giving 512 (== PTRS_PER_PMD) 8 byte pointers to page
  26. * tables. Each page table is also a single 4K page, giving 512 (==
  27. * PTRS_PER_PTE) 8 byte ptes. Each pud entry is initialized to point to
  28. * invalid_pmd_table, each pmd entry is initialized to point to
  29. * invalid_pte_table, each pte is initialized to 0. When memory is low,
  30. * and a pmd table or a page table allocation fails, empty_bad_pmd_table
  31. * and empty_bad_page_table is returned back to higher layer code, so
  32. * that the failure is recognized later on. Linux does not seem to
  33. * handle these failures very well though. The empty_bad_page_table has
  34. * invalid pte entries in it, to force page faults.
  35. *
  36. * Kernel mappings: kernel mappings are held in the swapper_pg_table.
  37. * The layout is identical to userspace except it's indexed with the
  38. * fault address - VMALLOC_START.
  39. */
  40. /* PGDIR_SHIFT determines what a third-level page table entry can map */
  41. #ifdef __PAGETABLE_PMD_FOLDED
  42. #define PGDIR_SHIFT (PAGE_SHIFT + PAGE_SHIFT + PTE_ORDER - 3)
  43. #else
  44. /* PMD_SHIFT determines the size of the area a second-level page table can map */
  45. #define PMD_SHIFT (PAGE_SHIFT + (PAGE_SHIFT + PTE_ORDER - 3))
  46. #define PMD_SIZE (1UL << PMD_SHIFT)
  47. #define PMD_MASK (~(PMD_SIZE-1))
  48. #define PGDIR_SHIFT (PMD_SHIFT + (PAGE_SHIFT + PMD_ORDER - 3))
  49. #endif
  50. #define PGDIR_SIZE (1UL << PGDIR_SHIFT)
  51. #define PGDIR_MASK (~(PGDIR_SIZE-1))
  52. /*
  53. * For 4kB page size we use a 3 level page tree and an 8kB pud, which
  54. * permits us mapping 40 bits of virtual address space.
  55. *
  56. * We used to implement 41 bits by having an order 1 pmd level but that seemed
  57. * rather pointless.
  58. *
  59. * For 8kB page size we use a 3 level page tree which permits a total of
  60. * 8TB of address space. Alternatively a 33-bit / 8GB organization using
  61. * two levels would be easy to implement.
  62. *
  63. * For 16kB page size we use a 2 level page tree which permits a total of
  64. * 36 bits of virtual address space. We could add a third level but it seems
  65. * like at the moment there's no need for this.
  66. *
  67. * For 64kB page size we use a 2 level page table tree for a total of 42 bits
  68. * of virtual address space.
  69. */
  70. #ifdef CONFIG_PAGE_SIZE_4KB
  71. #define PGD_ORDER 1
  72. #define PUD_ORDER aieeee_attempt_to_allocate_pud
  73. #define PMD_ORDER 0
  74. #define PTE_ORDER 0
  75. #endif
  76. #ifdef CONFIG_PAGE_SIZE_8KB
  77. #define PGD_ORDER 0
  78. #define PUD_ORDER aieeee_attempt_to_allocate_pud
  79. #define PMD_ORDER 0
  80. #define PTE_ORDER 0
  81. #endif
  82. #ifdef CONFIG_PAGE_SIZE_16KB
  83. #define PGD_ORDER 0
  84. #define PUD_ORDER aieeee_attempt_to_allocate_pud
  85. #define PMD_ORDER 0
  86. #define PTE_ORDER 0
  87. #endif
  88. #ifdef CONFIG_PAGE_SIZE_32KB
  89. #define PGD_ORDER 0
  90. #define PUD_ORDER aieeee_attempt_to_allocate_pud
  91. #define PMD_ORDER 0
  92. #define PTE_ORDER 0
  93. #endif
  94. #ifdef CONFIG_PAGE_SIZE_64KB
  95. #define PGD_ORDER 0
  96. #define PUD_ORDER aieeee_attempt_to_allocate_pud
  97. #define PMD_ORDER aieeee_attempt_to_allocate_pmd
  98. #define PTE_ORDER 0
  99. #endif
  100. #define PTRS_PER_PGD ((PAGE_SIZE << PGD_ORDER) / sizeof(pgd_t))
  101. #ifndef __PAGETABLE_PMD_FOLDED
  102. #define PTRS_PER_PMD ((PAGE_SIZE << PMD_ORDER) / sizeof(pmd_t))
  103. #endif
  104. #define PTRS_PER_PTE ((PAGE_SIZE << PTE_ORDER) / sizeof(pte_t))
  105. #if PGDIR_SIZE >= TASK_SIZE64
  106. #define USER_PTRS_PER_PGD (1)
  107. #else
  108. #define USER_PTRS_PER_PGD (TASK_SIZE64 / PGDIR_SIZE)
  109. #endif
  110. #define FIRST_USER_ADDRESS 0UL
  111. /*
  112. * TLB refill handlers also map the vmalloc area into xuseg. Avoid
  113. * the first couple of pages so NULL pointer dereferences will still
  114. * reliably trap.
  115. */
  116. #define VMALLOC_START (MAP_BASE + (2 * PAGE_SIZE))
  117. #define VMALLOC_END \
  118. (MAP_BASE + \
  119. min(PTRS_PER_PGD * PTRS_PER_PMD * PTRS_PER_PTE * PAGE_SIZE, \
  120. (1UL << cpu_vmbits)) - (1UL << 32))
  121. #if defined(CONFIG_MODULES) && defined(KBUILD_64BIT_SYM32) && \
  122. VMALLOC_START != CKSSEG
  123. /* Load modules into 32bit-compatible segment. */
  124. #define MODULE_START CKSSEG
  125. #define MODULE_END (FIXADDR_START-2*PAGE_SIZE)
  126. #endif
  127. #define pte_ERROR(e) \
  128. printk("%s:%d: bad pte %016lx.\n", __FILE__, __LINE__, pte_val(e))
  129. #ifndef __PAGETABLE_PMD_FOLDED
  130. #define pmd_ERROR(e) \
  131. printk("%s:%d: bad pmd %016lx.\n", __FILE__, __LINE__, pmd_val(e))
  132. #endif
  133. #define pgd_ERROR(e) \
  134. printk("%s:%d: bad pgd %016lx.\n", __FILE__, __LINE__, pgd_val(e))
  135. extern pte_t invalid_pte_table[PTRS_PER_PTE];
  136. extern pte_t empty_bad_page_table[PTRS_PER_PTE];
  137. #ifndef __PAGETABLE_PMD_FOLDED
  138. /*
  139. * For 3-level pagetables we defines these ourselves, for 2-level the
  140. * definitions are supplied by <asm-generic/pgtable-nopmd.h>.
  141. */
  142. typedef struct { unsigned long pmd; } pmd_t;
  143. #define pmd_val(x) ((x).pmd)
  144. #define __pmd(x) ((pmd_t) { (x) } )
  145. extern pmd_t invalid_pmd_table[PTRS_PER_PMD];
  146. #endif
  147. /*
  148. * Empty pgd/pmd entries point to the invalid_pte_table.
  149. */
  150. static inline int pmd_none(pmd_t pmd)
  151. {
  152. return pmd_val(pmd) == (unsigned long) invalid_pte_table;
  153. }
  154. static inline int pmd_bad(pmd_t pmd)
  155. {
  156. #ifdef CONFIG_MIPS_HUGE_TLB_SUPPORT
  157. /* pmd_huge(pmd) but inline */
  158. if (unlikely(pmd_val(pmd) & _PAGE_HUGE))
  159. return 0;
  160. #endif
  161. if (unlikely(pmd_val(pmd) & ~PAGE_MASK))
  162. return 1;
  163. return 0;
  164. }
  165. static inline int pmd_present(pmd_t pmd)
  166. {
  167. return pmd_val(pmd) != (unsigned long) invalid_pte_table;
  168. }
  169. static inline void pmd_clear(pmd_t *pmdp)
  170. {
  171. pmd_val(*pmdp) = ((unsigned long) invalid_pte_table);
  172. }
  173. #ifndef __PAGETABLE_PMD_FOLDED
  174. /*
  175. * Empty pud entries point to the invalid_pmd_table.
  176. */
  177. static inline int pud_none(pud_t pud)
  178. {
  179. return pud_val(pud) == (unsigned long) invalid_pmd_table;
  180. }
  181. static inline int pud_bad(pud_t pud)
  182. {
  183. return pud_val(pud) & ~PAGE_MASK;