]> git.ipfire.org Git - thirdparty/kernel/stable.git/blame - mm/sparse.c
mm/sparse: move buffer init/fini to the common place
[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;
d538c164 193 } while ((section_nr <= __highest_present_section_nr));
c4e1be9e
DH
194
195 return -1;
196}
197#define for_each_present_section_nr(start, section_nr) \
198 for (section_nr = next_present_section_nr(start-1); \
199 ((section_nr >= 0) && \
c4e1be9e
DH
200 (section_nr <= __highest_present_section_nr)); \
201 section_nr = next_present_section_nr(section_nr))
202
f2fc10e0
BH
203/*
204 * Record how many memory sections are marked as present
205 * during system bootup.
206 */
207static int __initdata nr_present_sections;
208
2dbb51c4
MG
209/* Record a memory area against a node. */
210void __init memory_present(int nid, unsigned long start, unsigned long end)
211{
212 unsigned long pfn;
bead9a3a 213
629a359b
KS
214#ifdef CONFIG_SPARSEMEM_EXTREME
215 if (unlikely(!mem_section)) {
216 unsigned long size, align;
217
d09cfbbf 218 size = sizeof(struct mem_section*) * NR_SECTION_ROOTS;
629a359b
KS
219 align = 1 << (INTERNODE_CACHE_SHIFT);
220 mem_section = memblock_virt_alloc(size, align);
221 }
222#endif
223
d41dee36 224 start &= PAGE_SECTION_MASK;
2dbb51c4 225 mminit_validate_memmodel_limits(&start, &end);
d41dee36
AW
226 for (pfn = start; pfn < end; pfn += PAGES_PER_SECTION) {
227 unsigned long section = pfn_to_section_nr(pfn);
802f192e
BP
228 struct mem_section *ms;
229
230 sparse_index_init(section, nid);
85770ffe 231 set_section_nid(section, nid);
802f192e
BP
232
233 ms = __nr_to_section(section);
c4e1be9e 234 if (!ms->section_mem_map) {
2d070eab
MH
235 ms->section_mem_map = sparse_encode_early_nid(nid) |
236 SECTION_IS_ONLINE;
c4e1be9e 237 section_mark_present(ms);
f2fc10e0 238 nr_present_sections++;
c4e1be9e 239 }
d41dee36
AW
240 }
241}
242
29751f69
AW
243/*
244 * Subtle, we encode the real pfn into the mem_map such that
245 * the identity pfn - section_mem_map will return the actual
246 * physical page frame number.
247 */
248static unsigned long sparse_encode_mem_map(struct page *mem_map, unsigned long pnum)
249{
def9b71e
PT
250 unsigned long coded_mem_map =
251 (unsigned long)(mem_map - (section_nr_to_pfn(pnum)));
252 BUILD_BUG_ON(SECTION_MAP_LAST_BIT > (1UL<<PFN_SECTION_SHIFT));
253 BUG_ON(coded_mem_map & ~SECTION_MAP_MASK);
254 return coded_mem_map;
29751f69
AW
255}
256
257/*
ea01ea93 258 * Decode mem_map from the coded memmap
29751f69 259 */
29751f69
AW
260struct page *sparse_decode_mem_map(unsigned long coded_mem_map, unsigned long pnum)
261{
ea01ea93
BP
262 /* mask off the extra low bits of information */
263 coded_mem_map &= SECTION_MAP_MASK;
29751f69
AW
264 return ((struct page *)coded_mem_map) + section_nr_to_pfn(pnum);
265}
266
4e40987f 267static void __meminit sparse_init_one_section(struct mem_section *ms,
5c0e3066
MG
268 unsigned long pnum, struct page *mem_map,
269 unsigned long *pageblock_bitmap)
29751f69 270{
30c253e6 271 ms->section_mem_map &= ~SECTION_MAP_MASK;
540557b9
AW
272 ms->section_mem_map |= sparse_encode_mem_map(mem_map, pnum) |
273 SECTION_HAS_MEM_MAP;
5c0e3066 274 ms->pageblock_flags = pageblock_bitmap;
29751f69
AW
275}
276
04753278 277unsigned long usemap_size(void)
5c0e3066 278{
60a7a88d 279 return BITS_TO_LONGS(SECTION_BLOCKFLAGS_BITS) * sizeof(unsigned long);
5c0e3066
MG
280}
281
282#ifdef CONFIG_MEMORY_HOTPLUG
283static unsigned long *__kmalloc_section_usemap(void)
284{
285 return kmalloc(usemap_size(), GFP_KERNEL);
286}
287#endif /* CONFIG_MEMORY_HOTPLUG */
288
48c90682
YG
289#ifdef CONFIG_MEMORY_HOTREMOVE
290static unsigned long * __init
a4322e1b 291sparse_early_usemaps_alloc_pgdat_section(struct pglist_data *pgdat,
238305bb 292 unsigned long size)
48c90682 293{
99ab7b19
YL
294 unsigned long goal, limit;
295 unsigned long *p;
296 int nid;
48c90682
YG
297 /*
298 * A page may contain usemaps for other sections preventing the
299 * page being freed and making a section unremovable while
c800bcd5 300 * other sections referencing the usemap remain active. Similarly,
48c90682
YG
301 * a pgdat can prevent a section being removed. If section A
302 * contains a pgdat and section B contains the usemap, both
303 * sections become inter-dependent. This allocates usemaps
304 * from the same section as the pgdat where possible to avoid
305 * this problem.
306 */
07b4e2bc 307 goal = __pa(pgdat) & (PAGE_SECTION_MASK << PAGE_SHIFT);
99ab7b19
YL
308 limit = goal + (1UL << PA_SECTION_SHIFT);
309 nid = early_pfn_to_nid(goal >> PAGE_SHIFT);
310again:
bb016b84
SS
311 p = memblock_virt_alloc_try_nid_nopanic(size,
312 SMP_CACHE_BYTES, goal, limit,
313 nid);
99ab7b19
YL
314 if (!p && limit) {
315 limit = 0;
316 goto again;
317 }
318 return p;
48c90682
YG
319}
320
321static void __init check_usemap_section_nr(int nid, unsigned long *usemap)
322{
323 unsigned long usemap_snr, pgdat_snr;
83e3c487
KS
324 static unsigned long old_usemap_snr;
325 static unsigned long old_pgdat_snr;
48c90682
YG
326 struct pglist_data *pgdat = NODE_DATA(nid);
327 int usemap_nid;
328
83e3c487
KS
329 /* First call */
330 if (!old_usemap_snr) {
331 old_usemap_snr = NR_MEM_SECTIONS;
332 old_pgdat_snr = NR_MEM_SECTIONS;
333 }
334
48c90682
YG
335 usemap_snr = pfn_to_section_nr(__pa(usemap) >> PAGE_SHIFT);
336 pgdat_snr = pfn_to_section_nr(__pa(pgdat) >> PAGE_SHIFT);
337 if (usemap_snr == pgdat_snr)
338 return;
339
340 if (old_usemap_snr == usemap_snr && old_pgdat_snr == pgdat_snr)
341 /* skip redundant message */
342 return;
343
344 old_usemap_snr = usemap_snr;
345 old_pgdat_snr = pgdat_snr;
346
347 usemap_nid = sparse_early_nid(__nr_to_section(usemap_snr));
348 if (usemap_nid != nid) {
1170532b
JP
349 pr_info("node %d must be removed before remove section %ld\n",
350 nid, usemap_snr);
48c90682
YG
351 return;
352 }
353 /*
354 * There is a circular dependency.
355 * Some platforms allow un-removable section because they will just
356 * gather other removable sections for dynamic partitioning.
357 * Just notify un-removable section's number here.
358 */
1170532b
JP
359 pr_info("Section %ld and %ld (node %d) have a circular dependency on usemap and pgdat allocations\n",
360 usemap_snr, pgdat_snr, nid);
48c90682
YG
361}
362#else
363static unsigned long * __init
a4322e1b 364sparse_early_usemaps_alloc_pgdat_section(struct pglist_data *pgdat,
238305bb 365 unsigned long size)
48c90682 366{
bb016b84 367 return memblock_virt_alloc_node_nopanic(size, pgdat->node_id);
48c90682
YG
368}
369
370static void __init check_usemap_section_nr(int nid, unsigned long *usemap)
371{
372}
373#endif /* CONFIG_MEMORY_HOTREMOVE */
374
18732093 375static void __init sparse_early_usemaps_alloc_node(void *data,
a4322e1b
YL
376 unsigned long pnum_begin,
377 unsigned long pnum_end,
378 unsigned long usemap_count, int nodeid)
5c0e3066 379{
a4322e1b
YL
380 void *usemap;
381 unsigned long pnum;
18732093 382 unsigned long **usemap_map = (unsigned long **)data;
a4322e1b 383 int size = usemap_size();
c98aff64 384 int nr_consumed_maps = 0;
5c0e3066 385
a4322e1b 386 usemap = sparse_early_usemaps_alloc_pgdat_section(NODE_DATA(nodeid),
238305bb 387 size * usemap_count);
f5bf18fa 388 if (!usemap) {
1170532b 389 pr_warn("%s: allocation failed\n", __func__);
238305bb 390 return;
48c90682
YG
391 }
392
f5bf18fa
NA
393 for (pnum = pnum_begin; pnum < pnum_end; pnum++) {
394 if (!present_section_nr(pnum))
395 continue;
c98aff64 396 usemap_map[nr_consumed_maps] = usemap;
f5bf18fa 397 usemap += size;
c98aff64
BH
398 check_usemap_section_nr(nodeid, usemap_map[nr_consumed_maps]);
399 nr_consumed_maps++;
a4322e1b 400 }
5c0e3066
MG
401}
402
35fd1eb1 403#ifdef CONFIG_SPARSEMEM_VMEMMAP
afda57bc 404static unsigned long __init section_map_size(void)
35fd1eb1
PT
405
406{
407 return ALIGN(sizeof(struct page) * PAGES_PER_SECTION, PMD_SIZE);
408}
409
410#else
afda57bc 411static unsigned long __init section_map_size(void)
e131c06b
PT
412{
413 return PAGE_ALIGN(sizeof(struct page) * PAGES_PER_SECTION);
414}
415
7b73d978
CH
416struct page __init *sparse_mem_map_populate(unsigned long pnum, int nid,
417 struct vmem_altmap *altmap)
29751f69 418{
e131c06b
PT
419 unsigned long size = section_map_size();
420 struct page *map = sparse_buffer_alloc(size);
421
422 if (map)
423 return map;
29751f69 424
bb016b84
SS
425 map = memblock_virt_alloc_try_nid(size,
426 PAGE_SIZE, __pa(MAX_DMA_ADDRESS),
427 BOOTMEM_ALLOC_ACCESSIBLE, nid);
8f6aac41
CL
428 return map;
429}
9bdac914
YL
430void __init sparse_mem_maps_populate_node(struct page **map_map,
431 unsigned long pnum_begin,
432 unsigned long pnum_end,
433 unsigned long map_count, int nodeid)
434{
9bdac914 435 unsigned long pnum;
e131c06b 436 int nr_consumed_maps = 0;
9bdac914 437
9bdac914 438 for (pnum = pnum_begin; pnum < pnum_end; pnum++) {
9bdac914
YL
439 if (!present_section_nr(pnum))
440 continue;
c98aff64
BH
441 map_map[nr_consumed_maps] =
442 sparse_mem_map_populate(pnum, nodeid, NULL);
443 if (map_map[nr_consumed_maps++])
9bdac914 444 continue;
1170532b 445 pr_err("%s: sparsemem memory map backing failed some memory will not be available\n",
756a025f 446 __func__);
9bdac914
YL
447 }
448}
8f6aac41
CL
449#endif /* !CONFIG_SPARSEMEM_VMEMMAP */
450
35fd1eb1
PT
451static void *sparsemap_buf __meminitdata;
452static void *sparsemap_buf_end __meminitdata;
453
afda57bc 454static void __init sparse_buffer_init(unsigned long size, int nid)
35fd1eb1
PT
455{
456 WARN_ON(sparsemap_buf); /* forgot to call sparse_buffer_fini()? */
457 sparsemap_buf =
458 memblock_virt_alloc_try_nid_raw(size, PAGE_SIZE,
459 __pa(MAX_DMA_ADDRESS),
460 BOOTMEM_ALLOC_ACCESSIBLE, nid);
461 sparsemap_buf_end = sparsemap_buf + size;
462}
463
afda57bc 464static void __init sparse_buffer_fini(void)
35fd1eb1
PT
465{
466 unsigned long size = sparsemap_buf_end - sparsemap_buf;
467
468 if (sparsemap_buf && size > 0)
469 memblock_free_early(__pa(sparsemap_buf), size);
470 sparsemap_buf = NULL;
471}
472
473void * __meminit sparse_buffer_alloc(unsigned long size)
474{
475 void *ptr = NULL;
476
477 if (sparsemap_buf) {
478 ptr = PTR_ALIGN(sparsemap_buf, size);
479 if (ptr + size > sparsemap_buf_end)
480 ptr = NULL;
481 else
482 sparsemap_buf = ptr + size;
483 }
484 return ptr;
485}
486
81d0d950 487#ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER
18732093 488static void __init sparse_early_mem_maps_alloc_node(void *data,
9bdac914
YL
489 unsigned long pnum_begin,
490 unsigned long pnum_end,
491 unsigned long map_count, int nodeid)
492{
18732093 493 struct page **map_map = (struct page **)data;
afda57bc
PT
494
495 sparse_buffer_init(section_map_size() * map_count, nodeid);
9bdac914
YL
496 sparse_mem_maps_populate_node(map_map, pnum_begin, pnum_end,
497 map_count, nodeid);
afda57bc 498 sparse_buffer_fini();
9bdac914 499}
81d0d950 500#else
9e5c6da7 501static struct page __init *sparse_early_mem_map_alloc(unsigned long pnum)
8f6aac41
CL
502{
503 struct page *map;
504 struct mem_section *ms = __nr_to_section(pnum);
505 int nid = sparse_early_nid(ms);
506
7b73d978 507 map = sparse_mem_map_populate(pnum, nid, NULL);
29751f69
AW
508 if (map)
509 return map;
510
1170532b 511 pr_err("%s: sparsemem memory map backing failed some memory will not be available\n",
756a025f 512 __func__);
29751f69
AW
513 return NULL;
514}
9bdac914 515#endif
29751f69 516
3b32123d 517void __weak __meminit vmemmap_populate_print_last(void)
c2b91e2e
YL
518{
519}
a4322e1b 520
18732093
WL
521/**
522 * alloc_usemap_and_memmap - memory alloction for pageblock flags and vmemmap
523 * @map: usemap_map for pageblock flags or mmap_map for vmemmap
9258631b 524 * @unit_size: size of map unit
18732093
WL
525 */
526static void __init alloc_usemap_and_memmap(void (*alloc_func)
527 (void *, unsigned long, unsigned long,
9258631b
BH
528 unsigned long, int), void *data,
529 int data_unit_size)
18732093
WL
530{
531 unsigned long pnum;
532 unsigned long map_count;
533 int nodeid_begin = 0;
534 unsigned long pnum_begin = 0;
535
c4e1be9e 536 for_each_present_section_nr(0, pnum) {
18732093
WL
537 struct mem_section *ms;
538
18732093
WL
539 ms = __nr_to_section(pnum);
540 nodeid_begin = sparse_early_nid(ms);
541 pnum_begin = pnum;
542 break;
543 }
544 map_count = 1;
c4e1be9e 545 for_each_present_section_nr(pnum_begin + 1, pnum) {
18732093
WL
546 struct mem_section *ms;
547 int nodeid;
548
18732093
WL
549 ms = __nr_to_section(pnum);
550 nodeid = sparse_early_nid(ms);
551 if (nodeid == nodeid_begin) {
552 map_count++;
553 continue;
554 }
555 /* ok, we need to take cake of from pnum_begin to pnum - 1*/
556 alloc_func(data, pnum_begin, pnum,
557 map_count, nodeid_begin);
558 /* new start, update count etc*/
559 nodeid_begin = nodeid;
560 pnum_begin = pnum;
c98aff64 561 data += map_count * data_unit_size;
18732093
WL
562 map_count = 1;
563 }
564 /* ok, last chunk */
08994b24 565 alloc_func(data, pnum_begin, __highest_present_section_nr+1,
18732093
WL
566 map_count, nodeid_begin);
567}
568
193faea9
SR
569/*
570 * Allocate the accumulated non-linear sections, allocate a mem_map
571 * for each and record the physical to section mapping.
572 */
573void __init sparse_init(void)
574{
575 unsigned long pnum;
576 struct page *map;
5c0e3066 577 unsigned long *usemap;
e123dd3f 578 unsigned long **usemap_map;
81d0d950 579 int size;
c98aff64 580 int nr_consumed_maps = 0;
81d0d950 581#ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER
81d0d950
YL
582 int size2;
583 struct page **map_map;
584#endif
e123dd3f 585
55878e88
CS
586 /* see include/linux/mmzone.h 'struct mem_section' definition */
587 BUILD_BUG_ON(!is_power_of_2(sizeof(struct mem_section)));
588
ca57df79
XQ
589 /* Setup pageblock_order for HUGETLB_PAGE_SIZE_VARIABLE */
590 set_pageblock_order();
591
e123dd3f
YL
592 /*
593 * map is using big page (aka 2M in x86 64 bit)
594 * usemap is less one page (aka 24 bytes)
595 * so alloc 2M (with 2M align) and 24 bytes in turn will
596 * make next 2M slip to one more 2M later.
597 * then in big system, the memory will have a lot of holes...
25985edc 598 * here try to allocate 2M pages continuously.
e123dd3f
YL
599 *
600 * powerpc need to call sparse_init_one_section right after each
601 * sparse_early_mem_map_alloc, so allocate usemap_map at first.
602 */
c98aff64 603 size = sizeof(unsigned long *) * nr_present_sections;
bb016b84 604 usemap_map = memblock_virt_alloc(size, 0);
e123dd3f
YL
605 if (!usemap_map)
606 panic("can not allocate usemap_map\n");
18732093 607 alloc_usemap_and_memmap(sparse_early_usemaps_alloc_node,
9258631b
BH
608 (void *)usemap_map,
609 sizeof(usemap_map[0]));
193faea9 610
9bdac914 611#ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER
c98aff64 612 size2 = sizeof(struct page *) * nr_present_sections;
bb016b84 613 map_map = memblock_virt_alloc(size2, 0);
9bdac914
YL
614 if (!map_map)
615 panic("can not allocate map_map\n");
18732093 616 alloc_usemap_and_memmap(sparse_early_mem_maps_alloc_node,
9258631b
BH
617 (void *)map_map,
618 sizeof(map_map[0]));
9bdac914
YL
619#endif
620
c98aff64
BH
621 /*
622 * The number of present sections stored in nr_present_sections
623 * are kept the same since mem sections are marked as present in
624 * memory_present(). In this for loop, we need check which sections
625 * failed to allocate memmap or usemap, then clear its
626 * ->section_mem_map accordingly. During this process, we need
627 * increase 'nr_consumed_maps' whether its allocation of memmap
628 * or usemap failed or not, so that after we handle the i-th
629 * memory section, can get memmap and usemap of (i+1)-th section
630 * correctly.
631 */
c4e1be9e 632 for_each_present_section_nr(0, pnum) {
07a34a8c 633 struct mem_section *ms;
c98aff64
BH
634
635 if (nr_consumed_maps >= nr_present_sections) {
636 pr_err("nr_consumed_maps goes beyond nr_present_sections\n");
637 break;
638 }
07a34a8c 639 ms = __nr_to_section(pnum);
c98aff64 640 usemap = usemap_map[nr_consumed_maps];
07a34a8c
BH
641 if (!usemap) {
642 ms->section_mem_map = 0;
c98aff64 643 nr_consumed_maps++;
5c0e3066 644 continue;
07a34a8c 645 }
5c0e3066 646
9bdac914 647#ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER
c98aff64 648 map = map_map[nr_consumed_maps];
9bdac914 649#else
e123dd3f 650 map = sparse_early_mem_map_alloc(pnum);
9bdac914 651#endif
07a34a8c
BH
652 if (!map) {
653 ms->section_mem_map = 0;
c98aff64 654 nr_consumed_maps++;
e123dd3f 655 continue;
07a34a8c 656 }
e123dd3f 657
5c0e3066
MG
658 sparse_init_one_section(__nr_to_section(pnum), pnum, map,
659 usemap);
c98aff64 660 nr_consumed_maps++;
193faea9 661 }
e123dd3f 662
c2b91e2e
YL
663 vmemmap_populate_print_last();
664
9bdac914 665#ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER
bb016b84 666 memblock_free_early(__pa(map_map), size2);
9bdac914 667#endif
bb016b84 668 memblock_free_early(__pa(usemap_map), size);
193faea9
SR
669}
670
671#ifdef CONFIG_MEMORY_HOTPLUG
2d070eab
MH
672
673/* Mark all memory sections within the pfn range as online */
674void online_mem_sections(unsigned long start_pfn, unsigned long end_pfn)
675{
676 unsigned long pfn;
677
678 for (pfn = start_pfn; pfn < end_pfn; pfn += PAGES_PER_SECTION) {
b4ccec41 679 unsigned long section_nr = pfn_to_section_nr(pfn);
2d070eab
MH
680 struct mem_section *ms;
681
682 /* onlining code should never touch invalid ranges */
683 if (WARN_ON(!valid_section_nr(section_nr)))
684 continue;
685
686 ms = __nr_to_section(section_nr);
687 ms->section_mem_map |= SECTION_IS_ONLINE;
688 }
689}
690
691#ifdef CONFIG_MEMORY_HOTREMOVE
692/* Mark all memory sections within the pfn range as online */
693void offline_mem_sections(unsigned long start_pfn, unsigned long end_pfn)
694{
695 unsigned long pfn;
696
697 for (pfn = start_pfn; pfn < end_pfn; pfn += PAGES_PER_SECTION) {
27227c73 698 unsigned long section_nr = pfn_to_section_nr(pfn);
2d070eab
MH
699 struct mem_section *ms;
700
701 /*
702 * TODO this needs some double checking. Offlining code makes
703 * sure to check pfn_valid but those checks might be just bogus
704 */
705 if (WARN_ON(!valid_section_nr(section_nr)))
706 continue;
707
708 ms = __nr_to_section(section_nr);
709 ms->section_mem_map &= ~SECTION_IS_ONLINE;
710 }
711}
712#endif
713
98f3cfc1 714#ifdef CONFIG_SPARSEMEM_VMEMMAP
7b73d978
CH
715static inline struct page *kmalloc_section_memmap(unsigned long pnum, int nid,
716 struct vmem_altmap *altmap)
98f3cfc1
YG
717{
718 /* This will make the necessary allocations eventually. */
7b73d978 719 return sparse_mem_map_populate(pnum, nid, altmap);
98f3cfc1 720}
24b6d416
CH
721static void __kfree_section_memmap(struct page *memmap,
722 struct vmem_altmap *altmap)
98f3cfc1 723{
0aad818b 724 unsigned long start = (unsigned long)memmap;
85b35fea 725 unsigned long end = (unsigned long)(memmap + PAGES_PER_SECTION);
0aad818b 726
24b6d416 727 vmemmap_free(start, end, altmap);
98f3cfc1 728}
4edd7cef 729#ifdef CONFIG_MEMORY_HOTREMOVE
81556b02 730static void free_map_bootmem(struct page *memmap)
0c0a4a51 731{
0aad818b 732 unsigned long start = (unsigned long)memmap;
81556b02 733 unsigned long end = (unsigned long)(memmap + PAGES_PER_SECTION);
0aad818b 734
24b6d416 735 vmemmap_free(start, end, NULL);
0c0a4a51 736}
4edd7cef 737#endif /* CONFIG_MEMORY_HOTREMOVE */
98f3cfc1 738#else
85b35fea 739static struct page *__kmalloc_section_memmap(void)
0b0acbec
DH
740{
741 struct page *page, *ret;
85b35fea 742 unsigned long memmap_size = sizeof(struct page) * PAGES_PER_SECTION;
0b0acbec 743
f2d0aa5b 744 page = alloc_pages(GFP_KERNEL|__GFP_NOWARN, get_order(memmap_size));
0b0acbec
DH
745 if (page)
746 goto got_map_page;
747
748 ret = vmalloc(memmap_size);
749 if (ret)
750 goto got_map_ptr;
751
752 return NULL;
753got_map_page:
754 ret = (struct page *)pfn_to_kaddr(page_to_pfn(page));
755got_map_ptr:
0b0acbec
DH
756
757 return ret;
758}
759
7b73d978
CH
760static inline struct page *kmalloc_section_memmap(unsigned long pnum, int nid,
761 struct vmem_altmap *altmap)
98f3cfc1 762{
85b35fea 763 return __kmalloc_section_memmap();
98f3cfc1
YG
764}
765
24b6d416
CH
766static void __kfree_section_memmap(struct page *memmap,
767 struct vmem_altmap *altmap)
0b0acbec 768{
9e2779fa 769 if (is_vmalloc_addr(memmap))
0b0acbec
DH
770 vfree(memmap);
771 else
772 free_pages((unsigned long)memmap,
85b35fea 773 get_order(sizeof(struct page) * PAGES_PER_SECTION));
0b0acbec 774}
0c0a4a51 775
4edd7cef 776#ifdef CONFIG_MEMORY_HOTREMOVE
81556b02 777static void free_map_bootmem(struct page *memmap)
0c0a4a51
YG
778{
779 unsigned long maps_section_nr, removing_section_nr, i;
81556b02 780 unsigned long magic, nr_pages;
ae64ffca 781 struct page *page = virt_to_page(memmap);
0c0a4a51 782
81556b02
ZY
783 nr_pages = PAGE_ALIGN(PAGES_PER_SECTION * sizeof(struct page))
784 >> PAGE_SHIFT;
785
0c0a4a51 786 for (i = 0; i < nr_pages; i++, page++) {
ddffe98d 787 magic = (unsigned long) page->freelist;
0c0a4a51
YG
788
789 BUG_ON(magic == NODE_INFO);
790
791 maps_section_nr = pfn_to_section_nr(page_to_pfn(page));
857e522a 792 removing_section_nr = page_private(page);
0c0a4a51
YG
793
794 /*
795 * When this function is called, the removing section is
796 * logical offlined state. This means all pages are isolated
797 * from page allocator. If removing section's memmap is placed
798 * on the same section, it must not be freed.
799 * If it is freed, page allocator may allocate it which will
800 * be removed physically soon.
801 */
802 if (maps_section_nr != removing_section_nr)
803 put_page_bootmem(page);
804 }
805}
4edd7cef 806#endif /* CONFIG_MEMORY_HOTREMOVE */
98f3cfc1 807#endif /* CONFIG_SPARSEMEM_VMEMMAP */
0b0acbec 808
29751f69
AW
809/*
810 * returns the number of sections whose mem_maps were properly
811 * set. If this is <=0, then that means that the passed-in
812 * map was not consumed and must be freed.
813 */
7b73d978
CH
814int __meminit sparse_add_one_section(struct pglist_data *pgdat,
815 unsigned long start_pfn, struct vmem_altmap *altmap)
29751f69 816{
0b0acbec 817 unsigned long section_nr = pfn_to_section_nr(start_pfn);
0b0acbec
DH
818 struct mem_section *ms;
819 struct page *memmap;
5c0e3066 820 unsigned long *usemap;
0b0acbec
DH
821 unsigned long flags;
822 int ret;
29751f69 823
0b0acbec
DH
824 /*
825 * no locking for this, because it does its own
826 * plus, it does a kmalloc
827 */
bbd06825
WC
828 ret = sparse_index_init(section_nr, pgdat->node_id);
829 if (ret < 0 && ret != -EEXIST)
830 return ret;
4e40987f 831 ret = 0;
7b73d978 832 memmap = kmalloc_section_memmap(section_nr, pgdat->node_id, altmap);
bbd06825
WC
833 if (!memmap)
834 return -ENOMEM;
5c0e3066 835 usemap = __kmalloc_section_usemap();
bbd06825 836 if (!usemap) {
24b6d416 837 __kfree_section_memmap(memmap, altmap);
bbd06825
WC
838 return -ENOMEM;
839 }
0b0acbec
DH
840
841 pgdat_resize_lock(pgdat, &flags);
29751f69 842
0b0acbec
DH
843 ms = __pfn_to_section(start_pfn);
844 if (ms->section_mem_map & SECTION_MARKED_PRESENT) {
845 ret = -EEXIST;
846 goto out;
847 }
5c0e3066 848
d0dc12e8
PT
849#ifdef CONFIG_DEBUG_VM
850 /*
851 * Poison uninitialized struct pages in order to catch invalid flags
852 * combinations.
853 */
854 memset(memmap, PAGE_POISON_PATTERN, sizeof(struct page) * PAGES_PER_SECTION);
855#endif
3ac19f8e 856
c4e1be9e 857 section_mark_present(ms);
4e40987f 858 sparse_init_one_section(ms, section_nr, memmap, usemap);
0b0acbec 859
0b0acbec
DH
860out:
861 pgdat_resize_unlock(pgdat, &flags);
4e40987f 862 if (ret < 0) {
bbd06825 863 kfree(usemap);
24b6d416 864 __kfree_section_memmap(memmap, altmap);
bbd06825 865 }
0b0acbec 866 return ret;
29751f69 867}
ea01ea93 868
f3deb687 869#ifdef CONFIG_MEMORY_HOTREMOVE
95a4774d
WC
870#ifdef CONFIG_MEMORY_FAILURE
871static void clear_hwpoisoned_pages(struct page *memmap, int nr_pages)
872{
873 int i;
874
875 if (!memmap)
876 return;
877
4b94ffdc 878 for (i = 0; i < nr_pages; i++) {
95a4774d 879 if (PageHWPoison(&memmap[i])) {
293c07e3 880 atomic_long_sub(1, &num_poisoned_pages);
95a4774d
WC
881 ClearPageHWPoison(&memmap[i]);
882 }
883 }
884}
885#else
886static inline void clear_hwpoisoned_pages(struct page *memmap, int nr_pages)
887{
888}
889#endif
890
24b6d416
CH
891static void free_section_usemap(struct page *memmap, unsigned long *usemap,
892 struct vmem_altmap *altmap)
4edd7cef
DR
893{
894 struct page *usemap_page;
4edd7cef
DR
895
896 if (!usemap)
897 return;
898
899 usemap_page = virt_to_page(usemap);
900 /*
901 * Check to see if allocation came from hot-plug-add
902 */
903 if (PageSlab(usemap_page) || PageCompound(usemap_page)) {
904 kfree(usemap);
905 if (memmap)
24b6d416 906 __kfree_section_memmap(memmap, altmap);
4edd7cef
DR
907 return;
908 }
909
910 /*
911 * The usemap came from bootmem. This is packed with other usemaps
912 * on the section which has pgdat at boot time. Just keep it as is now.
913 */
914
81556b02
ZY
915 if (memmap)
916 free_map_bootmem(memmap);
4edd7cef
DR
917}
918
4b94ffdc 919void sparse_remove_one_section(struct zone *zone, struct mem_section *ms,
24b6d416 920 unsigned long map_offset, struct vmem_altmap *altmap)
ea01ea93
BP
921{
922 struct page *memmap = NULL;
cd099682
TC
923 unsigned long *usemap = NULL, flags;
924 struct pglist_data *pgdat = zone->zone_pgdat;
ea01ea93 925
cd099682 926 pgdat_resize_lock(pgdat, &flags);
ea01ea93
BP
927 if (ms->section_mem_map) {
928 usemap = ms->pageblock_flags;
929 memmap = sparse_decode_mem_map(ms->section_mem_map,
930 __section_nr(ms));
931 ms->section_mem_map = 0;
932 ms->pageblock_flags = NULL;
933 }
cd099682 934 pgdat_resize_unlock(pgdat, &flags);
ea01ea93 935
4b94ffdc
DW
936 clear_hwpoisoned_pages(memmap + map_offset,
937 PAGES_PER_SECTION - map_offset);
24b6d416 938 free_section_usemap(memmap, usemap, altmap);
ea01ea93 939}
4edd7cef
DR
940#endif /* CONFIG_MEMORY_HOTREMOVE */
941#endif /* CONFIG_MEMORY_HOTPLUG */