Linux Audio

Check our new training course

Loading...
v5.9
  1/* SPDX-License-Identifier: GPL-2.0 */
  2#ifndef _ASM_POWERPC_PGTABLE_RADIX_H
  3#define _ASM_POWERPC_PGTABLE_RADIX_H
  4
  5#include <asm/asm-const.h>
  6
  7#ifndef __ASSEMBLY__
  8#include <asm/cmpxchg.h>
  9#endif
 10
 11#ifdef CONFIG_PPC_64K_PAGES
 12#include <asm/book3s/64/radix-64k.h>
 13#else
 14#include <asm/book3s/64/radix-4k.h>
 15#endif
 16
 
 
 
 
 
 
 17#ifndef __ASSEMBLY__
 18#include <asm/book3s/64/tlbflush-radix.h>
 19#include <asm/cpu_has_feature.h>
 20#endif
 21
 22/* An empty PTE can still have a R or C writeback */
 23#define RADIX_PTE_NONE_MASK		(_PAGE_DIRTY | _PAGE_ACCESSED)
 24
 25/* Bits to set in a RPMD/RPUD/RPGD */
 26#define RADIX_PMD_VAL_BITS		(0x8000000000000000UL | RADIX_PTE_INDEX_SIZE)
 27#define RADIX_PUD_VAL_BITS		(0x8000000000000000UL | RADIX_PMD_INDEX_SIZE)
 28#define RADIX_PGD_VAL_BITS		(0x8000000000000000UL | RADIX_PUD_INDEX_SIZE)
 29
 30/* Don't have anything in the reserved bits and leaf bits */
 31#define RADIX_PMD_BAD_BITS		0x60000000000000e0UL
 32#define RADIX_PUD_BAD_BITS		0x60000000000000e0UL
 33#define RADIX_P4D_BAD_BITS		0x60000000000000e0UL
 34
 35#define RADIX_PMD_SHIFT		(PAGE_SHIFT + RADIX_PTE_INDEX_SIZE)
 36#define RADIX_PUD_SHIFT		(RADIX_PMD_SHIFT + RADIX_PMD_INDEX_SIZE)
 37#define RADIX_PGD_SHIFT		(RADIX_PUD_SHIFT + RADIX_PUD_INDEX_SIZE)
 38/*
 39 * Size of EA range mapped by our pagetables.
 40 */
 41#define RADIX_PGTABLE_EADDR_SIZE (RADIX_PTE_INDEX_SIZE + RADIX_PMD_INDEX_SIZE +	\
 42			      RADIX_PUD_INDEX_SIZE + RADIX_PGD_INDEX_SIZE + PAGE_SHIFT)
 43#define RADIX_PGTABLE_RANGE (ASM_CONST(1) << RADIX_PGTABLE_EADDR_SIZE)
 44
 45/*
 46 * We support 52 bit address space, Use top bit for kernel
 47 * virtual mapping. Also make sure kernel fit in the top
 48 * quadrant.
 49 *
 50 *           +------------------+
 51 *           +------------------+  Kernel virtual map (0xc008000000000000)
 52 *           |                  |
 53 *           |                  |
 54 *           |                  |
 55 * 0b11......+------------------+  Kernel linear map (0xc....)
 56 *           |                  |
 57 *           |     2 quadrant   |
 58 *           |                  |
 59 * 0b10......+------------------+
 60 *           |                  |
 61 *           |    1 quadrant    |
 62 *           |                  |
 63 * 0b01......+------------------+
 64 *           |                  |
 65 *           |    0 quadrant    |
 66 *           |                  |
 67 * 0b00......+------------------+
 68 *
 69 *
 70 * 3rd quadrant expanded:
 71 * +------------------------------+
 72 * |                              |
 73 * |                              |
 74 * |                              |
 75 * +------------------------------+  Kernel vmemmap end (0xc010000000000000)
 76 * |                              |
 77 * |           512TB		  |
 78 * |                              |
 79 * +------------------------------+  Kernel IO map end/vmemap start
 80 * |                              |
 81 * |           512TB		  |
 82 * |                              |
 83 * +------------------------------+  Kernel vmap end/ IO map start
 84 * |                              |
 85 * |           512TB		  |
 
 
 
 
 86 * |                              |
 87 * +------------------------------+  Kernel virt start (0xc008000000000000)
 88 * |                              |
 89 * |                              |
 90 * |                              |
 91 * +------------------------------+  Kernel linear (0xc.....)
 92 */
 93
 94#define RADIX_KERN_VIRT_START	ASM_CONST(0xc008000000000000)
 
 
 95/*
 96 * 49 =  MAX_EA_BITS_PER_CONTEXT (hash specific). To make sure we pick
 97 * the same value as hash.
 
 98 */
 99#define RADIX_KERN_MAP_SIZE	(1UL << 49)
