blob: e58707deef5c2f90530d088dbc786417d191af04 [file] [log] [blame]
Aneesh Kumar K.V2bfd65e2016-04-29 23:25:58 +10001/*
2 * Page table handling routines for radix page table.
3 *
4 * Copyright 2015-2016, Aneesh Kumar K.V, IBM Corporation.
5 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version
9 * 2 of the License, or (at your option) any later version.
10 */
11#include <linux/sched.h>
12#include <linux/memblock.h>
13#include <linux/of_fdt.h>
14
15#include <asm/pgtable.h>
16#include <asm/pgalloc.h>
17#include <asm/dma.h>
18#include <asm/machdep.h>
19#include <asm/mmu.h>
20#include <asm/firmware.h>
21
Aneesh Kumar K.Vbde3eb62016-04-29 23:26:30 +100022#include <trace/events/thp.h>
23
Aneesh Kumar K.V2bfd65e2016-04-29 23:25:58 +100024static int native_update_partition_table(u64 patb1)
25{
26 partition_tb->patb1 = cpu_to_be64(patb1);
27 return 0;
28}
29
30static __ref void *early_alloc_pgtable(unsigned long size)
31{
32 void *pt;
33
34 pt = __va(memblock_alloc_base(size, size, MEMBLOCK_ALLOC_ANYWHERE));
35 memset(pt, 0, size);
36
37 return pt;
38}
39
40int radix__map_kernel_page(unsigned long ea, unsigned long pa,
41 pgprot_t flags,
42 unsigned int map_page_size)
43{
44 pgd_t *pgdp;
45 pud_t *pudp;
46 pmd_t *pmdp;
47 pte_t *ptep;
48 /*
49 * Make sure task size is correct as per the max adddr
50 */
51 BUILD_BUG_ON(TASK_SIZE_USER64 > RADIX_PGTABLE_RANGE);
52 if (slab_is_available()) {
53 pgdp = pgd_offset_k(ea);
54 pudp = pud_alloc(&init_mm, pgdp, ea);
55 if (!pudp)
56 return -ENOMEM;
57 if (map_page_size == PUD_SIZE) {
58 ptep = (pte_t *)pudp;
59 goto set_the_pte;
60 }
61 pmdp = pmd_alloc(&init_mm, pudp, ea);
62 if (!pmdp)
63 return -ENOMEM;
64 if (map_page_size == PMD_SIZE) {
65 ptep = (pte_t *)pudp;
66 goto set_the_pte;
67 }
68 ptep = pte_alloc_kernel(pmdp, ea);
69 if (!ptep)
70 return -ENOMEM;
71 } else {
72 pgdp = pgd_offset_k(ea);
73 if (pgd_none(*pgdp)) {
74 pudp = early_alloc_pgtable(PUD_TABLE_SIZE);
75 BUG_ON(pudp == NULL);
76 pgd_populate(&init_mm, pgdp, pudp);
77 }
78 pudp = pud_offset(pgdp, ea);
79 if (map_page_size == PUD_SIZE) {
80 ptep = (pte_t *)pudp;
81 goto set_the_pte;
82 }
83 if (pud_none(*pudp)) {
84 pmdp = early_alloc_pgtable(PMD_TABLE_SIZE);
85 BUG_ON(pmdp == NULL);
86 pud_populate(&init_mm, pudp, pmdp);
87 }
88 pmdp = pmd_offset(pudp, ea);
89 if (map_page_size == PMD_SIZE) {
90 ptep = (pte_t *)pudp;
91 goto set_the_pte;
92 }
93 if (!pmd_present(*pmdp)) {
94 ptep = early_alloc_pgtable(PAGE_SIZE);
95 BUG_ON(ptep == NULL);
96 pmd_populate_kernel(&init_mm, pmdp, ptep);
97 }
98 ptep = pte_offset_kernel(pmdp, ea);
99 }
100
101set_the_pte:
102 set_pte_at(&init_mm, ea, ptep, pfn_pte(pa >> PAGE_SHIFT, flags));
103 smp_wmb();
104 return 0;
105}
106
107static void __init radix_init_pgtable(void)
108{
109 int loop_count;
110 u64 base, end, start_addr;
111 unsigned long rts_field;
112 struct memblock_region *reg;
113 unsigned long linear_page_size;
114
115 /* We don't support slb for radix */
116 mmu_slb_size = 0;
117 /*
118 * Create the linear mapping, using standard page size for now
119 */
120 loop_count = 0;
121 for_each_memblock(memory, reg) {
122
123 start_addr = reg->base;
124
125redo:
126 if (loop_count < 1 && mmu_psize_defs[MMU_PAGE_1G].shift)
127 linear_page_size = PUD_SIZE;
128 else if (loop_count < 2 && mmu_psize_defs[MMU_PAGE_2M].shift)
129 linear_page_size = PMD_SIZE;
130 else
131 linear_page_size = PAGE_SIZE;
132
133 base = _ALIGN_UP(start_addr, linear_page_size);
134 end = _ALIGN_DOWN(reg->base + reg->size, linear_page_size);
135
136 pr_info("Mapping range 0x%lx - 0x%lx with 0x%lx\n",
137 (unsigned long)base, (unsigned long)end,
138 linear_page_size);
139
140 while (base < end) {
141 radix__map_kernel_page((unsigned long)__va(base),
142 base, PAGE_KERNEL_X,
143 linear_page_size);
144 base += linear_page_size;
145 }
146 /*
147 * map the rest using lower page size
148 */
149 if (end < reg->base + reg->size) {
150 start_addr = end;
151 loop_count++;
152 goto redo;
153 }
154 }
155 /*
156 * Allocate Partition table and process table for the
157 * host.
158 */
159 BUILD_BUG_ON_MSG((PRTB_SIZE_SHIFT > 23), "Process table size too large.");
160 process_tb = early_alloc_pgtable(1UL << PRTB_SIZE_SHIFT);
161 /*
162 * Fill in the process table.
Aneesh Kumar K.V2bfd65e2016-04-29 23:25:58 +1000163 */
Aneesh Kumar K.Vb23d9c52016-06-17 11:40:36 +0530164 rts_field = radix__get_tree_size();
Aneesh Kumar K.V2bfd65e2016-04-29 23:25:58 +1000165 process_tb->prtb0 = cpu_to_be64(rts_field | __pa(init_mm.pgd) | RADIX_PGD_INDEX_SIZE);
166 /*
167 * Fill in the partition table. We are suppose to use effective address
168 * of process table here. But our linear mapping also enable us to use
169 * physical address here.
170 */
171 ppc_md.update_partition_table(__pa(process_tb) | (PRTB_SIZE_SHIFT - 12) | PATB_GR);
172 pr_info("Process table %p and radix root for kernel: %p\n", process_tb, init_mm.pgd);
173}
174
175static void __init radix_init_partition_table(void)
176{
177 unsigned long rts_field;
Aneesh Kumar K.Vb23d9c52016-06-17 11:40:36 +0530178
179 rts_field = radix__get_tree_size();
Aneesh Kumar K.V2bfd65e2016-04-29 23:25:58 +1000180
181 BUILD_BUG_ON_MSG((PATB_SIZE_SHIFT > 24), "Partition table size too large.");
182 partition_tb = early_alloc_pgtable(1UL << PATB_SIZE_SHIFT);
183 partition_tb->patb0 = cpu_to_be64(rts_field | __pa(init_mm.pgd) |
184 RADIX_PGD_INDEX_SIZE | PATB_HR);
185 printk("Partition table %p\n", partition_tb);
186
187 memblock_set_current_limit(MEMBLOCK_ALLOC_ANYWHERE);
188 /*
189 * update partition table control register,
190 * 64 K size.
191 */
192 mtspr(SPRN_PTCR, __pa(partition_tb) | (PATB_SIZE_SHIFT - 12));
193}
194
195void __init radix_init_native(void)
196{
197 ppc_md.update_partition_table = native_update_partition_table;
198}
199
200static int __init get_idx_from_shift(unsigned int shift)
201{
202 int idx = -1;
203
204 switch (shift) {
205 case 0xc:
206 idx = MMU_PAGE_4K;
207 break;
208 case 0x10:
209 idx = MMU_PAGE_64K;
210 break;
211 case 0x15:
212 idx = MMU_PAGE_2M;
213 break;
214 case 0x1e:
215 idx = MMU_PAGE_1G;
216 break;
217 }
218 return idx;
219}
220
221static int __init radix_dt_scan_page_sizes(unsigned long node,
222 const char *uname, int depth,
223 void *data)
224{
225 int size = 0;
226 int shift, idx;
227 unsigned int ap;
228 const __be32 *prop;
229 const char *type = of_get_flat_dt_prop(node, "device_type", NULL);
230
231 /* We are scanning "cpu" nodes only */
232 if (type == NULL || strcmp(type, "cpu") != 0)
233 return 0;
234
235 prop = of_get_flat_dt_prop(node, "ibm,processor-radix-AP-encodings", &size);
236 if (!prop)
237 return 0;
238
239 pr_info("Page sizes from device-tree:\n");
240 for (; size >= 4; size -= 4, ++prop) {
241
242 struct mmu_psize_def *def;
243
244 /* top 3 bit is AP encoding */
245 shift = be32_to_cpu(prop[0]) & ~(0xe << 28);
246 ap = be32_to_cpu(prop[0]) >> 29;
247 pr_info("Page size sift = %d AP=0x%x\n", shift, ap);
248
249 idx = get_idx_from_shift(shift);
250 if (idx < 0)
251 continue;
252
253 def = &mmu_psize_defs[idx];
254 def->shift = shift;
255 def->ap = ap;
256 }
257
258 /* needed ? */
259 cur_cpu_spec->mmu_features &= ~MMU_FTR_NO_SLBIE_B;
260 return 1;
261}
262
263static void __init radix_init_page_sizes(void)
264{
265 int rc;
266
267 /*
268 * Try to find the available page sizes in the device-tree
269 */
270 rc = of_scan_flat_dt(radix_dt_scan_page_sizes, NULL);
271 if (rc != 0) /* Found */
272 goto found;
273 /*
274 * let's assume we have page 4k and 64k support
275 */
276 mmu_psize_defs[MMU_PAGE_4K].shift = 12;
277 mmu_psize_defs[MMU_PAGE_4K].ap = 0x0;
278
279 mmu_psize_defs[MMU_PAGE_64K].shift = 16;
280 mmu_psize_defs[MMU_PAGE_64K].ap = 0x5;
281found:
282#ifdef CONFIG_SPARSEMEM_VMEMMAP
283 if (mmu_psize_defs[MMU_PAGE_2M].shift) {
284 /*
285 * map vmemmap using 2M if available
286 */
287 mmu_vmemmap_psize = MMU_PAGE_2M;
288 }
289#endif /* CONFIG_SPARSEMEM_VMEMMAP */
290 return;
291}
292
293void __init radix__early_init_mmu(void)
294{
295 unsigned long lpcr;
Aneesh Kumar K.V2bfd65e2016-04-29 23:25:58 +1000296
297#ifdef CONFIG_PPC_64K_PAGES
298 /* PAGE_SIZE mappings */
299 mmu_virtual_psize = MMU_PAGE_64K;
300#else
301 mmu_virtual_psize = MMU_PAGE_4K;
302#endif
303
304#ifdef CONFIG_SPARSEMEM_VMEMMAP
305 /* vmemmap mapping */
306 mmu_vmemmap_psize = mmu_virtual_psize;
307#endif
308 /*
309 * initialize page table size
310 */
311 __pte_index_size = RADIX_PTE_INDEX_SIZE;
312 __pmd_index_size = RADIX_PMD_INDEX_SIZE;
313 __pud_index_size = RADIX_PUD_INDEX_SIZE;
314 __pgd_index_size = RADIX_PGD_INDEX_SIZE;
315 __pmd_cache_index = RADIX_PMD_INDEX_SIZE;
316 __pte_table_size = RADIX_PTE_TABLE_SIZE;
317 __pmd_table_size = RADIX_PMD_TABLE_SIZE;
318 __pud_table_size = RADIX_PUD_TABLE_SIZE;
319 __pgd_table_size = RADIX_PGD_TABLE_SIZE;
320
Aneesh Kumar K.Va2f41eb2016-04-29 23:26:19 +1000321 __pmd_val_bits = RADIX_PMD_VAL_BITS;
322 __pud_val_bits = RADIX_PUD_VAL_BITS;
323 __pgd_val_bits = RADIX_PGD_VAL_BITS;
Aneesh Kumar K.V2bfd65e2016-04-29 23:25:58 +1000324
Aneesh Kumar K.Vd6a99962016-04-29 23:26:21 +1000325 __kernel_virt_start = RADIX_KERN_VIRT_START;
326 __kernel_virt_size = RADIX_KERN_VIRT_SIZE;
327 __vmalloc_start = RADIX_VMALLOC_START;
328 __vmalloc_end = RADIX_VMALLOC_END;
329 vmemmap = (struct page *)RADIX_VMEMMAP_BASE;
330 ioremap_bot = IOREMAP_BASE;
Aneesh Kumar K.V5ed7ecd2016-04-29 23:26:23 +1000331 /*
332 * For now radix also use the same frag size
333 */
334 __pte_frag_nr = H_PTE_FRAG_NR;
335 __pte_frag_size_shift = H_PTE_FRAG_SIZE_SHIFT;
Aneesh Kumar K.Vd6a99962016-04-29 23:26:21 +1000336
Aneesh Kumar K.Va2f41eb2016-04-29 23:26:19 +1000337 radix_init_page_sizes();
Aneesh Kumar K.Vd6c88602016-05-31 11:56:29 +0530338 if (!firmware_has_feature(FW_FEATURE_LPAR)) {
339 lpcr = mfspr(SPRN_LPCR);
340 mtspr(SPRN_LPCR, lpcr | LPCR_UPRT);
Aneesh Kumar K.V2bfd65e2016-04-29 23:25:58 +1000341 radix_init_partition_table();
Aneesh Kumar K.Vd6c88602016-05-31 11:56:29 +0530342 }
Aneesh Kumar K.V2bfd65e2016-04-29 23:25:58 +1000343
344 radix_init_pgtable();
345}
346
347void radix__early_init_mmu_secondary(void)
348{
349 unsigned long lpcr;
350 /*
Aneesh Kumar K.Vd6c88602016-05-31 11:56:29 +0530351 * update partition table control register and UPRT
Aneesh Kumar K.V2bfd65e2016-04-29 23:25:58 +1000352 */
Aneesh Kumar K.Vd6c88602016-05-31 11:56:29 +0530353 if (!firmware_has_feature(FW_FEATURE_LPAR)) {
354 lpcr = mfspr(SPRN_LPCR);
355 mtspr(SPRN_LPCR, lpcr | LPCR_UPRT);
356
Aneesh Kumar K.V2bfd65e2016-04-29 23:25:58 +1000357 mtspr(SPRN_PTCR,
358 __pa(partition_tb) | (PATB_SIZE_SHIFT - 12));
Aneesh Kumar K.Vd6c88602016-05-31 11:56:29 +0530359 }
Aneesh Kumar K.V2bfd65e2016-04-29 23:25:58 +1000360}
361
362void radix__setup_initial_memory_limit(phys_addr_t first_memblock_base,
363 phys_addr_t first_memblock_size)
364{
Aneesh Kumar K.V177ba7c2016-04-29 23:26:10 +1000365 /* We don't currently support the first MEMBLOCK not mapping 0
366 * physical on those processors
367 */
368 BUG_ON(first_memblock_base != 0);
369 /*
370 * We limit the allocation that depend on ppc64_rma_size
371 * to first_memblock_size. We also clamp it to 1GB to
372 * avoid some funky things such as RTAS bugs.
373 *
374 * On radix config we really don't have a limitation
375 * on real mode access. But keeping it as above works
376 * well enough.
377 */
378 ppc64_rma_size = min_t(u64, first_memblock_size, 0x40000000);
379 /*
380 * Finally limit subsequent allocations. We really don't want
381 * to limit the memblock allocations to rma_size. FIXME!! should
382 * we even limit at all ?
383 */
Aneesh Kumar K.V2bfd65e2016-04-29 23:25:58 +1000384 memblock_set_current_limit(first_memblock_base + first_memblock_size);
385}
Aneesh Kumar K.Vd9225ad2016-04-29 23:26:00 +1000386
387#ifdef CONFIG_SPARSEMEM_VMEMMAP
388int __meminit radix__vmemmap_create_mapping(unsigned long start,
389 unsigned long page_size,
390 unsigned long phys)
391{
392 /* Create a PTE encoding */
393 unsigned long flags = _PAGE_PRESENT | _PAGE_ACCESSED | _PAGE_KERNEL_RW;
394
395 BUG_ON(radix__map_kernel_page(start, phys, __pgprot(flags), page_size));
396 return 0;
397}
398
399#ifdef CONFIG_MEMORY_HOTPLUG
400void radix__vmemmap_remove_mapping(unsigned long start, unsigned long page_size)
401{
402 /* FIXME!! intel does more. We should free page tables mapping vmemmap ? */
403}
404#endif
405#endif
Aneesh Kumar K.Vbde3eb62016-04-29 23:26:30 +1000406
407#ifdef CONFIG_TRANSPARENT_HUGEPAGE
408
409unsigned long radix__pmd_hugepage_update(struct mm_struct *mm, unsigned long addr,
410 pmd_t *pmdp, unsigned long clr,
411 unsigned long set)
412{
413 unsigned long old;
414
415#ifdef CONFIG_DEBUG_VM
416 WARN_ON(!radix__pmd_trans_huge(*pmdp));
417 assert_spin_locked(&mm->page_table_lock);
418#endif
419
420 old = radix__pte_update(mm, addr, (pte_t *)pmdp, clr, set, 1);
421 trace_hugepage_update(addr, old, clr, set);
422
423 return old;
424}
425
426pmd_t radix__pmdp_collapse_flush(struct vm_area_struct *vma, unsigned long address,
427 pmd_t *pmdp)
428
429{
430 pmd_t pmd;
431
432 VM_BUG_ON(address & ~HPAGE_PMD_MASK);
433 VM_BUG_ON(radix__pmd_trans_huge(*pmdp));
434 /*
435 * khugepaged calls this for normal pmd
436 */
437 pmd = *pmdp;
438 pmd_clear(pmdp);
439 /*FIXME!! Verify whether we need this kick below */
440 kick_all_cpus_sync();
441 flush_tlb_range(vma, address, address + HPAGE_PMD_SIZE);
442 return pmd;
443}
444
445/*
446 * For us pgtable_t is pte_t *. Inorder to save the deposisted
447 * page table, we consider the allocated page table as a list
448 * head. On withdraw we need to make sure we zero out the used
449 * list_head memory area.
450 */
451void radix__pgtable_trans_huge_deposit(struct mm_struct *mm, pmd_t *pmdp,
452 pgtable_t pgtable)
453{
454 struct list_head *lh = (struct list_head *) pgtable;
455
456 assert_spin_locked(pmd_lockptr(mm, pmdp));
457
458 /* FIFO */
459 if (!pmd_huge_pte(mm, pmdp))
460 INIT_LIST_HEAD(lh);
461 else
462 list_add(lh, (struct list_head *) pmd_huge_pte(mm, pmdp));
463 pmd_huge_pte(mm, pmdp) = pgtable;
464}
465
466pgtable_t radix__pgtable_trans_huge_withdraw(struct mm_struct *mm, pmd_t *pmdp)
467{
468 pte_t *ptep;
469 pgtable_t pgtable;
470 struct list_head *lh;
471
472 assert_spin_locked(pmd_lockptr(mm, pmdp));
473
474 /* FIFO */
475 pgtable = pmd_huge_pte(mm, pmdp);
476 lh = (struct list_head *) pgtable;
477 if (list_empty(lh))
478 pmd_huge_pte(mm, pmdp) = NULL;
479 else {
480 pmd_huge_pte(mm, pmdp) = (pgtable_t) lh->next;
481 list_del(lh);
482 }
483 ptep = (pte_t *) pgtable;
484 *ptep = __pte(0);
485 ptep++;
486 *ptep = __pte(0);
487 return pgtable;
488}
489
490
491pmd_t radix__pmdp_huge_get_and_clear(struct mm_struct *mm,
492 unsigned long addr, pmd_t *pmdp)
493{
494 pmd_t old_pmd;
495 unsigned long old;
496
497 old = radix__pmd_hugepage_update(mm, addr, pmdp, ~0UL, 0);
498 old_pmd = __pmd(old);
499 /*
500 * Serialize against find_linux_pte_or_hugepte which does lock-less
501 * lookup in page tables with local interrupts disabled. For huge pages
502 * it casts pmd_t to pte_t. Since format of pte_t is different from
503 * pmd_t we want to prevent transit from pmd pointing to page table
504 * to pmd pointing to huge page (and back) while interrupts are disabled.
505 * We clear pmd to possibly replace it with page table pointer in
506 * different code paths. So make sure we wait for the parallel
507 * find_linux_pte_or_hugepage to finish.
508 */
509 kick_all_cpus_sync();
510 return old_pmd;
511}
512
513int radix__has_transparent_hugepage(void)
514{
515 /* For radix 2M at PMD level means thp */
516 if (mmu_psize_defs[MMU_PAGE_2M].shift == PMD_SHIFT)
517 return 1;
518 return 0;
519}
520#endif /* CONFIG_TRANSPARENT_HUGEPAGE */