]>
Commit | Line | Data |
---|---|---|
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 | 26 | struct mem_section **mem_section; |
3e347261 BP |
27 | #else |
28 | struct mem_section mem_section[NR_SECTION_ROOTS][SECTIONS_PER_ROOT] | |
22fc6ecc | 29 | ____cacheline_internodealigned_in_smp; |
3e347261 BP |
30 | #endif |
31 | EXPORT_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 | |
40 | static u8 section_to_node_table[NR_MEM_SECTIONS] __cacheline_aligned; | |
41 | #else | |
42 | static u16 section_to_node_table[NR_MEM_SECTIONS] __cacheline_aligned; | |
43 | #endif | |
44 | ||
33dd4e0e | 45 | int page_to_nid(const struct page *page) |
89689ae7 CL |
46 | { |
47 | return section_to_node_table[page_to_section(page)]; | |
48 | } | |
49 | EXPORT_SYMBOL(page_to_nid); | |
85770ffe AW |
50 | |
51 | static 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 */ | |
56 | static 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 | 62 | static 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 | 76 | static 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 */ | |
93 | static 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 |
100 | int __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 |
119 | int __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 | */ | |
131 | static inline unsigned long sparse_encode_early_nid(int nid) | |
132 | { | |
133 | return (nid << SECTION_NID_SHIFT); | |
134 | } | |
135 | ||
136 | static 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 */ |
142 | void __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 | */ | |
176 | int __highest_present_section_nr; | |
177 | static 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 | ||
187 | static 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 | */ | |
207 | static int __initdata nr_present_sections; | |
208 | ||
2dbb51c4 MG |
209 | /* Record a memory area against a node. */ |
210 | void __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 | */ | |
248 | static 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 |
260 | struct 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 | 267 | static 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 | 277 | unsigned 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 | |
283 | static 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 |
290 | static unsigned long * __init | |
a4322e1b | 291 | sparse_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); | |
310 | again: | |
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 | ||
321 | static 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 | |
363 | static unsigned long * __init | |
a4322e1b | 364 | sparse_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 | ||
370 | static void __init check_usemap_section_nr(int nid, unsigned long *usemap) | |
371 | { | |
372 | } | |
373 | #endif /* CONFIG_MEMORY_HOTREMOVE */ | |
374 | ||
18732093 | 375 | static 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 | ||
8f6aac41 | 403 | #ifndef CONFIG_SPARSEMEM_VMEMMAP |
7b73d978 CH |
404 | struct page __init *sparse_mem_map_populate(unsigned long pnum, int nid, |
405 | struct vmem_altmap *altmap) | |
29751f69 AW |
406 | { |
407 | struct page *map; | |
e48e67e0 | 408 | unsigned long size; |
29751f69 | 409 | |
e48e67e0 | 410 | size = PAGE_ALIGN(sizeof(struct page) * PAGES_PER_SECTION); |
bb016b84 SS |
411 | map = memblock_virt_alloc_try_nid(size, |
412 | PAGE_SIZE, __pa(MAX_DMA_ADDRESS), | |
413 | BOOTMEM_ALLOC_ACCESSIBLE, nid); | |
8f6aac41 CL |
414 | return map; |
415 | } | |
9bdac914 YL |
416 | void __init sparse_mem_maps_populate_node(struct page **map_map, |
417 | unsigned long pnum_begin, | |
418 | unsigned long pnum_end, | |
419 | unsigned long map_count, int nodeid) | |
420 | { | |
421 | void *map; | |
422 | unsigned long pnum; | |
423 | unsigned long size = sizeof(struct page) * PAGES_PER_SECTION; | |
c98aff64 | 424 | int nr_consumed_maps; |
9bdac914 | 425 | |
9bdac914 | 426 | size = PAGE_ALIGN(size); |
f7f99100 PT |
427 | map = memblock_virt_alloc_try_nid_raw(size * map_count, |
428 | PAGE_SIZE, __pa(MAX_DMA_ADDRESS), | |
429 | BOOTMEM_ALLOC_ACCESSIBLE, nodeid); | |
9bdac914 | 430 | if (map) { |
c98aff64 | 431 | nr_consumed_maps = 0; |
9bdac914 YL |
432 | for (pnum = pnum_begin; pnum < pnum_end; pnum++) { |
433 | if (!present_section_nr(pnum)) | |
434 | continue; | |
c98aff64 | 435 | map_map[nr_consumed_maps] = map; |
9bdac914 | 436 | map += size; |
c98aff64 | 437 | nr_consumed_maps++; |
9bdac914 YL |
438 | } |
439 | return; | |
440 | } | |
441 | ||
442 | /* fallback */ | |
c98aff64 | 443 | nr_consumed_maps = 0; |
9bdac914 YL |
444 | for (pnum = pnum_begin; pnum < pnum_end; pnum++) { |
445 | struct mem_section *ms; | |
446 | ||
447 | if (!present_section_nr(pnum)) | |
448 | continue; | |
c98aff64 BH |
449 | map_map[nr_consumed_maps] = |
450 | sparse_mem_map_populate(pnum, nodeid, NULL); | |
451 | if (map_map[nr_consumed_maps++]) | |
9bdac914 YL |
452 | continue; |
453 | ms = __nr_to_section(pnum); | |
1170532b | 454 | pr_err("%s: sparsemem memory map backing failed some memory will not be available\n", |
756a025f | 455 | __func__); |
9bdac914 YL |
456 | } |
457 | } | |
8f6aac41 CL |
458 | #endif /* !CONFIG_SPARSEMEM_VMEMMAP */ |
459 | ||
81d0d950 | 460 | #ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER |
18732093 | 461 | static void __init sparse_early_mem_maps_alloc_node(void *data, |
9bdac914 YL |
462 | unsigned long pnum_begin, |
463 | unsigned long pnum_end, | |
464 | unsigned long map_count, int nodeid) | |
465 | { | |
18732093 | 466 | struct page **map_map = (struct page **)data; |
9bdac914 YL |
467 | sparse_mem_maps_populate_node(map_map, pnum_begin, pnum_end, |
468 | map_count, nodeid); | |
469 | } | |
81d0d950 | 470 | #else |
9e5c6da7 | 471 | static struct page __init *sparse_early_mem_map_alloc(unsigned long pnum) |
8f6aac41 CL |
472 | { |
473 | struct page *map; | |
474 | struct mem_section *ms = __nr_to_section(pnum); | |
475 | int nid = sparse_early_nid(ms); | |
476 | ||
7b73d978 | 477 | map = sparse_mem_map_populate(pnum, nid, NULL); |
29751f69 AW |
478 | if (map) |
479 | return map; | |
480 | ||
1170532b | 481 | pr_err("%s: sparsemem memory map backing failed some memory will not be available\n", |
756a025f | 482 | __func__); |
29751f69 AW |
483 | return NULL; |
484 | } | |
9bdac914 | 485 | #endif |
29751f69 | 486 | |
3b32123d | 487 | void __weak __meminit vmemmap_populate_print_last(void) |
c2b91e2e YL |
488 | { |
489 | } | |
a4322e1b | 490 | |
18732093 WL |
491 | /** |
492 | * alloc_usemap_and_memmap - memory alloction for pageblock flags and vmemmap | |
493 | * @map: usemap_map for pageblock flags or mmap_map for vmemmap | |
9258631b | 494 | * @unit_size: size of map unit |
18732093 WL |
495 | */ |
496 | static void __init alloc_usemap_and_memmap(void (*alloc_func) | |
497 | (void *, unsigned long, unsigned long, | |
9258631b BH |
498 | unsigned long, int), void *data, |
499 | int data_unit_size) | |
18732093 WL |
500 | { |
501 | unsigned long pnum; | |
502 | unsigned long map_count; | |
503 | int nodeid_begin = 0; | |
504 | unsigned long pnum_begin = 0; | |
505 | ||
c4e1be9e | 506 | for_each_present_section_nr(0, pnum) { |
18732093 WL |
507 | struct mem_section *ms; |
508 | ||
18732093 WL |
509 | ms = __nr_to_section(pnum); |
510 | nodeid_begin = sparse_early_nid(ms); | |
511 | pnum_begin = pnum; | |
512 | break; | |
513 | } | |
514 | map_count = 1; | |
c4e1be9e | 515 | for_each_present_section_nr(pnum_begin + 1, pnum) { |
18732093 WL |
516 | struct mem_section *ms; |
517 | int nodeid; | |
518 | ||
18732093 WL |
519 | ms = __nr_to_section(pnum); |
520 | nodeid = sparse_early_nid(ms); | |
521 | if (nodeid == nodeid_begin) { | |
522 | map_count++; | |
523 | continue; | |
524 | } | |
525 | /* ok, we need to take cake of from pnum_begin to pnum - 1*/ | |
526 | alloc_func(data, pnum_begin, pnum, | |
527 | map_count, nodeid_begin); | |
528 | /* new start, update count etc*/ | |
529 | nodeid_begin = nodeid; | |
530 | pnum_begin = pnum; | |
c98aff64 | 531 | data += map_count * data_unit_size; |
18732093 WL |
532 | map_count = 1; |
533 | } | |
534 | /* ok, last chunk */ | |
08994b24 | 535 | alloc_func(data, pnum_begin, __highest_present_section_nr+1, |
18732093 WL |
536 | map_count, nodeid_begin); |
537 | } | |
538 | ||
193faea9 SR |
539 | /* |
540 | * Allocate the accumulated non-linear sections, allocate a mem_map | |
541 | * for each and record the physical to section mapping. | |
542 | */ | |
543 | void __init sparse_init(void) | |
544 | { | |
545 | unsigned long pnum; | |
546 | struct page *map; | |
5c0e3066 | 547 | unsigned long *usemap; |
e123dd3f | 548 | unsigned long **usemap_map; |
81d0d950 | 549 | int size; |
c98aff64 | 550 | int nr_consumed_maps = 0; |
81d0d950 | 551 | #ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER |
81d0d950 YL |
552 | int size2; |
553 | struct page **map_map; | |
554 | #endif | |
e123dd3f | 555 | |
55878e88 CS |
556 | /* see include/linux/mmzone.h 'struct mem_section' definition */ |
557 | BUILD_BUG_ON(!is_power_of_2(sizeof(struct mem_section))); | |
558 | ||
ca57df79 XQ |
559 | /* Setup pageblock_order for HUGETLB_PAGE_SIZE_VARIABLE */ |
560 | set_pageblock_order(); | |
561 | ||
e123dd3f YL |
562 | /* |
563 | * map is using big page (aka 2M in x86 64 bit) | |
564 | * usemap is less one page (aka 24 bytes) | |
565 | * so alloc 2M (with 2M align) and 24 bytes in turn will | |
566 | * make next 2M slip to one more 2M later. | |
567 | * then in big system, the memory will have a lot of holes... | |
25985edc | 568 | * here try to allocate 2M pages continuously. |
e123dd3f YL |
569 | * |
570 | * powerpc need to call sparse_init_one_section right after each | |
571 | * sparse_early_mem_map_alloc, so allocate usemap_map at first. | |
572 | */ | |
c98aff64 | 573 | size = sizeof(unsigned long *) * nr_present_sections; |
bb016b84 | 574 | usemap_map = memblock_virt_alloc(size, 0); |
e123dd3f YL |
575 | if (!usemap_map) |
576 | panic("can not allocate usemap_map\n"); | |
18732093 | 577 | alloc_usemap_and_memmap(sparse_early_usemaps_alloc_node, |
9258631b BH |
578 | (void *)usemap_map, |
579 | sizeof(usemap_map[0])); | |
193faea9 | 580 | |
9bdac914 | 581 | #ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER |
c98aff64 | 582 | size2 = sizeof(struct page *) * nr_present_sections; |
bb016b84 | 583 | map_map = memblock_virt_alloc(size2, 0); |
9bdac914 YL |
584 | if (!map_map) |
585 | panic("can not allocate map_map\n"); | |
18732093 | 586 | alloc_usemap_and_memmap(sparse_early_mem_maps_alloc_node, |
9258631b BH |
587 | (void *)map_map, |
588 | sizeof(map_map[0])); | |
9bdac914 YL |
589 | #endif |
590 | ||
c98aff64 BH |
591 | /* |
592 | * The number of present sections stored in nr_present_sections | |
593 | * are kept the same since mem sections are marked as present in | |
594 | * memory_present(). In this for loop, we need check which sections | |
595 | * failed to allocate memmap or usemap, then clear its | |
596 | * ->section_mem_map accordingly. During this process, we need | |
597 | * increase 'nr_consumed_maps' whether its allocation of memmap | |
598 | * or usemap failed or not, so that after we handle the i-th | |
599 | * memory section, can get memmap and usemap of (i+1)-th section | |
600 | * correctly. | |
601 | */ | |
c4e1be9e | 602 | for_each_present_section_nr(0, pnum) { |
07a34a8c | 603 | struct mem_section *ms; |
c98aff64 BH |
604 | |
605 | if (nr_consumed_maps >= nr_present_sections) { | |
606 | pr_err("nr_consumed_maps goes beyond nr_present_sections\n"); | |
607 | break; | |
608 | } | |
07a34a8c | 609 | ms = __nr_to_section(pnum); |
c98aff64 | 610 | usemap = usemap_map[nr_consumed_maps]; |
07a34a8c BH |
611 | if (!usemap) { |
612 | ms->section_mem_map = 0; | |
c98aff64 | 613 | nr_consumed_maps++; |
5c0e3066 | 614 | continue; |
07a34a8c | 615 | } |
5c0e3066 | 616 | |
9bdac914 | 617 | #ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER |
c98aff64 | 618 | map = map_map[nr_consumed_maps]; |
9bdac914 | 619 | #else |
e123dd3f | 620 | map = sparse_early_mem_map_alloc(pnum); |
9bdac914 | 621 | #endif |
07a34a8c BH |
622 | if (!map) { |
623 | ms->section_mem_map = 0; | |
c98aff64 | 624 | nr_consumed_maps++; |
e123dd3f | 625 | continue; |
07a34a8c | 626 | } |
e123dd3f | 627 | |
5c0e3066 MG |
628 | sparse_init_one_section(__nr_to_section(pnum), pnum, map, |
629 | usemap); | |
c98aff64 | 630 | nr_consumed_maps++; |
193faea9 | 631 | } |
e123dd3f | 632 | |
c2b91e2e YL |
633 | vmemmap_populate_print_last(); |
634 | ||
9bdac914 | 635 | #ifdef CONFIG_SPARSEMEM_ALLOC_MEM_MAP_TOGETHER |
bb016b84 | 636 | memblock_free_early(__pa(map_map), size2); |
9bdac914 | 637 | #endif |
bb016b84 | 638 | memblock_free_early(__pa(usemap_map), size); |
193faea9 SR |
639 | } |
640 | ||
641 | #ifdef CONFIG_MEMORY_HOTPLUG | |
2d070eab MH |
642 | |
643 | /* Mark all memory sections within the pfn range as online */ | |
644 | void online_mem_sections(unsigned long start_pfn, unsigned long end_pfn) | |
645 | { | |
646 | unsigned long pfn; | |
647 | ||
648 | for (pfn = start_pfn; pfn < end_pfn; pfn += PAGES_PER_SECTION) { | |
b4ccec41 | 649 | unsigned long section_nr = pfn_to_section_nr(pfn); |
2d070eab MH |
650 | struct mem_section *ms; |
651 | ||
652 | /* onlining code should never touch invalid ranges */ | |
653 | if (WARN_ON(!valid_section_nr(section_nr))) | |
654 | continue; | |
655 | ||
656 | ms = __nr_to_section(section_nr); | |
657 | ms->section_mem_map |= SECTION_IS_ONLINE; | |
658 | } | |
659 | } | |
660 | ||
661 | #ifdef CONFIG_MEMORY_HOTREMOVE | |
662 | /* Mark all memory sections within the pfn range as online */ | |
663 | void offline_mem_sections(unsigned long start_pfn, unsigned long end_pfn) | |
664 | { | |
665 | unsigned long pfn; | |
666 | ||
667 | for (pfn = start_pfn; pfn < end_pfn; pfn += PAGES_PER_SECTION) { | |
27227c73 | 668 | unsigned long section_nr = pfn_to_section_nr(pfn); |
2d070eab MH |
669 | struct mem_section *ms; |
670 | ||
671 | /* | |
672 | * TODO this needs some double checking. Offlining code makes | |
673 | * sure to check pfn_valid but those checks might be just bogus | |
674 | */ | |
675 | if (WARN_ON(!valid_section_nr(section_nr))) | |
676 | continue; | |
677 | ||
678 | ms = __nr_to_section(section_nr); | |
679 | ms->section_mem_map &= ~SECTION_IS_ONLINE; | |
680 | } | |
681 | } | |
682 | #endif | |
683 | ||
98f3cfc1 | 684 | #ifdef CONFIG_SPARSEMEM_VMEMMAP |
7b73d978 CH |
685 | static inline struct page *kmalloc_section_memmap(unsigned long pnum, int nid, |
686 | struct vmem_altmap *altmap) | |
98f3cfc1 YG |
687 | { |
688 | /* This will make the necessary allocations eventually. */ | |
7b73d978 | 689 | return sparse_mem_map_populate(pnum, nid, altmap); |
98f3cfc1 | 690 | } |
24b6d416 CH |
691 | static void __kfree_section_memmap(struct page *memmap, |
692 | struct vmem_altmap *altmap) | |
98f3cfc1 | 693 | { |
0aad818b | 694 | unsigned long start = (unsigned long)memmap; |
85b35fea | 695 | unsigned long end = (unsigned long)(memmap + PAGES_PER_SECTION); |
0aad818b | 696 | |
24b6d416 | 697 | vmemmap_free(start, end, altmap); |
98f3cfc1 | 698 | } |
4edd7cef | 699 | #ifdef CONFIG_MEMORY_HOTREMOVE |
81556b02 | 700 | static void free_map_bootmem(struct page *memmap) |
0c0a4a51 | 701 | { |
0aad818b | 702 | unsigned long start = (unsigned long)memmap; |
81556b02 | 703 | unsigned long end = (unsigned long)(memmap + PAGES_PER_SECTION); |
0aad818b | 704 | |
24b6d416 | 705 | vmemmap_free(start, end, NULL); |
0c0a4a51 | 706 | } |
4edd7cef | 707 | #endif /* CONFIG_MEMORY_HOTREMOVE */ |
98f3cfc1 | 708 | #else |
85b35fea | 709 | static struct page *__kmalloc_section_memmap(void) |
0b0acbec DH |
710 | { |
711 | struct page *page, *ret; | |
85b35fea | 712 | unsigned long memmap_size = sizeof(struct page) * PAGES_PER_SECTION; |
0b0acbec | 713 | |
f2d0aa5b | 714 | page = alloc_pages(GFP_KERNEL|__GFP_NOWARN, get_order(memmap_size)); |
0b0acbec DH |
715 | if (page) |
716 | goto got_map_page; | |
717 | ||
718 | ret = vmalloc(memmap_size); | |
719 | if (ret) | |
720 | goto got_map_ptr; | |
721 | ||
722 | return NULL; | |
723 | got_map_page: | |
724 | ret = (struct page *)pfn_to_kaddr(page_to_pfn(page)); | |
725 | got_map_ptr: | |
0b0acbec DH |
726 | |
727 | return ret; | |
728 | } | |
729 | ||
7b73d978 CH |
730 | static inline struct page *kmalloc_section_memmap(unsigned long pnum, int nid, |
731 | struct vmem_altmap *altmap) | |
98f3cfc1 | 732 | { |
85b35fea | 733 | return __kmalloc_section_memmap(); |
98f3cfc1 YG |
734 | } |
735 | ||
24b6d416 CH |
736 | static void __kfree_section_memmap(struct page *memmap, |
737 | struct vmem_altmap *altmap) | |
0b0acbec | 738 | { |
9e2779fa | 739 | if (is_vmalloc_addr(memmap)) |
0b0acbec DH |
740 | vfree(memmap); |
741 | else | |
742 | free_pages((unsigned long)memmap, | |
85b35fea | 743 | get_order(sizeof(struct page) * PAGES_PER_SECTION)); |
0b0acbec | 744 | } |
0c0a4a51 | 745 | |
4edd7cef | 746 | #ifdef CONFIG_MEMORY_HOTREMOVE |
81556b02 | 747 | static void free_map_bootmem(struct page *memmap) |
0c0a4a51 YG |
748 | { |
749 | unsigned long maps_section_nr, removing_section_nr, i; | |
81556b02 | 750 | unsigned long magic, nr_pages; |
ae64ffca | 751 | struct page *page = virt_to_page(memmap); |
0c0a4a51 | 752 | |
81556b02 ZY |
753 | nr_pages = PAGE_ALIGN(PAGES_PER_SECTION * sizeof(struct page)) |
754 | >> PAGE_SHIFT; | |
755 | ||
0c0a4a51 | 756 | for (i = 0; i < nr_pages; i++, page++) { |
ddffe98d | 757 | magic = (unsigned long) page->freelist; |
0c0a4a51 YG |
758 | |
759 | BUG_ON(magic == NODE_INFO); | |
760 | ||
761 | maps_section_nr = pfn_to_section_nr(page_to_pfn(page)); | |
857e522a | 762 | removing_section_nr = page_private(page); |
0c0a4a51 YG |
763 | |
764 | /* | |
765 | * When this function is called, the removing section is | |
766 | * logical offlined state. This means all pages are isolated | |
767 | * from page allocator. If removing section's memmap is placed | |
768 | * on the same section, it must not be freed. | |
769 | * If it is freed, page allocator may allocate it which will | |
770 | * be removed physically soon. | |
771 | */ | |
772 | if (maps_section_nr != removing_section_nr) | |
773 | put_page_bootmem(page); | |
774 | } | |
775 | } | |
4edd7cef | 776 | #endif /* CONFIG_MEMORY_HOTREMOVE */ |
98f3cfc1 | 777 | #endif /* CONFIG_SPARSEMEM_VMEMMAP */ |
0b0acbec | 778 | |
29751f69 AW |
779 | /* |
780 | * returns the number of sections whose mem_maps were properly | |
781 | * set. If this is <=0, then that means that the passed-in | |
782 | * map was not consumed and must be freed. | |
783 | */ | |
7b73d978 CH |
784 | int __meminit sparse_add_one_section(struct pglist_data *pgdat, |
785 | unsigned long start_pfn, struct vmem_altmap *altmap) | |
29751f69 | 786 | { |
0b0acbec | 787 | unsigned long section_nr = pfn_to_section_nr(start_pfn); |
0b0acbec DH |
788 | struct mem_section *ms; |
789 | struct page *memmap; | |
5c0e3066 | 790 | unsigned long *usemap; |
0b0acbec DH |
791 | unsigned long flags; |
792 | int ret; | |
29751f69 | 793 | |
0b0acbec DH |
794 | /* |
795 | * no locking for this, because it does its own | |
796 | * plus, it does a kmalloc | |
797 | */ | |
bbd06825 WC |
798 | ret = sparse_index_init(section_nr, pgdat->node_id); |
799 | if (ret < 0 && ret != -EEXIST) | |
800 | return ret; | |
4e40987f | 801 | ret = 0; |
7b73d978 | 802 | memmap = kmalloc_section_memmap(section_nr, pgdat->node_id, altmap); |
bbd06825 WC |
803 | if (!memmap) |
804 | return -ENOMEM; | |
5c0e3066 | 805 | usemap = __kmalloc_section_usemap(); |
bbd06825 | 806 | if (!usemap) { |
24b6d416 | 807 | __kfree_section_memmap(memmap, altmap); |
bbd06825 WC |
808 | return -ENOMEM; |
809 | } | |
0b0acbec DH |
810 | |
811 | pgdat_resize_lock(pgdat, &flags); | |
29751f69 | 812 | |
0b0acbec DH |
813 | ms = __pfn_to_section(start_pfn); |
814 | if (ms->section_mem_map & SECTION_MARKED_PRESENT) { | |
815 | ret = -EEXIST; | |
816 | goto out; | |
817 | } | |
5c0e3066 | 818 | |
d0dc12e8 PT |
819 | #ifdef CONFIG_DEBUG_VM |
820 | /* | |
821 | * Poison uninitialized struct pages in order to catch invalid flags | |
822 | * combinations. | |
823 | */ | |
824 | memset(memmap, PAGE_POISON_PATTERN, sizeof(struct page) * PAGES_PER_SECTION); | |
825 | #endif | |
3ac19f8e | 826 | |
c4e1be9e | 827 | section_mark_present(ms); |
4e40987f | 828 | sparse_init_one_section(ms, section_nr, memmap, usemap); |
0b0acbec | 829 | |
0b0acbec DH |
830 | out: |
831 | pgdat_resize_unlock(pgdat, &flags); | |
4e40987f | 832 | if (ret < 0) { |
bbd06825 | 833 | kfree(usemap); |
24b6d416 | 834 | __kfree_section_memmap(memmap, altmap); |
bbd06825 | 835 | } |
0b0acbec | 836 | return ret; |
29751f69 | 837 | } |
ea01ea93 | 838 | |
f3deb687 | 839 | #ifdef CONFIG_MEMORY_HOTREMOVE |
95a4774d WC |
840 | #ifdef CONFIG_MEMORY_FAILURE |
841 | static void clear_hwpoisoned_pages(struct page *memmap, int nr_pages) | |
842 | { | |
843 | int i; | |
844 | ||
845 | if (!memmap) | |
846 | return; | |
847 | ||
4b94ffdc | 848 | for (i = 0; i < nr_pages; i++) { |
95a4774d | 849 | if (PageHWPoison(&memmap[i])) { |
293c07e3 | 850 | atomic_long_sub(1, &num_poisoned_pages); |
95a4774d WC |
851 | ClearPageHWPoison(&memmap[i]); |
852 | } | |
853 | } | |
854 | } | |
855 | #else | |
856 | static inline void clear_hwpoisoned_pages(struct page *memmap, int nr_pages) | |
857 | { | |
858 | } | |
859 | #endif | |
860 | ||
24b6d416 CH |
861 | static void free_section_usemap(struct page *memmap, unsigned long *usemap, |
862 | struct vmem_altmap *altmap) | |
4edd7cef DR |
863 | { |
864 | struct page *usemap_page; | |
4edd7cef DR |
865 | |
866 | if (!usemap) | |
867 | return; | |
868 | ||
869 | usemap_page = virt_to_page(usemap); | |
870 | /* | |
871 | * Check to see if allocation came from hot-plug-add | |
872 | */ | |
873 | if (PageSlab(usemap_page) || PageCompound(usemap_page)) { | |
874 | kfree(usemap); | |
875 | if (memmap) | |
24b6d416 | 876 | __kfree_section_memmap(memmap, altmap); |
4edd7cef DR |
877 | return; |
878 | } | |
879 | ||
880 | /* | |
881 | * The usemap came from bootmem. This is packed with other usemaps | |
882 | * on the section which has pgdat at boot time. Just keep it as is now. | |
883 | */ | |
884 | ||
81556b02 ZY |
885 | if (memmap) |
886 | free_map_bootmem(memmap); | |
4edd7cef DR |
887 | } |
888 | ||
4b94ffdc | 889 | void sparse_remove_one_section(struct zone *zone, struct mem_section *ms, |
24b6d416 | 890 | unsigned long map_offset, struct vmem_altmap *altmap) |
ea01ea93 BP |
891 | { |
892 | struct page *memmap = NULL; | |
cd099682 TC |
893 | unsigned long *usemap = NULL, flags; |
894 | struct pglist_data *pgdat = zone->zone_pgdat; | |
ea01ea93 | 895 | |
cd099682 | 896 | pgdat_resize_lock(pgdat, &flags); |
ea01ea93 BP |
897 | if (ms->section_mem_map) { |
898 | usemap = ms->pageblock_flags; | |
899 | memmap = sparse_decode_mem_map(ms->section_mem_map, | |
900 | __section_nr(ms)); | |
901 | ms->section_mem_map = 0; | |
902 | ms->pageblock_flags = NULL; | |
903 | } | |
cd099682 | 904 | pgdat_resize_unlock(pgdat, &flags); |
ea01ea93 | 905 | |
4b94ffdc DW |
906 | clear_hwpoisoned_pages(memmap + map_offset, |
907 | PAGES_PER_SECTION - map_offset); | |
24b6d416 | 908 | free_section_usemap(memmap, usemap, altmap); |
ea01ea93 | 909 | } |
4edd7cef DR |
910 | #endif /* CONFIG_MEMORY_HOTREMOVE */ |
911 | #endif /* CONFIG_MEMORY_HOTPLUG */ |