100
101#define RADIX_VMALLOC_START	RADIX_KERN_VIRT_START
102#define RADIX_VMALLOC_SIZE	RADIX_KERN_MAP_SIZE
103#define RADIX_VMALLOC_END	(RADIX_VMALLOC_START + RADIX_VMALLOC_SIZE)
 
 
 
 
 
104
105#define RADIX_KERN_IO_START	RADIX_VMALLOC_END
106#define RADIX_KERN_IO_SIZE	RADIX_KERN_MAP_SIZE
107#define RADIX_KERN_IO_END	(RADIX_KERN_IO_START + RADIX_KERN_IO_SIZE)
108
109#define RADIX_VMEMMAP_START	RADIX_KERN_IO_END
110#define RADIX_VMEMMAP_SIZE	RADIX_KERN_MAP_SIZE
111#define RADIX_VMEMMAP_END	(RADIX_VMEMMAP_START + RADIX_VMEMMAP_SIZE)
112
113#ifndef __ASSEMBLY__
114#define RADIX_PTE_TABLE_SIZE	(sizeof(pte_t) << RADIX_PTE_INDEX_SIZE)
115#define RADIX_PMD_TABLE_SIZE	(sizeof(pmd_t) << RADIX_PMD_INDEX_SIZE)
116#define RADIX_PUD_TABLE_SIZE	(sizeof(pud_t) << RADIX_PUD_INDEX_SIZE)
117#define RADIX_PGD_TABLE_SIZE	(sizeof(pgd_t) << RADIX_PGD_INDEX_SIZE)
118
119#ifdef CONFIG_STRICT_KERNEL_RWX
120extern void radix__mark_rodata_ro(void);
121extern void radix__mark_initmem_nx(void);
122#endif
123
124extern void radix__ptep_set_access_flags(struct vm_area_struct *vma, pte_t *ptep,
125					 pte_t entry, unsigned long address,
126					 int psize);
127
128extern void radix__ptep_modify_prot_commit(struct vm_area_struct *vma,
129					   unsigned long addr, pte_t *ptep,
130					   pte_t old_pte, pte_t pte);
131
132static inline unsigned long __radix_pte_update(pte_t *ptep, unsigned long clr,
133					       unsigned long set)
134{
135	__be64 old_be, tmp_be;
 
 
 
 
 
 
136
137	__asm__ __volatile__(
138	"1:	ldarx	%0,0,%3		# pte_update\n"
139	"	andc	%1,%0,%5	\n"
140	"	or	%1,%1,%4	\n"
141	"	stdcx.	%1,0,%3		\n"
142	"	bne-	1b"
143	: "=&r" (old_be), "=&r" (tmp_be), "=m" (*ptep)
144	: "r" (ptep), "r" (cpu_to_be64(set)), "r" (cpu_to_be64(clr))
145	: "cc" );
146
147	return be64_to_cpu(old_be);
148}
149
 
