at v3.3-rc2 285 lines 7.9 kB view raw
1#ifndef _ASM_SCORE_PGTABLE_H 2#define _ASM_SCORE_PGTABLE_H 3 4#include <linux/const.h> 5#include <asm-generic/pgtable-nopmd.h> 6 7#include <asm/fixmap.h> 8#include <asm/setup.h> 9#include <asm/pgtable-bits.h> 10 11extern void load_pgd(unsigned long pg_dir); 12extern pte_t invalid_pte_table[PAGE_SIZE/sizeof(pte_t)]; 13 14/* PGDIR_SHIFT determines what a third-level page table entry can map */ 15#define PGDIR_SHIFT 22 16#define PGDIR_SIZE (_AC(1, UL) << PGDIR_SHIFT) 17#define PGDIR_MASK (~(PGDIR_SIZE - 1)) 18 19/* 20 * Entries per page directory level: we use two-level, so 21 * we don't really have any PUD/PMD directory physically. 22 */ 23#define PGD_ORDER 0 24#define PTE_ORDER 0 25 26#define PTRS_PER_PGD 1024 27#define PTRS_PER_PTE 1024 28 29#define USER_PTRS_PER_PGD (0x80000000UL/PGDIR_SIZE) 30#define FIRST_USER_ADDRESS 0 31 32#define VMALLOC_START (0xc0000000UL) 33 34#define PKMAP_BASE (0xfd000000UL) 35 36#define VMALLOC_END (FIXADDR_START - 2*PAGE_SIZE) 37 38#define pte_ERROR(e) \ 39 printk(KERN_ERR "%s:%d: bad pte %08lx.\n", \ 40 __FILE__, __LINE__, pte_val(e)) 41#define pgd_ERROR(e) \ 42 printk(KERN_ERR "%s:%d: bad pgd %08lx.\n", \ 43 __FILE__, __LINE__, pgd_val(e)) 44 45/* 46 * Empty pgd/pmd entries point to the invalid_pte_table. 47 */ 48static inline int pmd_none(pmd_t pmd) 49{ 50 return pmd_val(pmd) == (unsigned long) invalid_pte_table; 51} 52 53#define pmd_bad(pmd) (pmd_val(pmd) & ~PAGE_MASK) 54 55static inline int pmd_present(pmd_t pmd) 56{ 57 return pmd_val(pmd) != (unsigned long) invalid_pte_table; 58} 59 60static inline void pmd_clear(pmd_t *pmdp) 61{ 62 pmd_val(*pmdp) = ((unsigned long) invalid_pte_table); 63} 64 65#define pte_page(x) pfn_to_page(pte_pfn(x)) 66#define pte_pfn(x) ((unsigned long)((x).pte >> PAGE_SHIFT)) 67#define pfn_pte(pfn, prot) \ 68 __pte(((unsigned long long)(pfn) << PAGE_SHIFT) | pgprot_val(prot)) 69 70#define __pgd_offset(address) pgd_index(address) 71#define __pud_offset(address) (((address) >> PUD_SHIFT) & (PTRS_PER_PUD-1)) 72#define __pmd_offset(address) (((address) >> PMD_SHIFT) & (PTRS_PER_PMD-1)) 73 74/* to find an entry in a kernel page-table-directory */ 75#define pgd_offset_k(address) pgd_offset(&init_mm, address) 76#define pgd_index(address) (((address) >> PGDIR_SHIFT) & (PTRS_PER_PGD-1)) 77 78/* to find an entry in a page-table-directory */ 79#define pgd_offset(mm, addr) ((mm)->pgd + pgd_index(addr)) 80 81/* Find an entry in the third-level page table.. */ 82#define __pte_offset(address) \ 83 (((address) >> PAGE_SHIFT) & (PTRS_PER_PTE - 1)) 84#define pte_offset(dir, address) \ 85 ((pte_t *) pmd_page_vaddr(*(dir)) + __pte_offset(address)) 86#define pte_offset_kernel(dir, address) \ 87 ((pte_t *) pmd_page_vaddr(*(dir)) + __pte_offset(address)) 88 89#define pte_offset_map(dir, address) \ 90 ((pte_t *)page_address(pmd_page(*(dir))) + __pte_offset(address)) 91#define pte_unmap(pte) ((void)(pte)) 92 93/* 94 * Bits 9(_PAGE_PRESENT) and 10(_PAGE_FILE)are taken, 95 * split up 30 bits of offset into this range: 96 */ 97#define PTE_FILE_MAX_BITS 30 98#define pte_to_pgoff(_pte) \ 99 (((_pte).pte & 0x1ff) | (((_pte).pte >> 11) << 9)) 100#define pgoff_to_pte(off) \ 101 ((pte_t) {((off) & 0x1ff) | (((off) >> 9) << 11) | _PAGE_FILE}) 102#define __pte_to_swp_entry(pte) \ 103 ((swp_entry_t) { pte_val(pte)}) 104#define __swp_entry_to_pte(x) ((pte_t) {(x).val}) 105 106#define pmd_phys(pmd) __pa((void *)pmd_val(pmd)) 107#define pmd_page(pmd) (pfn_to_page(pmd_phys(pmd) >> PAGE_SHIFT)) 108#define mk_pte(page, prot) pfn_pte(page_to_pfn(page), prot) 109static inline pte_t pte_mkspecial(pte_t pte) { return pte; } 110 111#define set_pte(pteptr, pteval) (*(pteptr) = pteval) 112#define set_pte_at(mm, addr, ptep, pteval) set_pte(ptep, pteval) 113#define pte_clear(mm, addr, xp) \ 114 do { set_pte_at(mm, addr, xp, __pte(0)); } while (0) 115 116#define io_remap_pfn_range(vma, vaddr, pfn, size, prot) \ 117 remap_pfn_range(vma, vaddr, pfn, size, prot) 118 119/* 120 * The "pgd_xxx()" functions here are trivial for a folded two-level 121 * setup: the pgd is never bad, and a pmd always exists (as it's folded 122 * into the pgd entry) 123 */ 124#define pgd_present(pgd) (1) 125#define pgd_none(pgd) (0) 126#define pgd_bad(pgd) (0) 127#define pgd_clear(pgdp) do { } while (0) 128 129#define kern_addr_valid(addr) (1) 130#define pmd_page_vaddr(pmd) pmd_val(pmd) 131 132#define pte_none(pte) (!(pte_val(pte) & ~_PAGE_GLOBAL)) 133#define pte_present(pte) (pte_val(pte) & _PAGE_PRESENT) 134 135#define PAGE_NONE __pgprot(_PAGE_PRESENT | _PAGE_CACHE) 136#define PAGE_SHARED __pgprot(_PAGE_PRESENT | _PAGE_READ | _PAGE_WRITE | \ 137 _PAGE_CACHE) 138#define PAGE_COPY __pgprot(_PAGE_PRESENT | _PAGE_READ | _PAGE_CACHE) 139#define PAGE_READONLY __pgprot(_PAGE_PRESENT | _PAGE_READ | _PAGE_CACHE) 140#define PAGE_KERNEL __pgprot(_PAGE_PRESENT | __READABLE | __WRITEABLE | \ 141 _PAGE_GLOBAL | _PAGE_CACHE) 142#define PAGE_KERNEL_UNCACHED __pgprot(_PAGE_PRESENT | __READABLE | \ 143 __WRITEABLE | _PAGE_GLOBAL & ~_PAGE_CACHE) 144 145#define __P000 PAGE_NONE 146#define __P001 PAGE_READONLY 147#define __P010 PAGE_COPY 148#define __P011 PAGE_COPY 149#define __P100 PAGE_READONLY 150#define __P101 PAGE_READONLY 151#define __P110 PAGE_COPY 152#define __P111 PAGE_COPY 153 154#define __S000 PAGE_NONE 155#define __S001 PAGE_READONLY 156#define __S010 PAGE_SHARED 157#define __S011 PAGE_SHARED 158#define __S100 PAGE_READONLY 159#define __S101 PAGE_READONLY 160#define __S110 PAGE_SHARED 161#define __S111 PAGE_SHARED 162 163#define pgprot_noncached pgprot_noncached 164 165static inline pgprot_t pgprot_noncached(pgprot_t _prot) 166{ 167 unsigned long prot = pgprot_val(_prot); 168 169 prot = (prot & ~_CACHE_MASK); 170 171 return __pgprot(prot); 172} 173 174#define __swp_type(x) ((x).val & 0x1f) 175#define __swp_offset(x) ((x).val >> 11) 176#define __swp_entry(type, offset) ((swp_entry_t){(type) | ((offset) << 11)}) 177 178extern unsigned long empty_zero_page; 179extern unsigned long zero_page_mask; 180 181#define ZERO_PAGE(vaddr) \ 182 (virt_to_page((void *)(empty_zero_page + \ 183 (((unsigned long)(vaddr)) & zero_page_mask)))) 184 185#define pgtable_cache_init() do {} while (0) 186 187#define arch_enter_lazy_cpu_mode() do {} while (0) 188 189static inline int pte_write(pte_t pte) 190{ 191 return pte_val(pte) & _PAGE_WRITE; 192} 193 194static inline int pte_dirty(pte_t pte) 195{ 196 return pte_val(pte) & _PAGE_MODIFIED; 197} 198 199static inline int pte_young(pte_t pte) 200{ 201 return pte_val(pte) & _PAGE_ACCESSED; 202} 203 204static inline int pte_file(pte_t pte) 205{ 206 return pte_val(pte) & _PAGE_FILE; 207} 208 209#define pte_special(pte) (0) 210 211static inline pte_t pte_wrprotect(pte_t pte) 212{ 213 pte_val(pte) &= ~(_PAGE_WRITE | _PAGE_SILENT_WRITE); 214 return pte; 215} 216 217static inline pte_t pte_mkclean(pte_t pte) 218{ 219 pte_val(pte) &= ~(_PAGE_MODIFIED|_PAGE_SILENT_WRITE); 220 return pte; 221} 222 223static inline pte_t pte_mkold(pte_t pte) 224{ 225 pte_val(pte) &= ~(_PAGE_ACCESSED|_PAGE_SILENT_READ); 226 return pte; 227} 228 229static inline pte_t pte_mkwrite(pte_t pte) 230{ 231 pte_val(pte) |= _PAGE_WRITE; 232 if (pte_val(pte) & _PAGE_MODIFIED) 233 pte_val(pte) |= _PAGE_SILENT_WRITE; 234 return pte; 235} 236 237static inline pte_t pte_mkdirty(pte_t pte) 238{ 239 pte_val(pte) |= _PAGE_MODIFIED; 240 if (pte_val(pte) & _PAGE_WRITE) 241 pte_val(pte) |= _PAGE_SILENT_WRITE; 242 return pte; 243} 244 245static inline pte_t pte_mkyoung(pte_t pte) 246{ 247 pte_val(pte) |= _PAGE_ACCESSED; 248 if (pte_val(pte) & _PAGE_READ) 249 pte_val(pte) |= _PAGE_SILENT_READ; 250 return pte; 251} 252 253#define set_pmd(pmdptr, pmdval) \ 254 do { *(pmdptr) = (pmdval); } while (0) 255#define pte_present(pte) (pte_val(pte) & _PAGE_PRESENT) 256 257extern unsigned long pgd_current; 258extern pgd_t swapper_pg_dir[PTRS_PER_PGD]; 259extern void paging_init(void); 260 261static inline pte_t pte_modify(pte_t pte, pgprot_t newprot) 262{ 263 return __pte((pte_val(pte) & _PAGE_CHG_MASK) | pgprot_val(newprot)); 264} 265 266extern void __update_tlb(struct vm_area_struct *vma, 267 unsigned long address, pte_t pte); 268extern void __update_cache(struct vm_area_struct *vma, 269 unsigned long address, pte_t pte); 270 271static inline void update_mmu_cache(struct vm_area_struct *vma, 272 unsigned long address, pte_t *ptep) 273{ 274 pte_t pte = *ptep; 275 __update_tlb(vma, address, pte); 276 __update_cache(vma, address, pte); 277} 278 279#ifndef __ASSEMBLY__ 280#include <asm-generic/pgtable.h> 281 282void setup_memory(void); 283#endif /* __ASSEMBLY__ */ 284 285#endif /* _ASM_SCORE_PGTABLE_H */