mm/sparse: set SECTION_NID_SHIFT to 6
[linux-2.6-block.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 7#include <linux/mmzone.h>
97ad1087 8#include <linux/memblock.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>
9f82883c
AS
14#include <linux/swap.h>
15#include <linux/swapops.h>
426e5c42 16#include <linux/bootmem_info.h>
3b32123d 17
0c0a4a51 18#include "internal.h"
d41dee36
AW
19#include <asm/dma.h>
20
21/*
22 * Permanent SPARSEMEM data:
23 *
24 * 1) mem_section - memory sections, mem_map's for valid memory
25 */
3e347261 26#ifdef CONFIG_SPARSEMEM_EXTREME
83e3c487 27struct mem_section **mem_section;
3e347261
BP
28#else
29struct mem_section mem_section[NR_SECTION_ROOTS][SECTIONS_PER_ROOT]
22fc6ecc 30 ____cacheline_internodealigned_in_smp;
3e347261
BP
31#endif
32EXPORT_SYMBOL(mem_section);
33
89689ae7
CL
34#ifdef NODE_NOT_IN_PAGE_FLAGS
35/*
36 * If we did not store the node number in the page then we have to
37 * do a lookup in the section_to_node_table in order to find which
38 * node the page belongs to.
39 */
40#if MAX_NUMNODES <= 256
41static u8 section_to_node_table[NR_MEM_SECTIONS] __cacheline_aligned;
42#else
43static u16 section_to_node_table[NR_MEM_SECTIONS] __cacheline_aligned;
44#endif
45
33dd4e0e 46int page_to_nid(const struct page *page)
89689ae7
CL
47{
48 return section_to_node_table[page_to_section(page)];
49}
50EXPORT_SYMBOL(page_to_nid);
85770ffe
AW
51
52static void set_section_nid(unsigned long section_nr, int nid)
53{
54 section_to_node_table[section_nr] = nid;
55}
56#else /* !NODE_NOT_IN_PAGE_FLAGS */
57static inline void set_section_nid(unsigned long section_nr, int nid)
58{
59}
89689ae7
CL
60#endif
61
3e347261 62#ifdef CONFIG_SPARSEMEM_EXTREME
bd721ea7 63static noinline struct mem_section __ref *sparse_index_alloc(int nid)
28ae55c9
DH
64{
65 struct mem_section *section = NULL;
66 unsigned long array_size = SECTIONS_PER_ROOT *
67 sizeof(struct mem_section);
68
8a7f97b9 69 if (slab_is_available()) {
b95046b0 70 section = kzalloc_node(array_size, GFP_KERNEL, nid);
8a7f97b9 71 } else {
7e1c4e27
MR
72 section = memblock_alloc_node(array_size, SMP_CACHE_BYTES,
73 nid);
8a7f97b9
MR
74 if (!section)
75 panic("%s: Failed to allocate %lu bytes nid=%d\n",
76 __func__, array_size, nid);
77 }
28ae55c9
DH
78
79 return section;
3e347261 80}
802f192e 81
a3142c8e 82static int __meminit sparse_index_init(unsigned long section_nr, int nid)
802f192e 83{
28ae55c9
DH
84 unsigned long root = SECTION_NR_TO_ROOT(section_nr);
85 struct mem_section *section;
802f192e 86
ba72b4c8
DW
87 /*
88 * An existing section is possible in the sub-section hotplug
89 * case. First hot-add instantiates, follow-on hot-add reuses
90 * the existing section.
91 *
92 * The mem_hotplug_lock resolves the apparent race below.
93 */
802f192e 94 if (mem_section[root])
ba72b4c8 95 return 0;
3e347261 96
28ae55c9 97 section = sparse_index_alloc(nid);
af0cd5a7
WC
98 if (!section)
99 return -ENOMEM;
28ae55c9
DH
100
101 mem_section[root] = section;
c1c95183 102
9d1936cf 103 return 0;
28ae55c9
DH
104}
105#else /* !SPARSEMEM_EXTREME */
106static inline int sparse_index_init(unsigned long section_nr, int nid)
107{
108 return 0;
802f192e 109}
28ae55c9
DH
110#endif
111
30c253e6
AW
112/*
113 * During early boot, before section_mem_map is used for an actual
114 * mem_map, we use section_mem_map to store the section's NUMA
115 * node. This keeps us from having to use another data structure. The
116 * node information is cleared just before we store the real mem_map.
117 */
118static inline unsigned long sparse_encode_early_nid(int nid)
119{
120 return (nid << SECTION_NID_SHIFT);
121}
122
123static inline int sparse_early_nid(struct mem_section *section)
124{
125 return (section->section_mem_map >> SECTION_NID_SHIFT);
126}
127
2dbb51c4
MG
128/* Validate the physical addressing limitations of the model */
129void __meminit mminit_validate_memmodel_limits(unsigned long *start_pfn,
130 unsigned long *end_pfn)
d41dee36 131{
2dbb51c4 132 unsigned long max_sparsemem_pfn = 1UL << (MAX_PHYSMEM_BITS-PAGE_SHIFT);
d41dee36 133
bead9a3a
IM
134 /*
135 * Sanity checks - do not allow an architecture to pass
136 * in larger pfns than the maximum scope of sparsemem:
137 */
2dbb51c4
MG
138 if (*start_pfn > max_sparsemem_pfn) {
139 mminit_dprintk(MMINIT_WARNING, "pfnvalidation",
140 "Start of range %lu -> %lu exceeds SPARSEMEM max %lu\n",
141 *start_pfn, *end_pfn, max_sparsemem_pfn);
142 WARN_ON_ONCE(1);
143 *start_pfn = max_sparsemem_pfn;
144 *end_pfn = max_sparsemem_pfn;
ef161a98 145 } else if (*end_pfn > max_sparsemem_pfn) {
2dbb51c4
MG
146 mminit_dprintk(MMINIT_WARNING, "pfnvalidation",
147 "End of range %lu -> %lu exceeds SPARSEMEM max %lu\n",
148 *start_pfn, *end_pfn, max_sparsemem_pfn);
149 WARN_ON_ONCE(1);
150 *end_pfn = max_sparsemem_pfn;
151 }
152}
153
c4e1be9e
DH
154/*
155 * There are a number of times that we loop over NR_MEM_SECTIONS,
156 * looking for section_present() on each. But, when we have very
157 * large physical address spaces, NR_MEM_SECTIONS can also be
158 * very large which makes the loops quite long.
159 *
160 * Keeping track of this gives us an easy way to break out of
161 * those loops early.
162 */
2491f0a2 163unsigned long __highest_present_section_nr;
a1bc561b
OK
164static void __section_mark_present(struct mem_section *ms,
165 unsigned long section_nr)
c4e1be9e 166{
c4e1be9e
DH
167 if (section_nr > __highest_present_section_nr)
168 __highest_present_section_nr = section_nr;
169
170 ms->section_mem_map |= SECTION_MARKED_PRESENT;
171}
172
c4e1be9e
DH
173#define for_each_present_section_nr(start, section_nr) \
174 for (section_nr = next_present_section_nr(start-1); \
d778015a 175 ((section_nr != -1) && \
c4e1be9e
DH
176 (section_nr <= __highest_present_section_nr)); \
177 section_nr = next_present_section_nr(section_nr))
178
85c77f79
PT
179static inline unsigned long first_present_section_nr(void)
180{
181 return next_present_section_nr(-1);
182}
183
0a9f9f62 184#ifdef CONFIG_SPARSEMEM_VMEMMAP
758b8db4 185static void subsection_mask_set(unsigned long *map, unsigned long pfn,
f46edbd1
DW
186 unsigned long nr_pages)
187{
188 int idx = subsection_map_index(pfn);
189 int end = subsection_map_index(pfn + nr_pages - 1);
190
191 bitmap_set(map, idx, end - idx + 1);
192}
193
194void __init subsection_map_init(unsigned long pfn, unsigned long nr_pages)
195{
196 int end_sec = pfn_to_section_nr(pfn + nr_pages - 1);
9a845030 197 unsigned long nr, start_sec = pfn_to_section_nr(pfn);
f46edbd1
DW
198
199 if (!nr_pages)
200 return;
201
9a845030 202 for (nr = start_sec; nr <= end_sec; nr++) {
f46edbd1
DW
203 struct mem_section *ms;
204 unsigned long pfns;
205
206 pfns = min(nr_pages, PAGES_PER_SECTION
207 - (pfn & ~PAGE_SECTION_MASK));
9a845030 208 ms = __nr_to_section(nr);
f46edbd1
DW
209 subsection_mask_set(ms->usage->subsection_map, pfn, pfns);
210
9a845030 211 pr_debug("%s: sec: %lu pfns: %lu set(%d, %d)\n", __func__, nr,
f46edbd1
DW
212 pfns, subsection_map_index(pfn),
213 subsection_map_index(pfn + pfns - 1));
214
215 pfn += pfns;
216 nr_pages -= pfns;
217 }
218}
0a9f9f62
BH
219#else
220void __init subsection_map_init(unsigned long pfn, unsigned long nr_pages)
221{
222}
223#endif
f46edbd1 224
2dbb51c4 225/* Record a memory area against a node. */
c89ab04f 226static void __init memory_present(int nid, unsigned long start, unsigned long end)
2dbb51c4
MG
227{
228 unsigned long pfn;
bead9a3a 229
629a359b
KS
230#ifdef CONFIG_SPARSEMEM_EXTREME
231 if (unlikely(!mem_section)) {
232 unsigned long size, align;
233
68d68ff6 234 size = sizeof(struct mem_section *) * NR_SECTION_ROOTS;
629a359b 235 align = 1 << (INTERNODE_CACHE_SHIFT);
eb31d559 236 mem_section = memblock_alloc(size, align);
8a7f97b9
MR
237 if (!mem_section)
238 panic("%s: Failed to allocate %lu bytes align=0x%lx\n",
239 __func__, size, align);
629a359b
KS
240 }
241#endif
242
d41dee36 243 start &= PAGE_SECTION_MASK;
2dbb51c4 244 mminit_validate_memmodel_limits(&start, &end);
d41dee36
AW
245 for (pfn = start; pfn < end; pfn += PAGES_PER_SECTION) {
246 unsigned long section = pfn_to_section_nr(pfn);
802f192e
BP
247 struct mem_section *ms;
248
249 sparse_index_init(section, nid);
85770ffe 250 set_section_nid(section, nid);
802f192e
BP
251
252 ms = __nr_to_section(section);
c4e1be9e 253 if (!ms->section_mem_map) {
2d070eab
MH
254 ms->section_mem_map = sparse_encode_early_nid(nid) |
255 SECTION_IS_ONLINE;
a1bc561b 256 __section_mark_present(ms, section);
c4e1be9e 257 }
d41dee36
AW
258 }
259}
260
9def36e0 261/*
c89ab04f
MR
262 * Mark all memblocks as present using memory_present().
263 * This is a convenience function that is useful to mark all of the systems
264 * memory as present during initialization.
9def36e0 265 */
c89ab04f 266static void __init memblocks_present(void)
9def36e0 267{
c9118e6c
MR
268 unsigned long start, end;
269 int i, nid;
9def36e0 270
c9118e6c
MR
271 for_each_mem_pfn_range(i, MAX_NUMNODES, &start, &end, &nid)
272 memory_present(nid, start, end);
9def36e0
LG
273}
274
29751f69
AW
275/*
276 * Subtle, we encode the real pfn into the mem_map such that
277 * the identity pfn - section_mem_map will return the actual
278 * physical page frame number.
279 */
280static unsigned long sparse_encode_mem_map(struct page *mem_map, unsigned long pnum)
281{
def9b71e
PT
282 unsigned long coded_mem_map =
283 (unsigned long)(mem_map - (section_nr_to_pfn(pnum)));
284 BUILD_BUG_ON(SECTION_MAP_LAST_BIT > (1UL<<PFN_SECTION_SHIFT));
285 BUG_ON(coded_mem_map & ~SECTION_MAP_MASK);
286 return coded_mem_map;
29751f69
AW
287}
288
3a0aaefe 289#ifdef CONFIG_MEMORY_HOTPLUG
29751f69 290/*
ea01ea93 291 * Decode mem_map from the coded memmap
29751f69 292 */
29751f69
AW
293struct page *sparse_decode_mem_map(unsigned long coded_mem_map, unsigned long pnum)
294{
ea01ea93
BP
295 /* mask off the extra low bits of information */
296 coded_mem_map &= SECTION_MAP_MASK;
29751f69
AW
297 return ((struct page *)coded_mem_map) + section_nr_to_pfn(pnum);
298}
3a0aaefe 299#endif /* CONFIG_MEMORY_HOTPLUG */
29751f69 300
4e40987f 301static void __meminit sparse_init_one_section(struct mem_section *ms,
5c0e3066 302 unsigned long pnum, struct page *mem_map,
326e1b8f 303 struct mem_section_usage *usage, unsigned long flags)
29751f69 304{
30c253e6 305 ms->section_mem_map &= ~SECTION_MAP_MASK;
326e1b8f
DW
306 ms->section_mem_map |= sparse_encode_mem_map(mem_map, pnum)
307 | SECTION_HAS_MEM_MAP | flags;
f1eca35a 308 ms->usage = usage;
29751f69
AW
309}
310
f1eca35a 311static unsigned long usemap_size(void)
5c0e3066 312{
60a7a88d 313 return BITS_TO_LONGS(SECTION_BLOCKFLAGS_BITS) * sizeof(unsigned long);
5c0e3066
MG
314}
315
f1eca35a 316size_t mem_section_usage_size(void)
5c0e3066 317{
f1eca35a 318 return sizeof(struct mem_section_usage) + usemap_size();
5c0e3066 319}
5c0e3066 320
ccbd6283
MC
321static inline phys_addr_t pgdat_to_phys(struct pglist_data *pgdat)
322{
a9ee6cf5 323#ifndef CONFIG_NUMA
ccbd6283
MC
324 return __pa_symbol(pgdat);
325#else
326 return __pa(pgdat);
327#endif
328}
329
48c90682 330#ifdef CONFIG_MEMORY_HOTREMOVE
f1eca35a 331static struct mem_section_usage * __init
a4322e1b 332sparse_early_usemaps_alloc_pgdat_section(struct pglist_data *pgdat,
238305bb 333 unsigned long size)
48c90682 334{
f1eca35a 335 struct mem_section_usage *usage;
99ab7b19 336 unsigned long goal, limit;
99ab7b19 337 int nid;
48c90682
YG
338 /*
339 * A page may contain usemaps for other sections preventing the
340 * page being freed and making a section unremovable while
c800bcd5 341 * other sections referencing the usemap remain active. Similarly,
48c90682
YG
342 * a pgdat can prevent a section being removed. If section A
343 * contains a pgdat and section B contains the usemap, both
344 * sections become inter-dependent. This allocates usemaps
345 * from the same section as the pgdat where possible to avoid
346 * this problem.
347 */
ccbd6283 348 goal = pgdat_to_phys(pgdat) & (PAGE_SECTION_MASK << PAGE_SHIFT);
99ab7b19
YL
349 limit = goal + (1UL << PA_SECTION_SHIFT);
350 nid = early_pfn_to_nid(goal >> PAGE_SHIFT);
351again:
f1eca35a
DW
352 usage = memblock_alloc_try_nid(size, SMP_CACHE_BYTES, goal, limit, nid);
353 if (!usage && limit) {
99ab7b19
YL
354 limit = 0;
355 goto again;
356 }
f1eca35a 357 return usage;
48c90682
YG
358}
359
f1eca35a
DW
360static void __init check_usemap_section_nr(int nid,
361 struct mem_section_usage *usage)
48c90682
YG
362{
363 unsigned long usemap_snr, pgdat_snr;
83e3c487
KS
364 static unsigned long old_usemap_snr;
365 static unsigned long old_pgdat_snr;
48c90682
YG
366 struct pglist_data *pgdat = NODE_DATA(nid);
367 int usemap_nid;
368
83e3c487
KS
369 /* First call */
370 if (!old_usemap_snr) {
371 old_usemap_snr = NR_MEM_SECTIONS;
372 old_pgdat_snr = NR_MEM_SECTIONS;
373 }
374
f1eca35a 375 usemap_snr = pfn_to_section_nr(__pa(usage) >> PAGE_SHIFT);
ccbd6283 376 pgdat_snr = pfn_to_section_nr(pgdat_to_phys(pgdat) >> PAGE_SHIFT);
48c90682
YG
377 if (usemap_snr == pgdat_snr)
378 return;
379
380 if (old_usemap_snr == usemap_snr && old_pgdat_snr == pgdat_snr)
381 /* skip redundant message */
382 return;
383
384 old_usemap_snr = usemap_snr;
385 old_pgdat_snr = pgdat_snr;
386
387 usemap_nid = sparse_early_nid(__nr_to_section(usemap_snr));
388 if (usemap_nid != nid) {
1170532b
JP
389 pr_info("node %d must be removed before remove section %ld\n",
390 nid, usemap_snr);
48c90682
YG
391 return;
392 }
393 /*
394 * There is a circular dependency.
395 * Some platforms allow un-removable section because they will just
396 * gather other removable sections for dynamic partitioning.
397 * Just notify un-removable section's number here.
398 */
1170532b
JP
399 pr_info("Section %ld and %ld (node %d) have a circular dependency on usemap and pgdat allocations\n",
400 usemap_snr, pgdat_snr, nid);
48c90682
YG
401}
402#else
f1eca35a 403static struct mem_section_usage * __init
a4322e1b 404sparse_early_usemaps_alloc_pgdat_section(struct pglist_data *pgdat,
238305bb 405 unsigned long size)
48c90682 406{
26fb3dae 407 return memblock_alloc_node(size, SMP_CACHE_BYTES, pgdat->node_id);
48c90682
YG
408}
409
f1eca35a
DW
410static void __init check_usemap_section_nr(int nid,
411 struct mem_section_usage *usage)
48c90682
YG
412{
413}
414#endif /* CONFIG_MEMORY_HOTREMOVE */
415
35fd1eb1 416#ifdef CONFIG_SPARSEMEM_VMEMMAP
afda57bc 417static unsigned long __init section_map_size(void)
35fd1eb1
PT
418{
419 return ALIGN(sizeof(struct page) * PAGES_PER_SECTION, PMD_SIZE);
420}
421
422#else
afda57bc 423static unsigned long __init section_map_size(void)
e131c06b
PT
424{
425 return PAGE_ALIGN(sizeof(struct page) * PAGES_PER_SECTION);
426}
427
e9c0a3f0
DW
428struct page __init *__populate_section_memmap(unsigned long pfn,
429 unsigned long nr_pages, int nid, struct vmem_altmap *altmap)
29751f69 430{
e131c06b
PT
431 unsigned long size = section_map_size();
432 struct page *map = sparse_buffer_alloc(size);
8a7f97b9 433 phys_addr_t addr = __pa(MAX_DMA_ADDRESS);
e131c06b
PT
434
435 if (map)
436 return map;
29751f69 437
09dbcf42 438 map = memblock_alloc_try_nid_raw(size, size, addr,
97ad1087 439 MEMBLOCK_ALLOC_ACCESSIBLE, nid);
8a7f97b9
MR
440 if (!map)
441 panic("%s: Failed to allocate %lu bytes align=0x%lx nid=%d from=%pa\n",
442 __func__, size, PAGE_SIZE, nid, &addr);
443
8f6aac41
CL
444 return map;
445}
446#endif /* !CONFIG_SPARSEMEM_VMEMMAP */
447
35fd1eb1
PT
448static void *sparsemap_buf __meminitdata;
449static void *sparsemap_buf_end __meminitdata;
450
ae831894
LC
451static inline void __meminit sparse_buffer_free(unsigned long size)
452{
453 WARN_ON(!sparsemap_buf || size == 0);
454 memblock_free_early(__pa(sparsemap_buf), size);
455}
456
afda57bc 457static void __init sparse_buffer_init(unsigned long size, int nid)
35fd1eb1 458{
8a7f97b9 459 phys_addr_t addr = __pa(MAX_DMA_ADDRESS);
35fd1eb1 460 WARN_ON(sparsemap_buf); /* forgot to call sparse_buffer_fini()? */
09dbcf42
MH
461 /*
462 * Pre-allocated buffer is mainly used by __populate_section_memmap
463 * and we want it to be properly aligned to the section size - this is
464 * especially the case for VMEMMAP which maps memmap to PMDs
465 */
0ac398b1 466 sparsemap_buf = memblock_alloc_exact_nid_raw(size, section_map_size(),
09dbcf42 467 addr, MEMBLOCK_ALLOC_ACCESSIBLE, nid);
35fd1eb1
PT
468 sparsemap_buf_end = sparsemap_buf + size;
469}
470
afda57bc 471static void __init sparse_buffer_fini(void)
35fd1eb1
PT
472{
473 unsigned long size = sparsemap_buf_end - sparsemap_buf;
474
475 if (sparsemap_buf && size > 0)
ae831894 476 sparse_buffer_free(size);
35fd1eb1
PT
477 sparsemap_buf = NULL;
478}
479
480void * __meminit sparse_buffer_alloc(unsigned long size)
481{
482 void *ptr = NULL;
483
484 if (sparsemap_buf) {
db57e98d 485 ptr = (void *) roundup((unsigned long)sparsemap_buf, size);
35fd1eb1
PT
486 if (ptr + size > sparsemap_buf_end)
487 ptr = NULL;
ae831894
LC
488 else {
489 /* Free redundant aligned space */
490 if ((unsigned long)(ptr - sparsemap_buf) > 0)
491 sparse_buffer_free((unsigned long)(ptr - sparsemap_buf));
35fd1eb1 492 sparsemap_buf = ptr + size;
ae831894 493 }
35fd1eb1
PT
494 }
495 return ptr;
496}
497
3b32123d 498void __weak __meminit vmemmap_populate_print_last(void)
c2b91e2e
YL
499{
500}
a4322e1b 501
85c77f79
PT
502/*
503 * Initialize sparse on a specific node. The node spans [pnum_begin, pnum_end)
504 * And number of present sections in this node is map_count.
505 */
506static void __init sparse_init_nid(int nid, unsigned long pnum_begin,
507 unsigned long pnum_end,
508 unsigned long map_count)
509{
f1eca35a
DW
510 struct mem_section_usage *usage;
511 unsigned long pnum;
85c77f79
PT
512 struct page *map;
513
f1eca35a
DW
514 usage = sparse_early_usemaps_alloc_pgdat_section(NODE_DATA(nid),
515 mem_section_usage_size() * map_count);
516 if (!usage) {
85c77f79
PT
517 pr_err("%s: node[%d] usemap allocation failed", __func__, nid);
518 goto failed;
519 }
520 sparse_buffer_init(map_count * section_map_size(), nid);
521 for_each_present_section_nr(pnum_begin, pnum) {
e9c0a3f0
DW
522 unsigned long pfn = section_nr_to_pfn(pnum);
523
85c77f79
PT
524 if (pnum >= pnum_end)
525 break;
526
e9c0a3f0
DW
527 map = __populate_section_memmap(pfn, PAGES_PER_SECTION,
528 nid, NULL);
85c77f79
PT
529 if (!map) {
530 pr_err("%s: node[%d] memory map backing failed. Some memory will not be available.",
531 __func__, nid);
532 pnum_begin = pnum;
2284f47f 533 sparse_buffer_fini();
85c77f79
PT
534 goto failed;
535 }
f1eca35a 536 check_usemap_section_nr(nid, usage);
326e1b8f
DW
537 sparse_init_one_section(__nr_to_section(pnum), pnum, map, usage,
538 SECTION_IS_EARLY);
f1eca35a 539 usage = (void *) usage + mem_section_usage_size();
85c77f79
PT
540 }
541 sparse_buffer_fini();
542 return;
543failed:
544 /* We failed to allocate, mark all the following pnums as not present */
545 for_each_present_section_nr(pnum_begin, pnum) {
546 struct mem_section *ms;
547
548 if (pnum >= pnum_end)
549 break;
550 ms = __nr_to_section(pnum);
551 ms->section_mem_map = 0;
552 }
553}
554
555/*
556 * Allocate the accumulated non-linear sections, allocate a mem_map
557 * for each and record the physical to section mapping.
558 */
2a3cb8ba 559void __init sparse_init(void)
85c77f79 560{
c89ab04f
MR
561 unsigned long pnum_end, pnum_begin, map_count = 1;
562 int nid_begin;
563
564 memblocks_present();
565
566 pnum_begin = first_present_section_nr();
567 nid_begin = sparse_early_nid(__nr_to_section(pnum_begin));
85c77f79
PT
568
569 /* Setup pageblock_order for HUGETLB_PAGE_SIZE_VARIABLE */
570 set_pageblock_order();
571
572 for_each_present_section_nr(pnum_begin + 1, pnum_end) {
573 int nid = sparse_early_nid(__nr_to_section(pnum_end));
574
575 if (nid == nid_begin) {
576 map_count++;
577 continue;
578 }
579 /* Init node with sections in range [pnum_begin, pnum_end) */
580 sparse_init_nid(nid_begin, pnum_begin, pnum_end, map_count);
581 nid_begin = nid;
582 pnum_begin = pnum_end;
583 map_count = 1;
584 }
585 /* cover the last node */
586 sparse_init_nid(nid_begin, pnum_begin, pnum_end, map_count);
587 vmemmap_populate_print_last();
588}
589
193faea9 590#ifdef CONFIG_MEMORY_HOTPLUG
2d070eab
MH
591
592/* Mark all memory sections within the pfn range as online */
593void online_mem_sections(unsigned long start_pfn, unsigned long end_pfn)
594{
595 unsigned long pfn;
596
597 for (pfn = start_pfn; pfn < end_pfn; pfn += PAGES_PER_SECTION) {
b4ccec41 598 unsigned long section_nr = pfn_to_section_nr(pfn);
2d070eab
MH
599 struct mem_section *ms;
600
601 /* onlining code should never touch invalid ranges */
602 if (WARN_ON(!valid_section_nr(section_nr)))
603 continue;
604
605 ms = __nr_to_section(section_nr);
606 ms->section_mem_map |= SECTION_IS_ONLINE;
607 }
608}
609
9b7ea46a 610/* Mark all memory sections within the pfn range as offline */
2d070eab
MH
611void offline_mem_sections(unsigned long start_pfn, unsigned long end_pfn)
612{
613 unsigned long pfn;
614
615 for (pfn = start_pfn; pfn < end_pfn; pfn += PAGES_PER_SECTION) {
27227c73 616 unsigned long section_nr = pfn_to_section_nr(pfn);
2d070eab
MH
617 struct mem_section *ms;
618
619 /*
620 * TODO this needs some double checking. Offlining code makes
621 * sure to check pfn_valid but those checks might be just bogus
622 */
623 if (WARN_ON(!valid_section_nr(section_nr)))
624 continue;
625
626 ms = __nr_to_section(section_nr);
627 ms->section_mem_map &= ~SECTION_IS_ONLINE;
628 }
629}
2d070eab 630
98f3cfc1 631#ifdef CONFIG_SPARSEMEM_VMEMMAP
030eab4f 632static struct page * __meminit populate_section_memmap(unsigned long pfn,
e9c0a3f0 633 unsigned long nr_pages, int nid, struct vmem_altmap *altmap)
98f3cfc1 634{
e9c0a3f0 635 return __populate_section_memmap(pfn, nr_pages, nid, altmap);
98f3cfc1 636}
e9c0a3f0
DW
637
638static void depopulate_section_memmap(unsigned long pfn, unsigned long nr_pages,
24b6d416 639 struct vmem_altmap *altmap)
98f3cfc1 640{
e9c0a3f0
DW
641 unsigned long start = (unsigned long) pfn_to_page(pfn);
642 unsigned long end = start + nr_pages * sizeof(struct page);
0aad818b 643
24b6d416 644 vmemmap_free(start, end, altmap);
98f3cfc1 645}
81556b02 646static void free_map_bootmem(struct page *memmap)
0c0a4a51 647{
0aad818b 648 unsigned long start = (unsigned long)memmap;
81556b02 649 unsigned long end = (unsigned long)(memmap + PAGES_PER_SECTION);
0aad818b 650
24b6d416 651 vmemmap_free(start, end, NULL);
0c0a4a51 652}
6ecb0fc6
BH
653
654static int clear_subsection_map(unsigned long pfn, unsigned long nr_pages)
655{
656 DECLARE_BITMAP(map, SUBSECTIONS_PER_SECTION) = { 0 };
657 DECLARE_BITMAP(tmp, SUBSECTIONS_PER_SECTION) = { 0 };
658 struct mem_section *ms = __pfn_to_section(pfn);
659 unsigned long *subsection_map = ms->usage
660 ? &ms->usage->subsection_map[0] : NULL;
661
662 subsection_mask_set(map, pfn, nr_pages);
663 if (subsection_map)
664 bitmap_and(tmp, map, subsection_map, SUBSECTIONS_PER_SECTION);
665
666 if (WARN(!subsection_map || !bitmap_equal(tmp, map, SUBSECTIONS_PER_SECTION),
667 "section already deactivated (%#lx + %ld)\n",
668 pfn, nr_pages))
669 return -EINVAL;
670
671 bitmap_xor(subsection_map, map, subsection_map, SUBSECTIONS_PER_SECTION);
672 return 0;
673}
674
675static bool is_subsection_map_empty(struct mem_section *ms)
676{
677 return bitmap_empty(&ms->usage->subsection_map[0],
678 SUBSECTIONS_PER_SECTION);
679}
680
681static int fill_subsection_map(unsigned long pfn, unsigned long nr_pages)
682{
683 struct mem_section *ms = __pfn_to_section(pfn);
684 DECLARE_BITMAP(map, SUBSECTIONS_PER_SECTION) = { 0 };
685 unsigned long *subsection_map;
686 int rc = 0;
687
688 subsection_mask_set(map, pfn, nr_pages);
689
690 subsection_map = &ms->usage->subsection_map[0];
691
692 if (bitmap_empty(map, SUBSECTIONS_PER_SECTION))
693 rc = -EINVAL;
694 else if (bitmap_intersects(map, subsection_map, SUBSECTIONS_PER_SECTION))
695 rc = -EEXIST;
696 else
697 bitmap_or(subsection_map, map, subsection_map,
698 SUBSECTIONS_PER_SECTION);
699
700 return rc;
701}
98f3cfc1 702#else
030eab4f 703struct page * __meminit populate_section_memmap(unsigned long pfn,
e9c0a3f0 704 unsigned long nr_pages, int nid, struct vmem_altmap *altmap)
0b0acbec 705{
4027149a
BH
706 return kvmalloc_node(array_size(sizeof(struct page),
707 PAGES_PER_SECTION), GFP_KERNEL, nid);
0b0acbec
DH
708}
709
e9c0a3f0 710static void depopulate_section_memmap(unsigned long pfn, unsigned long nr_pages,
7b73d978 711 struct vmem_altmap *altmap)
98f3cfc1 712{
3af776f6 713 kvfree(pfn_to_page(pfn));
0b0acbec 714}
0c0a4a51 715
81556b02 716static void free_map_bootmem(struct page *memmap)
0c0a4a51
YG
717{
718 unsigned long maps_section_nr, removing_section_nr, i;
81556b02 719 unsigned long magic, nr_pages;
ae64ffca 720 struct page *page = virt_to_page(memmap);
0c0a4a51 721
81556b02
ZY
722 nr_pages = PAGE_ALIGN(PAGES_PER_SECTION * sizeof(struct page))
723 >> PAGE_SHIFT;
724
0c0a4a51 725 for (i = 0; i < nr_pages; i++, page++) {
ddffe98d 726 magic = (unsigned long) page->freelist;
0c0a4a51
YG
727
728 BUG_ON(magic == NODE_INFO);
729
730 maps_section_nr = pfn_to_section_nr(page_to_pfn(page));
857e522a 731 removing_section_nr = page_private(page);
0c0a4a51
YG
732
733 /*
734 * When this function is called, the removing section is
735 * logical offlined state. This means all pages are isolated
736 * from page allocator. If removing section's memmap is placed
737 * on the same section, it must not be freed.
738 * If it is freed, page allocator may allocate it which will
739 * be removed physically soon.
740 */
741 if (maps_section_nr != removing_section_nr)
742 put_page_bootmem(page);
743 }
744}
0b0acbec 745
37bc1502 746static int clear_subsection_map(unsigned long pfn, unsigned long nr_pages)
ba72b4c8 747{
37bc1502
BH
748 return 0;
749}
750
751static bool is_subsection_map_empty(struct mem_section *ms)
752{
6ecb0fc6 753 return true;
0a9f9f62
BH
754}
755
6ecb0fc6 756static int fill_subsection_map(unsigned long pfn, unsigned long nr_pages)
0a9f9f62 757{
6ecb0fc6 758 return 0;
0a9f9f62 759}
6ecb0fc6 760#endif /* CONFIG_SPARSEMEM_VMEMMAP */
37bc1502 761
95a5a34d
BH
762/*
763 * To deactivate a memory region, there are 3 cases to handle across
764 * two configurations (SPARSEMEM_VMEMMAP={y,n}):
765 *
766 * 1. deactivation of a partial hot-added section (only possible in
767 * the SPARSEMEM_VMEMMAP=y case).
768 * a) section was present at memory init.
769 * b) section was hot-added post memory init.
770 * 2. deactivation of a complete hot-added section.
771 * 3. deactivation of a complete section from memory init.
772 *
773 * For 1, when subsection_map does not empty we will not be freeing the
774 * usage map, but still need to free the vmemmap range.
775 *
776 * For 2 and 3, the SPARSEMEM_VMEMMAP={y,n} cases are unified
777 */
37bc1502
BH
778static void section_deactivate(unsigned long pfn, unsigned long nr_pages,
779 struct vmem_altmap *altmap)
780{
781 struct mem_section *ms = __pfn_to_section(pfn);
782 bool section_is_early = early_section(ms);
783 struct page *memmap = NULL;
784 bool empty;
785
786 if (clear_subsection_map(pfn, nr_pages))
787 return;
95a5a34d 788
37bc1502 789 empty = is_subsection_map_empty(ms);
d41e2f3b 790 if (empty) {
ba72b4c8
DW
791 unsigned long section_nr = pfn_to_section_nr(pfn);
792
8068df3b
DH
793 /*
794 * When removing an early section, the usage map is kept (as the
795 * usage maps of other sections fall into the same page). It
796 * will be re-used when re-adding the section - which is then no
797 * longer an early section. If the usage map is PageReserved, it
798 * was allocated during boot.
799 */
800 if (!PageReserved(virt_to_page(ms->usage))) {
ba72b4c8
DW
801 kfree(ms->usage);
802 ms->usage = NULL;
803 }
804 memmap = sparse_decode_mem_map(ms->section_mem_map, section_nr);
b943f045
AK
805 /*
806 * Mark the section invalid so that valid_section()
807 * return false. This prevents code from dereferencing
808 * ms->usage array.
809 */
810 ms->section_mem_map &= ~SECTION_HAS_MEM_MAP;
ba72b4c8
DW
811 }
812
ef69bc9f
WY
813 /*
814 * The memmap of early sections is always fully populated. See
815 * section_activate() and pfn_valid() .
816 */
817 if (!section_is_early)
ba72b4c8 818 depopulate_section_memmap(pfn, nr_pages, altmap);
ef69bc9f
WY
819 else if (memmap)
820 free_map_bootmem(memmap);
d41e2f3b
BH
821
822 if (empty)
823 ms->section_mem_map = (unsigned long)NULL;
ba72b4c8
DW
824}
825
5d87255c
BH
826static struct page * __meminit section_activate(int nid, unsigned long pfn,
827 unsigned long nr_pages, struct vmem_altmap *altmap)
828{
829 struct mem_section *ms = __pfn_to_section(pfn);
830 struct mem_section_usage *usage = NULL;
831 struct page *memmap;
832 int rc = 0;
833
834 if (!ms->usage) {
835 usage = kzalloc(mem_section_usage_size(), GFP_KERNEL);
836 if (!usage)
837 return ERR_PTR(-ENOMEM);
838 ms->usage = usage;
839 }
840
841 rc = fill_subsection_map(pfn, nr_pages);
ba72b4c8
DW
842 if (rc) {
843 if (usage)
844 ms->usage = NULL;
845 kfree(usage);
846 return ERR_PTR(rc);
847 }
848
849 /*
850 * The early init code does not consider partially populated
851 * initial sections, it simply assumes that memory will never be
852 * referenced. If we hot-add memory into such a section then we
853 * do not need to populate the memmap and can simply reuse what
854 * is already there.
855 */
856 if (nr_pages < PAGES_PER_SECTION && early_section(ms))
857 return pfn_to_page(pfn);
858
859 memmap = populate_section_memmap(pfn, nr_pages, nid, altmap);
860 if (!memmap) {
861 section_deactivate(pfn, nr_pages, altmap);
862 return ERR_PTR(-ENOMEM);
863 }
864
865 return memmap;
866}
867
7567cfc5 868/**
ba72b4c8 869 * sparse_add_section - add a memory section, or populate an existing one
7567cfc5
BH
870 * @nid: The node to add section on
871 * @start_pfn: start pfn of the memory range
ba72b4c8 872 * @nr_pages: number of pfns to add in the section
7567cfc5
BH
873 * @altmap: device page map
874 *
875 * This is only intended for hotplug.
876 *
95a5a34d
BH
877 * Note that only VMEMMAP supports sub-section aligned hotplug,
878 * the proper alignment and size are gated by check_pfn_span().
879 *
880 *
7567cfc5
BH
881 * Return:
882 * * 0 - On success.
883 * * -EEXIST - Section has been present.
884 * * -ENOMEM - Out of memory.
29751f69 885 */
7ea62160
DW
886int __meminit sparse_add_section(int nid, unsigned long start_pfn,
887 unsigned long nr_pages, struct vmem_altmap *altmap)
29751f69 888{
0b0acbec 889 unsigned long section_nr = pfn_to_section_nr(start_pfn);
0b0acbec
DH
890 struct mem_section *ms;
891 struct page *memmap;
0b0acbec 892 int ret;
29751f69 893
4e0d2e7e 894 ret = sparse_index_init(section_nr, nid);
ba72b4c8 895 if (ret < 0)
bbd06825 896 return ret;
0b0acbec 897
ba72b4c8
DW
898 memmap = section_activate(nid, start_pfn, nr_pages, altmap);
899 if (IS_ERR(memmap))
900 return PTR_ERR(memmap);
5c0e3066 901
d0dc12e8
PT
902 /*
903 * Poison uninitialized struct pages in order to catch invalid flags
904 * combinations.
905 */
18e19f19 906 page_init_poison(memmap, sizeof(struct page) * nr_pages);
3ac19f8e 907
c1cbc3ee 908 ms = __nr_to_section(section_nr);
26f26bed 909 set_section_nid(section_nr, nid);
a1bc561b 910 __section_mark_present(ms, section_nr);
0b0acbec 911
ba72b4c8
DW
912 /* Align memmap to section boundary in the subsection case */
913 if (section_nr_to_pfn(section_nr) != start_pfn)
4627d76d 914 memmap = pfn_to_page(section_nr_to_pfn(section_nr));
ba72b4c8
DW
915 sparse_init_one_section(ms, section_nr, memmap, ms->usage, 0);
916
917 return 0;
29751f69 918}
ea01ea93 919
95a4774d
WC
920#ifdef CONFIG_MEMORY_FAILURE
921static void clear_hwpoisoned_pages(struct page *memmap, int nr_pages)
922{
923 int i;
924
5eb570a8
BS
925 /*
926 * A further optimization is to have per section refcounted
927 * num_poisoned_pages. But that would need more space per memmap, so
928 * for now just do a quick global check to speed up this routine in the
929 * absence of bad pages.
930 */
931 if (atomic_long_read(&num_poisoned_pages) == 0)
932 return;
933
4b94ffdc 934 for (i = 0; i < nr_pages; i++) {
95a4774d 935 if (PageHWPoison(&memmap[i])) {
9f82883c 936 num_poisoned_pages_dec();
95a4774d
WC
937 ClearPageHWPoison(&memmap[i]);
938 }
939 }
940}
941#else
942static inline void clear_hwpoisoned_pages(struct page *memmap, int nr_pages)
943{
944}
945#endif
946
ba72b4c8 947void sparse_remove_section(struct mem_section *ms, unsigned long pfn,
7ea62160
DW
948 unsigned long nr_pages, unsigned long map_offset,
949 struct vmem_altmap *altmap)
ea01ea93 950{
ba72b4c8
DW
951 clear_hwpoisoned_pages(pfn_to_page(pfn) + map_offset,
952 nr_pages - map_offset);
953 section_deactivate(pfn, nr_pages, altmap);
ea01ea93 954}
4edd7cef 955#endif /* CONFIG_MEMORY_HOTPLUG */