xref: /linux/mm/sparse.c (revision ceb32d6aa93ce3282a724f3a0828b4b84d5035f1)
1 // SPDX-License-Identifier: GPL-2.0
2 /*
3  * sparse memory mappings.
4  */
5 #include <linux/mm.h>
6 #include <linux/slab.h>
7 #include <linux/mmzone.h>
8 #include <linux/memblock.h>
9 #include <linux/compiler.h>
10 #include <linux/highmem.h>
11 #include <linux/export.h>
12 #include <linux/spinlock.h>
13 #include <linux/vmalloc.h>
14 #include <linux/swap.h>
15 #include <linux/swapops.h>
16 #include <linux/bootmem_info.h>
17 #include <linux/vmstat.h>
18 #include "internal.h"
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  */
26 #ifdef CONFIG_SPARSEMEM_EXTREME
27 struct mem_section **mem_section;
28 #else
29 struct mem_section mem_section[NR_SECTION_ROOTS][SECTIONS_PER_ROOT]
30 	____cacheline_internodealigned_in_smp;
31 #endif
32 EXPORT_SYMBOL(mem_section);
33 
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
41 static u8 section_to_node_table[NR_MEM_SECTIONS] __cacheline_aligned;
42 #else
43 static u16 section_to_node_table[NR_MEM_SECTIONS] __cacheline_aligned;
44 #endif
45 
46 int page_to_nid(const struct page *page)
47 {
48 	return section_to_node_table[page_to_section(page)];
49 }
50 EXPORT_SYMBOL(page_to_nid);
51 
52 static 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 */
57 static inline void set_section_nid(unsigned long section_nr, int nid)
58 {
59 }
60 #endif
61 
62 #ifdef CONFIG_SPARSEMEM_EXTREME
63 static noinline struct mem_section __ref *sparse_index_alloc(int nid)
64 {
65 	struct mem_section *section = NULL;
66 	unsigned long array_size = SECTIONS_PER_ROOT *
67 				   sizeof(struct mem_section);
68 
69 	if (slab_is_available()) {
70 		section = kzalloc_node(array_size, GFP_KERNEL, nid);
71 	} else {
72 		section = memblock_alloc_node(array_size, SMP_CACHE_BYTES,
73 					      nid);
74 		if (!section)
75 			panic("%s: Failed to allocate %lu bytes nid=%d\n",
76 			      __func__, array_size, nid);
77 	}
78 
79 	return section;
80 }
81 
82 static int __meminit sparse_index_init(unsigned long section_nr, int nid)
83 {
84 	unsigned long root = SECTION_NR_TO_ROOT(section_nr);
85 	struct mem_section *section;
86 
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 	 */
94 	if (mem_section[root])
95 		return 0;
96 
97 	section = sparse_index_alloc(nid);
98 	if (!section)
99 		return -ENOMEM;
100 
101 	mem_section[root] = section;
102 
103 	return 0;
104 }
105 #else /* !SPARSEMEM_EXTREME */
106 static inline int sparse_index_init(unsigned long section_nr, int nid)
107 {
108 	return 0;
109 }
110 #endif
111 
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  */
118 static inline unsigned long sparse_encode_early_nid(int nid)
119 {
120 	return ((unsigned long)nid << SECTION_NID_SHIFT);
121 }
122 
123 static inline int sparse_early_nid(struct mem_section *section)
124 {
125 	return (section->section_mem_map >> SECTION_NID_SHIFT);
126 }
127 
128 /* Validate the physical addressing limitations of the model */
129 static void __meminit mminit_validate_memmodel_limits(unsigned long *start_pfn,
130 						unsigned long *end_pfn)
131 {
132 	unsigned long max_sparsemem_pfn = 1UL << (MAX_PHYSMEM_BITS-PAGE_SHIFT);
133 
134 	/*
135 	 * Sanity checks - do not allow an architecture to pass
136 	 * in larger pfns than the maximum scope of sparsemem:
137 	 */
138 	if (*start_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;
145 	} else if (*end_pfn > max_sparsemem_pfn) {
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 
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  */
163 unsigned long __highest_present_section_nr;
164 static void __section_mark_present(struct mem_section *ms,
165 		unsigned long section_nr)
166 {
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 
173 #define for_each_present_section_nr(start, section_nr)		\
174 	for (section_nr = next_present_section_nr(start-1);	\
175 	     section_nr != -1;								\
176 	     section_nr = next_present_section_nr(section_nr))
177 
178 static inline unsigned long first_present_section_nr(void)
179 {
180 	return next_present_section_nr(-1);
181 }
182 
183 #ifdef CONFIG_SPARSEMEM_VMEMMAP
184 static void subsection_mask_set(unsigned long *map, unsigned long pfn,
185 		unsigned long nr_pages)
186 {
187 	int idx = subsection_map_index(pfn);
188 	int end = subsection_map_index(pfn + nr_pages - 1);
189 
190 	bitmap_set(map, idx, end - idx + 1);
191 }
192 
193 void __init subsection_map_init(unsigned long pfn, unsigned long nr_pages)
194 {
195 	int end_sec_nr = pfn_to_section_nr(pfn + nr_pages - 1);
196 	unsigned long nr, start_sec_nr = pfn_to_section_nr(pfn);
197 
198 	if (!nr_pages)
199 		return;
200 
201 	for (nr = start_sec_nr; nr <= end_sec_nr; nr++) {
202 		struct mem_section *ms;
203 		unsigned long pfns;
204 
205 		pfns = min(nr_pages, PAGES_PER_SECTION
206 				- (pfn & ~PAGE_SECTION_MASK));
207 		ms = __nr_to_section(nr);
208 		subsection_mask_set(ms->usage->subsection_map, pfn, pfns);
209 
210 		pr_debug("%s: sec: %lu pfns: %lu set(%d, %d)\n", __func__, nr,
211 				pfns, subsection_map_index(pfn),
212 				subsection_map_index(pfn + pfns - 1));
213 
214 		pfn += pfns;
215 		nr_pages -= pfns;
216 	}
217 }
218 #else
219 void __init subsection_map_init(unsigned long pfn, unsigned long nr_pages)
220 {
221 }
222 #endif
223 
224 /* Record a memory area against a node. */
225 static void __init memory_present(int nid, unsigned long start, unsigned long end)
226 {
227 	unsigned long pfn;
228 
229 	start &= PAGE_SECTION_MASK;
230 	mminit_validate_memmodel_limits(&start, &end);
231 	for (pfn = start; pfn < end; pfn += PAGES_PER_SECTION) {
232 		unsigned long section_nr = pfn_to_section_nr(pfn);
233 		struct mem_section *ms;
234 
235 		sparse_index_init(section_nr, nid);
236 		set_section_nid(section_nr, nid);
237 
238 		ms = __nr_to_section(section_nr);
239 		if (!ms->section_mem_map) {
240 			ms->section_mem_map = sparse_encode_early_nid(nid) |
241 							SECTION_IS_ONLINE;
242 			__section_mark_present(ms, section_nr);
243 		}
244 	}
245 }
246 
247 /*
248  * Mark all memblocks as present using memory_present().
249  * This is a convenience function that is useful to mark all of the systems
250  * memory as present during initialization.
251  */
252 static void __init memblocks_present(void)
253 {
254 	unsigned long start, end;
255 	int i, nid;
256 
257 #ifdef CONFIG_SPARSEMEM_EXTREME
258 	if (unlikely(!mem_section)) {
259 		unsigned long size, align;
260 
261 		size = sizeof(struct mem_section *) * NR_SECTION_ROOTS;
262 		align = 1 << (INTERNODE_CACHE_SHIFT);
263 		mem_section = memblock_alloc(size, align);
264 		if (!mem_section)
265 			panic("%s: Failed to allocate %lu bytes align=0x%lx\n",
266 			      __func__, size, align);
267 	}
268 #endif
269 
270 	for_each_mem_pfn_range(i, MAX_NUMNODES, &start, &end, &nid)
271 		memory_present(nid, start, end);
272 }
273 
274 /*
275  * Subtle, we encode the real pfn into the mem_map such that
276  * the identity pfn - section_mem_map will return the actual
277  * physical page frame number.
278  */
279 static unsigned long sparse_encode_mem_map(struct page *mem_map, unsigned long pnum)
280 {
281 	unsigned long coded_mem_map =
282 		(unsigned long)(mem_map - (section_nr_to_pfn(pnum)));
283 	BUILD_BUG_ON(SECTION_MAP_LAST_BIT > PFN_SECTION_SHIFT);
284 	BUG_ON(coded_mem_map & ~SECTION_MAP_MASK);
285 	return coded_mem_map;
286 }
287 
288 #ifdef CONFIG_MEMORY_HOTPLUG
289 /*
290  * Decode mem_map from the coded memmap
291  */
292 struct page *sparse_decode_mem_map(unsigned long coded_mem_map, unsigned long pnum)
293 {
294 	/* mask off the extra low bits of information */
295 	coded_mem_map &= SECTION_MAP_MASK;
296 	return ((struct page *)coded_mem_map) + section_nr_to_pfn(pnum);
297 }
298 #endif /* CONFIG_MEMORY_HOTPLUG */
299 
300 static void __meminit sparse_init_one_section(struct mem_section *ms,
301 		unsigned long pnum, struct page *mem_map,
302 		struct mem_section_usage *usage, unsigned long flags)
303 {
304 	ms->section_mem_map &= ~SECTION_MAP_MASK;
305 	ms->section_mem_map |= sparse_encode_mem_map(mem_map, pnum)
306 		| SECTION_HAS_MEM_MAP | flags;
307 	ms->usage = usage;
308 }
309 
310 static unsigned long usemap_size(void)
311 {
312 	return BITS_TO_LONGS(SECTION_BLOCKFLAGS_BITS) * sizeof(unsigned long);
313 }
314 
315 size_t mem_section_usage_size(void)
316 {
317 	return sizeof(struct mem_section_usage) + usemap_size();
318 }
319 
320 #ifdef CONFIG_MEMORY_HOTREMOVE
321 static inline phys_addr_t pgdat_to_phys(struct pglist_data *pgdat)
322 {
323 #ifndef CONFIG_NUMA
324 	VM_BUG_ON(pgdat != &contig_page_data);
325 	return __pa_symbol(&contig_page_data);
326 #else
327 	return __pa(pgdat);
328 #endif
329 }
330 
331 static struct mem_section_usage * __init
332 sparse_early_usemaps_alloc_pgdat_section(struct pglist_data *pgdat,
333 					 unsigned long size)
334 {
335 	struct mem_section_usage *usage;
336 	unsigned long goal, limit;
337 	int nid;
338 	/*
339 	 * A page may contain usemaps for other sections preventing the
340 	 * page being freed and making a section unremovable while
341 	 * other sections referencing the usemap remain active. Similarly,
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 	 */
348 	goal = pgdat_to_phys(pgdat) & (PAGE_SECTION_MASK << PAGE_SHIFT);
349 	limit = goal + (1UL << PA_SECTION_SHIFT);
350 	nid = early_pfn_to_nid(goal >> PAGE_SHIFT);
351 again:
352 	usage = memblock_alloc_try_nid(size, SMP_CACHE_BYTES, goal, limit, nid);
353 	if (!usage && limit) {
354 		limit = MEMBLOCK_ALLOC_ACCESSIBLE;
355 		goto again;
356 	}
357 	return usage;
358 }
359 
360 static void __init check_usemap_section_nr(int nid,
361 		struct mem_section_usage *usage)
362 {
363 	unsigned long usemap_snr, pgdat_snr;
364 	static unsigned long old_usemap_snr;
365 	static unsigned long old_pgdat_snr;
366 	struct pglist_data *pgdat = NODE_DATA(nid);
367 	int usemap_nid;
368 
369 	/* First call */
370 	if (!old_usemap_snr) {
371 		old_usemap_snr = NR_MEM_SECTIONS;
372 		old_pgdat_snr = NR_MEM_SECTIONS;
373 	}
374 
375 	usemap_snr = pfn_to_section_nr(__pa(usage) >> PAGE_SHIFT);
376 	pgdat_snr = pfn_to_section_nr(pgdat_to_phys(pgdat) >> PAGE_SHIFT);
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) {
389 		pr_info("node %d must be removed before remove section %ld\n",
390 			nid, usemap_snr);
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 	 */
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);
401 }
402 #else
403 static struct mem_section_usage * __init
404 sparse_early_usemaps_alloc_pgdat_section(struct pglist_data *pgdat,
405 					 unsigned long size)
406 {
407 	return memblock_alloc_node(size, SMP_CACHE_BYTES, pgdat->node_id);
408 }
409 
410 static void __init check_usemap_section_nr(int nid,
411 		struct mem_section_usage *usage)
412 {
413 }
414 #endif /* CONFIG_MEMORY_HOTREMOVE */
415 
416 #ifdef CONFIG_SPARSEMEM_VMEMMAP
417 static unsigned long __init section_map_size(void)
418 {
419 	return ALIGN(sizeof(struct page) * PAGES_PER_SECTION, PMD_SIZE);
420 }
421 
422 #else
423 static unsigned long __init section_map_size(void)
424 {
425 	return PAGE_ALIGN(sizeof(struct page) * PAGES_PER_SECTION);
426 }
427 
428 struct page __init *__populate_section_memmap(unsigned long pfn,
429 		unsigned long nr_pages, int nid, struct vmem_altmap *altmap,
430 		struct dev_pagemap *pgmap)
431 {
432 	unsigned long size = section_map_size();
433 	struct page *map = sparse_buffer_alloc(size);
434 	phys_addr_t addr = __pa(MAX_DMA_ADDRESS);
435 
436 	if (map)
437 		return map;
438 
439 	map = memmap_alloc(size, size, addr, nid, false);
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 
444 	return map;
445 }
446 #endif /* !CONFIG_SPARSEMEM_VMEMMAP */
447 
448 static void *sparsemap_buf __meminitdata;
449 static void *sparsemap_buf_end __meminitdata;
450 
451 static inline void __meminit sparse_buffer_free(unsigned long size)
452 {
453 	WARN_ON(!sparsemap_buf || size == 0);
454 	memblock_free(sparsemap_buf, size);
455 }
456 
457 static void __init sparse_buffer_init(unsigned long size, int nid)
458 {
459 	phys_addr_t addr = __pa(MAX_DMA_ADDRESS);
460 	WARN_ON(sparsemap_buf);	/* forgot to call sparse_buffer_fini()? */
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 	 */
466 	sparsemap_buf = memmap_alloc(size, section_map_size(), addr, nid, true);
467 	sparsemap_buf_end = sparsemap_buf + size;
468 #ifndef CONFIG_SPARSEMEM_VMEMMAP
469 	mod_node_early_perpage_metadata(nid, DIV_ROUND_UP(size, PAGE_SIZE));
470 #endif
471 }
472 
473 static void __init sparse_buffer_fini(void)
474 {
475 	unsigned long size = sparsemap_buf_end - sparsemap_buf;
476 
477 	if (sparsemap_buf && size > 0)
478 		sparse_buffer_free(size);
479 	sparsemap_buf = NULL;
480 }
481 
482 void * __meminit sparse_buffer_alloc(unsigned long size)
483 {
484 	void *ptr = NULL;
485 
486 	if (sparsemap_buf) {
487 		ptr = (void *) roundup((unsigned long)sparsemap_buf, size);
488 		if (ptr + size > sparsemap_buf_end)
489 			ptr = NULL;
490 		else {
491 			/* Free redundant aligned space */
492 			if ((unsigned long)(ptr - sparsemap_buf) > 0)
493 				sparse_buffer_free((unsigned long)(ptr - sparsemap_buf));
494 			sparsemap_buf = ptr + size;
495 		}
496 	}
497 	return ptr;
498 }
499 
500 void __weak __meminit vmemmap_populate_print_last(void)
501 {
502 }
503 
504 /*
505  * Initialize sparse on a specific node. The node spans [pnum_begin, pnum_end)
506  * And number of present sections in this node is map_count.
507  */
508 static void __init sparse_init_nid(int nid, unsigned long pnum_begin,
509 				   unsigned long pnum_end,
510 				   unsigned long map_count)
511 {
512 	struct mem_section_usage *usage;
513 	unsigned long pnum;
514 	struct page *map;
515 
516 	usage = sparse_early_usemaps_alloc_pgdat_section(NODE_DATA(nid),
517 			mem_section_usage_size() * map_count);
518 	if (!usage) {
519 		pr_err("%s: node[%d] usemap allocation failed", __func__, nid);
520 		goto failed;
521 	}
522 	sparse_buffer_init(map_count * section_map_size(), nid);
523 	for_each_present_section_nr(pnum_begin, pnum) {
524 		unsigned long pfn = section_nr_to_pfn(pnum);
525 
526 		if (pnum >= pnum_end)
527 			break;
528 
529 		map = __populate_section_memmap(pfn, PAGES_PER_SECTION,
530 				nid, NULL, NULL);
531 		if (!map) {
532 			pr_err("%s: node[%d] memory map backing failed. Some memory will not be available.",
533 			       __func__, nid);
534 			pnum_begin = pnum;
535 			sparse_buffer_fini();
536 			goto failed;
537 		}
538 		check_usemap_section_nr(nid, usage);
539 		sparse_init_one_section(__nr_to_section(pnum), pnum, map, usage,
540 				SECTION_IS_EARLY);
541 		usage = (void *) usage + mem_section_usage_size();
542 	}
543 	sparse_buffer_fini();
544 	return;
545 failed:
546 	/* We failed to allocate, mark all the following pnums as not present */
547 	for_each_present_section_nr(pnum_begin, pnum) {
548 		struct mem_section *ms;
549 
550 		if (pnum >= pnum_end)
551 			break;
552 		ms = __nr_to_section(pnum);
553 		ms->section_mem_map = 0;
554 	}
555 }
556 
557 /*
558  * Allocate the accumulated non-linear sections, allocate a mem_map
559  * for each and record the physical to section mapping.
560  */
561 void __init sparse_init(void)
562 {
563 	unsigned long pnum_end, pnum_begin, map_count = 1;
564 	int nid_begin;
565 
566 	/* see include/linux/mmzone.h 'struct mem_section' definition */
567 	BUILD_BUG_ON(!is_power_of_2(sizeof(struct mem_section)));
568 	memblocks_present();
569 
570 	pnum_begin = first_present_section_nr();
571 	nid_begin = sparse_early_nid(__nr_to_section(pnum_begin));
572 
573 	/* Setup pageblock_order for HUGETLB_PAGE_SIZE_VARIABLE */
574 	set_pageblock_order();
575 
576 	for_each_present_section_nr(pnum_begin + 1, pnum_end) {
577 		int nid = sparse_early_nid(__nr_to_section(pnum_end));
578 
579 		if (nid == nid_begin) {
580 			map_count++;
581 			continue;
582 		}
583 		/* Init node with sections in range [pnum_begin, pnum_end) */
584 		sparse_init_nid(nid_begin, pnum_begin, pnum_end, map_count);
585 		nid_begin = nid;
586 		pnum_begin = pnum_end;
587 		map_count = 1;
588 	}
589 	/* cover the last node */
590 	sparse_init_nid(nid_begin, pnum_begin, pnum_end, map_count);
591 	vmemmap_populate_print_last();
592 }
593 
594 #ifdef CONFIG_MEMORY_HOTPLUG
595 
596 /* Mark all memory sections within the pfn range as online */
597 void online_mem_sections(unsigned long start_pfn, unsigned long end_pfn)
598 {
599 	unsigned long pfn;
600 
601 	for (pfn = start_pfn; pfn < end_pfn; pfn += PAGES_PER_SECTION) {
602 		unsigned long section_nr = pfn_to_section_nr(pfn);
603 		struct mem_section *ms;
604 
605 		/* onlining code should never touch invalid ranges */
606 		if (WARN_ON(!valid_section_nr(section_nr)))
607 			continue;
608 
609 		ms = __nr_to_section(section_nr);
610 		ms->section_mem_map |= SECTION_IS_ONLINE;
611 	}
612 }
613 
614 /* Mark all memory sections within the pfn range as offline */
615 void offline_mem_sections(unsigned long start_pfn, unsigned long end_pfn)
616 {
617 	unsigned long pfn;
618 
619 	for (pfn = start_pfn; pfn < end_pfn; pfn += PAGES_PER_SECTION) {
620 		unsigned long section_nr = pfn_to_section_nr(pfn);
621 		struct mem_section *ms;
622 
623 		/*
624 		 * TODO this needs some double checking. Offlining code makes
625 		 * sure to check pfn_valid but those checks might be just bogus
626 		 */
627 		if (WARN_ON(!valid_section_nr(section_nr)))
628 			continue;
629 
630 		ms = __nr_to_section(section_nr);
631 		ms->section_mem_map &= ~SECTION_IS_ONLINE;
632 	}
633 }
634 
635 #ifdef CONFIG_SPARSEMEM_VMEMMAP
636 static struct page * __meminit populate_section_memmap(unsigned long pfn,
637 		unsigned long nr_pages, int nid, struct vmem_altmap *altmap,
638 		struct dev_pagemap *pgmap)
639 {
640 	return __populate_section_memmap(pfn, nr_pages, nid, altmap, pgmap);
641 }
642 
643 static void depopulate_section_memmap(unsigned long pfn, unsigned long nr_pages,
644 		struct vmem_altmap *altmap)
645 {
646 	unsigned long start = (unsigned long) pfn_to_page(pfn);
647 	unsigned long end = start + nr_pages * sizeof(struct page);
648 
649 	mod_node_page_state(page_pgdat(pfn_to_page(pfn)), NR_MEMMAP,
650 			    -1L * (DIV_ROUND_UP(end - start, PAGE_SIZE)));
651 	vmemmap_free(start, end, altmap);
652 }
653 static void free_map_bootmem(struct page *memmap)
654 {
655 	unsigned long start = (unsigned long)memmap;
656 	unsigned long end = (unsigned long)(memmap + PAGES_PER_SECTION);
657 
658 	vmemmap_free(start, end, NULL);
659 }
660 
661 static int clear_subsection_map(unsigned long pfn, unsigned long nr_pages)
662 {
663 	DECLARE_BITMAP(map, SUBSECTIONS_PER_SECTION) = { 0 };
664 	DECLARE_BITMAP(tmp, SUBSECTIONS_PER_SECTION) = { 0 };
665 	struct mem_section *ms = __pfn_to_section(pfn);
666 	unsigned long *subsection_map = ms->usage
667 		? &ms->usage->subsection_map[0] : NULL;
668 
669 	subsection_mask_set(map, pfn, nr_pages);
670 	if (subsection_map)
671 		bitmap_and(tmp, map, subsection_map, SUBSECTIONS_PER_SECTION);
672 
673 	if (WARN(!subsection_map || !bitmap_equal(tmp, map, SUBSECTIONS_PER_SECTION),
674 				"section already deactivated (%#lx + %ld)\n",
675 				pfn, nr_pages))
676 		return -EINVAL;
677 
678 	bitmap_xor(subsection_map, map, subsection_map, SUBSECTIONS_PER_SECTION);
679 	return 0;
680 }
681 
682 static bool is_subsection_map_empty(struct mem_section *ms)
683 {
684 	return bitmap_empty(&ms->usage->subsection_map[0],
685 			    SUBSECTIONS_PER_SECTION);
686 }
687 
688 static int fill_subsection_map(unsigned long pfn, unsigned long nr_pages)
689 {
690 	struct mem_section *ms = __pfn_to_section(pfn);
691 	DECLARE_BITMAP(map, SUBSECTIONS_PER_SECTION) = { 0 };
692 	unsigned long *subsection_map;
693 	int rc = 0;
694 
695 	subsection_mask_set(map, pfn, nr_pages);
696 
697 	subsection_map = &ms->usage->subsection_map[0];
698 
699 	if (bitmap_empty(map, SUBSECTIONS_PER_SECTION))
700 		rc = -EINVAL;
701 	else if (bitmap_intersects(map, subsection_map, SUBSECTIONS_PER_SECTION))
702 		rc = -EEXIST;
703 	else
704 		bitmap_or(subsection_map, map, subsection_map,
705 				SUBSECTIONS_PER_SECTION);
706 
707 	return rc;
708 }
709 #else
710 static struct page * __meminit populate_section_memmap(unsigned long pfn,
711 		unsigned long nr_pages, int nid, struct vmem_altmap *altmap,
712 		struct dev_pagemap *pgmap)
713 {
714 	return kvmalloc_node(array_size(sizeof(struct page),
715 					PAGES_PER_SECTION), GFP_KERNEL, nid);
716 }
717 
718 static void depopulate_section_memmap(unsigned long pfn, unsigned long nr_pages,
719 		struct vmem_altmap *altmap)
720 {
721 	kvfree(pfn_to_page(pfn));
722 }
723 
724 static void free_map_bootmem(struct page *memmap)
725 {
726 	unsigned long maps_section_nr, removing_section_nr, i;
727 	unsigned long magic, nr_pages;
728 	struct page *page = virt_to_page(memmap);
729 
730 	nr_pages = PAGE_ALIGN(PAGES_PER_SECTION * sizeof(struct page))
731 		>> PAGE_SHIFT;
732 
733 	for (i = 0; i < nr_pages; i++, page++) {
734 		magic = page->index;
735 
736 		BUG_ON(magic == NODE_INFO);
737 
738 		maps_section_nr = pfn_to_section_nr(page_to_pfn(page));
739 		removing_section_nr = page_private(page);
740 
741 		/*
742 		 * When this function is called, the removing section is
743 		 * logical offlined state. This means all pages are isolated
744 		 * from page allocator. If removing section's memmap is placed
745 		 * on the same section, it must not be freed.
746 		 * If it is freed, page allocator may allocate it which will
747 		 * be removed physically soon.
748 		 */
749 		if (maps_section_nr != removing_section_nr)
750 			put_page_bootmem(page);
751 	}
752 }
753 
754 static int clear_subsection_map(unsigned long pfn, unsigned long nr_pages)
755 {
756 	return 0;
757 }
758 
759 static bool is_subsection_map_empty(struct mem_section *ms)
760 {
761 	return true;
762 }
763 
764 static int fill_subsection_map(unsigned long pfn, unsigned long nr_pages)
765 {
766 	return 0;
767 }
768 #endif /* CONFIG_SPARSEMEM_VMEMMAP */
769 
770 /*
771  * To deactivate a memory region, there are 3 cases to handle across
772  * two configurations (SPARSEMEM_VMEMMAP={y,n}):
773  *
774  * 1. deactivation of a partial hot-added section (only possible in
775  *    the SPARSEMEM_VMEMMAP=y case).
776  *      a) section was present at memory init.
777  *      b) section was hot-added post memory init.
778  * 2. deactivation of a complete hot-added section.
779  * 3. deactivation of a complete section from memory init.
780  *
781  * For 1, when subsection_map does not empty we will not be freeing the
782  * usage map, but still need to free the vmemmap range.
783  *
784  * For 2 and 3, the SPARSEMEM_VMEMMAP={y,n} cases are unified
785  */
786 static void section_deactivate(unsigned long pfn, unsigned long nr_pages,
787 		struct vmem_altmap *altmap)
788 {
789 	struct mem_section *ms = __pfn_to_section(pfn);
790 	bool section_is_early = early_section(ms);
791 	struct page *memmap = NULL;
792 	bool empty;
793 
794 	if (clear_subsection_map(pfn, nr_pages))
795 		return;
796 
797 	empty = is_subsection_map_empty(ms);
798 	if (empty) {
799 		unsigned long section_nr = pfn_to_section_nr(pfn);
800 
801 		/*
802 		 * Mark the section invalid so that valid_section()
803 		 * return false. This prevents code from dereferencing
804 		 * ms->usage array.
805 		 */
806 		ms->section_mem_map &= ~SECTION_HAS_MEM_MAP;
807 
808 		/*
809 		 * When removing an early section, the usage map is kept (as the
810 		 * usage maps of other sections fall into the same page). It
811 		 * will be re-used when re-adding the section - which is then no
812 		 * longer an early section. If the usage map is PageReserved, it
813 		 * was allocated during boot.
814 		 */
815 		if (!PageReserved(virt_to_page(ms->usage))) {
816 			kfree_rcu(ms->usage, rcu);
817 			WRITE_ONCE(ms->usage, NULL);
818 		}
819 		memmap = sparse_decode_mem_map(ms->section_mem_map, section_nr);
820 	}
821 
822 	/*
823 	 * The memmap of early sections is always fully populated. See
824 	 * section_activate() and pfn_valid() .
825 	 */
826 	if (!section_is_early)
827 		depopulate_section_memmap(pfn, nr_pages, altmap);
828 	else if (memmap)
829 		free_map_bootmem(memmap);
830 
831 	if (empty)
832 		ms->section_mem_map = (unsigned long)NULL;
833 }
834 
835 static struct page * __meminit section_activate(int nid, unsigned long pfn,
836 		unsigned long nr_pages, struct vmem_altmap *altmap,
837 		struct dev_pagemap *pgmap)
838 {
839 	struct mem_section *ms = __pfn_to_section(pfn);
840 	struct mem_section_usage *usage = NULL;
841 	struct page *memmap;
842 	int rc;
843 
844 	if (!ms->usage) {
845 		usage = kzalloc(mem_section_usage_size(), GFP_KERNEL);
846 		if (!usage)
847 			return ERR_PTR(-ENOMEM);
848 		ms->usage = usage;
849 	}
850 
851 	rc = fill_subsection_map(pfn, nr_pages);
852 	if (rc) {
853 		if (usage)
854 			ms->usage = NULL;
855 		kfree(usage);
856 		return ERR_PTR(rc);
857 	}
858 
859 	/*
860 	 * The early init code does not consider partially populated
861 	 * initial sections, it simply assumes that memory will never be
862 	 * referenced.  If we hot-add memory into such a section then we
863 	 * do not need to populate the memmap and can simply reuse what
864 	 * is already there.
865 	 */
866 	if (nr_pages < PAGES_PER_SECTION && early_section(ms))
867 		return pfn_to_page(pfn);
868 
869 	memmap = populate_section_memmap(pfn, nr_pages, nid, altmap, pgmap);
870 	if (!memmap) {
871 		section_deactivate(pfn, nr_pages, altmap);
872 		return ERR_PTR(-ENOMEM);
873 	}
874 
875 	return memmap;
876 }
877 
878 /**
879  * sparse_add_section - add a memory section, or populate an existing one
880  * @nid: The node to add section on
881  * @start_pfn: start pfn of the memory range
882  * @nr_pages: number of pfns to add in the section
883  * @altmap: alternate pfns to allocate the memmap backing store
884  * @pgmap: alternate compound page geometry for devmap mappings
885  *
886  * This is only intended for hotplug.
887  *
888  * Note that only VMEMMAP supports sub-section aligned hotplug,
889  * the proper alignment and size are gated by check_pfn_span().
890  *
891  *
892  * Return:
893  * * 0		- On success.
894  * * -EEXIST	- Section has been present.
895  * * -ENOMEM	- Out of memory.
896  */
897 int __meminit sparse_add_section(int nid, unsigned long start_pfn,
898 		unsigned long nr_pages, struct vmem_altmap *altmap,
899 		struct dev_pagemap *pgmap)
900 {
901 	unsigned long section_nr = pfn_to_section_nr(start_pfn);
902 	struct mem_section *ms;
903 	struct page *memmap;
904 	int ret;
905 
906 	ret = sparse_index_init(section_nr, nid);
907 	if (ret < 0)
908 		return ret;
909 
910 	memmap = section_activate(nid, start_pfn, nr_pages, altmap, pgmap);
911 	if (IS_ERR(memmap))
912 		return PTR_ERR(memmap);
913 
914 	/*
915 	 * Poison uninitialized struct pages in order to catch invalid flags
916 	 * combinations.
917 	 */
918 	if (!altmap || !altmap->inaccessible)
919 		page_init_poison(memmap, sizeof(struct page) * nr_pages);
920 
921 	ms = __nr_to_section(section_nr);
922 	set_section_nid(section_nr, nid);
923 	__section_mark_present(ms, section_nr);
924 
925 	/* Align memmap to section boundary in the subsection case */
926 	if (section_nr_to_pfn(section_nr) != start_pfn)
927 		memmap = pfn_to_page(section_nr_to_pfn(section_nr));
928 	sparse_init_one_section(ms, section_nr, memmap, ms->usage, 0);
929 
930 	return 0;
931 }
932 
933 void sparse_remove_section(unsigned long pfn, unsigned long nr_pages,
934 			   struct vmem_altmap *altmap)
935 {
936 	struct mem_section *ms = __pfn_to_section(pfn);
937 
938 	if (WARN_ON_ONCE(!valid_section(ms)))
939 		return;
940 
941 	section_deactivate(pfn, nr_pages, altmap);
942 }
943 #endif /* CONFIG_MEMORY_HOTPLUG */
944