pgtable.h 18 KB

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