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 | ||
784656f9 TH |
254 | /** |
255 | * memblock_merge_regions - merge neighboring compatible regions | |
256 | * @type: memblock type to scan | |
257 | * | |
258 | * Scan @type and merge neighboring compatible regions. | |
259 | */ | |
260 | static void __init_memblock memblock_merge_regions(struct memblock_type *type) | |
95f72d1e | 261 | { |
784656f9 | 262 | int i = 0; |
95f72d1e | 263 | |
784656f9 TH |
264 | /* cnt never goes below 1 */ |
265 | while (i < type->cnt - 1) { | |
266 | struct memblock_region *this = &type->regions[i]; | |
267 | struct memblock_region *next = &type->regions[i + 1]; | |
95f72d1e | 268 | |
784656f9 TH |
269 | if (this->base + this->size != next->base) { |
270 | BUG_ON(this->base + this->size > next->base); | |
271 | i++; | |
272 | continue; | |
8f7a6605 BH |
273 | } |
274 | ||
784656f9 TH |
275 | this->size += next->size; |
276 | memmove(next, next + 1, (type->cnt - (i + 1)) * sizeof(*next)); | |
277 | type->cnt--; | |
95f72d1e | 278 | } |
784656f9 | 279 | } |
95f72d1e | 280 | |
784656f9 TH |
281 | /** |
282 | * memblock_insert_region - insert new memblock region | |
283 | * @type: memblock type to insert into | |
284 | * @idx: index for the insertion point | |
285 | * @base: base address of the new region | |
286 | * @size: size of the new region | |
287 | * | |
288 | * Insert new memblock region [@base,@base+@size) into @type at @idx. | |
289 | * @type must already have extra room to accomodate the new region. | |
290 | */ | |
291 | static void __init_memblock memblock_insert_region(struct memblock_type *type, | |
292 | int idx, phys_addr_t base, | |
293 | phys_addr_t size) | |
294 | { | |
295 | struct memblock_region *rgn = &type->regions[idx]; | |
296 | ||
297 | BUG_ON(type->cnt >= type->max); | |
298 | memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn)); | |
299 | rgn->base = base; | |
300 | rgn->size = size; | |
301 | type->cnt++; | |
302 | } | |
303 | ||
304 | /** | |
305 | * memblock_add_region - add new memblock region | |
306 | * @type: memblock type to add new region into | |
307 | * @base: base address of the new region | |
308 | * @size: size of the new region | |
309 | * | |
310 | * Add new memblock region [@base,@base+@size) into @type. The new region | |
311 | * is allowed to overlap with existing ones - overlaps don't affect already | |
312 | * existing regions. @type is guaranteed to be minimal (all neighbouring | |
313 | * compatible regions are merged) after the addition. | |
314 | * | |
315 | * RETURNS: | |
316 | * 0 on success, -errno on failure. | |
317 | */ | |
318 | static long __init_memblock memblock_add_region(struct memblock_type *type, | |
319 | phys_addr_t base, phys_addr_t size) | |
320 | { | |
321 | bool insert = false; | |
322 | phys_addr_t obase = base, end = base + size; | |
323 | int i, nr_new; | |
324 | ||
325 | /* special case for empty array */ | |
326 | if (type->regions[0].size == 0) { | |
327 | WARN_ON(type->cnt != 1); | |
8f7a6605 BH |
328 | type->regions[0].base = base; |
329 | type->regions[0].size = size; | |
330 | return 0; | |
95f72d1e | 331 | } |
784656f9 TH |
332 | repeat: |
333 | /* | |
334 | * The following is executed twice. Once with %false @insert and | |
335 | * then with %true. The first counts the number of regions needed | |
336 | * to accomodate the new area. The second actually inserts them. | |
142b45a7 | 337 | */ |
784656f9 TH |
338 | base = obase; |
339 | nr_new = 0; | |
95f72d1e | 340 | |
784656f9 TH |
341 | for (i = 0; i < type->cnt; i++) { |
342 | struct memblock_region *rgn = &type->regions[i]; | |
343 | phys_addr_t rbase = rgn->base; | |
344 | phys_addr_t rend = rbase + rgn->size; | |
345 | ||
346 | if (rbase >= end) | |
95f72d1e | 347 | break; |
784656f9 TH |
348 | if (rend <= base) |
349 | continue; | |
350 | /* | |
351 | * @rgn overlaps. If it separates the lower part of new | |
352 | * area, insert that portion. | |
353 | */ | |
354 | if (rbase > base) { | |
355 | nr_new++; | |
356 | if (insert) | |
357 | memblock_insert_region(type, i++, base, | |
358 | rbase - base); | |
95f72d1e | 359 | } |
784656f9 TH |
360 | /* area below @rend is dealt with, forget about it */ |
361 | base = min(rend, end); | |
95f72d1e | 362 | } |
784656f9 TH |
363 | |
364 | /* insert the remaining portion */ | |
365 | if (base < end) { | |
366 | nr_new++; | |
367 | if (insert) | |
368 | memblock_insert_region(type, i, base, end - base); | |
95f72d1e | 369 | } |
95f72d1e | 370 | |
784656f9 TH |
371 | /* |
372 | * If this was the first round, resize array and repeat for actual | |
373 | * insertions; otherwise, merge and return. | |
142b45a7 | 374 | */ |
784656f9 TH |
375 | if (!insert) { |
376 | while (type->cnt + nr_new > type->max) | |
377 | if (memblock_double_array(type) < 0) | |
378 | return -ENOMEM; | |
379 | insert = true; | |
380 | goto repeat; | |
381 | } else { | |
382 | memblock_merge_regions(type); | |
383 | return 0; | |
142b45a7 | 384 | } |
95f72d1e YL |
385 | } |
386 | ||
10d06439 | 387 | long __init_memblock memblock_add(phys_addr_t base, phys_addr_t size) |
95f72d1e | 388 | { |
e3239ff9 | 389 | return memblock_add_region(&memblock.memory, base, size); |
95f72d1e YL |
390 | } |
391 | ||
8f7a6605 BH |
392 | static long __init_memblock __memblock_remove(struct memblock_type *type, |
393 | phys_addr_t base, phys_addr_t size) | |
95f72d1e | 394 | { |
2898cc4c | 395 | phys_addr_t end = base + size; |
95f72d1e YL |
396 | int i; |
397 | ||
8f7a6605 BH |
398 | /* Walk through the array for collisions */ |
399 | for (i = 0; i < type->cnt; i++) { | |
400 | struct memblock_region *rgn = &type->regions[i]; | |
401 | phys_addr_t rend = rgn->base + rgn->size; | |
95f72d1e | 402 | |
8f7a6605 BH |
403 | /* Nothing more to do, exit */ |
404 | if (rgn->base > end || rgn->size == 0) | |
95f72d1e | 405 | break; |
95f72d1e | 406 | |
8f7a6605 BH |
407 | /* If we fully enclose the block, drop it */ |
408 | if (base <= rgn->base && end >= rend) { | |
409 | memblock_remove_region(type, i--); | |
410 | continue; | |
411 | } | |
95f72d1e | 412 | |
8f7a6605 BH |
413 | /* If we are fully enclosed within a block |
414 | * then we need to split it and we are done | |
415 | */ | |
416 | if (base > rgn->base && end < rend) { | |
417 | rgn->size = base - rgn->base; | |
418 | if (!memblock_add_region(type, end, rend - end)) | |
419 | return 0; | |
420 | /* Failure to split is bad, we at least | |
421 | * restore the block before erroring | |
422 | */ | |
423 | rgn->size = rend - rgn->base; | |
424 | WARN_ON(1); | |
425 | return -1; | |
426 | } | |
95f72d1e | 427 | |
8f7a6605 BH |
428 | /* Check if we need to trim the bottom of a block */ |
429 | if (rgn->base < end && rend > end) { | |
430 | rgn->size -= end - rgn->base; | |
431 | rgn->base = end; | |
432 | break; | |
433 | } | |
95f72d1e | 434 | |
8f7a6605 BH |
435 | /* And check if we need to trim the top of a block */ |
436 | if (base < rend) | |
437 | rgn->size -= rend - base; | |
95f72d1e | 438 | |
8f7a6605 BH |
439 | } |
440 | return 0; | |
95f72d1e YL |
441 | } |
442 | ||
10d06439 | 443 | long __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size) |
95f72d1e YL |
444 | { |
445 | return __memblock_remove(&memblock.memory, base, size); | |
446 | } | |
447 | ||
3661ca66 | 448 | long __init_memblock memblock_free(phys_addr_t base, phys_addr_t size) |
95f72d1e YL |
449 | { |
450 | return __memblock_remove(&memblock.reserved, base, size); | |
451 | } | |
452 | ||
3661ca66 | 453 | long __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size) |
95f72d1e | 454 | { |
e3239ff9 | 455 | struct memblock_type *_rgn = &memblock.reserved; |
95f72d1e YL |
456 | |
457 | BUG_ON(0 == size); | |
458 | ||
459 | return memblock_add_region(_rgn, base, size); | |
460 | } | |
461 | ||
6ed311b2 | 462 | phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) |
95f72d1e | 463 | { |
6ed311b2 | 464 | phys_addr_t found; |
95f72d1e | 465 | |
6ed311b2 BH |
466 | /* We align the size to limit fragmentation. Without this, a lot of |
467 | * small allocs quickly eat up the whole reserve array on sparc | |
468 | */ | |
348968eb | 469 | size = round_up(size, align); |
95f72d1e | 470 | |
fc769a8e | 471 | found = memblock_find_in_range(0, max_addr, size, align); |
1f5026a7 | 472 | if (found && !memblock_add_region(&memblock.reserved, found, size)) |
6ed311b2 | 473 | return found; |
95f72d1e | 474 | |
6ed311b2 | 475 | return 0; |
95f72d1e YL |
476 | } |
477 | ||
6ed311b2 | 478 | phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) |
95f72d1e | 479 | { |
6ed311b2 BH |
480 | phys_addr_t alloc; |
481 | ||
482 | alloc = __memblock_alloc_base(size, align, max_addr); | |
483 | ||
484 | if (alloc == 0) | |
485 | panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n", | |
486 | (unsigned long long) size, (unsigned long long) max_addr); | |
487 | ||
488 | return alloc; | |
95f72d1e YL |
489 | } |
490 | ||
6ed311b2 | 491 | phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align) |
95f72d1e | 492 | { |
6ed311b2 BH |
493 | return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE); |
494 | } | |
95f72d1e | 495 | |
95f72d1e | 496 | |
6ed311b2 | 497 | /* |
34e18455 | 498 | * Additional node-local top-down allocators. |
c196f76f BH |
499 | * |
500 | * WARNING: Only available after early_node_map[] has been populated, | |
501 | * on some architectures, that is after all the calls to add_active_range() | |
502 | * have been done to populate it. | |
6ed311b2 | 503 | */ |
95f72d1e | 504 | |
34e18455 TH |
505 | static phys_addr_t __init memblock_nid_range_rev(phys_addr_t start, |
506 | phys_addr_t end, int *nid) | |
c3f72b57 | 507 | { |
c196f76f | 508 | #ifdef CONFIG_ARCH_POPULATES_NODE_MAP |
c196f76f BH |
509 | unsigned long start_pfn, end_pfn; |
510 | int i; | |
511 | ||
b2fea988 | 512 | for_each_mem_pfn_range(i, MAX_NUMNODES, &start_pfn, &end_pfn, nid) |
34e18455 TH |
513 | if (end > PFN_PHYS(start_pfn) && end <= PFN_PHYS(end_pfn)) |
514 | return max(start, PFN_PHYS(start_pfn)); | |
c196f76f | 515 | #endif |
c3f72b57 | 516 | *nid = 0; |
34e18455 | 517 | return start; |
c3f72b57 BH |
518 | } |
519 | ||
e6498040 TH |
520 | phys_addr_t __init memblock_find_in_range_node(phys_addr_t start, |
521 | phys_addr_t end, | |
2898cc4c BH |
522 | phys_addr_t size, |
523 | phys_addr_t align, int nid) | |
95f72d1e | 524 | { |
e6498040 TH |
525 | struct memblock_type *mem = &memblock.memory; |
526 | int i; | |
95f72d1e | 527 | |
e6498040 | 528 | BUG_ON(0 == size); |
95f72d1e | 529 | |
e6498040 TH |
530 | /* Pump up max_addr */ |
531 | if (end == MEMBLOCK_ALLOC_ACCESSIBLE) | |
532 | end = memblock.current_limit; | |
95f72d1e | 533 | |
e6498040 TH |
534 | for (i = mem->cnt - 1; i >= 0; i--) { |
535 | struct memblock_region *r = &mem->regions[i]; | |
536 | phys_addr_t base = max(start, r->base); | |
537 | phys_addr_t top = min(end, r->base + r->size); | |
538 | ||
539 | while (base < top) { | |
540 | phys_addr_t tbase, ret; | |
541 | int tnid; | |
542 | ||
543 | tbase = memblock_nid_range_rev(base, top, &tnid); | |
544 | if (nid == MAX_NUMNODES || tnid == nid) { | |
545 | ret = memblock_find_region(tbase, top, size, align); | |
546 | if (ret) | |
547 | return ret; | |
548 | } | |
549 | top = tbase; | |
95f72d1e | 550 | } |
95f72d1e | 551 | } |
e6498040 | 552 | |
1f5026a7 | 553 | return 0; |
95f72d1e YL |
554 | } |
555 | ||
2898cc4c | 556 | phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid) |
95f72d1e | 557 | { |
e6498040 | 558 | phys_addr_t found; |
95f72d1e | 559 | |
e6498040 TH |
560 | /* |
561 | * We align the size to limit fragmentation. Without this, a lot of | |
7f219c73 BH |
562 | * small allocs quickly eat up the whole reserve array on sparc |
563 | */ | |
348968eb | 564 | size = round_up(size, align); |
7f219c73 | 565 | |
e6498040 TH |
566 | found = memblock_find_in_range_node(0, MEMBLOCK_ALLOC_ACCESSIBLE, |
567 | size, align, nid); | |
568 | if (found && !memblock_add_region(&memblock.reserved, found, size)) | |
569 | return found; | |
95f72d1e | 570 | |
9d1e2492 BH |
571 | return 0; |
572 | } | |
573 | ||
574 | phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid) | |
575 | { | |
576 | phys_addr_t res = memblock_alloc_nid(size, align, nid); | |
577 | ||
578 | if (res) | |
579 | return res; | |
15fb0972 | 580 | return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE); |
95f72d1e YL |
581 | } |
582 | ||
9d1e2492 BH |
583 | |
584 | /* | |
585 | * Remaining API functions | |
586 | */ | |
587 | ||
95f72d1e | 588 | /* You must call memblock_analyze() before this. */ |
2898cc4c | 589 | phys_addr_t __init memblock_phys_mem_size(void) |
95f72d1e | 590 | { |
4734b594 | 591 | return memblock.memory_size; |
95f72d1e YL |
592 | } |
593 | ||
10d06439 | 594 | phys_addr_t __init_memblock memblock_end_of_DRAM(void) |
95f72d1e YL |
595 | { |
596 | int idx = memblock.memory.cnt - 1; | |
597 | ||
e3239ff9 | 598 | return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size); |
95f72d1e YL |
599 | } |
600 | ||
601 | /* You must call memblock_analyze() after this. */ | |
2898cc4c | 602 | void __init memblock_enforce_memory_limit(phys_addr_t memory_limit) |
95f72d1e YL |
603 | { |
604 | unsigned long i; | |
2898cc4c | 605 | phys_addr_t limit; |
e3239ff9 | 606 | struct memblock_region *p; |
95f72d1e YL |
607 | |
608 | if (!memory_limit) | |
609 | return; | |
610 | ||
611 | /* Truncate the memblock regions to satisfy the memory limit. */ | |
612 | limit = memory_limit; | |
613 | for (i = 0; i < memblock.memory.cnt; i++) { | |
e3239ff9 BH |
614 | if (limit > memblock.memory.regions[i].size) { |
615 | limit -= memblock.memory.regions[i].size; | |
95f72d1e YL |
616 | continue; |
617 | } | |
618 | ||
e3239ff9 | 619 | memblock.memory.regions[i].size = limit; |
95f72d1e YL |
620 | memblock.memory.cnt = i + 1; |
621 | break; | |
622 | } | |
623 | ||
95f72d1e YL |
624 | memory_limit = memblock_end_of_DRAM(); |
625 | ||
626 | /* And truncate any reserves above the limit also. */ | |
627 | for (i = 0; i < memblock.reserved.cnt; i++) { | |
e3239ff9 | 628 | p = &memblock.reserved.regions[i]; |
95f72d1e YL |
629 | |
630 | if (p->base > memory_limit) | |
631 | p->size = 0; | |
632 | else if ((p->base + p->size) > memory_limit) | |
633 | p->size = memory_limit - p->base; | |
634 | ||
635 | if (p->size == 0) { | |
636 | memblock_remove_region(&memblock.reserved, i); | |
637 | i--; | |
638 | } | |
639 | } | |
640 | } | |
641 | ||
cd79481d | 642 | static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr) |
72d4b0b4 BH |
643 | { |
644 | unsigned int left = 0, right = type->cnt; | |
645 | ||
646 | do { | |
647 | unsigned int mid = (right + left) / 2; | |
648 | ||
649 | if (addr < type->regions[mid].base) | |
650 | right = mid; | |
651 | else if (addr >= (type->regions[mid].base + | |
652 | type->regions[mid].size)) | |
653 | left = mid + 1; | |
654 | else | |
655 | return mid; | |
656 | } while (left < right); | |
657 | return -1; | |
658 | } | |
659 | ||
2898cc4c | 660 | int __init memblock_is_reserved(phys_addr_t addr) |
95f72d1e | 661 | { |
72d4b0b4 BH |
662 | return memblock_search(&memblock.reserved, addr) != -1; |
663 | } | |
95f72d1e | 664 | |
3661ca66 | 665 | int __init_memblock memblock_is_memory(phys_addr_t addr) |
72d4b0b4 BH |
666 | { |
667 | return memblock_search(&memblock.memory, addr) != -1; | |
668 | } | |
669 | ||
3661ca66 | 670 | int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size) |
72d4b0b4 | 671 | { |
abb65272 | 672 | int idx = memblock_search(&memblock.memory, base); |
72d4b0b4 BH |
673 | |
674 | if (idx == -1) | |
675 | return 0; | |
abb65272 TV |
676 | return memblock.memory.regions[idx].base <= base && |
677 | (memblock.memory.regions[idx].base + | |
678 | memblock.memory.regions[idx].size) >= (base + size); | |
95f72d1e YL |
679 | } |
680 | ||
10d06439 | 681 | int __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size) |
95f72d1e | 682 | { |
f1c2c19c | 683 | return memblock_overlaps_region(&memblock.reserved, base, size) >= 0; |
95f72d1e YL |
684 | } |
685 | ||
e63075a3 | 686 | |
3661ca66 | 687 | void __init_memblock memblock_set_current_limit(phys_addr_t limit) |
e63075a3 BH |
688 | { |
689 | memblock.current_limit = limit; | |
690 | } | |
691 | ||
10d06439 | 692 | static void __init_memblock memblock_dump(struct memblock_type *region, char *name) |
6ed311b2 BH |
693 | { |
694 | unsigned long long base, size; | |
695 | int i; | |
696 | ||
697 | pr_info(" %s.cnt = 0x%lx\n", name, region->cnt); | |
698 | ||
699 | for (i = 0; i < region->cnt; i++) { | |
700 | base = region->regions[i].base; | |
701 | size = region->regions[i].size; | |
702 | ||
ea9e4376 | 703 | pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes\n", |
6ed311b2 BH |
704 | name, i, base, base + size - 1, size); |
705 | } | |
706 | } | |
707 | ||
10d06439 | 708 | void __init_memblock memblock_dump_all(void) |
6ed311b2 BH |
709 | { |
710 | if (!memblock_debug) | |
711 | return; | |
712 | ||
713 | pr_info("MEMBLOCK configuration:\n"); | |
714 | pr_info(" memory size = 0x%llx\n", (unsigned long long)memblock.memory_size); | |
715 | ||
716 | memblock_dump(&memblock.memory, "memory"); | |
717 | memblock_dump(&memblock.reserved, "reserved"); | |
718 | } | |
719 | ||
720 | void __init memblock_analyze(void) | |
721 | { | |
722 | int i; | |
723 | ||
724 | /* Check marker in the unused last array entry */ | |
725 | WARN_ON(memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS].base | |
726 | != (phys_addr_t)RED_INACTIVE); | |
727 | WARN_ON(memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS].base | |
728 | != (phys_addr_t)RED_INACTIVE); | |
729 | ||
730 | memblock.memory_size = 0; | |
731 | ||
732 | for (i = 0; i < memblock.memory.cnt; i++) | |
733 | memblock.memory_size += memblock.memory.regions[i].size; | |
142b45a7 BH |
734 | |
735 | /* We allow resizing from there */ | |
736 | memblock_can_resize = 1; | |
6ed311b2 BH |
737 | } |
738 | ||
7590abe8 BH |
739 | void __init memblock_init(void) |
740 | { | |
236260b9 JF |
741 | static int init_done __initdata = 0; |
742 | ||
743 | if (init_done) | |
744 | return; | |
745 | init_done = 1; | |
746 | ||
7590abe8 BH |
747 | /* Hookup the initial arrays */ |
748 | memblock.memory.regions = memblock_memory_init_regions; | |
749 | memblock.memory.max = INIT_MEMBLOCK_REGIONS; | |
750 | memblock.reserved.regions = memblock_reserved_init_regions; | |
751 | memblock.reserved.max = INIT_MEMBLOCK_REGIONS; | |
752 | ||
753 | /* Write a marker in the unused last array entry */ | |
754 | memblock.memory.regions[INIT_MEMBLOCK_REGIONS].base = (phys_addr_t)RED_INACTIVE; | |
755 | memblock.reserved.regions[INIT_MEMBLOCK_REGIONS].base = (phys_addr_t)RED_INACTIVE; | |
756 | ||
757 | /* Create a dummy zero size MEMBLOCK which will get coalesced away later. | |
758 | * This simplifies the memblock_add() code below... | |
759 | */ | |
760 | memblock.memory.regions[0].base = 0; | |
761 | memblock.memory.regions[0].size = 0; | |
762 | memblock.memory.cnt = 1; | |
763 | ||
764 | /* Ditto. */ | |
765 | memblock.reserved.regions[0].base = 0; | |
766 | memblock.reserved.regions[0].size = 0; | |
767 | memblock.reserved.cnt = 1; | |
768 | ||
769 | memblock.current_limit = MEMBLOCK_ALLOC_ANYWHERE; | |
770 | } | |
771 | ||
6ed311b2 BH |
772 | static int __init early_memblock(char *p) |
773 | { | |
774 | if (p && strstr(p, "debug")) | |
775 | memblock_debug = 1; | |
776 | return 0; | |
777 | } | |
778 | early_param("memblock", early_memblock); | |
779 | ||
10d06439 | 780 | #if defined(CONFIG_DEBUG_FS) && !defined(ARCH_DISCARD_MEMBLOCK) |
6d03b885 BH |
781 | |
782 | static int memblock_debug_show(struct seq_file *m, void *private) | |
783 | { | |
784 | struct memblock_type *type = m->private; | |
785 | struct memblock_region *reg; | |
786 | int i; | |
787 | ||
788 | for (i = 0; i < type->cnt; i++) { | |
789 | reg = &type->regions[i]; | |
790 | seq_printf(m, "%4d: ", i); | |
791 | if (sizeof(phys_addr_t) == 4) | |
792 | seq_printf(m, "0x%08lx..0x%08lx\n", | |
793 | (unsigned long)reg->base, | |
794 | (unsigned long)(reg->base + reg->size - 1)); | |
795 | else | |
796 | seq_printf(m, "0x%016llx..0x%016llx\n", | |
797 | (unsigned long long)reg->base, | |
798 | (unsigned long long)(reg->base + reg->size - 1)); | |
799 | ||
800 | } | |
801 | return 0; | |
802 | } | |
803 | ||
804 | static int memblock_debug_open(struct inode *inode, struct file *file) | |
805 | { | |
806 | return single_open(file, memblock_debug_show, inode->i_private); | |
807 | } | |
808 | ||
809 | static const struct file_operations memblock_debug_fops = { | |
810 | .open = memblock_debug_open, | |
811 | .read = seq_read, | |
812 | .llseek = seq_lseek, | |
813 | .release = single_release, | |
814 | }; | |
815 | ||
816 | static int __init memblock_init_debugfs(void) | |
817 | { | |
818 | struct dentry *root = debugfs_create_dir("memblock", NULL); | |
819 | if (!root) | |
820 | return -ENXIO; | |
821 | debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops); | |
822 | debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops); | |
823 | ||
824 | return 0; | |
825 | } | |
826 | __initcall(memblock_init_debugfs); | |
827 | ||
828 | #endif /* CONFIG_DEBUG_FS */ |