150static inline unsigned long radix__pte_update(struct mm_struct *mm,
151					unsigned long addr,
152					pte_t *ptep, unsigned long clr,
153					unsigned long set,
154					int huge)
155{
156	unsigned long old_pte;
157
158	old_pte = __radix_pte_update(ptep, clr, set);
 
 
 
 
 
 
 
 
 
 
 
 
 
159	if (!huge)
160		assert_pte_locked(mm, addr);
161
162	return old_pte;
163}
164
165static inline pte_t radix__ptep_get_and_clear_full(struct mm_struct *mm,
166						   unsigned long addr,
167						   pte_t *ptep, int full)
168{
169	unsigned long old_pte;
170
171	if (full) {
172		old_pte = pte_val(*ptep);
173		*ptep = __pte(0);
 
 
 
 
 
 
174	} else
175		old_pte = radix__pte_update(mm, addr, ptep, ~0ul, 0, 0);
176
177	return __pte(old_pte);
178}
179
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
180static inline int radix__pte_same(pte_t pte_a, pte_t pte_b)
181{
182	return ((pte_raw(pte_a) ^ pte_raw(pte_b)) == 0);
183}
184
185static inline int radix__pte_none(pte_t pte)
186{
187	return (pte_val(pte) & ~RADIX_PTE_NONE_MASK) == 0;
188}
189
190static inline void radix__set_pte_at(struct mm_struct *mm, unsigned long addr,
191				 pte_t *ptep, pte_t pte, int percpu)
192{
193	*ptep = pte;
194
195	/*
196	 * The architecture suggests a ptesync after setting the pte, which
197	 * orders the store that updates the pte with subsequent page table
198	 * walk accesses which may load the pte. Without this it may be
199	 * possible for a subsequent access to result in spurious fault.
200	 *
201	 * This is not necessary for correctness, because a spurious fault
202	 * is tolerated by the page fault handler, and this store will
203	 * eventually be seen. In testing, there was no noticable increase
204	 * in user faults on POWER9. Avoiding ptesync here is a significant
205	 * win for things like fork. If a future microarchitecture benefits
206	 * from ptesync, it should probably go into update_mmu_cache, rather
207	 * than set_pte_at (which is used to set ptes unrelated to faults).
208	 *
209	 * Spurious faults to vmalloc region are not tolerated, so there is
210	 * a ptesync in flush_cache_vmap.
211	 */
212}
213
214static inline int radix__pmd_bad(pmd_t pmd)
215{
216	return !!(pmd_val(pmd) & RADIX_PMD_BAD_BITS);
217}
218
219static inline int radix__pmd_same(pmd_t pmd_a, pmd_t pmd_b)
220{
221	return ((pmd_raw(pmd_a) ^ pmd_raw(pmd_b)) == 0);
222}
223
224static inline int radix__pud_bad(pud_t pud)
225{
226	return !!(pud_val(pud) & RADIX_PUD_BAD_BITS);
227}
228
229
230static inline int radix__p4d_bad(p4d_t p4d)
231{
232	return !!(p4d_val(p4d) & RADIX_P4D_BAD_BITS);
233}
234
235#ifdef CONFIG_TRANSPARENT_HUGEPAGE
236
237static inline int radix__pmd_trans_huge(pmd_t pmd)
238{
239	return (pmd_val(pmd) & (_PAGE_PTE | _PAGE_DEVMAP)) == _PAGE_PTE;
240}
241
242static inline pmd_t radix__pmd_mkhuge(pmd_t pmd)
243{
 
 
244	return __pmd(pmd_val(pmd) | _PAGE_PTE);
245}
246
247extern unsigned long radix__pmd_hugepage_update(struct mm_struct *mm, unsigned long addr,
248					  pmd_t *pmdp, unsigned long clr,
249					  unsigned long set);
250extern pmd_t radix__pmdp_collapse_flush(struct vm_area_struct *vma,
251				  unsigned long address, pmd_t *pmdp);
252extern void radix__pgtable_trans_huge_deposit(struct mm_struct *mm, pmd_t *pmdp,
253					pgtable_t pgtable);
254extern pgtable_t radix__pgtable_trans_huge_withdraw(struct mm_struct *mm, pmd_t *pmdp);
255extern pmd_t radix__pmdp_huge_get_and_clear(struct mm_struct *mm,
256				      unsigned long addr, pmd_t *pmdp);
257static inline int radix__has_transparent_hugepage(void)
258{
259	/* For radix 2M at PMD level means thp */
260	if (mmu_psize_defs[MMU_PAGE_2M].shift == PMD_SHIFT)
261		return 1;
262	return 0;
263}
264#endif
265
266static inline pmd_t radix__pmd_mkdevmap(pmd_t pmd)
267{
268	return __pmd(pmd_val(pmd) | (_PAGE_PTE | _PAGE_DEVMAP));
269}
270
271extern int __meminit radix__vmemmap_create_mapping(unsigned long start,
272					     unsigned long page_size,
273					     unsigned long phys);
274extern void radix__vmemmap_remove_mapping(unsigned long start,
275				    unsigned long page_size);
276
277extern int radix__map_kernel_page(unsigned long ea, unsigned long pa,
278				 pgprot_t flags, unsigned int psz);
279
280static inline unsigned long radix__get_tree_size(void)
281{
282	unsigned long rts_field;
283	/*
284	 * We support 52 bits, hence:
285	 * bits 52 - 31 = 21, 0b10101
 
286	 * RTS encoding details
287	 * bits 0 - 3 of rts -> bits 6 - 8 unsigned long
288	 * bits 4 - 5 of rts -> bits 62 - 63 of unsigned long
289	 */
290	rts_field = (0x5UL << 5); /* 6 - 8 bits */
291	rts_field |= (0x2UL << 61);
292
 
 
 
293	return rts_field;
294}
295
296#ifdef CONFIG_MEMORY_HOTPLUG
297int radix__create_section_mapping(unsigned long start, unsigned long end,
298				  int nid, pgprot_t prot);
299int radix__remove_section_mapping(unsigned long start, unsigned long end);
300#endif /* CONFIG_MEMORY_HOTPLUG */
301#endif /* __ASSEMBLY__ */
302#endif
v4.17
  1/* SPDX-License-Identifier: GPL-2.0 */
  2#ifndef _ASM_POWERPC_PGTABLE_RADIX_H
  3#define _ASM_POWERPC_PGTABLE_RADIX_H
  4
 
 
  5#ifndef __ASSEMBLY__
  6#include <asm/cmpxchg.h>
  7#endif
  8
  9#ifdef CONFIG_PPC_64K_PAGES
 10#include <asm/book3s/64/radix-64k.h>
 11#else
 12#include <asm/book3s/64/radix-4k.h>
 13#endif
 14
 15/*
 16 * For P9 DD1 only, we need to track whether the pte's huge.
 17 */
 18#define R_PAGE_LARGE	_RPAGE_RSV1
 19
 20
 21#ifndef __ASSEMBLY__
 22#include <asm/book3s/64/tlbflush-radix.h>
 23#include <asm/cpu_has_feature.h>
 24#endif
 25
 26/* An empty PTE can still have a R or C writeback */
 27#define RADIX_PTE_NONE_MASK		(_PAGE_DIRTY | _PAGE_ACCESSED)
 28
 29/* Bits to set in a RPMD/RPUD/RPGD */
 30#define RADIX_PMD_VAL_BITS		(0x8000000000000000UL | RADIX_PTE_INDEX_SIZE)
 31#define RADIX_PUD_VAL_BITS		(0x8000000000000000UL | RADIX_PMD_INDEX_SIZE)
 32#define RADIX_PGD_VAL_BITS		(0x8000000000000000UL | RADIX_PUD_INDEX_SIZE)
 33
 34/* Don't have anything in the reserved bits and leaf bits */
 35#define RADIX_PMD_BAD_BITS		0x60000000000000e0UL
 36#define RADIX_PUD_BAD_BITS		0x60000000000000e0UL
 37#define RADIX_PGD_BAD_BITS		0x60000000000000e0UL
 38
 
 
 
 39/*
 40 * Size of EA range mapped by our pagetables.
 41 */
 42#define RADIX_PGTABLE_EADDR_SIZE (RADIX_PTE_INDEX_SIZE + RADIX_PMD_INDEX_SIZE +	\
 43			      RADIX_PUD_INDEX_SIZE + RADIX_PGD_INDEX_SIZE + PAGE_SHIFT)
 44#define RADIX_PGTABLE_RANGE (ASM_CONST(1) << RADIX_PGTABLE_EADDR_SIZE)
 45
 46/*
 47 * We support 52 bit address space, Use top bit for kernel
 48 * virtual mapping. Also make sure kernel fit in the top
 49 * quadrant.
 50 *
 51 *           +------------------+
 52 *           +------------------+  Kernel virtual map (0xc008000000000000)
 53 *           |                  |
 54 *           |                  |
 55 *           |                  |
 56 * 0b11......+------------------+  Kernel linear map (0xc....)
 57 *           |                  |
 58 *           |     2 quadrant   |
 59 *           |                  |
 60 * 0b10......+------------------+
 61 *           |                  |
 62 *           |    1 quadrant    |
 63 *           |                  |
 64 * 0b01......+------------------+
 65 *           |                  |
 66 *           |    0 quadrant    |
 67 *           |                  |
 68 * 0b00......+------------------+
 69 *
 70 *
 71 * 3rd quadrant expanded:
 72 * +------------------------------+
 73 * |                              |
 74 * |                              |
 75 * |                              |
 76 * +------------------------------+  Kernel IO map end (0xc010000000000000)
 77 * |                              |
 
 78 * |                              |
 79 * |      1/2 of virtual map      |
 80 * |                              |
 
 81 * |                              |
 82 * +------------------------------+  Kernel IO map start
 83 * |                              |
 84 * |      1/4 of virtual map      |
 85 * |                              |
 86 * +------------------------------+  Kernel vmemap start
 87 * |                              |
 88 * |     1/4 of virtual map       |
 89 * |                              |
 90 * +------------------------------+  Kernel virt start (0xc008000000000000)
 91 * |                              |
 92 * |                              |
 93 * |                              |
 94 * +------------------------------+  Kernel linear (0xc.....)
 95 */
 96
 97#define RADIX_KERN_VIRT_START ASM_CONST(0xc008000000000000)
 98#define RADIX_KERN_VIRT_SIZE  ASM_CONST(0x0008000000000000)
 99
