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