blob: 0790ad6ed4404e499bd831e749b9ece0be3bcb3f [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001#ifndef _I386_PGTABLE_H
2#define _I386_PGTABLE_H
3
Linus Torvalds1da177e2005-04-16 15:20:36 -07004
5/*
6 * The Linux memory management assumes a three-level page table setup. On
7 * the i386, we use that, but "fold" the mid level into the top-level page
8 * table, so that we physically have the same two-level page table as the
9 * i386 mmu expects.
10 *
11 * This file contains the functions and defines necessary to modify and use
12 * the i386 page table tree.
13 */
14#ifndef __ASSEMBLY__
15#include <asm/processor.h>
16#include <asm/fixmap.h>
17#include <linux/threads.h>
Rusty Russellda181a82006-12-07 02:14:08 +010018#include <asm/paravirt.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070019
20#ifndef _I386_BITOPS_H
21#include <asm/bitops.h>
22#endif
23
24#include <linux/slab.h>
25#include <linux/list.h>
26#include <linux/spinlock.h>
27
Tim Schmielau8c65b4a2005-11-07 00:59:43 -080028struct mm_struct;
29struct vm_area_struct;
30
Linus Torvalds1da177e2005-04-16 15:20:36 -070031/*
32 * ZERO_PAGE is a global shared page that is always zero: used
33 * for zero-mapped memory areas etc..
34 */
35#define ZERO_PAGE(vaddr) (virt_to_page(empty_zero_page))
36extern unsigned long empty_zero_page[1024];
37extern pgd_t swapper_pg_dir[1024];
Christoph Lametere18b8902006-12-06 20:33:20 -080038extern struct kmem_cache *pgd_cache;
39extern struct kmem_cache *pmd_cache;
Linus Torvalds1da177e2005-04-16 15:20:36 -070040extern spinlock_t pgd_lock;
41extern struct page *pgd_list;
42
Christoph Lametere18b8902006-12-06 20:33:20 -080043void pmd_ctor(void *, struct kmem_cache *, unsigned long);
44void pgd_ctor(void *, struct kmem_cache *, unsigned long);
45void pgd_dtor(void *, struct kmem_cache *, unsigned long);
Linus Torvalds1da177e2005-04-16 15:20:36 -070046void pgtable_cache_init(void);
47void paging_init(void);
48
49/*
50 * The Linux x86 paging architecture is 'compile-time dual-mode', it
51 * implements both the traditional 2-level x86 page tables and the
52 * newer 3-level PAE-mode page tables.
53 */
54#ifdef CONFIG_X86_PAE
55# include <asm/pgtable-3level-defs.h>
56# define PMD_SIZE (1UL << PMD_SHIFT)
57# define PMD_MASK (~(PMD_SIZE-1))
58#else
59# include <asm/pgtable-2level-defs.h>
60#endif
61
62#define PGDIR_SIZE (1UL << PGDIR_SHIFT)
63#define PGDIR_MASK (~(PGDIR_SIZE-1))
64
65#define USER_PTRS_PER_PGD (TASK_SIZE/PGDIR_SIZE)
Hugh Dickinsd455a362005-04-19 13:29:23 -070066#define FIRST_USER_ADDRESS 0
Linus Torvalds1da177e2005-04-16 15:20:36 -070067
68#define USER_PGD_PTRS (PAGE_OFFSET >> PGDIR_SHIFT)
69#define KERNEL_PGD_PTRS (PTRS_PER_PGD-USER_PGD_PTRS)
70
71#define TWOLEVEL_PGDIR_SHIFT 22
72#define BOOT_USER_PGD_PTRS (__PAGE_OFFSET >> TWOLEVEL_PGDIR_SHIFT)
73#define BOOT_KERNEL_PGD_PTRS (1024-BOOT_USER_PGD_PTRS)
74
75/* Just any arbitrary offset to the start of the vmalloc VM area: the
76 * current 8MB value just means that there will be a 8MB "hole" after the
77 * physical memory until the kernel virtual memory starts. That means that
78 * any out-of-bounds memory accesses will hopefully be caught.
79 * The vmalloc() routines leaves a hole of 4kB between each vmalloced
80 * area for the same reason. ;)
81 */
82#define VMALLOC_OFFSET (8*1024*1024)
83#define VMALLOC_START (((unsigned long) high_memory + vmalloc_earlyreserve + \
84 2*VMALLOC_OFFSET-1) & ~(VMALLOC_OFFSET-1))
85#ifdef CONFIG_HIGHMEM
86# define VMALLOC_END (PKMAP_BASE-2*PAGE_SIZE)
87#else
88# define VMALLOC_END (FIXADDR_START-2*PAGE_SIZE)
89#endif
90
91/*
Paolo 'Blaisorblade' Giarrusso9b4ee402005-09-03 15:54:57 -070092 * _PAGE_PSE set in the page directory entry just means that
Linus Torvalds1da177e2005-04-16 15:20:36 -070093 * the page directory entry points directly to a 4MB-aligned block of
94 * memory.
95 */
96#define _PAGE_BIT_PRESENT 0
97#define _PAGE_BIT_RW 1
98#define _PAGE_BIT_USER 2
99#define _PAGE_BIT_PWT 3
100#define _PAGE_BIT_PCD 4
101#define _PAGE_BIT_ACCESSED 5
102#define _PAGE_BIT_DIRTY 6
103#define _PAGE_BIT_PSE 7 /* 4 MB (or 2MB) page, Pentium+, if present.. */
104#define _PAGE_BIT_GLOBAL 8 /* Global TLB entry PPro+ */
105#define _PAGE_BIT_UNUSED1 9 /* available for programmer */
106#define _PAGE_BIT_UNUSED2 10
107#define _PAGE_BIT_UNUSED3 11
108#define _PAGE_BIT_NX 63
109
110#define _PAGE_PRESENT 0x001
111#define _PAGE_RW 0x002
112#define _PAGE_USER 0x004
113#define _PAGE_PWT 0x008
114#define _PAGE_PCD 0x010
115#define _PAGE_ACCESSED 0x020
116#define _PAGE_DIRTY 0x040
117#define _PAGE_PSE 0x080 /* 4 MB (or 2MB) page, Pentium+, if present.. */
118#define _PAGE_GLOBAL 0x100 /* Global TLB entry PPro+ */
119#define _PAGE_UNUSED1 0x200 /* available for programmer */
120#define _PAGE_UNUSED2 0x400
121#define _PAGE_UNUSED3 0x800
122
Paolo 'Blaisorblade' Giarrusso9b4ee402005-09-03 15:54:57 -0700123/* If _PAGE_PRESENT is clear, we use these: */
124#define _PAGE_FILE 0x040 /* nonlinear file mapping, saved PTE; unset:swap */
125#define _PAGE_PROTNONE 0x080 /* if the user mapped it with PROT_NONE;
126 pte_present gives true */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700127#ifdef CONFIG_X86_PAE
128#define _PAGE_NX (1ULL<<_PAGE_BIT_NX)
129#else
130#define _PAGE_NX 0
131#endif
132
133#define _PAGE_TABLE (_PAGE_PRESENT | _PAGE_RW | _PAGE_USER | _PAGE_ACCESSED | _PAGE_DIRTY)
134#define _KERNPG_TABLE (_PAGE_PRESENT | _PAGE_RW | _PAGE_ACCESSED | _PAGE_DIRTY)
135#define _PAGE_CHG_MASK (PTE_MASK | _PAGE_ACCESSED | _PAGE_DIRTY)
136
137#define PAGE_NONE \
138 __pgprot(_PAGE_PROTNONE | _PAGE_ACCESSED)
139#define PAGE_SHARED \
140 __pgprot(_PAGE_PRESENT | _PAGE_RW | _PAGE_USER | _PAGE_ACCESSED)
141
142#define PAGE_SHARED_EXEC \
143 __pgprot(_PAGE_PRESENT | _PAGE_RW | _PAGE_USER | _PAGE_ACCESSED)
144#define PAGE_COPY_NOEXEC \
145 __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_ACCESSED | _PAGE_NX)
146#define PAGE_COPY_EXEC \
147 __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_ACCESSED)
148#define PAGE_COPY \
149 PAGE_COPY_NOEXEC
150#define PAGE_READONLY \
151 __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_ACCESSED | _PAGE_NX)
152#define PAGE_READONLY_EXEC \
153 __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_ACCESSED)
154
155#define _PAGE_KERNEL \
156 (_PAGE_PRESENT | _PAGE_RW | _PAGE_DIRTY | _PAGE_ACCESSED | _PAGE_NX)
157#define _PAGE_KERNEL_EXEC \
158 (_PAGE_PRESENT | _PAGE_RW | _PAGE_DIRTY | _PAGE_ACCESSED)
159
160extern unsigned long long __PAGE_KERNEL, __PAGE_KERNEL_EXEC;
161#define __PAGE_KERNEL_RO (__PAGE_KERNEL & ~_PAGE_RW)
Jan Beulichd01ad8d2007-05-02 19:27:10 +0200162#define __PAGE_KERNEL_RX (__PAGE_KERNEL_EXEC & ~_PAGE_RW)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700163#define __PAGE_KERNEL_NOCACHE (__PAGE_KERNEL | _PAGE_PCD)
164#define __PAGE_KERNEL_LARGE (__PAGE_KERNEL | _PAGE_PSE)
165#define __PAGE_KERNEL_LARGE_EXEC (__PAGE_KERNEL_EXEC | _PAGE_PSE)
166
167#define PAGE_KERNEL __pgprot(__PAGE_KERNEL)
168#define PAGE_KERNEL_RO __pgprot(__PAGE_KERNEL_RO)
169#define PAGE_KERNEL_EXEC __pgprot(__PAGE_KERNEL_EXEC)
Jan Beulichd01ad8d2007-05-02 19:27:10 +0200170#define PAGE_KERNEL_RX __pgprot(__PAGE_KERNEL_RX)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700171#define PAGE_KERNEL_NOCACHE __pgprot(__PAGE_KERNEL_NOCACHE)
172#define PAGE_KERNEL_LARGE __pgprot(__PAGE_KERNEL_LARGE)
173#define PAGE_KERNEL_LARGE_EXEC __pgprot(__PAGE_KERNEL_LARGE_EXEC)
174
175/*
176 * The i386 can't do page protection for execute, and considers that
177 * the same are read. Also, write permissions imply read permissions.
178 * This is the closest we can get..
179 */
180#define __P000 PAGE_NONE
181#define __P001 PAGE_READONLY
182#define __P010 PAGE_COPY
183#define __P011 PAGE_COPY
184#define __P100 PAGE_READONLY_EXEC
185#define __P101 PAGE_READONLY_EXEC
186#define __P110 PAGE_COPY_EXEC
187#define __P111 PAGE_COPY_EXEC
188
189#define __S000 PAGE_NONE
190#define __S001 PAGE_READONLY
191#define __S010 PAGE_SHARED
192#define __S011 PAGE_SHARED
193#define __S100 PAGE_READONLY_EXEC
194#define __S101 PAGE_READONLY_EXEC
195#define __S110 PAGE_SHARED_EXEC
196#define __S111 PAGE_SHARED_EXEC
197
198/*
199 * Define this if things work differently on an i386 and an i486:
200 * it will (on an i486) warn about kernel memory accesses that are
Jesper Juhle49332b2005-05-01 08:59:08 -0700201 * done without a 'access_ok(VERIFY_WRITE,..)'
Linus Torvalds1da177e2005-04-16 15:20:36 -0700202 */
Jesper Juhle49332b2005-05-01 08:59:08 -0700203#undef TEST_ACCESS_OK
Linus Torvalds1da177e2005-04-16 15:20:36 -0700204
205/* The boot page tables (all created as a single array) */
206extern unsigned long pg0[];
207
208#define pte_present(x) ((x).pte_low & (_PAGE_PRESENT | _PAGE_PROTNONE))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700209
Hugh Dickins705e87c2005-10-29 18:16:27 -0700210/* To avoid harmful races, pmd_none(x) should check only the lower when PAE */
211#define pmd_none(x) (!(unsigned long)pmd_val(x))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700212#define pmd_present(x) (pmd_val(x) & _PAGE_PRESENT)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700213#define pmd_bad(x) ((pmd_val(x) & (~PAGE_MASK & ~_PAGE_USER)) != _KERNPG_TABLE)
214
215
216#define pages_to_mb(x) ((x) >> (20-PAGE_SHIFT))
217
218/*
219 * The following only work if pte_present() is true.
220 * Undefined behaviour if not..
221 */
222static inline int pte_user(pte_t pte) { return (pte).pte_low & _PAGE_USER; }
223static inline int pte_read(pte_t pte) { return (pte).pte_low & _PAGE_USER; }
224static inline int pte_dirty(pte_t pte) { return (pte).pte_low & _PAGE_DIRTY; }
225static inline int pte_young(pte_t pte) { return (pte).pte_low & _PAGE_ACCESSED; }
226static inline int pte_write(pte_t pte) { return (pte).pte_low & _PAGE_RW; }
Zhang, Yanmin8f860592006-03-22 00:08:50 -0800227static inline int pte_huge(pte_t pte) { return (pte).pte_low & _PAGE_PSE; }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700228
229/*
230 * The following only works if pte_present() is not true.
231 */
232static inline int pte_file(pte_t pte) { return (pte).pte_low & _PAGE_FILE; }
233
234static inline pte_t pte_rdprotect(pte_t pte) { (pte).pte_low &= ~_PAGE_USER; return pte; }
235static inline pte_t pte_exprotect(pte_t pte) { (pte).pte_low &= ~_PAGE_USER; return pte; }
236static inline pte_t pte_mkclean(pte_t pte) { (pte).pte_low &= ~_PAGE_DIRTY; return pte; }
237static inline pte_t pte_mkold(pte_t pte) { (pte).pte_low &= ~_PAGE_ACCESSED; return pte; }
238static inline pte_t pte_wrprotect(pte_t pte) { (pte).pte_low &= ~_PAGE_RW; return pte; }
239static inline pte_t pte_mkread(pte_t pte) { (pte).pte_low |= _PAGE_USER; return pte; }
240static inline pte_t pte_mkexec(pte_t pte) { (pte).pte_low |= _PAGE_USER; return pte; }
241static inline pte_t pte_mkdirty(pte_t pte) { (pte).pte_low |= _PAGE_DIRTY; return pte; }
242static inline pte_t pte_mkyoung(pte_t pte) { (pte).pte_low |= _PAGE_ACCESSED; return pte; }
243static inline pte_t pte_mkwrite(pte_t pte) { (pte).pte_low |= _PAGE_RW; return pte; }
Zhang, Yanmin8f860592006-03-22 00:08:50 -0800244static inline pte_t pte_mkhuge(pte_t pte) { (pte).pte_low |= _PAGE_PSE; return pte; }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700245
246#ifdef CONFIG_X86_PAE
247# include <asm/pgtable-3level.h>
248#else
249# include <asm/pgtable-2level.h>
250#endif
251
Rusty Russellda181a82006-12-07 02:14:08 +0100252#ifndef CONFIG_PARAVIRT
Rusty Russell2965a0e2006-09-25 23:32:31 -0700253/*
Zachary Amsden789e6ac2006-09-30 23:29:38 -0700254 * Rules for using pte_update - it must be called after any PTE update which
255 * has not been done using the set_pte / clear_pte interfaces. It is used by
256 * shadow mode hypervisors to resynchronize the shadow page tables. Kernel PTE
257 * updates should either be sets, clears, or set_pte_atomic for P->P
258 * transitions, which means this hook should only be called for user PTEs.
259 * This hook implies a P->P protection or access change has taken place, which
260 * requires a subsequent TLB flush. The notification can optionally be delayed
261 * until the TLB flush event by using the pte_update_defer form of the
262 * interface, but care must be taken to assure that the flush happens while
263 * still holding the same page table lock so that the shadow and primary pages
264 * do not become out of sync on SMP.
265 */
266#define pte_update(mm, addr, ptep) do { } while (0)
267#define pte_update_defer(mm, addr, ptep) do { } while (0)
Zachary Amsden9a1c13e2007-03-05 00:30:37 -0800268#define paravirt_map_pt_hook(slot, va, pfn) do { } while (0)
Jeremy Fitzhardinge3dc494e2007-05-02 19:27:13 +0200269
270#define raw_ptep_get_and_clear(xp) native_ptep_get_and_clear(xp)
Rusty Russellda181a82006-12-07 02:14:08 +0100271#endif
Zachary Amsden789e6ac2006-09-30 23:29:38 -0700272
273/*
Rusty Russell2965a0e2006-09-25 23:32:31 -0700274 * We only update the dirty/accessed state if we set
275 * the dirty bit by hand in the kernel, since the hardware
276 * will do the accessed bit for us, and we don't want to
277 * race with other CPU's that might be updating the dirty
278 * bit at the same time.
279 */
280#define __HAVE_ARCH_PTEP_SET_ACCESS_FLAGS
281#define ptep_set_access_flags(vma, address, ptep, entry, dirty) \
282do { \
283 if (dirty) { \
284 (ptep)->pte_low = (entry).pte_low; \
Zachary Amsdendfbea0a2006-12-07 02:14:08 +0100285 pte_update_defer((vma)->vm_mm, (address), (ptep)); \
Rusty Russell2965a0e2006-09-25 23:32:31 -0700286 flush_tlb_page(vma, address); \
287 } \
288} while (0)
289
Zachary Amsden25e4df52006-09-30 23:29:34 -0700290/*
291 * We don't actually have these, but we want to advertise them so that
292 * we can encompass the flush here.
293 */
Rusty Russell60497422006-09-25 23:32:30 -0700294#define __HAVE_ARCH_PTEP_TEST_AND_CLEAR_DIRTY
Rusty Russell60497422006-09-25 23:32:30 -0700295#define __HAVE_ARCH_PTEP_TEST_AND_CLEAR_YOUNG
Zachary Amsden25e4df52006-09-30 23:29:34 -0700296
Zachary Amsdend6d861e2006-09-30 23:29:36 -0700297/*
298 * Rules for using ptep_establish: the pte MUST be a user pte, and
299 * must be a present->present transition.
300 */
301#define __HAVE_ARCH_PTEP_ESTABLISH
302#define ptep_establish(vma, address, ptep, pteval) \
303do { \
304 set_pte_present((vma)->vm_mm, address, ptep, pteval); \
305 flush_tlb_page(vma, address); \
306} while (0)
307
Zachary Amsden25e4df52006-09-30 23:29:34 -0700308#define __HAVE_ARCH_PTEP_CLEAR_DIRTY_FLUSH
309#define ptep_clear_flush_dirty(vma, address, ptep) \
310({ \
311 int __dirty; \
312 __dirty = pte_dirty(*(ptep)); \
313 if (__dirty) { \
314 clear_bit(_PAGE_BIT_DIRTY, &(ptep)->pte_low); \
Zachary Amsdendfbea0a2006-12-07 02:14:08 +0100315 pte_update_defer((vma)->vm_mm, (address), (ptep)); \
Zachary Amsden25e4df52006-09-30 23:29:34 -0700316 flush_tlb_page(vma, address); \
317 } \
318 __dirty; \
319})
320
321#define __HAVE_ARCH_PTEP_CLEAR_YOUNG_FLUSH
322#define ptep_clear_flush_young(vma, address, ptep) \
323({ \
324 int __young; \
325 __young = pte_young(*(ptep)); \
326 if (__young) { \
327 clear_bit(_PAGE_BIT_ACCESSED, &(ptep)->pte_low); \
Zachary Amsdendfbea0a2006-12-07 02:14:08 +0100328 pte_update_defer((vma)->vm_mm, (address), (ptep)); \
Zachary Amsden25e4df52006-09-30 23:29:34 -0700329 flush_tlb_page(vma, address); \
330 } \
331 __young; \
332})
Linus Torvalds1da177e2005-04-16 15:20:36 -0700333
Zachary Amsden8ecb8952006-12-07 02:14:09 +0100334#define __HAVE_ARCH_PTEP_GET_AND_CLEAR
335static inline pte_t ptep_get_and_clear(struct mm_struct *mm, unsigned long addr, pte_t *ptep)
336{
337 pte_t pte = raw_ptep_get_and_clear(ptep);
338 pte_update(mm, addr, ptep);
339 return pte;
340}
341
Rusty Russell60497422006-09-25 23:32:30 -0700342#define __HAVE_ARCH_PTEP_GET_AND_CLEAR_FULL
Zachary Amsdena6003882005-09-03 15:55:04 -0700343static inline pte_t ptep_get_and_clear_full(struct mm_struct *mm, unsigned long addr, pte_t *ptep, int full)
344{
345 pte_t pte;
346 if (full) {
347 pte = *ptep;
Zachary Amsden6e5882c2006-04-27 11:32:29 -0700348 pte_clear(mm, addr, ptep);
Zachary Amsdena6003882005-09-03 15:55:04 -0700349 } else {
350 pte = ptep_get_and_clear(mm, addr, ptep);
351 }
352 return pte;
353}
354
Rusty Russell60497422006-09-25 23:32:30 -0700355#define __HAVE_ARCH_PTEP_SET_WRPROTECT
Linus Torvalds1da177e2005-04-16 15:20:36 -0700356static inline void ptep_set_wrprotect(struct mm_struct *mm, unsigned long addr, pte_t *ptep)
357{
358 clear_bit(_PAGE_BIT_RW, &ptep->pte_low);
Zachary Amsden789e6ac2006-09-30 23:29:38 -0700359 pte_update(mm, addr, ptep);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700360}
361
362/*
Zachary Amsdend7271b12005-09-03 15:56:50 -0700363 * clone_pgd_range(pgd_t *dst, pgd_t *src, int count);
364 *
365 * dst - pointer to pgd range anwhere on a pgd page
366 * src - ""
367 * count - the number of pgds to copy.
368 *
369 * dst and src can be on the same page, but the range must not overlap,
370 * and must not cross a page boundary.
371 */
372static inline void clone_pgd_range(pgd_t *dst, pgd_t *src, int count)
373{
374 memcpy(dst, src, count * sizeof(pgd_t));
375}
376
377/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700378 * Macro to mark a page protection value as "uncacheable". On processors which do not support
379 * it, this is a no-op.
380 */
381#define pgprot_noncached(prot) ((boot_cpu_data.x86 > 3) \
382 ? (__pgprot(pgprot_val(prot) | _PAGE_PCD | _PAGE_PWT)) : (prot))
383
384/*
385 * Conversion functions: convert a page and protection to a page entry,
386 * and a page entry and page directory to the page they refer to.
387 */
388
389#define mk_pte(page, pgprot) pfn_pte(page_to_pfn(page), (pgprot))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700390
391static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
392{
393 pte.pte_low &= _PAGE_CHG_MASK;
394 pte.pte_low |= pgprot_val(newprot);
395#ifdef CONFIG_X86_PAE
396 /*
397 * Chop off the NX bit (if present), and add the NX portion of
398 * the newprot (if present):
399 */
400 pte.pte_high &= ~(1 << (_PAGE_BIT_NX - 32));
401 pte.pte_high |= (pgprot_val(newprot) >> 32) & \
402 (__supported_pte_mask >> 32);
403#endif
404 return pte;
405}
406
Linus Torvalds1da177e2005-04-16 15:20:36 -0700407#define pmd_large(pmd) \
408((pmd_val(pmd) & (_PAGE_PSE|_PAGE_PRESENT)) == (_PAGE_PSE|_PAGE_PRESENT))
409
410/*
411 * the pgd page can be thought of an array like this: pgd_t[PTRS_PER_PGD]
412 *
413 * this macro returns the index of the entry in the pgd page which would
414 * control the given virtual address
415 */
416#define pgd_index(address) (((address) >> PGDIR_SHIFT) & (PTRS_PER_PGD-1))
417#define pgd_index_k(addr) pgd_index(addr)
418
419/*
420 * pgd_offset() returns a (pgd_t *)
421 * pgd_index() is used get the offset into the pgd page's array of pgd_t's;
422 */
423#define pgd_offset(mm, address) ((mm)->pgd+pgd_index(address))
424
425/*
426 * a shortcut which implies the use of the kernel's pgd, instead
427 * of a process's
428 */
429#define pgd_offset_k(address) pgd_offset(&init_mm, address)
430
431/*
432 * the pmd page can be thought of an array like this: pmd_t[PTRS_PER_PMD]
433 *
434 * this macro returns the index of the entry in the pmd page which would
435 * control the given virtual address
436 */
437#define pmd_index(address) \
438 (((address) >> PMD_SHIFT) & (PTRS_PER_PMD-1))
439
440/*
441 * the pte page can be thought of an array like this: pte_t[PTRS_PER_PTE]
442 *
443 * this macro returns the index of the entry in the pte page which would
444 * control the given virtual address
445 */
446#define pte_index(address) \
447 (((address) >> PAGE_SHIFT) & (PTRS_PER_PTE - 1))
448#define pte_offset_kernel(dir, address) \
Dave McCracken46a82b22006-09-25 23:31:48 -0700449 ((pte_t *) pmd_page_vaddr(*(dir)) + pte_index(address))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700450
Paolo 'Blaisorblade' Giarrussoca140fd2005-10-30 14:59:31 -0800451#define pmd_page(pmd) (pfn_to_page(pmd_val(pmd) >> PAGE_SHIFT))
452
Dave McCracken46a82b22006-09-25 23:31:48 -0700453#define pmd_page_vaddr(pmd) \
Paolo 'Blaisorblade' Giarrussoca140fd2005-10-30 14:59:31 -0800454 ((unsigned long) __va(pmd_val(pmd) & PAGE_MASK))
455
Linus Torvalds1da177e2005-04-16 15:20:36 -0700456/*
457 * Helper function that returns the kernel pagetable entry controlling
458 * the virtual address 'address'. NULL means no pagetable entry present.
459 * NOTE: the return type is pte_t but if the pmd is PSE then we return it
460 * as a pte too.
461 */
462extern pte_t *lookup_address(unsigned long address);
463
464/*
465 * Make a given kernel text page executable/non-executable.
466 * Returns the previous executability setting of that page (which
467 * is used to restore the previous state). Used by the SMP bootup code.
468 * NOTE: this is an __init function for security reasons.
469 */
470#ifdef CONFIG_X86_PAE
471 extern int set_kernel_exec(unsigned long vaddr, int enable);
472#else
473 static inline int set_kernel_exec(unsigned long vaddr, int enable) { return 0;}
474#endif
475
Linus Torvalds1da177e2005-04-16 15:20:36 -0700476#if defined(CONFIG_HIGHPTE)
Zachary Amsden9a1c13e2007-03-05 00:30:37 -0800477#define pte_offset_map(dir, address) \
478({ \
479 pte_t *__ptep; \
480 unsigned pfn = pmd_val(*(dir)) >> PAGE_SHIFT; \
481 __ptep = (pte_t *)kmap_atomic(pfn_to_page(pfn),KM_PTE0);\
482 paravirt_map_pt_hook(KM_PTE0,__ptep, pfn); \
483 __ptep = __ptep + pte_index(address); \
484 __ptep; \
485})
486#define pte_offset_map_nested(dir, address) \
487({ \
488 pte_t *__ptep; \
489 unsigned pfn = pmd_val(*(dir)) >> PAGE_SHIFT; \
490 __ptep = (pte_t *)kmap_atomic(pfn_to_page(pfn),KM_PTE1);\
491 paravirt_map_pt_hook(KM_PTE1,__ptep, pfn); \
492 __ptep = __ptep + pte_index(address); \
493 __ptep; \
494})
Linus Torvalds1da177e2005-04-16 15:20:36 -0700495#define pte_unmap(pte) kunmap_atomic(pte, KM_PTE0)
496#define pte_unmap_nested(pte) kunmap_atomic(pte, KM_PTE1)
497#else
498#define pte_offset_map(dir, address) \
499 ((pte_t *)page_address(pmd_page(*(dir))) + pte_index(address))
500#define pte_offset_map_nested(dir, address) pte_offset_map(dir, address)
501#define pte_unmap(pte) do { } while (0)
502#define pte_unmap_nested(pte) do { } while (0)
503#endif
504
Zachary Amsden23002d82006-09-30 23:29:35 -0700505/* Clear a kernel PTE and flush it from the TLB */
506#define kpte_clear_flush(ptep, vaddr) \
507do { \
508 pte_clear(&init_mm, vaddr, ptep); \
509 __flush_tlb_one(vaddr); \
510} while (0)
511
Linus Torvalds1da177e2005-04-16 15:20:36 -0700512/*
513 * The i386 doesn't have any external MMU info: the kernel page
514 * tables contain all the necessary information.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700515 */
516#define update_mmu_cache(vma,address,pte) do { } while (0)
Jeremy Fitzhardingeb239fb22007-05-02 19:27:13 +0200517
518void native_pagetable_setup_start(pgd_t *base);
519void native_pagetable_setup_done(pgd_t *base);
520
521#ifndef CONFIG_PARAVIRT
522static inline void paravirt_pagetable_setup_start(pgd_t *base)
523{
524 native_pagetable_setup_start(base);
525}
526
527static inline void paravirt_pagetable_setup_done(pgd_t *base)
528{
529 native_pagetable_setup_done(base);
530}
531#endif /* !CONFIG_PARAVIRT */
532
Linus Torvalds1da177e2005-04-16 15:20:36 -0700533#endif /* !__ASSEMBLY__ */
534
Andy Whitcroft05b79bd2005-06-23 00:07:57 -0700535#ifdef CONFIG_FLATMEM
Linus Torvalds1da177e2005-04-16 15:20:36 -0700536#define kern_addr_valid(addr) (1)
Andy Whitcroft05b79bd2005-06-23 00:07:57 -0700537#endif /* CONFIG_FLATMEM */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700538
Linus Torvalds1da177e2005-04-16 15:20:36 -0700539#define io_remap_pfn_range(vma, vaddr, pfn, size, prot) \
540 remap_pfn_range(vma, vaddr, pfn, size, prot)
541
542#define MK_IOSPACE_PFN(space, pfn) (pfn)
543#define GET_IOSPACE(pfn) 0
544#define GET_PFN(pfn) (pfn)
545
Linus Torvalds1da177e2005-04-16 15:20:36 -0700546#include <asm-generic/pgtable.h>
547
548#endif /* _I386_PGTABLE_H */