100/*
101 * The vmalloc space starts at the beginning of that region, and
102 * occupies a quarter of it on radix config.
103 * (we keep a quarter for the virtual memmap)
104 */
 
 
105#define RADIX_VMALLOC_START	RADIX_KERN_VIRT_START
106#define RADIX_VMALLOC_SIZE	(RADIX_KERN_VIRT_SIZE >> 2)
107#define RADIX_VMALLOC_END	(RADIX_VMALLOC_START + RADIX_VMALLOC_SIZE)
108/*
109 * Defines the address of the vmemap area, in its own region on
110 * hash table CPUs.
111 */
112#define RADIX_VMEMMAP_BASE		(RADIX_VMALLOC_END)
113
114#define RADIX_KERN_IO_START	(RADIX_KERN_VIRT_START + (RADIX_KERN_VIRT_SIZE >> 1))
 
 
 
 
 
 
115
116#ifndef __ASSEMBLY__
117#define RADIX_PTE_TABLE_SIZE	(sizeof(pte_t) << RADIX_PTE_INDEX_SIZE)
118#define RADIX_PMD_TABLE_SIZE	(sizeof(pmd_t) << RADIX_PMD_INDEX_SIZE)
119#define RADIX_PUD_TABLE_SIZE	(sizeof(pud_t) << RADIX_PUD_INDEX_SIZE)
120#define RADIX_PGD_TABLE_SIZE	(sizeof(pgd_t) << RADIX_PGD_INDEX_SIZE)
121
122#ifdef CONFIG_STRICT_KERNEL_RWX
123extern void radix__mark_rodata_ro(void);
124extern void radix__mark_initmem_nx(void);
125#endif
126
 
 
 
 
 
 
 
 
127static inline unsigned long __radix_pte_update(pte_t *ptep, unsigned long clr,
128					       unsigned long set)
129{
130	pte_t pte;
131	unsigned long old_pte, new_pte;
132
133	do {
134		pte = READ_ONCE(*ptep);
135		old_pte = pte_val(pte);
136		new_pte = (old_pte | set) & ~clr;
137
138	} while (!pte_xchg(ptep, __pte(old_pte), __pte(new_pte)));
 
 
 
 
 
 
 
 
139
140	return old_pte;
141}
142
143
144static inline unsigned long radix__pte_update(struct mm_struct *mm,
145					unsigned long addr,
146					pte_t *ptep, unsigned long clr,
147					unsigned long set,
148					int huge)
149{
150	unsigned long old_pte;
151
152	if (cpu_has_feature(CPU_FTR_POWER9_DD1)) {
153
154		unsigned long new_pte;
155
156		old_pte = __radix_pte_update(ptep, ~0ul, 0);
157		/*
158		 * new value of pte
159		 */
160		new_pte = (old_pte | set) & ~clr;
161		radix__flush_tlb_pte_p9_dd1(old_pte, mm, addr);
162		if (new_pte)
163			__radix_pte_update(ptep, 0, new_pte);
164	} else
165		old_pte = __radix_pte_update(ptep, clr, set);
166	if (!huge)
167		assert_pte_locked(mm, addr);
168
169	return old_pte;
170}
171
172static inline pte_t radix__ptep_get_and_clear_full(struct mm_struct *mm,
173						   unsigned long addr,
174						   pte_t *ptep, int full)
175{
176	unsigned long old_pte;
177
178	if (full) {
179		/*
180		 * If we are trying to clear the pte, we can skip
181		 * the DD1 pte update sequence and batch the tlb flush. The
182		 * tlb flush batching is done by mmu gather code. We
183		 * still keep the cmp_xchg update to make sure we get
184		 * correct R/C bit which might be updated via Nest MMU.
185		 */
186		old_pte = __radix_pte_update(ptep, ~0ul, 0);
187	} else
188		old_pte = radix__pte_update(mm, addr, ptep, ~0ul, 0, 0);
189
190	return __pte(old_pte);
191}
192
193/*
194 * Set the dirty and/or accessed bits atomically in a linux PTE, this
195 * function doesn't need to invalidate tlb.
196 */
197static inline void radix__ptep_set_access_flags(struct mm_struct *mm,
198						pte_t *ptep, pte_t entry,
199						unsigned long address)
200{
201
202	unsigned long set = pte_val(entry) & (_PAGE_DIRTY | _PAGE_ACCESSED |
203					      _PAGE_RW | _PAGE_EXEC);
204
205	if (cpu_has_feature(CPU_FTR_POWER9_DD1)) {
206
207		unsigned long old_pte, new_pte;
208
209		old_pte = __radix_pte_update(ptep, ~0, 0);
210		/*
211		 * new value of pte
212		 */
213		new_pte = old_pte | set;
214		radix__flush_tlb_pte_p9_dd1(old_pte, mm, address);
215		__radix_pte_update(ptep, 0, new_pte);
216	} else
217		__radix_pte_update(ptep, 0, set);
218	asm volatile("ptesync" : : : "memory");
219}
220
221static inline int radix__pte_same(pte_t pte_a, pte_t pte_b)
222{
223	return ((pte_raw(pte_a) ^ pte_raw(pte_b)) == 0);
224}
225
226static inline int radix__pte_none(pte_t pte)
227{
228	return (pte_val(pte) & ~RADIX_PTE_NONE_MASK) == 0;
229}
230
231static inline void radix__set_pte_at(struct mm_struct *mm, unsigned long addr,
232				 pte_t *ptep, pte_t pte, int percpu)
233{
234	*ptep = pte;
235	asm volatile("ptesync" : : : "memory");
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
236}
237
238static inline int radix__pmd_bad(pmd_t pmd)
239{
240	return !!(pmd_val(pmd) & RADIX_PMD_BAD_BITS);
241}
242
243static inline int radix__pmd_same(pmd_t pmd_a, pmd_t pmd_b)
244{
245	return ((pmd_raw(pmd_a) ^ pmd_raw(pmd_b)) == 0);
246}
247
248static inline int radix__pud_bad(pud_t pud)
249{
250	return !!(pud_val(pud) & RADIX_PUD_BAD_BITS);
251}
252
253
254static inline int radix__pgd_bad(pgd_t pgd)
255{
256	return !!(pgd_val(pgd) & RADIX_PGD_BAD_BITS);
257}
258
259#ifdef CONFIG_TRANSPARENT_HUGEPAGE
260
261static inline int radix__pmd_trans_huge(pmd_t pmd)
262{
263	return (pmd_val(pmd) & (_PAGE_PTE | _PAGE_DEVMAP)) == _PAGE_PTE;
264}
265
266static inline pmd_t radix__pmd_mkhuge(pmd_t pmd)
267{
268	if (cpu_has_feature(CPU_FTR_POWER9_DD1))
269		return __pmd(pmd_val(pmd) | _PAGE_PTE | R_PAGE_LARGE);
270	return __pmd(pmd_val(pmd) | _PAGE_PTE);
271}
272
273extern unsigned long radix__pmd_hugepage_update(struct mm_struct *mm, unsigned long addr,
274					  pmd_t *pmdp, unsigned long clr,
275					  unsigned long set);
276extern pmd_t radix__pmdp_collapse_flush(struct vm_area_struct *vma,
277				  unsigned long address, pmd_t *pmdp);
278extern void radix__pgtable_trans_huge_deposit(struct mm_struct *mm, pmd_t *pmdp,
279					pgtable_t pgtable);
280extern pgtable_t radix__pgtable_trans_huge_withdraw(struct mm_struct *mm, pmd_t *pmdp);
281extern pmd_t radix__pmdp_huge_get_and_clear(struct mm_struct *mm,
282				      unsigned long addr, pmd_t *pmdp);
283extern int radix__has_transparent_hugepage(void);
 
 
 
 
 
 
284#endif
285
 
 
 
 
 
