1 #ifndef _ASM_POWERPC_PGALLOC_64_H
2 #define _ASM_POWERPC_PGALLOC_64_H
3 /*
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; either version
7  * 2 of the License, or (at your option) any later version.
8  */
9 
10 #include <linux/slab.h>
11 #include <linux/cpumask.h>
12 #include <linux/percpu.h>
13 
14 struct vmemmap_backing {
15 	struct vmemmap_backing *list;
16 	unsigned long phys;
17 	unsigned long virt_addr;
18 };
19 extern struct vmemmap_backing *vmemmap_list;
20 
21 /*
22  * Functions that deal with pagetables that could be at any level of
23  * the table need to be passed an "index_size" so they know how to
24  * handle allocation.  For PTE pages (which are linked to a struct
25  * page for now, and drawn from the main get_free_pages() pool), the
26  * allocation size will be (2^index_size * sizeof(pointer)) and
27  * allocations are drawn from the kmem_cache in PGT_CACHE(index_size).
28  *
29  * The maximum index size needs to be big enough to allow any
30  * pagetable sizes we need, but small enough to fit in the low bits of
31  * any page table pointer.  In other words all pagetables, even tiny
32  * ones, must be aligned to allow at least enough low 0 bits to
33  * contain this value.  This value is also used as a mask, so it must
34  * be one less than a power of two.
35  */
36 #define MAX_PGTABLE_INDEX_SIZE	0xf
37 
38 extern struct kmem_cache *pgtable_cache[];
39 #define PGT_CACHE(shift) ({				\
40 			BUG_ON(!(shift));		\
41 			pgtable_cache[(shift) - 1];	\
42 		})
43 
44 static inline pgd_t *pgd_alloc(struct mm_struct *mm)
45 {
46 	return kmem_cache_alloc(PGT_CACHE(PGD_INDEX_SIZE),
47 			pgtable_gfp_flags(mm, GFP_KERNEL));
48 }
49 
50 static inline void pgd_free(struct mm_struct *mm, pgd_t *pgd)
51 {
52 	kmem_cache_free(PGT_CACHE(PGD_INDEX_SIZE), pgd);
53 }
54 
55 #define pgd_populate(MM, PGD, PUD)	pgd_set(PGD, (unsigned long)PUD)
56 
57 static inline pud_t *pud_alloc_one(struct mm_struct *mm, unsigned long addr)
58 {
59 	return kmem_cache_alloc(PGT_CACHE(PUD_INDEX_SIZE),
60 			pgtable_gfp_flags(mm, GFP_KERNEL));
61 }
62 
63 static inline void pud_free(struct mm_struct *mm, pud_t *pud)
64 {
65 	kmem_cache_free(PGT_CACHE(PUD_INDEX_SIZE), pud);
66 }
67 
68 static inline void pud_populate(struct mm_struct *mm, pud_t *pud, pmd_t *pmd)
69 {
70 	pud_set(pud, (unsigned long)pmd);
71 }
72 
73 static inline void pmd_populate_kernel(struct mm_struct *mm, pmd_t *pmd,
74 				       pte_t *pte)
75 {
76 	pmd_set(pmd, (unsigned long)pte);
77 }
78 
79 static inline void pmd_populate(struct mm_struct *mm, pmd_t *pmd,
80 				pgtable_t pte_page)
81 {
82 	pmd_set(pmd, (unsigned long)page_address(pte_page));
83 }
84 
85 #define pmd_pgtable(pmd) pmd_page(pmd)
86 
87 static inline pmd_t *pmd_alloc_one(struct mm_struct *mm, unsigned long addr)
88 {
89 	return kmem_cache_alloc(PGT_CACHE(PMD_CACHE_INDEX),
90 			pgtable_gfp_flags(mm, GFP_KERNEL));
91 }
92 
93 static inline void pmd_free(struct mm_struct *mm, pmd_t *pmd)
94 {
95 	kmem_cache_free(PGT_CACHE(PMD_CACHE_INDEX), pmd);
96 }
97 
98 
99 static inline pte_t *pte_alloc_one_kernel(struct mm_struct *mm,
100 					  unsigned long address)
101 {
102 	return (pte_t *)__get_free_page(GFP_KERNEL | __GFP_ZERO);
103 }
104 
105 static inline pgtable_t pte_alloc_one(struct mm_struct *mm,
106 				      unsigned long address)
107 {
108 	struct page *page;
109 	pte_t *pte;
110 
111 	pte = (pte_t *)__get_free_page(GFP_KERNEL | __GFP_ZERO | __GFP_ACCOUNT);
112 	if (!pte)
113 		return NULL;
114 	page = virt_to_page(pte);
115 	if (!pgtable_page_ctor(page)) {
116 		__free_page(page);
117 		return NULL;
118 	}
119 	return page;
120 }
121 
122 static inline void pte_free_kernel(struct mm_struct *mm, pte_t *pte)
123 {
124 	free_page((unsigned long)pte);
125 }
126 
127 static inline void pte_free(struct mm_struct *mm, pgtable_t ptepage)
128 {
129 	pgtable_page_dtor(ptepage);
130 	__free_page(ptepage);
131 }
132 
133 static inline void pgtable_free(void *table, int shift)
134 {
135 	if (!shift) {
136 		pgtable_page_dtor(virt_to_page(table));
137 		free_page((unsigned long)table);
138 	} else {
139 		BUG_ON(shift > MAX_PGTABLE_INDEX_SIZE);
140 		kmem_cache_free(PGT_CACHE(shift), table);
141 	}
142 }
143 
144 #define get_hugepd_cache_index(x)	(x)
145 #ifdef CONFIG_SMP
146 static inline void pgtable_free_tlb(struct mmu_gather *tlb, void *table, int shift)
147 {
148 	unsigned long pgf = (unsigned long)table;
149 
150 	BUG_ON(shift > MAX_PGTABLE_INDEX_SIZE);
151 	pgf |= shift;
152 	tlb_remove_table(tlb, (void *)pgf);
153 }
154 
155 static inline void __tlb_remove_table(void *_table)
156 {
157 	void *table = (void *)((unsigned long)_table & ~MAX_PGTABLE_INDEX_SIZE);
158 	unsigned shift = (unsigned long)_table & MAX_PGTABLE_INDEX_SIZE;
159 
160 	pgtable_free(table, shift);
161 }
162 
163 #else
164 static inline void pgtable_free_tlb(struct mmu_gather *tlb, void *table, int shift)
165 {
166 	pgtable_free(table, shift);
167 }
168 #endif
169 
170 static inline void __pte_free_tlb(struct mmu_gather *tlb, pgtable_t table,
171 				  unsigned long address)
172 {
173 	tlb_flush_pgtable(tlb, address);
174 	pgtable_free_tlb(tlb, page_address(table), 0);
175 }
176 
177 #define __pmd_free_tlb(tlb, pmd, addr)		      \
178 	pgtable_free_tlb(tlb, pmd, PMD_CACHE_INDEX)
179 #ifndef CONFIG_PPC_64K_PAGES
180 #define __pud_free_tlb(tlb, pud, addr)		      \
181 	pgtable_free_tlb(tlb, pud, PUD_INDEX_SIZE)
182 
183 #endif /* CONFIG_PPC_64K_PAGES */
184 
185 #define check_pgt_cache()	do { } while (0)
186 
187 #endif /* _ASM_POWERPC_PGALLOC_64_H */
188