Loading...
1/*
2 * sparse memory mappings.
3 */
4#include <linux/mm.h>
5#include <linux/slab.h>
6#include <linux/mmzone.h>
7#include <linux/bootmem.h>
8#include <linux/compiler.h>
9#include <linux/highmem.h>
10#include <linux/export.h>
11#include <linux/spinlock.h>
12#include <linux/vmalloc.h>
13
14#include "internal.h"
15#include <asm/dma.h>
16#include <asm/pgalloc.h>
17#include <asm/pgtable.h>
18
19/*
20 * Permanent SPARSEMEM data:
21 *
22 * 1) mem_section - memory sections, mem_map's for valid memory
23 */
24#ifdef CONFIG_SPARSEMEM_EXTREME
25struct mem_section *mem_section[NR_SECTION_ROOTS]
26 ____cacheline_internodealigned_in_smp;
27#else
28struct mem_section mem_section[NR_SECTION_ROOTS][SECTIONS_PER_ROOT]
29 ____cacheline_internodealigned_in_smp;
30#endif
31EXPORT_SYMBOL(mem_section);
32
33#ifdef NODE_NOT_IN_PAGE_FLAGS
34/*
35 * If we did not store the node number in the page then we have to
36 * do a lookup in the section_to_node_table in order to find which
37 * node the page belongs to.
38 */
39#if MAX_NUMNODES <= 256
40static u8 section_to_node_table[NR_MEM_SECTIONS] __cacheline_aligned;
41#else
42static u16 section_to_node_table[NR_MEM_SECTIONS] __cacheline_aligned;
43#endif
44
45int page_to_nid(const struct page *page)
46{
47 return section_to_node_table[page_to_section(page)];
48}
49EXPORT_SYMBOL(page_to_nid);
50
51static void set_section_nid(unsigned long section_nr, int nid)
52{
53 section_to_node_table[section_nr] = nid;
54}
55#else /* !NODE_NOT_IN_PAGE_FLAGS */
56static inline void set_section_nid(unsigned long section_nr, int nid)
57{
58}
59#endif
60
61#ifdef CONFIG_SPARSEMEM_EXTREME
62static struct mem_section noinline __init_refok *sparse_index_alloc(int nid)
63{
64 struct mem_section *section = NULL;
65 unsigned long array_size = SECTIONS_PER_ROOT *
66 sizeof(struct mem_section);
67
68 if (slab_is_available()) {
69 if (node_state(nid, N_HIGH_MEMORY))
70 section = kzalloc_node(array_size, GFP_KERNEL, nid);
71 else
72 section = kzalloc(array_size, GFP_KERNEL);
73 } else {
74 section = memblock_virt_alloc_node(array_size, nid);
75 }
76
77 return section;
78}
79
80static int __meminit sparse_index_init(unsigned long section_nr, int nid)
81{
82 unsigned long root = SECTION_NR_TO_ROOT(section_nr);
83 struct mem_section *section;
84
85 if (mem_section[root])
86 return -EEXIST;
87
88 section = sparse_index_alloc(nid);
89 if (!section)
90 return -ENOMEM;
91
92 mem_section[root] = section;
93
94 return 0;
95}
96#else /* !SPARSEMEM_EXTREME */
97static inline int sparse_index_init(unsigned long section_nr, int nid)
98{
99 return 0;
100}
101#endif
102
103/*
104 * Although written for the SPARSEMEM_EXTREME case, this happens
105 * to also work for the flat array case because
106 * NR_SECTION_ROOTS==NR_MEM_SECTIONS.
107 */
108int __section_nr(struct mem_section* ms)
109{
110 unsigned long root_nr;
111 struct mem_section* root;
112
113 for (root_nr = 0; root_nr < NR_SECTION_ROOTS; root_nr++) {
114 root = __nr_to_section(root_nr * SECTIONS_PER_ROOT);
115 if (!root)
116 continue;
117
118 if ((ms >= root) && (ms < (root + SECTIONS_PER_ROOT)))
119 break;
120 }
121
122 VM_BUG_ON(root_nr == NR_SECTION_ROOTS);
123
124 return (root_nr * SECTIONS_PER_ROOT) + (ms - root);
125}
126
127/*
128 * During early boot, before section_mem_map is used for an actual
129 * mem_map, we use section_mem_map to store the section's NUMA
130 * node. This keeps us from having to use another data structure. The
131 * node information is cleared just before we store the real mem_map.
132 */
133static inline unsigned long sparse_encode_early_nid(int nid)
134{
135 return (nid << SECTION_NID_SHIFT);
136}
137
138static inline int sparse_early_nid(struct mem_section *section)
139{
140 return (section->section_mem_map >> SECTION_NID_SHIFT);
141}
142
143/* Validate the physical addressing limitations of the model */
144void __meminit mminit_validate_memmodel_limits(unsigned long *start_pfn,
145 unsigned long *end_pfn)
146{
147 unsigned long max_sparsemem_pfn = 1UL << (MAX_PHYSMEM_BITS-PAGE_SHIFT);
148
149 /*
150 * Sanity checks - do not allow an architecture to pass
151 * in larger pfns than the maximum scope of sparsemem:
152 */
153 if (*start_pfn > max_sparsemem_pfn) {
154 mminit_dprintk(MMINIT_WARNING, "pfnvalidation",
155 "Start of range %lu -> %lu exceeds SPARSEMEM max %lu\n",
156 *start_pfn, *end_pfn, max_sparsemem_pfn);
157 WARN_ON_ONCE(1);
158 *start_pfn = max_sparsemem_pfn;
159 *end_pfn = max_sparsemem_pfn;
160 } else if (*end_pfn > max_sparsemem_pfn) {
161 mminit_dprintk(MMINIT_WARNING, "pfnvalidation",
162 "End of range %lu -> %lu exceeds SPARSEMEM max %lu\n",
163 *start_pfn, *end_pfn, max_sparsemem_pfn);
164 WARN_ON_ONCE(1);
165 *end_pfn = max_sparsemem_pfn;
166 }
167}
168
169/* Record a memory area against a node. */
170void __init memory_present(int nid, unsigned long start, unsigned long end)
171{
172 unsigned long pfn;
173
174 start &= PAGE_SECTION_MASK;
175 mminit_validate_memmodel_limits(&start, &end);
176 for (pfn = start; pfn < end; pfn += PAGES_PER_SECTION) {
177 unsigned long section = pfn_to_section_nr(pfn);
178 struct mem_section *ms;
179
180 sparse_index_init(section, nid);
181 set_section_nid(section, nid);
182
183 ms = __nr_to_section(section);
184 if (!ms->section_mem_map)
185 ms->section_mem_map = sparse_encode_early_nid(nid) |
186 SECTION_MARKED_PRESENT;
187 }
188}
189
190/*
191 * Only used by the i386 NUMA architecures, but relatively
192 * generic code.
193 */
194unsigned long __init node_memmap_size_bytes(int nid, unsigned long start_pfn,
195 unsigned long end_pfn)
196{
197 unsigned long pfn;
198 unsigned long nr_pages = 0;
199
200 mminit_validate_memmodel_limits(&start_pfn, &end_pfn);
201 for (pfn = start_pfn; pfn < end_pfn; pfn += PAGES_PER_SECTION) {
202 if (nid != early_pfn_to_nid(pfn))
203 continue;
204
205 if (pfn_present(pfn))
206 nr_pages += PAGES_PER_SECTION;
207 }
208
209 return nr_pages * sizeof(struct page);
210}
211
212/*
213 * Subtle, we encode the real pfn into the mem_map such that
214 * the identity pfn - section_mem_map will return the actual
215 * physical page frame number.
216 */
217static unsigned long sparse_encode_mem_map(struct page *mem_map, unsigned long pnum)
218{
219 return (unsigned long)(mem_map - (section_nr_to_pfn(pnum)));
220}
221
222/*
223 * Decode mem_map from the coded memmap
224 */
225struct page *sparse_decode_mem_map(unsigned long coded_mem_map, unsigned long pnum)
226{
227 /* mask off the extra low bits of information */
228 coded_mem_map &= SECTION_MAP_MASK;
229 return ((struct page *)coded_mem_map) + section_nr_to_pfn(pnum);
230}
231
232static int __meminit sparse_init_one_section(struct mem_section *ms,
233 unsigned long pnum, struct page *mem_map,
234 unsigned long *pageblock_bitmap)
235{
236 if (!present_section(ms))
237 return -EINVAL;
238
239 ms->section_mem_map &= ~SECTION_MAP_MASK;
240 ms->section_mem_map |= sparse_encode_mem_map(mem_map, pnum) |
241 SECTION_HAS_MEM_MAP;
242 ms->pageblock_flags = pageblock_bitmap;
243
244 return 1;
245}
246
247unsigned long usemap_size(void)
248{
249 unsigned long size_bytes;
250 size_bytes = roundup(SECTION_BLOCKFLAGS_BITS, 8) / 8;
251 size_bytes = roundup(size_bytes, sizeof(unsigned long));
252 return size_bytes;
253}
254
255#ifdef CONFIG_MEMORY_HOTPLUG
256static unsigned long *__kmalloc_section_usemap(void)
257{
258 return kmalloc(usemap_size(), GFP_KERNEL);
259}
260#endif /* CONFIG_MEMORY_HOTPLUG */
261
262#ifdef CONFIG_MEMORY_HOTREMOVE
263static unsigned long * __init
264sparse_early_usemaps_alloc_pgdat_section(struct pglist_data *pgdat,
265 unsigned long size)
266{
267 unsigned long goal, limit;
268 unsigned long *p;
269 int nid;
270 /*
271 * A page may contain usemaps for other sections preventing the
272 * page being freed and making a section unremovable while
273 * other sections referencing the usemap remain active. Similarly,
274 * a pgdat can prevent a section being removed. If section A
275 * contains a pgdat and section B contains the usemap, both
276 * sections become inter-dependent. This allocates usemaps
277 * from the same section as the pgdat where possible to avoid
278 * this problem.
279 */
280 goal = __pa(pgdat) & (PAGE_SECTION_MASK << PAGE_SHIFT);
281 limit = goal + (1UL << PA_SECTION_SHIFT);
282 nid = early_pfn_to_nid(goal >> PAGE_SHIFT);
283again:
284 p = memblock_virt_alloc_try_nid_nopanic(size,
285 SMP_CACHE_BYTES, goal, limit,
286 nid);
287 if (!p && limit) {
288 limit = 0;
289 goto again;
290 }
291 return p;
292}
293
294static void __init check_usemap_section_nr(int nid, unsigned long *usemap)
295{
296 unsigned long usemap_snr, pgdat_snr;
297 static unsigned long old_usemap_snr = NR_MEM_SECTIONS;
298 static unsigned long old_pgdat_snr = NR_MEM_SECTIONS;
299 struct pglist_data *pgdat = NODE_DATA(nid);
300 int usemap_nid;
301
302 usemap_snr = pfn_to_section_nr(__pa(usemap) >> PAGE_SHIFT);
303 pgdat_snr = pfn_to_section_nr(__pa(pgdat) >> PAGE_SHIFT);
304 if (usemap_snr == pgdat_snr)
305 return;
306
307 if (old_usemap_snr == usemap_snr && old_pgdat_snr == pgdat_snr)
308 /* skip redundant message */
309 return;
310
311 old_usemap_snr = usemap_snr;
312 old_pgdat_snr = pgdat_snr;
313
314 usemap_nid = sparse_early_nid(__nr_to_section(usemap_snr));
315 if (usemap_nid != nid) {
316 pr_info("node %d must be removed before remove section %ld\n",
317 nid, usemap_snr);
318 return;
319 }
320 /*
321 * There is a circular dependency.
322 * Some platforms allow un-removable section because they will just
323 * gather other removable sections for dynamic partitioning.
324 * Just notify un-removable section's number here.
325 */
326 pr_info("Section %ld and %ld (node %d) have a circular dependency on usemap and pgdat allocations\n",
327 usemap_snr, pgdat_snr, nid);
328}
329#else
330static unsigned long * __init
331sparse_early_usemaps_alloc_pgdat_section(struct pglist_data *pgdat,
332 unsigned long size)
333{
334 return memblock_virt_alloc_node_nopanic(size, pgdat->node_id);
335}
336
337static void __init check_usemap_section_nr(int nid, unsigned long *usemap)
338{
339}
340#endif /* CONFIG_MEMORY_HOTREMOVE */
341
342static void __init sparse_early_usemaps_alloc_node(void *data,
343 unsigned long pnum_begin,
344 unsigned long pnum_end,
345 unsigned long usemap_count, int nodeid)
346{
347 void *usemap;
348 unsigned long pnum;
349 unsigned long **usemap_map = (unsigned long **)data;
350 int size = usemap_size();
351
352 usemap = sparse_early_usemaps_alloc_pgdat_section(NODE_DATA(nodeid),
353 size * usemap_count);
354 if (!usemap) {
355 pr_warn("%s: allocation failed\n", __func__);
356 return;
357 }
358
359 for (pnum = pnum_begin; pnum < pnum_end; pnum++) {
360 if (!present_section_nr(pnum))
361 continue;
362 usemap_map[pnum] = usemap;
363 usemap += size;
364 check_usemap_section_nr(nodeid, usemap_map[pnum]);
365 }
366}
367
368#ifndef CONFIG_SPARSEMEM_VMEMMAP
369struct page __init *sparse_mem_map_populate(unsigned long pnum, int nid)
370{
371 struct page *map;
372 unsigned long size;
373
374 map = alloc_remap(nid, sizeof(struct page) * PAGES_PER_SECTION);
375 if (map)
376 return map;
377
378 size = PAGE_ALIGN(sizeof(struct page) * PAGES_PER_SECTION);
379 map = memblock_virt_alloc_try_nid(size,
380 PAGE_SIZE, __pa(MAX_DMA_ADDRESS),
381 BOOTMEM_ALLOC_ACCESSIBLE, nid);
382 return map;
383}
384void __init sparse_mem_maps_populate_node(struct page **map_map,
385 unsigned long pnum_begin,
386 unsigned long pnum_end,
387 unsigned long map_count, int nodeid)
388{
389 void *map;
390 unsigned long pnum;
391 unsigned long size = sizeof(struct page) * PAGES_PER_SECTION;
392
393 map = alloc_remap(nodeid, size * map_count);
394 if (map) {
395 for (pnum = pnum_begin; pnum < pnum_end; pnum++) {
396 if (!present_section_nr(pnum))
397 continue;
398 map_map[pnum] = map;
399 map += size;
400 }
401 return;
402 }
403
404 size = PAGE_ALIGN(size);
405 map = memblock_virt_alloc_try_nid(size * map_count,
406 PAGE_SIZE, __pa(MAX_DMA_ADDRESS),
407 BOOTMEM_ALLOC_ACCESSIBLE, nodeid);
408 if (map) {
409 for (pnum = pnum_begin; pnum < pnum_end; pnum++) {
410 if (!present_section_nr(pnum))
411 continue;
412 map_map[pnum] = map;
413 map += size;
414 }
415 return;
416 }
417
418 /* fallback */
419 for (pnum = pnum_begin; pnum < pnum_end; pnum++) {
420 struct mem_section *ms;
421
422 if (!present_section_nr(pnum))
423 continue;
424 map_map[pnum] = sparse_mem_map_populate(pnum, nodeid);
425 if (map_map[pnum])
426 continue;
427 ms = __nr_to_section(pnum);
428 pr_err("%s: sparsemem memory map backing failed some memory will not be available\n",
429 __func__);
430 ms->section_mem_map = 0;
431 }
432}
433#endif /* !CONFIG_SPARSEMEM_VMEMMAP */
434
435#ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER
436static void __init sparse_early_mem_maps_alloc_node(void *data,
437 unsigned long pnum_begin,
438 unsigned long pnum_end,
439 unsigned long map_count, int nodeid)
440{
441 struct page **map_map = (struct page **)data;
442 sparse_mem_maps_populate_node(map_map, pnum_begin, pnum_end,
443 map_count, nodeid);
444}
445#else
446static struct page __init *sparse_early_mem_map_alloc(unsigned long pnum)
447{
448 struct page *map;
449 struct mem_section *ms = __nr_to_section(pnum);
450 int nid = sparse_early_nid(ms);
451
452 map = sparse_mem_map_populate(pnum, nid);
453 if (map)
454 return map;
455
456 pr_err("%s: sparsemem memory map backing failed some memory will not be available\n",
457 __func__);
458 ms->section_mem_map = 0;
459 return NULL;
460}
461#endif
462
463void __weak __meminit vmemmap_populate_print_last(void)
464{
465}
466
467/**
468 * alloc_usemap_and_memmap - memory alloction for pageblock flags and vmemmap
469 * @map: usemap_map for pageblock flags or mmap_map for vmemmap
470 */
471static void __init alloc_usemap_and_memmap(void (*alloc_func)
472 (void *, unsigned long, unsigned long,
473 unsigned long, int), void *data)
474{
475 unsigned long pnum;
476 unsigned long map_count;
477 int nodeid_begin = 0;
478 unsigned long pnum_begin = 0;
479
480 for (pnum = 0; pnum < NR_MEM_SECTIONS; pnum++) {
481 struct mem_section *ms;
482
483 if (!present_section_nr(pnum))
484 continue;
485 ms = __nr_to_section(pnum);
486 nodeid_begin = sparse_early_nid(ms);
487 pnum_begin = pnum;
488 break;
489 }
490 map_count = 1;
491 for (pnum = pnum_begin + 1; pnum < NR_MEM_SECTIONS; pnum++) {
492 struct mem_section *ms;
493 int nodeid;
494
495 if (!present_section_nr(pnum))
496 continue;
497 ms = __nr_to_section(pnum);
498 nodeid = sparse_early_nid(ms);
499 if (nodeid == nodeid_begin) {
500 map_count++;
501 continue;
502 }
503 /* ok, we need to take cake of from pnum_begin to pnum - 1*/
504 alloc_func(data, pnum_begin, pnum,
505 map_count, nodeid_begin);
506 /* new start, update count etc*/
507 nodeid_begin = nodeid;
508 pnum_begin = pnum;
509 map_count = 1;
510 }
511 /* ok, last chunk */
512 alloc_func(data, pnum_begin, NR_MEM_SECTIONS,
513 map_count, nodeid_begin);
514}
515
516/*
517 * Allocate the accumulated non-linear sections, allocate a mem_map
518 * for each and record the physical to section mapping.
519 */
520void __init sparse_init(void)
521{
522 unsigned long pnum;
523 struct page *map;
524 unsigned long *usemap;
525 unsigned long **usemap_map;
526 int size;
527#ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER
528 int size2;
529 struct page **map_map;
530#endif
531
532 /* see include/linux/mmzone.h 'struct mem_section' definition */
533 BUILD_BUG_ON(!is_power_of_2(sizeof(struct mem_section)));
534
535 /* Setup pageblock_order for HUGETLB_PAGE_SIZE_VARIABLE */
536 set_pageblock_order();
537
538 /*
539 * map is using big page (aka 2M in x86 64 bit)
540 * usemap is less one page (aka 24 bytes)
541 * so alloc 2M (with 2M align) and 24 bytes in turn will
542 * make next 2M slip to one more 2M later.
543 * then in big system, the memory will have a lot of holes...
544 * here try to allocate 2M pages continuously.
545 *
546 * powerpc need to call sparse_init_one_section right after each
547 * sparse_early_mem_map_alloc, so allocate usemap_map at first.
548 */
549 size = sizeof(unsigned long *) * NR_MEM_SECTIONS;
550 usemap_map = memblock_virt_alloc(size, 0);
551 if (!usemap_map)
552 panic("can not allocate usemap_map\n");
553 alloc_usemap_and_memmap(sparse_early_usemaps_alloc_node,
554 (void *)usemap_map);
555
556#ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER
557 size2 = sizeof(struct page *) * NR_MEM_SECTIONS;
558 map_map = memblock_virt_alloc(size2, 0);
559 if (!map_map)
560 panic("can not allocate map_map\n");
561 alloc_usemap_and_memmap(sparse_early_mem_maps_alloc_node,
562 (void *)map_map);
563#endif
564
565 for (pnum = 0; pnum < NR_MEM_SECTIONS; pnum++) {
566 if (!present_section_nr(pnum))
567 continue;
568
569 usemap = usemap_map[pnum];
570 if (!usemap)
571 continue;
572
573#ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER
574 map = map_map[pnum];
575#else
576 map = sparse_early_mem_map_alloc(pnum);
577#endif
578 if (!map)
579 continue;
580
581 sparse_init_one_section(__nr_to_section(pnum), pnum, map,
582 usemap);
583 }
584
585 vmemmap_populate_print_last();
586
587#ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER
588 memblock_free_early(__pa(map_map), size2);
589#endif
590 memblock_free_early(__pa(usemap_map), size);
591}
592
593#ifdef CONFIG_MEMORY_HOTPLUG
594#ifdef CONFIG_SPARSEMEM_VMEMMAP
595static inline struct page *kmalloc_section_memmap(unsigned long pnum, int nid)
596{
597 /* This will make the necessary allocations eventually. */
598 return sparse_mem_map_populate(pnum, nid);
599}
600static void __kfree_section_memmap(struct page *memmap)
601{
602 unsigned long start = (unsigned long)memmap;
603 unsigned long end = (unsigned long)(memmap + PAGES_PER_SECTION);
604
605 vmemmap_free(start, end);
606}
607#ifdef CONFIG_MEMORY_HOTREMOVE
608static void free_map_bootmem(struct page *memmap)
609{
610 unsigned long start = (unsigned long)memmap;
611 unsigned long end = (unsigned long)(memmap + PAGES_PER_SECTION);
612
613 vmemmap_free(start, end);
614}
615#endif /* CONFIG_MEMORY_HOTREMOVE */
616#else
617static struct page *__kmalloc_section_memmap(void)
618{
619 struct page *page, *ret;
620 unsigned long memmap_size = sizeof(struct page) * PAGES_PER_SECTION;
621
622 page = alloc_pages(GFP_KERNEL|__GFP_NOWARN, get_order(memmap_size));
623 if (page)
624 goto got_map_page;
625
626 ret = vmalloc(memmap_size);
627 if (ret)
628 goto got_map_ptr;
629
630 return NULL;
631got_map_page:
632 ret = (struct page *)pfn_to_kaddr(page_to_pfn(page));
633got_map_ptr:
634
635 return ret;
636}
637
638static inline struct page *kmalloc_section_memmap(unsigned long pnum, int nid)
639{
640 return __kmalloc_section_memmap();
641}
642
643static void __kfree_section_memmap(struct page *memmap)
644{
645 if (is_vmalloc_addr(memmap))
646 vfree(memmap);
647 else
648 free_pages((unsigned long)memmap,
649 get_order(sizeof(struct page) * PAGES_PER_SECTION));
650}
651
652#ifdef CONFIG_MEMORY_HOTREMOVE
653static void free_map_bootmem(struct page *memmap)
654{
655 unsigned long maps_section_nr, removing_section_nr, i;
656 unsigned long magic, nr_pages;
657 struct page *page = virt_to_page(memmap);
658
659 nr_pages = PAGE_ALIGN(PAGES_PER_SECTION * sizeof(struct page))
660 >> PAGE_SHIFT;
661
662 for (i = 0; i < nr_pages; i++, page++) {
663 magic = (unsigned long) page->lru.next;
664
665 BUG_ON(magic == NODE_INFO);
666
667 maps_section_nr = pfn_to_section_nr(page_to_pfn(page));
668 removing_section_nr = page->private;
669
670 /*
671 * When this function is called, the removing section is
672 * logical offlined state. This means all pages are isolated
673 * from page allocator. If removing section's memmap is placed
674 * on the same section, it must not be freed.
675 * If it is freed, page allocator may allocate it which will
676 * be removed physically soon.
677 */
678 if (maps_section_nr != removing_section_nr)
679 put_page_bootmem(page);
680 }
681}
682#endif /* CONFIG_MEMORY_HOTREMOVE */
683#endif /* CONFIG_SPARSEMEM_VMEMMAP */
684
685/*
686 * returns the number of sections whose mem_maps were properly
687 * set. If this is <=0, then that means that the passed-in
688 * map was not consumed and must be freed.
689 */
690int __meminit sparse_add_one_section(struct zone *zone, unsigned long start_pfn)
691{
692 unsigned long section_nr = pfn_to_section_nr(start_pfn);
693 struct pglist_data *pgdat = zone->zone_pgdat;
694 struct mem_section *ms;
695 struct page *memmap;
696 unsigned long *usemap;
697 unsigned long flags;
698 int ret;
699
700 /*
701 * no locking for this, because it does its own
702 * plus, it does a kmalloc
703 */
704 ret = sparse_index_init(section_nr, pgdat->node_id);
705 if (ret < 0 && ret != -EEXIST)
706 return ret;
707 memmap = kmalloc_section_memmap(section_nr, pgdat->node_id);
708 if (!memmap)
709 return -ENOMEM;
710 usemap = __kmalloc_section_usemap();
711 if (!usemap) {
712 __kfree_section_memmap(memmap);
713 return -ENOMEM;
714 }
715
716 pgdat_resize_lock(pgdat, &flags);
717
718 ms = __pfn_to_section(start_pfn);
719 if (ms->section_mem_map & SECTION_MARKED_PRESENT) {
720 ret = -EEXIST;
721 goto out;
722 }
723
724 memset(memmap, 0, sizeof(struct page) * PAGES_PER_SECTION);
725
726 ms->section_mem_map |= SECTION_MARKED_PRESENT;
727
728 ret = sparse_init_one_section(ms, section_nr, memmap, usemap);
729
730out:
731 pgdat_resize_unlock(pgdat, &flags);
732 if (ret <= 0) {
733 kfree(usemap);
734 __kfree_section_memmap(memmap);
735 }
736 return ret;
737}
738
739#ifdef CONFIG_MEMORY_HOTREMOVE
740#ifdef CONFIG_MEMORY_FAILURE
741static void clear_hwpoisoned_pages(struct page *memmap, int nr_pages)
742{
743 int i;
744
745 if (!memmap)
746 return;
747
748 for (i = 0; i < nr_pages; i++) {
749 if (PageHWPoison(&memmap[i])) {
750 atomic_long_sub(1, &num_poisoned_pages);
751 ClearPageHWPoison(&memmap[i]);
752 }
753 }
754}
755#else
756static inline void clear_hwpoisoned_pages(struct page *memmap, int nr_pages)
757{
758}
759#endif
760
761static void free_section_usemap(struct page *memmap, unsigned long *usemap)
762{
763 struct page *usemap_page;
764
765 if (!usemap)
766 return;
767
768 usemap_page = virt_to_page(usemap);
769 /*
770 * Check to see if allocation came from hot-plug-add
771 */
772 if (PageSlab(usemap_page) || PageCompound(usemap_page)) {
773 kfree(usemap);
774 if (memmap)
775 __kfree_section_memmap(memmap);
776 return;
777 }
778
779 /*
780 * The usemap came from bootmem. This is packed with other usemaps
781 * on the section which has pgdat at boot time. Just keep it as is now.
782 */
783
784 if (memmap)
785 free_map_bootmem(memmap);
786}
787
788void sparse_remove_one_section(struct zone *zone, struct mem_section *ms,
789 unsigned long map_offset)
790{
791 struct page *memmap = NULL;
792 unsigned long *usemap = NULL, flags;
793 struct pglist_data *pgdat = zone->zone_pgdat;
794
795 pgdat_resize_lock(pgdat, &flags);
796 if (ms->section_mem_map) {
797 usemap = ms->pageblock_flags;
798 memmap = sparse_decode_mem_map(ms->section_mem_map,
799 __section_nr(ms));
800 ms->section_mem_map = 0;
801 ms->pageblock_flags = NULL;
802 }
803 pgdat_resize_unlock(pgdat, &flags);
804
805 clear_hwpoisoned_pages(memmap + map_offset,
806 PAGES_PER_SECTION - map_offset);
807 free_section_usemap(memmap, usemap);
808}
809#endif /* CONFIG_MEMORY_HOTREMOVE */
810#endif /* CONFIG_MEMORY_HOTPLUG */
1/*
2 * sparse memory mappings.
3 */
4#include <linux/mm.h>
5#include <linux/slab.h>
6#include <linux/mmzone.h>
7#include <linux/bootmem.h>
8#include <linux/highmem.h>
9#include <linux/export.h>
10#include <linux/spinlock.h>
11#include <linux/vmalloc.h>
12#include "internal.h"
13#include <asm/dma.h>
14#include <asm/pgalloc.h>
15#include <asm/pgtable.h>
16
17/*
18 * Permanent SPARSEMEM data:
19 *
20 * 1) mem_section - memory sections, mem_map's for valid memory
21 */
22#ifdef CONFIG_SPARSEMEM_EXTREME
23struct mem_section *mem_section[NR_SECTION_ROOTS]
24 ____cacheline_internodealigned_in_smp;
25#else
26struct mem_section mem_section[NR_SECTION_ROOTS][SECTIONS_PER_ROOT]
27 ____cacheline_internodealigned_in_smp;
28#endif
29EXPORT_SYMBOL(mem_section);
30
31#ifdef NODE_NOT_IN_PAGE_FLAGS
32/*
33 * If we did not store the node number in the page then we have to
34 * do a lookup in the section_to_node_table in order to find which
35 * node the page belongs to.
36 */
37#if MAX_NUMNODES <= 256
38static u8 section_to_node_table[NR_MEM_SECTIONS] __cacheline_aligned;
39#else
40static u16 section_to_node_table[NR_MEM_SECTIONS] __cacheline_aligned;
41#endif
42
43int page_to_nid(const struct page *page)
44{
45 return section_to_node_table[page_to_section(page)];
46}
47EXPORT_SYMBOL(page_to_nid);
48
49static void set_section_nid(unsigned long section_nr, int nid)
50{
51 section_to_node_table[section_nr] = nid;
52}
53#else /* !NODE_NOT_IN_PAGE_FLAGS */
54static inline void set_section_nid(unsigned long section_nr, int nid)
55{
56}
57#endif
58
59#ifdef CONFIG_SPARSEMEM_EXTREME
60static struct mem_section noinline __init_refok *sparse_index_alloc(int nid)
61{
62 struct mem_section *section = NULL;
63 unsigned long array_size = SECTIONS_PER_ROOT *
64 sizeof(struct mem_section);
65
66 if (slab_is_available()) {
67 if (node_state(nid, N_HIGH_MEMORY))
68 section = kmalloc_node(array_size, GFP_KERNEL, nid);
69 else
70 section = kmalloc(array_size, GFP_KERNEL);
71 } else
72 section = alloc_bootmem_node(NODE_DATA(nid), array_size);
73
74 if (section)
75 memset(section, 0, array_size);
76
77 return section;
78}
79
80static int __meminit sparse_index_init(unsigned long section_nr, int nid)
81{
82 static DEFINE_SPINLOCK(index_init_lock);
83 unsigned long root = SECTION_NR_TO_ROOT(section_nr);
84 struct mem_section *section;
85 int ret = 0;
86
87 if (mem_section[root])
88 return -EEXIST;
89
90 section = sparse_index_alloc(nid);
91 if (!section)
92 return -ENOMEM;
93 /*
94 * This lock keeps two different sections from
95 * reallocating for the same index
96 */
97 spin_lock(&index_init_lock);
98
99 if (mem_section[root]) {
100 ret = -EEXIST;
101 goto out;
102 }
103
104 mem_section[root] = section;
105out:
106 spin_unlock(&index_init_lock);
107 return ret;
108}
109#else /* !SPARSEMEM_EXTREME */
110static inline int sparse_index_init(unsigned long section_nr, int nid)
111{
112 return 0;
113}
114#endif
115
116/*
117 * Although written for the SPARSEMEM_EXTREME case, this happens
118 * to also work for the flat array case because
119 * NR_SECTION_ROOTS==NR_MEM_SECTIONS.
120 */
121int __section_nr(struct mem_section* ms)
122{
123 unsigned long root_nr;
124 struct mem_section* root;
125
126 for (root_nr = 0; root_nr < NR_SECTION_ROOTS; root_nr++) {
127 root = __nr_to_section(root_nr * SECTIONS_PER_ROOT);
128 if (!root)
129 continue;
130
131 if ((ms >= root) && (ms < (root + SECTIONS_PER_ROOT)))
132 break;
133 }
134
135 return (root_nr * SECTIONS_PER_ROOT) + (ms - root);
136}
137
138/*
139 * During early boot, before section_mem_map is used for an actual
140 * mem_map, we use section_mem_map to store the section's NUMA
141 * node. This keeps us from having to use another data structure. The
142 * node information is cleared just before we store the real mem_map.
143 */
144static inline unsigned long sparse_encode_early_nid(int nid)
145{
146 return (nid << SECTION_NID_SHIFT);
147}
148
149static inline int sparse_early_nid(struct mem_section *section)
150{
151 return (section->section_mem_map >> SECTION_NID_SHIFT);
152}
153
154/* Validate the physical addressing limitations of the model */
155void __meminit mminit_validate_memmodel_limits(unsigned long *start_pfn,
156 unsigned long *end_pfn)
157{
158 unsigned long max_sparsemem_pfn = 1UL << (MAX_PHYSMEM_BITS-PAGE_SHIFT);
159
160 /*
161 * Sanity checks - do not allow an architecture to pass
162 * in larger pfns than the maximum scope of sparsemem:
163 */
164 if (*start_pfn > max_sparsemem_pfn) {
165 mminit_dprintk(MMINIT_WARNING, "pfnvalidation",
166 "Start of range %lu -> %lu exceeds SPARSEMEM max %lu\n",
167 *start_pfn, *end_pfn, max_sparsemem_pfn);
168 WARN_ON_ONCE(1);
169 *start_pfn = max_sparsemem_pfn;
170 *end_pfn = max_sparsemem_pfn;
171 } else if (*end_pfn > max_sparsemem_pfn) {
172 mminit_dprintk(MMINIT_WARNING, "pfnvalidation",
173 "End of range %lu -> %lu exceeds SPARSEMEM max %lu\n",
174 *start_pfn, *end_pfn, max_sparsemem_pfn);
175 WARN_ON_ONCE(1);
176 *end_pfn = max_sparsemem_pfn;
177 }
178}
179
180/* Record a memory area against a node. */
181void __init memory_present(int nid, unsigned long start, unsigned long end)
182{
183 unsigned long pfn;
184
185 start &= PAGE_SECTION_MASK;
186 mminit_validate_memmodel_limits(&start, &end);
187 for (pfn = start; pfn < end; pfn += PAGES_PER_SECTION) {
188 unsigned long section = pfn_to_section_nr(pfn);
189 struct mem_section *ms;
190
191 sparse_index_init(section, nid);
192 set_section_nid(section, nid);
193
194 ms = __nr_to_section(section);
195 if (!ms->section_mem_map)
196 ms->section_mem_map = sparse_encode_early_nid(nid) |
197 SECTION_MARKED_PRESENT;
198 }
199}
200
201/*
202 * Only used by the i386 NUMA architecures, but relatively
203 * generic code.
204 */
205unsigned long __init node_memmap_size_bytes(int nid, unsigned long start_pfn,
206 unsigned long end_pfn)
207{
208 unsigned long pfn;
209 unsigned long nr_pages = 0;
210
211 mminit_validate_memmodel_limits(&start_pfn, &end_pfn);
212 for (pfn = start_pfn; pfn < end_pfn; pfn += PAGES_PER_SECTION) {
213 if (nid != early_pfn_to_nid(pfn))
214 continue;
215
216 if (pfn_present(pfn))
217 nr_pages += PAGES_PER_SECTION;
218 }
219
220 return nr_pages * sizeof(struct page);
221}
222
223/*
224 * Subtle, we encode the real pfn into the mem_map such that
225 * the identity pfn - section_mem_map will return the actual
226 * physical page frame number.
227 */
228static unsigned long sparse_encode_mem_map(struct page *mem_map, unsigned long pnum)
229{
230 return (unsigned long)(mem_map - (section_nr_to_pfn(pnum)));
231}
232
233/*
234 * Decode mem_map from the coded memmap
235 */
236struct page *sparse_decode_mem_map(unsigned long coded_mem_map, unsigned long pnum)
237{
238 /* mask off the extra low bits of information */
239 coded_mem_map &= SECTION_MAP_MASK;
240 return ((struct page *)coded_mem_map) + section_nr_to_pfn(pnum);
241}
242
243static int __meminit sparse_init_one_section(struct mem_section *ms,
244 unsigned long pnum, struct page *mem_map,
245 unsigned long *pageblock_bitmap)
246{
247 if (!present_section(ms))
248 return -EINVAL;
249
250 ms->section_mem_map &= ~SECTION_MAP_MASK;
251 ms->section_mem_map |= sparse_encode_mem_map(mem_map, pnum) |
252 SECTION_HAS_MEM_MAP;
253 ms->pageblock_flags = pageblock_bitmap;
254
255 return 1;
256}
257
258unsigned long usemap_size(void)
259{
260 unsigned long size_bytes;
261 size_bytes = roundup(SECTION_BLOCKFLAGS_BITS, 8) / 8;
262 size_bytes = roundup(size_bytes, sizeof(unsigned long));
263 return size_bytes;
264}
265
266#ifdef CONFIG_MEMORY_HOTPLUG
267static unsigned long *__kmalloc_section_usemap(void)
268{
269 return kmalloc(usemap_size(), GFP_KERNEL);
270}
271#endif /* CONFIG_MEMORY_HOTPLUG */
272
273#ifdef CONFIG_MEMORY_HOTREMOVE
274static unsigned long * __init
275sparse_early_usemaps_alloc_pgdat_section(struct pglist_data *pgdat,
276 unsigned long size)
277{
278 unsigned long goal, limit;
279 unsigned long *p;
280 int nid;
281 /*
282 * A page may contain usemaps for other sections preventing the
283 * page being freed and making a section unremovable while
284 * other sections referencing the usemap retmain active. Similarly,
285 * a pgdat can prevent a section being removed. If section A
286 * contains a pgdat and section B contains the usemap, both
287 * sections become inter-dependent. This allocates usemaps
288 * from the same section as the pgdat where possible to avoid
289 * this problem.
290 */
291 goal = __pa(pgdat) & (PAGE_SECTION_MASK << PAGE_SHIFT);
292 limit = goal + (1UL << PA_SECTION_SHIFT);
293 nid = early_pfn_to_nid(goal >> PAGE_SHIFT);
294again:
295 p = ___alloc_bootmem_node_nopanic(NODE_DATA(nid), size,
296 SMP_CACHE_BYTES, goal, limit);
297 if (!p && limit) {
298 limit = 0;
299 goto again;
300 }
301 return p;
302}
303
304static void __init check_usemap_section_nr(int nid, unsigned long *usemap)
305{
306 unsigned long usemap_snr, pgdat_snr;
307 static unsigned long old_usemap_snr = NR_MEM_SECTIONS;
308 static unsigned long old_pgdat_snr = NR_MEM_SECTIONS;
309 struct pglist_data *pgdat = NODE_DATA(nid);
310 int usemap_nid;
311
312 usemap_snr = pfn_to_section_nr(__pa(usemap) >> PAGE_SHIFT);
313 pgdat_snr = pfn_to_section_nr(__pa(pgdat) >> PAGE_SHIFT);
314 if (usemap_snr == pgdat_snr)
315 return;
316
317 if (old_usemap_snr == usemap_snr && old_pgdat_snr == pgdat_snr)
318 /* skip redundant message */
319 return;
320
321 old_usemap_snr = usemap_snr;
322 old_pgdat_snr = pgdat_snr;
323
324 usemap_nid = sparse_early_nid(__nr_to_section(usemap_snr));
325 if (usemap_nid != nid) {
326 printk(KERN_INFO
327 "node %d must be removed before remove section %ld\n",
328 nid, usemap_snr);
329 return;
330 }
331 /*
332 * There is a circular dependency.
333 * Some platforms allow un-removable section because they will just
334 * gather other removable sections for dynamic partitioning.
335 * Just notify un-removable section's number here.
336 */
337 printk(KERN_INFO "Section %ld and %ld (node %d)", usemap_snr,
338 pgdat_snr, nid);
339 printk(KERN_CONT
340 " have a circular dependency on usemap and pgdat allocations\n");
341}
342#else
343static unsigned long * __init
344sparse_early_usemaps_alloc_pgdat_section(struct pglist_data *pgdat,
345 unsigned long size)
346{
347 return alloc_bootmem_node_nopanic(pgdat, size);
348}
349
350static void __init check_usemap_section_nr(int nid, unsigned long *usemap)
351{
352}
353#endif /* CONFIG_MEMORY_HOTREMOVE */
354
355static void __init sparse_early_usemaps_alloc_node(unsigned long**usemap_map,
356 unsigned long pnum_begin,
357 unsigned long pnum_end,
358 unsigned long usemap_count, int nodeid)
359{
360 void *usemap;
361 unsigned long pnum;
362 int size = usemap_size();
363
364 usemap = sparse_early_usemaps_alloc_pgdat_section(NODE_DATA(nodeid),
365 size * usemap_count);
366 if (!usemap) {
367 printk(KERN_WARNING "%s: allocation failed\n", __func__);
368 return;
369 }
370
371 for (pnum = pnum_begin; pnum < pnum_end; pnum++) {
372 if (!present_section_nr(pnum))
373 continue;
374 usemap_map[pnum] = usemap;
375 usemap += size;
376 check_usemap_section_nr(nodeid, usemap_map[pnum]);
377 }
378}
379
380#ifndef CONFIG_SPARSEMEM_VMEMMAP
381struct page __init *sparse_mem_map_populate(unsigned long pnum, int nid)
382{
383 struct page *map;
384 unsigned long size;
385
386 map = alloc_remap(nid, sizeof(struct page) * PAGES_PER_SECTION);
387 if (map)
388 return map;
389
390 size = PAGE_ALIGN(sizeof(struct page) * PAGES_PER_SECTION);
391 map = __alloc_bootmem_node_high(NODE_DATA(nid), size,
392 PAGE_SIZE, __pa(MAX_DMA_ADDRESS));
393 return map;
394}
395void __init sparse_mem_maps_populate_node(struct page **map_map,
396 unsigned long pnum_begin,
397 unsigned long pnum_end,
398 unsigned long map_count, int nodeid)
399{
400 void *map;
401 unsigned long pnum;
402 unsigned long size = sizeof(struct page) * PAGES_PER_SECTION;
403
404 map = alloc_remap(nodeid, size * map_count);
405 if (map) {
406 for (pnum = pnum_begin; pnum < pnum_end; pnum++) {
407 if (!present_section_nr(pnum))
408 continue;
409 map_map[pnum] = map;
410 map += size;
411 }
412 return;
413 }
414
415 size = PAGE_ALIGN(size);
416 map = __alloc_bootmem_node_high(NODE_DATA(nodeid), size * map_count,
417 PAGE_SIZE, __pa(MAX_DMA_ADDRESS));
418 if (map) {
419 for (pnum = pnum_begin; pnum < pnum_end; pnum++) {
420 if (!present_section_nr(pnum))
421 continue;
422 map_map[pnum] = map;
423 map += size;
424 }
425 return;
426 }
427
428 /* fallback */
429 for (pnum = pnum_begin; pnum < pnum_end; pnum++) {
430 struct mem_section *ms;
431
432 if (!present_section_nr(pnum))
433 continue;
434 map_map[pnum] = sparse_mem_map_populate(pnum, nodeid);
435 if (map_map[pnum])
436 continue;
437 ms = __nr_to_section(pnum);
438 printk(KERN_ERR "%s: sparsemem memory map backing failed "
439 "some memory will not be available.\n", __func__);
440 ms->section_mem_map = 0;
441 }
442}
443#endif /* !CONFIG_SPARSEMEM_VMEMMAP */
444
445#ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER
446static void __init sparse_early_mem_maps_alloc_node(struct page **map_map,
447 unsigned long pnum_begin,
448 unsigned long pnum_end,
449 unsigned long map_count, int nodeid)
450{
451 sparse_mem_maps_populate_node(map_map, pnum_begin, pnum_end,
452 map_count, nodeid);
453}
454#else
455static struct page __init *sparse_early_mem_map_alloc(unsigned long pnum)
456{
457 struct page *map;
458 struct mem_section *ms = __nr_to_section(pnum);
459 int nid = sparse_early_nid(ms);
460
461 map = sparse_mem_map_populate(pnum, nid);
462 if (map)
463 return map;
464
465 printk(KERN_ERR "%s: sparsemem memory map backing failed "
466 "some memory will not be available.\n", __func__);
467 ms->section_mem_map = 0;
468 return NULL;
469}
470#endif
471
472void __attribute__((weak)) __meminit vmemmap_populate_print_last(void)
473{
474}
475
476/*
477 * Allocate the accumulated non-linear sections, allocate a mem_map
478 * for each and record the physical to section mapping.
479 */
480void __init sparse_init(void)
481{
482 unsigned long pnum;
483 struct page *map;
484 unsigned long *usemap;
485 unsigned long **usemap_map;
486 int size;
487 int nodeid_begin = 0;
488 unsigned long pnum_begin = 0;
489 unsigned long usemap_count;
490#ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER
491 unsigned long map_count;
492 int size2;
493 struct page **map_map;
494#endif
495
496 /* Setup pageblock_order for HUGETLB_PAGE_SIZE_VARIABLE */
497 set_pageblock_order();
498
499 /*
500 * map is using big page (aka 2M in x86 64 bit)
501 * usemap is less one page (aka 24 bytes)
502 * so alloc 2M (with 2M align) and 24 bytes in turn will
503 * make next 2M slip to one more 2M later.
504 * then in big system, the memory will have a lot of holes...
505 * here try to allocate 2M pages continuously.
506 *
507 * powerpc need to call sparse_init_one_section right after each
508 * sparse_early_mem_map_alloc, so allocate usemap_map at first.
509 */
510 size = sizeof(unsigned long *) * NR_MEM_SECTIONS;
511 usemap_map = alloc_bootmem(size);
512 if (!usemap_map)
513 panic("can not allocate usemap_map\n");
514
515 for (pnum = 0; pnum < NR_MEM_SECTIONS; pnum++) {
516 struct mem_section *ms;
517
518 if (!present_section_nr(pnum))
519 continue;
520 ms = __nr_to_section(pnum);
521 nodeid_begin = sparse_early_nid(ms);
522 pnum_begin = pnum;
523 break;
524 }
525 usemap_count = 1;
526 for (pnum = pnum_begin + 1; pnum < NR_MEM_SECTIONS; pnum++) {
527 struct mem_section *ms;
528 int nodeid;
529
530 if (!present_section_nr(pnum))
531 continue;
532 ms = __nr_to_section(pnum);
533 nodeid = sparse_early_nid(ms);
534 if (nodeid == nodeid_begin) {
535 usemap_count++;
536 continue;
537 }
538 /* ok, we need to take cake of from pnum_begin to pnum - 1*/
539 sparse_early_usemaps_alloc_node(usemap_map, pnum_begin, pnum,
540 usemap_count, nodeid_begin);
541 /* new start, update count etc*/
542 nodeid_begin = nodeid;
543 pnum_begin = pnum;
544 usemap_count = 1;
545 }
546 /* ok, last chunk */
547 sparse_early_usemaps_alloc_node(usemap_map, pnum_begin, NR_MEM_SECTIONS,
548 usemap_count, nodeid_begin);
549
550#ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER
551 size2 = sizeof(struct page *) * NR_MEM_SECTIONS;
552 map_map = alloc_bootmem(size2);
553 if (!map_map)
554 panic("can not allocate map_map\n");
555
556 for (pnum = 0; pnum < NR_MEM_SECTIONS; pnum++) {
557 struct mem_section *ms;
558
559 if (!present_section_nr(pnum))
560 continue;
561 ms = __nr_to_section(pnum);
562 nodeid_begin = sparse_early_nid(ms);
563 pnum_begin = pnum;
564 break;
565 }
566 map_count = 1;
567 for (pnum = pnum_begin + 1; pnum < NR_MEM_SECTIONS; pnum++) {
568 struct mem_section *ms;
569 int nodeid;
570
571 if (!present_section_nr(pnum))
572 continue;
573 ms = __nr_to_section(pnum);
574 nodeid = sparse_early_nid(ms);
575 if (nodeid == nodeid_begin) {
576 map_count++;
577 continue;
578 }
579 /* ok, we need to take cake of from pnum_begin to pnum - 1*/
580 sparse_early_mem_maps_alloc_node(map_map, pnum_begin, pnum,
581 map_count, nodeid_begin);
582 /* new start, update count etc*/
583 nodeid_begin = nodeid;
584 pnum_begin = pnum;
585 map_count = 1;
586 }
587 /* ok, last chunk */
588 sparse_early_mem_maps_alloc_node(map_map, pnum_begin, NR_MEM_SECTIONS,
589 map_count, nodeid_begin);
590#endif
591
592 for (pnum = 0; pnum < NR_MEM_SECTIONS; pnum++) {
593 if (!present_section_nr(pnum))
594 continue;
595
596 usemap = usemap_map[pnum];
597 if (!usemap)
598 continue;
599
600#ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER
601 map = map_map[pnum];
602#else
603 map = sparse_early_mem_map_alloc(pnum);
604#endif
605 if (!map)
606 continue;
607
608 sparse_init_one_section(__nr_to_section(pnum), pnum, map,
609 usemap);
610 }
611
612 vmemmap_populate_print_last();
613
614#ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER
615 free_bootmem(__pa(map_map), size2);
616#endif
617 free_bootmem(__pa(usemap_map), size);
618}
619
620#ifdef CONFIG_MEMORY_HOTPLUG
621#ifdef CONFIG_SPARSEMEM_VMEMMAP
622static inline struct page *kmalloc_section_memmap(unsigned long pnum, int nid,
623 unsigned long nr_pages)
624{
625 /* This will make the necessary allocations eventually. */
626 return sparse_mem_map_populate(pnum, nid);
627}
628static void __kfree_section_memmap(struct page *memmap, unsigned long nr_pages)
629{
630 return; /* XXX: Not implemented yet */
631}
632static void free_map_bootmem(struct page *page, unsigned long nr_pages)
633{
634}
635#else
636static struct page *__kmalloc_section_memmap(unsigned long nr_pages)
637{
638 struct page *page, *ret;
639 unsigned long memmap_size = sizeof(struct page) * nr_pages;
640
641 page = alloc_pages(GFP_KERNEL|__GFP_NOWARN, get_order(memmap_size));
642 if (page)
643 goto got_map_page;
644
645 ret = vmalloc(memmap_size);
646 if (ret)
647 goto got_map_ptr;
648
649 return NULL;
650got_map_page:
651 ret = (struct page *)pfn_to_kaddr(page_to_pfn(page));
652got_map_ptr:
653 memset(ret, 0, memmap_size);
654
655 return ret;
656}
657
658static inline struct page *kmalloc_section_memmap(unsigned long pnum, int nid,
659 unsigned long nr_pages)
660{
661 return __kmalloc_section_memmap(nr_pages);
662}
663
664static void __kfree_section_memmap(struct page *memmap, unsigned long nr_pages)
665{
666 if (is_vmalloc_addr(memmap))
667 vfree(memmap);
668 else
669 free_pages((unsigned long)memmap,
670 get_order(sizeof(struct page) * nr_pages));
671}
672
673static void free_map_bootmem(struct page *page, unsigned long nr_pages)
674{
675 unsigned long maps_section_nr, removing_section_nr, i;
676 unsigned long magic;
677
678 for (i = 0; i < nr_pages; i++, page++) {
679 magic = (unsigned long) page->lru.next;
680
681 BUG_ON(magic == NODE_INFO);
682
683 maps_section_nr = pfn_to_section_nr(page_to_pfn(page));
684 removing_section_nr = page->private;
685
686 /*
687 * When this function is called, the removing section is
688 * logical offlined state. This means all pages are isolated
689 * from page allocator. If removing section's memmap is placed
690 * on the same section, it must not be freed.
691 * If it is freed, page allocator may allocate it which will
692 * be removed physically soon.
693 */
694 if (maps_section_nr != removing_section_nr)
695 put_page_bootmem(page);
696 }
697}
698#endif /* CONFIG_SPARSEMEM_VMEMMAP */
699
700static void free_section_usemap(struct page *memmap, unsigned long *usemap)
701{
702 struct page *usemap_page;
703 unsigned long nr_pages;
704
705 if (!usemap)
706 return;
707
708 usemap_page = virt_to_page(usemap);
709 /*
710 * Check to see if allocation came from hot-plug-add
711 */
712 if (PageSlab(usemap_page)) {
713 kfree(usemap);
714 if (memmap)
715 __kfree_section_memmap(memmap, PAGES_PER_SECTION);
716 return;
717 }
718
719 /*
720 * The usemap came from bootmem. This is packed with other usemaps
721 * on the section which has pgdat at boot time. Just keep it as is now.
722 */
723
724 if (memmap) {
725 struct page *memmap_page;
726 memmap_page = virt_to_page(memmap);
727
728 nr_pages = PAGE_ALIGN(PAGES_PER_SECTION * sizeof(struct page))
729 >> PAGE_SHIFT;
730
731 free_map_bootmem(memmap_page, nr_pages);
732 }
733}
734
735/*
736 * returns the number of sections whose mem_maps were properly
737 * set. If this is <=0, then that means that the passed-in
738 * map was not consumed and must be freed.
739 */
740int __meminit sparse_add_one_section(struct zone *zone, unsigned long start_pfn,
741 int nr_pages)
742{
743 unsigned long section_nr = pfn_to_section_nr(start_pfn);
744 struct pglist_data *pgdat = zone->zone_pgdat;
745 struct mem_section *ms;
746 struct page *memmap;
747 unsigned long *usemap;
748 unsigned long flags;
749 int ret;
750
751 /*
752 * no locking for this, because it does its own
753 * plus, it does a kmalloc
754 */
755 ret = sparse_index_init(section_nr, pgdat->node_id);
756 if (ret < 0 && ret != -EEXIST)
757 return ret;
758 memmap = kmalloc_section_memmap(section_nr, pgdat->node_id, nr_pages);
759 if (!memmap)
760 return -ENOMEM;
761 usemap = __kmalloc_section_usemap();
762 if (!usemap) {
763 __kfree_section_memmap(memmap, nr_pages);
764 return -ENOMEM;
765 }
766
767 pgdat_resize_lock(pgdat, &flags);
768
769 ms = __pfn_to_section(start_pfn);
770 if (ms->section_mem_map & SECTION_MARKED_PRESENT) {
771 ret = -EEXIST;
772 goto out;
773 }
774
775 ms->section_mem_map |= SECTION_MARKED_PRESENT;
776
777 ret = sparse_init_one_section(ms, section_nr, memmap, usemap);
778
779out:
780 pgdat_resize_unlock(pgdat, &flags);
781 if (ret <= 0) {
782 kfree(usemap);
783 __kfree_section_memmap(memmap, nr_pages);
784 }
785 return ret;
786}
787
788void sparse_remove_one_section(struct zone *zone, struct mem_section *ms)
789{
790 struct page *memmap = NULL;
791 unsigned long *usemap = NULL;
792
793 if (ms->section_mem_map) {
794 usemap = ms->pageblock_flags;
795 memmap = sparse_decode_mem_map(ms->section_mem_map,
796 __section_nr(ms));
797 ms->section_mem_map = 0;
798 ms->pageblock_flags = NULL;
799 }
800
801 free_section_usemap(memmap, usemap);
802}
803#endif