init_64.c 8.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306
  1. /*
  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
  8. *
  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. #undef DEBUG
  22. #include <linux/signal.h>
  23. #include <linux/sched.h>
  24. #include <linux/kernel.h>
  25. #include <linux/errno.h>
  26. #include <linux/string.h>
  27. #include <linux/types.h>
  28. #include <linux/mman.h>
  29. #include <linux/mm.h>
  30. #include <linux/swap.h>
  31. #include <linux/stddef.h>
  32. #include <linux/vmalloc.h>
  33. #include <linux/init.h>
  34. #include <linux/delay.h>
  35. #include <linux/bootmem.h>
  36. #include <linux/highmem.h>
  37. #include <linux/idr.h>
  38. #include <linux/nodemask.h>
  39. #include <linux/module.h>
  40. #include <linux/poison.h>
  41. #include <linux/memblock.h>
  42. #include <linux/hugetlb.h>
  43. #include <linux/slab.h>
  44. #include <asm/pgalloc.h>
  45. #include <asm/page.h>
  46. #include <asm/prom.h>
  47. #include <asm/rtas.h>
  48. #include <asm/io.h>
  49. #include <asm/mmu_context.h>
  50. #include <asm/pgtable.h>
  51. #include <asm/mmu.h>
  52. #include <asm/uaccess.h>
  53. #include <asm/smp.h>
  54. #include <asm/machdep.h>
  55. #include <asm/tlb.h>
  56. #include <asm/eeh.h>
  57. #include <asm/processor.h>
  58. #include <asm/mmzone.h>
  59. #include <asm/cputable.h>
  60. #include <asm/sections.h>
  61. #include <asm/iommu.h>
  62. #include <asm/vdso.h>
  63. #include "mmu_decl.h"
  64. #ifdef CONFIG_PPC_STD_MMU_64
  65. #if PGTABLE_RANGE > USER_VSID_RANGE
  66. #warning Limited user VSID range means pagetable space is wasted
  67. #endif
  68. #if (TASK_SIZE_USER64 < PGTABLE_RANGE) && (TASK_SIZE_USER64 < USER_VSID_RANGE)
  69. #warning TASK_SIZE is smaller than it needs to be.
  70. #endif
  71. #endif /* CONFIG_PPC_STD_MMU_64 */
  72. phys_addr_t memstart_addr = ~0;
  73. EXPORT_SYMBOL_GPL(memstart_addr);
  74. phys_addr_t kernstart_addr;
  75. EXPORT_SYMBOL_GPL(kernstart_addr);
  76. static void pgd_ctor(void *addr)
  77. {
  78. memset(addr, 0, PGD_TABLE_SIZE);
  79. }
  80. static void pmd_ctor(void *addr)
  81. {
  82. memset(addr, 0, PMD_TABLE_SIZE);
  83. }
  84. struct kmem_cache *pgtable_cache[MAX_PGTABLE_INDEX_SIZE];
  85. /*
  86. * Create a kmem_cache() for pagetables. This is not used for PTE
  87. * pages - they're linked to struct page, come from the normal free
  88. * pages pool and have a different entry size (see real_pte_t) to
  89. * everything else. Caches created by this function are used for all
  90. * the higher level pagetables, and for hugepage pagetables.
  91. */
  92. void pgtable_cache_add(unsigned shift, void (*ctor)(void *))
  93. {
  94. char *name;
  95. unsigned long table_size = sizeof(void *) << shift;
  96. unsigned long align = table_size;
  97. /* When batching pgtable pointers for RCU freeing, we store
  98. * the index size in the low bits. Table alignment must be
  99. * big enough to fit it.
  100. *
  101. * Likewise, hugeapge pagetable pointers contain a (different)
  102. * shift value in the low bits. All tables must be aligned so
  103. * as to leave enough 0 bits in the address to contain it. */
  104. unsigned long minalign = max(MAX_PGTABLE_INDEX_SIZE + 1,
  105. HUGEPD_SHIFT_MASK + 1);
  106. struct kmem_cache *new;
  107. /* It would be nice if this was a BUILD_BUG_ON(), but at the
  108. * moment, gcc doesn't seem to recognize is_power_of_2 as a
  109. * constant expression, so so much for that. */
  110. BUG_ON(!is_power_of_2(minalign));
  111. BUG_ON((shift < 1) || (shift > MAX_PGTABLE_INDEX_SIZE));
  112. if (PGT_CACHE(shift))
  113. return; /* Already have a cache of this size */
  114. align = max_t(unsigned long, align, minalign);
  115. name = kasprintf(GFP_KERNEL, "pgtable-2^%d", shift);
  116. new = kmem_cache_create(name, table_size, align, 0, ctor);
  117. PGT_CACHE(shift) = new;
  118. pr_debug("Allocated pgtable cache for order %d\n", shift);
  119. }
  120. void pgtable_cache_init(void)
  121. {
  122. pgtable_cache_add(PGD_INDEX_SIZE, pgd_ctor);
  123. pgtable_cache_add(PMD_INDEX_SIZE, pmd_ctor);
  124. if (!PGT_CACHE(PGD_INDEX_SIZE) || !PGT_CACHE(PMD_INDEX_SIZE))
  125. panic("Couldn't allocate pgtable caches");
  126. /* In all current configs, when the PUD index exists it's the
  127. * same size as either the pgd or pmd index. Verify that the
  128. * initialization above has also created a PUD cache. This
  129. * will need re-examiniation if we add new possibilities for
  130. * the pagetable layout. */
  131. BUG_ON(PUD_INDEX_SIZE && !PGT_CACHE(PUD_INDEX_SIZE));
  132. }
  133. #ifdef CONFIG_SPARSEMEM_VMEMMAP
  134. /*
  135. * Given an address within the vmemmap, determine the pfn of the page that
  136. * represents the start of the section it is within. Note that we have to
  137. * do this by hand as the proffered address may not be correctly aligned.
  138. * Subtraction of non-aligned pointers produces undefined results.
  139. */
  140. static unsigned long __meminit vmemmap_section_start(unsigned long page)
  141. {
  142. unsigned long offset = page - ((unsigned long)(vmemmap));
  143. /* Return the pfn of the start of the section. */
  144. return (offset / sizeof(struct page)) & PAGE_SECTION_MASK;
  145. }
  146. /*
  147. * Check if this vmemmap page is already initialised. If any section
  148. * which overlaps this vmemmap page is initialised then this page is
  149. * initialised already.
  150. */
  151. static int __meminit vmemmap_populated(unsigned long start, int page_size)
  152. {
  153. unsigned long end = start + page_size;
  154. for (; start < end; start += (PAGES_PER_SECTION * sizeof(struct page)))
  155. if (pfn_valid(vmemmap_section_start(start)))
  156. return 1;
  157. return 0;
  158. }
  159. /* On hash-based CPUs, the vmemmap is bolted in the hash table.
  160. *
  161. * On Book3E CPUs, the vmemmap is currently mapped in the top half of
  162. * the vmalloc space using normal page tables, though the size of
  163. * pages encoded in the PTEs can be different
  164. */
  165. #ifdef CONFIG_PPC_BOOK3E
  166. static void __meminit vmemmap_create_mapping(unsigned long start,
  167. unsigned long page_size,
  168. unsigned long phys)
  169. {
  170. /* Create a PTE encoding without page size */
  171. unsigned long i, flags = _PAGE_PRESENT | _PAGE_ACCESSED |
  172. _PAGE_KERNEL_RW;
  173. /* PTEs only contain page size encodings up to 32M */
  174. BUG_ON(mmu_psize_defs[mmu_vmemmap_psize].enc > 0xf);
  175. /* Encode the size in the PTE */
  176. flags |= mmu_psize_defs[mmu_vmemmap_psize].enc << 8;
  177. /* For each PTE for that area, map things. Note that we don't
  178. * increment phys because all PTEs are of the large size and
  179. * thus must have the low bits clear
  180. */
  181. for (i = 0; i < page_size; i += PAGE_SIZE)
  182. BUG_ON(map_kernel_page(start + i, phys, flags));
  183. }
  184. #else /* CONFIG_PPC_BOOK3E */
  185. static void __meminit vmemmap_create_mapping(unsigned long start,
  186. unsigned long page_size,
  187. unsigned long phys)
  188. {
  189. int mapped = htab_bolt_mapping(start, start + page_size, phys,
  190. PAGE_KERNEL, mmu_vmemmap_psize,
  191. mmu_kernel_ssize);
  192. BUG_ON(mapped < 0);
  193. }
  194. #endif /* CONFIG_PPC_BOOK3E */
  195. struct vmemmap_backing *vmemmap_list;
  196. static __meminit struct vmemmap_backing * vmemmap_list_alloc(int node)
  197. {
  198. static struct vmemmap_backing *next;
  199. static int num_left;
  200. /* allocate a page when required and hand out chunks */
  201. if (!next || !num_left) {
  202. next = vmemmap_alloc_block(PAGE_SIZE, node);
  203. if (unlikely(!next)) {
  204. WARN_ON(1);
  205. return NULL;
  206. }
  207. num_left = PAGE_SIZE / sizeof(struct vmemmap_backing);
  208. }
  209. num_left--;
  210. return next++;
  211. }
  212. static __meminit void vmemmap_list_populate(unsigned long phys,
  213. unsigned long start,
  214. int node)
  215. {
  216. struct vmemmap_backing *vmem_back;
  217. vmem_back = vmemmap_list_alloc(node);
  218. if (unlikely(!vmem_back)) {
  219. WARN_ON(1);
  220. return;
  221. }
  222. vmem_back->phys = phys;
  223. vmem_back->virt_addr = start;
  224. vmem_back->list = vmemmap_list;
  225. vmemmap_list = vmem_back;
  226. }
  227. int __meminit vmemmap_populate(struct page *start_page,
  228. unsigned long nr_pages, int node)
  229. {
  230. unsigned long start = (unsigned long)start_page;
  231. unsigned long end = (unsigned long)(start_page + nr_pages);
  232. unsigned long page_size = 1 << mmu_psize_defs[mmu_vmemmap_psize].shift;
  233. /* Align to the page size of the linear mapping. */
  234. start = _ALIGN_DOWN(start, page_size);
  235. pr_debug("vmemmap_populate page %p, %ld pages, node %d\n",
  236. start_page, nr_pages, node);
  237. pr_debug(" -> map %lx..%lx\n", start, end);
  238. for (; start < end; start += page_size) {
  239. void *p;
  240. if (vmemmap_populated(start, page_size))
  241. continue;
  242. p = vmemmap_alloc_block(page_size, node);
  243. if (!p)
  244. return -ENOMEM;
  245. vmemmap_list_populate(__pa(p), start, node);
  246. pr_debug(" * %016lx..%016lx allocated at %p\n",
  247. start, start + page_size, p);
  248. vmemmap_create_mapping(start, page_size, __pa(p));
  249. }
  250. return 0;
  251. }
  252. void vmemmap_free(struct page *memmap, unsigned long nr_pages)
  253. {
  254. }
  255. #endif /* CONFIG_SPARSEMEM_VMEMMAP */