]>
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> |
95f72d1e YL |
19 | #include <linux/memblock.h> |
20 | ||
95f72d1e YL |
21 | struct memblock memblock; |
22 | ||
142b45a7 | 23 | static int memblock_debug, memblock_can_resize; |
bf23c51f BH |
24 | static struct memblock_region memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS + 1]; |
25 | static struct memblock_region memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS + 1]; | |
95f72d1e | 26 | |
4d629f9a BH |
27 | #define MEMBLOCK_ERROR (~(phys_addr_t)0) |
28 | ||
142b45a7 BH |
29 | /* inline so we don't get a warning when pr_debug is compiled out */ |
30 | static inline const char *memblock_type_name(struct memblock_type *type) | |
31 | { | |
32 | if (type == &memblock.memory) | |
33 | return "memory"; | |
34 | else if (type == &memblock.reserved) | |
35 | return "reserved"; | |
36 | else | |
37 | return "unknown"; | |
38 | } | |
39 | ||
6ed311b2 BH |
40 | /* |
41 | * Address comparison utilities | |
42 | */ | |
95f72d1e | 43 | |
6ed311b2 | 44 | static phys_addr_t memblock_align_down(phys_addr_t addr, phys_addr_t size) |
95f72d1e | 45 | { |
6ed311b2 | 46 | return addr & ~(size - 1); |
95f72d1e YL |
47 | } |
48 | ||
6ed311b2 | 49 | static phys_addr_t memblock_align_up(phys_addr_t addr, phys_addr_t size) |
95f72d1e | 50 | { |
6ed311b2 | 51 | return (addr + (size - 1)) & ~(size - 1); |
95f72d1e YL |
52 | } |
53 | ||
2898cc4c BH |
54 | static unsigned long memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1, |
55 | phys_addr_t base2, phys_addr_t size2) | |
95f72d1e YL |
56 | { |
57 | return ((base1 < (base2 + size2)) && (base2 < (base1 + size1))); | |
58 | } | |
59 | ||
2898cc4c BH |
60 | static long memblock_addrs_adjacent(phys_addr_t base1, phys_addr_t size1, |
61 | phys_addr_t base2, phys_addr_t size2) | |
95f72d1e YL |
62 | { |
63 | if (base2 == base1 + size1) | |
64 | return 1; | |
65 | else if (base1 == base2 + size2) | |
66 | return -1; | |
67 | ||
68 | return 0; | |
69 | } | |
70 | ||
e3239ff9 | 71 | static long memblock_regions_adjacent(struct memblock_type *type, |
2898cc4c | 72 | unsigned long r1, unsigned long r2) |
95f72d1e | 73 | { |
2898cc4c BH |
74 | phys_addr_t base1 = type->regions[r1].base; |
75 | phys_addr_t size1 = type->regions[r1].size; | |
76 | phys_addr_t base2 = type->regions[r2].base; | |
77 | phys_addr_t size2 = type->regions[r2].size; | |
95f72d1e YL |
78 | |
79 | return memblock_addrs_adjacent(base1, size1, base2, size2); | |
80 | } | |
81 | ||
6ed311b2 BH |
82 | long memblock_overlaps_region(struct memblock_type *type, phys_addr_t base, phys_addr_t size) |
83 | { | |
84 | unsigned long i; | |
85 | ||
86 | for (i = 0; i < type->cnt; i++) { | |
87 | phys_addr_t rgnbase = type->regions[i].base; | |
88 | phys_addr_t rgnsize = type->regions[i].size; | |
89 | if (memblock_addrs_overlap(base, size, rgnbase, rgnsize)) | |
90 | break; | |
91 | } | |
92 | ||
93 | return (i < type->cnt) ? i : -1; | |
94 | } | |
95 | ||
96 | /* | |
97 | * Find, allocate, deallocate or reserve unreserved regions. All allocations | |
98 | * are top-down. | |
99 | */ | |
100 | ||
101 | static phys_addr_t __init memblock_find_region(phys_addr_t start, phys_addr_t end, | |
102 | phys_addr_t size, phys_addr_t align) | |
103 | { | |
104 | phys_addr_t base, res_base; | |
105 | long j; | |
106 | ||
107 | base = memblock_align_down((end - size), align); | |
108 | while (start <= base) { | |
109 | j = memblock_overlaps_region(&memblock.reserved, base, size); | |
110 | if (j < 0) | |
111 | return base; | |
112 | res_base = memblock.reserved.regions[j].base; | |
113 | if (res_base < size) | |
114 | break; | |
115 | base = memblock_align_down(res_base - size, align); | |
116 | } | |
117 | ||
118 | return MEMBLOCK_ERROR; | |
119 | } | |
120 | ||
fef501d4 BH |
121 | static phys_addr_t __init memblock_find_base(phys_addr_t size, phys_addr_t align, |
122 | phys_addr_t start, phys_addr_t end) | |
6ed311b2 BH |
123 | { |
124 | long i; | |
6ed311b2 BH |
125 | |
126 | BUG_ON(0 == size); | |
127 | ||
128 | size = memblock_align_up(size, align); | |
129 | ||
130 | /* Pump up max_addr */ | |
fef501d4 BH |
131 | if (end == MEMBLOCK_ALLOC_ACCESSIBLE) |
132 | end = memblock.current_limit; | |
6ed311b2 BH |
133 | |
134 | /* We do a top-down search, this tends to limit memory | |
135 | * fragmentation by keeping early boot allocs near the | |
136 | * top of memory | |
137 | */ | |
138 | for (i = memblock.memory.cnt - 1; i >= 0; i--) { | |
139 | phys_addr_t memblockbase = memblock.memory.regions[i].base; | |
140 | phys_addr_t memblocksize = memblock.memory.regions[i].size; | |
fef501d4 | 141 | phys_addr_t bottom, top, found; |
6ed311b2 BH |
142 | |
143 | if (memblocksize < size) | |
144 | continue; | |
fef501d4 BH |
145 | if ((memblockbase + memblocksize) <= start) |
146 | break; | |
147 | bottom = max(memblockbase, start); | |
148 | top = min(memblockbase + memblocksize, end); | |
149 | if (bottom >= top) | |
150 | continue; | |
151 | found = memblock_find_region(bottom, top, size, align); | |
152 | if (found != MEMBLOCK_ERROR) | |
153 | return found; | |
6ed311b2 BH |
154 | } |
155 | return MEMBLOCK_ERROR; | |
156 | } | |
157 | ||
e3239ff9 | 158 | static void memblock_remove_region(struct memblock_type *type, unsigned long r) |
95f72d1e YL |
159 | { |
160 | unsigned long i; | |
161 | ||
e3239ff9 BH |
162 | for (i = r; i < type->cnt - 1; i++) { |
163 | type->regions[i].base = type->regions[i + 1].base; | |
164 | type->regions[i].size = type->regions[i + 1].size; | |
95f72d1e | 165 | } |
e3239ff9 | 166 | type->cnt--; |
95f72d1e YL |
167 | } |
168 | ||
169 | /* Assumption: base addr of region 1 < base addr of region 2 */ | |
e3239ff9 | 170 | static void memblock_coalesce_regions(struct memblock_type *type, |
95f72d1e YL |
171 | unsigned long r1, unsigned long r2) |
172 | { | |
e3239ff9 BH |
173 | type->regions[r1].size += type->regions[r2].size; |
174 | memblock_remove_region(type, r2); | |
95f72d1e YL |
175 | } |
176 | ||
142b45a7 BH |
177 | /* Defined below but needed now */ |
178 | static long memblock_add_region(struct memblock_type *type, phys_addr_t base, phys_addr_t size); | |
179 | ||
180 | static int memblock_double_array(struct memblock_type *type) | |
181 | { | |
182 | struct memblock_region *new_array, *old_array; | |
183 | phys_addr_t old_size, new_size, addr; | |
184 | int use_slab = slab_is_available(); | |
185 | ||
186 | /* We don't allow resizing until we know about the reserved regions | |
187 | * of memory that aren't suitable for allocation | |
188 | */ | |
189 | if (!memblock_can_resize) | |
190 | return -1; | |
191 | ||
192 | pr_debug("memblock: %s array full, doubling...", memblock_type_name(type)); | |
193 | ||
194 | /* Calculate new doubled size */ | |
195 | old_size = type->max * sizeof(struct memblock_region); | |
196 | new_size = old_size << 1; | |
197 | ||
198 | /* Try to find some space for it. | |
199 | * | |
200 | * WARNING: We assume that either slab_is_available() and we use it or | |
201 | * we use MEMBLOCK for allocations. That means that this is unsafe to use | |
202 | * when bootmem is currently active (unless bootmem itself is implemented | |
203 | * on top of MEMBLOCK which isn't the case yet) | |
204 | * | |
205 | * This should however not be an issue for now, as we currently only | |
206 | * call into MEMBLOCK while it's still active, or much later when slab is | |
207 | * active for memory hotplug operations | |
208 | */ | |
209 | if (use_slab) { | |
210 | new_array = kmalloc(new_size, GFP_KERNEL); | |
211 | addr = new_array == NULL ? MEMBLOCK_ERROR : __pa(new_array); | |
212 | } else | |
fef501d4 | 213 | addr = memblock_find_base(new_size, sizeof(phys_addr_t), 0, MEMBLOCK_ALLOC_ACCESSIBLE); |
142b45a7 BH |
214 | if (addr == MEMBLOCK_ERROR) { |
215 | pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n", | |
216 | memblock_type_name(type), type->max, type->max * 2); | |
217 | return -1; | |
218 | } | |
219 | new_array = __va(addr); | |
220 | ||
221 | /* Found space, we now need to move the array over before | |
222 | * we add the reserved region since it may be our reserved | |
223 | * array itself that is full. | |
224 | */ | |
225 | memcpy(new_array, type->regions, old_size); | |
226 | memset(new_array + type->max, 0, old_size); | |
227 | old_array = type->regions; | |
228 | type->regions = new_array; | |
229 | type->max <<= 1; | |
230 | ||
231 | /* If we use SLAB that's it, we are done */ | |
232 | if (use_slab) | |
233 | return 0; | |
234 | ||
235 | /* Add the new reserved region now. Should not fail ! */ | |
236 | BUG_ON(memblock_add_region(&memblock.reserved, addr, new_size) < 0); | |
237 | ||
238 | /* If the array wasn't our static init one, then free it. We only do | |
239 | * that before SLAB is available as later on, we don't know whether | |
240 | * to use kfree or free_bootmem_pages(). Shouldn't be a big deal | |
241 | * anyways | |
242 | */ | |
243 | if (old_array != memblock_memory_init_regions && | |
244 | old_array != memblock_reserved_init_regions) | |
245 | memblock_free(__pa(old_array), old_size); | |
246 | ||
247 | return 0; | |
248 | } | |
249 | ||
d2cd563b BH |
250 | extern int __weak memblock_memory_can_coalesce(phys_addr_t addr1, phys_addr_t size1, |
251 | phys_addr_t addr2, phys_addr_t size2) | |
252 | { | |
253 | return 1; | |
254 | } | |
255 | ||
2898cc4c | 256 | static long memblock_add_region(struct memblock_type *type, phys_addr_t base, phys_addr_t size) |
95f72d1e YL |
257 | { |
258 | unsigned long coalesced = 0; | |
259 | long adjacent, i; | |
260 | ||
e3239ff9 BH |
261 | if ((type->cnt == 1) && (type->regions[0].size == 0)) { |
262 | type->regions[0].base = base; | |
263 | type->regions[0].size = size; | |
95f72d1e YL |
264 | return 0; |
265 | } | |
266 | ||
267 | /* First try and coalesce this MEMBLOCK with another. */ | |
e3239ff9 | 268 | for (i = 0; i < type->cnt; i++) { |
2898cc4c BH |
269 | phys_addr_t rgnbase = type->regions[i].base; |
270 | phys_addr_t rgnsize = type->regions[i].size; | |
95f72d1e YL |
271 | |
272 | if ((rgnbase == base) && (rgnsize == size)) | |
273 | /* Already have this region, so we're done */ | |
274 | return 0; | |
275 | ||
276 | adjacent = memblock_addrs_adjacent(base, size, rgnbase, rgnsize); | |
d2cd563b BH |
277 | /* Check if arch allows coalescing */ |
278 | if (adjacent != 0 && type == &memblock.memory && | |
279 | !memblock_memory_can_coalesce(base, size, rgnbase, rgnsize)) | |
280 | break; | |
95f72d1e | 281 | if (adjacent > 0) { |
e3239ff9 BH |
282 | type->regions[i].base -= size; |
283 | type->regions[i].size += size; | |
95f72d1e YL |
284 | coalesced++; |
285 | break; | |
286 | } else if (adjacent < 0) { | |
e3239ff9 | 287 | type->regions[i].size += size; |
95f72d1e YL |
288 | coalesced++; |
289 | break; | |
290 | } | |
291 | } | |
292 | ||
d2cd563b BH |
293 | /* If we plugged a hole, we may want to also coalesce with the |
294 | * next region | |
295 | */ | |
296 | if ((i < type->cnt - 1) && memblock_regions_adjacent(type, i, i+1) && | |
297 | ((type != &memblock.memory || memblock_memory_can_coalesce(type->regions[i].base, | |
298 | type->regions[i].size, | |
299 | type->regions[i+1].base, | |
300 | type->regions[i+1].size)))) { | |
e3239ff9 | 301 | memblock_coalesce_regions(type, i, i+1); |
95f72d1e YL |
302 | coalesced++; |
303 | } | |
304 | ||
305 | if (coalesced) | |
306 | return coalesced; | |
142b45a7 BH |
307 | |
308 | /* If we are out of space, we fail. It's too late to resize the array | |
309 | * but then this shouldn't have happened in the first place. | |
310 | */ | |
311 | if (WARN_ON(type->cnt >= type->max)) | |
95f72d1e YL |
312 | return -1; |
313 | ||
314 | /* Couldn't coalesce the MEMBLOCK, so add it to the sorted table. */ | |
e3239ff9 BH |
315 | for (i = type->cnt - 1; i >= 0; i--) { |
316 | if (base < type->regions[i].base) { | |
317 | type->regions[i+1].base = type->regions[i].base; | |
318 | type->regions[i+1].size = type->regions[i].size; | |
95f72d1e | 319 | } else { |
e3239ff9 BH |
320 | type->regions[i+1].base = base; |
321 | type->regions[i+1].size = size; | |
95f72d1e YL |
322 | break; |
323 | } | |
324 | } | |
325 | ||
e3239ff9 BH |
326 | if (base < type->regions[0].base) { |
327 | type->regions[0].base = base; | |
328 | type->regions[0].size = size; | |
95f72d1e | 329 | } |
e3239ff9 | 330 | type->cnt++; |
95f72d1e | 331 | |
142b45a7 BH |
332 | /* The array is full ? Try to resize it. If that fails, we undo |
333 | * our allocation and return an error | |
334 | */ | |
335 | if (type->cnt == type->max && memblock_double_array(type)) { | |
336 | type->cnt--; | |
337 | return -1; | |
338 | } | |
339 | ||
95f72d1e YL |
340 | return 0; |
341 | } | |
342 | ||
2898cc4c | 343 | long memblock_add(phys_addr_t base, phys_addr_t size) |
95f72d1e | 344 | { |
e3239ff9 | 345 | return memblock_add_region(&memblock.memory, base, size); |
95f72d1e YL |
346 | |
347 | } | |
348 | ||
2898cc4c | 349 | static long __memblock_remove(struct memblock_type *type, phys_addr_t base, phys_addr_t size) |
95f72d1e | 350 | { |
2898cc4c BH |
351 | phys_addr_t rgnbegin, rgnend; |
352 | phys_addr_t end = base + size; | |
95f72d1e YL |
353 | int i; |
354 | ||
355 | rgnbegin = rgnend = 0; /* supress gcc warnings */ | |
356 | ||
357 | /* Find the region where (base, size) belongs to */ | |
e3239ff9 BH |
358 | for (i=0; i < type->cnt; i++) { |
359 | rgnbegin = type->regions[i].base; | |
360 | rgnend = rgnbegin + type->regions[i].size; | |
95f72d1e YL |
361 | |
362 | if ((rgnbegin <= base) && (end <= rgnend)) | |
363 | break; | |
364 | } | |
365 | ||
366 | /* Didn't find the region */ | |
e3239ff9 | 367 | if (i == type->cnt) |
95f72d1e YL |
368 | return -1; |
369 | ||
370 | /* Check to see if we are removing entire region */ | |
371 | if ((rgnbegin == base) && (rgnend == end)) { | |
e3239ff9 | 372 | memblock_remove_region(type, i); |
95f72d1e YL |
373 | return 0; |
374 | } | |
375 | ||
376 | /* Check to see if region is matching at the front */ | |
377 | if (rgnbegin == base) { | |
e3239ff9 BH |
378 | type->regions[i].base = end; |
379 | type->regions[i].size -= size; | |
95f72d1e YL |
380 | return 0; |
381 | } | |
382 | ||
383 | /* Check to see if the region is matching at the end */ | |
384 | if (rgnend == end) { | |
e3239ff9 | 385 | type->regions[i].size -= size; |
95f72d1e YL |
386 | return 0; |
387 | } | |
388 | ||
389 | /* | |
390 | * We need to split the entry - adjust the current one to the | |
391 | * beginging of the hole and add the region after hole. | |
392 | */ | |
e3239ff9 BH |
393 | type->regions[i].size = base - type->regions[i].base; |
394 | return memblock_add_region(type, end, rgnend - end); | |
95f72d1e YL |
395 | } |
396 | ||
2898cc4c | 397 | long memblock_remove(phys_addr_t base, phys_addr_t size) |
95f72d1e YL |
398 | { |
399 | return __memblock_remove(&memblock.memory, base, size); | |
400 | } | |
401 | ||
2898cc4c | 402 | long __init memblock_free(phys_addr_t base, phys_addr_t size) |
95f72d1e YL |
403 | { |
404 | return __memblock_remove(&memblock.reserved, base, size); | |
405 | } | |
406 | ||
2898cc4c | 407 | long __init memblock_reserve(phys_addr_t base, phys_addr_t size) |
95f72d1e | 408 | { |
e3239ff9 | 409 | struct memblock_type *_rgn = &memblock.reserved; |
95f72d1e YL |
410 | |
411 | BUG_ON(0 == size); | |
412 | ||
413 | return memblock_add_region(_rgn, base, size); | |
414 | } | |
415 | ||
6ed311b2 | 416 | phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) |
95f72d1e | 417 | { |
6ed311b2 | 418 | phys_addr_t found; |
95f72d1e | 419 | |
6ed311b2 BH |
420 | /* We align the size to limit fragmentation. Without this, a lot of |
421 | * small allocs quickly eat up the whole reserve array on sparc | |
422 | */ | |
423 | size = memblock_align_up(size, align); | |
95f72d1e | 424 | |
fef501d4 | 425 | found = memblock_find_base(size, align, 0, max_addr); |
6ed311b2 BH |
426 | if (found != MEMBLOCK_ERROR && |
427 | memblock_add_region(&memblock.reserved, found, size) >= 0) | |
428 | return found; | |
95f72d1e | 429 | |
6ed311b2 | 430 | return 0; |
95f72d1e YL |
431 | } |
432 | ||
6ed311b2 | 433 | phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) |
95f72d1e | 434 | { |
6ed311b2 BH |
435 | phys_addr_t alloc; |
436 | ||
437 | alloc = __memblock_alloc_base(size, align, max_addr); | |
438 | ||
439 | if (alloc == 0) | |
440 | panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n", | |
441 | (unsigned long long) size, (unsigned long long) max_addr); | |
442 | ||
443 | return alloc; | |
95f72d1e YL |
444 | } |
445 | ||
6ed311b2 | 446 | phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align) |
95f72d1e | 447 | { |
6ed311b2 BH |
448 | return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE); |
449 | } | |
95f72d1e | 450 | |
95f72d1e | 451 | |
6ed311b2 BH |
452 | /* |
453 | * Additional node-local allocators. Search for node memory is bottom up | |
454 | * and walks memblock regions within that node bottom-up as well, but allocation | |
c196f76f BH |
455 | * within an memblock region is top-down. XXX I plan to fix that at some stage |
456 | * | |
457 | * WARNING: Only available after early_node_map[] has been populated, | |
458 | * on some architectures, that is after all the calls to add_active_range() | |
459 | * have been done to populate it. | |
6ed311b2 | 460 | */ |
95f72d1e | 461 | |
2898cc4c | 462 | phys_addr_t __weak __init memblock_nid_range(phys_addr_t start, phys_addr_t end, int *nid) |
c3f72b57 | 463 | { |
c196f76f BH |
464 | #ifdef CONFIG_ARCH_POPULATES_NODE_MAP |
465 | /* | |
466 | * This code originates from sparc which really wants use to walk by addresses | |
467 | * and returns the nid. This is not very convenient for early_pfn_map[] users | |
468 | * as the map isn't sorted yet, and it really wants to be walked by nid. | |
469 | * | |
470 | * For now, I implement the inefficient method below which walks the early | |
471 | * map multiple times. Eventually we may want to use an ARCH config option | |
472 | * to implement a completely different method for both case. | |
473 | */ | |
474 | unsigned long start_pfn, end_pfn; | |
475 | int i; | |
476 | ||
477 | for (i = 0; i < MAX_NUMNODES; i++) { | |
478 | get_pfn_range_for_nid(i, &start_pfn, &end_pfn); | |
479 | if (start < PFN_PHYS(start_pfn) || start >= PFN_PHYS(end_pfn)) | |
480 | continue; | |
481 | *nid = i; | |
482 | return min(end, PFN_PHYS(end_pfn)); | |
483 | } | |
484 | #endif | |
c3f72b57 BH |
485 | *nid = 0; |
486 | ||
487 | return end; | |
488 | } | |
489 | ||
2898cc4c BH |
490 | static phys_addr_t __init memblock_alloc_nid_region(struct memblock_region *mp, |
491 | phys_addr_t size, | |
492 | phys_addr_t align, int nid) | |
95f72d1e | 493 | { |
2898cc4c | 494 | phys_addr_t start, end; |
95f72d1e YL |
495 | |
496 | start = mp->base; | |
497 | end = start + mp->size; | |
498 | ||
499 | start = memblock_align_up(start, align); | |
500 | while (start < end) { | |
2898cc4c | 501 | phys_addr_t this_end; |
95f72d1e YL |
502 | int this_nid; |
503 | ||
35a1f0bd | 504 | this_end = memblock_nid_range(start, end, &this_nid); |
95f72d1e | 505 | if (this_nid == nid) { |
3a9c2c81 | 506 | phys_addr_t ret = memblock_find_region(start, this_end, size, align); |
4d629f9a | 507 | if (ret != MEMBLOCK_ERROR && |
3a9c2c81 | 508 | memblock_add_region(&memblock.reserved, ret, size) >= 0) |
95f72d1e YL |
509 | return ret; |
510 | } | |
511 | start = this_end; | |
512 | } | |
513 | ||
4d629f9a | 514 | return MEMBLOCK_ERROR; |
95f72d1e YL |
515 | } |
516 | ||
2898cc4c | 517 | phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid) |
95f72d1e | 518 | { |
e3239ff9 | 519 | struct memblock_type *mem = &memblock.memory; |
95f72d1e YL |
520 | int i; |
521 | ||
522 | BUG_ON(0 == size); | |
523 | ||
7f219c73 BH |
524 | /* We align the size to limit fragmentation. Without this, a lot of |
525 | * small allocs quickly eat up the whole reserve array on sparc | |
526 | */ | |
527 | size = memblock_align_up(size, align); | |
528 | ||
c3f72b57 BH |
529 | /* We do a bottom-up search for a region with the right |
530 | * nid since that's easier considering how memblock_nid_range() | |
531 | * works | |
532 | */ | |
95f72d1e | 533 | for (i = 0; i < mem->cnt; i++) { |
2898cc4c | 534 | phys_addr_t ret = memblock_alloc_nid_region(&mem->regions[i], |
95f72d1e | 535 | size, align, nid); |
4d629f9a | 536 | if (ret != MEMBLOCK_ERROR) |
95f72d1e YL |
537 | return ret; |
538 | } | |
539 | ||
9d1e2492 BH |
540 | return 0; |
541 | } | |
542 | ||
543 | phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid) | |
544 | { | |
545 | phys_addr_t res = memblock_alloc_nid(size, align, nid); | |
546 | ||
547 | if (res) | |
548 | return res; | |
95f72d1e YL |
549 | return memblock_alloc(size, align); |
550 | } | |
551 | ||
9d1e2492 BH |
552 | |
553 | /* | |
554 | * Remaining API functions | |
555 | */ | |
556 | ||
95f72d1e | 557 | /* You must call memblock_analyze() before this. */ |
2898cc4c | 558 | phys_addr_t __init memblock_phys_mem_size(void) |
95f72d1e | 559 | { |
4734b594 | 560 | return memblock.memory_size; |
95f72d1e YL |
561 | } |
562 | ||
2898cc4c | 563 | phys_addr_t memblock_end_of_DRAM(void) |
95f72d1e YL |
564 | { |
565 | int idx = memblock.memory.cnt - 1; | |
566 | ||
e3239ff9 | 567 | return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size); |
95f72d1e YL |
568 | } |
569 | ||
570 | /* You must call memblock_analyze() after this. */ | |
2898cc4c | 571 | void __init memblock_enforce_memory_limit(phys_addr_t memory_limit) |
95f72d1e YL |
572 | { |
573 | unsigned long i; | |
2898cc4c | 574 | phys_addr_t limit; |
e3239ff9 | 575 | struct memblock_region *p; |
95f72d1e YL |
576 | |
577 | if (!memory_limit) | |
578 | return; | |
579 | ||
580 | /* Truncate the memblock regions to satisfy the memory limit. */ | |
581 | limit = memory_limit; | |
582 | for (i = 0; i < memblock.memory.cnt; i++) { | |
e3239ff9 BH |
583 | if (limit > memblock.memory.regions[i].size) { |
584 | limit -= memblock.memory.regions[i].size; | |
95f72d1e YL |
585 | continue; |
586 | } | |
587 | ||
e3239ff9 | 588 | memblock.memory.regions[i].size = limit; |
95f72d1e YL |
589 | memblock.memory.cnt = i + 1; |
590 | break; | |
591 | } | |
592 | ||
95f72d1e YL |
593 | memory_limit = memblock_end_of_DRAM(); |
594 | ||
595 | /* And truncate any reserves above the limit also. */ | |
596 | for (i = 0; i < memblock.reserved.cnt; i++) { | |
e3239ff9 | 597 | p = &memblock.reserved.regions[i]; |
95f72d1e YL |
598 | |
599 | if (p->base > memory_limit) | |
600 | p->size = 0; | |
601 | else if ((p->base + p->size) > memory_limit) | |
602 | p->size = memory_limit - p->base; | |
603 | ||
604 | if (p->size == 0) { | |
605 | memblock_remove_region(&memblock.reserved, i); | |
606 | i--; | |
607 | } | |
608 | } | |
609 | } | |
610 | ||
2898cc4c | 611 | static int memblock_search(struct memblock_type *type, phys_addr_t addr) |
72d4b0b4 BH |
612 | { |
613 | unsigned int left = 0, right = type->cnt; | |
614 | ||
615 | do { | |
616 | unsigned int mid = (right + left) / 2; | |
617 | ||
618 | if (addr < type->regions[mid].base) | |
619 | right = mid; | |
620 | else if (addr >= (type->regions[mid].base + | |
621 | type->regions[mid].size)) | |
622 | left = mid + 1; | |
623 | else | |
624 | return mid; | |
625 | } while (left < right); | |
626 | return -1; | |
627 | } | |
628 | ||
2898cc4c | 629 | int __init memblock_is_reserved(phys_addr_t addr) |
95f72d1e | 630 | { |
72d4b0b4 BH |
631 | return memblock_search(&memblock.reserved, addr) != -1; |
632 | } | |
95f72d1e | 633 | |
2898cc4c | 634 | int memblock_is_memory(phys_addr_t addr) |
72d4b0b4 BH |
635 | { |
636 | return memblock_search(&memblock.memory, addr) != -1; | |
637 | } | |
638 | ||
2898cc4c | 639 | int memblock_is_region_memory(phys_addr_t base, phys_addr_t size) |
72d4b0b4 BH |
640 | { |
641 | int idx = memblock_search(&memblock.reserved, base); | |
642 | ||
643 | if (idx == -1) | |
644 | return 0; | |
645 | return memblock.reserved.regions[idx].base <= base && | |
646 | (memblock.reserved.regions[idx].base + | |
647 | memblock.reserved.regions[idx].size) >= (base + size); | |
95f72d1e YL |
648 | } |
649 | ||
2898cc4c | 650 | int memblock_is_region_reserved(phys_addr_t base, phys_addr_t size) |
95f72d1e | 651 | { |
f1c2c19c | 652 | return memblock_overlaps_region(&memblock.reserved, base, size) >= 0; |
95f72d1e YL |
653 | } |
654 | ||
e63075a3 | 655 | |
2898cc4c | 656 | void __init memblock_set_current_limit(phys_addr_t limit) |
e63075a3 BH |
657 | { |
658 | memblock.current_limit = limit; | |
659 | } | |
660 | ||
6ed311b2 BH |
661 | static void memblock_dump(struct memblock_type *region, char *name) |
662 | { | |
663 | unsigned long long base, size; | |
664 | int i; | |
665 | ||
666 | pr_info(" %s.cnt = 0x%lx\n", name, region->cnt); | |
667 | ||
668 | for (i = 0; i < region->cnt; i++) { | |
669 | base = region->regions[i].base; | |
670 | size = region->regions[i].size; | |
671 | ||
672 | pr_info(" %s[0x%x]\t0x%016llx - 0x%016llx, 0x%llx bytes\n", | |
673 | name, i, base, base + size - 1, size); | |
674 | } | |
675 | } | |
676 | ||
677 | void memblock_dump_all(void) | |
678 | { | |
679 | if (!memblock_debug) | |
680 | return; | |
681 | ||
682 | pr_info("MEMBLOCK configuration:\n"); | |
683 | pr_info(" memory size = 0x%llx\n", (unsigned long long)memblock.memory_size); | |
684 | ||
685 | memblock_dump(&memblock.memory, "memory"); | |
686 | memblock_dump(&memblock.reserved, "reserved"); | |
687 | } | |
688 | ||
689 | void __init memblock_analyze(void) | |
690 | { | |
691 | int i; | |
692 | ||
693 | /* Check marker in the unused last array entry */ | |
694 | WARN_ON(memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS].base | |
695 | != (phys_addr_t)RED_INACTIVE); | |
696 | WARN_ON(memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS].base | |
697 | != (phys_addr_t)RED_INACTIVE); | |
698 | ||
699 | memblock.memory_size = 0; | |
700 | ||
701 | for (i = 0; i < memblock.memory.cnt; i++) | |
702 | memblock.memory_size += memblock.memory.regions[i].size; | |
142b45a7 BH |
703 | |
704 | /* We allow resizing from there */ | |
705 | memblock_can_resize = 1; | |
6ed311b2 BH |
706 | } |
707 | ||
7590abe8 BH |
708 | void __init memblock_init(void) |
709 | { | |
710 | /* Hookup the initial arrays */ | |
711 | memblock.memory.regions = memblock_memory_init_regions; | |
712 | memblock.memory.max = INIT_MEMBLOCK_REGIONS; | |
713 | memblock.reserved.regions = memblock_reserved_init_regions; | |
714 | memblock.reserved.max = INIT_MEMBLOCK_REGIONS; | |
715 | ||
716 | /* Write a marker in the unused last array entry */ | |
717 | memblock.memory.regions[INIT_MEMBLOCK_REGIONS].base = (phys_addr_t)RED_INACTIVE; | |
718 | memblock.reserved.regions[INIT_MEMBLOCK_REGIONS].base = (phys_addr_t)RED_INACTIVE; | |
719 | ||
720 | /* Create a dummy zero size MEMBLOCK which will get coalesced away later. | |
721 | * This simplifies the memblock_add() code below... | |
722 | */ | |
723 | memblock.memory.regions[0].base = 0; | |
724 | memblock.memory.regions[0].size = 0; | |
725 | memblock.memory.cnt = 1; | |
726 | ||
727 | /* Ditto. */ | |
728 | memblock.reserved.regions[0].base = 0; | |
729 | memblock.reserved.regions[0].size = 0; | |
730 | memblock.reserved.cnt = 1; | |
731 | ||
732 | memblock.current_limit = MEMBLOCK_ALLOC_ANYWHERE; | |
733 | } | |
734 | ||
6ed311b2 BH |
735 | static int __init early_memblock(char *p) |
736 | { | |
737 | if (p && strstr(p, "debug")) | |
738 | memblock_debug = 1; | |
739 | return 0; | |
740 | } | |
741 | early_param("memblock", early_memblock); | |
742 |