2 * Copyright 2010 Tilera Corporation. All Rights Reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation, version 2.
8 * This program is distributed in the hope that it will be useful, but
9 * WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, GOOD TITLE or
11 * NON INFRINGEMENT. See the GNU General Public License for
14 * This file contains the functions and defines necessary to modify and use
15 * the TILE page table tree.
18 #ifndef _ASM_TILE_PGTABLE_H
19 #define _ASM_TILE_PGTABLE_H
21 #include <hv/hypervisor.h>
25 #include <linux/bitops.h>
26 #include <linux/threads.h>
27 #include <linux/slab.h>
28 #include <linux/list.h>
29 #include <linux/spinlock.h>
30 #include <asm/processor.h>
31 #include <asm/fixmap.h>
32 #include <asm/system.h>
35 struct vm_area_struct;
38 * ZERO_PAGE is a global shared page that is always zero: used
39 * for zero-mapped memory areas etc..
41 extern unsigned long empty_zero_page[PAGE_SIZE/sizeof(unsigned long)];
42 #define ZERO_PAGE(vaddr) (virt_to_page(empty_zero_page))
44 extern pgd_t swapper_pg_dir[];
45 extern pgprot_t swapper_pgprot;
46 extern struct kmem_cache *pgd_cache;
47 extern spinlock_t pgd_lock;
48 extern struct list_head pgd_list;
51 * The very last slots in the pgd_t are for addresses unusable by Linux
52 * (pgd_addr_invalid() returns true). So we use them for the list structure.
53 * The x86 code we are modelled on uses the page->private/index fields
54 * (older 2.6 kernels) or the lru list (newer 2.6 kernels), but since
55 * our pgds are so much smaller than a page, it seems a waste to
56 * spend a whole page on each pgd.
58 #define PGD_LIST_OFFSET \
59 ((PTRS_PER_PGD * sizeof(pgd_t)) - sizeof(struct list_head))
60 #define pgd_to_list(pgd) \
61 ((struct list_head *)((char *)(pgd) + PGD_LIST_OFFSET))
62 #define list_to_pgd(list) \
63 ((pgd_t *)((char *)(list) - PGD_LIST_OFFSET))
65 extern void pgtable_cache_init(void);
66 extern void paging_init(void);
67 extern void set_page_homes(void);
69 #define FIRST_USER_ADDRESS 0
71 #define _PAGE_PRESENT HV_PTE_PRESENT
72 #define _PAGE_HUGE_PAGE HV_PTE_PAGE
73 #define _PAGE_READABLE HV_PTE_READABLE
74 #define _PAGE_WRITABLE HV_PTE_WRITABLE
75 #define _PAGE_EXECUTABLE HV_PTE_EXECUTABLE
76 #define _PAGE_ACCESSED HV_PTE_ACCESSED
77 #define _PAGE_DIRTY HV_PTE_DIRTY
78 #define _PAGE_GLOBAL HV_PTE_GLOBAL
79 #define _PAGE_USER HV_PTE_USER
82 * All the "standard" bits. Cache-control bits are managed elsewhere.
83 * This is used to test for valid level-2 page table pointers by checking
84 * all the bits, and to mask away the cache control bits for mprotect.
99 __pgprot(_PAGE_PRESENT | _PAGE_ACCESSED)
100 #define PAGE_SHARED \
101 __pgprot(_PAGE_PRESENT | _PAGE_READABLE | _PAGE_WRITABLE | \
102 _PAGE_USER | _PAGE_ACCESSED)
104 #define PAGE_SHARED_EXEC \
105 __pgprot(_PAGE_PRESENT | _PAGE_READABLE | _PAGE_WRITABLE | \
106 _PAGE_EXECUTABLE | _PAGE_USER | _PAGE_ACCESSED)
107 #define PAGE_COPY_NOEXEC \
108 __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_ACCESSED | _PAGE_READABLE)
109 #define PAGE_COPY_EXEC \
110 __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_ACCESSED | \
111 _PAGE_READABLE | _PAGE_EXECUTABLE)
114 #define PAGE_READONLY \
115 __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_ACCESSED | _PAGE_READABLE)
116 #define PAGE_READONLY_EXEC \
117 __pgprot(_PAGE_PRESENT | _PAGE_USER | _PAGE_ACCESSED | \
118 _PAGE_READABLE | _PAGE_EXECUTABLE)
120 #define _PAGE_KERNEL_RO \
121 (_PAGE_PRESENT | _PAGE_GLOBAL | _PAGE_READABLE | _PAGE_ACCESSED)
122 #define _PAGE_KERNEL \
123 (_PAGE_KERNEL_RO | _PAGE_WRITABLE | _PAGE_DIRTY)
124 #define _PAGE_KERNEL_EXEC (_PAGE_KERNEL_RO | _PAGE_EXECUTABLE)
126 #define PAGE_KERNEL __pgprot(_PAGE_KERNEL)
127 #define PAGE_KERNEL_RO __pgprot(_PAGE_KERNEL_RO)
128 #define PAGE_KERNEL_EXEC __pgprot(_PAGE_KERNEL_EXEC)
130 #define page_to_kpgprot(p) PAGE_KERNEL
133 * We could tighten these up, but for now writable or executable
136 #define __P000 PAGE_NONE
137 #define __P001 PAGE_READONLY
138 #define __P010 PAGE_COPY /* this is write-only, which we won't support */
139 #define __P011 PAGE_COPY
140 #define __P100 PAGE_READONLY_EXEC
141 #define __P101 PAGE_READONLY_EXEC
142 #define __P110 PAGE_COPY_EXEC
143 #define __P111 PAGE_COPY_EXEC
145 #define __S000 PAGE_NONE
146 #define __S001 PAGE_READONLY
147 #define __S010 PAGE_SHARED
148 #define __S011 PAGE_SHARED
149 #define __S100 PAGE_READONLY_EXEC
150 #define __S101 PAGE_READONLY_EXEC
151 #define __S110 PAGE_SHARED_EXEC
152 #define __S111 PAGE_SHARED_EXEC
155 * All the normal _PAGE_ALL bits are ignored for PMDs, except PAGE_PRESENT
156 * and PAGE_HUGE_PAGE, which must be one and zero, respectively.
157 * We set the ignored bits to zero.
159 #define _PAGE_TABLE _PAGE_PRESENT
161 /* Inherit the caching flags from the old protection bits. */
162 #define pgprot_modify(oldprot, newprot) \
163 (pgprot_t) { ((oldprot).val & ~_PAGE_ALL) | (newprot).val }
165 /* Just setting the PFN to zero suffices. */
166 #define pte_pgprot(x) hv_pte_set_pfn((x), 0)
169 * For PTEs and PDEs, we must clear the Present bit first when
170 * clearing a page table entry, so clear the bottom half first and
171 * enforce ordering with a barrier.
173 static inline void __pte_clear(pte_t *ptep)
178 u32 *tmp = (u32 *)ptep;
184 #define pte_clear(mm, addr, ptep) __pte_clear(ptep)
187 * The following only work if pte_present() is true.
188 * Undefined behaviour if not..
190 #define pte_present hv_pte_get_present
191 #define pte_mknotpresent hv_pte_clear_present
192 #define pte_user hv_pte_get_user
193 #define pte_read hv_pte_get_readable
194 #define pte_dirty hv_pte_get_dirty
195 #define pte_young hv_pte_get_accessed
196 #define pte_write hv_pte_get_writable
197 #define pte_exec hv_pte_get_executable
198 #define pte_huge hv_pte_get_page
199 #define pte_rdprotect hv_pte_clear_readable
200 #define pte_exprotect hv_pte_clear_executable
201 #define pte_mkclean hv_pte_clear_dirty
202 #define pte_mkold hv_pte_clear_accessed
203 #define pte_wrprotect hv_pte_clear_writable
204 #define pte_mksmall hv_pte_clear_page
205 #define pte_mkread hv_pte_set_readable
206 #define pte_mkexec hv_pte_set_executable
207 #define pte_mkdirty hv_pte_set_dirty
208 #define pte_mkyoung hv_pte_set_accessed
209 #define pte_mkwrite hv_pte_set_writable
210 #define pte_mkhuge hv_pte_set_page
212 #define pte_special(pte) 0
213 #define pte_mkspecial(pte) (pte)
216 * Use some spare bits in the PTE for user-caching tags.
218 #define pte_set_forcecache hv_pte_set_client0
219 #define pte_get_forcecache hv_pte_get_client0
220 #define pte_clear_forcecache hv_pte_clear_client0
221 #define pte_set_anyhome hv_pte_set_client1
222 #define pte_get_anyhome hv_pte_get_client1
223 #define pte_clear_anyhome hv_pte_clear_client1
226 * A migrating PTE has PAGE_PRESENT clear but all the other bits preserved.
228 #define pte_migrating hv_pte_get_migrating
229 #define pte_mkmigrate(x) hv_pte_set_migrating(hv_pte_clear_present(x))
230 #define pte_donemigrate(x) hv_pte_set_present(hv_pte_clear_migrating(x))
232 #define pte_ERROR(e) \
233 pr_err("%s:%d: bad pte 0x%016llx.\n", __FILE__, __LINE__, pte_val(e))
234 #define pgd_ERROR(e) \
235 pr_err("%s:%d: bad pgd 0x%016llx.\n", __FILE__, __LINE__, pgd_val(e))
237 /* Return PA and protection info for a given kernel VA. */
238 int va_to_cpa_and_pte(void *va, phys_addr_t *cpa, pte_t *pte);
241 * __set_pte() ensures we write the 64-bit PTE with 32-bit words in
242 * the right order on 32-bit platforms and also allows us to write
243 * hooks to check valid PTEs, etc., if we want.
245 void __set_pte(pte_t *ptep, pte_t pte);
248 * set_pte() sets the given PTE and also sanity-checks the
249 * requested PTE against the page homecaching. Unspecified parts
250 * of the PTE are filled in when it is written to memory, i.e. all
251 * caching attributes if "!forcecache", or the home cpu if "anyhome".
253 extern void set_pte(pte_t *ptep, pte_t pte);
254 #define set_pte_at(mm, addr, ptep, pteval) set_pte(ptep, pteval)
255 #define set_pte_atomic(pteptr, pteval) set_pte(pteptr, pteval)
257 #define pte_page(x) pfn_to_page(pte_pfn(x))
259 static inline int pte_none(pte_t pte)
264 static inline unsigned long pte_pfn(pte_t pte)
266 return hv_pte_get_pfn(pte);
269 /* Set or get the remote cache cpu in a pgprot with remote caching. */
270 extern pgprot_t set_remote_cache_cpu(pgprot_t prot, int cpu);
271 extern int get_remote_cache_cpu(pgprot_t prot);
273 static inline pte_t pfn_pte(unsigned long pfn, pgprot_t prot)
275 return hv_pte_set_pfn(prot, pfn);
278 /* Support for priority mappings. */
279 extern void start_mm_caching(struct mm_struct *mm);
280 extern void check_mm_caching(struct mm_struct *prev, struct mm_struct *next);
283 * Support non-linear file mappings (see sys_remap_file_pages).
284 * This is defined by CLIENT1 set but CLIENT0 and _PAGE_PRESENT clear, and the
285 * file offset in the 32 high bits.
287 #define _PAGE_FILE HV_PTE_CLIENT1
288 #define PTE_FILE_MAX_BITS 32
289 #define pte_file(pte) (hv_pte_get_client1(pte) && !hv_pte_get_client0(pte))
290 #define pte_to_pgoff(pte) ((pte).val >> 32)
291 #define pgoff_to_pte(off) ((pte_t) { (((long long)(off)) << 32) | _PAGE_FILE })
294 * Encode and de-code a swap entry (see <linux/swapops.h>).
295 * We put the swap file type+offset in the 32 high bits;
296 * I believe we can just leave the low bits clear.
298 #define __swp_type(swp) ((swp).val & 0x1f)
299 #define __swp_offset(swp) ((swp).val >> 5)
300 #define __swp_entry(type, off) ((swp_entry_t) { (type) | ((off) << 5) })
301 #define __pte_to_swp_entry(pte) ((swp_entry_t) { (pte).val >> 32 })
302 #define __swp_entry_to_pte(swp) ((pte_t) { (((long long) ((swp).val)) << 32) })
305 * Conversion functions: convert a page and protection to a page entry,
306 * and a page entry and page directory to the page they refer to.
309 #define mk_pte(page, pgprot) pfn_pte(page_to_pfn(page), (pgprot))
312 * If we are doing an mprotect(), just accept the new vma->vm_page_prot
313 * value and combine it with the PFN from the old PTE to get a new PTE.
315 static inline pte_t pte_modify(pte_t pte, pgprot_t newprot)
317 return pfn_pte(pte_pfn(pte), newprot);
321 * The pgd page can be thought of an array like this: pgd_t[PTRS_PER_PGD]
323 * This macro returns the index of the entry in the pgd page which would
324 * control the given virtual address.
326 #define pgd_index(address) (((address) >> PGDIR_SHIFT) & (PTRS_PER_PGD - 1))
329 * pgd_offset() returns a (pgd_t *)
330 * pgd_index() is used get the offset into the pgd page's array of pgd_t's.
332 #define pgd_offset(mm, address) ((mm)->pgd + pgd_index(address))
335 * A shortcut which implies the use of the kernel's pgd, instead
338 #define pgd_offset_k(address) pgd_offset(&init_mm, address)
340 #if defined(CONFIG_HIGHPTE)
341 extern pte_t *pte_offset_map(pmd_t *, unsigned long address);
342 #define pte_unmap(pte) kunmap_atomic(pte)
344 #define pte_offset_map(dir, address) pte_offset_kernel(dir, address)
345 #define pte_unmap(pte) do { } while (0)
348 /* Clear a non-executable kernel PTE and flush it from the TLB. */
349 #define kpte_clear_flush(ptep, vaddr) \
351 pte_clear(&init_mm, (vaddr), (ptep)); \
352 local_flush_tlb_page(FLUSH_NONEXEC, (vaddr), PAGE_SIZE); \
356 * The kernel page tables contain what we need, and we flush when we
357 * change specific page table entries.
359 #define update_mmu_cache(vma, address, pte) do { } while (0)
361 #ifdef CONFIG_FLATMEM
362 #define kern_addr_valid(addr) (1)
363 #endif /* CONFIG_FLATMEM */
365 #define io_remap_pfn_range(vma, vaddr, pfn, size, prot) \
366 remap_pfn_range(vma, vaddr, pfn, size, prot)
368 extern void vmalloc_sync_all(void);
370 #endif /* !__ASSEMBLY__ */
373 #include <asm/pgtable_64.h>
375 #include <asm/pgtable_32.h>
380 static inline int pmd_none(pmd_t pmd)
383 * Only check low word on 32-bit platforms, since it might be
384 * out of sync with upper half.
386 return (unsigned long)pmd_val(pmd) == 0;
389 static inline int pmd_present(pmd_t pmd)
391 return pmd_val(pmd) & _PAGE_PRESENT;
394 static inline int pmd_bad(pmd_t pmd)
396 return ((pmd_val(pmd) & _PAGE_ALL) != _PAGE_TABLE);
399 static inline unsigned long pages_to_mb(unsigned long npg)
401 return npg >> (20 - PAGE_SHIFT);
405 * The pmd can be thought of an array like this: pmd_t[PTRS_PER_PMD]
407 * This function returns the index of the entry in the pmd which would
408 * control the given virtual address.
410 static inline unsigned long pmd_index(unsigned long address)
412 return (address >> PMD_SHIFT) & (PTRS_PER_PMD - 1);
415 #define __HAVE_ARCH_PMDP_TEST_AND_CLEAR_YOUNG
416 static inline int pmdp_test_and_clear_young(struct vm_area_struct *vma,
417 unsigned long address,
420 return ptep_test_and_clear_young(vma, address, pmdp_ptep(pmdp));
423 #define __HAVE_ARCH_PMDP_SET_WRPROTECT
424 static inline void pmdp_set_wrprotect(struct mm_struct *mm,
425 unsigned long address, pmd_t *pmdp)
427 ptep_set_wrprotect(mm, address, pmdp_ptep(pmdp));
431 #define __HAVE_ARCH_PMDP_GET_AND_CLEAR
432 static inline pmd_t pmdp_get_and_clear(struct mm_struct *mm,
433 unsigned long address,
436 return pte_pmd(ptep_get_and_clear(mm, address, pmdp_ptep(pmdp)));
439 static inline void __set_pmd(pmd_t *pmdp, pmd_t pmdval)
441 set_pte(pmdp_ptep(pmdp), pmd_pte(pmdval));
444 #define set_pmd_at(mm, addr, pmdp, pmdval) __set_pmd(pmdp, pmdval)
446 /* Create a pmd from a PTFN. */
447 static inline pmd_t ptfn_pmd(unsigned long ptfn, pgprot_t prot)
449 return pte_pmd(hv_pte_set_ptfn(prot, ptfn));
452 /* Return the page-table frame number (ptfn) that a pmd_t points at. */
453 #define pmd_ptfn(pmd) hv_pte_get_ptfn(pmd_pte(pmd))
456 * A given kernel pmd_t maps to a specific virtual address (either a
457 * kernel huge page or a kernel pte_t table). Since kernel pte_t
458 * tables can be aligned at sub-page granularity, this function can
459 * return non-page-aligned pointers, despite its name.
461 static inline unsigned long pmd_page_vaddr(pmd_t pmd)
464 (phys_addr_t)pmd_ptfn(pmd) << HV_LOG2_PAGE_TABLE_ALIGN;
465 return (unsigned long)__va(pa);
469 * A pmd_t points to the base of a huge page or to a pte_t array.
470 * If a pte_t array, since we can have multiple per page, we don't
471 * have a one-to-one mapping of pmd_t's to pages. However, this is
472 * OK for pte_lockptr(), since we just end up with potentially one
473 * lock being used for several pte_t arrays.
475 #define pmd_page(pmd) pfn_to_page(HV_PTFN_TO_PFN(pmd_ptfn(pmd)))
477 static inline void pmd_clear(pmd_t *pmdp)
479 __pte_clear(pmdp_ptep(pmdp));
482 #define pmd_mknotpresent(pmd) pte_pmd(pte_mknotpresent(pmd_pte(pmd)))
483 #define pmd_young(pmd) pte_young(pmd_pte(pmd))
484 #define pmd_mkyoung(pmd) pte_pmd(pte_mkyoung(pmd_pte(pmd)))
485 #define pmd_mkold(pmd) pte_pmd(pte_mkold(pmd_pte(pmd)))
486 #define pmd_mkwrite(pmd) pte_pmd(pte_mkwrite(pmd_pte(pmd)))
487 #define pmd_write(pmd) pte_write(pmd_pte(pmd))
488 #define pmd_wrprotect(pmd) pte_pmd(pte_wrprotect(pmd_pte(pmd)))
489 #define pmd_mkdirty(pmd) pte_pmd(pte_mkdirty(pmd_pte(pmd)))
490 #define pmd_huge_page(pmd) pte_huge(pmd_pte(pmd))
491 #define pmd_mkhuge(pmd) pte_pmd(pte_mkhuge(pmd_pte(pmd)))
492 #define __HAVE_ARCH_PMD_WRITE
494 #define pfn_pmd(pfn, pgprot) pte_pmd(pfn_pte((pfn), (pgprot)))
495 #define pmd_pfn(pmd) pte_pfn(pmd_pte(pmd))
496 #define mk_pmd(page, pgprot) pfn_pmd(page_to_pfn(page), (pgprot))
498 static inline pmd_t pmd_modify(pmd_t pmd, pgprot_t newprot)
500 return pfn_pmd(pmd_pfn(pmd), newprot);
503 #ifdef CONFIG_TRANSPARENT_HUGEPAGE
504 #define has_transparent_hugepage() 1
505 #define pmd_trans_huge pmd_huge_page
507 static inline pmd_t pmd_mksplitting(pmd_t pmd)
509 return pte_pmd(hv_pte_set_client2(pmd_pte(pmd)));
512 static inline int pmd_trans_splitting(pmd_t pmd)
514 return hv_pte_get_client2(pmd_pte(pmd));
516 #endif /* CONFIG_TRANSPARENT_HUGEPAGE */
519 * The pte page can be thought of an array like this: pte_t[PTRS_PER_PTE]
521 * This macro returns the index of the entry in the pte page which would
522 * control the given virtual address.
524 static inline unsigned long pte_index(unsigned long address)
526 return (address >> PAGE_SHIFT) & (PTRS_PER_PTE - 1);
529 static inline pte_t *pte_offset_kernel(pmd_t *pmd, unsigned long address)
531 return (pte_t *)pmd_page_vaddr(*pmd) + pte_index(address);
534 #include <asm-generic/pgtable.h>
536 /* Support /proc/NN/pgtable API. */
538 int arch_proc_pgtable_show(struct seq_file *m, struct mm_struct *mm,
539 unsigned long vaddr, pte_t *ptep, void **datap);
541 #endif /* !__ASSEMBLY__ */
543 #endif /* _ASM_TILE_PGTABLE_H */