]>
Commit | Line | Data |
---|---|---|
95f72d1e YL |
1 | /* |
2 | * Procedures for maintaining information about logical memory blocks. | |
3 | * | |
4 | * Peter Bergner, IBM Corp. June 2001. | |
5 | * Copyright (C) 2001 Peter Bergner. | |
6 | * | |
7 | * This program is free software; you can redistribute it and/or | |
8 | * modify it under the terms of the GNU General Public License | |
9 | * as published by the Free Software Foundation; either version | |
10 | * 2 of the License, or (at your option) any later version. | |
11 | */ | |
12 | ||
13 | #include <linux/kernel.h> | |
142b45a7 | 14 | #include <linux/slab.h> |
95f72d1e YL |
15 | #include <linux/init.h> |
16 | #include <linux/bitops.h> | |
449e8df3 | 17 | #include <linux/poison.h> |
c196f76f | 18 | #include <linux/pfn.h> |
6d03b885 BH |
19 | #include <linux/debugfs.h> |
20 | #include <linux/seq_file.h> | |
95f72d1e YL |
21 | #include <linux/memblock.h> |
22 | ||
10d06439 | 23 | struct memblock memblock __initdata_memblock; |
95f72d1e | 24 | |
10d06439 YL |
25 | int memblock_debug __initdata_memblock; |
26 | int memblock_can_resize __initdata_memblock; | |
27 | static struct memblock_region memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS + 1] __initdata_memblock; | |
28 | static struct memblock_region memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS + 1] __initdata_memblock; | |
95f72d1e | 29 | |
142b45a7 BH |
30 | /* inline so we don't get a warning when pr_debug is compiled out */ |
31 | static inline const char *memblock_type_name(struct memblock_type *type) | |
32 | { | |
33 | if (type == &memblock.memory) | |
34 | return "memory"; | |
35 | else if (type == &memblock.reserved) | |
36 | return "reserved"; | |
37 | else | |
38 | return "unknown"; | |
39 | } | |
40 | ||
6ed311b2 BH |
41 | /* |
42 | * Address comparison utilities | |
43 | */ | |
10d06439 | 44 | static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1, |
2898cc4c | 45 | phys_addr_t base2, phys_addr_t size2) |
95f72d1e YL |
46 | { |
47 | return ((base1 < (base2 + size2)) && (base2 < (base1 + size1))); | |
48 | } | |
49 | ||
10d06439 | 50 | long __init_memblock memblock_overlaps_region(struct memblock_type *type, phys_addr_t base, phys_addr_t size) |
6ed311b2 BH |
51 | { |
52 | unsigned long i; | |
53 | ||
54 | for (i = 0; i < type->cnt; i++) { | |
55 | phys_addr_t rgnbase = type->regions[i].base; | |
56 | phys_addr_t rgnsize = type->regions[i].size; | |
57 | if (memblock_addrs_overlap(base, size, rgnbase, rgnsize)) | |
58 | break; | |
59 | } | |
60 | ||
61 | return (i < type->cnt) ? i : -1; | |
62 | } | |
63 | ||
64 | /* | |
65 | * Find, allocate, deallocate or reserve unreserved regions. All allocations | |
66 | * are top-down. | |
67 | */ | |
68 | ||
cd79481d | 69 | static phys_addr_t __init_memblock memblock_find_region(phys_addr_t start, phys_addr_t end, |
6ed311b2 BH |
70 | phys_addr_t size, phys_addr_t align) |
71 | { | |
72 | phys_addr_t base, res_base; | |
73 | long j; | |
74 | ||
f1af98c7 YL |
75 | /* In case, huge size is requested */ |
76 | if (end < size) | |
1f5026a7 | 77 | return 0; |
f1af98c7 | 78 | |
348968eb | 79 | base = round_down(end - size, align); |
f1af98c7 | 80 | |
25818f0f BH |
81 | /* Prevent allocations returning 0 as it's also used to |
82 | * indicate an allocation failure | |
83 | */ | |
84 | if (start == 0) | |
85 | start = PAGE_SIZE; | |
86 | ||
6ed311b2 BH |
87 | while (start <= base) { |
88 | j = memblock_overlaps_region(&memblock.reserved, base, size); | |
89 | if (j < 0) | |
90 | return base; | |
91 | res_base = memblock.reserved.regions[j].base; | |
92 | if (res_base < size) | |
93 | break; | |
348968eb | 94 | base = round_down(res_base - size, align); |
6ed311b2 BH |
95 | } |
96 | ||
1f5026a7 | 97 | return 0; |
6ed311b2 BH |
98 | } |
99 | ||
fc769a8e TH |
100 | /* |
101 | * Find a free area with specified alignment in a specific range. | |
102 | */ | |
103 | phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start, phys_addr_t end, | |
104 | phys_addr_t size, phys_addr_t align) | |
6ed311b2 BH |
105 | { |
106 | long i; | |
6ed311b2 BH |
107 | |
108 | BUG_ON(0 == size); | |
109 | ||
6ed311b2 | 110 | /* Pump up max_addr */ |
fef501d4 BH |
111 | if (end == MEMBLOCK_ALLOC_ACCESSIBLE) |
112 | end = memblock.current_limit; | |
6ed311b2 BH |
113 | |
114 | /* We do a top-down search, this tends to limit memory | |
115 | * fragmentation by keeping early boot allocs near the | |
116 | * top of memory | |
117 | */ | |
118 | for (i = memblock.memory.cnt - 1; i >= 0; i--) { | |
119 | phys_addr_t memblockbase = memblock.memory.regions[i].base; | |
120 | phys_addr_t memblocksize = memblock.memory.regions[i].size; | |
fef501d4 | 121 | phys_addr_t bottom, top, found; |
6ed311b2 BH |
122 | |
123 | if (memblocksize < size) | |
124 | continue; | |
fef501d4 BH |
125 | if ((memblockbase + memblocksize) <= start) |
126 | break; | |
127 | bottom = max(memblockbase, start); | |
128 | top = min(memblockbase + memblocksize, end); | |
129 | if (bottom >= top) | |
130 | continue; | |
131 | found = memblock_find_region(bottom, top, size, align); | |
1f5026a7 | 132 | if (found) |
fef501d4 | 133 | return found; |
6ed311b2 | 134 | } |
1f5026a7 | 135 | return 0; |
6ed311b2 BH |
136 | } |
137 | ||
7950c407 YL |
138 | /* |
139 | * Free memblock.reserved.regions | |
140 | */ | |
141 | int __init_memblock memblock_free_reserved_regions(void) | |
142 | { | |
143 | if (memblock.reserved.regions == memblock_reserved_init_regions) | |
144 | return 0; | |
145 | ||
146 | return memblock_free(__pa(memblock.reserved.regions), | |
147 | sizeof(struct memblock_region) * memblock.reserved.max); | |
148 | } | |
149 | ||
150 | /* | |
151 | * Reserve memblock.reserved.regions | |
152 | */ | |
153 | int __init_memblock memblock_reserve_reserved_regions(void) | |
154 | { | |
155 | if (memblock.reserved.regions == memblock_reserved_init_regions) | |
156 | return 0; | |
157 | ||
158 | return memblock_reserve(__pa(memblock.reserved.regions), | |
159 | sizeof(struct memblock_region) * memblock.reserved.max); | |
160 | } | |
161 | ||
10d06439 | 162 | static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r) |
95f72d1e YL |
163 | { |
164 | unsigned long i; | |
165 | ||
e3239ff9 BH |
166 | for (i = r; i < type->cnt - 1; i++) { |
167 | type->regions[i].base = type->regions[i + 1].base; | |
168 | type->regions[i].size = type->regions[i + 1].size; | |
95f72d1e | 169 | } |
e3239ff9 | 170 | type->cnt--; |
95f72d1e | 171 | |
8f7a6605 BH |
172 | /* Special case for empty arrays */ |
173 | if (type->cnt == 0) { | |
174 | type->cnt = 1; | |
175 | type->regions[0].base = 0; | |
176 | type->regions[0].size = 0; | |
177 | } | |
95f72d1e YL |
178 | } |
179 | ||
142b45a7 BH |
180 | /* Defined below but needed now */ |
181 | static long memblock_add_region(struct memblock_type *type, phys_addr_t base, phys_addr_t size); | |
182 | ||
10d06439 | 183 | static int __init_memblock memblock_double_array(struct memblock_type *type) |
142b45a7 BH |
184 | { |
185 | struct memblock_region *new_array, *old_array; | |
186 | phys_addr_t old_size, new_size, addr; | |
187 | int use_slab = slab_is_available(); | |
188 | ||
189 | /* We don't allow resizing until we know about the reserved regions | |
190 | * of memory that aren't suitable for allocation | |
191 | */ | |
192 | if (!memblock_can_resize) | |
193 | return -1; | |
194 | ||
142b45a7 BH |
195 | /* Calculate new doubled size */ |
196 | old_size = type->max * sizeof(struct memblock_region); | |
197 | new_size = old_size << 1; | |
198 | ||
199 | /* Try to find some space for it. | |
200 | * | |
201 | * WARNING: We assume that either slab_is_available() and we use it or | |
202 | * we use MEMBLOCK for allocations. That means that this is unsafe to use | |
203 | * when bootmem is currently active (unless bootmem itself is implemented | |
204 | * on top of MEMBLOCK which isn't the case yet) | |
205 | * | |
206 | * This should however not be an issue for now, as we currently only | |
207 | * call into MEMBLOCK while it's still active, or much later when slab is | |
208 | * active for memory hotplug operations | |
209 | */ | |
210 | if (use_slab) { | |
211 | new_array = kmalloc(new_size, GFP_KERNEL); | |
1f5026a7 | 212 | addr = new_array ? __pa(new_array) : 0; |
142b45a7 | 213 | } else |
fc769a8e | 214 | addr = memblock_find_in_range(0, MEMBLOCK_ALLOC_ACCESSIBLE, new_size, sizeof(phys_addr_t)); |
1f5026a7 | 215 | if (!addr) { |
142b45a7 BH |
216 | pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n", |
217 | memblock_type_name(type), type->max, type->max * 2); | |
218 | return -1; | |
219 | } | |
220 | new_array = __va(addr); | |
221 | ||
ea9e4376 YL |
222 | memblock_dbg("memblock: %s array is doubled to %ld at [%#010llx-%#010llx]", |
223 | memblock_type_name(type), type->max * 2, (u64)addr, (u64)addr + new_size - 1); | |
224 | ||
142b45a7 BH |
225 | /* Found space, we now need to move the array over before |
226 | * we add the reserved region since it may be our reserved | |
227 | * array itself that is full. | |
228 | */ | |
229 | memcpy(new_array, type->regions, old_size); | |
230 | memset(new_array + type->max, 0, old_size); | |
231 | old_array = type->regions; | |
232 | type->regions = new_array; | |
233 | type->max <<= 1; | |
234 | ||
235 | /* If we use SLAB that's it, we are done */ | |
236 | if (use_slab) | |
237 | return 0; | |
238 | ||
239 | /* Add the new reserved region now. Should not fail ! */ | |
8f7a6605 | 240 | BUG_ON(memblock_add_region(&memblock.reserved, addr, new_size)); |
142b45a7 BH |
241 | |
242 | /* If the array wasn't our static init one, then free it. We only do | |
243 | * that before SLAB is available as later on, we don't know whether | |
244 | * to use kfree or free_bootmem_pages(). Shouldn't be a big deal | |
245 | * anyways | |
246 | */ | |
247 | if (old_array != memblock_memory_init_regions && | |
248 | old_array != memblock_reserved_init_regions) | |
249 | memblock_free(__pa(old_array), old_size); | |
250 | ||
251 | return 0; | |
252 | } | |
253 | ||
10d06439 | 254 | extern int __init_memblock __weak memblock_memory_can_coalesce(phys_addr_t addr1, phys_addr_t size1, |
d2cd563b BH |
255 | phys_addr_t addr2, phys_addr_t size2) |
256 | { | |
257 | return 1; | |
258 | } | |
259 | ||
8f7a6605 BH |
260 | static long __init_memblock memblock_add_region(struct memblock_type *type, |
261 | phys_addr_t base, phys_addr_t size) | |
95f72d1e | 262 | { |
8f7a6605 BH |
263 | phys_addr_t end = base + size; |
264 | int i, slot = -1; | |
95f72d1e | 265 | |
8f7a6605 | 266 | /* First try and coalesce this MEMBLOCK with others */ |
e3239ff9 | 267 | for (i = 0; i < type->cnt; i++) { |
8f7a6605 BH |
268 | struct memblock_region *rgn = &type->regions[i]; |
269 | phys_addr_t rend = rgn->base + rgn->size; | |
270 | ||
271 | /* Exit if there's no possible hits */ | |
272 | if (rgn->base > end || rgn->size == 0) | |
273 | break; | |
95f72d1e | 274 | |
8f7a6605 BH |
275 | /* Check if we are fully enclosed within an existing |
276 | * block | |
277 | */ | |
278 | if (rgn->base <= base && rend >= end) | |
95f72d1e YL |
279 | return 0; |
280 | ||
8f7a6605 BH |
281 | /* Check if we overlap or are adjacent with the bottom |
282 | * of a block. | |
283 | */ | |
284 | if (base < rgn->base && end >= rgn->base) { | |
285 | /* If we can't coalesce, create a new block */ | |
286 | if (!memblock_memory_can_coalesce(base, size, | |
287 | rgn->base, | |
288 | rgn->size)) { | |
289 | /* Overlap & can't coalesce are mutually | |
290 | * exclusive, if you do that, be prepared | |
291 | * for trouble | |
292 | */ | |
293 | WARN_ON(end != rgn->base); | |
294 | goto new_block; | |
295 | } | |
296 | /* We extend the bottom of the block down to our | |
297 | * base | |
298 | */ | |
299 | rgn->base = base; | |
300 | rgn->size = rend - base; | |
301 | ||
302 | /* Return if we have nothing else to allocate | |
303 | * (fully coalesced) | |
304 | */ | |
305 | if (rend >= end) | |
306 | return 0; | |
307 | ||
308 | /* We continue processing from the end of the | |
309 | * coalesced block. | |
310 | */ | |
311 | base = rend; | |
312 | size = end - base; | |
313 | } | |
314 | ||
315 | /* Now check if we overlap or are adjacent with the | |
316 | * top of a block | |
317 | */ | |
318 | if (base <= rend && end >= rend) { | |
319 | /* If we can't coalesce, create a new block */ | |
320 | if (!memblock_memory_can_coalesce(rgn->base, | |
321 | rgn->size, | |
322 | base, size)) { | |
323 | /* Overlap & can't coalesce are mutually | |
324 | * exclusive, if you do that, be prepared | |
325 | * for trouble | |
326 | */ | |
327 | WARN_ON(rend != base); | |
328 | goto new_block; | |
329 | } | |
330 | /* We adjust our base down to enclose the | |
331 | * original block and destroy it. It will be | |
332 | * part of our new allocation. Since we've | |
333 | * freed an entry, we know we won't fail | |
334 | * to allocate one later, so we won't risk | |
335 | * losing the original block allocation. | |
336 | */ | |
337 | size += (base - rgn->base); | |
338 | base = rgn->base; | |
339 | memblock_remove_region(type, i--); | |
95f72d1e YL |
340 | } |
341 | } | |
342 | ||
8f7a6605 BH |
343 | /* If the array is empty, special case, replace the fake |
344 | * filler region and return | |
d2cd563b | 345 | */ |
8f7a6605 BH |
346 | if ((type->cnt == 1) && (type->regions[0].size == 0)) { |
347 | type->regions[0].base = base; | |
348 | type->regions[0].size = size; | |
349 | return 0; | |
95f72d1e YL |
350 | } |
351 | ||
8f7a6605 | 352 | new_block: |
142b45a7 BH |
353 | /* If we are out of space, we fail. It's too late to resize the array |
354 | * but then this shouldn't have happened in the first place. | |
355 | */ | |
356 | if (WARN_ON(type->cnt >= type->max)) | |
95f72d1e YL |
357 | return -1; |
358 | ||
359 | /* Couldn't coalesce the MEMBLOCK, so add it to the sorted table. */ | |
e3239ff9 BH |
360 | for (i = type->cnt - 1; i >= 0; i--) { |
361 | if (base < type->regions[i].base) { | |
362 | type->regions[i+1].base = type->regions[i].base; | |
363 | type->regions[i+1].size = type->regions[i].size; | |
95f72d1e | 364 | } else { |
e3239ff9 BH |
365 | type->regions[i+1].base = base; |
366 | type->regions[i+1].size = size; | |
8f7a6605 | 367 | slot = i + 1; |
95f72d1e YL |
368 | break; |
369 | } | |
370 | } | |
e3239ff9 BH |
371 | if (base < type->regions[0].base) { |
372 | type->regions[0].base = base; | |
373 | type->regions[0].size = size; | |
8f7a6605 | 374 | slot = 0; |
95f72d1e | 375 | } |
e3239ff9 | 376 | type->cnt++; |
95f72d1e | 377 | |
142b45a7 BH |
378 | /* The array is full ? Try to resize it. If that fails, we undo |
379 | * our allocation and return an error | |
380 | */ | |
381 | if (type->cnt == type->max && memblock_double_array(type)) { | |
8f7a6605 BH |
382 | BUG_ON(slot < 0); |
383 | memblock_remove_region(type, slot); | |
142b45a7 BH |
384 | return -1; |
385 | } | |
386 | ||
95f72d1e YL |
387 | return 0; |
388 | } | |
389 | ||
10d06439 | 390 | long __init_memblock memblock_add(phys_addr_t base, phys_addr_t size) |
95f72d1e | 391 | { |
e3239ff9 | 392 | return memblock_add_region(&memblock.memory, base, size); |
95f72d1e YL |
393 | |
394 | } | |
395 | ||
8f7a6605 BH |
396 | static long __init_memblock __memblock_remove(struct memblock_type *type, |
397 | phys_addr_t base, phys_addr_t size) | |
95f72d1e | 398 | { |
2898cc4c | 399 | phys_addr_t end = base + size; |
95f72d1e YL |
400 | int i; |
401 | ||
8f7a6605 BH |
402 | /* Walk through the array for collisions */ |
403 | for (i = 0; i < type->cnt; i++) { | |
404 | struct memblock_region *rgn = &type->regions[i]; | |
405 | phys_addr_t rend = rgn->base + rgn->size; | |
95f72d1e | 406 | |
8f7a6605 BH |
407 | /* Nothing more to do, exit */ |
408 | if (rgn->base > end || rgn->size == 0) | |
95f72d1e | 409 | break; |
95f72d1e | 410 | |
8f7a6605 BH |
411 | /* If we fully enclose the block, drop it */ |
412 | if (base <= rgn->base && end >= rend) { | |
413 | memblock_remove_region(type, i--); | |
414 | continue; | |
415 | } | |
95f72d1e | 416 | |
8f7a6605 BH |
417 | /* If we are fully enclosed within a block |
418 | * then we need to split it and we are done | |
419 | */ | |
420 | if (base > rgn->base && end < rend) { | |
421 | rgn->size = base - rgn->base; | |
422 | if (!memblock_add_region(type, end, rend - end)) | |
423 | return 0; | |
424 | /* Failure to split is bad, we at least | |
425 | * restore the block before erroring | |
426 | */ | |
427 | rgn->size = rend - rgn->base; | |
428 | WARN_ON(1); | |
429 | return -1; | |
430 | } | |
95f72d1e | 431 | |
8f7a6605 BH |
432 | /* Check if we need to trim the bottom of a block */ |
433 | if (rgn->base < end && rend > end) { | |
434 | rgn->size -= end - rgn->base; | |
435 | rgn->base = end; | |
436 | break; | |
437 | } | |
95f72d1e | 438 | |
8f7a6605 BH |
439 | /* And check if we need to trim the top of a block */ |
440 | if (base < rend) | |
441 | rgn->size -= rend - base; | |
95f72d1e | 442 | |
8f7a6605 BH |
443 | } |
444 | return 0; | |
95f72d1e YL |
445 | } |
446 | ||
10d06439 | 447 | long __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size) |
95f72d1e YL |
448 | { |
449 | return __memblock_remove(&memblock.memory, base, size); | |
450 | } | |
451 | ||
3661ca66 | 452 | long __init_memblock memblock_free(phys_addr_t base, phys_addr_t size) |
95f72d1e YL |
453 | { |
454 | return __memblock_remove(&memblock.reserved, base, size); | |
455 | } | |
456 | ||
3661ca66 | 457 | long __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size) |
95f72d1e | 458 | { |
e3239ff9 | 459 | struct memblock_type *_rgn = &memblock.reserved; |
95f72d1e YL |
460 | |
461 | BUG_ON(0 == size); | |
462 | ||
463 | return memblock_add_region(_rgn, base, size); | |
464 | } | |
465 | ||
6ed311b2 | 466 | phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) |
95f72d1e | 467 | { |
6ed311b2 | 468 | phys_addr_t found; |
95f72d1e | 469 | |
6ed311b2 BH |
470 | /* We align the size to limit fragmentation. Without this, a lot of |
471 | * small allocs quickly eat up the whole reserve array on sparc | |
472 | */ | |
348968eb | 473 | size = round_up(size, align); |
95f72d1e | 474 | |
fc769a8e | 475 | found = memblock_find_in_range(0, max_addr, size, align); |
1f5026a7 | 476 | if (found && !memblock_add_region(&memblock.reserved, found, size)) |
6ed311b2 | 477 | return found; |
95f72d1e | 478 | |
6ed311b2 | 479 | return 0; |
95f72d1e YL |
480 | } |
481 | ||
6ed311b2 | 482 | phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) |
95f72d1e | 483 | { |
6ed311b2 BH |
484 | phys_addr_t alloc; |
485 | ||
486 | alloc = __memblock_alloc_base(size, align, max_addr); | |
487 | ||
488 | if (alloc == 0) | |
489 | panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n", | |
490 | (unsigned long long) size, (unsigned long long) max_addr); | |
491 | ||
492 | return alloc; | |
95f72d1e YL |
493 | } |
494 | ||
6ed311b2 | 495 | phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align) |
95f72d1e | 496 | { |
6ed311b2 BH |
497 | return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE); |
498 | } | |
95f72d1e | 499 | |
95f72d1e | 500 | |
6ed311b2 BH |
501 | /* |
502 | * Additional node-local allocators. Search for node memory is bottom up | |
503 | * and walks memblock regions within that node bottom-up as well, but allocation | |
c196f76f BH |
504 | * within an memblock region is top-down. XXX I plan to fix that at some stage |
505 | * | |
506 | * WARNING: Only available after early_node_map[] has been populated, | |
507 | * on some architectures, that is after all the calls to add_active_range() | |
508 | * have been done to populate it. | |
6ed311b2 | 509 | */ |
95f72d1e | 510 | |
2898cc4c | 511 | phys_addr_t __weak __init memblock_nid_range(phys_addr_t start, phys_addr_t end, int *nid) |
c3f72b57 | 512 | { |
c196f76f BH |
513 | #ifdef CONFIG_ARCH_POPULATES_NODE_MAP |
514 | /* | |
515 | * This code originates from sparc which really wants use to walk by addresses | |
516 | * and returns the nid. This is not very convenient for early_pfn_map[] users | |
517 | * as the map isn't sorted yet, and it really wants to be walked by nid. | |
518 | * | |
519 | * For now, I implement the inefficient method below which walks the early | |
520 | * map multiple times. Eventually we may want to use an ARCH config option | |
521 | * to implement a completely different method for both case. | |
522 | */ | |
523 | unsigned long start_pfn, end_pfn; | |
524 | int i; | |
525 | ||
526 | for (i = 0; i < MAX_NUMNODES; i++) { | |
527 | get_pfn_range_for_nid(i, &start_pfn, &end_pfn); | |
528 | if (start < PFN_PHYS(start_pfn) || start >= PFN_PHYS(end_pfn)) | |
529 | continue; | |
530 | *nid = i; | |
531 | return min(end, PFN_PHYS(end_pfn)); | |
532 | } | |
533 | #endif | |
c3f72b57 BH |
534 | *nid = 0; |
535 | ||
536 | return end; | |
537 | } | |
538 | ||
2898cc4c BH |
539 | static phys_addr_t __init memblock_alloc_nid_region(struct memblock_region *mp, |
540 | phys_addr_t size, | |
541 | phys_addr_t align, int nid) | |
95f72d1e | 542 | { |
2898cc4c | 543 | phys_addr_t start, end; |
95f72d1e YL |
544 | |
545 | start = mp->base; | |
546 | end = start + mp->size; | |
547 | ||
348968eb | 548 | start = round_up(start, align); |
95f72d1e | 549 | while (start < end) { |
2898cc4c | 550 | phys_addr_t this_end; |
95f72d1e YL |
551 | int this_nid; |
552 | ||
35a1f0bd | 553 | this_end = memblock_nid_range(start, end, &this_nid); |
95f72d1e | 554 | if (this_nid == nid) { |
3a9c2c81 | 555 | phys_addr_t ret = memblock_find_region(start, this_end, size, align); |
1f5026a7 | 556 | if (ret && |
8f7a6605 | 557 | !memblock_add_region(&memblock.reserved, ret, size)) |
95f72d1e YL |
558 | return ret; |
559 | } | |
560 | start = this_end; | |
561 | } | |
562 | ||
1f5026a7 | 563 | return 0; |
95f72d1e YL |
564 | } |
565 | ||
2898cc4c | 566 | phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid) |
95f72d1e | 567 | { |
e3239ff9 | 568 | struct memblock_type *mem = &memblock.memory; |
95f72d1e YL |
569 | int i; |
570 | ||
571 | BUG_ON(0 == size); | |
572 | ||
7f219c73 BH |
573 | /* We align the size to limit fragmentation. Without this, a lot of |
574 | * small allocs quickly eat up the whole reserve array on sparc | |
575 | */ | |
348968eb | 576 | size = round_up(size, align); |
7f219c73 | 577 | |
c3f72b57 BH |
578 | /* We do a bottom-up search for a region with the right |
579 | * nid since that's easier considering how memblock_nid_range() | |
580 | * works | |
581 | */ | |
95f72d1e | 582 | for (i = 0; i < mem->cnt; i++) { |
2898cc4c | 583 | phys_addr_t ret = memblock_alloc_nid_region(&mem->regions[i], |
95f72d1e | 584 | size, align, nid); |
1f5026a7 | 585 | if (ret) |
95f72d1e YL |
586 | return ret; |
587 | } | |
588 | ||
9d1e2492 BH |
589 | return 0; |
590 | } | |
591 | ||
592 | phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid) | |
593 | { | |
594 | phys_addr_t res = memblock_alloc_nid(size, align, nid); | |
595 | ||
596 | if (res) | |
597 | return res; | |
15fb0972 | 598 | return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE); |
95f72d1e YL |
599 | } |
600 | ||
9d1e2492 BH |
601 | |
602 | /* | |
603 | * Remaining API functions | |
604 | */ | |
605 | ||
95f72d1e | 606 | /* You must call memblock_analyze() before this. */ |
2898cc4c | 607 | phys_addr_t __init memblock_phys_mem_size(void) |
95f72d1e | 608 | { |
4734b594 | 609 | return memblock.memory_size; |
95f72d1e YL |
610 | } |
611 | ||
10d06439 | 612 | phys_addr_t __init_memblock memblock_end_of_DRAM(void) |
95f72d1e YL |
613 | { |
614 | int idx = memblock.memory.cnt - 1; | |
615 | ||
e3239ff9 | 616 | return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size); |
95f72d1e YL |
617 | } |
618 | ||
619 | /* You must call memblock_analyze() after this. */ | |
2898cc4c | 620 | void __init memblock_enforce_memory_limit(phys_addr_t memory_limit) |
95f72d1e YL |
621 | { |
622 | unsigned long i; | |
2898cc4c | 623 | phys_addr_t limit; |
e3239ff9 | 624 | struct memblock_region *p; |
95f72d1e YL |
625 | |
626 | if (!memory_limit) | |
627 | return; | |
628 | ||
629 | /* Truncate the memblock regions to satisfy the memory limit. */ | |
630 | limit = memory_limit; | |
631 | for (i = 0; i < memblock.memory.cnt; i++) { | |
e3239ff9 BH |
632 | if (limit > memblock.memory.regions[i].size) { |
633 | limit -= memblock.memory.regions[i].size; | |
95f72d1e YL |
634 | continue; |
635 | } | |
636 | ||
e3239ff9 | 637 | memblock.memory.regions[i].size = limit; |
95f72d1e YL |
638 | memblock.memory.cnt = i + 1; |
639 | break; | |
640 | } | |
641 | ||
95f72d1e YL |
642 | memory_limit = memblock_end_of_DRAM(); |
643 | ||
644 | /* And truncate any reserves above the limit also. */ | |
645 | for (i = 0; i < memblock.reserved.cnt; i++) { | |
e3239ff9 | 646 | p = &memblock.reserved.regions[i]; |
95f72d1e YL |
647 | |
648 | if (p->base > memory_limit) | |
649 | p->size = 0; | |
650 | else if ((p->base + p->size) > memory_limit) | |
651 | p->size = memory_limit - p->base; | |
652 | ||
653 | if (p->size == 0) { | |
654 | memblock_remove_region(&memblock.reserved, i); | |
655 | i--; | |
656 | } | |
657 | } | |
658 | } | |
659 | ||
cd79481d | 660 | static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr) |
72d4b0b4 BH |
661 | { |
662 | unsigned int left = 0, right = type->cnt; | |
663 | ||
664 | do { | |
665 | unsigned int mid = (right + left) / 2; | |
666 | ||
667 | if (addr < type->regions[mid].base) | |
668 | right = mid; | |
669 | else if (addr >= (type->regions[mid].base + | |
670 | type->regions[mid].size)) | |
671 | left = mid + 1; | |
672 | else | |
673 | return mid; | |
674 | } while (left < right); | |
675 | return -1; | |
676 | } | |
677 | ||
2898cc4c | 678 | int __init memblock_is_reserved(phys_addr_t addr) |
95f72d1e | 679 | { |
72d4b0b4 BH |
680 | return memblock_search(&memblock.reserved, addr) != -1; |
681 | } | |
95f72d1e | 682 | |
3661ca66 | 683 | int __init_memblock memblock_is_memory(phys_addr_t addr) |
72d4b0b4 BH |
684 | { |
685 | return memblock_search(&memblock.memory, addr) != -1; | |
686 | } | |
687 | ||
3661ca66 | 688 | int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size) |
72d4b0b4 | 689 | { |
abb65272 | 690 | int idx = memblock_search(&memblock.memory, base); |
72d4b0b4 BH |
691 | |
692 | if (idx == -1) | |
693 | return 0; | |
abb65272 TV |
694 | return memblock.memory.regions[idx].base <= base && |
695 | (memblock.memory.regions[idx].base + | |
696 | memblock.memory.regions[idx].size) >= (base + size); | |
95f72d1e YL |
697 | } |
698 | ||
10d06439 | 699 | int __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size) |
95f72d1e | 700 | { |
f1c2c19c | 701 | return memblock_overlaps_region(&memblock.reserved, base, size) >= 0; |
95f72d1e YL |
702 | } |
703 | ||
e63075a3 | 704 | |
3661ca66 | 705 | void __init_memblock memblock_set_current_limit(phys_addr_t limit) |
e63075a3 BH |
706 | { |
707 | memblock.current_limit = limit; | |
708 | } | |
709 | ||
10d06439 | 710 | static void __init_memblock memblock_dump(struct memblock_type *region, char *name) |
6ed311b2 BH |
711 | { |
712 | unsigned long long base, size; | |
713 | int i; | |
714 | ||
715 | pr_info(" %s.cnt = 0x%lx\n", name, region->cnt); | |
716 | ||
717 | for (i = 0; i < region->cnt; i++) { | |
718 | base = region->regions[i].base; | |
719 | size = region->regions[i].size; | |
720 | ||
ea9e4376 | 721 | pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes\n", |
6ed311b2 BH |
722 | name, i, base, base + size - 1, size); |
723 | } | |
724 | } | |
725 | ||
10d06439 | 726 | void __init_memblock memblock_dump_all(void) |
6ed311b2 BH |
727 | { |
728 | if (!memblock_debug) | |
729 | return; | |
730 | ||
731 | pr_info("MEMBLOCK configuration:\n"); | |
732 | pr_info(" memory size = 0x%llx\n", (unsigned long long)memblock.memory_size); | |
733 | ||
734 | memblock_dump(&memblock.memory, "memory"); | |
735 | memblock_dump(&memblock.reserved, "reserved"); | |
736 | } | |
737 | ||
738 | void __init memblock_analyze(void) | |
739 | { | |
740 | int i; | |
741 | ||
742 | /* Check marker in the unused last array entry */ | |
743 | WARN_ON(memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS].base | |
744 | != (phys_addr_t)RED_INACTIVE); | |
745 | WARN_ON(memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS].base | |
746 | != (phys_addr_t)RED_INACTIVE); | |
747 | ||
748 | memblock.memory_size = 0; | |
749 | ||
750 | for (i = 0; i < memblock.memory.cnt; i++) | |
751 | memblock.memory_size += memblock.memory.regions[i].size; | |
142b45a7 BH |
752 | |
753 | /* We allow resizing from there */ | |
754 | memblock_can_resize = 1; | |
6ed311b2 BH |
755 | } |
756 | ||
7590abe8 BH |
757 | void __init memblock_init(void) |
758 | { | |
236260b9 JF |
759 | static int init_done __initdata = 0; |
760 | ||
761 | if (init_done) | |
762 | return; | |
763 | init_done = 1; | |
764 | ||
7590abe8 BH |
765 | /* Hookup the initial arrays */ |
766 | memblock.memory.regions = memblock_memory_init_regions; | |
767 | memblock.memory.max = INIT_MEMBLOCK_REGIONS; | |
768 | memblock.reserved.regions = memblock_reserved_init_regions; | |
769 | memblock.reserved.max = INIT_MEMBLOCK_REGIONS; | |
770 | ||
771 | /* Write a marker in the unused last array entry */ | |
772 | memblock.memory.regions[INIT_MEMBLOCK_REGIONS].base = (phys_addr_t)RED_INACTIVE; | |
773 | memblock.reserved.regions[INIT_MEMBLOCK_REGIONS].base = (phys_addr_t)RED_INACTIVE; | |
774 | ||
775 | /* Create a dummy zero size MEMBLOCK which will get coalesced away later. | |
776 | * This simplifies the memblock_add() code below... | |
777 | */ | |
778 | memblock.memory.regions[0].base = 0; | |
779 | memblock.memory.regions[0].size = 0; | |
780 | memblock.memory.cnt = 1; | |
781 | ||
782 | /* Ditto. */ | |
783 | memblock.reserved.regions[0].base = 0; | |
784 | memblock.reserved.regions[0].size = 0; | |
785 | memblock.reserved.cnt = 1; | |
786 | ||
787 | memblock.current_limit = MEMBLOCK_ALLOC_ANYWHERE; | |
788 | } | |
789 | ||
6ed311b2 BH |
790 | static int __init early_memblock(char *p) |
791 | { | |
792 | if (p && strstr(p, "debug")) | |
793 | memblock_debug = 1; | |
794 | return 0; | |
795 | } | |
796 | early_param("memblock", early_memblock); | |
797 | ||
10d06439 | 798 | #if defined(CONFIG_DEBUG_FS) && !defined(ARCH_DISCARD_MEMBLOCK) |
6d03b885 BH |
799 | |
800 | static int memblock_debug_show(struct seq_file *m, void *private) | |
801 | { | |
802 | struct memblock_type *type = m->private; | |
803 | struct memblock_region *reg; | |
804 | int i; | |
805 | ||
806 | for (i = 0; i < type->cnt; i++) { | |
807 | reg = &type->regions[i]; | |
808 | seq_printf(m, "%4d: ", i); | |
809 | if (sizeof(phys_addr_t) == 4) | |
810 | seq_printf(m, "0x%08lx..0x%08lx\n", | |
811 | (unsigned long)reg->base, | |
812 | (unsigned long)(reg->base + reg->size - 1)); | |
813 | else | |
814 | seq_printf(m, "0x%016llx..0x%016llx\n", | |
815 | (unsigned long long)reg->base, | |
816 | (unsigned long long)(reg->base + reg->size - 1)); | |
817 | ||
818 | } | |
819 | return 0; | |
820 | } | |
821 | ||
822 | static int memblock_debug_open(struct inode *inode, struct file *file) | |
823 | { | |
824 | return single_open(file, memblock_debug_show, inode->i_private); | |
825 | } | |
826 | ||
827 | static const struct file_operations memblock_debug_fops = { | |
828 | .open = memblock_debug_open, | |
829 | .read = seq_read, | |
830 | .llseek = seq_lseek, | |
831 | .release = single_release, | |
832 | }; | |
833 | ||
834 | static int __init memblock_init_debugfs(void) | |
835 | { | |
836 | struct dentry *root = debugfs_create_dir("memblock", NULL); | |
837 | if (!root) | |
838 | return -ENXIO; | |
839 | debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops); | |
840 | debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops); | |
841 | ||
842 | return 0; | |
843 | } | |
844 | __initcall(memblock_init_debugfs); | |
845 | ||
846 | #endif /* CONFIG_DEBUG_FS */ |