powerpc/mm: Fix crashes with 16G huge pages
[linux-2.6-block.git] / arch / powerpc / include / asm / book3s / 64 / pgalloc.h
CommitLineData
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
14struct vmemmap_backing {
15 struct vmemmap_backing *list;
16 unsigned long phys;
17 unsigned long virt_addr;
18};
19extern 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
38extern struct kmem_cache *pgtable_cache[];
39#define PGT_CACHE(shift) ({ \
40 BUG_ON(!(shift)); \
41 pgtable_cache[(shift) - 1]; \
42 })
43
934828ed
AK
44extern pte_t *pte_fragment_alloc(struct mm_struct *, unsigned long, int);
45extern void pte_fragment_free(unsigned long *, int);
46extern void pgtable_free_tlb(struct mmu_gather *tlb, void *table, int shift);
47#ifdef CONFIG_SMP
48extern void __tlb_remove_table(void *_table);
49#endif
50
a2f41eb9
AK
51static 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
65static 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
74static inline pgd_t *pgd_alloc(struct mm_struct *mm)
75{
a2f41eb9
AK
76 if (radix_enabled())
77 return radix__pgd_alloc(mm);
de3b8761
BS
78 return kmem_cache_alloc(PGT_CACHE(PGD_INDEX_SIZE),
79 pgtable_gfp_flags(mm, GFP_KERNEL));
101ad5c6
AK
80}
81
82static inline void pgd_free(struct mm_struct *mm, pgd_t *pgd)
83{
a2f41eb9
AK
84 if (radix_enabled())
85 return radix__pgd_free(mm, pgd);
101ad5c6
AK
86 kmem_cache_free(PGT_CACHE(PGD_INDEX_SIZE), pgd);
87}
88
75a9b8a6
AK
89static inline void pgd_populate(struct mm_struct *mm, pgd_t *pgd, pud_t *pud)
90{
a2f41eb9 91 pgd_set(pgd, __pgtable_ptr_val(pud) | PGD_VAL_BITS);
75a9b8a6 92}
101ad5c6
AK
93
94static inline pud_t *pud_alloc_one(struct mm_struct *mm, unsigned long addr)
95{
fae22116 96 return kmem_cache_alloc(PGT_CACHE(PUD_CACHE_INDEX),
de3b8761 97 pgtable_gfp_flags(mm, GFP_KERNEL));
101ad5c6
AK
98}
99
100static inline void pud_free(struct mm_struct *mm, pud_t *pud)
101{
fae22116 102 kmem_cache_free(PGT_CACHE(PUD_CACHE_INDEX), pud);
101ad5c6
AK
103}
104
105static inline void pud_populate(struct mm_struct *mm, pud_t *pud, pmd_t *pmd)
106{
a2f41eb9 107 pud_set(pud, __pgtable_ptr_val(pmd) | PUD_VAL_BITS);
101ad5c6
AK
108}
109
934828ed
AK
110static inline void __pud_free_tlb(struct mmu_gather *tlb, pud_t *pud,
111 unsigned long address)
112{
a145abf1
AK
113 /*
114 * By now all the pud entries should be none entries. So go
115 * ahead and flush the page walk cache
116 */
117 flush_tlb_pgtable(tlb, address);
fae22116 118 pgtable_free_tlb(tlb, pud, PUD_CACHE_INDEX);
934828ed
AK
119}
120
121static inline pmd_t *pmd_alloc_one(struct mm_struct *mm, unsigned long addr)
122{
de3b8761
BS
123 return kmem_cache_alloc(PGT_CACHE(PMD_CACHE_INDEX),
124 pgtable_gfp_flags(mm, GFP_KERNEL));
934828ed
AK
125}
126
127static inline void pmd_free(struct mm_struct *mm, pmd_t *pmd)
128{
129 kmem_cache_free(PGT_CACHE(PMD_CACHE_INDEX), pmd);
130}
131
132static inline void __pmd_free_tlb(struct mmu_gather *tlb, pmd_t *pmd,
133 unsigned long address)
134{
a145abf1
AK
135 /*
136 * By now all the pud entries should be none entries. So go
137 * ahead and flush the page walk cache
138 */
139 flush_tlb_pgtable(tlb, address);
934828ed
AK
140 return pgtable_free_tlb(tlb, pmd, PMD_CACHE_INDEX);
141}
142
101ad5c6
AK
143static inline void pmd_populate_kernel(struct mm_struct *mm, pmd_t *pmd,
144 pte_t *pte)
145{
a2f41eb9 146 pmd_set(pmd, __pgtable_ptr_val(pte) | PMD_VAL_BITS);
101ad5c6 147}
934828ed 148
101ad5c6
AK
149static inline void pmd_populate(struct mm_struct *mm, pmd_t *pmd,
150 pgtable_t pte_page)
151{
a2f41eb9 152 pmd_set(pmd, __pgtable_ptr_val(pte_page) | PMD_VAL_BITS);
101ad5c6
AK
153}
154
75a9b8a6
AK
155static inline pgtable_t pmd_pgtable(pmd_t pmd)
156{
934828ed 157 return (pgtable_t)pmd_page_vaddr(pmd);
75a9b8a6 158}
101ad5c6 159
934828ed 160#ifdef CONFIG_PPC_4K_PAGES
101ad5c6
AK
161static inline pte_t *pte_alloc_one_kernel(struct mm_struct *mm,
162 unsigned long address)
163{
32d6bd90 164 return (pte_t *)__get_free_page(GFP_KERNEL | __GFP_ZERO);
101ad5c6
AK
165}
166
167static inline pgtable_t pte_alloc_one(struct mm_struct *mm,
168 unsigned long address)
169{
170 struct page *page;
171 pte_t *pte;
172
de3b8761 173 pte = (pte_t *)__get_free_page(GFP_KERNEL | __GFP_ZERO | __GFP_ACCOUNT);
101ad5c6
AK
174 if (!pte)
175 return NULL;
176 page = virt_to_page(pte);
177 if (!pgtable_page_ctor(page)) {
178 __free_page(page);
179 return NULL;
180 }
934828ed 181 return pte;
101ad5c6 182}
101ad5c6
AK
183#else /* if CONFIG_PPC_64K_PAGES */
184
101ad5c6
AK
185static inline pte_t *pte_alloc_one_kernel(struct mm_struct *mm,
186 unsigned long address)
187{
74701d59 188 return (pte_t *)pte_fragment_alloc(mm, address, 1);
101ad5c6
AK
189}
190
191static inline pgtable_t pte_alloc_one(struct mm_struct *mm,
934828ed 192 unsigned long address)
101ad5c6 193{
74701d59 194 return (pgtable_t)pte_fragment_alloc(mm, address, 0);
101ad5c6 195}
934828ed 196#endif
101ad5c6
AK
197
198static inline void pte_free_kernel(struct mm_struct *mm, pte_t *pte)
199{
74701d59 200 pte_fragment_free((unsigned long *)pte, 1);
101ad5c6
AK
201}
202
203static inline void pte_free(struct mm_struct *mm, pgtable_t ptepage)
204{
74701d59 205 pte_fragment_free((unsigned long *)ptepage, 0);
101ad5c6
AK
206}
207
208static inline void __pte_free_tlb(struct mmu_gather *tlb, pgtable_t table,
209 unsigned long address)
210{
a145abf1
AK
211 /*
212 * By now all the pud entries should be none entries. So go
213 * ahead and flush the page walk cache
214 */
215 flush_tlb_pgtable(tlb, address);
101ad5c6
AK
216 pgtable_free_tlb(tlb, table, 0);
217}
101ad5c6
AK
218
219#define check_pgt_cache() do { } while (0)
220
75a9b8a6 221#endif /* _ASM_POWERPC_BOOK3S_64_PGALLOC_H */