pgtable.h 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592
  1. /*
  2. * Copyright (C) 2008-2009 Michal Simek <monstr@monstr.eu>
  3. * Copyright (C) 2008-2009 PetaLogix
  4. * Copyright (C) 2006 Atmark Techno, Inc.
  5. *
  6. * This file is subject to the terms and conditions of the GNU General Public
  7. * License. See the file "COPYING" in the main directory of this archive
  8. * for more details.
  9. */
  10. #ifndef _ASM_MICROBLAZE_PGTABLE_H
  11. #define _ASM_MICROBLAZE_PGTABLE_H
  12. #include <asm/setup.h>
  13. #define io_remap_pfn_range(vma, vaddr, pfn, size, prot) \
  14. remap_pfn_range(vma, vaddr, pfn, size, prot)
  15. #ifndef CONFIG_MMU
  16. #define pgd_present(pgd) (1) /* pages are always present on non MMU */
  17. #define pgd_none(pgd) (0)
  18. #define pgd_bad(pgd) (0)
  19. #define pgd_clear(pgdp)
  20. #define kern_addr_valid(addr) (1)
  21. #define pmd_offset(a, b) ((void *) 0)
  22. #define PAGE_NONE __pgprot(0) /* these mean nothing to non MMU */
  23. #define PAGE_SHARED __pgprot(0) /* these mean nothing to non MMU */
  24. #define PAGE_COPY __pgprot(0) /* these mean nothing to non MMU */
  25. #define PAGE_READONLY __pgprot(0) /* these mean nothing to non MMU */
  26. #define PAGE_KERNEL __pgprot(0) /* these mean nothing to non MMU */
  27. #define pgprot_noncached(x) (x)
  28. #define __swp_type(x) (0)
  29. #define __swp_offset(x) (0)
  30. #define __swp_entry(typ, off) ((swp_entry_t) { ((typ) | ((off) << 7)) })
  31. #define __pte_to_swp_entry(pte) ((swp_entry_t) { pte_val(pte) })
  32. #define __swp_entry_to_pte(x) ((pte_t) { (x).val })
  33. #ifndef __ASSEMBLY__
  34. static inline int pte_file(pte_t pte) { return 0; }
  35. #endif /* __ASSEMBLY__ */
  36. #define ZERO_PAGE(vaddr) ({ BUG(); NULL; })
  37. #define swapper_pg_dir ((pgd_t *) NULL)
  38. #define pgtable_cache_init() do {} while (0)
  39. #define arch_enter_lazy_cpu_mode() do {} while (0)
  40. #else /* CONFIG_MMU */
  41. #include <asm-generic/4level-fixup.h>
  42. #ifdef __KERNEL__
  43. #ifndef __ASSEMBLY__
  44. #include <linux/sched.h>
  45. #include <linux/threads.h>
  46. #include <asm/processor.h> /* For TASK_SIZE */
  47. #include <asm/mmu.h>
  48. #include <asm/page.h>
  49. #define FIRST_USER_ADDRESS 0
  50. extern unsigned long va_to_phys(unsigned long address);
  51. extern pte_t *va_to_pte(unsigned long address);
  52. extern unsigned long ioremap_bot, ioremap_base;
  53. /*
  54. * The following only work if pte_present() is true.
  55. * Undefined behaviour if not..
  56. */
  57. static inline int pte_special(pte_t pte) { return 0; }
  58. static inline pte_t pte_mkspecial(pte_t pte) { return pte; }
  59. /* Start and end of the vmalloc area. */
  60. /* Make sure to map the vmalloc area above the pinned kernel memory area
  61. of 32Mb. */
  62. #define VMALLOC_START (CONFIG_KERNEL_START + \
  63. max(32 * 1024 * 1024UL, memory_size))
  64. #define VMALLOC_END ioremap_bot
  65. #define VMALLOC_VMADDR(x) ((unsigned long)(x))
  66. #endif /* __ASSEMBLY__ */
  67. /*
  68. * The MicroBlaze MMU is identical to the PPC-40x MMU, and uses a hash
  69. * table containing PTEs, together with a set of 16 segment registers, to
  70. * define the virtual to physical address mapping.
  71. *
  72. * We use the hash table as an extended TLB, i.e. a cache of currently
  73. * active mappings. We maintain a two-level page table tree, much
  74. * like that used by the i386, for the sake of the Linux memory
  75. * management code. Low-level assembler code in hashtable.S
  76. * (procedure hash_page) is responsible for extracting ptes from the
  77. * tree and putting them into the hash table when necessary, and
  78. * updating the accessed and modified bits in the page table tree.
  79. */
  80. /*
  81. * The MicroBlaze processor has a TLB architecture identical to PPC-40x. The
  82. * instruction and data sides share a unified, 64-entry, semi-associative
  83. * TLB which is maintained totally under software control. In addition, the
  84. * instruction side has a hardware-managed, 2,4, or 8-entry, fully-associative
  85. * TLB which serves as a first level to the shared TLB. These two TLBs are
  86. * known as the UTLB and ITLB, respectively (see "mmu.h" for definitions).
  87. */
  88. /*
  89. * The normal case is that PTEs are 32-bits and we have a 1-page
  90. * 1024-entry pgdir pointing to 1-page 1024-entry PTE pages. -- paulus
  91. *
  92. */
  93. /* PMD_SHIFT determines the size of the area mapped by the PTE pages */
  94. #define PMD_SHIFT (PAGE_SHIFT + PTE_SHIFT)
  95. #define PMD_SIZE (1UL << PMD_SHIFT)
  96. #define PMD_MASK (~(PMD_SIZE-1))
  97. /* PGDIR_SHIFT determines what a top-level page table entry can map */
  98. #define PGDIR_SHIFT PMD_SHIFT
  99. #define PGDIR_SIZE (1UL << PGDIR_SHIFT)
  100. #define PGDIR_MASK (~(PGDIR_SIZE-1))
  101. /*
  102. * entries per page directory level: our page-table tree is two-level, so
  103. * we don't really have any PMD directory.
  104. */
  105. #define PTRS_PER_PTE (1 << PTE_SHIFT)
  106. #define PTRS_PER_PMD 1
  107. #define PTRS_PER_PGD (1 << (32 - PGDIR_SHIFT))
  108. #define USER_PTRS_PER_PGD (TASK_SIZE / PGDIR_SIZE)
  109. #define FIRST_USER_PGD_NR 0
  110. #define USER_PGD_PTRS (PAGE_OFFSET >> PGDIR_SHIFT)
  111. #define KERNEL_PGD_PTRS (PTRS_PER_PGD-USER_PGD_PTRS)
  112. #define pte_ERROR(e) \
  113. printk(KERN_ERR "%s:%d: bad pte "PTE_FMT".\n", \
  114. __FILE__, __LINE__, pte_val(e))
  115. #define pmd_ERROR(e) \
  116. printk(KERN_ERR "%s:%d: bad pmd %08lx.\n", \
  117. __FILE__, __LINE__, pmd_val(e))
  118. #define pgd_ERROR(e) \
  119. printk(KERN_ERR "%s:%d: bad pgd %08lx.\n", \
  120. __FILE__, __LINE__, pgd_val(e))
  121. /*
  122. * Bits in a linux-style PTE. These match the bits in the
  123. * (hardware-defined) PTE as closely as possible.
  124. */
  125. /* There are several potential gotchas here. The hardware TLBLO
  126. * field looks like this:
  127. *
  128. * 0 1 2 3 4 ... 18 19 20 21 22 23 24 25 26 27 28 29 30 31
  129. * RPN..................... 0 0 EX WR ZSEL....... W I M G
  130. *
  131. * Where possible we make the Linux PTE bits match up with this
  132. *
  133. * - bits 20 and 21 must be cleared, because we use 4k pages (4xx can
  134. * support down to 1k pages), this is done in the TLBMiss exception
  135. * handler.
  136. * - We use only zones 0 (for kernel pages) and 1 (for user pages)
  137. * of the 16 available. Bit 24-26 of the TLB are cleared in the TLB
  138. * miss handler. Bit 27 is PAGE_USER, thus selecting the correct
  139. * zone.
  140. * - PRESENT *must* be in the bottom two bits because swap cache
  141. * entries use the top 30 bits. Because 4xx doesn't support SMP
  142. * anyway, M is irrelevant so we borrow it for PAGE_PRESENT. Bit 30
  143. * is cleared in the TLB miss handler before the TLB entry is loaded.
  144. * - All other bits of the PTE are loaded into TLBLO without
  145. * * modification, leaving us only the bits 20, 21, 24, 25, 26, 30 for
  146. * software PTE bits. We actually use use bits 21, 24, 25, and
  147. * 30 respectively for the software bits: ACCESSED, DIRTY, RW, and
  148. * PRESENT.
  149. */
  150. /* Definitions for MicroBlaze. */
  151. #define _PAGE_GUARDED 0x001 /* G: page is guarded from prefetch */
  152. #define _PAGE_FILE 0x001 /* when !present: nonlinear file mapping */
  153. #define _PAGE_PRESENT 0x002 /* software: PTE contains a translation */
  154. #define _PAGE_NO_CACHE 0x004 /* I: caching is inhibited */
  155. #define _PAGE_WRITETHRU 0x008 /* W: caching is write-through */
  156. #define _PAGE_USER 0x010 /* matches one of the zone permission bits */
  157. #define _PAGE_RW 0x040 /* software: Writes permitted */
  158. #define _PAGE_DIRTY 0x080 /* software: dirty page */
  159. #define _PAGE_HWWRITE 0x100 /* hardware: Dirty & RW, set in exception */
  160. #define _PAGE_HWEXEC 0x200 /* hardware: EX permission */
  161. #define _PAGE_ACCESSED 0x400 /* software: R: page referenced */
  162. #define _PMD_PRESENT PAGE_MASK
  163. /*
  164. * Some bits are unused...
  165. */
  166. #ifndef _PAGE_HASHPTE
  167. #define _PAGE_HASHPTE 0
  168. #endif
  169. #ifndef _PTE_NONE_MASK
  170. #define _PTE_NONE_MASK 0
  171. #endif
  172. #ifndef _PAGE_SHARED
  173. #define _PAGE_SHARED 0
  174. #endif
  175. #ifndef _PAGE_HWWRITE
  176. #define _PAGE_HWWRITE 0
  177. #endif
  178. #ifndef _PAGE_HWEXEC
  179. #define _PAGE_HWEXEC 0
  180. #endif
  181. #ifndef _PAGE_EXEC
  182. #define _PAGE_EXEC 0
  183. #endif
  184. #define _PAGE_CHG_MASK (PAGE_MASK | _PAGE_ACCESSED | _PAGE_DIRTY)
  185. /*
  186. * Note: the _PAGE_COHERENT bit automatically gets set in the hardware
  187. * PTE if CONFIG_SMP is defined (hash_page does this); there is no need
  188. * to have it in the Linux PTE, and in fact the bit could be reused for
  189. * another purpose. -- paulus.
  190. */
  191. #define _PAGE_BASE (_PAGE_PRESENT | _PAGE_ACCESSED)
  192. #define _PAGE_WRENABLE (_PAGE_RW | _PAGE_DIRTY | _PAGE_HWWRITE)
  193. #define _PAGE_KERNEL \
  194. (_PAGE_BASE | _PAGE_WRENABLE | _PAGE_SHARED | _PAGE_HWEXEC)
  195. #define _PAGE_IO (_PAGE_KERNEL | _PAGE_NO_CACHE | _PAGE_GUARDED)
  196. #define PAGE_NONE __pgprot(_PAGE_BASE)
  197. #define PAGE_READONLY __pgprot(_PAGE_BASE | _PAGE_USER)
  198. #define PAGE_READONLY_X __pgprot(_PAGE_BASE | _PAGE_USER | _PAGE_EXEC)
  199. #define PAGE_SHARED __pgprot(_PAGE_BASE | _PAGE_USER | _PAGE_RW)
  200. #define PAGE_SHARED_X \
  201. __pgprot(_PAGE_BASE | _PAGE_USER | _PAGE_RW | _PAGE_EXEC)
  202. #define PAGE_COPY __pgprot(_PAGE_BASE | _PAGE_USER)
  203. #define PAGE_COPY_X __pgprot(_PAGE_BASE | _PAGE_USER | _PAGE_EXEC)
  204. #define PAGE_KERNEL __pgprot(_PAGE_KERNEL)
  205. #define PAGE_KERNEL_RO __pgprot(_PAGE_BASE | _PAGE_SHARED)
  206. #define PAGE_KERNEL_CI __pgprot(_PAGE_IO)
  207. /*
  208. * We consider execute permission the same as read.
  209. * Also, write permissions imply read permissions.
  210. */
  211. #define __P000 PAGE_NONE
  212. #define __P001 PAGE_READONLY_X
  213. #define __P010 PAGE_COPY
  214. #define __P011 PAGE_COPY_X
  215. #define __P100 PAGE_READONLY
  216. #define __P101 PAGE_READONLY_X
  217. #define __P110 PAGE_COPY
  218. #define __P111 PAGE_COPY_X
  219. #define __S000 PAGE_NONE
  220. #define __S001 PAGE_READONLY_X
  221. #define __S010 PAGE_SHARED
  222. #define __S011 PAGE_SHARED_X
  223. #define __S100 PAGE_READONLY
  224. #define __S101 PAGE_READONLY_X
  225. #define __S110 PAGE_SHARED
  226. #define __S111 PAGE_SHARED_X
  227. #ifndef __ASSEMBLY__
  228. /*
  229. * ZERO_PAGE is a global shared page that is always zero: used
  230. * for zero-mapped memory areas etc..
  231. */
  232. extern unsigned long empty_zero_page[1024];
  233. #define ZERO_PAGE(vaddr) (virt_to_page(empty_zero_page))
  234. #endif /* __ASSEMBLY__ */
  235. #define pte_none(pte) ((pte_val(pte) & ~_PTE_NONE_MASK) == 0)
  236. #define pte_present(pte) (pte_val(pte) & _PAGE_PRESENT)
  237. #define pte_clear(mm, addr, ptep) \
  238. do { set_pte_at((mm), (addr), (ptep), __pte(0)); } while (0)
  239. #define pmd_none(pmd) (!pmd_val(pmd))
  240. #define pmd_bad(pmd) ((pmd_val(pmd) & _PMD_PRESENT) == 0)
  241. #define pmd_present(pmd) ((pmd_val(pmd) & _PMD_PRESENT) != 0)
  242. #define pmd_clear(pmdp) do { pmd_val(*(pmdp)) = 0; } while (0)
  243. #define pte_page(x) (mem_map + (unsigned long) \
  244. ((pte_val(x) - memory_start) >> PAGE_SHIFT))
  245. #define PFN_SHIFT_OFFSET (PAGE_SHIFT)
  246. #define pte_pfn(x) (pte_val(x) >> PFN_SHIFT_OFFSET)
  247. #define pfn_pte(pfn, prot) \
  248. __pte(((pte_basic_t)(pfn) << PFN_SHIFT_OFFSET) | pgprot_val(prot))
  249. #ifndef __ASSEMBLY__
  250. /*
  251. * The "pgd_xxx()" functions here are trivial for a folded two-level
  252. * setup: the pgd is never bad, and a pmd always exists (as it's folded
  253. * into the pgd entry)
  254. */
  255. static inline int pgd_none(pgd_t pgd) { return 0; }
  256. static inline int pgd_bad(pgd_t pgd) { return 0; }
  257. static inline int pgd_present(pgd_t pgd) { return 1; }
  258. #define pgd_clear(xp) do { } while (0)
  259. #define pgd_page(pgd) \
  260. ((unsigned long) __va(pgd_val(pgd) & PAGE_MASK))
  261. /*
  262. * The following only work if pte_present() is true.
  263. * Undefined behaviour if not..
  264. */
  265. static inline int pte_read(pte_t pte) { return pte_val(pte) & _PAGE_USER; }
  266. static inline int pte_write(pte_t pte) { return pte_val(pte) & _PAGE_RW; }
  267. static inline int pte_exec(pte_t pte) { return pte_val(pte) & _PAGE_EXEC; }
  268. static inline int pte_dirty(pte_t pte) { return pte_val(pte) & _PAGE_DIRTY; }
  269. static inline int pte_young(pte_t pte) { return pte_val(pte) & _PAGE_ACCESSED; }
  270. static inline int pte_file(pte_t pte) { return pte_val(pte) & _PAGE_FILE; }
  271. static inline void pte_uncache(pte_t pte) { pte_val(pte) |= _PAGE_NO_CACHE; }
  272. static inline void pte_cache(pte_t pte) { pte_val(pte) &= ~_PAGE_NO_CACHE; }
  273. static inline pte_t pte_rdprotect(pte_t pte) \
  274. { pte_val(pte) &= ~_PAGE_USER; return pte; }
  275. static inline pte_t pte_wrprotect(pte_t pte) \
  276. { pte_val(pte) &= ~(_PAGE_RW | _PAGE_HWWRITE); return pte; }
  277. static inline pte_t pte_exprotect(pte_t pte) \
  278. { pte_val(pte) &= ~_PAGE_EXEC; return pte; }
  279. static inline pte_t pte_mkclean(pte_t pte) \
  280. { pte_val(pte) &= ~(_PAGE_DIRTY | _PAGE_HWWRITE); return pte; }
  281. static inline pte_t pte_mkold(pte_t pte) \
  282. { pte_val(pte) &= ~_PAGE_ACCESSED; return pte; }
  283. static inline pte_t pte_mkread(pte_t pte) \
  284. { pte_val(pte) |= _PAGE_USER; return pte; }
  285. static inline pte_t pte_mkexec(pte_t pte) \
  286. { pte_val(pte) |= _PAGE_USER | _PAGE_EXEC; return pte; }
  287. static inline pte_t pte_mkwrite(pte_t pte) \
  288. { pte_val(pte) |= _PAGE_RW; return pte; }
  289. static inline pte_t pte_mkdirty(pte_t pte) \
  290. { pte_val(pte) |= _PAGE_DIRTY; return pte; }
  291. static inline pte_t pte_mkyoung(pte_t pte) \
  292. { pte_val(pte) |= _PAGE_ACCESSED; return pte; }
  293. /*
  294. * Conversion functions: convert a page and protection to a page entry,
  295. * and a page entry and page directory to the page they refer to.
  296. */
  297. static inline pte_t mk_pte_phys(phys_addr_t physpage, pgprot_t pgprot)
  298. {
  299. pte_t pte;
  300. pte_val(pte) = physpage | pgprot_val(pgprot);
  301. return pte;
  302. }
  303. #define mk_pte(page, pgprot) \
  304. ({ \
  305. pte_t pte; \
  306. pte_val(pte) = (((page - mem_map) << PAGE_SHIFT) + memory_start) | \
  307. pgprot_val(pgprot); \
  308. pte; \
  309. })
  310. static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
  311. {
  312. pte_val(pte) = (pte_val(pte) & _PAGE_CHG_MASK) | pgprot_val(newprot);
  313. return pte;
  314. }
  315. /*
  316. * Atomic PTE updates.
  317. *
  318. * pte_update clears and sets bit atomically, and returns
  319. * the old pte value.
  320. * The ((unsigned long)(p+1) - 4) hack is to get to the least-significant
  321. * 32 bits of the PTE regardless of whether PTEs are 32 or 64 bits.
  322. */
  323. static inline unsigned long pte_update(pte_t *p, unsigned long clr,
  324. unsigned long set)
  325. {
  326. unsigned long old, tmp, msr;
  327. __asm__ __volatile__("\
  328. msrclr %2, 0x2\n\
  329. nop\n\
  330. lw %0, %4, r0\n\
  331. andn %1, %0, %5\n\
  332. or %1, %1, %6\n\
  333. sw %1, %4, r0\n\
  334. mts rmsr, %2\n\
  335. nop"
  336. : "=&r" (old), "=&r" (tmp), "=&r" (msr), "=m" (*p)
  337. : "r" ((unsigned long)(p+1) - 4), "r" (clr), "r" (set), "m" (*p)
  338. : "cc");
  339. return old;
  340. }
  341. /*
  342. * set_pte stores a linux PTE into the linux page table.
  343. */
  344. static inline void set_pte(struct mm_struct *mm, unsigned long addr,
  345. pte_t *ptep, pte_t pte)
  346. {
  347. *ptep = pte;
  348. }
  349. static inline void set_pte_at(struct mm_struct *mm, unsigned long addr,
  350. pte_t *ptep, pte_t pte)
  351. {
  352. *ptep = pte;
  353. }
  354. static inline int ptep_test_and_clear_young(struct mm_struct *mm,
  355. unsigned long addr, pte_t *ptep)
  356. {
  357. return (pte_update(ptep, _PAGE_ACCESSED, 0) & _PAGE_ACCESSED) != 0;
  358. }
  359. static inline int ptep_test_and_clear_dirty(struct mm_struct *mm,
  360. unsigned long addr, pte_t *ptep)
  361. {
  362. return (pte_update(ptep, \
  363. (_PAGE_DIRTY | _PAGE_HWWRITE), 0) & _PAGE_DIRTY) != 0;
  364. }
  365. static inline pte_t ptep_get_and_clear(struct mm_struct *mm,
  366. unsigned long addr, pte_t *ptep)
  367. {
  368. return __pte(pte_update(ptep, ~_PAGE_HASHPTE, 0));
  369. }
  370. /*static inline void ptep_set_wrprotect(struct mm_struct *mm,
  371. unsigned long addr, pte_t *ptep)
  372. {
  373. pte_update(ptep, (_PAGE_RW | _PAGE_HWWRITE), 0);
  374. }*/
  375. static inline void ptep_mkdirty(struct mm_struct *mm,
  376. unsigned long addr, pte_t *ptep)
  377. {
  378. pte_update(ptep, 0, _PAGE_DIRTY);
  379. }
  380. /*#define pte_same(A,B) (((pte_val(A) ^ pte_val(B)) & ~_PAGE_HASHPTE) == 0)*/
  381. /* Convert pmd entry to page */
  382. /* our pmd entry is an effective address of pte table*/
  383. /* returns effective address of the pmd entry*/
  384. #define pmd_page_kernel(pmd) ((unsigned long) (pmd_val(pmd) & PAGE_MASK))
  385. /* returns struct *page of the pmd entry*/
  386. #define pmd_page(pmd) (pfn_to_page(__pa(pmd_val(pmd)) >> PAGE_SHIFT))
  387. /* to find an entry in a kernel page-table-directory */
  388. #define pgd_offset_k(address) pgd_offset(&init_mm, address)
  389. /* to find an entry in a page-table-directory */
  390. #define pgd_index(address) ((address) >> PGDIR_SHIFT)
  391. #define pgd_offset(mm, address) ((mm)->pgd + pgd_index(address))
  392. /* Find an entry in the second-level page table.. */
  393. static inline pmd_t *pmd_offset(pgd_t *dir, unsigned long address)
  394. {
  395. return (pmd_t *) dir;
  396. }
  397. /* Find an entry in the third-level page table.. */
  398. #define pte_index(address) \
  399. (((address) >> PAGE_SHIFT) & (PTRS_PER_PTE - 1))
  400. #define pte_offset_kernel(dir, addr) \
  401. ((pte_t *) pmd_page_kernel(*(dir)) + pte_index(addr))
  402. #define pte_offset_map(dir, addr) \
  403. ((pte_t *) kmap_atomic(pmd_page(*(dir)), KM_PTE0) + pte_index(addr))
  404. #define pte_offset_map_nested(dir, addr) \
  405. ((pte_t *) kmap_atomic(pmd_page(*(dir)), KM_PTE1) + pte_index(addr))
  406. #define pte_unmap(pte) kunmap_atomic(pte, KM_PTE0)
  407. #define pte_unmap_nested(pte) kunmap_atomic(pte, KM_PTE1)
  408. /* Encode and decode a nonlinear file mapping entry */
  409. #define PTE_FILE_MAX_BITS 29
  410. #define pte_to_pgoff(pte) (pte_val(pte) >> 3)
  411. #define pgoff_to_pte(off) ((pte_t) { ((off) << 3) | _PAGE_FILE })
  412. extern pgd_t swapper_pg_dir[PTRS_PER_PGD];
  413. /*
  414. * When flushing the tlb entry for a page, we also need to flush the hash
  415. * table entry. flush_hash_page is assembler (for speed) in hashtable.S.
  416. */
  417. extern int flush_hash_page(unsigned context, unsigned long va, pte_t *ptep);
  418. /* Add an HPTE to the hash table */
  419. extern void add_hash_page(unsigned context, unsigned long va, pte_t *ptep);
  420. /*
  421. * Encode and decode a swap entry.
  422. * Note that the bits we use in a PTE for representing a swap entry
  423. * must not include the _PAGE_PRESENT bit, or the _PAGE_HASHPTE bit
  424. * (if used). -- paulus
  425. */
  426. #define __swp_type(entry) ((entry).val & 0x3f)
  427. #define __swp_offset(entry) ((entry).val >> 6)
  428. #define __swp_entry(type, offset) \
  429. ((swp_entry_t) { (type) | ((offset) << 6) })
  430. #define __pte_to_swp_entry(pte) ((swp_entry_t) { pte_val(pte) >> 2 })
  431. #define __swp_entry_to_pte(x) ((pte_t) { (x).val << 2 })
  432. /* CONFIG_APUS */
  433. /* For virtual address to physical address conversion */
  434. extern void cache_clear(__u32 addr, int length);
  435. extern void cache_push(__u32 addr, int length);
  436. extern int mm_end_of_chunk(unsigned long addr, int len);
  437. extern unsigned long iopa(unsigned long addr);
  438. /* extern unsigned long mm_ptov(unsigned long addr) \
  439. __attribute__ ((const)); TBD */
  440. /* Values for nocacheflag and cmode */
  441. /* These are not used by the APUS kernel_map, but prevents
  442. * compilation errors.
  443. */
  444. #define IOMAP_FULL_CACHING 0
  445. #define IOMAP_NOCACHE_SER 1
  446. #define IOMAP_NOCACHE_NONSER 2
  447. #define IOMAP_NO_COPYBACK 3
  448. /*
  449. * Map some physical address range into the kernel address space.
  450. */
  451. extern unsigned long kernel_map(unsigned long paddr, unsigned long size,
  452. int nocacheflag, unsigned long *memavailp);
  453. /*
  454. * Set cache mode of (kernel space) address range.
  455. */
  456. extern void kernel_set_cachemode(unsigned long address, unsigned long size,
  457. unsigned int cmode);
  458. /* Needs to be defined here and not in linux/mm.h, as it is arch dependent */
  459. #define kern_addr_valid(addr) (1)
  460. #define io_remap_page_range remap_page_range
  461. /*
  462. * No page table caches to initialise
  463. */
  464. #define pgtable_cache_init() do { } while (0)
  465. void do_page_fault(struct pt_regs *regs, unsigned long address,
  466. unsigned long error_code);
  467. void __init io_block_mapping(unsigned long virt, phys_addr_t phys,
  468. unsigned int size, int flags);
  469. void __init adjust_total_lowmem(void);
  470. void mapin_ram(void);
  471. int map_page(unsigned long va, phys_addr_t pa, int flags);
  472. extern int mem_init_done;
  473. extern unsigned long ioremap_base;
  474. extern unsigned long ioremap_bot;
  475. asmlinkage void __init mmu_init(void);
  476. void __init *early_get_page(void);
  477. void *consistent_alloc(int gfp, size_t size, dma_addr_t *dma_handle);
  478. void consistent_free(void *vaddr);
  479. void consistent_sync(void *vaddr, size_t size, int direction);
  480. void consistent_sync_page(struct page *page, unsigned long offset,
  481. size_t size, int direction);
  482. #endif /* __ASSEMBLY__ */
  483. #endif /* __KERNEL__ */
  484. #endif /* CONFIG_MMU */
  485. #ifndef __ASSEMBLY__
  486. #include <asm-generic/pgtable.h>
  487. void setup_memory(void);
  488. #endif /* __ASSEMBLY__ */
  489. #endif /* _ASM_MICROBLAZE_PGTABLE_H */