]> git.ipfire.org Git - thirdparty/kernel/stable.git/blame - mm/sparse.c
x86/irq/64: Print the offending IP in the stack overflow warning
[thirdparty/kernel/stable.git] / mm / sparse.c
CommitLineData
b2441318 1// SPDX-License-Identifier: GPL-2.0
d41dee36
AW
2/*
3 * sparse memory mappings.
4 */
d41dee36 5#include <linux/mm.h>
5a0e3ad6 6#include <linux/slab.h>
d41dee36
AW
7#include <linux/mmzone.h>
8#include <linux/bootmem.h>
3b32123d 9#include <linux/compiler.h>
0b0acbec 10#include <linux/highmem.h>
b95f1b31 11#include <linux/export.h>
28ae55c9 12#include <linux/spinlock.h>
0b0acbec 13#include <linux/vmalloc.h>
3b32123d 14
0c0a4a51 15#include "internal.h"
d41dee36 16#include <asm/dma.h>
8f6aac41
CL
17#include <asm/pgalloc.h>
18#include <asm/pgtable.h>
d41dee36
AW
19
20/*
21 * Permanent SPARSEMEM data:
22 *
23 * 1) mem_section - memory sections, mem_map's for valid memory
24 */
3e347261 25#ifdef CONFIG_SPARSEMEM_EXTREME
83e3c487 26struct mem_section **mem_section;
3e347261
BP
27#else
28struct mem_section mem_section[NR_SECTION_ROOTS][SECTIONS_PER_ROOT]
22fc6ecc 29 ____cacheline_internodealigned_in_smp;
3e347261
BP
30#endif
31EXPORT_SYMBOL(mem_section);
32
89689ae7
CL
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
33dd4e0e 45int page_to_nid(const struct page *page)
89689ae7
CL
46{
47 return section_to_node_table[page_to_section(page)];
48}
49EXPORT_SYMBOL(page_to_nid);
85770ffe
AW
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}
89689ae7
CL
59#endif
60
3e347261 61#ifdef CONFIG_SPARSEMEM_EXTREME
bd721ea7 62static noinline struct mem_section __ref *sparse_index_alloc(int nid)
28ae55c9
DH
63{
64 struct mem_section *section = NULL;
65 unsigned long array_size = SECTIONS_PER_ROOT *
66 sizeof(struct mem_section);
67
b95046b0
MH
68 if (slab_is_available())
69 section = kzalloc_node(array_size, GFP_KERNEL, nid);
70 else
bb016b84 71 section = memblock_virt_alloc_node(array_size, nid);
28ae55c9
DH
72
73 return section;
3e347261 74}
802f192e 75
a3142c8e 76static int __meminit sparse_index_init(unsigned long section_nr, int nid)
802f192e 77{
28ae55c9
DH
78 unsigned long root = SECTION_NR_TO_ROOT(section_nr);
79 struct mem_section *section;
802f192e
BP
80
81 if (mem_section[root])
28ae55c9 82 return -EEXIST;
3e347261 83
28ae55c9 84 section = sparse_index_alloc(nid);
af0cd5a7
WC
85 if (!section)
86 return -ENOMEM;
28ae55c9
DH
87
88 mem_section[root] = section;
c1c95183 89
9d1936cf 90 return 0;
28ae55c9
DH
91}
92#else /* !SPARSEMEM_EXTREME */
93static inline int sparse_index_init(unsigned long section_nr, int nid)
94{
95 return 0;
802f192e 96}
28ae55c9
DH
97#endif
98
91fd8b95 99#ifdef CONFIG_SPARSEMEM_EXTREME
4ca644d9
DH
100int __section_nr(struct mem_section* ms)
101{
102 unsigned long root_nr;
83e3c487 103 struct mem_section *root = NULL;
4ca644d9 104
12783b00
MK
105 for (root_nr = 0; root_nr < NR_SECTION_ROOTS; root_nr++) {
106 root = __nr_to_section(root_nr * SECTIONS_PER_ROOT);
4ca644d9
DH
107 if (!root)
108 continue;
109
110 if ((ms >= root) && (ms < (root + SECTIONS_PER_ROOT)))
111 break;
112 }
113
83e3c487 114 VM_BUG_ON(!root);
db36a461 115
4ca644d9
DH
116 return (root_nr * SECTIONS_PER_ROOT) + (ms - root);
117}
91fd8b95
ZC
118#else
119int __section_nr(struct mem_section* ms)
120{
121 return (int)(ms - mem_section[0]);
122}
123#endif
4ca644d9 124
30c253e6
AW
125/*
126 * During early boot, before section_mem_map is used for an actual
127 * mem_map, we use section_mem_map to store the section's NUMA
128 * node. This keeps us from having to use another data structure. The
129 * node information is cleared just before we store the real mem_map.
130 */
131static inline unsigned long sparse_encode_early_nid(int nid)
132{
133 return (nid << SECTION_NID_SHIFT);
134}
135
136static inline int sparse_early_nid(struct mem_section *section)
137{
138 return (section->section_mem_map >> SECTION_NID_SHIFT);
139}
140
2dbb51c4
MG
141/* Validate the physical addressing limitations of the model */
142void __meminit mminit_validate_memmodel_limits(unsigned long *start_pfn,
143 unsigned long *end_pfn)
d41dee36 144{
2dbb51c4 145 unsigned long max_sparsemem_pfn = 1UL << (MAX_PHYSMEM_BITS-PAGE_SHIFT);
d41dee36 146
bead9a3a
IM
147 /*
148 * Sanity checks - do not allow an architecture to pass
149 * in larger pfns than the maximum scope of sparsemem:
150 */
2dbb51c4
MG
151 if (*start_pfn > max_sparsemem_pfn) {
152 mminit_dprintk(MMINIT_WARNING, "pfnvalidation",
153 "Start of range %lu -> %lu exceeds SPARSEMEM max %lu\n",
154 *start_pfn, *end_pfn, max_sparsemem_pfn);
155 WARN_ON_ONCE(1);
156 *start_pfn = max_sparsemem_pfn;
157 *end_pfn = max_sparsemem_pfn;
ef161a98 158 } else if (*end_pfn > max_sparsemem_pfn) {
2dbb51c4
MG
159 mminit_dprintk(MMINIT_WARNING, "pfnvalidation",
160 "End of range %lu -> %lu exceeds SPARSEMEM max %lu\n",
161 *start_pfn, *end_pfn, max_sparsemem_pfn);
162 WARN_ON_ONCE(1);
163 *end_pfn = max_sparsemem_pfn;
164 }
165}
166
c4e1be9e
DH
167/*
168 * There are a number of times that we loop over NR_MEM_SECTIONS,
169 * looking for section_present() on each. But, when we have very
170 * large physical address spaces, NR_MEM_SECTIONS can also be
171 * very large which makes the loops quite long.
172 *
173 * Keeping track of this gives us an easy way to break out of
174 * those loops early.
175 */
176int __highest_present_section_nr;
177static void section_mark_present(struct mem_section *ms)
178{
179 int section_nr = __section_nr(ms);
180
181 if (section_nr > __highest_present_section_nr)
182 __highest_present_section_nr = section_nr;
183
184 ms->section_mem_map |= SECTION_MARKED_PRESENT;
185}
186
187static inline int next_present_section_nr(int section_nr)
188{
189 do {
190 section_nr++;
191 if (present_section_nr(section_nr))
192 return section_nr;
193 } while ((section_nr < NR_MEM_SECTIONS) &&
194 (section_nr <= __highest_present_section_nr));
195
196 return -1;
197}
198#define for_each_present_section_nr(start, section_nr) \
199 for (section_nr = next_present_section_nr(start-1); \
200 ((section_nr >= 0) && \
201 (section_nr < NR_MEM_SECTIONS) && \
202 (section_nr <= __highest_present_section_nr)); \
203 section_nr = next_present_section_nr(section_nr))
204
2dbb51c4
MG
205/* Record a memory area against a node. */
206void __init memory_present(int nid, unsigned long start, unsigned long end)
207{
208 unsigned long pfn;
bead9a3a 209
d41dee36 210 start &= PAGE_SECTION_MASK;
2dbb51c4 211 mminit_validate_memmodel_limits(&start, &end);
d41dee36
AW
212 for (pfn = start; pfn < end; pfn += PAGES_PER_SECTION) {
213 unsigned long section = pfn_to_section_nr(pfn);
802f192e
BP
214 struct mem_section *ms;
215
216 sparse_index_init(section, nid);
85770ffe 217 set_section_nid(section, nid);
802f192e
BP
218
219 ms = __nr_to_section(section);
c4e1be9e 220 if (!ms->section_mem_map) {
2d070eab
MH
221 ms->section_mem_map = sparse_encode_early_nid(nid) |
222 SECTION_IS_ONLINE;
c4e1be9e
DH
223 section_mark_present(ms);
224 }
d41dee36
AW
225 }
226}
227
228/*
229 * Only used by the i386 NUMA architecures, but relatively
230 * generic code.
231 */
232unsigned long __init node_memmap_size_bytes(int nid, unsigned long start_pfn,
233 unsigned long end_pfn)
234{
235 unsigned long pfn;
236 unsigned long nr_pages = 0;
237
2dbb51c4 238 mminit_validate_memmodel_limits(&start_pfn, &end_pfn);
d41dee36
AW
239 for (pfn = start_pfn; pfn < end_pfn; pfn += PAGES_PER_SECTION) {
240 if (nid != early_pfn_to_nid(pfn))
241 continue;
242
540557b9 243 if (pfn_present(pfn))
d41dee36
AW
244 nr_pages += PAGES_PER_SECTION;
245 }
246
247 return nr_pages * sizeof(struct page);
248}
249
29751f69
AW
250/*
251 * Subtle, we encode the real pfn into the mem_map such that
252 * the identity pfn - section_mem_map will return the actual
253 * physical page frame number.
254 */
255static unsigned long sparse_encode_mem_map(struct page *mem_map, unsigned long pnum)
256{
257 return (unsigned long)(mem_map - (section_nr_to_pfn(pnum)));
258}
259
260/*
ea01ea93 261 * Decode mem_map from the coded memmap
29751f69 262 */
29751f69
AW
263struct page *sparse_decode_mem_map(unsigned long coded_mem_map, unsigned long pnum)
264{
ea01ea93
BP
265 /* mask off the extra low bits of information */
266 coded_mem_map &= SECTION_MAP_MASK;
29751f69
AW
267 return ((struct page *)coded_mem_map) + section_nr_to_pfn(pnum);
268}
269
a3142c8e 270static int __meminit sparse_init_one_section(struct mem_section *ms,
5c0e3066
MG
271 unsigned long pnum, struct page *mem_map,
272 unsigned long *pageblock_bitmap)
29751f69 273{
540557b9 274 if (!present_section(ms))
29751f69
AW
275 return -EINVAL;
276
30c253e6 277 ms->section_mem_map &= ~SECTION_MAP_MASK;
540557b9
AW
278 ms->section_mem_map |= sparse_encode_mem_map(mem_map, pnum) |
279 SECTION_HAS_MEM_MAP;
5c0e3066 280 ms->pageblock_flags = pageblock_bitmap;
29751f69
AW
281
282 return 1;
283}
284
04753278 285unsigned long usemap_size(void)
5c0e3066 286{
60a7a88d 287 return BITS_TO_LONGS(SECTION_BLOCKFLAGS_BITS) * sizeof(unsigned long);
5c0e3066
MG
288}
289
290#ifdef CONFIG_MEMORY_HOTPLUG
291static unsigned long *__kmalloc_section_usemap(void)
292{
293 return kmalloc(usemap_size(), GFP_KERNEL);
294}
295#endif /* CONFIG_MEMORY_HOTPLUG */
296
48c90682
YG
297#ifdef CONFIG_MEMORY_HOTREMOVE
298static unsigned long * __init
a4322e1b 299sparse_early_usemaps_alloc_pgdat_section(struct pglist_data *pgdat,
238305bb 300 unsigned long size)
48c90682 301{
99ab7b19
YL
302 unsigned long goal, limit;
303 unsigned long *p;
304 int nid;
48c90682
YG
305 /*
306 * A page may contain usemaps for other sections preventing the
307 * page being freed and making a section unremovable while
c800bcd5 308 * other sections referencing the usemap remain active. Similarly,
48c90682
YG
309 * a pgdat can prevent a section being removed. If section A
310 * contains a pgdat and section B contains the usemap, both
311 * sections become inter-dependent. This allocates usemaps
312 * from the same section as the pgdat where possible to avoid
313 * this problem.
314 */
07b4e2bc 315 goal = __pa(pgdat) & (PAGE_SECTION_MASK << PAGE_SHIFT);
99ab7b19
YL
316 limit = goal + (1UL << PA_SECTION_SHIFT);
317 nid = early_pfn_to_nid(goal >> PAGE_SHIFT);
318again:
bb016b84
SS
319 p = memblock_virt_alloc_try_nid_nopanic(size,
320 SMP_CACHE_BYTES, goal, limit,
321 nid);
99ab7b19
YL
322 if (!p && limit) {
323 limit = 0;
324 goto again;
325 }
326 return p;
48c90682
YG
327}
328
329static void __init check_usemap_section_nr(int nid, unsigned long *usemap)
330{
331 unsigned long usemap_snr, pgdat_snr;
83e3c487
KS
332 static unsigned long old_usemap_snr;
333 static unsigned long old_pgdat_snr;
48c90682
YG
334 struct pglist_data *pgdat = NODE_DATA(nid);
335 int usemap_nid;
336
83e3c487
KS
337 /* First call */
338 if (!old_usemap_snr) {
339 old_usemap_snr = NR_MEM_SECTIONS;
340 old_pgdat_snr = NR_MEM_SECTIONS;
341 }
342
48c90682
YG
343 usemap_snr = pfn_to_section_nr(__pa(usemap) >> PAGE_SHIFT);
344 pgdat_snr = pfn_to_section_nr(__pa(pgdat) >> PAGE_SHIFT);
345 if (usemap_snr == pgdat_snr)
346 return;
347
348 if (old_usemap_snr == usemap_snr && old_pgdat_snr == pgdat_snr)
349 /* skip redundant message */
350 return;
351
352 old_usemap_snr = usemap_snr;
353 old_pgdat_snr = pgdat_snr;
354
355 usemap_nid = sparse_early_nid(__nr_to_section(usemap_snr));
356 if (usemap_nid != nid) {
1170532b
JP
357 pr_info("node %d must be removed before remove section %ld\n",
358 nid, usemap_snr);
48c90682
YG
359 return;
360 }
361 /*
362 * There is a circular dependency.
363 * Some platforms allow un-removable section because they will just
364 * gather other removable sections for dynamic partitioning.
365 * Just notify un-removable section's number here.
366 */
1170532b
JP
367 pr_info("Section %ld and %ld (node %d) have a circular dependency on usemap and pgdat allocations\n",
368 usemap_snr, pgdat_snr, nid);
48c90682
YG
369}
370#else
371static unsigned long * __init
a4322e1b 372sparse_early_usemaps_alloc_pgdat_section(struct pglist_data *pgdat,
238305bb 373 unsigned long size)
48c90682 374{
bb016b84 375 return memblock_virt_alloc_node_nopanic(size, pgdat->node_id);
48c90682
YG
376}
377
378static void __init check_usemap_section_nr(int nid, unsigned long *usemap)
379{
380}
381#endif /* CONFIG_MEMORY_HOTREMOVE */
382
18732093 383static void __init sparse_early_usemaps_alloc_node(void *data,
a4322e1b
YL
384 unsigned long pnum_begin,
385 unsigned long pnum_end,
386 unsigned long usemap_count, int nodeid)
5c0e3066 387{
a4322e1b
YL
388 void *usemap;
389 unsigned long pnum;
18732093 390 unsigned long **usemap_map = (unsigned long **)data;
a4322e1b 391 int size = usemap_size();
5c0e3066 392
a4322e1b 393 usemap = sparse_early_usemaps_alloc_pgdat_section(NODE_DATA(nodeid),
238305bb 394 size * usemap_count);
f5bf18fa 395 if (!usemap) {
1170532b 396 pr_warn("%s: allocation failed\n", __func__);
238305bb 397 return;
48c90682
YG
398 }
399
f5bf18fa
NA
400 for (pnum = pnum_begin; pnum < pnum_end; pnum++) {
401 if (!present_section_nr(pnum))
402 continue;
403 usemap_map[pnum] = usemap;
404 usemap += size;
405 check_usemap_section_nr(nodeid, usemap_map[pnum]);
a4322e1b 406 }
5c0e3066
MG
407}
408
8f6aac41 409#ifndef CONFIG_SPARSEMEM_VMEMMAP
98f3cfc1 410struct page __init *sparse_mem_map_populate(unsigned long pnum, int nid)
29751f69
AW
411{
412 struct page *map;
e48e67e0 413 unsigned long size;
29751f69
AW
414
415 map = alloc_remap(nid, sizeof(struct page) * PAGES_PER_SECTION);
416 if (map)
417 return map;
418
e48e67e0 419 size = PAGE_ALIGN(sizeof(struct page) * PAGES_PER_SECTION);
bb016b84
SS
420 map = memblock_virt_alloc_try_nid(size,
421 PAGE_SIZE, __pa(MAX_DMA_ADDRESS),
422 BOOTMEM_ALLOC_ACCESSIBLE, nid);
8f6aac41
CL
423 return map;
424}
9bdac914
YL
425void __init sparse_mem_maps_populate_node(struct page **map_map,
426 unsigned long pnum_begin,
427 unsigned long pnum_end,
428 unsigned long map_count, int nodeid)
429{
430 void *map;
431 unsigned long pnum;
432 unsigned long size = sizeof(struct page) * PAGES_PER_SECTION;
433
434 map = alloc_remap(nodeid, size * map_count);
435 if (map) {
436 for (pnum = pnum_begin; pnum < pnum_end; pnum++) {
437 if (!present_section_nr(pnum))
438 continue;
439 map_map[pnum] = map;
440 map += size;
441 }
442 return;
443 }
444
445 size = PAGE_ALIGN(size);
bb016b84
SS
446 map = memblock_virt_alloc_try_nid(size * map_count,
447 PAGE_SIZE, __pa(MAX_DMA_ADDRESS),
448 BOOTMEM_ALLOC_ACCESSIBLE, nodeid);
9bdac914
YL
449 if (map) {
450 for (pnum = pnum_begin; pnum < pnum_end; pnum++) {
451 if (!present_section_nr(pnum))
452 continue;
453 map_map[pnum] = map;
454 map += size;
455 }
456 return;
457 }
458
459 /* fallback */
460 for (pnum = pnum_begin; pnum < pnum_end; pnum++) {
461 struct mem_section *ms;
462
463 if (!present_section_nr(pnum))
464 continue;
465 map_map[pnum] = sparse_mem_map_populate(pnum, nodeid);
466 if (map_map[pnum])
467 continue;
468 ms = __nr_to_section(pnum);
1170532b 469 pr_err("%s: sparsemem memory map backing failed some memory will not be available\n",
756a025f 470 __func__);
9bdac914
YL
471 ms->section_mem_map = 0;
472 }
473}
8f6aac41
CL
474#endif /* !CONFIG_SPARSEMEM_VMEMMAP */
475
81d0d950 476#ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER
18732093 477static void __init sparse_early_mem_maps_alloc_node(void *data,
9bdac914
YL
478 unsigned long pnum_begin,
479 unsigned long pnum_end,
480 unsigned long map_count, int nodeid)
481{
18732093 482 struct page **map_map = (struct page **)data;
9bdac914
YL
483 sparse_mem_maps_populate_node(map_map, pnum_begin, pnum_end,
484 map_count, nodeid);
485}
81d0d950 486#else
9e5c6da7 487static struct page __init *sparse_early_mem_map_alloc(unsigned long pnum)
8f6aac41
CL
488{
489 struct page *map;
490 struct mem_section *ms = __nr_to_section(pnum);
491 int nid = sparse_early_nid(ms);
492
98f3cfc1 493 map = sparse_mem_map_populate(pnum, nid);
29751f69
AW
494 if (map)
495 return map;
496
1170532b 497 pr_err("%s: sparsemem memory map backing failed some memory will not be available\n",
756a025f 498 __func__);
802f192e 499 ms->section_mem_map = 0;
29751f69
AW
500 return NULL;
501}
9bdac914 502#endif
29751f69 503
3b32123d 504void __weak __meminit vmemmap_populate_print_last(void)
c2b91e2e
YL
505{
506}
a4322e1b 507
18732093
WL
508/**
509 * alloc_usemap_and_memmap - memory alloction for pageblock flags and vmemmap
510 * @map: usemap_map for pageblock flags or mmap_map for vmemmap
511 */
512static void __init alloc_usemap_and_memmap(void (*alloc_func)
513 (void *, unsigned long, unsigned long,
514 unsigned long, int), void *data)
515{
516 unsigned long pnum;
517 unsigned long map_count;
518 int nodeid_begin = 0;
519 unsigned long pnum_begin = 0;
520
c4e1be9e 521 for_each_present_section_nr(0, pnum) {
18732093
WL
522 struct mem_section *ms;
523
18732093
WL
524 ms = __nr_to_section(pnum);
525 nodeid_begin = sparse_early_nid(ms);
526 pnum_begin = pnum;
527 break;
528 }
529 map_count = 1;
c4e1be9e 530 for_each_present_section_nr(pnum_begin + 1, pnum) {
18732093
WL
531 struct mem_section *ms;
532 int nodeid;
533
18732093
WL
534 ms = __nr_to_section(pnum);
535 nodeid = sparse_early_nid(ms);
536 if (nodeid == nodeid_begin) {
537 map_count++;
538 continue;
539 }
540 /* ok, we need to take cake of from pnum_begin to pnum - 1*/
541 alloc_func(data, pnum_begin, pnum,
542 map_count, nodeid_begin);
543 /* new start, update count etc*/
544 nodeid_begin = nodeid;
545 pnum_begin = pnum;
546 map_count = 1;
547 }
548 /* ok, last chunk */
549 alloc_func(data, pnum_begin, NR_MEM_SECTIONS,
550 map_count, nodeid_begin);
551}
552
193faea9
SR
553/*
554 * Allocate the accumulated non-linear sections, allocate a mem_map
555 * for each and record the physical to section mapping.
556 */
557void __init sparse_init(void)
558{
559 unsigned long pnum;
560 struct page *map;
5c0e3066 561 unsigned long *usemap;
e123dd3f 562 unsigned long **usemap_map;
81d0d950 563 int size;
81d0d950 564#ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER
81d0d950
YL
565 int size2;
566 struct page **map_map;
567#endif
e123dd3f 568
55878e88
CS
569 /* see include/linux/mmzone.h 'struct mem_section' definition */
570 BUILD_BUG_ON(!is_power_of_2(sizeof(struct mem_section)));
571
ca57df79
XQ
572 /* Setup pageblock_order for HUGETLB_PAGE_SIZE_VARIABLE */
573 set_pageblock_order();
574
e123dd3f
YL
575 /*
576 * map is using big page (aka 2M in x86 64 bit)
577 * usemap is less one page (aka 24 bytes)
578 * so alloc 2M (with 2M align) and 24 bytes in turn will
579 * make next 2M slip to one more 2M later.
580 * then in big system, the memory will have a lot of holes...
25985edc 581 * here try to allocate 2M pages continuously.
e123dd3f
YL
582 *
583 * powerpc need to call sparse_init_one_section right after each
584 * sparse_early_mem_map_alloc, so allocate usemap_map at first.
585 */
586 size = sizeof(unsigned long *) * NR_MEM_SECTIONS;
bb016b84 587 usemap_map = memblock_virt_alloc(size, 0);
e123dd3f
YL
588 if (!usemap_map)
589 panic("can not allocate usemap_map\n");
18732093
WL
590 alloc_usemap_and_memmap(sparse_early_usemaps_alloc_node,
591 (void *)usemap_map);
193faea9 592
9bdac914
YL
593#ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER
594 size2 = sizeof(struct page *) * NR_MEM_SECTIONS;
bb016b84 595 map_map = memblock_virt_alloc(size2, 0);
9bdac914
YL
596 if (!map_map)
597 panic("can not allocate map_map\n");
18732093
WL
598 alloc_usemap_and_memmap(sparse_early_mem_maps_alloc_node,
599 (void *)map_map);
9bdac914
YL
600#endif
601
c4e1be9e 602 for_each_present_section_nr(0, pnum) {
e123dd3f 603 usemap = usemap_map[pnum];
5c0e3066
MG
604 if (!usemap)
605 continue;
606
9bdac914
YL
607#ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER
608 map = map_map[pnum];
609#else
e123dd3f 610 map = sparse_early_mem_map_alloc(pnum);
9bdac914 611#endif
e123dd3f
YL
612 if (!map)
613 continue;
614
5c0e3066
MG
615 sparse_init_one_section(__nr_to_section(pnum), pnum, map,
616 usemap);
193faea9 617 }
e123dd3f 618
c2b91e2e
YL
619 vmemmap_populate_print_last();
620
9bdac914 621#ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER
bb016b84 622 memblock_free_early(__pa(map_map), size2);
9bdac914 623#endif
bb016b84 624 memblock_free_early(__pa(usemap_map), size);
193faea9
SR
625}
626
627#ifdef CONFIG_MEMORY_HOTPLUG
2d070eab
MH
628
629/* Mark all memory sections within the pfn range as online */
630void online_mem_sections(unsigned long start_pfn, unsigned long end_pfn)
631{
632 unsigned long pfn;
633
634 for (pfn = start_pfn; pfn < end_pfn; pfn += PAGES_PER_SECTION) {
b4ccec41 635 unsigned long section_nr = pfn_to_section_nr(pfn);
2d070eab
MH
636 struct mem_section *ms;
637
638 /* onlining code should never touch invalid ranges */
639 if (WARN_ON(!valid_section_nr(section_nr)))
640 continue;
641
642 ms = __nr_to_section(section_nr);
643 ms->section_mem_map |= SECTION_IS_ONLINE;
644 }
645}
646
647#ifdef CONFIG_MEMORY_HOTREMOVE
648/* Mark all memory sections within the pfn range as online */
649void offline_mem_sections(unsigned long start_pfn, unsigned long end_pfn)
650{
651 unsigned long pfn;
652
653 for (pfn = start_pfn; pfn < end_pfn; pfn += PAGES_PER_SECTION) {
654 unsigned long section_nr = pfn_to_section_nr(start_pfn);
655 struct mem_section *ms;
656
657 /*
658 * TODO this needs some double checking. Offlining code makes
659 * sure to check pfn_valid but those checks might be just bogus
660 */
661 if (WARN_ON(!valid_section_nr(section_nr)))
662 continue;
663
664 ms = __nr_to_section(section_nr);
665 ms->section_mem_map &= ~SECTION_IS_ONLINE;
666 }
667}
668#endif
669
98f3cfc1 670#ifdef CONFIG_SPARSEMEM_VMEMMAP
85b35fea 671static inline struct page *kmalloc_section_memmap(unsigned long pnum, int nid)
98f3cfc1
YG
672{
673 /* This will make the necessary allocations eventually. */
674 return sparse_mem_map_populate(pnum, nid);
675}
85b35fea 676static void __kfree_section_memmap(struct page *memmap)
98f3cfc1 677{
0aad818b 678 unsigned long start = (unsigned long)memmap;
85b35fea 679 unsigned long end = (unsigned long)(memmap + PAGES_PER_SECTION);
0aad818b
JW
680
681 vmemmap_free(start, end);
98f3cfc1 682}
4edd7cef 683#ifdef CONFIG_MEMORY_HOTREMOVE
81556b02 684static void free_map_bootmem(struct page *memmap)
0c0a4a51 685{
0aad818b 686 unsigned long start = (unsigned long)memmap;
81556b02 687 unsigned long end = (unsigned long)(memmap + PAGES_PER_SECTION);
0aad818b
JW
688
689 vmemmap_free(start, end);
0c0a4a51 690}
4edd7cef 691#endif /* CONFIG_MEMORY_HOTREMOVE */
98f3cfc1 692#else
85b35fea 693static struct page *__kmalloc_section_memmap(void)
0b0acbec
DH
694{
695 struct page *page, *ret;
85b35fea 696 unsigned long memmap_size = sizeof(struct page) * PAGES_PER_SECTION;
0b0acbec 697
f2d0aa5b 698 page = alloc_pages(GFP_KERNEL|__GFP_NOWARN, get_order(memmap_size));
0b0acbec
DH
699 if (page)
700 goto got_map_page;
701
702 ret = vmalloc(memmap_size);
703 if (ret)
704 goto got_map_ptr;
705
706 return NULL;
707got_map_page:
708 ret = (struct page *)pfn_to_kaddr(page_to_pfn(page));
709got_map_ptr:
0b0acbec
DH
710
711 return ret;
712}
713
85b35fea 714static inline struct page *kmalloc_section_memmap(unsigned long pnum, int nid)
98f3cfc1 715{
85b35fea 716 return __kmalloc_section_memmap();
98f3cfc1
YG
717}
718
85b35fea 719static void __kfree_section_memmap(struct page *memmap)
0b0acbec 720{
9e2779fa 721 if (is_vmalloc_addr(memmap))
0b0acbec
DH
722 vfree(memmap);
723 else
724 free_pages((unsigned long)memmap,
85b35fea 725 get_order(sizeof(struct page) * PAGES_PER_SECTION));
0b0acbec 726}
0c0a4a51 727
4edd7cef 728#ifdef CONFIG_MEMORY_HOTREMOVE
81556b02 729static void free_map_bootmem(struct page *memmap)
0c0a4a51
YG
730{
731 unsigned long maps_section_nr, removing_section_nr, i;
81556b02 732 unsigned long magic, nr_pages;
ae64ffca 733 struct page *page = virt_to_page(memmap);
0c0a4a51 734
81556b02
ZY
735 nr_pages = PAGE_ALIGN(PAGES_PER_SECTION * sizeof(struct page))
736 >> PAGE_SHIFT;
737
0c0a4a51 738 for (i = 0; i < nr_pages; i++, page++) {
ddffe98d 739 magic = (unsigned long) page->freelist;
0c0a4a51
YG
740
741 BUG_ON(magic == NODE_INFO);
742
743 maps_section_nr = pfn_to_section_nr(page_to_pfn(page));
857e522a 744 removing_section_nr = page_private(page);
0c0a4a51
YG
745
746 /*
747 * When this function is called, the removing section is
748 * logical offlined state. This means all pages are isolated
749 * from page allocator. If removing section's memmap is placed
750 * on the same section, it must not be freed.
751 * If it is freed, page allocator may allocate it which will
752 * be removed physically soon.
753 */
754 if (maps_section_nr != removing_section_nr)
755 put_page_bootmem(page);
756 }
757}
4edd7cef 758#endif /* CONFIG_MEMORY_HOTREMOVE */
98f3cfc1 759#endif /* CONFIG_SPARSEMEM_VMEMMAP */
0b0acbec 760
29751f69
AW
761/*
762 * returns the number of sections whose mem_maps were properly
763 * set. If this is <=0, then that means that the passed-in
764 * map was not consumed and must be freed.
765 */
f1dd2cd1 766int __meminit sparse_add_one_section(struct pglist_data *pgdat, unsigned long start_pfn)
29751f69 767{
0b0acbec 768 unsigned long section_nr = pfn_to_section_nr(start_pfn);
0b0acbec
DH
769 struct mem_section *ms;
770 struct page *memmap;
5c0e3066 771 unsigned long *usemap;
0b0acbec
DH
772 unsigned long flags;
773 int ret;
29751f69 774
0b0acbec
DH
775 /*
776 * no locking for this, because it does its own
777 * plus, it does a kmalloc
778 */
bbd06825
WC
779 ret = sparse_index_init(section_nr, pgdat->node_id);
780 if (ret < 0 && ret != -EEXIST)
781 return ret;
85b35fea 782 memmap = kmalloc_section_memmap(section_nr, pgdat->node_id);
bbd06825
WC
783 if (!memmap)
784 return -ENOMEM;
5c0e3066 785 usemap = __kmalloc_section_usemap();
bbd06825 786 if (!usemap) {
85b35fea 787 __kfree_section_memmap(memmap);
bbd06825
WC
788 return -ENOMEM;
789 }
0b0acbec
DH
790
791 pgdat_resize_lock(pgdat, &flags);
29751f69 792
0b0acbec
DH
793 ms = __pfn_to_section(start_pfn);
794 if (ms->section_mem_map & SECTION_MARKED_PRESENT) {
795 ret = -EEXIST;
796 goto out;
797 }
5c0e3066 798
85b35fea 799 memset(memmap, 0, sizeof(struct page) * PAGES_PER_SECTION);
3ac19f8e 800
c4e1be9e 801 section_mark_present(ms);
29751f69 802
5c0e3066 803 ret = sparse_init_one_section(ms, section_nr, memmap, usemap);
0b0acbec 804
0b0acbec
DH
805out:
806 pgdat_resize_unlock(pgdat, &flags);
bbd06825
WC
807 if (ret <= 0) {
808 kfree(usemap);
85b35fea 809 __kfree_section_memmap(memmap);
bbd06825 810 }
0b0acbec 811 return ret;
29751f69 812}
ea01ea93 813
f3deb687 814#ifdef CONFIG_MEMORY_HOTREMOVE
95a4774d
WC
815#ifdef CONFIG_MEMORY_FAILURE
816static void clear_hwpoisoned_pages(struct page *memmap, int nr_pages)
817{
818 int i;
819
820 if (!memmap)
821 return;
822
4b94ffdc 823 for (i = 0; i < nr_pages; i++) {
95a4774d 824 if (PageHWPoison(&memmap[i])) {
293c07e3 825 atomic_long_sub(1, &num_poisoned_pages);
95a4774d
WC
826 ClearPageHWPoison(&memmap[i]);
827 }
828 }
829}
830#else
831static inline void clear_hwpoisoned_pages(struct page *memmap, int nr_pages)
832{
833}
834#endif
835
4edd7cef
DR
836static void free_section_usemap(struct page *memmap, unsigned long *usemap)
837{
838 struct page *usemap_page;
4edd7cef
DR
839
840 if (!usemap)
841 return;
842
843 usemap_page = virt_to_page(usemap);
844 /*
845 * Check to see if allocation came from hot-plug-add
846 */
847 if (PageSlab(usemap_page) || PageCompound(usemap_page)) {
848 kfree(usemap);
849 if (memmap)
85b35fea 850 __kfree_section_memmap(memmap);
4edd7cef
DR
851 return;
852 }
853
854 /*
855 * The usemap came from bootmem. This is packed with other usemaps
856 * on the section which has pgdat at boot time. Just keep it as is now.
857 */
858
81556b02
ZY
859 if (memmap)
860 free_map_bootmem(memmap);
4edd7cef
DR
861}
862
4b94ffdc
DW
863void sparse_remove_one_section(struct zone *zone, struct mem_section *ms,
864 unsigned long map_offset)
ea01ea93
BP
865{
866 struct page *memmap = NULL;
cd099682
TC
867 unsigned long *usemap = NULL, flags;
868 struct pglist_data *pgdat = zone->zone_pgdat;
ea01ea93 869
cd099682 870 pgdat_resize_lock(pgdat, &flags);
ea01ea93
BP
871 if (ms->section_mem_map) {
872 usemap = ms->pageblock_flags;
873 memmap = sparse_decode_mem_map(ms->section_mem_map,
874 __section_nr(ms));
875 ms->section_mem_map = 0;
876 ms->pageblock_flags = NULL;
877 }
cd099682 878 pgdat_resize_unlock(pgdat, &flags);
ea01ea93 879
4b94ffdc
DW
880 clear_hwpoisoned_pages(memmap + map_offset,
881 PAGES_PER_SECTION - map_offset);
ea01ea93
BP
882 free_section_usemap(memmap, usemap);
883}
4edd7cef
DR
884#endif /* CONFIG_MEMORY_HOTREMOVE */
885#endif /* CONFIG_MEMORY_HOTPLUG */