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