]>
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> | |
14 | #include <linux/init.h> | |
15 | #include <linux/bitops.h> | |
16 | #include <linux/memblock.h> | |
17 | ||
95f72d1e YL |
18 | struct memblock memblock; |
19 | ||
20 | static int memblock_debug; | |
bf23c51f BH |
21 | static struct memblock_region memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS + 1]; |
22 | static struct memblock_region memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS + 1]; | |
95f72d1e YL |
23 | |
24 | static int __init early_memblock(char *p) | |
25 | { | |
26 | if (p && strstr(p, "debug")) | |
27 | memblock_debug = 1; | |
28 | return 0; | |
29 | } | |
30 | early_param("memblock", early_memblock); | |
31 | ||
e3239ff9 | 32 | static void memblock_dump(struct memblock_type *region, char *name) |
95f72d1e YL |
33 | { |
34 | unsigned long long base, size; | |
35 | int i; | |
36 | ||
37 | pr_info(" %s.cnt = 0x%lx\n", name, region->cnt); | |
38 | ||
39 | for (i = 0; i < region->cnt; i++) { | |
e3239ff9 BH |
40 | base = region->regions[i].base; |
41 | size = region->regions[i].size; | |
95f72d1e YL |
42 | |
43 | pr_info(" %s[0x%x]\t0x%016llx - 0x%016llx, 0x%llx bytes\n", | |
44 | name, i, base, base + size - 1, size); | |
45 | } | |
46 | } | |
47 | ||
48 | void memblock_dump_all(void) | |
49 | { | |
50 | if (!memblock_debug) | |
51 | return; | |
52 | ||
53 | pr_info("MEMBLOCK configuration:\n"); | |
4734b594 | 54 | pr_info(" memory size = 0x%llx\n", (unsigned long long)memblock.memory_size); |
95f72d1e YL |
55 | |
56 | memblock_dump(&memblock.memory, "memory"); | |
57 | memblock_dump(&memblock.reserved, "reserved"); | |
58 | } | |
59 | ||
2898cc4c BH |
60 | static unsigned long memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1, |
61 | phys_addr_t base2, phys_addr_t size2) | |
95f72d1e YL |
62 | { |
63 | return ((base1 < (base2 + size2)) && (base2 < (base1 + size1))); | |
64 | } | |
65 | ||
2898cc4c BH |
66 | static long memblock_addrs_adjacent(phys_addr_t base1, phys_addr_t size1, |
67 | phys_addr_t base2, phys_addr_t size2) | |
95f72d1e YL |
68 | { |
69 | if (base2 == base1 + size1) | |
70 | return 1; | |
71 | else if (base1 == base2 + size2) | |
72 | return -1; | |
73 | ||
74 | return 0; | |
75 | } | |
76 | ||
e3239ff9 | 77 | static long memblock_regions_adjacent(struct memblock_type *type, |
2898cc4c | 78 | unsigned long r1, unsigned long r2) |
95f72d1e | 79 | { |
2898cc4c BH |
80 | phys_addr_t base1 = type->regions[r1].base; |
81 | phys_addr_t size1 = type->regions[r1].size; | |
82 | phys_addr_t base2 = type->regions[r2].base; | |
83 | phys_addr_t size2 = type->regions[r2].size; | |
95f72d1e YL |
84 | |
85 | return memblock_addrs_adjacent(base1, size1, base2, size2); | |
86 | } | |
87 | ||
e3239ff9 | 88 | static void memblock_remove_region(struct memblock_type *type, unsigned long r) |
95f72d1e YL |
89 | { |
90 | unsigned long i; | |
91 | ||
e3239ff9 BH |
92 | for (i = r; i < type->cnt - 1; i++) { |
93 | type->regions[i].base = type->regions[i + 1].base; | |
94 | type->regions[i].size = type->regions[i + 1].size; | |
95f72d1e | 95 | } |
e3239ff9 | 96 | type->cnt--; |
95f72d1e YL |
97 | } |
98 | ||
99 | /* Assumption: base addr of region 1 < base addr of region 2 */ | |
e3239ff9 | 100 | static void memblock_coalesce_regions(struct memblock_type *type, |
95f72d1e YL |
101 | unsigned long r1, unsigned long r2) |
102 | { | |
e3239ff9 BH |
103 | type->regions[r1].size += type->regions[r2].size; |
104 | memblock_remove_region(type, r2); | |
95f72d1e YL |
105 | } |
106 | ||
107 | void __init memblock_init(void) | |
108 | { | |
bf23c51f BH |
109 | /* Hookup the initial arrays */ |
110 | memblock.memory.regions = memblock_memory_init_regions; | |
111 | memblock.memory.max = INIT_MEMBLOCK_REGIONS; | |
112 | memblock.reserved.regions = memblock_reserved_init_regions; | |
113 | memblock.reserved.max = INIT_MEMBLOCK_REGIONS; | |
114 | ||
95f72d1e YL |
115 | /* Create a dummy zero size MEMBLOCK which will get coalesced away later. |
116 | * This simplifies the memblock_add() code below... | |
117 | */ | |
e3239ff9 BH |
118 | memblock.memory.regions[0].base = 0; |
119 | memblock.memory.regions[0].size = 0; | |
95f72d1e YL |
120 | memblock.memory.cnt = 1; |
121 | ||
122 | /* Ditto. */ | |
e3239ff9 BH |
123 | memblock.reserved.regions[0].base = 0; |
124 | memblock.reserved.regions[0].size = 0; | |
95f72d1e | 125 | memblock.reserved.cnt = 1; |
e63075a3 BH |
126 | |
127 | memblock.current_limit = MEMBLOCK_ALLOC_ANYWHERE; | |
95f72d1e YL |
128 | } |
129 | ||
130 | void __init memblock_analyze(void) | |
131 | { | |
132 | int i; | |
133 | ||
4734b594 | 134 | memblock.memory_size = 0; |
95f72d1e YL |
135 | |
136 | for (i = 0; i < memblock.memory.cnt; i++) | |
4734b594 | 137 | memblock.memory_size += memblock.memory.regions[i].size; |
95f72d1e YL |
138 | } |
139 | ||
2898cc4c | 140 | static long memblock_add_region(struct memblock_type *type, phys_addr_t base, phys_addr_t size) |
95f72d1e YL |
141 | { |
142 | unsigned long coalesced = 0; | |
143 | long adjacent, i; | |
144 | ||
e3239ff9 BH |
145 | if ((type->cnt == 1) && (type->regions[0].size == 0)) { |
146 | type->regions[0].base = base; | |
147 | type->regions[0].size = size; | |
95f72d1e YL |
148 | return 0; |
149 | } | |
150 | ||
151 | /* First try and coalesce this MEMBLOCK with another. */ | |
e3239ff9 | 152 | for (i = 0; i < type->cnt; i++) { |
2898cc4c BH |
153 | phys_addr_t rgnbase = type->regions[i].base; |
154 | phys_addr_t rgnsize = type->regions[i].size; | |
95f72d1e YL |
155 | |
156 | if ((rgnbase == base) && (rgnsize == size)) | |
157 | /* Already have this region, so we're done */ | |
158 | return 0; | |
159 | ||
160 | adjacent = memblock_addrs_adjacent(base, size, rgnbase, rgnsize); | |
161 | if (adjacent > 0) { | |
e3239ff9 BH |
162 | type->regions[i].base -= size; |
163 | type->regions[i].size += size; | |
95f72d1e YL |
164 | coalesced++; |
165 | break; | |
166 | } else if (adjacent < 0) { | |
e3239ff9 | 167 | type->regions[i].size += size; |
95f72d1e YL |
168 | coalesced++; |
169 | break; | |
170 | } | |
171 | } | |
172 | ||
e3239ff9 BH |
173 | if ((i < type->cnt - 1) && memblock_regions_adjacent(type, i, i+1)) { |
174 | memblock_coalesce_regions(type, i, i+1); | |
95f72d1e YL |
175 | coalesced++; |
176 | } | |
177 | ||
178 | if (coalesced) | |
179 | return coalesced; | |
bf23c51f | 180 | if (type->cnt >= type->max) |
95f72d1e YL |
181 | return -1; |
182 | ||
183 | /* Couldn't coalesce the MEMBLOCK, so add it to the sorted table. */ | |
e3239ff9 BH |
184 | for (i = type->cnt - 1; i >= 0; i--) { |
185 | if (base < type->regions[i].base) { | |
186 | type->regions[i+1].base = type->regions[i].base; | |
187 | type->regions[i+1].size = type->regions[i].size; | |
95f72d1e | 188 | } else { |
e3239ff9 BH |
189 | type->regions[i+1].base = base; |
190 | type->regions[i+1].size = size; | |
95f72d1e YL |
191 | break; |
192 | } | |
193 | } | |
194 | ||
e3239ff9 BH |
195 | if (base < type->regions[0].base) { |
196 | type->regions[0].base = base; | |
197 | type->regions[0].size = size; | |
95f72d1e | 198 | } |
e3239ff9 | 199 | type->cnt++; |
95f72d1e YL |
200 | |
201 | return 0; | |
202 | } | |
203 | ||
2898cc4c | 204 | long memblock_add(phys_addr_t base, phys_addr_t size) |
95f72d1e | 205 | { |
e3239ff9 | 206 | return memblock_add_region(&memblock.memory, base, size); |
95f72d1e YL |
207 | |
208 | } | |
209 | ||
2898cc4c | 210 | static long __memblock_remove(struct memblock_type *type, phys_addr_t base, phys_addr_t size) |
95f72d1e | 211 | { |
2898cc4c BH |
212 | phys_addr_t rgnbegin, rgnend; |
213 | phys_addr_t end = base + size; | |
95f72d1e YL |
214 | int i; |
215 | ||
216 | rgnbegin = rgnend = 0; /* supress gcc warnings */ | |
217 | ||
218 | /* Find the region where (base, size) belongs to */ | |
e3239ff9 BH |
219 | for (i=0; i < type->cnt; i++) { |
220 | rgnbegin = type->regions[i].base; | |
221 | rgnend = rgnbegin + type->regions[i].size; | |
95f72d1e YL |
222 | |
223 | if ((rgnbegin <= base) && (end <= rgnend)) | |
224 | break; | |
225 | } | |
226 | ||
227 | /* Didn't find the region */ | |
e3239ff9 | 228 | if (i == type->cnt) |
95f72d1e YL |
229 | return -1; |
230 | ||
231 | /* Check to see if we are removing entire region */ | |
232 | if ((rgnbegin == base) && (rgnend == end)) { | |
e3239ff9 | 233 | memblock_remove_region(type, i); |
95f72d1e YL |
234 | return 0; |
235 | } | |
236 | ||
237 | /* Check to see if region is matching at the front */ | |
238 | if (rgnbegin == base) { | |
e3239ff9 BH |
239 | type->regions[i].base = end; |
240 | type->regions[i].size -= size; | |
95f72d1e YL |
241 | return 0; |
242 | } | |
243 | ||
244 | /* Check to see if the region is matching at the end */ | |
245 | if (rgnend == end) { | |
e3239ff9 | 246 | type->regions[i].size -= size; |
95f72d1e YL |
247 | return 0; |
248 | } | |
249 | ||
250 | /* | |
251 | * We need to split the entry - adjust the current one to the | |
252 | * beginging of the hole and add the region after hole. | |
253 | */ | |
e3239ff9 BH |
254 | type->regions[i].size = base - type->regions[i].base; |
255 | return memblock_add_region(type, end, rgnend - end); | |
95f72d1e YL |
256 | } |
257 | ||
2898cc4c | 258 | long memblock_remove(phys_addr_t base, phys_addr_t size) |
95f72d1e YL |
259 | { |
260 | return __memblock_remove(&memblock.memory, base, size); | |
261 | } | |
262 | ||
2898cc4c | 263 | long __init memblock_free(phys_addr_t base, phys_addr_t size) |
95f72d1e YL |
264 | { |
265 | return __memblock_remove(&memblock.reserved, base, size); | |
266 | } | |
267 | ||
2898cc4c | 268 | long __init memblock_reserve(phys_addr_t base, phys_addr_t size) |
95f72d1e | 269 | { |
e3239ff9 | 270 | struct memblock_type *_rgn = &memblock.reserved; |
95f72d1e YL |
271 | |
272 | BUG_ON(0 == size); | |
273 | ||
274 | return memblock_add_region(_rgn, base, size); | |
275 | } | |
276 | ||
2898cc4c | 277 | long memblock_overlaps_region(struct memblock_type *type, phys_addr_t base, phys_addr_t size) |
95f72d1e YL |
278 | { |
279 | unsigned long i; | |
280 | ||
e3239ff9 | 281 | for (i = 0; i < type->cnt; i++) { |
2898cc4c BH |
282 | phys_addr_t rgnbase = type->regions[i].base; |
283 | phys_addr_t rgnsize = type->regions[i].size; | |
95f72d1e YL |
284 | if (memblock_addrs_overlap(base, size, rgnbase, rgnsize)) |
285 | break; | |
286 | } | |
287 | ||
e3239ff9 | 288 | return (i < type->cnt) ? i : -1; |
95f72d1e YL |
289 | } |
290 | ||
2898cc4c | 291 | static phys_addr_t memblock_align_down(phys_addr_t addr, phys_addr_t size) |
95f72d1e YL |
292 | { |
293 | return addr & ~(size - 1); | |
294 | } | |
295 | ||
2898cc4c | 296 | static phys_addr_t memblock_align_up(phys_addr_t addr, phys_addr_t size) |
95f72d1e YL |
297 | { |
298 | return (addr + (size - 1)) & ~(size - 1); | |
299 | } | |
300 | ||
2898cc4c BH |
301 | static phys_addr_t __init memblock_alloc_region(phys_addr_t start, phys_addr_t end, |
302 | phys_addr_t size, phys_addr_t align) | |
95f72d1e | 303 | { |
2898cc4c | 304 | phys_addr_t base, res_base; |
95f72d1e YL |
305 | long j; |
306 | ||
307 | base = memblock_align_down((end - size), align); | |
308 | while (start <= base) { | |
309 | j = memblock_overlaps_region(&memblock.reserved, base, size); | |
310 | if (j < 0) { | |
311 | /* this area isn't reserved, take it */ | |
312 | if (memblock_add_region(&memblock.reserved, base, size) < 0) | |
2898cc4c | 313 | base = ~(phys_addr_t)0; |
95f72d1e YL |
314 | return base; |
315 | } | |
e3239ff9 | 316 | res_base = memblock.reserved.regions[j].base; |
95f72d1e YL |
317 | if (res_base < size) |
318 | break; | |
319 | base = memblock_align_down(res_base - size, align); | |
320 | } | |
321 | ||
2898cc4c | 322 | return ~(phys_addr_t)0; |
95f72d1e YL |
323 | } |
324 | ||
2898cc4c | 325 | phys_addr_t __weak __init memblock_nid_range(phys_addr_t start, phys_addr_t end, int *nid) |
c3f72b57 BH |
326 | { |
327 | *nid = 0; | |
328 | ||
329 | return end; | |
330 | } | |
331 | ||
2898cc4c BH |
332 | static phys_addr_t __init memblock_alloc_nid_region(struct memblock_region *mp, |
333 | phys_addr_t size, | |
334 | phys_addr_t align, int nid) | |
95f72d1e | 335 | { |
2898cc4c | 336 | phys_addr_t start, end; |
95f72d1e YL |
337 | |
338 | start = mp->base; | |
339 | end = start + mp->size; | |
340 | ||
341 | start = memblock_align_up(start, align); | |
342 | while (start < end) { | |
2898cc4c | 343 | phys_addr_t this_end; |
95f72d1e YL |
344 | int this_nid; |
345 | ||
35a1f0bd | 346 | this_end = memblock_nid_range(start, end, &this_nid); |
95f72d1e | 347 | if (this_nid == nid) { |
2898cc4c BH |
348 | phys_addr_t ret = memblock_alloc_region(start, this_end, size, align); |
349 | if (ret != ~(phys_addr_t)0) | |
95f72d1e YL |
350 | return ret; |
351 | } | |
352 | start = this_end; | |
353 | } | |
354 | ||
2898cc4c | 355 | return ~(phys_addr_t)0; |
95f72d1e YL |
356 | } |
357 | ||
2898cc4c | 358 | phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid) |
95f72d1e | 359 | { |
e3239ff9 | 360 | struct memblock_type *mem = &memblock.memory; |
95f72d1e YL |
361 | int i; |
362 | ||
363 | BUG_ON(0 == size); | |
364 | ||
c3f72b57 BH |
365 | /* We do a bottom-up search for a region with the right |
366 | * nid since that's easier considering how memblock_nid_range() | |
367 | * works | |
368 | */ | |
95f72d1e YL |
369 | size = memblock_align_up(size, align); |
370 | ||
371 | for (i = 0; i < mem->cnt; i++) { | |
2898cc4c | 372 | phys_addr_t ret = memblock_alloc_nid_region(&mem->regions[i], |
95f72d1e | 373 | size, align, nid); |
2898cc4c | 374 | if (ret != ~(phys_addr_t)0) |
95f72d1e YL |
375 | return ret; |
376 | } | |
377 | ||
378 | return memblock_alloc(size, align); | |
379 | } | |
380 | ||
2898cc4c | 381 | phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align) |
95f72d1e | 382 | { |
e63075a3 | 383 | return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE); |
95f72d1e YL |
384 | } |
385 | ||
2898cc4c | 386 | phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) |
95f72d1e | 387 | { |
2898cc4c | 388 | phys_addr_t alloc; |
95f72d1e YL |
389 | |
390 | alloc = __memblock_alloc_base(size, align, max_addr); | |
391 | ||
392 | if (alloc == 0) | |
393 | panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n", | |
394 | (unsigned long long) size, (unsigned long long) max_addr); | |
395 | ||
396 | return alloc; | |
397 | } | |
398 | ||
2898cc4c | 399 | phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) |
95f72d1e | 400 | { |
c3f72b57 | 401 | long i; |
2898cc4c BH |
402 | phys_addr_t base = 0; |
403 | phys_addr_t res_base; | |
95f72d1e YL |
404 | |
405 | BUG_ON(0 == size); | |
406 | ||
407 | size = memblock_align_up(size, align); | |
408 | ||
c3f72b57 | 409 | /* Pump up max_addr */ |
e63075a3 BH |
410 | if (max_addr == MEMBLOCK_ALLOC_ACCESSIBLE) |
411 | max_addr = memblock.current_limit; | |
c3f72b57 BH |
412 | |
413 | /* We do a top-down search, this tends to limit memory | |
414 | * fragmentation by keeping early boot allocs near the | |
415 | * top of memory | |
416 | */ | |
95f72d1e | 417 | for (i = memblock.memory.cnt - 1; i >= 0; i--) { |
2898cc4c BH |
418 | phys_addr_t memblockbase = memblock.memory.regions[i].base; |
419 | phys_addr_t memblocksize = memblock.memory.regions[i].size; | |
95f72d1e YL |
420 | |
421 | if (memblocksize < size) | |
422 | continue; | |
c3f72b57 BH |
423 | base = min(memblockbase + memblocksize, max_addr); |
424 | res_base = memblock_alloc_region(memblockbase, base, size, align); | |
2898cc4c | 425 | if (res_base != ~(phys_addr_t)0) |
c3f72b57 | 426 | return res_base; |
95f72d1e YL |
427 | } |
428 | return 0; | |
429 | } | |
430 | ||
431 | /* You must call memblock_analyze() before this. */ | |
2898cc4c | 432 | phys_addr_t __init memblock_phys_mem_size(void) |
95f72d1e | 433 | { |
4734b594 | 434 | return memblock.memory_size; |
95f72d1e YL |
435 | } |
436 | ||
2898cc4c | 437 | phys_addr_t memblock_end_of_DRAM(void) |
95f72d1e YL |
438 | { |
439 | int idx = memblock.memory.cnt - 1; | |
440 | ||
e3239ff9 | 441 | return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size); |
95f72d1e YL |
442 | } |
443 | ||
444 | /* You must call memblock_analyze() after this. */ | |
2898cc4c | 445 | void __init memblock_enforce_memory_limit(phys_addr_t memory_limit) |
95f72d1e YL |
446 | { |
447 | unsigned long i; | |
2898cc4c | 448 | phys_addr_t limit; |
e3239ff9 | 449 | struct memblock_region *p; |
95f72d1e YL |
450 | |
451 | if (!memory_limit) | |
452 | return; | |
453 | ||
454 | /* Truncate the memblock regions to satisfy the memory limit. */ | |
455 | limit = memory_limit; | |
456 | for (i = 0; i < memblock.memory.cnt; i++) { | |
e3239ff9 BH |
457 | if (limit > memblock.memory.regions[i].size) { |
458 | limit -= memblock.memory.regions[i].size; | |
95f72d1e YL |
459 | continue; |
460 | } | |
461 | ||
e3239ff9 | 462 | memblock.memory.regions[i].size = limit; |
95f72d1e YL |
463 | memblock.memory.cnt = i + 1; |
464 | break; | |
465 | } | |
466 | ||
95f72d1e YL |
467 | memory_limit = memblock_end_of_DRAM(); |
468 | ||
469 | /* And truncate any reserves above the limit also. */ | |
470 | for (i = 0; i < memblock.reserved.cnt; i++) { | |
e3239ff9 | 471 | p = &memblock.reserved.regions[i]; |
95f72d1e YL |
472 | |
473 | if (p->base > memory_limit) | |
474 | p->size = 0; | |
475 | else if ((p->base + p->size) > memory_limit) | |
476 | p->size = memory_limit - p->base; | |
477 | ||
478 | if (p->size == 0) { | |
479 | memblock_remove_region(&memblock.reserved, i); | |
480 | i--; | |
481 | } | |
482 | } | |
483 | } | |
484 | ||
2898cc4c | 485 | static int memblock_search(struct memblock_type *type, phys_addr_t addr) |
72d4b0b4 BH |
486 | { |
487 | unsigned int left = 0, right = type->cnt; | |
488 | ||
489 | do { | |
490 | unsigned int mid = (right + left) / 2; | |
491 | ||
492 | if (addr < type->regions[mid].base) | |
493 | right = mid; | |
494 | else if (addr >= (type->regions[mid].base + | |
495 | type->regions[mid].size)) | |
496 | left = mid + 1; | |
497 | else | |
498 | return mid; | |
499 | } while (left < right); | |
500 | return -1; | |
501 | } | |
502 | ||
2898cc4c | 503 | int __init memblock_is_reserved(phys_addr_t addr) |
95f72d1e | 504 | { |
72d4b0b4 BH |
505 | return memblock_search(&memblock.reserved, addr) != -1; |
506 | } | |
95f72d1e | 507 | |
2898cc4c | 508 | int memblock_is_memory(phys_addr_t addr) |
72d4b0b4 BH |
509 | { |
510 | return memblock_search(&memblock.memory, addr) != -1; | |
511 | } | |
512 | ||
2898cc4c | 513 | int memblock_is_region_memory(phys_addr_t base, phys_addr_t size) |
72d4b0b4 BH |
514 | { |
515 | int idx = memblock_search(&memblock.reserved, base); | |
516 | ||
517 | if (idx == -1) | |
518 | return 0; | |
519 | return memblock.reserved.regions[idx].base <= base && | |
520 | (memblock.reserved.regions[idx].base + | |
521 | memblock.reserved.regions[idx].size) >= (base + size); | |
95f72d1e YL |
522 | } |
523 | ||
2898cc4c | 524 | int memblock_is_region_reserved(phys_addr_t base, phys_addr_t size) |
95f72d1e | 525 | { |
f1c2c19c | 526 | return memblock_overlaps_region(&memblock.reserved, base, size) >= 0; |
95f72d1e YL |
527 | } |
528 | ||
e63075a3 | 529 | |
2898cc4c | 530 | void __init memblock_set_current_limit(phys_addr_t limit) |
e63075a3 BH |
531 | { |
532 | memblock.current_limit = limit; | |
533 | } | |
534 |