pgtable.h 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528
  1. #ifndef _I386_PGTABLE_H
  2. #define _I386_PGTABLE_H
  3. /*
  4. * The Linux memory management assumes a three-level page table setup. On
  5. * the i386, we use that, but "fold" the mid level into the top-level page
  6. * table, so that we physically have the same two-level page table as the
  7. * i386 mmu expects.
  8. *
  9. * This file contains the functions and defines necessary to modify and use
  10. * the i386 page table tree.
  11. */
  12. #ifndef __ASSEMBLY__
  13. #include <asm/processor.h>
  14. #include <asm/fixmap.h>
  15. #include <linux/threads.h>
  16. #include <asm/paravirt.h>
  17. #ifndef _I386_BITOPS_H
  18. #include <asm/bitops.h>
  19. #endif
  20. #include <linux/slab.h>
  21. #include <linux/list.h>
  22. #include <linux/spinlock.h>
  23. struct mm_struct;
  24. struct vm_area_struct;
  25. /*
  26. * ZERO_PAGE is a global shared page that is always zero: used
  27. * for zero-mapped memory areas etc..
  28. */
  29. #define ZERO_PAGE(vaddr) (virt_to_page(empty_zero_page))
  30. extern unsigned long empty_zero_page[1024];
  31. extern pgd_t swapper_pg_dir[1024];
  32. extern struct kmem_cache *pgd_cache;
  33. extern struct kmem_cache *pmd_cache;
  34. extern spinlock_t pgd_lock;
  35. extern struct page *pgd_list;
  36. void pmd_ctor(void *, struct kmem_cache *, unsigned long);
  37. void pgd_ctor(void *, struct kmem_cache *, unsigned long);
  38. void pgd_dtor(void *, struct kmem_cache *, unsigned long);
  39. void pgtable_cache_init(void);
  40. void paging_init(void);
  41. /*
  42. * The Linux x86 paging architecture is 'compile-time dual-mode', it
  43. * implements both the traditional 2-level x86 page tables and the
  44. * newer 3-level PAE-mode page tables.
  45. */
  46. #ifdef CONFIG_X86_PAE
  47. # include <asm/pgtable-3level-defs.h>
  48. # define PMD_SIZE (1UL << PMD_SHIFT)
  49. # define PMD_MASK (~(PMD_SIZE-1))
  50. #else
  51. # include <asm/pgtable-2level-defs.h>
  52. #endif
  53. #define PGDIR_SIZE (1UL << PGDIR_SHIFT)
  54. #define PGDIR_MASK (~(PGDIR_SIZE-1))
  55. #define USER_PTRS_PER_PGD (TASK_SIZE/PGDIR_SIZE)
  56. #define FIRST_USER_ADDRESS 0
  57. #define USER_PGD_PTRS (PAGE_OFFSET >> PGDIR_SHIFT)
  58. #define KERNEL_PGD_PTRS (PTRS_PER_PGD-USER_PGD_PTRS)
  59. #define TWOLEVEL_PGDIR_SHIFT 22
  60. #define BOOT_USER_PGD_PTRS (__PAGE_OFFSET >> TWOLEVEL_PGDIR_SHIFT)
  61. #define BOOT_KERNEL_PGD_PTRS (1024-BOOT_USER_PGD_PTRS)
  62. /* Just any arbitrary offset to the start of the vmalloc VM area: the
  63. * current 8MB value just means that there will be a 8MB "hole" after the
  64. * physical memory until the kernel virtual memory starts. That means that
  65. * any out-of-bounds memory accesses will hopefully be caught.
  66. * The vmalloc() routines leaves a hole of 4kB between each vmalloced
  67. * area for the same reason. ;)
  68. */
  69. #define VMALLOC_OFFSET (8*1024*1024)
  70. #define VMALLOC_START (((unsigned long) high_memory + vmalloc_earlyreserve + \
  71. 2*VMALLOC_OFFSET-1) & ~(VMALLOC_OFFSET-1))
  72. #ifdef CONFIG_HIGHMEM
  73. # define VMALLOC_END (PKMAP_BASE-2*PAGE_SIZE)
  74. #else
  75. # define VMALLOC_END (FIXADDR_START-2*PAGE_SIZE)
  76. #endif
  77. /*
  78. * _PAGE_PSE set in the page directory entry just means that
  79. * the page directory entry points directly to a 4MB-aligned block of
  80. * memory.
  81. */
  82. #define _PAGE_BIT_PRESENT 0
  83. #define _PAGE_BIT_RW 1
  84. #define _PAGE_BIT_USER 2
  85. #define _PAGE_BIT_PWT 3
  86. #define _PAGE_BIT_PCD 4
  87. #define _PAGE_BIT_ACCESSED 5
  88. #define _PAGE_BIT_DIRTY 6
  89. #define _PAGE_BIT_PSE 7 /* 4 MB (or 2MB) page, Pentium+, if present.. */
  90. #define _PAGE_BIT_GLOBAL 8 /* Global TLB entry PPro+ */
  91. #define _PAGE_BIT_UNUSED1 9 /* available for programmer */
  92. #define _PAGE_BIT_UNUSED2 10
  93. #define _PAGE_BIT_UNUSED3 11
  94. #define _PAGE_BIT_NX 63
  95. #define _PAGE_PRESENT 0x001
  96. #define _PAGE_RW 0x002
  97. #define _PAGE_USER 0x004
  98. #define _PAGE_PWT 0x008
  99. #define _PAGE_PCD 0x010
  100. #define _PAGE_ACCESSED 0x020
  101. #define _PAGE_DIRTY 0x040
  102. #define _PAGE_PSE 0x080 /* 4 MB (or 2MB) page, Pentium+, if present.. */
  103. #define _PAGE_GLOBAL 0x100 /* Global TLB entry PPro+ */
  104. #define _PAGE_UNUSED1 0x200 /* available for programmer */
  105. #define _PAGE_UNUSED2 0x400
  106. #define _PAGE_UNUSED3 0x800
  107. /* If _PAGE_PRESENT is clear, we use these: */
  108. #define _PAGE_FILE 0x040 /* nonlinear file mapping, saved PTE; unset:swap */
  109. #define _PAGE_PROTNONE 0x080 /* if the user mapped it with PROT_NONE;
  110. pte_present gives true */
  111. #ifdef CONFIG_X86_PAE
  112. #define _PAGE_NX (1ULL<<_PAGE_BIT_NX)
  113. #else
  114. #define _PAGE_NX 0
  115. #endif
  116. #define _PAGE_TABLE (_PAGE_PRESENT | _PAGE_RW | _PAGE_USER | _PAGE_ACCESSED | _PAGE_DIRTY)
  117. #define _KERNPG_TABLE (_PAGE_PRESENT | _PAGE_RW | _PAGE_ACCESSED | _PAGE_DIRTY)
  118. #define _PAGE_CHG_MASK (PTE_MASK | _PAGE_ACCESSED | _PAGE_DIRTY)
  119. #define PAGE_NONE \
  120. __pgprot(_PAGE_PROTNONE | _PAGE_ACCESSED)
  121. #define PAGE_SHARED \
  122. __pgprot(_PAGE_PRESENT | _PAGE_RW | _PAGE_USER | _PAGE_ACCESSED)
  123. #define PAGE_SHARED_EXEC \
  124. __pgprot(_PAGE_PRESENT | _PAGE_RW | _PAGE_USER | _PAGE_ACCESSED)
  125. #define PAGE_COPY_NOEXEC \
  126. __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_ACCESSED | _PAGE_NX)
  127. #define PAGE_COPY_EXEC \
  128. __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_ACCESSED)
  129. #define PAGE_COPY \
  130. PAGE_COPY_NOEXEC
  131. #define PAGE_READONLY \
  132. __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_ACCESSED | _PAGE_NX)
  133. #define PAGE_READONLY_EXEC \
  134. __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_ACCESSED)
  135. #define _PAGE_KERNEL \
  136. (_PAGE_PRESENT | _PAGE_RW | _PAGE_DIRTY | _PAGE_ACCESSED | _PAGE_NX)
  137. #define _PAGE_KERNEL_EXEC \
  138. (_PAGE_PRESENT | _PAGE_RW | _PAGE_DIRTY | _PAGE_ACCESSED)
  139. extern unsigned long long __PAGE_KERNEL, __PAGE_KERNEL_EXEC;
  140. #define __PAGE_KERNEL_RO (__PAGE_KERNEL & ~_PAGE_RW)
  141. #define __PAGE_KERNEL_NOCACHE (__PAGE_KERNEL | _PAGE_PCD)
  142. #define __PAGE_KERNEL_LARGE (__PAGE_KERNEL | _PAGE_PSE)
  143. #define __PAGE_KERNEL_LARGE_EXEC (__PAGE_KERNEL_EXEC | _PAGE_PSE)
  144. #define PAGE_KERNEL __pgprot(__PAGE_KERNEL)
  145. #define PAGE_KERNEL_RO __pgprot(__PAGE_KERNEL_RO)
  146. #define PAGE_KERNEL_EXEC __pgprot(__PAGE_KERNEL_EXEC)
  147. #define PAGE_KERNEL_NOCACHE __pgprot(__PAGE_KERNEL_NOCACHE)
  148. #define PAGE_KERNEL_LARGE __pgprot(__PAGE_KERNEL_LARGE)
  149. #define PAGE_KERNEL_LARGE_EXEC __pgprot(__PAGE_KERNEL_LARGE_EXEC)
  150. /*
  151. * The i386 can't do page protection for execute, and considers that
  152. * the same are read. Also, write permissions imply read permissions.
  153. * This is the closest we can get..
  154. */
  155. #define __P000 PAGE_NONE
  156. #define __P001 PAGE_READONLY
  157. #define __P010 PAGE_COPY
  158. #define __P011 PAGE_COPY
  159. #define __P100 PAGE_READONLY_EXEC
  160. #define __P101 PAGE_READONLY_EXEC
  161. #define __P110 PAGE_COPY_EXEC
  162. #define __P111 PAGE_COPY_EXEC
  163. #define __S000 PAGE_NONE
  164. #define __S001 PAGE_READONLY
  165. #define __S010 PAGE_SHARED
  166. #define __S011 PAGE_SHARED
  167. #define __S100 PAGE_READONLY_EXEC
  168. #define __S101 PAGE_READONLY_EXEC
  169. #define __S110 PAGE_SHARED_EXEC
  170. #define __S111 PAGE_SHARED_EXEC
  171. /*
  172. * Define this if things work differently on an i386 and an i486:
  173. * it will (on an i486) warn about kernel memory accesses that are
  174. * done without a 'access_ok(VERIFY_WRITE,..)'
  175. */
  176. #undef TEST_ACCESS_OK
  177. /* The boot page tables (all created as a single array) */
  178. extern unsigned long pg0[];
  179. #define pte_present(x) ((x).pte_low & (_PAGE_PRESENT | _PAGE_PROTNONE))
  180. /* To avoid harmful races, pmd_none(x) should check only the lower when PAE */
  181. #define pmd_none(x) (!(unsigned long)pmd_val(x))
  182. #define pmd_present(x) (pmd_val(x) & _PAGE_PRESENT)
  183. #define pmd_bad(x) ((pmd_val(x) & (~PAGE_MASK & ~_PAGE_USER)) != _KERNPG_TABLE)
  184. #define pages_to_mb(x) ((x) >> (20-PAGE_SHIFT))
  185. /*
  186. * The following only work if pte_present() is true.
  187. * Undefined behaviour if not..
  188. */
  189. static inline int pte_user(pte_t pte) { return (pte).pte_low & _PAGE_USER; }
  190. static inline int pte_read(pte_t pte) { return (pte).pte_low & _PAGE_USER; }
  191. static inline int pte_dirty(pte_t pte) { return (pte).pte_low & _PAGE_DIRTY; }
  192. static inline int pte_young(pte_t pte) { return (pte).pte_low & _PAGE_ACCESSED; }
  193. static inline int pte_write(pte_t pte) { return (pte).pte_low & _PAGE_RW; }
  194. static inline int pte_huge(pte_t pte) { return (pte).pte_low & _PAGE_PSE; }
  195. /*
  196. * The following only works if pte_present() is not true.
  197. */
  198. static inline int pte_file(pte_t pte) { return (pte).pte_low & _PAGE_FILE; }
  199. static inline pte_t pte_rdprotect(pte_t pte) { (pte).pte_low &= ~_PAGE_USER; return pte; }
  200. static inline pte_t pte_exprotect(pte_t pte) { (pte).pte_low &= ~_PAGE_USER; return pte; }
  201. static inline pte_t pte_mkclean(pte_t pte) { (pte).pte_low &= ~_PAGE_DIRTY; return pte; }
  202. static inline pte_t pte_mkold(pte_t pte) { (pte).pte_low &= ~_PAGE_ACCESSED; return pte; }
  203. static inline pte_t pte_wrprotect(pte_t pte) { (pte).pte_low &= ~_PAGE_RW; return pte; }
  204. static inline pte_t pte_mkread(pte_t pte) { (pte).pte_low |= _PAGE_USER; return pte; }
  205. static inline pte_t pte_mkexec(pte_t pte) { (pte).pte_low |= _PAGE_USER; return pte; }
  206. static inline pte_t pte_mkdirty(pte_t pte) { (pte).pte_low |= _PAGE_DIRTY; return pte; }
  207. static inline pte_t pte_mkyoung(pte_t pte) { (pte).pte_low |= _PAGE_ACCESSED; return pte; }
  208. static inline pte_t pte_mkwrite(pte_t pte) { (pte).pte_low |= _PAGE_RW; return pte; }
  209. static inline pte_t pte_mkhuge(pte_t pte) { (pte).pte_low |= _PAGE_PSE; return pte; }
  210. #ifdef CONFIG_X86_PAE
  211. # include <asm/pgtable-3level.h>
  212. #else
  213. # include <asm/pgtable-2level.h>
  214. #endif
  215. #ifndef CONFIG_PARAVIRT
  216. /*
  217. * Rules for using pte_update - it must be called after any PTE update which
  218. * has not been done using the set_pte / clear_pte interfaces. It is used by
  219. * shadow mode hypervisors to resynchronize the shadow page tables. Kernel PTE
  220. * updates should either be sets, clears, or set_pte_atomic for P->P
  221. * transitions, which means this hook should only be called for user PTEs.
  222. * This hook implies a P->P protection or access change has taken place, which
  223. * requires a subsequent TLB flush. The notification can optionally be delayed
  224. * until the TLB flush event by using the pte_update_defer form of the
  225. * interface, but care must be taken to assure that the flush happens while
  226. * still holding the same page table lock so that the shadow and primary pages
  227. * do not become out of sync on SMP.
  228. */
  229. #define pte_update(mm, addr, ptep) do { } while (0)
  230. #define pte_update_defer(mm, addr, ptep) do { } while (0)
  231. #define paravirt_map_pt_hook(slot, va, pfn) do { } while (0)
  232. #endif
  233. /*
  234. * We only update the dirty/accessed state if we set
  235. * the dirty bit by hand in the kernel, since the hardware
  236. * will do the accessed bit for us, and we don't want to
  237. * race with other CPU's that might be updating the dirty
  238. * bit at the same time.
  239. */
  240. #define __HAVE_ARCH_PTEP_SET_ACCESS_FLAGS
  241. #define ptep_set_access_flags(vma, address, ptep, entry, dirty) \
  242. do { \
  243. if (dirty) { \
  244. (ptep)->pte_low = (entry).pte_low; \
  245. pte_update_defer((vma)->vm_mm, (address), (ptep)); \
  246. flush_tlb_page(vma, address); \
  247. } \
  248. } while (0)
  249. /*
  250. * We don't actually have these, but we want to advertise them so that
  251. * we can encompass the flush here.
  252. */
  253. #define __HAVE_ARCH_PTEP_TEST_AND_CLEAR_DIRTY
  254. #define __HAVE_ARCH_PTEP_TEST_AND_CLEAR_YOUNG
  255. /*
  256. * Rules for using ptep_establish: the pte MUST be a user pte, and
  257. * must be a present->present transition.
  258. */
  259. #define __HAVE_ARCH_PTEP_ESTABLISH
  260. #define ptep_establish(vma, address, ptep, pteval) \
  261. do { \
  262. set_pte_present((vma)->vm_mm, address, ptep, pteval); \
  263. flush_tlb_page(vma, address); \
  264. } while (0)
  265. #define __HAVE_ARCH_PTEP_CLEAR_DIRTY_FLUSH
  266. #define ptep_clear_flush_dirty(vma, address, ptep) \
  267. ({ \
  268. int __dirty; \
  269. __dirty = pte_dirty(*(ptep)); \
  270. if (__dirty) { \
  271. clear_bit(_PAGE_BIT_DIRTY, &(ptep)->pte_low); \
  272. pte_update_defer((vma)->vm_mm, (address), (ptep)); \
  273. flush_tlb_page(vma, address); \
  274. } \
  275. __dirty; \
  276. })
  277. #define __HAVE_ARCH_PTEP_CLEAR_YOUNG_FLUSH
  278. #define ptep_clear_flush_young(vma, address, ptep) \
  279. ({ \
  280. int __young; \
  281. __young = pte_young(*(ptep)); \
  282. if (__young) { \
  283. clear_bit(_PAGE_BIT_ACCESSED, &(ptep)->pte_low); \
  284. pte_update_defer((vma)->vm_mm, (address), (ptep)); \
  285. flush_tlb_page(vma, address); \
  286. } \
  287. __young; \
  288. })
  289. #define __HAVE_ARCH_PTEP_GET_AND_CLEAR
  290. static inline pte_t ptep_get_and_clear(struct mm_struct *mm, unsigned long addr, pte_t *ptep)
  291. {
  292. pte_t pte = raw_ptep_get_and_clear(ptep);
  293. pte_update(mm, addr, ptep);
  294. return pte;
  295. }
  296. #define __HAVE_ARCH_PTEP_GET_AND_CLEAR_FULL
  297. static inline pte_t ptep_get_and_clear_full(struct mm_struct *mm, unsigned long addr, pte_t *ptep, int full)
  298. {
  299. pte_t pte;
  300. if (full) {
  301. pte = *ptep;
  302. pte_clear(mm, addr, ptep);
  303. } else {
  304. pte = ptep_get_and_clear(mm, addr, ptep);
  305. }
  306. return pte;
  307. }
  308. #define __HAVE_ARCH_PTEP_SET_WRPROTECT
  309. static inline void ptep_set_wrprotect(struct mm_struct *mm, unsigned long addr, pte_t *ptep)
  310. {
  311. clear_bit(_PAGE_BIT_RW, &ptep->pte_low);
  312. pte_update(mm, addr, ptep);
  313. }
  314. /*
  315. * clone_pgd_range(pgd_t *dst, pgd_t *src, int count);
  316. *
  317. * dst - pointer to pgd range anwhere on a pgd page
  318. * src - ""
  319. * count - the number of pgds to copy.
  320. *
  321. * dst and src can be on the same page, but the range must not overlap,
  322. * and must not cross a page boundary.
  323. */
  324. static inline void clone_pgd_range(pgd_t *dst, pgd_t *src, int count)
  325. {
  326. memcpy(dst, src, count * sizeof(pgd_t));
  327. }
  328. /*
  329. * Macro to mark a page protection value as "uncacheable". On processors which do not support
  330. * it, this is a no-op.
  331. */
  332. #define pgprot_noncached(prot) ((boot_cpu_data.x86 > 3) \
  333. ? (__pgprot(pgprot_val(prot) | _PAGE_PCD | _PAGE_PWT)) : (prot))
  334. /*
  335. * Conversion functions: convert a page and protection to a page entry,
  336. * and a page entry and page directory to the page they refer to.
  337. */
  338. #define mk_pte(page, pgprot) pfn_pte(page_to_pfn(page), (pgprot))
  339. static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
  340. {
  341. pte.pte_low &= _PAGE_CHG_MASK;
  342. pte.pte_low |= pgprot_val(newprot);
  343. #ifdef CONFIG_X86_PAE
  344. /*
  345. * Chop off the NX bit (if present), and add the NX portion of
  346. * the newprot (if present):
  347. */
  348. pte.pte_high &= ~(1 << (_PAGE_BIT_NX - 32));
  349. pte.pte_high |= (pgprot_val(newprot) >> 32) & \
  350. (__supported_pte_mask >> 32);
  351. #endif
  352. return pte;
  353. }
  354. #define pmd_large(pmd) \
  355. ((pmd_val(pmd) & (_PAGE_PSE|_PAGE_PRESENT)) == (_PAGE_PSE|_PAGE_PRESENT))
  356. /*
  357. * the pgd page can be thought of an array like this: pgd_t[PTRS_PER_PGD]
  358. *
  359. * this macro returns the index of the entry in the pgd page which would
  360. * control the given virtual address
  361. */
  362. #define pgd_index(address) (((address) >> PGDIR_SHIFT) & (PTRS_PER_PGD-1))
  363. #define pgd_index_k(addr) pgd_index(addr)
  364. /*
  365. * pgd_offset() returns a (pgd_t *)
  366. * pgd_index() is used get the offset into the pgd page's array of pgd_t's;
  367. */
  368. #define pgd_offset(mm, address) ((mm)->pgd+pgd_index(address))
  369. /*
  370. * a shortcut which implies the use of the kernel's pgd, instead
  371. * of a process's
  372. */
  373. #define pgd_offset_k(address) pgd_offset(&init_mm, address)
  374. /*
  375. * the pmd page can be thought of an array like this: pmd_t[PTRS_PER_PMD]
  376. *
  377. * this macro returns the index of the entry in the pmd page which would
  378. * control the given virtual address
  379. */
  380. #define pmd_index(address) \
  381. (((address) >> PMD_SHIFT) & (PTRS_PER_PMD-1))
  382. /*
  383. * the pte page can be thought of an array like this: pte_t[PTRS_PER_PTE]
  384. *
  385. * this macro returns the index of the entry in the pte page which would
  386. * control the given virtual address
  387. */
  388. #define pte_index(address) \
  389. (((address) >> PAGE_SHIFT) & (PTRS_PER_PTE - 1))
  390. #define pte_offset_kernel(dir, address) \
  391. ((pte_t *) pmd_page_vaddr(*(dir)) + pte_index(address))
  392. #define pmd_page(pmd) (pfn_to_page(pmd_val(pmd) >> PAGE_SHIFT))
  393. #define pmd_page_vaddr(pmd) \
  394. ((unsigned long) __va(pmd_val(pmd) & PAGE_MASK))
  395. /*
  396. * Helper function that returns the kernel pagetable entry controlling
  397. * the virtual address 'address'. NULL means no pagetable entry present.
  398. * NOTE: the return type is pte_t but if the pmd is PSE then we return it
  399. * as a pte too.
  400. */
  401. extern pte_t *lookup_address(unsigned long address);
  402. /*
  403. * Make a given kernel text page executable/non-executable.
  404. * Returns the previous executability setting of that page (which
  405. * is used to restore the previous state). Used by the SMP bootup code.
  406. * NOTE: this is an __init function for security reasons.
  407. */
  408. #ifdef CONFIG_X86_PAE
  409. extern int set_kernel_exec(unsigned long vaddr, int enable);
  410. #else
  411. static inline int set_kernel_exec(unsigned long vaddr, int enable) { return 0;}
  412. #endif
  413. #if defined(CONFIG_HIGHPTE)
  414. #define pte_offset_map(dir, address) \
  415. ({ \
  416. pte_t *__ptep; \
  417. unsigned pfn = pmd_val(*(dir)) >> PAGE_SHIFT; \
  418. __ptep = (pte_t *)kmap_atomic(pfn_to_page(pfn),KM_PTE0);\
  419. paravirt_map_pt_hook(KM_PTE0,__ptep, pfn); \
  420. __ptep = __ptep + pte_index(address); \
  421. __ptep; \
  422. })
  423. #define pte_offset_map_nested(dir, address) \
  424. ({ \
  425. pte_t *__ptep; \
  426. unsigned pfn = pmd_val(*(dir)) >> PAGE_SHIFT; \
  427. __ptep = (pte_t *)kmap_atomic(pfn_to_page(pfn),KM_PTE1);\
  428. paravirt_map_pt_hook(KM_PTE1,__ptep, pfn); \
  429. __ptep = __ptep + pte_index(address); \
  430. __ptep; \
  431. })
  432. #define pte_unmap(pte) kunmap_atomic(pte, KM_PTE0)
  433. #define pte_unmap_nested(pte) kunmap_atomic(pte, KM_PTE1)
  434. #else
  435. #define pte_offset_map(dir, address) \
  436. ((pte_t *)page_address(pmd_page(*(dir))) + pte_index(address))
  437. #define pte_offset_map_nested(dir, address) pte_offset_map(dir, address)
  438. #define pte_unmap(pte) do { } while (0)
  439. #define pte_unmap_nested(pte) do { } while (0)
  440. #endif
  441. /* Clear a kernel PTE and flush it from the TLB */
  442. #define kpte_clear_flush(ptep, vaddr) \
  443. do { \
  444. pte_clear(&init_mm, vaddr, ptep); \
  445. __flush_tlb_one(vaddr); \
  446. } while (0)
  447. /*
  448. * The i386 doesn't have any external MMU info: the kernel page
  449. * tables contain all the necessary information.
  450. */
  451. #define update_mmu_cache(vma,address,pte) do { } while (0)
  452. #endif /* !__ASSEMBLY__ */
  453. #ifdef CONFIG_FLATMEM
  454. #define kern_addr_valid(addr) (1)
  455. #endif /* CONFIG_FLATMEM */
  456. #define io_remap_pfn_range(vma, vaddr, pfn, size, prot) \
  457. remap_pfn_range(vma, vaddr, pfn, size, prot)
  458. #define MK_IOSPACE_PFN(space, pfn) (pfn)
  459. #define GET_IOSPACE(pfn) 0
  460. #define GET_PFN(pfn) (pfn)
  461. #include <asm-generic/pgtable.h>
  462. #endif /* _I386_PGTABLE_H */