sparse.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428
  1. /*
  2. * sparse memory mappings.
  3. */
  4. #include <linux/mm.h>
  5. #include <linux/mmzone.h>
  6. #include <linux/bootmem.h>
  7. #include <linux/highmem.h>
  8. #include <linux/module.h>
  9. #include <linux/spinlock.h>
  10. #include <linux/vmalloc.h>
  11. #include <asm/dma.h>
  12. #include <asm/pgalloc.h>
  13. #include <asm/pgtable.h>
  14. /*
  15. * Permanent SPARSEMEM data:
  16. *
  17. * 1) mem_section - memory sections, mem_map's for valid memory
  18. */
  19. #ifdef CONFIG_SPARSEMEM_EXTREME
  20. struct mem_section *mem_section[NR_SECTION_ROOTS]
  21. ____cacheline_internodealigned_in_smp;
  22. #else
  23. struct mem_section mem_section[NR_SECTION_ROOTS][SECTIONS_PER_ROOT]
  24. ____cacheline_internodealigned_in_smp;
  25. #endif
  26. EXPORT_SYMBOL(mem_section);
  27. #ifdef NODE_NOT_IN_PAGE_FLAGS
  28. /*
  29. * If we did not store the node number in the page then we have to
  30. * do a lookup in the section_to_node_table in order to find which
  31. * node the page belongs to.
  32. */
  33. #if MAX_NUMNODES <= 256
  34. static u8 section_to_node_table[NR_MEM_SECTIONS] __cacheline_aligned;
  35. #else
  36. static u16 section_to_node_table[NR_MEM_SECTIONS] __cacheline_aligned;
  37. #endif
  38. int page_to_nid(struct page *page)
  39. {
  40. return section_to_node_table[page_to_section(page)];
  41. }
  42. EXPORT_SYMBOL(page_to_nid);
  43. static void set_section_nid(unsigned long section_nr, int nid)
  44. {
  45. section_to_node_table[section_nr] = nid;
  46. }
  47. #else /* !NODE_NOT_IN_PAGE_FLAGS */
  48. static inline void set_section_nid(unsigned long section_nr, int nid)
  49. {
  50. }
  51. #endif
  52. #ifdef CONFIG_SPARSEMEM_EXTREME
  53. static struct mem_section noinline __init_refok *sparse_index_alloc(int nid)
  54. {
  55. struct mem_section *section = NULL;
  56. unsigned long array_size = SECTIONS_PER_ROOT *
  57. sizeof(struct mem_section);
  58. if (slab_is_available())
  59. section = kmalloc_node(array_size, GFP_KERNEL, nid);
  60. else
  61. section = alloc_bootmem_node(NODE_DATA(nid), array_size);
  62. if (section)
  63. memset(section, 0, array_size);
  64. return section;
  65. }
  66. static int __meminit sparse_index_init(unsigned long section_nr, int nid)
  67. {
  68. static DEFINE_SPINLOCK(index_init_lock);
  69. unsigned long root = SECTION_NR_TO_ROOT(section_nr);
  70. struct mem_section *section;
  71. int ret = 0;
  72. if (mem_section[root])
  73. return -EEXIST;
  74. section = sparse_index_alloc(nid);
  75. if (!section)
  76. return -ENOMEM;
  77. /*
  78. * This lock keeps two different sections from
  79. * reallocating for the same index
  80. */
  81. spin_lock(&index_init_lock);
  82. if (mem_section[root]) {
  83. ret = -EEXIST;
  84. goto out;
  85. }
  86. mem_section[root] = section;
  87. out:
  88. spin_unlock(&index_init_lock);
  89. return ret;
  90. }
  91. #else /* !SPARSEMEM_EXTREME */
  92. static inline int sparse_index_init(unsigned long section_nr, int nid)
  93. {
  94. return 0;
  95. }
  96. #endif
  97. /*
  98. * Although written for the SPARSEMEM_EXTREME case, this happens
  99. * to also work for the flat array case because
  100. * NR_SECTION_ROOTS==NR_MEM_SECTIONS.
  101. */
  102. int __section_nr(struct mem_section* ms)
  103. {
  104. unsigned long root_nr;
  105. struct mem_section* root;
  106. for (root_nr = 0; root_nr < NR_SECTION_ROOTS; root_nr++) {
  107. root = __nr_to_section(root_nr * SECTIONS_PER_ROOT);
  108. if (!root)
  109. continue;
  110. if ((ms >= root) && (ms < (root + SECTIONS_PER_ROOT)))
  111. break;
  112. }
  113. return (root_nr * SECTIONS_PER_ROOT) + (ms - root);
  114. }
  115. /*
  116. * During early boot, before section_mem_map is used for an actual
  117. * mem_map, we use section_mem_map to store the section's NUMA
  118. * node. This keeps us from having to use another data structure. The
  119. * node information is cleared just before we store the real mem_map.
  120. */
  121. static inline unsigned long sparse_encode_early_nid(int nid)
  122. {
  123. return (nid << SECTION_NID_SHIFT);
  124. }
  125. static inline int sparse_early_nid(struct mem_section *section)
  126. {
  127. return (section->section_mem_map >> SECTION_NID_SHIFT);
  128. }
  129. /* Record a memory area against a node. */
  130. void __init memory_present(int nid, unsigned long start, unsigned long end)
  131. {
  132. unsigned long max_arch_pfn = 1UL << (MAX_PHYSMEM_BITS-PAGE_SHIFT);
  133. unsigned long pfn;
  134. /*
  135. * Sanity checks - do not allow an architecture to pass
  136. * in larger pfns than the maximum scope of sparsemem:
  137. */
  138. if (start >= max_arch_pfn)
  139. return;
  140. if (end >= max_arch_pfn)
  141. end = max_arch_pfn;
  142. start &= PAGE_SECTION_MASK;
  143. for (pfn = start; pfn < end; pfn += PAGES_PER_SECTION) {
  144. unsigned long section = pfn_to_section_nr(pfn);
  145. struct mem_section *ms;
  146. sparse_index_init(section, nid);
  147. set_section_nid(section, nid);
  148. ms = __nr_to_section(section);
  149. if (!ms->section_mem_map)
  150. ms->section_mem_map = sparse_encode_early_nid(nid) |
  151. SECTION_MARKED_PRESENT;
  152. }
  153. }
  154. /*
  155. * Only used by the i386 NUMA architecures, but relatively
  156. * generic code.
  157. */
  158. unsigned long __init node_memmap_size_bytes(int nid, unsigned long start_pfn,
  159. unsigned long end_pfn)
  160. {
  161. unsigned long pfn;
  162. unsigned long nr_pages = 0;
  163. for (pfn = start_pfn; pfn < end_pfn; pfn += PAGES_PER_SECTION) {
  164. if (nid != early_pfn_to_nid(pfn))
  165. continue;
  166. if (pfn_present(pfn))
  167. nr_pages += PAGES_PER_SECTION;
  168. }
  169. return nr_pages * sizeof(struct page);
  170. }
  171. /*
  172. * Subtle, we encode the real pfn into the mem_map such that
  173. * the identity pfn - section_mem_map will return the actual
  174. * physical page frame number.
  175. */
  176. static unsigned long sparse_encode_mem_map(struct page *mem_map, unsigned long pnum)
  177. {
  178. return (unsigned long)(mem_map - (section_nr_to_pfn(pnum)));
  179. }
  180. /*
  181. * We need this if we ever free the mem_maps. While not implemented yet,
  182. * this function is included for parity with its sibling.
  183. */
  184. static __attribute((unused))
  185. struct page *sparse_decode_mem_map(unsigned long coded_mem_map, unsigned long pnum)
  186. {
  187. return ((struct page *)coded_mem_map) + section_nr_to_pfn(pnum);
  188. }
  189. static int __meminit sparse_init_one_section(struct mem_section *ms,
  190. unsigned long pnum, struct page *mem_map,
  191. unsigned long *pageblock_bitmap)
  192. {
  193. if (!present_section(ms))
  194. return -EINVAL;
  195. ms->section_mem_map &= ~SECTION_MAP_MASK;
  196. ms->section_mem_map |= sparse_encode_mem_map(mem_map, pnum) |
  197. SECTION_HAS_MEM_MAP;
  198. ms->pageblock_flags = pageblock_bitmap;
  199. return 1;
  200. }
  201. static unsigned long usemap_size(void)
  202. {
  203. unsigned long size_bytes;
  204. size_bytes = roundup(SECTION_BLOCKFLAGS_BITS, 8) / 8;
  205. size_bytes = roundup(size_bytes, sizeof(unsigned long));
  206. return size_bytes;
  207. }
  208. #ifdef CONFIG_MEMORY_HOTPLUG
  209. static unsigned long *__kmalloc_section_usemap(void)
  210. {
  211. return kmalloc(usemap_size(), GFP_KERNEL);
  212. }
  213. #endif /* CONFIG_MEMORY_HOTPLUG */
  214. static unsigned long *__init sparse_early_usemap_alloc(unsigned long pnum)
  215. {
  216. unsigned long *usemap;
  217. struct mem_section *ms = __nr_to_section(pnum);
  218. int nid = sparse_early_nid(ms);
  219. usemap = alloc_bootmem_node(NODE_DATA(nid), usemap_size());
  220. if (usemap)
  221. return usemap;
  222. /* Stupid: suppress gcc warning for SPARSEMEM && !NUMA */
  223. nid = 0;
  224. printk(KERN_WARNING "%s: allocation failed\n", __FUNCTION__);
  225. return NULL;
  226. }
  227. #ifndef CONFIG_SPARSEMEM_VMEMMAP
  228. struct page __init *sparse_mem_map_populate(unsigned long pnum, int nid)
  229. {
  230. struct page *map;
  231. map = alloc_remap(nid, sizeof(struct page) * PAGES_PER_SECTION);
  232. if (map)
  233. return map;
  234. map = alloc_bootmem_node(NODE_DATA(nid),
  235. sizeof(struct page) * PAGES_PER_SECTION);
  236. return map;
  237. }
  238. #endif /* !CONFIG_SPARSEMEM_VMEMMAP */
  239. struct page __init *sparse_early_mem_map_alloc(unsigned long pnum)
  240. {
  241. struct page *map;
  242. struct mem_section *ms = __nr_to_section(pnum);
  243. int nid = sparse_early_nid(ms);
  244. map = sparse_mem_map_populate(pnum, nid);
  245. if (map)
  246. return map;
  247. printk(KERN_ERR "%s: sparsemem memory map backing failed "
  248. "some memory will not be available.\n", __FUNCTION__);
  249. ms->section_mem_map = 0;
  250. return NULL;
  251. }
  252. /*
  253. * Allocate the accumulated non-linear sections, allocate a mem_map
  254. * for each and record the physical to section mapping.
  255. */
  256. void __init sparse_init(void)
  257. {
  258. unsigned long pnum;
  259. struct page *map;
  260. unsigned long *usemap;
  261. for (pnum = 0; pnum < NR_MEM_SECTIONS; pnum++) {
  262. if (!present_section_nr(pnum))
  263. continue;
  264. map = sparse_early_mem_map_alloc(pnum);
  265. if (!map)
  266. continue;
  267. usemap = sparse_early_usemap_alloc(pnum);
  268. if (!usemap)
  269. continue;
  270. sparse_init_one_section(__nr_to_section(pnum), pnum, map,
  271. usemap);
  272. }
  273. }
  274. #ifdef CONFIG_MEMORY_HOTPLUG
  275. #ifdef CONFIG_SPARSEMEM_VMEMMAP
  276. static inline struct page *kmalloc_section_memmap(unsigned long pnum, int nid,
  277. unsigned long nr_pages)
  278. {
  279. /* This will make the necessary allocations eventually. */
  280. return sparse_mem_map_populate(pnum, nid);
  281. }
  282. static void __kfree_section_memmap(struct page *memmap, unsigned long nr_pages)
  283. {
  284. return; /* XXX: Not implemented yet */
  285. }
  286. #else
  287. static struct page *__kmalloc_section_memmap(unsigned long nr_pages)
  288. {
  289. struct page *page, *ret;
  290. unsigned long memmap_size = sizeof(struct page) * nr_pages;
  291. page = alloc_pages(GFP_KERNEL|__GFP_NOWARN, get_order(memmap_size));
  292. if (page)
  293. goto got_map_page;
  294. ret = vmalloc(memmap_size);
  295. if (ret)
  296. goto got_map_ptr;
  297. return NULL;
  298. got_map_page:
  299. ret = (struct page *)pfn_to_kaddr(page_to_pfn(page));
  300. got_map_ptr:
  301. memset(ret, 0, memmap_size);
  302. return ret;
  303. }
  304. static inline struct page *kmalloc_section_memmap(unsigned long pnum, int nid,
  305. unsigned long nr_pages)
  306. {
  307. return __kmalloc_section_memmap(nr_pages);
  308. }
  309. static void __kfree_section_memmap(struct page *memmap, unsigned long nr_pages)
  310. {
  311. if (is_vmalloc_addr(memmap))
  312. vfree(memmap);
  313. else
  314. free_pages((unsigned long)memmap,
  315. get_order(sizeof(struct page) * nr_pages));
  316. }
  317. #endif /* CONFIG_SPARSEMEM_VMEMMAP */
  318. /*
  319. * returns the number of sections whose mem_maps were properly
  320. * set. If this is <=0, then that means that the passed-in
  321. * map was not consumed and must be freed.
  322. */
  323. int sparse_add_one_section(struct zone *zone, unsigned long start_pfn,
  324. int nr_pages)
  325. {
  326. unsigned long section_nr = pfn_to_section_nr(start_pfn);
  327. struct pglist_data *pgdat = zone->zone_pgdat;
  328. struct mem_section *ms;
  329. struct page *memmap;
  330. unsigned long *usemap;
  331. unsigned long flags;
  332. int ret;
  333. /*
  334. * no locking for this, because it does its own
  335. * plus, it does a kmalloc
  336. */
  337. ret = sparse_index_init(section_nr, pgdat->node_id);
  338. if (ret < 0 && ret != -EEXIST)
  339. return ret;
  340. memmap = kmalloc_section_memmap(section_nr, pgdat->node_id, nr_pages);
  341. if (!memmap)
  342. return -ENOMEM;
  343. usemap = __kmalloc_section_usemap();
  344. if (!usemap) {
  345. __kfree_section_memmap(memmap, nr_pages);
  346. return -ENOMEM;
  347. }
  348. pgdat_resize_lock(pgdat, &flags);
  349. ms = __pfn_to_section(start_pfn);
  350. if (ms->section_mem_map & SECTION_MARKED_PRESENT) {
  351. ret = -EEXIST;
  352. goto out;
  353. }
  354. ms->section_mem_map |= SECTION_MARKED_PRESENT;
  355. ret = sparse_init_one_section(ms, section_nr, memmap, usemap);
  356. out:
  357. pgdat_resize_unlock(pgdat, &flags);
  358. if (ret <= 0) {
  359. kfree(usemap);
  360. __kfree_section_memmap(memmap, nr_pages);
  361. }
  362. return ret;
  363. }
  364. #endif