pgtable.h 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550
  1. #ifndef _PARISC_PGTABLE_H
  2. #define _PARISC_PGTABLE_H
  3. #include <asm-generic/4level-fixup.h>
  4. #include <asm/fixmap.h>
  5. #ifndef __ASSEMBLY__
  6. /*
  7. * we simulate an x86-style page table for the linux mm code
  8. */
  9. #include <linux/bitops.h>
  10. #include <linux/spinlock.h>
  11. #include <linux/mm_types.h>
  12. #include <asm/processor.h>
  13. #include <asm/cache.h>
  14. extern spinlock_t pa_tlb_lock;
  15. /*
  16. * kern_addr_valid(ADDR) tests if ADDR is pointing to valid kernel
  17. * memory. For the return value to be meaningful, ADDR must be >=
  18. * PAGE_OFFSET. This operation can be relatively expensive (e.g.,
  19. * require a hash-, or multi-level tree-lookup or something of that
  20. * sort) but it guarantees to return TRUE only if accessing the page
  21. * at that address does not cause an error. Note that there may be
  22. * addresses for which kern_addr_valid() returns FALSE even though an
  23. * access would not cause an error (e.g., this is typically true for
  24. * memory mapped I/O regions.
  25. *
  26. * XXX Need to implement this for parisc.
  27. */
  28. #define kern_addr_valid(addr) (1)
  29. /* Purge data and instruction TLB entries. Must be called holding
  30. * the pa_tlb_lock. The TLB purge instructions are slow on SMP
  31. * machines since the purge must be broadcast to all CPUs.
  32. */
  33. static inline void purge_tlb_entries(struct mm_struct *mm, unsigned long addr)
  34. {
  35. mtsp(mm->context, 1);
  36. pdtlb(addr);
  37. if (unlikely(split_tlb))
  38. pitlb(addr);
  39. }
  40. /* Certain architectures need to do special things when PTEs
  41. * within a page table are directly modified. Thus, the following
  42. * hook is made available.
  43. */
  44. #define set_pte(pteptr, pteval) \
  45. do{ \
  46. *(pteptr) = (pteval); \
  47. } while(0)
  48. #define pte_inserted(x) \
  49. ((pte_val(x) & (_PAGE_PRESENT|_PAGE_ACCESSED)) \
  50. == (_PAGE_PRESENT|_PAGE_ACCESSED))
  51. #define set_pte_at(mm, addr, ptep, pteval) \
  52. do { \
  53. pte_t old_pte; \
  54. unsigned long flags; \
  55. spin_lock_irqsave(&pa_tlb_lock, flags); \
  56. old_pte = *ptep; \
  57. if (pte_inserted(old_pte)) \
  58. purge_tlb_entries(mm, addr); \
  59. set_pte(ptep, pteval); \
  60. spin_unlock_irqrestore(&pa_tlb_lock, flags); \
  61. } while (0)
  62. #endif /* !__ASSEMBLY__ */
  63. #include <asm/page.h>
  64. #define pte_ERROR(e) \
  65. printk("%s:%d: bad pte %08lx.\n", __FILE__, __LINE__, pte_val(e))
  66. #define pmd_ERROR(e) \
  67. printk("%s:%d: bad pmd %08lx.\n", __FILE__, __LINE__, (unsigned long)pmd_val(e))
  68. #define pgd_ERROR(e) \
  69. printk("%s:%d: bad pgd %08lx.\n", __FILE__, __LINE__, (unsigned long)pgd_val(e))
  70. /* This is the size of the initially mapped kernel memory */
  71. #if defined(CONFIG_64BIT)
  72. #define KERNEL_INITIAL_ORDER 26 /* 1<<26 = 64MB */
  73. #else
  74. #define KERNEL_INITIAL_ORDER 25 /* 1<<25 = 32MB */
  75. #endif
  76. #define KERNEL_INITIAL_SIZE (1 << KERNEL_INITIAL_ORDER)
  77. #if CONFIG_PGTABLE_LEVELS == 3
  78. #define PGD_ORDER 1 /* Number of pages per pgd */
  79. #define PMD_ORDER 1 /* Number of pages per pmd */
  80. #define PGD_ALLOC_ORDER 2 /* first pgd contains pmd */
  81. #else
  82. #define PGD_ORDER 1 /* Number of pages per pgd */
  83. #define PGD_ALLOC_ORDER PGD_ORDER
  84. #endif
  85. /* Definitions for 3rd level (we use PLD here for Page Lower directory
  86. * because PTE_SHIFT is used lower down to mean shift that has to be
  87. * done to get usable bits out of the PTE) */
  88. #define PLD_SHIFT PAGE_SHIFT
  89. #define PLD_SIZE PAGE_SIZE
  90. #define BITS_PER_PTE (PAGE_SHIFT - BITS_PER_PTE_ENTRY)
  91. #define PTRS_PER_PTE (1UL << BITS_PER_PTE)
  92. /* Definitions for 2nd level */
  93. #define pgtable_cache_init() do { } while (0)
  94. #define PMD_SHIFT (PLD_SHIFT + BITS_PER_PTE)
  95. #define PMD_SIZE (1UL << PMD_SHIFT)
  96. #define PMD_MASK (~(PMD_SIZE-1))
  97. #if CONFIG_PGTABLE_LEVELS == 3
  98. #define BITS_PER_PMD (PAGE_SHIFT + PMD_ORDER - BITS_PER_PMD_ENTRY)
  99. #else
  100. #define __PAGETABLE_PMD_FOLDED
  101. #define BITS_PER_PMD 0
  102. #endif
  103. #define PTRS_PER_PMD (1UL << BITS_PER_PMD)
  104. /* Definitions for 1st level */
  105. #define PGDIR_SHIFT (PMD_SHIFT + BITS_PER_PMD)
  106. #if (PGDIR_SHIFT + PAGE_SHIFT + PGD_ORDER - BITS_PER_PGD_ENTRY) > BITS_PER_LONG
  107. #define BITS_PER_PGD (BITS_PER_LONG - PGDIR_SHIFT)
  108. #else
  109. #define BITS_PER_PGD (PAGE_SHIFT + PGD_ORDER - BITS_PER_PGD_ENTRY)
  110. #endif
  111. #define PGDIR_SIZE (1UL << PGDIR_SHIFT)
  112. #define PGDIR_MASK (~(PGDIR_SIZE-1))
  113. #define PTRS_PER_PGD (1UL << BITS_PER_PGD)
  114. #define USER_PTRS_PER_PGD PTRS_PER_PGD
  115. #ifdef CONFIG_64BIT
  116. #define MAX_ADDRBITS (PGDIR_SHIFT + BITS_PER_PGD)
  117. #define MAX_ADDRESS (1UL << MAX_ADDRBITS)
  118. #define SPACEID_SHIFT (MAX_ADDRBITS - 32)
  119. #else
  120. #define MAX_ADDRBITS (BITS_PER_LONG)
  121. #define MAX_ADDRESS (1UL << MAX_ADDRBITS)
  122. #define SPACEID_SHIFT 0
  123. #endif
  124. /* This calculates the number of initial pages we need for the initial
  125. * page tables */
  126. #if (KERNEL_INITIAL_ORDER) >= (PMD_SHIFT)
  127. # define PT_INITIAL (1 << (KERNEL_INITIAL_ORDER - PMD_SHIFT))
  128. #else
  129. # define PT_INITIAL (1) /* all initial PTEs fit into one page */
  130. #endif
  131. /*
  132. * pgd entries used up by user/kernel:
  133. */
  134. #define FIRST_USER_ADDRESS 0UL
  135. /* NB: The tlb miss handlers make certain assumptions about the order */
  136. /* of the following bits, so be careful (One example, bits 25-31 */
  137. /* are moved together in one instruction). */
  138. #define _PAGE_READ_BIT 31 /* (0x001) read access allowed */
  139. #define _PAGE_WRITE_BIT 30 /* (0x002) write access allowed */
  140. #define _PAGE_EXEC_BIT 29 /* (0x004) execute access allowed */
  141. #define _PAGE_GATEWAY_BIT 28 /* (0x008) privilege promotion allowed */
  142. #define _PAGE_DMB_BIT 27 /* (0x010) Data Memory Break enable (B bit) */
  143. #define _PAGE_DIRTY_BIT 26 /* (0x020) Page Dirty (D bit) */
  144. #define _PAGE_REFTRAP_BIT 25 /* (0x040) Page Ref. Trap enable (T bit) */
  145. #define _PAGE_NO_CACHE_BIT 24 /* (0x080) Uncached Page (U bit) */
  146. #define _PAGE_ACCESSED_BIT 23 /* (0x100) Software: Page Accessed */
  147. #define _PAGE_PRESENT_BIT 22 /* (0x200) Software: translation valid */
  148. #define _PAGE_HPAGE_BIT 21 /* (0x400) Software: Huge Page */
  149. #define _PAGE_USER_BIT 20 /* (0x800) Software: User accessible page */
  150. /* N.B. The bits are defined in terms of a 32 bit word above, so the */
  151. /* following macro is ok for both 32 and 64 bit. */
  152. #define xlate_pabit(x) (31 - x)
  153. /* this defines the shift to the usable bits in the PTE it is set so
  154. * that the valid bits _PAGE_PRESENT_BIT and _PAGE_USER_BIT are set
  155. * to zero */
  156. #define PTE_SHIFT xlate_pabit(_PAGE_USER_BIT)
  157. /* PFN_PTE_SHIFT defines the shift of a PTE value to access the PFN field */
  158. #define PFN_PTE_SHIFT 12
  159. #define _PAGE_READ (1 << xlate_pabit(_PAGE_READ_BIT))
  160. #define _PAGE_WRITE (1 << xlate_pabit(_PAGE_WRITE_BIT))
  161. #define _PAGE_RW (_PAGE_READ | _PAGE_WRITE)
  162. #define _PAGE_EXEC (1 << xlate_pabit(_PAGE_EXEC_BIT))
  163. #define _PAGE_GATEWAY (1 << xlate_pabit(_PAGE_GATEWAY_BIT))
  164. #define _PAGE_DMB (1 << xlate_pabit(_PAGE_DMB_BIT))
  165. #define _PAGE_DIRTY (1 << xlate_pabit(_PAGE_DIRTY_BIT))
  166. #define _PAGE_REFTRAP (1 << xlate_pabit(_PAGE_REFTRAP_BIT))
  167. #define _PAGE_NO_CACHE (1 << xlate_pabit(_PAGE_NO_CACHE_BIT))
  168. #define _PAGE_ACCESSED (1 << xlate_pabit(_PAGE_ACCESSED_BIT))
  169. #define _PAGE_PRESENT (1 << xlate_pabit(_PAGE_PRESENT_BIT))
  170. #define _PAGE_HUGE (1 << xlate_pabit(_PAGE_HPAGE_BIT))
  171. #define _PAGE_USER (1 << xlate_pabit(_PAGE_USER_BIT))
  172. #define _PAGE_TABLE (_PAGE_PRESENT | _PAGE_READ | _PAGE_WRITE | _PAGE_DIRTY | _PAGE_ACCESSED)
  173. #define _PAGE_CHG_MASK (PAGE_MASK | _PAGE_ACCESSED | _PAGE_DIRTY)
  174. #define _PAGE_KERNEL_RO (_PAGE_PRESENT | _PAGE_READ | _PAGE_DIRTY | _PAGE_ACCESSED)
  175. #define _PAGE_KERNEL_EXEC (_PAGE_KERNEL_RO | _PAGE_EXEC)
  176. #define _PAGE_KERNEL_RWX (_PAGE_KERNEL_EXEC | _PAGE_WRITE)
  177. #define _PAGE_KERNEL (_PAGE_KERNEL_RO | _PAGE_WRITE)
  178. /* The pgd/pmd contains a ptr (in phys addr space); since all pgds/pmds
  179. * are page-aligned, we don't care about the PAGE_OFFSET bits, except
  180. * for a few meta-information bits, so we shift the address to be
  181. * able to effectively address 40/42/44-bits of physical address space
  182. * depending on 4k/16k/64k PAGE_SIZE */
  183. #define _PxD_PRESENT_BIT 31
  184. #define _PxD_ATTACHED_BIT 30
  185. #define _PxD_VALID_BIT 29
  186. #define PxD_FLAG_PRESENT (1 << xlate_pabit(_PxD_PRESENT_BIT))
  187. #define PxD_FLAG_ATTACHED (1 << xlate_pabit(_PxD_ATTACHED_BIT))
  188. #define PxD_FLAG_VALID (1 << xlate_pabit(_PxD_VALID_BIT))
  189. #define PxD_FLAG_MASK (0xf)
  190. #define PxD_FLAG_SHIFT (4)
  191. #define PxD_VALUE_SHIFT (PFN_PTE_SHIFT-PxD_FLAG_SHIFT)
  192. #ifndef __ASSEMBLY__
  193. #define PAGE_NONE __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_ACCESSED)
  194. #define PAGE_SHARED __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_READ | _PAGE_WRITE | _PAGE_ACCESSED)
  195. /* Others seem to make this executable, I don't know if that's correct
  196. or not. The stack is mapped this way though so this is necessary
  197. in the short term - dhd@linuxcare.com, 2000-08-08 */
  198. #define PAGE_READONLY __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_READ | _PAGE_ACCESSED)
  199. #define PAGE_WRITEONLY __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_WRITE | _PAGE_ACCESSED)
  200. #define PAGE_EXECREAD __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_READ | _PAGE_EXEC |_PAGE_ACCESSED)
  201. #define PAGE_COPY PAGE_EXECREAD
  202. #define PAGE_RWX __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_READ | _PAGE_WRITE | _PAGE_EXEC |_PAGE_ACCESSED)
  203. #define PAGE_KERNEL __pgprot(_PAGE_KERNEL)
  204. #define PAGE_KERNEL_EXEC __pgprot(_PAGE_KERNEL_EXEC)
  205. #define PAGE_KERNEL_RWX __pgprot(_PAGE_KERNEL_RWX)
  206. #define PAGE_KERNEL_RO __pgprot(_PAGE_KERNEL_RO)
  207. #define PAGE_KERNEL_UNC __pgprot(_PAGE_KERNEL | _PAGE_NO_CACHE)
  208. #define PAGE_GATEWAY __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_ACCESSED | _PAGE_GATEWAY| _PAGE_READ)
  209. /*
  210. * We could have an execute only page using "gateway - promote to priv
  211. * level 3", but that is kind of silly. So, the way things are defined
  212. * now, we must always have read permission for pages with execute
  213. * permission. For the fun of it we'll go ahead and support write only
  214. * pages.
  215. */
  216. /*xwr*/
  217. #define __P000 PAGE_NONE
  218. #define __P001 PAGE_READONLY
  219. #define __P010 __P000 /* copy on write */
  220. #define __P011 __P001 /* copy on write */
  221. #define __P100 PAGE_EXECREAD
  222. #define __P101 PAGE_EXECREAD
  223. #define __P110 __P100 /* copy on write */
  224. #define __P111 __P101 /* copy on write */
  225. #define __S000 PAGE_NONE
  226. #define __S001 PAGE_READONLY
  227. #define __S010 PAGE_WRITEONLY
  228. #define __S011 PAGE_SHARED
  229. #define __S100 PAGE_EXECREAD
  230. #define __S101 PAGE_EXECREAD
  231. #define __S110 PAGE_RWX
  232. #define __S111 PAGE_RWX
  233. extern pgd_t swapper_pg_dir[]; /* declared in init_task.c */
  234. /* initial page tables for 0-8MB for kernel */
  235. extern pte_t pg0[];
  236. /* zero page used for uninitialized stuff */
  237. extern unsigned long *empty_zero_page;
  238. /*
  239. * ZERO_PAGE is a global shared page that is always zero: used
  240. * for zero-mapped memory areas etc..
  241. */
  242. #define ZERO_PAGE(vaddr) (virt_to_page(empty_zero_page))
  243. #define pte_none(x) (pte_val(x) == 0)
  244. #define pte_present(x) (pte_val(x) & _PAGE_PRESENT)
  245. #define pte_clear(mm, addr, xp) set_pte_at(mm, addr, xp, __pte(0))
  246. #define pmd_flag(x) (pmd_val(x) & PxD_FLAG_MASK)
  247. #define pmd_address(x) ((unsigned long)(pmd_val(x) &~ PxD_FLAG_MASK) << PxD_VALUE_SHIFT)
  248. #define pgd_flag(x) (pgd_val(x) & PxD_FLAG_MASK)
  249. #define pgd_address(x) ((unsigned long)(pgd_val(x) &~ PxD_FLAG_MASK) << PxD_VALUE_SHIFT)
  250. #if CONFIG_PGTABLE_LEVELS == 3
  251. /* The first entry of the permanent pmd is not there if it contains
  252. * the gateway marker */
  253. #define pmd_none(x) (!pmd_val(x) || pmd_flag(x) == PxD_FLAG_ATTACHED)
  254. #else
  255. #define pmd_none(x) (!pmd_val(x))
  256. #endif
  257. #define pmd_bad(x) (!(pmd_flag(x) & PxD_FLAG_VALID))
  258. #define pmd_present(x) (pmd_flag(x) & PxD_FLAG_PRESENT)
  259. static inline void pmd_clear(pmd_t *pmd) {
  260. #if CONFIG_PGTABLE_LEVELS == 3
  261. if (pmd_flag(*pmd) & PxD_FLAG_ATTACHED)
  262. /* This is the entry pointing to the permanent pmd
  263. * attached to the pgd; cannot clear it */
  264. __pmd_val_set(*pmd, PxD_FLAG_ATTACHED);
  265. else
  266. #endif
  267. __pmd_val_set(*pmd, 0);
  268. }
  269. #if CONFIG_PGTABLE_LEVELS == 3
  270. #define pgd_page_vaddr(pgd) ((unsigned long) __va(pgd_address(pgd)))
  271. #define pgd_page(pgd) virt_to_page((void *)pgd_page_vaddr(pgd))
  272. /* For 64 bit we have three level tables */
  273. #define pgd_none(x) (!pgd_val(x))
  274. #define pgd_bad(x) (!(pgd_flag(x) & PxD_FLAG_VALID))
  275. #define pgd_present(x) (pgd_flag(x) & PxD_FLAG_PRESENT)
  276. static inline void pgd_clear(pgd_t *pgd) {
  277. #if CONFIG_PGTABLE_LEVELS == 3
  278. if(pgd_flag(*pgd) & PxD_FLAG_ATTACHED)
  279. /* This is the permanent pmd attached to the pgd; cannot
  280. * free it */
  281. return;
  282. #endif
  283. __pgd_val_set(*pgd, 0);
  284. }
  285. #else
  286. /*
  287. * The "pgd_xxx()" functions here are trivial for a folded two-level
  288. * setup: the pgd is never bad, and a pmd always exists (as it's folded
  289. * into the pgd entry)
  290. */
  291. static inline int pgd_none(pgd_t pgd) { return 0; }
  292. static inline int pgd_bad(pgd_t pgd) { return 0; }
  293. static inline int pgd_present(pgd_t pgd) { return 1; }
  294. static inline void pgd_clear(pgd_t * pgdp) { }
  295. #endif
  296. /*
  297. * The following only work if pte_present() is true.
  298. * Undefined behaviour if not..
  299. */
  300. static inline int pte_dirty(pte_t pte) { return pte_val(pte) & _PAGE_DIRTY; }
  301. static inline int pte_young(pte_t pte) { return pte_val(pte) & _PAGE_ACCESSED; }
  302. static inline int pte_write(pte_t pte) { return pte_val(pte) & _PAGE_WRITE; }
  303. static inline int pte_special(pte_t pte) { return 0; }
  304. static inline pte_t pte_mkclean(pte_t pte) { pte_val(pte) &= ~_PAGE_DIRTY; return pte; }
  305. static inline pte_t pte_mkold(pte_t pte) { pte_val(pte) &= ~_PAGE_ACCESSED; return pte; }
  306. static inline pte_t pte_wrprotect(pte_t pte) { pte_val(pte) &= ~_PAGE_WRITE; return pte; }
  307. static inline pte_t pte_mkdirty(pte_t pte) { pte_val(pte) |= _PAGE_DIRTY; return pte; }
  308. static inline pte_t pte_mkyoung(pte_t pte) { pte_val(pte) |= _PAGE_ACCESSED; return pte; }
  309. static inline pte_t pte_mkwrite(pte_t pte) { pte_val(pte) |= _PAGE_WRITE; return pte; }
  310. static inline pte_t pte_mkspecial(pte_t pte) { return pte; }
  311. /*
  312. * Huge pte definitions.
  313. */
  314. #ifdef CONFIG_HUGETLB_PAGE
  315. #define pte_huge(pte) (pte_val(pte) & _PAGE_HUGE)
  316. #define pte_mkhuge(pte) (__pte(pte_val(pte) | \
  317. (parisc_requires_coherency() ? 0 : _PAGE_HUGE)))
  318. #else
  319. #define pte_huge(pte) (0)
  320. #define pte_mkhuge(pte) (pte)
  321. #endif
  322. /*
  323. * Conversion functions: convert a page and protection to a page entry,
  324. * and a page entry and page directory to the page they refer to.
  325. */
  326. #define __mk_pte(addr,pgprot) \
  327. ({ \
  328. pte_t __pte; \
  329. \
  330. pte_val(__pte) = ((((addr)>>PAGE_SHIFT)<<PFN_PTE_SHIFT) + pgprot_val(pgprot)); \
  331. \
  332. __pte; \
  333. })
  334. #define mk_pte(page, pgprot) pfn_pte(page_to_pfn(page), (pgprot))
  335. static inline pte_t pfn_pte(unsigned long pfn, pgprot_t pgprot)
  336. {
  337. pte_t pte;
  338. pte_val(pte) = (pfn << PFN_PTE_SHIFT) | pgprot_val(pgprot);
  339. return pte;
  340. }
  341. static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
  342. { pte_val(pte) = (pte_val(pte) & _PAGE_CHG_MASK) | pgprot_val(newprot); return pte; }
  343. /* Permanent address of a page. On parisc we don't have highmem. */
  344. #define pte_pfn(x) (pte_val(x) >> PFN_PTE_SHIFT)
  345. #define pte_page(pte) (pfn_to_page(pte_pfn(pte)))
  346. #define pmd_page_vaddr(pmd) ((unsigned long) __va(pmd_address(pmd)))
  347. #define __pmd_page(pmd) ((unsigned long) __va(pmd_address(pmd)))
  348. #define pmd_page(pmd) virt_to_page((void *)__pmd_page(pmd))
  349. #define pgd_index(address) ((address) >> PGDIR_SHIFT)
  350. /* to find an entry in a page-table-directory */
  351. #define pgd_offset(mm, address) \
  352. ((mm)->pgd + ((address) >> PGDIR_SHIFT))
  353. /* to find an entry in a kernel page-table-directory */
  354. #define pgd_offset_k(address) pgd_offset(&init_mm, address)
  355. /* Find an entry in the second-level page table.. */
  356. #if CONFIG_PGTABLE_LEVELS == 3
  357. #define pmd_index(addr) (((addr) >> PMD_SHIFT) & (PTRS_PER_PMD - 1))
  358. #define pmd_offset(dir,address) \
  359. ((pmd_t *) pgd_page_vaddr(*(dir)) + pmd_index(address))
  360. #else
  361. #define pmd_offset(dir,addr) ((pmd_t *) dir)
  362. #endif
  363. /* Find an entry in the third-level page table.. */
  364. #define pte_index(address) (((address) >> PAGE_SHIFT) & (PTRS_PER_PTE-1))
  365. #define pte_offset_kernel(pmd, address) \
  366. ((pte_t *) pmd_page_vaddr(*(pmd)) + pte_index(address))
  367. #define pte_offset_map(pmd, address) pte_offset_kernel(pmd, address)
  368. #define pte_unmap(pte) do { } while (0)
  369. #define pte_unmap(pte) do { } while (0)
  370. #define pte_unmap_nested(pte) do { } while (0)
  371. extern void paging_init (void);
  372. /* Used for deferring calls to flush_dcache_page() */
  373. #define PG_dcache_dirty PG_arch_1
  374. extern void update_mmu_cache(struct vm_area_struct *, unsigned long, pte_t *);
  375. /* Encode and de-code a swap entry */
  376. #define __swp_type(x) ((x).val & 0x1f)
  377. #define __swp_offset(x) ( (((x).val >> 6) & 0x7) | \
  378. (((x).val >> 8) & ~0x7) )
  379. #define __swp_entry(type, offset) ((swp_entry_t) { (type) | \
  380. ((offset & 0x7) << 6) | \
  381. ((offset & ~0x7) << 8) })
  382. #define __pte_to_swp_entry(pte) ((swp_entry_t) { pte_val(pte) })
  383. #define __swp_entry_to_pte(x) ((pte_t) { (x).val })
  384. static inline int ptep_test_and_clear_young(struct vm_area_struct *vma, unsigned long addr, pte_t *ptep)
  385. {
  386. pte_t pte;
  387. unsigned long flags;
  388. if (!pte_young(*ptep))
  389. return 0;
  390. spin_lock_irqsave(&pa_tlb_lock, flags);
  391. pte = *ptep;
  392. if (!pte_young(pte)) {
  393. spin_unlock_irqrestore(&pa_tlb_lock, flags);
  394. return 0;
  395. }
  396. purge_tlb_entries(vma->vm_mm, addr);
  397. set_pte(ptep, pte_mkold(pte));
  398. spin_unlock_irqrestore(&pa_tlb_lock, flags);
  399. return 1;
  400. }
  401. struct mm_struct;
  402. static inline pte_t ptep_get_and_clear(struct mm_struct *mm, unsigned long addr, pte_t *ptep)
  403. {
  404. pte_t old_pte;
  405. unsigned long flags;
  406. spin_lock_irqsave(&pa_tlb_lock, flags);
  407. old_pte = *ptep;
  408. if (pte_inserted(old_pte))
  409. purge_tlb_entries(mm, addr);
  410. set_pte(ptep, __pte(0));
  411. spin_unlock_irqrestore(&pa_tlb_lock, flags);
  412. return old_pte;
  413. }
  414. static inline void ptep_set_wrprotect(struct mm_struct *mm, unsigned long addr, pte_t *ptep)
  415. {
  416. unsigned long flags;
  417. spin_lock_irqsave(&pa_tlb_lock, flags);
  418. purge_tlb_entries(mm, addr);
  419. set_pte(ptep, pte_wrprotect(*ptep));
  420. spin_unlock_irqrestore(&pa_tlb_lock, flags);
  421. }
  422. #define pte_same(A,B) (pte_val(A) == pte_val(B))
  423. #endif /* !__ASSEMBLY__ */
  424. /* TLB page size encoding - see table 3-1 in parisc20.pdf */
  425. #define _PAGE_SIZE_ENCODING_4K 0
  426. #define _PAGE_SIZE_ENCODING_16K 1
  427. #define _PAGE_SIZE_ENCODING_64K 2
  428. #define _PAGE_SIZE_ENCODING_256K 3
  429. #define _PAGE_SIZE_ENCODING_1M 4
  430. #define _PAGE_SIZE_ENCODING_4M 5
  431. #define _PAGE_SIZE_ENCODING_16M 6
  432. #define _PAGE_SIZE_ENCODING_64M 7
  433. #if defined(CONFIG_PARISC_PAGE_SIZE_4KB)
  434. # define _PAGE_SIZE_ENCODING_DEFAULT _PAGE_SIZE_ENCODING_4K
  435. #elif defined(CONFIG_PARISC_PAGE_SIZE_16KB)
  436. # define _PAGE_SIZE_ENCODING_DEFAULT _PAGE_SIZE_ENCODING_16K
  437. #elif defined(CONFIG_PARISC_PAGE_SIZE_64KB)
  438. # define _PAGE_SIZE_ENCODING_DEFAULT _PAGE_SIZE_ENCODING_64K
  439. #endif
  440. #define pgprot_noncached(prot) __pgprot(pgprot_val(prot) | _PAGE_NO_CACHE)
  441. /* We provide our own get_unmapped_area to provide cache coherency */
  442. #define HAVE_ARCH_UNMAPPED_AREA
  443. #define HAVE_ARCH_UNMAPPED_AREA_TOPDOWN
  444. #define __HAVE_ARCH_PTEP_TEST_AND_CLEAR_YOUNG
  445. #define __HAVE_ARCH_PTEP_GET_AND_CLEAR
  446. #define __HAVE_ARCH_PTEP_SET_WRPROTECT
  447. #define __HAVE_ARCH_PTE_SAME
  448. #include <asm-generic/pgtable.h>
  449. #endif /* _PARISC_PGTABLE_H */