blob: 468ff43a72b4a299f0d16d625a79a61d6627af52 [file] [log] [blame]
Yinghai Lu95f72d12010-07-12 14:36:09 +10001/*
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>
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -070014#include <linux/slab.h>
Yinghai Lu95f72d12010-07-12 14:36:09 +100015#include <linux/init.h>
16#include <linux/bitops.h>
Benjamin Herrenschmidt449e8df2010-07-06 15:39:07 -070017#include <linux/poison.h>
Yinghai Lu95f72d12010-07-12 14:36:09 +100018#include <linux/memblock.h>
19
Yinghai Lu95f72d12010-07-12 14:36:09 +100020struct memblock memblock;
21
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -070022static int memblock_debug, memblock_can_resize;
Benjamin Herrenschmidtbf23c512010-07-06 15:39:06 -070023static struct memblock_region memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS + 1];
24static struct memblock_region memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS + 1];
Yinghai Lu95f72d12010-07-12 14:36:09 +100025
Benjamin Herrenschmidt4d629f92010-07-06 15:39:09 -070026#define MEMBLOCK_ERROR (~(phys_addr_t)0)
27
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -070028/* inline so we don't get a warning when pr_debug is compiled out */
29static inline const char *memblock_type_name(struct memblock_type *type)
30{
31 if (type == &memblock.memory)
32 return "memory";
33 else if (type == &memblock.reserved)
34 return "reserved";
35 else
36 return "unknown";
37}
38
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100039/*
40 * Address comparison utilities
41 */
42
43static phys_addr_t memblock_align_down(phys_addr_t addr, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +100044{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100045 return addr & ~(size - 1);
Yinghai Lu95f72d12010-07-12 14:36:09 +100046}
47
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100048static phys_addr_t memblock_align_up(phys_addr_t addr, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +100049{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100050 return (addr + (size - 1)) & ~(size - 1);
Yinghai Lu95f72d12010-07-12 14:36:09 +100051}
52
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +100053static unsigned long memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1,
54 phys_addr_t base2, phys_addr_t size2)
Yinghai Lu95f72d12010-07-12 14:36:09 +100055{
56 return ((base1 < (base2 + size2)) && (base2 < (base1 + size1)));
57}
58
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +100059static long memblock_addrs_adjacent(phys_addr_t base1, phys_addr_t size1,
60 phys_addr_t base2, phys_addr_t size2)
Yinghai Lu95f72d12010-07-12 14:36:09 +100061{
62 if (base2 == base1 + size1)
63 return 1;
64 else if (base1 == base2 + size2)
65 return -1;
66
67 return 0;
68}
69
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +100070static long memblock_regions_adjacent(struct memblock_type *type,
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +100071 unsigned long r1, unsigned long r2)
Yinghai Lu95f72d12010-07-12 14:36:09 +100072{
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +100073 phys_addr_t base1 = type->regions[r1].base;
74 phys_addr_t size1 = type->regions[r1].size;
75 phys_addr_t base2 = type->regions[r2].base;
76 phys_addr_t size2 = type->regions[r2].size;
Yinghai Lu95f72d12010-07-12 14:36:09 +100077
78 return memblock_addrs_adjacent(base1, size1, base2, size2);
79}
80
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +100081long memblock_overlaps_region(struct memblock_type *type, phys_addr_t base, phys_addr_t size)
82{
83 unsigned long i;
84
85 for (i = 0; i < type->cnt; i++) {
86 phys_addr_t rgnbase = type->regions[i].base;
87 phys_addr_t rgnsize = type->regions[i].size;
88 if (memblock_addrs_overlap(base, size, rgnbase, rgnsize))
89 break;
90 }
91
92 return (i < type->cnt) ? i : -1;
93}
94
95/*
96 * Find, allocate, deallocate or reserve unreserved regions. All allocations
97 * are top-down.
98 */
99
100static phys_addr_t __init memblock_find_region(phys_addr_t start, phys_addr_t end,
101 phys_addr_t size, phys_addr_t align)
102{
103 phys_addr_t base, res_base;
104 long j;
105
106 base = memblock_align_down((end - size), align);
107 while (start <= base) {
108 j = memblock_overlaps_region(&memblock.reserved, base, size);
109 if (j < 0)
110 return base;
111 res_base = memblock.reserved.regions[j].base;
112 if (res_base < size)
113 break;
114 base = memblock_align_down(res_base - size, align);
115 }
116
117 return MEMBLOCK_ERROR;
118}
119
Benjamin Herrenschmidtfef501d2010-07-12 15:00:34 +1000120static phys_addr_t __init memblock_find_base(phys_addr_t size, phys_addr_t align,
121 phys_addr_t start, phys_addr_t end)
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000122{
123 long i;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000124
125 BUG_ON(0 == size);
126
127 size = memblock_align_up(size, align);
128
129 /* Pump up max_addr */
Benjamin Herrenschmidtfef501d2010-07-12 15:00:34 +1000130 if (end == MEMBLOCK_ALLOC_ACCESSIBLE)
131 end = memblock.current_limit;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000132
133 /* We do a top-down search, this tends to limit memory
134 * fragmentation by keeping early boot allocs near the
135 * top of memory
136 */
137 for (i = memblock.memory.cnt - 1; i >= 0; i--) {
138 phys_addr_t memblockbase = memblock.memory.regions[i].base;
139 phys_addr_t memblocksize = memblock.memory.regions[i].size;
Benjamin Herrenschmidtfef501d2010-07-12 15:00:34 +1000140 phys_addr_t bottom, top, found;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000141
142 if (memblocksize < size)
143 continue;
Benjamin Herrenschmidtfef501d2010-07-12 15:00:34 +1000144 if ((memblockbase + memblocksize) <= start)
145 break;
146 bottom = max(memblockbase, start);
147 top = min(memblockbase + memblocksize, end);
148 if (bottom >= top)
149 continue;
150 found = memblock_find_region(bottom, top, size, align);
151 if (found != MEMBLOCK_ERROR)
152 return found;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000153 }
154 return MEMBLOCK_ERROR;
155}
156
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000157static void memblock_remove_region(struct memblock_type *type, unsigned long r)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000158{
159 unsigned long i;
160
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000161 for (i = r; i < type->cnt - 1; i++) {
162 type->regions[i].base = type->regions[i + 1].base;
163 type->regions[i].size = type->regions[i + 1].size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000164 }
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000165 type->cnt--;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000166}
167
168/* Assumption: base addr of region 1 < base addr of region 2 */
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000169static void memblock_coalesce_regions(struct memblock_type *type,
Yinghai Lu95f72d12010-07-12 14:36:09 +1000170 unsigned long r1, unsigned long r2)
171{
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000172 type->regions[r1].size += type->regions[r2].size;
173 memblock_remove_region(type, r2);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000174}
175
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700176/* Defined below but needed now */
177static long memblock_add_region(struct memblock_type *type, phys_addr_t base, phys_addr_t size);
178
179static int memblock_double_array(struct memblock_type *type)
180{
181 struct memblock_region *new_array, *old_array;
182 phys_addr_t old_size, new_size, addr;
183 int use_slab = slab_is_available();
184
185 /* We don't allow resizing until we know about the reserved regions
186 * of memory that aren't suitable for allocation
187 */
188 if (!memblock_can_resize)
189 return -1;
190
191 pr_debug("memblock: %s array full, doubling...", memblock_type_name(type));
192
193 /* Calculate new doubled size */
194 old_size = type->max * sizeof(struct memblock_region);
195 new_size = old_size << 1;
196
197 /* Try to find some space for it.
198 *
199 * WARNING: We assume that either slab_is_available() and we use it or
200 * we use MEMBLOCK for allocations. That means that this is unsafe to use
201 * when bootmem is currently active (unless bootmem itself is implemented
202 * on top of MEMBLOCK which isn't the case yet)
203 *
204 * This should however not be an issue for now, as we currently only
205 * call into MEMBLOCK while it's still active, or much later when slab is
206 * active for memory hotplug operations
207 */
208 if (use_slab) {
209 new_array = kmalloc(new_size, GFP_KERNEL);
210 addr = new_array == NULL ? MEMBLOCK_ERROR : __pa(new_array);
211 } else
Benjamin Herrenschmidtfef501d2010-07-12 15:00:34 +1000212 addr = memblock_find_base(new_size, sizeof(phys_addr_t), 0, MEMBLOCK_ALLOC_ACCESSIBLE);
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700213 if (addr == MEMBLOCK_ERROR) {
214 pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n",
215 memblock_type_name(type), type->max, type->max * 2);
216 return -1;
217 }
218 new_array = __va(addr);
219
220 /* Found space, we now need to move the array over before
221 * we add the reserved region since it may be our reserved
222 * array itself that is full.
223 */
224 memcpy(new_array, type->regions, old_size);
225 memset(new_array + type->max, 0, old_size);
226 old_array = type->regions;
227 type->regions = new_array;
228 type->max <<= 1;
229
230 /* If we use SLAB that's it, we are done */
231 if (use_slab)
232 return 0;
233
234 /* Add the new reserved region now. Should not fail ! */
235 BUG_ON(memblock_add_region(&memblock.reserved, addr, new_size) < 0);
236
237 /* If the array wasn't our static init one, then free it. We only do
238 * that before SLAB is available as later on, we don't know whether
239 * to use kfree or free_bootmem_pages(). Shouldn't be a big deal
240 * anyways
241 */
242 if (old_array != memblock_memory_init_regions &&
243 old_array != memblock_reserved_init_regions)
244 memblock_free(__pa(old_array), old_size);
245
246 return 0;
247}
248
Benjamin Herrenschmidtd2cd5632010-07-06 15:39:14 -0700249extern int __weak memblock_memory_can_coalesce(phys_addr_t addr1, phys_addr_t size1,
250 phys_addr_t addr2, phys_addr_t size2)
251{
252 return 1;
253}
254
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000255static long memblock_add_region(struct memblock_type *type, phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000256{
257 unsigned long coalesced = 0;
258 long adjacent, i;
259
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000260 if ((type->cnt == 1) && (type->regions[0].size == 0)) {
261 type->regions[0].base = base;
262 type->regions[0].size = size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000263 return 0;
264 }
265
266 /* First try and coalesce this MEMBLOCK with another. */
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000267 for (i = 0; i < type->cnt; i++) {
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000268 phys_addr_t rgnbase = type->regions[i].base;
269 phys_addr_t rgnsize = type->regions[i].size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000270
271 if ((rgnbase == base) && (rgnsize == size))
272 /* Already have this region, so we're done */
273 return 0;
274
275 adjacent = memblock_addrs_adjacent(base, size, rgnbase, rgnsize);
Benjamin Herrenschmidtd2cd5632010-07-06 15:39:14 -0700276 /* Check if arch allows coalescing */
277 if (adjacent != 0 && type == &memblock.memory &&
278 !memblock_memory_can_coalesce(base, size, rgnbase, rgnsize))
279 break;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000280 if (adjacent > 0) {
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000281 type->regions[i].base -= size;
282 type->regions[i].size += size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000283 coalesced++;
284 break;
285 } else if (adjacent < 0) {
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000286 type->regions[i].size += size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000287 coalesced++;
288 break;
289 }
290 }
291
Benjamin Herrenschmidtd2cd5632010-07-06 15:39:14 -0700292 /* If we plugged a hole, we may want to also coalesce with the
293 * next region
294 */
295 if ((i < type->cnt - 1) && memblock_regions_adjacent(type, i, i+1) &&
296 ((type != &memblock.memory || memblock_memory_can_coalesce(type->regions[i].base,
297 type->regions[i].size,
298 type->regions[i+1].base,
299 type->regions[i+1].size)))) {
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000300 memblock_coalesce_regions(type, i, i+1);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000301 coalesced++;
302 }
303
304 if (coalesced)
305 return coalesced;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700306
307 /* If we are out of space, we fail. It's too late to resize the array
308 * but then this shouldn't have happened in the first place.
309 */
310 if (WARN_ON(type->cnt >= type->max))
Yinghai Lu95f72d12010-07-12 14:36:09 +1000311 return -1;
312
313 /* Couldn't coalesce the MEMBLOCK, so add it to the sorted table. */
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000314 for (i = type->cnt - 1; i >= 0; i--) {
315 if (base < type->regions[i].base) {
316 type->regions[i+1].base = type->regions[i].base;
317 type->regions[i+1].size = type->regions[i].size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000318 } else {
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000319 type->regions[i+1].base = base;
320 type->regions[i+1].size = size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000321 break;
322 }
323 }
324
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000325 if (base < type->regions[0].base) {
326 type->regions[0].base = base;
327 type->regions[0].size = size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000328 }
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000329 type->cnt++;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000330
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700331 /* The array is full ? Try to resize it. If that fails, we undo
332 * our allocation and return an error
333 */
334 if (type->cnt == type->max && memblock_double_array(type)) {
335 type->cnt--;
336 return -1;
337 }
338
Yinghai Lu95f72d12010-07-12 14:36:09 +1000339 return 0;
340}
341
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000342long memblock_add(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000343{
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000344 return memblock_add_region(&memblock.memory, base, size);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000345
346}
347
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000348static long __memblock_remove(struct memblock_type *type, phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000349{
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000350 phys_addr_t rgnbegin, rgnend;
351 phys_addr_t end = base + size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000352 int i;
353
354 rgnbegin = rgnend = 0; /* supress gcc warnings */
355
356 /* Find the region where (base, size) belongs to */
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000357 for (i=0; i < type->cnt; i++) {
358 rgnbegin = type->regions[i].base;
359 rgnend = rgnbegin + type->regions[i].size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000360
361 if ((rgnbegin <= base) && (end <= rgnend))
362 break;
363 }
364
365 /* Didn't find the region */
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000366 if (i == type->cnt)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000367 return -1;
368
369 /* Check to see if we are removing entire region */
370 if ((rgnbegin == base) && (rgnend == end)) {
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000371 memblock_remove_region(type, i);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000372 return 0;
373 }
374
375 /* Check to see if region is matching at the front */
376 if (rgnbegin == base) {
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000377 type->regions[i].base = end;
378 type->regions[i].size -= size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000379 return 0;
380 }
381
382 /* Check to see if the region is matching at the end */
383 if (rgnend == end) {
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000384 type->regions[i].size -= size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000385 return 0;
386 }
387
388 /*
389 * We need to split the entry - adjust the current one to the
390 * beginging of the hole and add the region after hole.
391 */
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000392 type->regions[i].size = base - type->regions[i].base;
393 return memblock_add_region(type, end, rgnend - end);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000394}
395
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000396long memblock_remove(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000397{
398 return __memblock_remove(&memblock.memory, base, size);
399}
400
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000401long __init memblock_free(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000402{
403 return __memblock_remove(&memblock.reserved, base, size);
404}
405
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000406long __init memblock_reserve(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000407{
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000408 struct memblock_type *_rgn = &memblock.reserved;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000409
410 BUG_ON(0 == size);
411
412 return memblock_add_region(_rgn, base, size);
413}
414
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000415phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000416{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000417 phys_addr_t found;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000418
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000419 /* We align the size to limit fragmentation. Without this, a lot of
420 * small allocs quickly eat up the whole reserve array on sparc
421 */
422 size = memblock_align_up(size, align);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000423
Benjamin Herrenschmidtfef501d2010-07-12 15:00:34 +1000424 found = memblock_find_base(size, align, 0, max_addr);
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000425 if (found != MEMBLOCK_ERROR &&
426 memblock_add_region(&memblock.reserved, found, size) >= 0)
427 return found;
428
429 return 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000430}
431
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000432phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000433{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000434 phys_addr_t alloc;
435
436 alloc = __memblock_alloc_base(size, align, max_addr);
437
438 if (alloc == 0)
439 panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n",
440 (unsigned long long) size, (unsigned long long) max_addr);
441
442 return alloc;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000443}
444
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000445phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000446{
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000447 return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000448}
449
Yinghai Lu95f72d12010-07-12 14:36:09 +1000450
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000451/*
452 * Additional node-local allocators. Search for node memory is bottom up
453 * and walks memblock regions within that node bottom-up as well, but allocation
454 * within an memblock region is top-down.
455 */
Yinghai Lu95f72d12010-07-12 14:36:09 +1000456
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000457phys_addr_t __weak __init memblock_nid_range(phys_addr_t start, phys_addr_t end, int *nid)
Benjamin Herrenschmidtc3f72b52010-07-06 15:38:59 -0700458{
459 *nid = 0;
460
461 return end;
462}
463
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000464static phys_addr_t __init memblock_alloc_nid_region(struct memblock_region *mp,
465 phys_addr_t size,
466 phys_addr_t align, int nid)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000467{
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000468 phys_addr_t start, end;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000469
470 start = mp->base;
471 end = start + mp->size;
472
473 start = memblock_align_up(start, align);
474 while (start < end) {
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000475 phys_addr_t this_end;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000476 int this_nid;
477
Benjamin Herrenschmidt35a1f0b2010-07-06 15:38:58 -0700478 this_end = memblock_nid_range(start, end, &this_nid);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000479 if (this_nid == nid) {
Benjamin Herrenschmidt3a9c2c82010-07-12 13:28:15 +1000480 phys_addr_t ret = memblock_find_region(start, this_end, size, align);
Benjamin Herrenschmidt4d629f92010-07-06 15:39:09 -0700481 if (ret != MEMBLOCK_ERROR &&
Benjamin Herrenschmidt3a9c2c82010-07-12 13:28:15 +1000482 memblock_add_region(&memblock.reserved, ret, size) >= 0)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000483 return ret;
484 }
485 start = this_end;
486 }
487
Benjamin Herrenschmidt4d629f92010-07-06 15:39:09 -0700488 return MEMBLOCK_ERROR;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000489}
490
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000491phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000492{
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000493 struct memblock_type *mem = &memblock.memory;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000494 int i;
495
496 BUG_ON(0 == size);
497
Benjamin Herrenschmidt7f219c72010-07-12 14:24:57 +1000498 /* We align the size to limit fragmentation. Without this, a lot of
499 * small allocs quickly eat up the whole reserve array on sparc
500 */
501 size = memblock_align_up(size, align);
502
Benjamin Herrenschmidtc3f72b52010-07-06 15:38:59 -0700503 /* We do a bottom-up search for a region with the right
504 * nid since that's easier considering how memblock_nid_range()
505 * works
506 */
Yinghai Lu95f72d12010-07-12 14:36:09 +1000507 for (i = 0; i < mem->cnt; i++) {
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000508 phys_addr_t ret = memblock_alloc_nid_region(&mem->regions[i],
Yinghai Lu95f72d12010-07-12 14:36:09 +1000509 size, align, nid);
Benjamin Herrenschmidt4d629f92010-07-06 15:39:09 -0700510 if (ret != MEMBLOCK_ERROR)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000511 return ret;
512 }
513
514 return memblock_alloc(size, align);
515}
516
Yinghai Lu95f72d12010-07-12 14:36:09 +1000517/* You must call memblock_analyze() before this. */
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000518phys_addr_t __init memblock_phys_mem_size(void)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000519{
Benjamin Herrenschmidt4734b592010-07-28 14:31:29 +1000520 return memblock.memory_size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000521}
522
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000523phys_addr_t memblock_end_of_DRAM(void)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000524{
525 int idx = memblock.memory.cnt - 1;
526
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000527 return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000528}
529
530/* You must call memblock_analyze() after this. */
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000531void __init memblock_enforce_memory_limit(phys_addr_t memory_limit)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000532{
533 unsigned long i;
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000534 phys_addr_t limit;
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000535 struct memblock_region *p;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000536
537 if (!memory_limit)
538 return;
539
540 /* Truncate the memblock regions to satisfy the memory limit. */
541 limit = memory_limit;
542 for (i = 0; i < memblock.memory.cnt; i++) {
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000543 if (limit > memblock.memory.regions[i].size) {
544 limit -= memblock.memory.regions[i].size;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000545 continue;
546 }
547
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000548 memblock.memory.regions[i].size = limit;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000549 memblock.memory.cnt = i + 1;
550 break;
551 }
552
Yinghai Lu95f72d12010-07-12 14:36:09 +1000553 memory_limit = memblock_end_of_DRAM();
554
555 /* And truncate any reserves above the limit also. */
556 for (i = 0; i < memblock.reserved.cnt; i++) {
Benjamin Herrenschmidte3239ff2010-08-04 14:06:41 +1000557 p = &memblock.reserved.regions[i];
Yinghai Lu95f72d12010-07-12 14:36:09 +1000558
559 if (p->base > memory_limit)
560 p->size = 0;
561 else if ((p->base + p->size) > memory_limit)
562 p->size = memory_limit - p->base;
563
564 if (p->size == 0) {
565 memblock_remove_region(&memblock.reserved, i);
566 i--;
567 }
568 }
569}
570
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000571static int memblock_search(struct memblock_type *type, phys_addr_t addr)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +1000572{
573 unsigned int left = 0, right = type->cnt;
574
575 do {
576 unsigned int mid = (right + left) / 2;
577
578 if (addr < type->regions[mid].base)
579 right = mid;
580 else if (addr >= (type->regions[mid].base +
581 type->regions[mid].size))
582 left = mid + 1;
583 else
584 return mid;
585 } while (left < right);
586 return -1;
587}
588
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000589int __init memblock_is_reserved(phys_addr_t addr)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000590{
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +1000591 return memblock_search(&memblock.reserved, addr) != -1;
592}
Yinghai Lu95f72d12010-07-12 14:36:09 +1000593
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000594int memblock_is_memory(phys_addr_t addr)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +1000595{
596 return memblock_search(&memblock.memory, addr) != -1;
597}
598
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000599int memblock_is_region_memory(phys_addr_t base, phys_addr_t size)
Benjamin Herrenschmidt72d4b0b2010-08-04 14:38:47 +1000600{
601 int idx = memblock_search(&memblock.reserved, base);
602
603 if (idx == -1)
604 return 0;
605 return memblock.reserved.regions[idx].base <= base &&
606 (memblock.reserved.regions[idx].base +
607 memblock.reserved.regions[idx].size) >= (base + size);
Yinghai Lu95f72d12010-07-12 14:36:09 +1000608}
609
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000610int memblock_is_region_reserved(phys_addr_t base, phys_addr_t size)
Yinghai Lu95f72d12010-07-12 14:36:09 +1000611{
Benjamin Herrenschmidtf1c2c192010-08-04 14:17:17 +1000612 return memblock_overlaps_region(&memblock.reserved, base, size) >= 0;
Yinghai Lu95f72d12010-07-12 14:36:09 +1000613}
614
Benjamin Herrenschmidte63075a2010-07-06 15:39:01 -0700615
Benjamin Herrenschmidt2898cc42010-08-04 13:34:42 +1000616void __init memblock_set_current_limit(phys_addr_t limit)
Benjamin Herrenschmidte63075a2010-07-06 15:39:01 -0700617{
618 memblock.current_limit = limit;
619}
620
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000621static void memblock_dump(struct memblock_type *region, char *name)
622{
623 unsigned long long base, size;
624 int i;
625
626 pr_info(" %s.cnt = 0x%lx\n", name, region->cnt);
627
628 for (i = 0; i < region->cnt; i++) {
629 base = region->regions[i].base;
630 size = region->regions[i].size;
631
632 pr_info(" %s[0x%x]\t0x%016llx - 0x%016llx, 0x%llx bytes\n",
633 name, i, base, base + size - 1, size);
634 }
635}
636
637void memblock_dump_all(void)
638{
639 if (!memblock_debug)
640 return;
641
642 pr_info("MEMBLOCK configuration:\n");
643 pr_info(" memory size = 0x%llx\n", (unsigned long long)memblock.memory_size);
644
645 memblock_dump(&memblock.memory, "memory");
646 memblock_dump(&memblock.reserved, "reserved");
647}
648
649void __init memblock_analyze(void)
650{
651 int i;
652
653 /* Check marker in the unused last array entry */
654 WARN_ON(memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS].base
655 != (phys_addr_t)RED_INACTIVE);
656 WARN_ON(memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS].base
657 != (phys_addr_t)RED_INACTIVE);
658
659 memblock.memory_size = 0;
660
661 for (i = 0; i < memblock.memory.cnt; i++)
662 memblock.memory_size += memblock.memory.regions[i].size;
Benjamin Herrenschmidt142b45a2010-07-06 15:39:13 -0700663
664 /* We allow resizing from there */
665 memblock_can_resize = 1;
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000666}
667
Benjamin Herrenschmidt7590abe2010-07-06 15:39:10 -0700668void __init memblock_init(void)
669{
670 /* Hookup the initial arrays */
671 memblock.memory.regions = memblock_memory_init_regions;
672 memblock.memory.max = INIT_MEMBLOCK_REGIONS;
673 memblock.reserved.regions = memblock_reserved_init_regions;
674 memblock.reserved.max = INIT_MEMBLOCK_REGIONS;
675
676 /* Write a marker in the unused last array entry */
677 memblock.memory.regions[INIT_MEMBLOCK_REGIONS].base = (phys_addr_t)RED_INACTIVE;
678 memblock.reserved.regions[INIT_MEMBLOCK_REGIONS].base = (phys_addr_t)RED_INACTIVE;
679
680 /* Create a dummy zero size MEMBLOCK which will get coalesced away later.
681 * This simplifies the memblock_add() code below...
682 */
683 memblock.memory.regions[0].base = 0;
684 memblock.memory.regions[0].size = 0;
685 memblock.memory.cnt = 1;
686
687 /* Ditto. */
688 memblock.reserved.regions[0].base = 0;
689 memblock.reserved.regions[0].size = 0;
690 memblock.reserved.cnt = 1;
691
692 memblock.current_limit = MEMBLOCK_ALLOC_ANYWHERE;
693}
694
Benjamin Herrenschmidt6ed311b2010-07-12 14:36:48 +1000695static int __init early_memblock(char *p)
696{
697 if (p && strstr(p, "debug"))
698 memblock_debug = 1;
699 return 0;
700}
701early_param("memblock", early_memblock);
702