286extern int __meminit radix__vmemmap_create_mapping(unsigned long start,
287					     unsigned long page_size,
288					     unsigned long phys);
289extern void radix__vmemmap_remove_mapping(unsigned long start,
290				    unsigned long page_size);
291
292extern int radix__map_kernel_page(unsigned long ea, unsigned long pa,
293				 pgprot_t flags, unsigned int psz);
294
295static inline unsigned long radix__get_tree_size(void)
296{
297	unsigned long rts_field;
298	/*
299	 * We support 52 bits, hence:
300	 *  DD1    52-28 = 24, 0b11000
301	 *  Others 52-31 = 21, 0b10101
302	 * RTS encoding details
303	 * bits 0 - 3 of rts -> bits 6 - 8 unsigned long
304	 * bits 4 - 5 of rts -> bits 62 - 63 of unsigned long
305	 */
306	if (cpu_has_feature(CPU_FTR_POWER9_DD1))
307		rts_field = (0x3UL << 61);
308	else {
309		rts_field = (0x5UL << 5); /* 6 - 8 bits */
310		rts_field |= (0x2UL << 61);
311	}
312	return rts_field;
313}
314
315#ifdef CONFIG_MEMORY_HOTPLUG
316int radix__create_section_mapping(unsigned long start, unsigned long end, int nid);
 
317int radix__remove_section_mapping(unsigned long start, unsigned long end);
318#endif /* CONFIG_MEMORY_HOTPLUG */
319#endif /* __ASSEMBLY__ */
320#endif