pgtable.h 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526
  1. /* pgtable.h: FR-V page table mangling
  2. *
  3. * Copyright (C) 2004 Red Hat, Inc. All Rights Reserved.
  4. * Written by David Howells (dhowells@redhat.com)
  5. *
  6. * This program is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU General Public License
  8. * as published by the Free Software Foundation; either version
  9. * 2 of the License, or (at your option) any later version.
  10. *
  11. * Derived from:
  12. * include/asm-m68knommu/pgtable.h
  13. * include/asm-i386/pgtable.h
  14. */
  15. #ifndef _ASM_PGTABLE_H
  16. #define _ASM_PGTABLE_H
  17. #include <asm/mem-layout.h>
  18. #include <asm/setup.h>
  19. #include <asm/processor.h>
  20. #ifndef __ASSEMBLY__
  21. #include <linux/threads.h>
  22. #include <linux/slab.h>
  23. #include <linux/list.h>
  24. #include <linux/spinlock.h>
  25. #include <linux/sched.h>
  26. struct vm_area_struct;
  27. #endif
  28. #ifndef __ASSEMBLY__
  29. #if defined(CONFIG_HIGHPTE)
  30. typedef unsigned long pte_addr_t;
  31. #else
  32. typedef pte_t *pte_addr_t;
  33. #endif
  34. #endif
  35. /*****************************************************************************/
  36. /*
  37. * MMU-less operation case first
  38. */
  39. #ifndef CONFIG_MMU
  40. #define pgd_present(pgd) (1) /* pages are always present on NO_MM */
  41. #define pgd_none(pgd) (0)
  42. #define pgd_bad(pgd) (0)
  43. #define pgd_clear(pgdp)
  44. #define kern_addr_valid(addr) (1)
  45. #define pmd_offset(a, b) ((void *) 0)
  46. #define PAGE_NONE __pgprot(0) /* these mean nothing to NO_MM */
  47. #define PAGE_SHARED __pgprot(0) /* these mean nothing to NO_MM */
  48. #define PAGE_COPY __pgprot(0) /* these mean nothing to NO_MM */
  49. #define PAGE_READONLY __pgprot(0) /* these mean nothing to NO_MM */
  50. #define PAGE_KERNEL __pgprot(0) /* these mean nothing to NO_MM */
  51. #define __swp_type(x) (0)
  52. #define __swp_offset(x) (0)
  53. #define __swp_entry(typ,off) ((swp_entry_t) { ((typ) | ((off) << 7)) })
  54. #define __pte_to_swp_entry(pte) ((swp_entry_t) { pte_val(pte) })
  55. #define __swp_entry_to_pte(x) ((pte_t) { (x).val })
  56. #define ZERO_PAGE(vaddr) ({ BUG(); NULL; })
  57. #define swapper_pg_dir ((pgd_t *) NULL)
  58. #define pgtable_cache_init() do {} while (0)
  59. #include <asm-generic/pgtable.h>
  60. #else /* !CONFIG_MMU */
  61. /*****************************************************************************/
  62. /*
  63. * then MMU operation
  64. */
  65. /*
  66. * ZERO_PAGE is a global shared page that is always zero: used
  67. * for zero-mapped memory areas etc..
  68. */
  69. #ifndef __ASSEMBLY__
  70. extern unsigned long empty_zero_page;
  71. #define ZERO_PAGE(vaddr) virt_to_page(empty_zero_page)
  72. #endif
  73. /*
  74. * we use 2-level page tables, folding the PMD (mid-level table) into the PGE (top-level entry)
  75. * [see Documentation/frv/mmu-layout.txt]
  76. *
  77. * Page Directory:
  78. * - Size: 16KB
  79. * - 64 PGEs per PGD
  80. * - Each PGE holds 1 PUD and covers 64MB
  81. *
  82. * Page Upper Directory:
  83. * - Size: 256B
  84. * - 1 PUE per PUD
  85. * - Each PUE holds 1 PMD and covers 64MB
  86. *
  87. * Page Mid-Level Directory
  88. * - Size: 256B
  89. * - 1 PME per PMD
  90. * - Each PME holds 64 STEs, all of which point to separate chunks of the same Page Table
  91. * - All STEs are instantiated at the same time
  92. *
  93. * Page Table
  94. * - Size: 16KB
  95. * - 4096 PTEs per PT
  96. * - Each Linux PT is subdivided into 64 FR451 PT's, each of which holds 64 entries
  97. *
  98. * Pages
  99. * - Size: 4KB
  100. *
  101. * total PTEs
  102. * = 1 PML4E * 64 PGEs * 1 PUEs * 1 PMEs * 4096 PTEs
  103. * = 1 PML4E * 64 PGEs * 64 STEs * 64 PTEs/FR451-PT
  104. * = 262144 (or 256 * 1024)
  105. */
  106. #define PGDIR_SHIFT 26
  107. #define PGDIR_SIZE (1UL << PGDIR_SHIFT)
  108. #define PGDIR_MASK (~(PGDIR_SIZE - 1))
  109. #define PTRS_PER_PGD 64
  110. #define __PAGETABLE_PUD_FOLDED
  111. #define PUD_SHIFT 26
  112. #define PTRS_PER_PUD 1
  113. #define PUD_SIZE (1UL << PUD_SHIFT)
  114. #define PUD_MASK (~(PUD_SIZE - 1))
  115. #define PUE_SIZE 256
  116. #define __PAGETABLE_PMD_FOLDED
  117. #define PMD_SHIFT 26
  118. #define PMD_SIZE (1UL << PMD_SHIFT)
  119. #define PMD_MASK (~(PMD_SIZE - 1))
  120. #define PTRS_PER_PMD 1
  121. #define PME_SIZE 256
  122. #define __frv_PT_SIZE 256
  123. #define PTRS_PER_PTE 4096
  124. #define USER_PGDS_IN_LAST_PML4 (TASK_SIZE / PGDIR_SIZE)
  125. #define FIRST_USER_ADDRESS 0UL
  126. #define USER_PGD_PTRS (PAGE_OFFSET >> PGDIR_SHIFT)
  127. #define KERNEL_PGD_PTRS (PTRS_PER_PGD - USER_PGD_PTRS)
  128. #define TWOLEVEL_PGDIR_SHIFT 26
  129. #define BOOT_USER_PGD_PTRS (__PAGE_OFFSET >> TWOLEVEL_PGDIR_SHIFT)
  130. #define BOOT_KERNEL_PGD_PTRS (PTRS_PER_PGD - BOOT_USER_PGD_PTRS)
  131. #ifndef __ASSEMBLY__
  132. extern pgd_t swapper_pg_dir[PTRS_PER_PGD];
  133. #define pte_ERROR(e) \
  134. printk("%s:%d: bad pte %08lx.\n", __FILE__, __LINE__, (e).pte)
  135. #define pmd_ERROR(e) \
  136. printk("%s:%d: bad pmd %08lx.\n", __FILE__, __LINE__, pmd_val(e))
  137. #define pud_ERROR(e) \
  138. printk("%s:%d: bad pud %08lx.\n", __FILE__, __LINE__, pmd_val(pud_val(e)))
  139. #define pgd_ERROR(e) \
  140. printk("%s:%d: bad pgd %08lx.\n", __FILE__, __LINE__, pmd_val(pud_val(pgd_val(e))))
  141. /*
  142. * Certain architectures need to do special things when PTEs
  143. * within a page table are directly modified. Thus, the following
  144. * hook is made available.
  145. */
  146. #define set_pte(pteptr, pteval) \
  147. do { \
  148. *(pteptr) = (pteval); \
  149. asm volatile("dcf %M0" :: "U"(*pteptr)); \
  150. } while(0)
  151. #define set_pte_at(mm,addr,ptep,pteval) set_pte(ptep,pteval)
  152. /*
  153. * pgd_offset() returns a (pgd_t *)
  154. * pgd_index() is used get the offset into the pgd page's array of pgd_t's;
  155. */
  156. #define pgd_offset(mm, address) ((mm)->pgd + pgd_index(address))
  157. /*
  158. * a shortcut which implies the use of the kernel's pgd, instead
  159. * of a process's
  160. */
  161. #define pgd_offset_k(address) pgd_offset(&init_mm, address)
  162. /*
  163. * The "pgd_xxx()" functions here are trivial for a folded two-level
  164. * setup: the pud is never bad, and a pud always exists (as it's folded
  165. * into the pgd entry)
  166. */
  167. static inline int pgd_none(pgd_t pgd) { return 0; }
  168. static inline int pgd_bad(pgd_t pgd) { return 0; }
  169. static inline int pgd_present(pgd_t pgd) { return 1; }
  170. static inline void pgd_clear(pgd_t *pgd) { }
  171. #define pgd_populate(mm, pgd, pud) do { } while (0)
  172. /*
  173. * (puds are folded into pgds so this doesn't get actually called,
  174. * but the define is needed for a generic inline function.)
  175. */
  176. #define set_pgd(pgdptr, pgdval) \
  177. do { \
  178. memcpy((pgdptr), &(pgdval), sizeof(pgd_t)); \
  179. asm volatile("dcf %M0" :: "U"(*(pgdptr))); \
  180. } while(0)
  181. static inline pud_t *pud_offset(pgd_t *pgd, unsigned long address)
  182. {
  183. return (pud_t *) pgd;
  184. }
  185. #define pgd_page(pgd) (pud_page((pud_t){ pgd }))
  186. #define pgd_page_vaddr(pgd) (pud_page_vaddr((pud_t){ pgd }))
  187. /*
  188. * allocating and freeing a pud is trivial: the 1-entry pud is
  189. * inside the pgd, so has no extra memory associated with it.
  190. */
  191. #define pud_alloc_one(mm, address) NULL
  192. #define pud_free(mm, x) do { } while (0)
  193. #define __pud_free_tlb(tlb, x, address) do { } while (0)
  194. /*
  195. * The "pud_xxx()" functions here are trivial for a folded two-level
  196. * setup: the pmd is never bad, and a pmd always exists (as it's folded
  197. * into the pud entry)
  198. */
  199. static inline int pud_none(pud_t pud) { return 0; }
  200. static inline int pud_bad(pud_t pud) { return 0; }
  201. static inline int pud_present(pud_t pud) { return 1; }
  202. static inline void pud_clear(pud_t *pud) { }
  203. #define pud_populate(mm, pmd, pte) do { } while (0)
  204. /*
  205. * (pmds are folded into puds so this doesn't get actually called,
  206. * but the define is needed for a generic inline function.)
  207. */
  208. #define set_pud(pudptr, pudval) set_pmd((pmd_t *)(pudptr), (pmd_t) { pudval })
  209. #define pud_page(pud) (pmd_page((pmd_t){ pud }))
  210. #define pud_page_vaddr(pud) (pmd_page_vaddr((pmd_t){ pud }))
  211. /*
  212. * (pmds are folded into pgds so this doesn't get actually called,
  213. * but the define is needed for a generic inline function.)
  214. */
  215. extern void __set_pmd(pmd_t *pmdptr, unsigned long __pmd);
  216. #define set_pmd(pmdptr, pmdval) \
  217. do { \
  218. __set_pmd((pmdptr), (pmdval).ste[0]); \
  219. } while(0)
  220. #define __pmd_index(address) 0
  221. static inline pmd_t *pmd_offset(pud_t *dir, unsigned long address)
  222. {
  223. return (pmd_t *) dir + __pmd_index(address);
  224. }
  225. #define pte_same(a, b) ((a).pte == (b).pte)
  226. #define pte_page(x) (mem_map + ((unsigned long)(((x).pte >> PAGE_SHIFT))))
  227. #define pte_none(x) (!(x).pte)
  228. #define pte_pfn(x) ((unsigned long)(((x).pte >> PAGE_SHIFT)))
  229. #define pfn_pte(pfn, prot) __pte(((pfn) << PAGE_SHIFT) | pgprot_val(prot))
  230. #define pfn_pmd(pfn, prot) __pmd(((pfn) << PAGE_SHIFT) | pgprot_val(prot))
  231. #define VMALLOC_VMADDR(x) ((unsigned long) (x))
  232. #endif /* !__ASSEMBLY__ */
  233. /*
  234. * control flags in AMPR registers and TLB entries
  235. */
  236. #define _PAGE_BIT_PRESENT xAMPRx_V_BIT
  237. #define _PAGE_BIT_WP DAMPRx_WP_BIT
  238. #define _PAGE_BIT_NOCACHE xAMPRx_C_BIT
  239. #define _PAGE_BIT_SUPER xAMPRx_S_BIT
  240. #define _PAGE_BIT_ACCESSED xAMPRx_RESERVED8_BIT
  241. #define _PAGE_BIT_DIRTY xAMPRx_M_BIT
  242. #define _PAGE_BIT_NOTGLOBAL xAMPRx_NG_BIT
  243. #define _PAGE_PRESENT xAMPRx_V
  244. #define _PAGE_WP DAMPRx_WP
  245. #define _PAGE_NOCACHE xAMPRx_C
  246. #define _PAGE_SUPER xAMPRx_S
  247. #define _PAGE_ACCESSED xAMPRx_RESERVED8 /* accessed if set */
  248. #define _PAGE_DIRTY xAMPRx_M
  249. #define _PAGE_NOTGLOBAL xAMPRx_NG
  250. #define _PAGE_RESERVED_MASK (xAMPRx_RESERVED8 | xAMPRx_RESERVED13)
  251. #define _PAGE_PROTNONE 0x000 /* If not present */
  252. #define _PAGE_CHG_MASK (PTE_MASK | _PAGE_ACCESSED | _PAGE_DIRTY)
  253. #define __PGPROT_BASE \
  254. (_PAGE_PRESENT | xAMPRx_SS_16Kb | xAMPRx_D | _PAGE_NOTGLOBAL | _PAGE_ACCESSED)
  255. #define PAGE_NONE __pgprot(_PAGE_PROTNONE | _PAGE_ACCESSED)
  256. #define PAGE_SHARED __pgprot(__PGPROT_BASE)
  257. #define PAGE_COPY __pgprot(__PGPROT_BASE | _PAGE_WP)
  258. #define PAGE_READONLY __pgprot(__PGPROT_BASE | _PAGE_WP)
  259. #define __PAGE_KERNEL (__PGPROT_BASE | _PAGE_SUPER | _PAGE_DIRTY)
  260. #define __PAGE_KERNEL_NOCACHE (__PGPROT_BASE | _PAGE_SUPER | _PAGE_DIRTY | _PAGE_NOCACHE)
  261. #define __PAGE_KERNEL_RO (__PGPROT_BASE | _PAGE_SUPER | _PAGE_DIRTY | _PAGE_WP)
  262. #define MAKE_GLOBAL(x) __pgprot((x) & ~_PAGE_NOTGLOBAL)
  263. #define PAGE_KERNEL MAKE_GLOBAL(__PAGE_KERNEL)
  264. #define PAGE_KERNEL_RO MAKE_GLOBAL(__PAGE_KERNEL_RO)
  265. #define PAGE_KERNEL_NOCACHE MAKE_GLOBAL(__PAGE_KERNEL_NOCACHE)
  266. #define _PAGE_TABLE (_PAGE_PRESENT | xAMPRx_SS_16Kb)
  267. #ifndef __ASSEMBLY__
  268. /*
  269. * The FR451 can do execute protection by virtue of having separate TLB miss handlers for
  270. * instruction access and for data access. However, we don't have enough reserved bits to say
  271. * "execute only", so we don't bother. If you can read it, you can execute it and vice versa.
  272. */
  273. #define __P000 PAGE_NONE
  274. #define __P001 PAGE_READONLY
  275. #define __P010 PAGE_COPY
  276. #define __P011 PAGE_COPY
  277. #define __P100 PAGE_READONLY
  278. #define __P101 PAGE_READONLY
  279. #define __P110 PAGE_COPY
  280. #define __P111 PAGE_COPY
  281. #define __S000 PAGE_NONE
  282. #define __S001 PAGE_READONLY
  283. #define __S010 PAGE_SHARED
  284. #define __S011 PAGE_SHARED
  285. #define __S100 PAGE_READONLY
  286. #define __S101 PAGE_READONLY
  287. #define __S110 PAGE_SHARED
  288. #define __S111 PAGE_SHARED
  289. /*
  290. * Define this to warn about kernel memory accesses that are
  291. * done without a 'access_ok(VERIFY_WRITE,..)'
  292. */
  293. #undef TEST_ACCESS_OK
  294. #define pte_present(x) (pte_val(x) & _PAGE_PRESENT)
  295. #define pte_clear(mm,addr,xp) do { set_pte_at(mm, addr, xp, __pte(0)); } while (0)
  296. #define pmd_none(x) (!pmd_val(x))
  297. #define pmd_present(x) (pmd_val(x) & _PAGE_PRESENT)
  298. #define pmd_bad(x) (pmd_val(x) & xAMPRx_SS)
  299. #define pmd_clear(xp) do { __set_pmd(xp, 0); } while(0)
  300. #define pmd_page_vaddr(pmd) \
  301. ((unsigned long) __va(pmd_val(pmd) & PAGE_MASK))
  302. #ifndef CONFIG_DISCONTIGMEM
  303. #define pmd_page(pmd) (pfn_to_page(pmd_val(pmd) >> PAGE_SHIFT))
  304. #endif
  305. #define pages_to_mb(x) ((x) >> (20-PAGE_SHIFT))
  306. /*
  307. * The following only work if pte_present() is true.
  308. * Undefined behaviour if not..
  309. */
  310. static inline int pte_dirty(pte_t pte) { return (pte).pte & _PAGE_DIRTY; }
  311. static inline int pte_young(pte_t pte) { return (pte).pte & _PAGE_ACCESSED; }
  312. static inline int pte_write(pte_t pte) { return !((pte).pte & _PAGE_WP); }
  313. static inline int pte_special(pte_t pte) { return 0; }
  314. static inline pte_t pte_mkclean(pte_t pte) { (pte).pte &= ~_PAGE_DIRTY; return pte; }
  315. static inline pte_t pte_mkold(pte_t pte) { (pte).pte &= ~_PAGE_ACCESSED; return pte; }
  316. static inline pte_t pte_wrprotect(pte_t pte) { (pte).pte |= _PAGE_WP; return pte; }
  317. static inline pte_t pte_mkdirty(pte_t pte) { (pte).pte |= _PAGE_DIRTY; return pte; }
  318. static inline pte_t pte_mkyoung(pte_t pte) { (pte).pte |= _PAGE_ACCESSED; return pte; }
  319. static inline pte_t pte_mkwrite(pte_t pte) { (pte).pte &= ~_PAGE_WP; return pte; }
  320. static inline pte_t pte_mkspecial(pte_t pte) { return pte; }
  321. static inline int ptep_test_and_clear_young(struct vm_area_struct *vma, unsigned long addr, pte_t *ptep)
  322. {
  323. int i = test_and_clear_bit(_PAGE_BIT_ACCESSED, ptep);
  324. asm volatile("dcf %M0" :: "U"(*ptep));
  325. return i;
  326. }
  327. static inline pte_t ptep_get_and_clear(struct mm_struct *mm, unsigned long addr, pte_t *ptep)
  328. {
  329. unsigned long x = xchg(&ptep->pte, 0);
  330. asm volatile("dcf %M0" :: "U"(*ptep));
  331. return __pte(x);
  332. }
  333. static inline void ptep_set_wrprotect(struct mm_struct *mm, unsigned long addr, pte_t *ptep)
  334. {
  335. set_bit(_PAGE_BIT_WP, ptep);
  336. asm volatile("dcf %M0" :: "U"(*ptep));
  337. }
  338. /*
  339. * Macro to mark a page protection value as "uncacheable"
  340. */
  341. #define pgprot_noncached(prot) (__pgprot(pgprot_val(prot) | _PAGE_NOCACHE))
  342. /*
  343. * Conversion functions: convert a page and protection to a page entry,
  344. * and a page entry and page directory to the page they refer to.
  345. */
  346. #define mk_pte(page, pgprot) pfn_pte(page_to_pfn(page), (pgprot))
  347. #define mk_pte_huge(entry) ((entry).pte_low |= _PAGE_PRESENT | _PAGE_PSE)
  348. /* This takes a physical page address that is used by the remapping functions */
  349. #define mk_pte_phys(physpage, pgprot) pfn_pte((physpage) >> PAGE_SHIFT, pgprot)
  350. static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
  351. {
  352. pte.pte &= _PAGE_CHG_MASK;
  353. pte.pte |= pgprot_val(newprot);
  354. return pte;
  355. }
  356. /* to find an entry in a page-table-directory. */
  357. #define pgd_index(address) (((address) >> PGDIR_SHIFT) & (PTRS_PER_PGD - 1))
  358. #define pgd_index_k(addr) pgd_index(addr)
  359. /* Find an entry in the bottom-level page table.. */
  360. #define __pte_index(address) (((address) >> PAGE_SHIFT) & (PTRS_PER_PTE - 1))
  361. /*
  362. * the pte page can be thought of an array like this: pte_t[PTRS_PER_PTE]
  363. *
  364. * this macro returns the index of the entry in the pte page which would
  365. * control the given virtual address
  366. */
  367. #define pte_index(address) \
  368. (((address) >> PAGE_SHIFT) & (PTRS_PER_PTE - 1))
  369. #define pte_offset_kernel(dir, address) \
  370. ((pte_t *) pmd_page_vaddr(*(dir)) + pte_index(address))
  371. #if defined(CONFIG_HIGHPTE)
  372. #define pte_offset_map(dir, address) \
  373. ((pte_t *)kmap_atomic(pmd_page(*(dir))) + pte_index(address))
  374. #define pte_unmap(pte) kunmap_atomic(pte)
  375. #else
  376. #define pte_offset_map(dir, address) \
  377. ((pte_t *)page_address(pmd_page(*(dir))) + pte_index(address))
  378. #define pte_unmap(pte) do { } while (0)
  379. #endif
  380. /*
  381. * Handle swap and file entries
  382. * - the PTE is encoded in the following format:
  383. * bit 0: Must be 0 (!_PAGE_PRESENT)
  384. * bits 1-6: Swap type
  385. * bits 7-31: Swap offset
  386. */
  387. #define __swp_type(x) (((x).val >> 1) & 0x1f)
  388. #define __swp_offset(x) ((x).val >> 7)
  389. #define __swp_entry(type, offset) ((swp_entry_t) { ((type) << 1) | ((offset) << 7) })
  390. #define __pte_to_swp_entry(_pte) ((swp_entry_t) { (_pte).pte })
  391. #define __swp_entry_to_pte(x) ((pte_t) { (x).val })
  392. /* Needs to be defined here and not in linux/mm.h, as it is arch dependent */
  393. #define PageSkip(page) (0)
  394. #define kern_addr_valid(addr) (1)
  395. #define __HAVE_ARCH_PTEP_TEST_AND_CLEAR_YOUNG
  396. #define __HAVE_ARCH_PTEP_GET_AND_CLEAR
  397. #define __HAVE_ARCH_PTEP_SET_WRPROTECT
  398. #define __HAVE_ARCH_PTE_SAME
  399. #include <asm-generic/pgtable.h>
  400. /*
  401. * preload information about a newly instantiated PTE into the SCR0/SCR1 PGE cache
  402. */
  403. static inline void update_mmu_cache(struct vm_area_struct *vma, unsigned long address, pte_t *ptep)
  404. {
  405. struct mm_struct *mm;
  406. unsigned long ampr;
  407. mm = current->mm;
  408. if (mm) {
  409. pgd_t *pge = pgd_offset(mm, address);
  410. pud_t *pue = pud_offset(pge, address);
  411. pmd_t *pme = pmd_offset(pue, address);
  412. ampr = pme->ste[0] & 0xffffff00;
  413. ampr |= xAMPRx_L | xAMPRx_SS_16Kb | xAMPRx_S | xAMPRx_C |
  414. xAMPRx_V;
  415. } else {
  416. address = ULONG_MAX;
  417. ampr = 0;
  418. }
  419. asm volatile("movgs %0,scr0\n"
  420. "movgs %0,scr1\n"
  421. "movgs %1,dampr4\n"
  422. "movgs %1,dampr5\n"
  423. :
  424. : "r"(address), "r"(ampr)
  425. );
  426. }
  427. #ifdef CONFIG_PROC_FS
  428. extern char *proc_pid_status_frv_cxnr(struct mm_struct *mm, char *buffer);
  429. #endif
  430. extern void __init pgtable_cache_init(void);
  431. #endif /* !__ASSEMBLY__ */
  432. #endif /* !CONFIG_MMU */
  433. #ifndef __ASSEMBLY__
  434. extern void __init paging_init(void);
  435. #endif /* !__ASSEMBLY__ */
  436. #endif /* _ASM_PGTABLE_H */