1 #include <linux/kernel.h>
2 #include <linux/types.h>
3 #include <linux/init.h>
4 #include <linux/bitops.h>
5 #include <linux/memblock.h>
6 #include <linux/bootmem.h>
8 #include <linux/range.h>
10 /* Check for already reserved areas */
11 static inline bool __init bad_addr_size(u64 *addrp, u64 *sizep, u64 align)
13 struct memblock_region *r;
14 u64 addr = *addrp, last;
20 for_each_memblock(reserved, r) {
21 if (last > r->base && addr < r->base) {
22 size = r->base - addr;
26 if (last > (r->base + r->size) && addr < (r->base + r->size)) {
27 addr = round_up(r->base + r->size, align);
32 if (last <= (r->base + r->size) && addr >= r->base) {
44 static u64 __init __memblock_x86_find_in_range_size(u64 ei_start, u64 ei_last, u64 start,
45 u64 *sizep, u64 align)
49 addr = round_up(ei_start, align);
51 addr = round_up(start, align);
54 *sizep = ei_last - addr;
55 while (bad_addr_size(&addr, sizep, align) && addr + *sizep <= ei_last)
64 return MEMBLOCK_ERROR;
68 * Find next free range after start, and size is returned in *sizep
70 u64 __init memblock_x86_find_in_range_size(u64 start, u64 *sizep, u64 align)
72 struct memblock_region *r;
74 for_each_memblock(memory, r) {
75 u64 ei_start = r->base;
76 u64 ei_last = ei_start + r->size;
79 addr = __memblock_x86_find_in_range_size(ei_start, ei_last, start,
82 if (addr != MEMBLOCK_ERROR)
86 return MEMBLOCK_ERROR;
89 static __init struct range *find_range_array(int count)
94 size = sizeof(struct range) * count;
95 end = memblock.current_limit;
97 mem = memblock_find_in_range(0, end, size, sizeof(struct range));
98 if (mem == MEMBLOCK_ERROR)
99 panic("can not find more space for range array");
102 * This range is tempoaray, so don't reserve it, it will not be
103 * overlapped because We will not alloccate new buffer before
104 * We discard this one
107 memset(range, 0, size);
112 static void __init memblock_x86_subtract_reserved(struct range *range, int az)
114 u64 final_start, final_end;
115 struct memblock_region *r;
117 /* Take out region array itself at first*/
118 memblock_free_reserved_regions();
120 memblock_dbg("Subtract (%ld early reservations)\n", memblock.reserved.cnt);
122 for_each_memblock(reserved, r) {
123 memblock_dbg(" [%010llx-%010llx]\n", (u64)r->base, (u64)r->base + r->size - 1);
124 final_start = PFN_DOWN(r->base);
125 final_end = PFN_UP(r->base + r->size);
126 if (final_start >= final_end)
128 subtract_range(range, az, final_start, final_end);
131 /* Put region array back ? */
132 memblock_reserve_reserved_regions();
139 static int __init count_work_fn(unsigned long start_pfn,
140 unsigned long end_pfn, void *datax)
142 struct count_data *data = datax;
149 static int __init count_early_node_map(int nodeid)
151 struct count_data data;
154 work_with_active_regions(nodeid, count_work_fn, &data);
159 int __init get_free_all_memory_range(struct range **rangep, int nodeid)
165 count = (memblock.reserved.cnt + count_early_node_map(nodeid)) * 2;
167 range = find_range_array(count);
171 * Use early_node_map[] and memblock.reserved.region to get range array
174 nr_range = add_from_early_node_map(range, count, nr_range, nodeid);
176 subtract_range(range, count, max_low_pfn, -1ULL);
178 memblock_x86_subtract_reserved(range, count);
179 nr_range = clean_sort_range(range, count);
185 static u64 __init __memblock_x86_memory_in_range(u64 addr, u64 limit, bool get_free)
190 u64 final_start, final_end;
192 struct memblock_region *r;
194 count = (memblock.reserved.cnt + memblock.memory.cnt) * 2;
196 range = find_range_array(count);
200 limit = PFN_DOWN(limit);
202 for_each_memblock(memory, r) {
203 final_start = PFN_UP(r->base);
204 final_end = PFN_DOWN(r->base + r->size);
205 if (final_start >= final_end)
207 if (final_start >= limit || final_end <= addr)
210 nr_range = add_range(range, count, nr_range, final_start, final_end);
212 subtract_range(range, count, 0, addr);
213 subtract_range(range, count, limit, -1ULL);
215 /* Subtract memblock.reserved.region in range ? */
217 goto sort_and_count_them;
218 for_each_memblock(reserved, r) {
219 final_start = PFN_DOWN(r->base);
220 final_end = PFN_UP(r->base + r->size);
221 if (final_start >= final_end)
223 if (final_start >= limit || final_end <= addr)
226 subtract_range(range, count, final_start, final_end);
230 nr_range = clean_sort_range(range, count);
233 for (i = 0; i < nr_range; i++)
234 free_size += range[i].end - range[i].start;
236 return free_size << PAGE_SHIFT;
239 u64 __init memblock_x86_free_memory_in_range(u64 addr, u64 limit)
241 return __memblock_x86_memory_in_range(addr, limit, true);
244 u64 __init memblock_x86_memory_in_range(u64 addr, u64 limit)
246 return __memblock_x86_memory_in_range(addr, limit, false);
249 void __init memblock_x86_reserve_range(u64 start, u64 end, char *name)
254 if (WARN_ONCE(start > end, "memblock_x86_reserve_range: wrong range [%#llx, %#llx)\n", start, end))
257 memblock_dbg(" memblock_x86_reserve_range: [%#010llx-%#010llx] %16s\n", start, end - 1, name);
259 memblock_reserve(start, end - start);
262 void __init memblock_x86_free_range(u64 start, u64 end)
267 if (WARN_ONCE(start > end, "memblock_x86_free_range: wrong range [%#llx, %#llx)\n", start, end))
270 memblock_dbg(" memblock_x86_free_range: [%#010llx-%#010llx]\n", start, end - 1);
272 memblock_free(start, end - start);
276 * Need to call this function after memblock_x86_register_active_regions,
277 * so early_node_map[] is filled already.
279 u64 __init memblock_x86_find_in_range_node(int nid, u64 start, u64 end, u64 size, u64 align)
282 addr = find_memory_core_early(nid, size, align, start, end);
283 if (addr != MEMBLOCK_ERROR)
286 /* Fallback, should already have start end within node range */
287 return memblock_find_in_range(start, end, size, align);
291 * Finds an active region in the address range from start_pfn to last_pfn and
292 * returns its range in ei_startpfn and ei_endpfn for the memblock entry.
294 static int __init memblock_x86_find_active_region(const struct memblock_region *ei,
295 unsigned long start_pfn,
296 unsigned long last_pfn,
297 unsigned long *ei_startpfn,
298 unsigned long *ei_endpfn)
300 u64 align = PAGE_SIZE;
302 *ei_startpfn = round_up(ei->base, align) >> PAGE_SHIFT;
303 *ei_endpfn = round_down(ei->base + ei->size, align) >> PAGE_SHIFT;
305 /* Skip map entries smaller than a page */
306 if (*ei_startpfn >= *ei_endpfn)
309 /* Skip if map is outside the node */
310 if (*ei_endpfn <= start_pfn || *ei_startpfn >= last_pfn)
313 /* Check for overlaps */
314 if (*ei_startpfn < start_pfn)
315 *ei_startpfn = start_pfn;
316 if (*ei_endpfn > last_pfn)
317 *ei_endpfn = last_pfn;
322 /* Walk the memblock.memory map and register active regions within a node */
323 void __init memblock_x86_register_active_regions(int nid, unsigned long start_pfn,
324 unsigned long last_pfn)
326 unsigned long ei_startpfn;
327 unsigned long ei_endpfn;
328 struct memblock_region *r;
330 for_each_memblock(memory, r)
331 if (memblock_x86_find_active_region(r, start_pfn, last_pfn,
332 &ei_startpfn, &ei_endpfn))
333 add_active_range(nid, ei_startpfn, ei_endpfn);
337 * Find the hole size (in bytes) in the memory range.
338 * @start: starting address of the memory range to scan
339 * @end: ending address of the memory range to scan
341 u64 __init memblock_x86_hole_size(u64 start, u64 end)
343 unsigned long start_pfn = start >> PAGE_SHIFT;
344 unsigned long last_pfn = end >> PAGE_SHIFT;
345 unsigned long ei_startpfn, ei_endpfn, ram = 0;
346 struct memblock_region *r;
348 for_each_memblock(memory, r)
349 if (memblock_x86_find_active_region(r, start_pfn, last_pfn,
350 &ei_startpfn, &ei_endpfn))
351 ram += ei_endpfn - ei_startpfn;
353 return end - start - ((u64)ram << PAGE_SHIFT);