1 #ifndef _ASM_POWERPC_PGTABLE_H
2 #define _ASM_POWERPC_PGTABLE_H
6 #include <asm/processor.h> /* For TASK_SIZE */
12 #ifdef CONFIG_DEBUG_VM
13 extern void assert_pte_locked(struct mm_struct
*mm
, unsigned long addr
);
14 #else /* CONFIG_DEBUG_VM */
15 static inline void assert_pte_locked(struct mm_struct
*mm
, unsigned long addr
)
18 #endif /* !CONFIG_DEBUG_VM */
20 #endif /* !__ASSEMBLY__ */
22 #if defined(CONFIG_PPC64)
23 # include <asm/pgtable-ppc64.h>
25 # include <asm/pgtable-ppc32.h>
30 /* Insert a PTE, top-level function is out of line. It uses an inline
31 * low level function in the respective pgtable-* files
33 extern void set_pte_at(struct mm_struct
*mm
, unsigned long addr
, pte_t
*ptep
,
36 /* This low level function performs the actual PTE insertion
37 * Setting the PTE depends on the MMU type and other factors. It's
38 * an horrible mess that I'm not going to try to clean up now but
39 * I'm keeping it in one place rather than spread around
41 static inline void __set_pte_at(struct mm_struct
*mm
, unsigned long addr
,
42 pte_t
*ptep
, pte_t pte
, int percpu
)
44 #if defined(CONFIG_PPC_STD_MMU_32) && defined(CONFIG_SMP) && !defined(CONFIG_PTE_64BIT)
45 /* First case is 32-bit Hash MMU in SMP mode with 32-bit PTEs. We use the
46 * helper pte_update() which does an atomic update. We need to do that
47 * because a concurrent invalidation can clear _PAGE_HASHPTE. If it's a
48 * per-CPU PTE such as a kmap_atomic, we do a simple update preserving
49 * the hash bits instead (ie, same as the non-SMP case)
52 *ptep
= __pte((pte_val(*ptep
) & _PAGE_HASHPTE
)
53 | (pte_val(pte
) & ~_PAGE_HASHPTE
));
55 pte_update(ptep
, ~_PAGE_HASHPTE
, pte_val(pte
));
57 #elif defined(CONFIG_PPC32) && defined(CONFIG_PTE_64BIT) && defined(CONFIG_SMP)
58 /* Second case is 32-bit with 64-bit PTE in SMP mode. In this case, we
59 * can just store as long as we do the two halves in the right order
60 * with a barrier in between. This is possible because we take care,
61 * in the hash code, to pre-invalidate if the PTE was already hashed,
62 * which synchronizes us with any concurrent invalidation.
63 * In the percpu case, we also fallback to the simple update preserving
67 *ptep
= __pte((pte_val(*ptep
) & _PAGE_HASHPTE
)
68 | (pte_val(pte
) & ~_PAGE_HASHPTE
));
71 #if _PAGE_HASHPTE != 0
72 if (pte_val(*ptep
) & _PAGE_HASHPTE
)
73 flush_hash_entry(mm
, ptep
, addr
);
75 __asm__
__volatile__("\
79 : "=m" (*ptep
), "=m" (*((unsigned char *)ptep
+4))
80 : "r" (pte
) : "memory");
82 #elif defined(CONFIG_PPC_STD_MMU_32)
83 /* Third case is 32-bit hash table in UP mode, we need to preserve
84 * the _PAGE_HASHPTE bit since we may not have invalidated the previous
85 * translation in the hash yet (done in a subsequent flush_tlb_xxx())
86 * and see we need to keep track that this PTE needs invalidating
88 *ptep
= __pte((pte_val(*ptep
) & _PAGE_HASHPTE
)
89 | (pte_val(pte
) & ~_PAGE_HASHPTE
));
92 /* Anything else just stores the PTE normally. That covers all 64-bit
93 * cases, and 32-bit non-hash with 64-bit PTEs in UP mode
100 #define __HAVE_ARCH_PTEP_SET_ACCESS_FLAGS
101 extern int ptep_set_access_flags(struct vm_area_struct
*vma
, unsigned long address
,
102 pte_t
*ptep
, pte_t entry
, int dirty
);
105 * Macro to mark a page protection value as "uncacheable".
108 #define _PAGE_CACHE_CTL (_PAGE_COHERENT | _PAGE_GUARDED | _PAGE_NO_CACHE | \
111 #define pgprot_noncached(prot) (__pgprot((pgprot_val(prot) & ~_PAGE_CACHE_CTL) | \
112 _PAGE_NO_CACHE | _PAGE_GUARDED))
114 #define pgprot_noncached_wc(prot) (__pgprot((pgprot_val(prot) & ~_PAGE_CACHE_CTL) | \
117 #define pgprot_cached(prot) (__pgprot((pgprot_val(prot) & ~_PAGE_CACHE_CTL) | \
120 #define pgprot_cached_wthru(prot) (__pgprot((pgprot_val(prot) & ~_PAGE_CACHE_CTL) | \
121 _PAGE_COHERENT | _PAGE_WRITETHRU))
125 extern pgprot_t
phys_mem_access_prot(struct file
*file
, unsigned long pfn
,
126 unsigned long size
, pgprot_t vma_prot
);
127 #define __HAVE_PHYS_MEM_ACCESS_PROT
130 * ZERO_PAGE is a global shared page that is always zero: used
131 * for zero-mapped memory areas etc..
133 extern unsigned long empty_zero_page
[];
134 #define ZERO_PAGE(vaddr) (virt_to_page(empty_zero_page))
136 extern pgd_t swapper_pg_dir
[];
138 extern void paging_init(void);
141 * kern_addr_valid is intended to indicate whether an address is a valid
142 * kernel address. Most 32-bit archs define it as always true (like this)
143 * but most 64-bit archs actually perform a test. What should we do here?
145 #define kern_addr_valid(addr) (1)
147 #define io_remap_pfn_range(vma, vaddr, pfn, size, prot) \
148 remap_pfn_range(vma, vaddr, pfn, size, prot)
150 #include <asm-generic/pgtable.h>
154 * This gets called at the end of handling a page fault, when
155 * the kernel has put a new PTE into the page table for the process.
156 * We use it to ensure coherency between the i-cache and d-cache
157 * for the page which has just been mapped in.
158 * On machines which use an MMU hash table, we use this to put a
159 * corresponding HPTE into the hash table ahead of time, instead of
160 * waiting for the inevitable extra hash-table miss exception.
162 extern void update_mmu_cache(struct vm_area_struct
*, unsigned long, pte_t
);
164 #endif /* __ASSEMBLY__ */
166 #endif /* __KERNEL__ */
167 #endif /* _ASM_POWERPC_PGTABLE_H */
This page took 0.035702 seconds and 6 git commands to generate.