blob: 4963790138737f26ad471c49216d194c4fa7a700 [file] [log] [blame]
Paul Mackerras14cf11a2005-09-26 16:04:21 +10001/*
2 * PowerPC version
3 * Copyright (C) 1995-1996 Gary Thomas (gdt@linuxppc.org)
4 *
5 * Modifications by Paul Mackerras (PowerMac) (paulus@cs.anu.edu.au)
6 * and Cort Dougan (PReP) (cort@cs.nmt.edu)
7 * Copyright (C) 1996 Paul Mackerras
Paul Mackerras14cf11a2005-09-26 16:04:21 +10008 *
9 * Derived from "arch/i386/mm/init.c"
10 * Copyright (C) 1991, 1992, 1993, 1994 Linus Torvalds
11 *
12 * Dave Engebretsen <engebret@us.ibm.com>
13 * Rework for PPC64 port.
14 *
15 * This program is free software; you can redistribute it and/or
16 * modify it under the terms of the GNU General Public License
17 * as published by the Free Software Foundation; either version
18 * 2 of the License, or (at your option) any later version.
19 *
20 */
21
Benjamin Herrenschmidtcec08e72008-04-30 15:41:48 +100022#undef DEBUG
23
Paul Mackerras14cf11a2005-09-26 16:04:21 +100024#include <linux/signal.h>
25#include <linux/sched.h>
26#include <linux/kernel.h>
27#include <linux/errno.h>
28#include <linux/string.h>
29#include <linux/types.h>
30#include <linux/mman.h>
31#include <linux/mm.h>
32#include <linux/swap.h>
33#include <linux/stddef.h>
34#include <linux/vmalloc.h>
35#include <linux/init.h>
36#include <linux/delay.h>
37#include <linux/bootmem.h>
38#include <linux/highmem.h>
39#include <linux/idr.h>
40#include <linux/nodemask.h>
41#include <linux/module.h>
Randy Dunlapc9cf5522006-06-27 02:53:52 -070042#include <linux/poison.h>
Yinghai Lu95f72d12010-07-12 14:36:09 +100043#include <linux/memblock.h>
David Gibsona4fe3ce2009-10-26 19:24:31 +000044#include <linux/hugetlb.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090045#include <linux/slab.h>
Paul Mackerras14cf11a2005-09-26 16:04:21 +100046
47#include <asm/pgalloc.h>
48#include <asm/page.h>
49#include <asm/prom.h>
Paul Mackerras14cf11a2005-09-26 16:04:21 +100050#include <asm/rtas.h>
51#include <asm/io.h>
52#include <asm/mmu_context.h>
53#include <asm/pgtable.h>
54#include <asm/mmu.h>
55#include <asm/uaccess.h>
56#include <asm/smp.h>
57#include <asm/machdep.h>
58#include <asm/tlb.h>
59#include <asm/eeh.h>
60#include <asm/processor.h>
61#include <asm/mmzone.h>
62#include <asm/cputable.h>
Paul Mackerras14cf11a2005-09-26 16:04:21 +100063#include <asm/sections.h>
Paul Mackerras14cf11a2005-09-26 16:04:21 +100064#include <asm/iommu.h>
Paul Mackerras14cf11a2005-09-26 16:04:21 +100065#include <asm/vdso.h>
David Gibson800fc3e2005-11-16 15:43:48 +110066
67#include "mmu_decl.h"
Paul Mackerras14cf11a2005-09-26 16:04:21 +100068
Benjamin Herrenschmidt94491682009-06-02 21:17:45 +000069#ifdef CONFIG_PPC_STD_MMU_64
Paul Mackerras14cf11a2005-09-26 16:04:21 +100070#if PGTABLE_RANGE > USER_VSID_RANGE
71#warning Limited user VSID range means pagetable space is wasted
72#endif
73
74#if (TASK_SIZE_USER64 < PGTABLE_RANGE) && (TASK_SIZE_USER64 < USER_VSID_RANGE)
75#warning TASK_SIZE is smaller than it needs to be.
76#endif
Benjamin Herrenschmidt94491682009-06-02 21:17:45 +000077#endif /* CONFIG_PPC_STD_MMU_64 */
Paul Mackerras14cf11a2005-09-26 16:04:21 +100078
Kumar Gala37dd2ba2008-04-22 04:22:34 +100079phys_addr_t memstart_addr = ~0;
Sonny Rao79c30952010-08-19 18:08:09 +000080EXPORT_SYMBOL_GPL(memstart_addr);
Kumar Gala37dd2ba2008-04-22 04:22:34 +100081phys_addr_t kernstart_addr;
Sonny Rao79c30952010-08-19 18:08:09 +000082EXPORT_SYMBOL_GPL(kernstart_addr);
Kumar Galad7917ba2008-04-16 05:52:22 +100083
Alexey Dobriyan51cc5062008-07-25 19:45:34 -070084static void pgd_ctor(void *addr)
Paul Mackerras14cf11a2005-09-26 16:04:21 +100085{
Alexey Dobriyan51cc5062008-07-25 19:45:34 -070086 memset(addr, 0, PGD_TABLE_SIZE);
87}
88
89static void pmd_ctor(void *addr)
90{
Aneesh Kumar K.Vf940f522013-06-20 14:30:14 +053091#ifdef CONFIG_TRANSPARENT_HUGEPAGE
92 memset(addr, 0, PMD_TABLE_SIZE * 2);
93#else
Alexey Dobriyan51cc5062008-07-25 19:45:34 -070094 memset(addr, 0, PMD_TABLE_SIZE);
Aneesh Kumar K.Vf940f522013-06-20 14:30:14 +053095#endif
Paul Mackerras14cf11a2005-09-26 16:04:21 +100096}
97
David Gibsona0668cd2009-10-28 16:27:18 +000098struct kmem_cache *pgtable_cache[MAX_PGTABLE_INDEX_SIZE];
Paul Mackerras14cf11a2005-09-26 16:04:21 +100099
David Gibsona0668cd2009-10-28 16:27:18 +0000100/*
101 * Create a kmem_cache() for pagetables. This is not used for PTE
102 * pages - they're linked to struct page, come from the normal free
103 * pages pool and have a different entry size (see real_pte_t) to
104 * everything else. Caches created by this function are used for all
105 * the higher level pagetables, and for hugepage pagetables.
106 */
107void pgtable_cache_add(unsigned shift, void (*ctor)(void *))
108{
109 char *name;
110 unsigned long table_size = sizeof(void *) << shift;
111 unsigned long align = table_size;
112
113 /* When batching pgtable pointers for RCU freeing, we store
114 * the index size in the low bits. Table alignment must be
David Gibsona4fe3ce2009-10-26 19:24:31 +0000115 * big enough to fit it.
116 *
117 * Likewise, hugeapge pagetable pointers contain a (different)
118 * shift value in the low bits. All tables must be aligned so
119 * as to leave enough 0 bits in the address to contain it. */
120 unsigned long minalign = max(MAX_PGTABLE_INDEX_SIZE + 1,
121 HUGEPD_SHIFT_MASK + 1);
David Gibsona0668cd2009-10-28 16:27:18 +0000122 struct kmem_cache *new;
123
124 /* It would be nice if this was a BUILD_BUG_ON(), but at the
125 * moment, gcc doesn't seem to recognize is_power_of_2 as a
126 * constant expression, so so much for that. */
127 BUG_ON(!is_power_of_2(minalign));
128 BUG_ON((shift < 1) || (shift > MAX_PGTABLE_INDEX_SIZE));
129
130 if (PGT_CACHE(shift))
131 return; /* Already have a cache of this size */
132
133 align = max_t(unsigned long, align, minalign);
134 name = kasprintf(GFP_KERNEL, "pgtable-2^%d", shift);
135 new = kmem_cache_create(name, table_size, align, 0, ctor);
Aneesh Kumar K.Vcf9427b2013-04-28 09:37:29 +0000136 pgtable_cache[shift - 1] = new;
David Gibsona0668cd2009-10-28 16:27:18 +0000137 pr_debug("Allocated pgtable cache for order %d\n", shift);
138}
139
Paul Mackerras14cf11a2005-09-26 16:04:21 +1000140
141void pgtable_cache_init(void)
142{
David Gibsona0668cd2009-10-28 16:27:18 +0000143 pgtable_cache_add(PGD_INDEX_SIZE, pgd_ctor);
Aneesh Kumar K.Vf940f522013-06-20 14:30:14 +0530144 pgtable_cache_add(PMD_CACHE_INDEX, pmd_ctor);
145 if (!PGT_CACHE(PGD_INDEX_SIZE) || !PGT_CACHE(PMD_CACHE_INDEX))
David Gibsona0668cd2009-10-28 16:27:18 +0000146 panic("Couldn't allocate pgtable caches");
David Gibsona0668cd2009-10-28 16:27:18 +0000147 /* In all current configs, when the PUD index exists it's the
148 * same size as either the pgd or pmd index. Verify that the
149 * initialization above has also created a PUD cache. This
150 * will need re-examiniation if we add new possibilities for
151 * the pagetable layout. */
152 BUG_ON(PUD_INDEX_SIZE && !PGT_CACHE(PUD_INDEX_SIZE));
Paul Mackerras14cf11a2005-09-26 16:04:21 +1000153}
Andy Whitcroftd29eff7bc2007-10-16 01:24:17 -0700154
155#ifdef CONFIG_SPARSEMEM_VMEMMAP
156/*
157 * Given an address within the vmemmap, determine the pfn of the page that
158 * represents the start of the section it is within. Note that we have to
159 * do this by hand as the proffered address may not be correctly aligned.
160 * Subtraction of non-aligned pointers produces undefined results.
161 */
Michael Ellerman09de9ff2008-05-08 14:27:07 +1000162static unsigned long __meminit vmemmap_section_start(unsigned long page)
Andy Whitcroftd29eff7bc2007-10-16 01:24:17 -0700163{
164 unsigned long offset = page - ((unsigned long)(vmemmap));
165
166 /* Return the pfn of the start of the section. */
167 return (offset / sizeof(struct page)) & PAGE_SECTION_MASK;
168}
169
170/*
171 * Check if this vmemmap page is already initialised. If any section
172 * which overlaps this vmemmap page is initialised then this page is
173 * initialised already.
174 */
Michael Ellerman09de9ff2008-05-08 14:27:07 +1000175static int __meminit vmemmap_populated(unsigned long start, int page_size)
Andy Whitcroftd29eff7bc2007-10-16 01:24:17 -0700176{
177 unsigned long end = start + page_size;
178
179 for (; start < end; start += (PAGES_PER_SECTION * sizeof(struct page)))
180 if (pfn_valid(vmemmap_section_start(start)))
181 return 1;
182
183 return 0;
184}
185
Benjamin Herrenschmidt32a74942009-07-23 23:15:58 +0000186/* On hash-based CPUs, the vmemmap is bolted in the hash table.
187 *
188 * On Book3E CPUs, the vmemmap is currently mapped in the top half of
189 * the vmalloc space using normal page tables, though the size of
190 * pages encoded in the PTEs can be different
191 */
192
193#ifdef CONFIG_PPC_BOOK3E
194static void __meminit vmemmap_create_mapping(unsigned long start,
195 unsigned long page_size,
196 unsigned long phys)
197{
198 /* Create a PTE encoding without page size */
199 unsigned long i, flags = _PAGE_PRESENT | _PAGE_ACCESSED |
200 _PAGE_KERNEL_RW;
201
202 /* PTEs only contain page size encodings up to 32M */
203 BUG_ON(mmu_psize_defs[mmu_vmemmap_psize].enc > 0xf);
204
205 /* Encode the size in the PTE */
206 flags |= mmu_psize_defs[mmu_vmemmap_psize].enc << 8;
207
208 /* For each PTE for that area, map things. Note that we don't
209 * increment phys because all PTEs are of the large size and
210 * thus must have the low bits clear
211 */
212 for (i = 0; i < page_size; i += PAGE_SIZE)
213 BUG_ON(map_kernel_page(start + i, phys, flags));
214}
Li Zhonged5694a2014-06-11 16:23:37 +0800215
216#ifdef CONFIG_MEMORY_HOTPLUG
217static void vmemmap_remove_mapping(unsigned long start,
218 unsigned long page_size)
219{
220}
221#endif
Benjamin Herrenschmidt32a74942009-07-23 23:15:58 +0000222#else /* CONFIG_PPC_BOOK3E */
223static void __meminit vmemmap_create_mapping(unsigned long start,
224 unsigned long page_size,
225 unsigned long phys)
226{
227 int mapped = htab_bolt_mapping(start, start + page_size, phys,
Aneesh Kumar K.V83d5e642013-05-06 10:51:00 +0000228 pgprot_val(PAGE_KERNEL),
229 mmu_vmemmap_psize,
Benjamin Herrenschmidt32a74942009-07-23 23:15:58 +0000230 mmu_kernel_ssize);
231 BUG_ON(mapped < 0);
232}
Li Zhonged5694a2014-06-11 16:23:37 +0800233
234#ifdef CONFIG_MEMORY_HOTPLUG
235extern int htab_remove_mapping(unsigned long vstart, unsigned long vend,
236 int psize, int ssize);
237
238static void vmemmap_remove_mapping(unsigned long start,
239 unsigned long page_size)
240{
241 int mapped = htab_remove_mapping(start, start + page_size,
242 mmu_vmemmap_psize,
243 mmu_kernel_ssize);
244 BUG_ON(mapped < 0);
245}
246#endif
247
Benjamin Herrenschmidt32a74942009-07-23 23:15:58 +0000248#endif /* CONFIG_PPC_BOOK3E */
249
Mark Nelson91eea672010-04-21 16:21:03 +0000250struct vmemmap_backing *vmemmap_list;
Li Zhongbd8cb032014-06-11 16:23:36 +0800251static struct vmemmap_backing *next;
252static int num_left;
253static int num_freed;
Mark Nelson91eea672010-04-21 16:21:03 +0000254
255static __meminit struct vmemmap_backing * vmemmap_list_alloc(int node)
256{
Li Zhongbd8cb032014-06-11 16:23:36 +0800257 struct vmemmap_backing *vmem_back;
258 /* get from freed entries first */
259 if (num_freed) {
260 num_freed--;
261 vmem_back = next;
262 next = next->list;
263
264 return vmem_back;
265 }
Mark Nelson91eea672010-04-21 16:21:03 +0000266
267 /* allocate a page when required and hand out chunks */
Li Zhongbd8cb032014-06-11 16:23:36 +0800268 if (!num_left) {
Mark Nelson91eea672010-04-21 16:21:03 +0000269 next = vmemmap_alloc_block(PAGE_SIZE, node);
270 if (unlikely(!next)) {
271 WARN_ON(1);
272 return NULL;
273 }
274 num_left = PAGE_SIZE / sizeof(struct vmemmap_backing);
275 }
276
277 num_left--;
278
279 return next++;
280}
281
282static __meminit void vmemmap_list_populate(unsigned long phys,
283 unsigned long start,
284 int node)
285{
286 struct vmemmap_backing *vmem_back;
287
288 vmem_back = vmemmap_list_alloc(node);
289 if (unlikely(!vmem_back)) {
290 WARN_ON(1);
291 return;
292 }
293
294 vmem_back->phys = phys;
295 vmem_back->virt_addr = start;
296 vmem_back->list = vmemmap_list;
297
298 vmemmap_list = vmem_back;
299}
300
Li Zhong71b0bfe2014-06-11 16:23:38 +0800301int __meminit vmemmap_populate(unsigned long start, unsigned long end, int node)
302{
303 unsigned long page_size = 1 << mmu_psize_defs[mmu_vmemmap_psize].shift;
304
305 /* Align to the page size of the linear mapping. */
306 start = _ALIGN_DOWN(start, page_size);
307
308 pr_debug("vmemmap_populate %lx..%lx, node %d\n", start, end, node);
309
310 for (; start < end; start += page_size) {
311 void *p;
312
313 if (vmemmap_populated(start, page_size))
314 continue;
315
316 p = vmemmap_alloc_block(page_size, node);
317 if (!p)
318 return -ENOMEM;
319
320 vmemmap_list_populate(__pa(p), start, node);
321
322 pr_debug(" * %016lx..%016lx allocated at %p\n",
323 start, start + page_size, p);
324
325 vmemmap_create_mapping(start, page_size, __pa(p));
326 }
327
328 return 0;
329}
330
331#ifdef CONFIG_MEMORY_HOTPLUG
Li Zhongbd8cb032014-06-11 16:23:36 +0800332static unsigned long vmemmap_list_free(unsigned long start)
333{
334 struct vmemmap_backing *vmem_back, *vmem_back_prev;
335
336 vmem_back_prev = vmem_back = vmemmap_list;
337
338 /* look for it with prev pointer recorded */
339 for (; vmem_back; vmem_back = vmem_back->list) {
340 if (vmem_back->virt_addr == start)
341 break;
342 vmem_back_prev = vmem_back;
343 }
344
345 if (unlikely(!vmem_back)) {
346 WARN_ON(1);
347 return 0;
348 }
349
350 /* remove it from vmemmap_list */
351 if (vmem_back == vmemmap_list) /* remove head */
352 vmemmap_list = vmem_back->list;
353 else
354 vmem_back_prev->list = vmem_back->list;
355
356 /* next point to this freed entry */
357 vmem_back->list = next;
358 next = vmem_back;
359 num_freed++;
360
361 return vmem_back->phys;
362}
363
Li Zhong71b0bfe2014-06-11 16:23:38 +0800364void __ref vmemmap_free(unsigned long start, unsigned long end)
Andy Whitcroftd29eff7bc2007-10-16 01:24:17 -0700365{
Benjamin Herrenschmidtcec08e72008-04-30 15:41:48 +1000366 unsigned long page_size = 1 << mmu_psize_defs[mmu_vmemmap_psize].shift;
Andy Whitcroftd29eff7bc2007-10-16 01:24:17 -0700367
Andy Whitcroftd29eff7bc2007-10-16 01:24:17 -0700368 start = _ALIGN_DOWN(start, page_size);
369
Li Zhong71b0bfe2014-06-11 16:23:38 +0800370 pr_debug("vmemmap_free %lx...%lx\n", start, end);
Benjamin Herrenschmidt32a74942009-07-23 23:15:58 +0000371
Andy Whitcroftd29eff7bc2007-10-16 01:24:17 -0700372 for (; start < end; start += page_size) {
Li Zhong71b0bfe2014-06-11 16:23:38 +0800373 unsigned long addr;
Andy Whitcroftd29eff7bc2007-10-16 01:24:17 -0700374
Li Zhong71b0bfe2014-06-11 16:23:38 +0800375 /*
376 * the section has already be marked as invalid, so
377 * vmemmap_populated() true means some other sections still
378 * in this page, so skip it.
379 */
Andy Whitcroftd29eff7bc2007-10-16 01:24:17 -0700380 if (vmemmap_populated(start, page_size))
381 continue;
382
Li Zhong71b0bfe2014-06-11 16:23:38 +0800383 addr = vmemmap_list_free(start);
384 if (addr) {
385 struct page *page = pfn_to_page(addr >> PAGE_SHIFT);
Andy Whitcroftd29eff7bc2007-10-16 01:24:17 -0700386
Li Zhong71b0bfe2014-06-11 16:23:38 +0800387 if (PageReserved(page)) {
388 /* allocated from bootmem */
389 if (page_size < PAGE_SIZE) {
390 /*
391 * this shouldn't happen, but if it is
392 * the case, leave the memory there
393 */
394 WARN_ON_ONCE(1);
395 } else {
396 unsigned int nr_pages =
397 1 << get_order(page_size);
398 while (nr_pages--)
399 free_reserved_page(page++);
400 }
401 } else
402 free_pages((unsigned long)(__va(addr)),
403 get_order(page_size));
Mark Nelson91eea672010-04-21 16:21:03 +0000404
Li Zhong71b0bfe2014-06-11 16:23:38 +0800405 vmemmap_remove_mapping(start, page_size);
406 }
Andy Whitcroftd29eff7bc2007-10-16 01:24:17 -0700407 }
Andy Whitcroftd29eff7bc2007-10-16 01:24:17 -0700408}
Li Zhong71b0bfe2014-06-11 16:23:38 +0800409#endif
Nathan Fontenotf7e33342013-09-27 10:18:09 -0500410void register_page_bootmem_memmap(unsigned long section_nr,
411 struct page *start_page, unsigned long size)
412{
413}
Benjamin Herrenschmidtcd3db0c2010-07-06 15:39:02 -0700414
Alexey Kardashevskiy8e0861fa2013-08-28 18:37:42 +1000415/*
416 * We do not have access to the sparsemem vmemmap, so we fallback to
417 * walking the list of sparsemem blocks which we already maintain for
418 * the sake of crashdump. In the long run, we might want to maintain
419 * a tree if performance of that linear walk becomes a problem.
420 *
421 * realmode_pfn_to_page functions can fail due to:
422 * 1) As real sparsemem blocks do not lay in RAM continously (they
423 * are in virtual address space which is not available in the real mode),
424 * the requested page struct can be split between blocks so get_page/put_page
425 * may fail.
426 * 2) When huge pages are used, the get_page/put_page API will fail
427 * in real mode as the linked addresses in the page struct are virtual
428 * too.
429 */
430struct page *realmode_pfn_to_page(unsigned long pfn)
431{
432 struct vmemmap_backing *vmem_back;
433 struct page *page;
434 unsigned long page_size = 1 << mmu_psize_defs[mmu_vmemmap_psize].shift;
435 unsigned long pg_va = (unsigned long) pfn_to_page(pfn);
436
437 for (vmem_back = vmemmap_list; vmem_back; vmem_back = vmem_back->list) {
438 if (pg_va < vmem_back->virt_addr)
439 continue;
440
Li Zhongbd8cb032014-06-11 16:23:36 +0800441 /* After vmemmap_list entry free is possible, need check all */
442 if ((pg_va + sizeof(struct page)) <=
443 (vmem_back->virt_addr + page_size)) {
444 page = (struct page *) (vmem_back->phys + pg_va -
Alexey Kardashevskiy8e0861fa2013-08-28 18:37:42 +1000445 vmem_back->virt_addr);
Li Zhongbd8cb032014-06-11 16:23:36 +0800446 return page;
447 }
Alexey Kardashevskiy8e0861fa2013-08-28 18:37:42 +1000448 }
449
Li Zhongbd8cb032014-06-11 16:23:36 +0800450 /* Probably that page struct is split between real pages */
Alexey Kardashevskiy8e0861fa2013-08-28 18:37:42 +1000451 return NULL;
452}
453EXPORT_SYMBOL_GPL(realmode_pfn_to_page);
454
455#elif defined(CONFIG_FLATMEM)
456
457struct page *realmode_pfn_to_page(unsigned long pfn)
458{
459 struct page *page = pfn_to_page(pfn);
460 return page;
461}
462EXPORT_SYMBOL_GPL(realmode_pfn_to_page);
463
464#endif /* CONFIG_SPARSEMEM_VMEMMAP/CONFIG_FLATMEM */