Commit | Line | Data |
---|---|---|
75a9b8a6 AK |
1 | #ifndef _ASM_POWERPC_BOOK3S_64_PGALLOC_H |
2 | #define _ASM_POWERPC_BOOK3S_64_PGALLOC_H | |
101ad5c6 AK |
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 | ||
934828ed AK |
44 | extern pte_t *pte_fragment_alloc(struct mm_struct *, unsigned long, int); |
45 | extern void pte_fragment_free(unsigned long *, int); | |
46 | extern void pgtable_free_tlb(struct mmu_gather *tlb, void *table, int shift); | |
47 | #ifdef CONFIG_SMP | |
48 | extern void __tlb_remove_table(void *_table); | |
49 | #endif | |
50 | ||
a2f41eb9 AK |
51 | static inline pgd_t *radix__pgd_alloc(struct mm_struct *mm) |
52 | { | |
53 | #ifdef CONFIG_PPC_64K_PAGES | |
de3b8761 | 54 | return (pgd_t *)__get_free_page(pgtable_gfp_flags(mm, PGALLOC_GFP)); |
a2f41eb9 AK |
55 | #else |
56 | struct page *page; | |
dcda9b04 | 57 | page = alloc_pages(pgtable_gfp_flags(mm, PGALLOC_GFP | __GFP_RETRY_MAYFAIL), |
de3b8761 | 58 | 4); |
a2f41eb9 AK |
59 | if (!page) |
60 | return NULL; | |
61 | return (pgd_t *) page_address(page); | |
62 | #endif | |
63 | } | |
64 | ||
65 | static inline void radix__pgd_free(struct mm_struct *mm, pgd_t *pgd) | |
66 | { | |
67 | #ifdef CONFIG_PPC_64K_PAGES | |
68 | free_page((unsigned long)pgd); | |
69 | #else | |
70 | free_pages((unsigned long)pgd, 4); | |
71 | #endif | |
72 | } | |
73 | ||
101ad5c6 AK |
74 | static inline pgd_t *pgd_alloc(struct mm_struct *mm) |
75 | { | |
fc5c2f4a AK |
76 | pgd_t *pgd; |
77 | ||
a2f41eb9 AK |
78 | if (radix_enabled()) |
79 | return radix__pgd_alloc(mm); | |
fc5c2f4a AK |
80 | |
81 | pgd = kmem_cache_alloc(PGT_CACHE(PGD_INDEX_SIZE), | |
82 | pgtable_gfp_flags(mm, GFP_KERNEL)); | |
83 | memset(pgd, 0, PGD_TABLE_SIZE); | |
84 | ||
85 | return pgd; | |
101ad5c6 AK |
86 | } |
87 | ||
88 | static inline void pgd_free(struct mm_struct *mm, pgd_t *pgd) | |
89 | { | |
a2f41eb9 AK |
90 | if (radix_enabled()) |
91 | return radix__pgd_free(mm, pgd); | |
101ad5c6 AK |
92 | kmem_cache_free(PGT_CACHE(PGD_INDEX_SIZE), pgd); |
93 | } | |
94 | ||
75a9b8a6 AK |
95 | static inline void pgd_populate(struct mm_struct *mm, pgd_t *pgd, pud_t *pud) |
96 | { | |
a2f41eb9 | 97 | pgd_set(pgd, __pgtable_ptr_val(pud) | PGD_VAL_BITS); |
75a9b8a6 | 98 | } |
101ad5c6 AK |
99 | |
100 | static inline pud_t *pud_alloc_one(struct mm_struct *mm, unsigned long addr) | |
101 | { | |
fae22116 | 102 | return kmem_cache_alloc(PGT_CACHE(PUD_CACHE_INDEX), |
de3b8761 | 103 | pgtable_gfp_flags(mm, GFP_KERNEL)); |
101ad5c6 AK |
104 | } |
105 | ||
106 | static inline void pud_free(struct mm_struct *mm, pud_t *pud) | |
107 | { | |
fae22116 | 108 | kmem_cache_free(PGT_CACHE(PUD_CACHE_INDEX), pud); |
101ad5c6 AK |
109 | } |
110 | ||
111 | static inline void pud_populate(struct mm_struct *mm, pud_t *pud, pmd_t *pmd) | |
112 | { | |
a2f41eb9 | 113 | pud_set(pud, __pgtable_ptr_val(pmd) | PUD_VAL_BITS); |
101ad5c6 AK |
114 | } |
115 | ||
934828ed AK |
116 | static inline void __pud_free_tlb(struct mmu_gather *tlb, pud_t *pud, |
117 | unsigned long address) | |
118 | { | |
a145abf1 AK |
119 | /* |
120 | * By now all the pud entries should be none entries. So go | |
121 | * ahead and flush the page walk cache | |
122 | */ | |
123 | flush_tlb_pgtable(tlb, address); | |
fae22116 | 124 | pgtable_free_tlb(tlb, pud, PUD_CACHE_INDEX); |
934828ed AK |
125 | } |
126 | ||
127 | static inline pmd_t *pmd_alloc_one(struct mm_struct *mm, unsigned long addr) | |
128 | { | |
de3b8761 BS |
129 | return kmem_cache_alloc(PGT_CACHE(PMD_CACHE_INDEX), |
130 | pgtable_gfp_flags(mm, GFP_KERNEL)); | |
934828ed AK |
131 | } |
132 | ||
133 | static inline void pmd_free(struct mm_struct *mm, pmd_t *pmd) | |
134 | { | |
135 | kmem_cache_free(PGT_CACHE(PMD_CACHE_INDEX), pmd); | |
136 | } | |
137 | ||
138 | static inline void __pmd_free_tlb(struct mmu_gather *tlb, pmd_t *pmd, | |
139 | unsigned long address) | |
140 | { | |
a145abf1 AK |
141 | /* |
142 | * By now all the pud entries should be none entries. So go | |
143 | * ahead and flush the page walk cache | |
144 | */ | |
145 | flush_tlb_pgtable(tlb, address); | |
934828ed AK |
146 | return pgtable_free_tlb(tlb, pmd, PMD_CACHE_INDEX); |
147 | } | |
148 | ||
101ad5c6 AK |
149 | static inline void pmd_populate_kernel(struct mm_struct *mm, pmd_t *pmd, |
150 | pte_t *pte) | |
151 | { | |
a2f41eb9 | 152 | pmd_set(pmd, __pgtable_ptr_val(pte) | PMD_VAL_BITS); |
101ad5c6 | 153 | } |
934828ed | 154 | |
101ad5c6 AK |
155 | static inline void pmd_populate(struct mm_struct *mm, pmd_t *pmd, |
156 | pgtable_t pte_page) | |
157 | { | |
a2f41eb9 | 158 | pmd_set(pmd, __pgtable_ptr_val(pte_page) | PMD_VAL_BITS); |
101ad5c6 AK |
159 | } |
160 | ||
75a9b8a6 AK |
161 | static inline pgtable_t pmd_pgtable(pmd_t pmd) |
162 | { | |
934828ed | 163 | return (pgtable_t)pmd_page_vaddr(pmd); |
75a9b8a6 | 164 | } |
101ad5c6 | 165 | |
934828ed | 166 | #ifdef CONFIG_PPC_4K_PAGES |
101ad5c6 AK |
167 | static inline pte_t *pte_alloc_one_kernel(struct mm_struct *mm, |
168 | unsigned long address) | |
169 | { | |
32d6bd90 | 170 | return (pte_t *)__get_free_page(GFP_KERNEL | __GFP_ZERO); |
101ad5c6 AK |
171 | } |
172 | ||
173 | static inline pgtable_t pte_alloc_one(struct mm_struct *mm, | |
174 | unsigned long address) | |
175 | { | |
176 | struct page *page; | |
177 | pte_t *pte; | |
178 | ||
de3b8761 | 179 | pte = (pte_t *)__get_free_page(GFP_KERNEL | __GFP_ZERO | __GFP_ACCOUNT); |
101ad5c6 AK |
180 | if (!pte) |
181 | return NULL; | |
182 | page = virt_to_page(pte); | |
183 | if (!pgtable_page_ctor(page)) { | |
184 | __free_page(page); | |
185 | return NULL; | |
186 | } | |
934828ed | 187 | return pte; |
101ad5c6 | 188 | } |
101ad5c6 AK |
189 | #else /* if CONFIG_PPC_64K_PAGES */ |
190 | ||
101ad5c6 AK |
191 | static inline pte_t *pte_alloc_one_kernel(struct mm_struct *mm, |
192 | unsigned long address) | |
193 | { | |
74701d59 | 194 | return (pte_t *)pte_fragment_alloc(mm, address, 1); |
101ad5c6 AK |
195 | } |
196 | ||
197 | static inline pgtable_t pte_alloc_one(struct mm_struct *mm, | |
934828ed | 198 | unsigned long address) |
101ad5c6 | 199 | { |
74701d59 | 200 | return (pgtable_t)pte_fragment_alloc(mm, address, 0); |
101ad5c6 | 201 | } |
934828ed | 202 | #endif |
101ad5c6 AK |
203 | |
204 | static inline void pte_free_kernel(struct mm_struct *mm, pte_t *pte) | |
205 | { | |
74701d59 | 206 | pte_fragment_free((unsigned long *)pte, 1); |
101ad5c6 AK |
207 | } |
208 | ||
209 | static inline void pte_free(struct mm_struct *mm, pgtable_t ptepage) | |
210 | { | |
74701d59 | 211 | pte_fragment_free((unsigned long *)ptepage, 0); |
101ad5c6 AK |
212 | } |
213 | ||
214 | static inline void __pte_free_tlb(struct mmu_gather *tlb, pgtable_t table, | |
215 | unsigned long address) | |
216 | { | |
a145abf1 AK |
217 | /* |
218 | * By now all the pud entries should be none entries. So go | |
219 | * ahead and flush the page walk cache | |
220 | */ | |
221 | flush_tlb_pgtable(tlb, address); | |
101ad5c6 AK |
222 | pgtable_free_tlb(tlb, table, 0); |
223 | } | |
101ad5c6 AK |
224 | |
225 | #define check_pgt_cache() do { } while (0) | |
226 | ||
75a9b8a6 | 227 | #endif /* _ASM_POWERPC_BOOK3S_64_PGALLOC_H */ |