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 | ||
79442ed1 TC |
23 | #include <asm-generic/sections.h> |
24 | ||
fe091c20 TH |
25 | static struct memblock_region memblock_memory_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock; |
26 | static struct memblock_region memblock_reserved_init_regions[INIT_MEMBLOCK_REGIONS] __initdata_memblock; | |
27 | ||
28 | struct memblock memblock __initdata_memblock = { | |
29 | .memory.regions = memblock_memory_init_regions, | |
30 | .memory.cnt = 1, /* empty dummy entry */ | |
31 | .memory.max = INIT_MEMBLOCK_REGIONS, | |
32 | ||
33 | .reserved.regions = memblock_reserved_init_regions, | |
34 | .reserved.cnt = 1, /* empty dummy entry */ | |
35 | .reserved.max = INIT_MEMBLOCK_REGIONS, | |
36 | ||
79442ed1 | 37 | .bottom_up = false, |
fe091c20 TH |
38 | .current_limit = MEMBLOCK_ALLOC_ANYWHERE, |
39 | }; | |
95f72d1e | 40 | |
10d06439 | 41 | int memblock_debug __initdata_memblock; |
1aadc056 | 42 | static int memblock_can_resize __initdata_memblock; |
181eb394 GS |
43 | static int memblock_memory_in_slab __initdata_memblock = 0; |
44 | static int memblock_reserved_in_slab __initdata_memblock = 0; | |
95f72d1e | 45 | |
142b45a7 | 46 | /* inline so we don't get a warning when pr_debug is compiled out */ |
c2233116 RP |
47 | static __init_memblock const char * |
48 | memblock_type_name(struct memblock_type *type) | |
142b45a7 BH |
49 | { |
50 | if (type == &memblock.memory) | |
51 | return "memory"; | |
52 | else if (type == &memblock.reserved) | |
53 | return "reserved"; | |
54 | else | |
55 | return "unknown"; | |
56 | } | |
57 | ||
eb18f1b5 TH |
58 | /* adjust *@size so that (@base + *@size) doesn't overflow, return new size */ |
59 | static inline phys_addr_t memblock_cap_size(phys_addr_t base, phys_addr_t *size) | |
60 | { | |
61 | return *size = min(*size, (phys_addr_t)ULLONG_MAX - base); | |
62 | } | |
63 | ||
6ed311b2 BH |
64 | /* |
65 | * Address comparison utilities | |
66 | */ | |
10d06439 | 67 | static unsigned long __init_memblock memblock_addrs_overlap(phys_addr_t base1, phys_addr_t size1, |
2898cc4c | 68 | phys_addr_t base2, phys_addr_t size2) |
95f72d1e YL |
69 | { |
70 | return ((base1 < (base2 + size2)) && (base2 < (base1 + size1))); | |
71 | } | |
72 | ||
2d7d3eb2 HS |
73 | static long __init_memblock memblock_overlaps_region(struct memblock_type *type, |
74 | phys_addr_t base, phys_addr_t size) | |
6ed311b2 BH |
75 | { |
76 | unsigned long i; | |
77 | ||
78 | for (i = 0; i < type->cnt; i++) { | |
79 | phys_addr_t rgnbase = type->regions[i].base; | |
80 | phys_addr_t rgnsize = type->regions[i].size; | |
81 | if (memblock_addrs_overlap(base, size, rgnbase, rgnsize)) | |
82 | break; | |
83 | } | |
84 | ||
85 | return (i < type->cnt) ? i : -1; | |
86 | } | |
87 | ||
79442ed1 TC |
88 | /* |
89 | * __memblock_find_range_bottom_up - find free area utility in bottom-up | |
90 | * @start: start of candidate range | |
91 | * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE} | |
92 | * @size: size of free area to find | |
93 | * @align: alignment of free area to find | |
94 | * @nid: nid of the free area to find, %MAX_NUMNODES for any node | |
95 | * | |
96 | * Utility called from memblock_find_in_range_node(), find free area bottom-up. | |
97 | * | |
98 | * RETURNS: | |
99 | * Found address on success, 0 on failure. | |
100 | */ | |
101 | static phys_addr_t __init_memblock | |
102 | __memblock_find_range_bottom_up(phys_addr_t start, phys_addr_t end, | |
103 | phys_addr_t size, phys_addr_t align, int nid) | |
104 | { | |
105 | phys_addr_t this_start, this_end, cand; | |
106 | u64 i; | |
107 | ||
108 | for_each_free_mem_range(i, nid, &this_start, &this_end, NULL) { | |
109 | this_start = clamp(this_start, start, end); | |
110 | this_end = clamp(this_end, start, end); | |
111 | ||
112 | cand = round_up(this_start, align); | |
113 | if (cand < this_end && this_end - cand >= size) | |
114 | return cand; | |
115 | } | |
116 | ||
117 | return 0; | |
118 | } | |
119 | ||
7bd0b0f0 | 120 | /** |
1402899e | 121 | * __memblock_find_range_top_down - find free area utility, in top-down |
7bd0b0f0 TH |
122 | * @start: start of candidate range |
123 | * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE} | |
124 | * @size: size of free area to find | |
125 | * @align: alignment of free area to find | |
126 | * @nid: nid of the free area to find, %MAX_NUMNODES for any node | |
127 | * | |
1402899e | 128 | * Utility called from memblock_find_in_range_node(), find free area top-down. |
7bd0b0f0 TH |
129 | * |
130 | * RETURNS: | |
79442ed1 | 131 | * Found address on success, 0 on failure. |
6ed311b2 | 132 | */ |
1402899e TC |
133 | static phys_addr_t __init_memblock |
134 | __memblock_find_range_top_down(phys_addr_t start, phys_addr_t end, | |
135 | phys_addr_t size, phys_addr_t align, int nid) | |
f7210e6c TC |
136 | { |
137 | phys_addr_t this_start, this_end, cand; | |
138 | u64 i; | |
139 | ||
f7210e6c TC |
140 | for_each_free_mem_range_reverse(i, nid, &this_start, &this_end, NULL) { |
141 | this_start = clamp(this_start, start, end); | |
142 | this_end = clamp(this_end, start, end); | |
143 | ||
144 | if (this_end < size) | |
145 | continue; | |
146 | ||
147 | cand = round_down(this_end - size, align); | |
148 | if (cand >= this_start) | |
149 | return cand; | |
150 | } | |
1402899e | 151 | |
f7210e6c TC |
152 | return 0; |
153 | } | |
6ed311b2 | 154 | |
1402899e TC |
155 | /** |
156 | * memblock_find_in_range_node - find free area in given range and node | |
157 | * @start: start of candidate range | |
158 | * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE} | |
159 | * @size: size of free area to find | |
160 | * @align: alignment of free area to find | |
161 | * @nid: nid of the free area to find, %MAX_NUMNODES for any node | |
162 | * | |
163 | * Find @size free area aligned to @align in the specified range and node. | |
164 | * | |
79442ed1 TC |
165 | * When allocation direction is bottom-up, the @start should be greater |
166 | * than the end of the kernel image. Otherwise, it will be trimmed. The | |
167 | * reason is that we want the bottom-up allocation just near the kernel | |
168 | * image so it is highly likely that the allocated memory and the kernel | |
169 | * will reside in the same node. | |
170 | * | |
171 | * If bottom-up allocation failed, will try to allocate memory top-down. | |
172 | * | |
1402899e | 173 | * RETURNS: |
79442ed1 | 174 | * Found address on success, 0 on failure. |
1402899e TC |
175 | */ |
176 | phys_addr_t __init_memblock memblock_find_in_range_node(phys_addr_t start, | |
177 | phys_addr_t end, phys_addr_t size, | |
178 | phys_addr_t align, int nid) | |
179 | { | |
79442ed1 TC |
180 | int ret; |
181 | phys_addr_t kernel_end; | |
182 | ||
1402899e TC |
183 | /* pump up @end */ |
184 | if (end == MEMBLOCK_ALLOC_ACCESSIBLE) | |
185 | end = memblock.current_limit; | |
186 | ||
187 | /* avoid allocating the first page */ | |
188 | start = max_t(phys_addr_t, start, PAGE_SIZE); | |
189 | end = max(start, end); | |
79442ed1 TC |
190 | kernel_end = __pa_symbol(_end); |
191 | ||
192 | /* | |
193 | * try bottom-up allocation only when bottom-up mode | |
194 | * is set and @end is above the kernel image. | |
195 | */ | |
196 | if (memblock_bottom_up() && end > kernel_end) { | |
197 | phys_addr_t bottom_up_start; | |
198 | ||
199 | /* make sure we will allocate above the kernel */ | |
200 | bottom_up_start = max(start, kernel_end); | |
201 | ||
202 | /* ok, try bottom-up allocation first */ | |
203 | ret = __memblock_find_range_bottom_up(bottom_up_start, end, | |
204 | size, align, nid); | |
205 | if (ret) | |
206 | return ret; | |
207 | ||
208 | /* | |
209 | * we always limit bottom-up allocation above the kernel, | |
210 | * but top-down allocation doesn't have the limit, so | |
211 | * retrying top-down allocation may succeed when bottom-up | |
212 | * allocation failed. | |
213 | * | |
214 | * bottom-up allocation is expected to be fail very rarely, | |
215 | * so we use WARN_ONCE() here to see the stack trace if | |
216 | * fail happens. | |
217 | */ | |
218 | WARN_ONCE(1, "memblock: bottom-up allocation failed, " | |
219 | "memory hotunplug may be affected\n"); | |
220 | } | |
1402899e TC |
221 | |
222 | return __memblock_find_range_top_down(start, end, size, align, nid); | |
223 | } | |
224 | ||
7bd0b0f0 TH |
225 | /** |
226 | * memblock_find_in_range - find free area in given range | |
227 | * @start: start of candidate range | |
228 | * @end: end of candidate range, can be %MEMBLOCK_ALLOC_{ANYWHERE|ACCESSIBLE} | |
229 | * @size: size of free area to find | |
230 | * @align: alignment of free area to find | |
231 | * | |
232 | * Find @size free area aligned to @align in the specified range. | |
233 | * | |
234 | * RETURNS: | |
79442ed1 | 235 | * Found address on success, 0 on failure. |
fc769a8e | 236 | */ |
7bd0b0f0 TH |
237 | phys_addr_t __init_memblock memblock_find_in_range(phys_addr_t start, |
238 | phys_addr_t end, phys_addr_t size, | |
239 | phys_addr_t align) | |
6ed311b2 | 240 | { |
7bd0b0f0 TH |
241 | return memblock_find_in_range_node(start, end, size, align, |
242 | MAX_NUMNODES); | |
6ed311b2 BH |
243 | } |
244 | ||
10d06439 | 245 | static void __init_memblock memblock_remove_region(struct memblock_type *type, unsigned long r) |
95f72d1e | 246 | { |
1440c4e2 | 247 | type->total_size -= type->regions[r].size; |
7c0caeb8 TH |
248 | memmove(&type->regions[r], &type->regions[r + 1], |
249 | (type->cnt - (r + 1)) * sizeof(type->regions[r])); | |
e3239ff9 | 250 | type->cnt--; |
95f72d1e | 251 | |
8f7a6605 BH |
252 | /* Special case for empty arrays */ |
253 | if (type->cnt == 0) { | |
1440c4e2 | 254 | WARN_ON(type->total_size != 0); |
8f7a6605 BH |
255 | type->cnt = 1; |
256 | type->regions[0].base = 0; | |
257 | type->regions[0].size = 0; | |
66a20757 | 258 | type->regions[0].flags = 0; |
7c0caeb8 | 259 | memblock_set_region_node(&type->regions[0], MAX_NUMNODES); |
8f7a6605 | 260 | } |
95f72d1e YL |
261 | } |
262 | ||
29f67386 YL |
263 | phys_addr_t __init_memblock get_allocated_memblock_reserved_regions_info( |
264 | phys_addr_t *addr) | |
265 | { | |
266 | if (memblock.reserved.regions == memblock_reserved_init_regions) | |
267 | return 0; | |
268 | ||
269 | *addr = __pa(memblock.reserved.regions); | |
270 | ||
271 | return PAGE_ALIGN(sizeof(struct memblock_region) * | |
272 | memblock.reserved.max); | |
273 | } | |
274 | ||
48c3b583 GP |
275 | /** |
276 | * memblock_double_array - double the size of the memblock regions array | |
277 | * @type: memblock type of the regions array being doubled | |
278 | * @new_area_start: starting address of memory range to avoid overlap with | |
279 | * @new_area_size: size of memory range to avoid overlap with | |
280 | * | |
281 | * Double the size of the @type regions array. If memblock is being used to | |
282 | * allocate memory for a new reserved regions array and there is a previously | |
283 | * allocated memory range [@new_area_start,@new_area_start+@new_area_size] | |
284 | * waiting to be reserved, ensure the memory used by the new array does | |
285 | * not overlap. | |
286 | * | |
287 | * RETURNS: | |
288 | * 0 on success, -1 on failure. | |
289 | */ | |
290 | static int __init_memblock memblock_double_array(struct memblock_type *type, | |
291 | phys_addr_t new_area_start, | |
292 | phys_addr_t new_area_size) | |
142b45a7 BH |
293 | { |
294 | struct memblock_region *new_array, *old_array; | |
29f67386 | 295 | phys_addr_t old_alloc_size, new_alloc_size; |
142b45a7 BH |
296 | phys_addr_t old_size, new_size, addr; |
297 | int use_slab = slab_is_available(); | |
181eb394 | 298 | int *in_slab; |
142b45a7 BH |
299 | |
300 | /* We don't allow resizing until we know about the reserved regions | |
301 | * of memory that aren't suitable for allocation | |
302 | */ | |
303 | if (!memblock_can_resize) | |
304 | return -1; | |
305 | ||
142b45a7 BH |
306 | /* Calculate new doubled size */ |
307 | old_size = type->max * sizeof(struct memblock_region); | |
308 | new_size = old_size << 1; | |
29f67386 YL |
309 | /* |
310 | * We need to allocated new one align to PAGE_SIZE, | |
311 | * so we can free them completely later. | |
312 | */ | |
313 | old_alloc_size = PAGE_ALIGN(old_size); | |
314 | new_alloc_size = PAGE_ALIGN(new_size); | |
142b45a7 | 315 | |
181eb394 GS |
316 | /* Retrieve the slab flag */ |
317 | if (type == &memblock.memory) | |
318 | in_slab = &memblock_memory_in_slab; | |
319 | else | |
320 | in_slab = &memblock_reserved_in_slab; | |
321 | ||
142b45a7 BH |
322 | /* Try to find some space for it. |
323 | * | |
324 | * WARNING: We assume that either slab_is_available() and we use it or | |
fd07383b AM |
325 | * we use MEMBLOCK for allocations. That means that this is unsafe to |
326 | * use when bootmem is currently active (unless bootmem itself is | |
327 | * implemented on top of MEMBLOCK which isn't the case yet) | |
142b45a7 BH |
328 | * |
329 | * This should however not be an issue for now, as we currently only | |
fd07383b AM |
330 | * call into MEMBLOCK while it's still active, or much later when slab |
331 | * is active for memory hotplug operations | |
142b45a7 BH |
332 | */ |
333 | if (use_slab) { | |
334 | new_array = kmalloc(new_size, GFP_KERNEL); | |
1f5026a7 | 335 | addr = new_array ? __pa(new_array) : 0; |
4e2f0775 | 336 | } else { |
48c3b583 GP |
337 | /* only exclude range when trying to double reserved.regions */ |
338 | if (type != &memblock.reserved) | |
339 | new_area_start = new_area_size = 0; | |
340 | ||
341 | addr = memblock_find_in_range(new_area_start + new_area_size, | |
342 | memblock.current_limit, | |
29f67386 | 343 | new_alloc_size, PAGE_SIZE); |
48c3b583 GP |
344 | if (!addr && new_area_size) |
345 | addr = memblock_find_in_range(0, | |
fd07383b AM |
346 | min(new_area_start, memblock.current_limit), |
347 | new_alloc_size, PAGE_SIZE); | |
48c3b583 | 348 | |
15674868 | 349 | new_array = addr ? __va(addr) : NULL; |
4e2f0775 | 350 | } |
1f5026a7 | 351 | if (!addr) { |
142b45a7 BH |
352 | pr_err("memblock: Failed to double %s array from %ld to %ld entries !\n", |
353 | memblock_type_name(type), type->max, type->max * 2); | |
354 | return -1; | |
355 | } | |
142b45a7 | 356 | |
fd07383b AM |
357 | memblock_dbg("memblock: %s is doubled to %ld at [%#010llx-%#010llx]", |
358 | memblock_type_name(type), type->max * 2, (u64)addr, | |
359 | (u64)addr + new_size - 1); | |
ea9e4376 | 360 | |
fd07383b AM |
361 | /* |
362 | * Found space, we now need to move the array over before we add the | |
363 | * reserved region since it may be our reserved array itself that is | |
364 | * full. | |
142b45a7 BH |
365 | */ |
366 | memcpy(new_array, type->regions, old_size); | |
367 | memset(new_array + type->max, 0, old_size); | |
368 | old_array = type->regions; | |
369 | type->regions = new_array; | |
370 | type->max <<= 1; | |
371 | ||
fd07383b | 372 | /* Free old array. We needn't free it if the array is the static one */ |
181eb394 GS |
373 | if (*in_slab) |
374 | kfree(old_array); | |
375 | else if (old_array != memblock_memory_init_regions && | |
376 | old_array != memblock_reserved_init_regions) | |
29f67386 | 377 | memblock_free(__pa(old_array), old_alloc_size); |
142b45a7 | 378 | |
fd07383b AM |
379 | /* |
380 | * Reserve the new array if that comes from the memblock. Otherwise, we | |
381 | * needn't do it | |
181eb394 GS |
382 | */ |
383 | if (!use_slab) | |
29f67386 | 384 | BUG_ON(memblock_reserve(addr, new_alloc_size)); |
181eb394 GS |
385 | |
386 | /* Update slab flag */ | |
387 | *in_slab = use_slab; | |
388 | ||
142b45a7 BH |
389 | return 0; |
390 | } | |
391 | ||
784656f9 TH |
392 | /** |
393 | * memblock_merge_regions - merge neighboring compatible regions | |
394 | * @type: memblock type to scan | |
395 | * | |
396 | * Scan @type and merge neighboring compatible regions. | |
397 | */ | |
398 | static void __init_memblock memblock_merge_regions(struct memblock_type *type) | |
95f72d1e | 399 | { |
784656f9 | 400 | int i = 0; |
95f72d1e | 401 | |
784656f9 TH |
402 | /* cnt never goes below 1 */ |
403 | while (i < type->cnt - 1) { | |
404 | struct memblock_region *this = &type->regions[i]; | |
405 | struct memblock_region *next = &type->regions[i + 1]; | |
95f72d1e | 406 | |
7c0caeb8 TH |
407 | if (this->base + this->size != next->base || |
408 | memblock_get_region_node(this) != | |
66a20757 TC |
409 | memblock_get_region_node(next) || |
410 | this->flags != next->flags) { | |
784656f9 TH |
411 | BUG_ON(this->base + this->size > next->base); |
412 | i++; | |
413 | continue; | |
8f7a6605 BH |
414 | } |
415 | ||
784656f9 | 416 | this->size += next->size; |
c0232ae8 LF |
417 | /* move forward from next + 1, index of which is i + 2 */ |
418 | memmove(next, next + 1, (type->cnt - (i + 2)) * sizeof(*next)); | |
784656f9 | 419 | type->cnt--; |
95f72d1e | 420 | } |
784656f9 | 421 | } |
95f72d1e | 422 | |
784656f9 TH |
423 | /** |
424 | * memblock_insert_region - insert new memblock region | |
209ff86d TC |
425 | * @type: memblock type to insert into |
426 | * @idx: index for the insertion point | |
427 | * @base: base address of the new region | |
428 | * @size: size of the new region | |
429 | * @nid: node id of the new region | |
66a20757 | 430 | * @flags: flags of the new region |
784656f9 TH |
431 | * |
432 | * Insert new memblock region [@base,@base+@size) into @type at @idx. | |
433 | * @type must already have extra room to accomodate the new region. | |
434 | */ | |
435 | static void __init_memblock memblock_insert_region(struct memblock_type *type, | |
436 | int idx, phys_addr_t base, | |
66a20757 TC |
437 | phys_addr_t size, |
438 | int nid, unsigned long flags) | |
784656f9 TH |
439 | { |
440 | struct memblock_region *rgn = &type->regions[idx]; | |
441 | ||
442 | BUG_ON(type->cnt >= type->max); | |
443 | memmove(rgn + 1, rgn, (type->cnt - idx) * sizeof(*rgn)); | |
444 | rgn->base = base; | |
445 | rgn->size = size; | |
66a20757 | 446 | rgn->flags = flags; |
7c0caeb8 | 447 | memblock_set_region_node(rgn, nid); |
784656f9 | 448 | type->cnt++; |
1440c4e2 | 449 | type->total_size += size; |
784656f9 TH |
450 | } |
451 | ||
452 | /** | |
453 | * memblock_add_region - add new memblock region | |
454 | * @type: memblock type to add new region into | |
455 | * @base: base address of the new region | |
456 | * @size: size of the new region | |
7fb0bc3f | 457 | * @nid: nid of the new region |
66a20757 | 458 | * @flags: flags of the new region |
784656f9 TH |
459 | * |
460 | * Add new memblock region [@base,@base+@size) into @type. The new region | |
461 | * is allowed to overlap with existing ones - overlaps don't affect already | |
462 | * existing regions. @type is guaranteed to be minimal (all neighbouring | |
463 | * compatible regions are merged) after the addition. | |
464 | * | |
465 | * RETURNS: | |
466 | * 0 on success, -errno on failure. | |
467 | */ | |
581adcbe | 468 | static int __init_memblock memblock_add_region(struct memblock_type *type, |
66a20757 TC |
469 | phys_addr_t base, phys_addr_t size, |
470 | int nid, unsigned long flags) | |
784656f9 TH |
471 | { |
472 | bool insert = false; | |
eb18f1b5 TH |
473 | phys_addr_t obase = base; |
474 | phys_addr_t end = base + memblock_cap_size(base, &size); | |
784656f9 TH |
475 | int i, nr_new; |
476 | ||
b3dc627c TH |
477 | if (!size) |
478 | return 0; | |
479 | ||
784656f9 TH |
480 | /* special case for empty array */ |
481 | if (type->regions[0].size == 0) { | |
1440c4e2 | 482 | WARN_ON(type->cnt != 1 || type->total_size); |
8f7a6605 BH |
483 | type->regions[0].base = base; |
484 | type->regions[0].size = size; | |
66a20757 | 485 | type->regions[0].flags = flags; |
7fb0bc3f | 486 | memblock_set_region_node(&type->regions[0], nid); |
1440c4e2 | 487 | type->total_size = size; |
8f7a6605 | 488 | return 0; |
95f72d1e | 489 | } |
784656f9 TH |
490 | repeat: |
491 | /* | |
492 | * The following is executed twice. Once with %false @insert and | |
493 | * then with %true. The first counts the number of regions needed | |
494 | * to accomodate the new area. The second actually inserts them. | |
142b45a7 | 495 | */ |
784656f9 TH |
496 | base = obase; |
497 | nr_new = 0; | |
95f72d1e | 498 | |
784656f9 TH |
499 | for (i = 0; i < type->cnt; i++) { |
500 | struct memblock_region *rgn = &type->regions[i]; | |
501 | phys_addr_t rbase = rgn->base; | |
502 | phys_addr_t rend = rbase + rgn->size; | |
503 | ||
504 | if (rbase >= end) | |
95f72d1e | 505 | break; |
784656f9 TH |
506 | if (rend <= base) |
507 | continue; | |
508 | /* | |
509 | * @rgn overlaps. If it separates the lower part of new | |
510 | * area, insert that portion. | |
511 | */ | |
512 | if (rbase > base) { | |
513 | nr_new++; | |
514 | if (insert) | |
515 | memblock_insert_region(type, i++, base, | |
66a20757 TC |
516 | rbase - base, nid, |
517 | flags); | |
95f72d1e | 518 | } |
784656f9 TH |
519 | /* area below @rend is dealt with, forget about it */ |
520 | base = min(rend, end); | |
95f72d1e | 521 | } |
784656f9 TH |
522 | |
523 | /* insert the remaining portion */ | |
524 | if (base < end) { | |
525 | nr_new++; | |
526 | if (insert) | |
66a20757 TC |
527 | memblock_insert_region(type, i, base, end - base, |
528 | nid, flags); | |
95f72d1e | 529 | } |
95f72d1e | 530 | |
784656f9 TH |
531 | /* |
532 | * If this was the first round, resize array and repeat for actual | |
533 | * insertions; otherwise, merge and return. | |
142b45a7 | 534 | */ |
784656f9 TH |
535 | if (!insert) { |
536 | while (type->cnt + nr_new > type->max) | |
48c3b583 | 537 | if (memblock_double_array(type, obase, size) < 0) |
784656f9 TH |
538 | return -ENOMEM; |
539 | insert = true; | |
540 | goto repeat; | |
541 | } else { | |
542 | memblock_merge_regions(type); | |
543 | return 0; | |
142b45a7 | 544 | } |
95f72d1e YL |
545 | } |
546 | ||
7fb0bc3f TH |
547 | int __init_memblock memblock_add_node(phys_addr_t base, phys_addr_t size, |
548 | int nid) | |
549 | { | |
66a20757 | 550 | return memblock_add_region(&memblock.memory, base, size, nid, 0); |
7fb0bc3f TH |
551 | } |
552 | ||
581adcbe | 553 | int __init_memblock memblock_add(phys_addr_t base, phys_addr_t size) |
95f72d1e | 554 | { |
66a20757 TC |
555 | return memblock_add_region(&memblock.memory, base, size, |
556 | MAX_NUMNODES, 0); | |
95f72d1e YL |
557 | } |
558 | ||
6a9ceb31 TH |
559 | /** |
560 | * memblock_isolate_range - isolate given range into disjoint memblocks | |
561 | * @type: memblock type to isolate range for | |
562 | * @base: base of range to isolate | |
563 | * @size: size of range to isolate | |
564 | * @start_rgn: out parameter for the start of isolated region | |
565 | * @end_rgn: out parameter for the end of isolated region | |
566 | * | |
567 | * Walk @type and ensure that regions don't cross the boundaries defined by | |
568 | * [@base,@base+@size). Crossing regions are split at the boundaries, | |
569 | * which may create at most two more regions. The index of the first | |
570 | * region inside the range is returned in *@start_rgn and end in *@end_rgn. | |
571 | * | |
572 | * RETURNS: | |
573 | * 0 on success, -errno on failure. | |
574 | */ | |
575 | static int __init_memblock memblock_isolate_range(struct memblock_type *type, | |
576 | phys_addr_t base, phys_addr_t size, | |
577 | int *start_rgn, int *end_rgn) | |
578 | { | |
eb18f1b5 | 579 | phys_addr_t end = base + memblock_cap_size(base, &size); |
6a9ceb31 TH |
580 | int i; |
581 | ||
582 | *start_rgn = *end_rgn = 0; | |
583 | ||
b3dc627c TH |
584 | if (!size) |
585 | return 0; | |
586 | ||
6a9ceb31 TH |
587 | /* we'll create at most two more regions */ |
588 | while (type->cnt + 2 > type->max) | |
48c3b583 | 589 | if (memblock_double_array(type, base, size) < 0) |
6a9ceb31 TH |
590 | return -ENOMEM; |
591 | ||
592 | for (i = 0; i < type->cnt; i++) { | |
593 | struct memblock_region *rgn = &type->regions[i]; | |
594 | phys_addr_t rbase = rgn->base; | |
595 | phys_addr_t rend = rbase + rgn->size; | |
596 | ||
597 | if (rbase >= end) | |
598 | break; | |
599 | if (rend <= base) | |
600 | continue; | |
601 | ||
602 | if (rbase < base) { | |
603 | /* | |
604 | * @rgn intersects from below. Split and continue | |
605 | * to process the next region - the new top half. | |
606 | */ | |
607 | rgn->base = base; | |
1440c4e2 TH |
608 | rgn->size -= base - rbase; |
609 | type->total_size -= base - rbase; | |
6a9ceb31 | 610 | memblock_insert_region(type, i, rbase, base - rbase, |
66a20757 TC |
611 | memblock_get_region_node(rgn), |
612 | rgn->flags); | |
6a9ceb31 TH |
613 | } else if (rend > end) { |
614 | /* | |
615 | * @rgn intersects from above. Split and redo the | |
616 | * current region - the new bottom half. | |
617 | */ | |
618 | rgn->base = end; | |
1440c4e2 TH |
619 | rgn->size -= end - rbase; |
620 | type->total_size -= end - rbase; | |
6a9ceb31 | 621 | memblock_insert_region(type, i--, rbase, end - rbase, |
66a20757 TC |
622 | memblock_get_region_node(rgn), |
623 | rgn->flags); | |
6a9ceb31 TH |
624 | } else { |
625 | /* @rgn is fully contained, record it */ | |
626 | if (!*end_rgn) | |
627 | *start_rgn = i; | |
628 | *end_rgn = i + 1; | |
629 | } | |
630 | } | |
631 | ||
632 | return 0; | |
633 | } | |
6a9ceb31 | 634 | |
581adcbe TH |
635 | static int __init_memblock __memblock_remove(struct memblock_type *type, |
636 | phys_addr_t base, phys_addr_t size) | |
95f72d1e | 637 | { |
71936180 TH |
638 | int start_rgn, end_rgn; |
639 | int i, ret; | |
95f72d1e | 640 | |
71936180 TH |
641 | ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn); |
642 | if (ret) | |
643 | return ret; | |
95f72d1e | 644 | |
71936180 TH |
645 | for (i = end_rgn - 1; i >= start_rgn; i--) |
646 | memblock_remove_region(type, i); | |
8f7a6605 | 647 | return 0; |
95f72d1e YL |
648 | } |
649 | ||
581adcbe | 650 | int __init_memblock memblock_remove(phys_addr_t base, phys_addr_t size) |
95f72d1e YL |
651 | { |
652 | return __memblock_remove(&memblock.memory, base, size); | |
653 | } | |
654 | ||
581adcbe | 655 | int __init_memblock memblock_free(phys_addr_t base, phys_addr_t size) |
95f72d1e | 656 | { |
24aa0788 | 657 | memblock_dbg(" memblock_free: [%#016llx-%#016llx] %pF\n", |
a150439c | 658 | (unsigned long long)base, |
931d13f5 | 659 | (unsigned long long)base + size - 1, |
a150439c | 660 | (void *)_RET_IP_); |
24aa0788 | 661 | |
95f72d1e YL |
662 | return __memblock_remove(&memblock.reserved, base, size); |
663 | } | |
664 | ||
66a20757 TC |
665 | static int __init_memblock memblock_reserve_region(phys_addr_t base, |
666 | phys_addr_t size, | |
667 | int nid, | |
668 | unsigned long flags) | |
95f72d1e | 669 | { |
e3239ff9 | 670 | struct memblock_type *_rgn = &memblock.reserved; |
95f72d1e | 671 | |
66a20757 | 672 | memblock_dbg("memblock_reserve: [%#016llx-%#016llx] flags %#02lx %pF\n", |
a150439c | 673 | (unsigned long long)base, |
931d13f5 | 674 | (unsigned long long)base + size - 1, |
66a20757 TC |
675 | flags, (void *)_RET_IP_); |
676 | ||
677 | return memblock_add_region(_rgn, base, size, nid, flags); | |
678 | } | |
95f72d1e | 679 | |
66a20757 TC |
680 | int __init_memblock memblock_reserve(phys_addr_t base, phys_addr_t size) |
681 | { | |
682 | return memblock_reserve_region(base, size, MAX_NUMNODES, 0); | |
95f72d1e YL |
683 | } |
684 | ||
66b16edf TC |
685 | /** |
686 | * memblock_mark_hotplug - Mark hotpluggable memory with flag MEMBLOCK_HOTPLUG. | |
687 | * @base: the base phys addr of the region | |
688 | * @size: the size of the region | |
689 | * | |
690 | * This function isolates region [@base, @base + @size), and mark it with flag | |
691 | * MEMBLOCK_HOTPLUG. | |
692 | * | |
693 | * Return 0 on succees, -errno on failure. | |
694 | */ | |
695 | int __init_memblock memblock_mark_hotplug(phys_addr_t base, phys_addr_t size) | |
696 | { | |
697 | struct memblock_type *type = &memblock.memory; | |
698 | int i, ret, start_rgn, end_rgn; | |
699 | ||
700 | ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn); | |
701 | if (ret) | |
702 | return ret; | |
703 | ||
704 | for (i = start_rgn; i < end_rgn; i++) | |
705 | memblock_set_region_flags(&type->regions[i], MEMBLOCK_HOTPLUG); | |
706 | ||
707 | memblock_merge_regions(type); | |
708 | return 0; | |
709 | } | |
710 | ||
711 | /** | |
712 | * memblock_clear_hotplug - Clear flag MEMBLOCK_HOTPLUG for a specified region. | |
713 | * @base: the base phys addr of the region | |
714 | * @size: the size of the region | |
715 | * | |
716 | * This function isolates region [@base, @base + @size), and clear flag | |
717 | * MEMBLOCK_HOTPLUG for the isolated regions. | |
718 | * | |
719 | * Return 0 on succees, -errno on failure. | |
720 | */ | |
721 | int __init_memblock memblock_clear_hotplug(phys_addr_t base, phys_addr_t size) | |
722 | { | |
723 | struct memblock_type *type = &memblock.memory; | |
724 | int i, ret, start_rgn, end_rgn; | |
725 | ||
726 | ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn); | |
727 | if (ret) | |
728 | return ret; | |
729 | ||
730 | for (i = start_rgn; i < end_rgn; i++) | |
731 | memblock_clear_region_flags(&type->regions[i], | |
732 | MEMBLOCK_HOTPLUG); | |
733 | ||
734 | memblock_merge_regions(type); | |
735 | return 0; | |
736 | } | |
737 | ||
35fd0808 TH |
738 | /** |
739 | * __next_free_mem_range - next function for for_each_free_mem_range() | |
740 | * @idx: pointer to u64 loop variable | |
d8bbdd77 | 741 | * @nid: node selector, %MAX_NUMNODES for all nodes |
dad7557e WL |
742 | * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL |
743 | * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL | |
744 | * @out_nid: ptr to int for nid of the range, can be %NULL | |
35fd0808 TH |
745 | * |
746 | * Find the first free area from *@idx which matches @nid, fill the out | |
747 | * parameters, and update *@idx for the next iteration. The lower 32bit of | |
748 | * *@idx contains index into memory region and the upper 32bit indexes the | |
749 | * areas before each reserved region. For example, if reserved regions | |
750 | * look like the following, | |
751 | * | |
752 | * 0:[0-16), 1:[32-48), 2:[128-130) | |
753 | * | |
754 | * The upper 32bit indexes the following regions. | |
755 | * | |
756 | * 0:[0-0), 1:[16-32), 2:[48-128), 3:[130-MAX) | |
757 | * | |
758 | * As both region arrays are sorted, the function advances the two indices | |
759 | * in lockstep and returns each intersection. | |
760 | */ | |
761 | void __init_memblock __next_free_mem_range(u64 *idx, int nid, | |
762 | phys_addr_t *out_start, | |
763 | phys_addr_t *out_end, int *out_nid) | |
764 | { | |
765 | struct memblock_type *mem = &memblock.memory; | |
766 | struct memblock_type *rsv = &memblock.reserved; | |
767 | int mi = *idx & 0xffffffff; | |
768 | int ri = *idx >> 32; | |
769 | ||
770 | for ( ; mi < mem->cnt; mi++) { | |
771 | struct memblock_region *m = &mem->regions[mi]; | |
772 | phys_addr_t m_start = m->base; | |
773 | phys_addr_t m_end = m->base + m->size; | |
774 | ||
775 | /* only memory regions are associated with nodes, check it */ | |
776 | if (nid != MAX_NUMNODES && nid != memblock_get_region_node(m)) | |
777 | continue; | |
778 | ||
779 | /* scan areas before each reservation for intersection */ | |
780 | for ( ; ri < rsv->cnt + 1; ri++) { | |
781 | struct memblock_region *r = &rsv->regions[ri]; | |
782 | phys_addr_t r_start = ri ? r[-1].base + r[-1].size : 0; | |
783 | phys_addr_t r_end = ri < rsv->cnt ? r->base : ULLONG_MAX; | |
784 | ||
785 | /* if ri advanced past mi, break out to advance mi */ | |
786 | if (r_start >= m_end) | |
787 | break; | |
788 | /* if the two regions intersect, we're done */ | |
789 | if (m_start < r_end) { | |
790 | if (out_start) | |
791 | *out_start = max(m_start, r_start); | |
792 | if (out_end) | |
793 | *out_end = min(m_end, r_end); | |
794 | if (out_nid) | |
795 | *out_nid = memblock_get_region_node(m); | |
796 | /* | |
797 | * The region which ends first is advanced | |
798 | * for the next iteration. | |
799 | */ | |
800 | if (m_end <= r_end) | |
801 | mi++; | |
802 | else | |
803 | ri++; | |
804 | *idx = (u32)mi | (u64)ri << 32; | |
805 | return; | |
806 | } | |
807 | } | |
808 | } | |
809 | ||
810 | /* signal end of iteration */ | |
811 | *idx = ULLONG_MAX; | |
812 | } | |
813 | ||
7bd0b0f0 TH |
814 | /** |
815 | * __next_free_mem_range_rev - next function for for_each_free_mem_range_reverse() | |
816 | * @idx: pointer to u64 loop variable | |
817 | * @nid: nid: node selector, %MAX_NUMNODES for all nodes | |
dad7557e WL |
818 | * @out_start: ptr to phys_addr_t for start address of the range, can be %NULL |
819 | * @out_end: ptr to phys_addr_t for end address of the range, can be %NULL | |
820 | * @out_nid: ptr to int for nid of the range, can be %NULL | |
7bd0b0f0 TH |
821 | * |
822 | * Reverse of __next_free_mem_range(). | |
823 | */ | |
824 | void __init_memblock __next_free_mem_range_rev(u64 *idx, int nid, | |
825 | phys_addr_t *out_start, | |
826 | phys_addr_t *out_end, int *out_nid) | |
827 | { | |
828 | struct memblock_type *mem = &memblock.memory; | |
829 | struct memblock_type *rsv = &memblock.reserved; | |
830 | int mi = *idx & 0xffffffff; | |
831 | int ri = *idx >> 32; | |
832 | ||
833 | if (*idx == (u64)ULLONG_MAX) { | |
834 | mi = mem->cnt - 1; | |
835 | ri = rsv->cnt; | |
836 | } | |
837 | ||
838 | for ( ; mi >= 0; mi--) { | |
839 | struct memblock_region *m = &mem->regions[mi]; | |
840 | phys_addr_t m_start = m->base; | |
841 | phys_addr_t m_end = m->base + m->size; | |
842 | ||
843 | /* only memory regions are associated with nodes, check it */ | |
844 | if (nid != MAX_NUMNODES && nid != memblock_get_region_node(m)) | |
845 | continue; | |
846 | ||
847 | /* scan areas before each reservation for intersection */ | |
848 | for ( ; ri >= 0; ri--) { | |
849 | struct memblock_region *r = &rsv->regions[ri]; | |
850 | phys_addr_t r_start = ri ? r[-1].base + r[-1].size : 0; | |
851 | phys_addr_t r_end = ri < rsv->cnt ? r->base : ULLONG_MAX; | |
852 | ||
853 | /* if ri advanced past mi, break out to advance mi */ | |
854 | if (r_end <= m_start) | |
855 | break; | |
856 | /* if the two regions intersect, we're done */ | |
857 | if (m_end > r_start) { | |
858 | if (out_start) | |
859 | *out_start = max(m_start, r_start); | |
860 | if (out_end) | |
861 | *out_end = min(m_end, r_end); | |
862 | if (out_nid) | |
863 | *out_nid = memblock_get_region_node(m); | |
864 | ||
865 | if (m_start >= r_start) | |
866 | mi--; | |
867 | else | |
868 | ri--; | |
869 | *idx = (u32)mi | (u64)ri << 32; | |
870 | return; | |
871 | } | |
872 | } | |
873 | } | |
874 | ||
875 | *idx = ULLONG_MAX; | |
876 | } | |
877 | ||
7c0caeb8 TH |
878 | #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP |
879 | /* | |
880 | * Common iterator interface used to define for_each_mem_range(). | |
881 | */ | |
882 | void __init_memblock __next_mem_pfn_range(int *idx, int nid, | |
883 | unsigned long *out_start_pfn, | |
884 | unsigned long *out_end_pfn, int *out_nid) | |
885 | { | |
886 | struct memblock_type *type = &memblock.memory; | |
887 | struct memblock_region *r; | |
888 | ||
889 | while (++*idx < type->cnt) { | |
890 | r = &type->regions[*idx]; | |
891 | ||
892 | if (PFN_UP(r->base) >= PFN_DOWN(r->base + r->size)) | |
893 | continue; | |
894 | if (nid == MAX_NUMNODES || nid == r->nid) | |
895 | break; | |
896 | } | |
897 | if (*idx >= type->cnt) { | |
898 | *idx = -1; | |
899 | return; | |
900 | } | |
901 | ||
902 | if (out_start_pfn) | |
903 | *out_start_pfn = PFN_UP(r->base); | |
904 | if (out_end_pfn) | |
905 | *out_end_pfn = PFN_DOWN(r->base + r->size); | |
906 | if (out_nid) | |
907 | *out_nid = r->nid; | |
908 | } | |
909 | ||
910 | /** | |
911 | * memblock_set_node - set node ID on memblock regions | |
912 | * @base: base of area to set node ID for | |
913 | * @size: size of area to set node ID for | |
914 | * @nid: node ID to set | |
915 | * | |
916 | * Set the nid of memblock memory regions in [@base,@base+@size) to @nid. | |
917 | * Regions which cross the area boundaries are split as necessary. | |
918 | * | |
919 | * RETURNS: | |
920 | * 0 on success, -errno on failure. | |
921 | */ | |
922 | int __init_memblock memblock_set_node(phys_addr_t base, phys_addr_t size, | |
923 | int nid) | |
924 | { | |
925 | struct memblock_type *type = &memblock.memory; | |
6a9ceb31 TH |
926 | int start_rgn, end_rgn; |
927 | int i, ret; | |
7c0caeb8 | 928 | |
6a9ceb31 TH |
929 | ret = memblock_isolate_range(type, base, size, &start_rgn, &end_rgn); |
930 | if (ret) | |
931 | return ret; | |
7c0caeb8 | 932 | |
6a9ceb31 | 933 | for (i = start_rgn; i < end_rgn; i++) |
e9d24ad3 | 934 | memblock_set_region_node(&type->regions[i], nid); |
7c0caeb8 TH |
935 | |
936 | memblock_merge_regions(type); | |
937 | return 0; | |
938 | } | |
939 | #endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */ | |
940 | ||
7bd0b0f0 TH |
941 | static phys_addr_t __init memblock_alloc_base_nid(phys_addr_t size, |
942 | phys_addr_t align, phys_addr_t max_addr, | |
943 | int nid) | |
95f72d1e | 944 | { |
6ed311b2 | 945 | phys_addr_t found; |
95f72d1e | 946 | |
94f3d3af VG |
947 | if (WARN_ON(!align)) |
948 | align = __alignof__(long long); | |
949 | ||
847854f5 TH |
950 | /* align @size to avoid excessive fragmentation on reserved array */ |
951 | size = round_up(size, align); | |
952 | ||
7bd0b0f0 | 953 | found = memblock_find_in_range_node(0, max_addr, size, align, nid); |
9c8c27e2 | 954 | if (found && !memblock_reserve(found, size)) |
6ed311b2 | 955 | return found; |
95f72d1e | 956 | |
6ed311b2 | 957 | return 0; |
95f72d1e YL |
958 | } |
959 | ||
7bd0b0f0 TH |
960 | phys_addr_t __init memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid) |
961 | { | |
962 | return memblock_alloc_base_nid(size, align, MEMBLOCK_ALLOC_ACCESSIBLE, nid); | |
963 | } | |
964 | ||
965 | phys_addr_t __init __memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) | |
966 | { | |
967 | return memblock_alloc_base_nid(size, align, max_addr, MAX_NUMNODES); | |
968 | } | |
969 | ||
6ed311b2 | 970 | phys_addr_t __init memblock_alloc_base(phys_addr_t size, phys_addr_t align, phys_addr_t max_addr) |
95f72d1e | 971 | { |
6ed311b2 BH |
972 | phys_addr_t alloc; |
973 | ||
974 | alloc = __memblock_alloc_base(size, align, max_addr); | |
975 | ||
976 | if (alloc == 0) | |
977 | panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n", | |
978 | (unsigned long long) size, (unsigned long long) max_addr); | |
979 | ||
980 | return alloc; | |
95f72d1e YL |
981 | } |
982 | ||
6ed311b2 | 983 | phys_addr_t __init memblock_alloc(phys_addr_t size, phys_addr_t align) |
95f72d1e | 984 | { |
6ed311b2 BH |
985 | return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE); |
986 | } | |
95f72d1e | 987 | |
9d1e2492 BH |
988 | phys_addr_t __init memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid) |
989 | { | |
990 | phys_addr_t res = memblock_alloc_nid(size, align, nid); | |
991 | ||
992 | if (res) | |
993 | return res; | |
15fb0972 | 994 | return memblock_alloc_base(size, align, MEMBLOCK_ALLOC_ACCESSIBLE); |
95f72d1e YL |
995 | } |
996 | ||
9d1e2492 BH |
997 | |
998 | /* | |
999 | * Remaining API functions | |
1000 | */ | |
1001 | ||
2898cc4c | 1002 | phys_addr_t __init memblock_phys_mem_size(void) |
95f72d1e | 1003 | { |
1440c4e2 | 1004 | return memblock.memory.total_size; |
95f72d1e YL |
1005 | } |
1006 | ||
595ad9af YL |
1007 | phys_addr_t __init memblock_mem_size(unsigned long limit_pfn) |
1008 | { | |
1009 | unsigned long pages = 0; | |
1010 | struct memblock_region *r; | |
1011 | unsigned long start_pfn, end_pfn; | |
1012 | ||
1013 | for_each_memblock(memory, r) { | |
1014 | start_pfn = memblock_region_memory_base_pfn(r); | |
1015 | end_pfn = memblock_region_memory_end_pfn(r); | |
1016 | start_pfn = min_t(unsigned long, start_pfn, limit_pfn); | |
1017 | end_pfn = min_t(unsigned long, end_pfn, limit_pfn); | |
1018 | pages += end_pfn - start_pfn; | |
1019 | } | |
1020 | ||
1021 | return (phys_addr_t)pages << PAGE_SHIFT; | |
1022 | } | |
1023 | ||
0a93ebef SR |
1024 | /* lowest address */ |
1025 | phys_addr_t __init_memblock memblock_start_of_DRAM(void) | |
1026 | { | |
1027 | return memblock.memory.regions[0].base; | |
1028 | } | |
1029 | ||
10d06439 | 1030 | phys_addr_t __init_memblock memblock_end_of_DRAM(void) |
95f72d1e YL |
1031 | { |
1032 | int idx = memblock.memory.cnt - 1; | |
1033 | ||
e3239ff9 | 1034 | return (memblock.memory.regions[idx].base + memblock.memory.regions[idx].size); |
95f72d1e YL |
1035 | } |
1036 | ||
c0ce8fef | 1037 | void __init memblock_enforce_memory_limit(phys_addr_t limit) |
95f72d1e YL |
1038 | { |
1039 | unsigned long i; | |
c0ce8fef | 1040 | phys_addr_t max_addr = (phys_addr_t)ULLONG_MAX; |
95f72d1e | 1041 | |
c0ce8fef | 1042 | if (!limit) |
95f72d1e YL |
1043 | return; |
1044 | ||
c0ce8fef | 1045 | /* find out max address */ |
95f72d1e | 1046 | for (i = 0; i < memblock.memory.cnt; i++) { |
c0ce8fef | 1047 | struct memblock_region *r = &memblock.memory.regions[i]; |
95f72d1e | 1048 | |
c0ce8fef TH |
1049 | if (limit <= r->size) { |
1050 | max_addr = r->base + limit; | |
1051 | break; | |
95f72d1e | 1052 | } |
c0ce8fef | 1053 | limit -= r->size; |
95f72d1e | 1054 | } |
c0ce8fef TH |
1055 | |
1056 | /* truncate both memory and reserved regions */ | |
1057 | __memblock_remove(&memblock.memory, max_addr, (phys_addr_t)ULLONG_MAX); | |
1058 | __memblock_remove(&memblock.reserved, max_addr, (phys_addr_t)ULLONG_MAX); | |
95f72d1e YL |
1059 | } |
1060 | ||
cd79481d | 1061 | static int __init_memblock memblock_search(struct memblock_type *type, phys_addr_t addr) |
72d4b0b4 BH |
1062 | { |
1063 | unsigned int left = 0, right = type->cnt; | |
1064 | ||
1065 | do { | |
1066 | unsigned int mid = (right + left) / 2; | |
1067 | ||
1068 | if (addr < type->regions[mid].base) | |
1069 | right = mid; | |
1070 | else if (addr >= (type->regions[mid].base + | |
1071 | type->regions[mid].size)) | |
1072 | left = mid + 1; | |
1073 | else | |
1074 | return mid; | |
1075 | } while (left < right); | |
1076 | return -1; | |
1077 | } | |
1078 | ||
2898cc4c | 1079 | int __init memblock_is_reserved(phys_addr_t addr) |
95f72d1e | 1080 | { |
72d4b0b4 BH |
1081 | return memblock_search(&memblock.reserved, addr) != -1; |
1082 | } | |
95f72d1e | 1083 | |
3661ca66 | 1084 | int __init_memblock memblock_is_memory(phys_addr_t addr) |
72d4b0b4 BH |
1085 | { |
1086 | return memblock_search(&memblock.memory, addr) != -1; | |
1087 | } | |
1088 | ||
e76b63f8 YL |
1089 | #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP |
1090 | int __init_memblock memblock_search_pfn_nid(unsigned long pfn, | |
1091 | unsigned long *start_pfn, unsigned long *end_pfn) | |
1092 | { | |
1093 | struct memblock_type *type = &memblock.memory; | |
1094 | int mid = memblock_search(type, (phys_addr_t)pfn << PAGE_SHIFT); | |
1095 | ||
1096 | if (mid == -1) | |
1097 | return -1; | |
1098 | ||
1099 | *start_pfn = type->regions[mid].base >> PAGE_SHIFT; | |
1100 | *end_pfn = (type->regions[mid].base + type->regions[mid].size) | |
1101 | >> PAGE_SHIFT; | |
1102 | ||
1103 | return type->regions[mid].nid; | |
1104 | } | |
1105 | #endif | |
1106 | ||
eab30949 SB |
1107 | /** |
1108 | * memblock_is_region_memory - check if a region is a subset of memory | |
1109 | * @base: base of region to check | |
1110 | * @size: size of region to check | |
1111 | * | |
1112 | * Check if the region [@base, @base+@size) is a subset of a memory block. | |
1113 | * | |
1114 | * RETURNS: | |
1115 | * 0 if false, non-zero if true | |
1116 | */ | |
3661ca66 | 1117 | int __init_memblock memblock_is_region_memory(phys_addr_t base, phys_addr_t size) |
72d4b0b4 | 1118 | { |
abb65272 | 1119 | int idx = memblock_search(&memblock.memory, base); |
eb18f1b5 | 1120 | phys_addr_t end = base + memblock_cap_size(base, &size); |
72d4b0b4 BH |
1121 | |
1122 | if (idx == -1) | |
1123 | return 0; | |
abb65272 TV |
1124 | return memblock.memory.regions[idx].base <= base && |
1125 | (memblock.memory.regions[idx].base + | |
eb18f1b5 | 1126 | memblock.memory.regions[idx].size) >= end; |
95f72d1e YL |
1127 | } |
1128 | ||
eab30949 SB |
1129 | /** |
1130 | * memblock_is_region_reserved - check if a region intersects reserved memory | |
1131 | * @base: base of region to check | |
1132 | * @size: size of region to check | |
1133 | * | |
1134 | * Check if the region [@base, @base+@size) intersects a reserved memory block. | |
1135 | * | |
1136 | * RETURNS: | |
1137 | * 0 if false, non-zero if true | |
1138 | */ | |
10d06439 | 1139 | int __init_memblock memblock_is_region_reserved(phys_addr_t base, phys_addr_t size) |
95f72d1e | 1140 | { |
eb18f1b5 | 1141 | memblock_cap_size(base, &size); |
f1c2c19c | 1142 | return memblock_overlaps_region(&memblock.reserved, base, size) >= 0; |
95f72d1e YL |
1143 | } |
1144 | ||
6ede1fd3 YL |
1145 | void __init_memblock memblock_trim_memory(phys_addr_t align) |
1146 | { | |
1147 | int i; | |
1148 | phys_addr_t start, end, orig_start, orig_end; | |
1149 | struct memblock_type *mem = &memblock.memory; | |
1150 | ||
1151 | for (i = 0; i < mem->cnt; i++) { | |
1152 | orig_start = mem->regions[i].base; | |
1153 | orig_end = mem->regions[i].base + mem->regions[i].size; | |
1154 | start = round_up(orig_start, align); | |
1155 | end = round_down(orig_end, align); | |
1156 | ||
1157 | if (start == orig_start && end == orig_end) | |
1158 | continue; | |
1159 | ||
1160 | if (start < end) { | |
1161 | mem->regions[i].base = start; | |
1162 | mem->regions[i].size = end - start; | |
1163 | } else { | |
1164 | memblock_remove_region(mem, i); | |
1165 | i--; | |
1166 | } | |
1167 | } | |
1168 | } | |
e63075a3 | 1169 | |
3661ca66 | 1170 | void __init_memblock memblock_set_current_limit(phys_addr_t limit) |
e63075a3 BH |
1171 | { |
1172 | memblock.current_limit = limit; | |
1173 | } | |
1174 | ||
7c0caeb8 | 1175 | static void __init_memblock memblock_dump(struct memblock_type *type, char *name) |
6ed311b2 BH |
1176 | { |
1177 | unsigned long long base, size; | |
66a20757 | 1178 | unsigned long flags; |
6ed311b2 BH |
1179 | int i; |
1180 | ||
7c0caeb8 | 1181 | pr_info(" %s.cnt = 0x%lx\n", name, type->cnt); |
6ed311b2 | 1182 | |
7c0caeb8 TH |
1183 | for (i = 0; i < type->cnt; i++) { |
1184 | struct memblock_region *rgn = &type->regions[i]; | |
1185 | char nid_buf[32] = ""; | |
1186 | ||
1187 | base = rgn->base; | |
1188 | size = rgn->size; | |
66a20757 | 1189 | flags = rgn->flags; |
7c0caeb8 TH |
1190 | #ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP |
1191 | if (memblock_get_region_node(rgn) != MAX_NUMNODES) | |
1192 | snprintf(nid_buf, sizeof(nid_buf), " on node %d", | |
1193 | memblock_get_region_node(rgn)); | |
1194 | #endif | |
66a20757 TC |
1195 | pr_info(" %s[%#x]\t[%#016llx-%#016llx], %#llx bytes%s flags: %#lx\n", |
1196 | name, i, base, base + size - 1, size, nid_buf, flags); | |
6ed311b2 BH |
1197 | } |
1198 | } | |
1199 | ||
4ff7b82f | 1200 | void __init_memblock __memblock_dump_all(void) |
6ed311b2 | 1201 | { |
6ed311b2 | 1202 | pr_info("MEMBLOCK configuration:\n"); |
1440c4e2 TH |
1203 | pr_info(" memory size = %#llx reserved size = %#llx\n", |
1204 | (unsigned long long)memblock.memory.total_size, | |
1205 | (unsigned long long)memblock.reserved.total_size); | |
6ed311b2 BH |
1206 | |
1207 | memblock_dump(&memblock.memory, "memory"); | |
1208 | memblock_dump(&memblock.reserved, "reserved"); | |
1209 | } | |
1210 | ||
1aadc056 | 1211 | void __init memblock_allow_resize(void) |
6ed311b2 | 1212 | { |
142b45a7 | 1213 | memblock_can_resize = 1; |
6ed311b2 BH |
1214 | } |
1215 | ||
6ed311b2 BH |
1216 | static int __init early_memblock(char *p) |
1217 | { | |
1218 | if (p && strstr(p, "debug")) | |
1219 | memblock_debug = 1; | |
1220 | return 0; | |
1221 | } | |
1222 | early_param("memblock", early_memblock); | |
1223 | ||
c378ddd5 | 1224 | #if defined(CONFIG_DEBUG_FS) && !defined(CONFIG_ARCH_DISCARD_MEMBLOCK) |
6d03b885 BH |
1225 | |
1226 | static int memblock_debug_show(struct seq_file *m, void *private) | |
1227 | { | |
1228 | struct memblock_type *type = m->private; | |
1229 | struct memblock_region *reg; | |
1230 | int i; | |
1231 | ||
1232 | for (i = 0; i < type->cnt; i++) { | |
1233 | reg = &type->regions[i]; | |
1234 | seq_printf(m, "%4d: ", i); | |
1235 | if (sizeof(phys_addr_t) == 4) | |
1236 | seq_printf(m, "0x%08lx..0x%08lx\n", | |
1237 | (unsigned long)reg->base, | |
1238 | (unsigned long)(reg->base + reg->size - 1)); | |
1239 | else | |
1240 | seq_printf(m, "0x%016llx..0x%016llx\n", | |
1241 | (unsigned long long)reg->base, | |
1242 | (unsigned long long)(reg->base + reg->size - 1)); | |
1243 | ||
1244 | } | |
1245 | return 0; | |
1246 | } | |
1247 | ||
1248 | static int memblock_debug_open(struct inode *inode, struct file *file) | |
1249 | { | |
1250 | return single_open(file, memblock_debug_show, inode->i_private); | |
1251 | } | |
1252 | ||
1253 | static const struct file_operations memblock_debug_fops = { | |
1254 | .open = memblock_debug_open, | |
1255 | .read = seq_read, | |
1256 | .llseek = seq_lseek, | |
1257 | .release = single_release, | |
1258 | }; | |
1259 | ||
1260 | static int __init memblock_init_debugfs(void) | |
1261 | { | |
1262 | struct dentry *root = debugfs_create_dir("memblock", NULL); | |
1263 | if (!root) | |
1264 | return -ENXIO; | |
1265 | debugfs_create_file("memory", S_IRUGO, root, &memblock.memory, &memblock_debug_fops); | |
1266 | debugfs_create_file("reserved", S_IRUGO, root, &memblock.reserved, &memblock_debug_fops); | |
1267 | ||
1268 | return 0; | |
1269 | } | |
1270 | __initcall(memblock_init_debugfs); | |
1271 | ||
1272 | #endif /* CONFIG_DEBUG_FS */ |