|
@@ -7,93 +7,6 @@
|
|
#include <linux/mm.h>
|
|
#include <linux/mm.h>
|
|
#include <linux/range.h>
|
|
#include <linux/range.h>
|
|
|
|
|
|
-static __init struct range *find_range_array(int count)
|
|
|
|
-{
|
|
|
|
- u64 end, size, mem;
|
|
|
|
- struct range *range;
|
|
|
|
-
|
|
|
|
- size = sizeof(struct range) * count;
|
|
|
|
- end = memblock.current_limit;
|
|
|
|
-
|
|
|
|
- mem = memblock_find_in_range(0, end, size, sizeof(struct range));
|
|
|
|
- if (!mem)
|
|
|
|
- panic("can not find more space for range array");
|
|
|
|
-
|
|
|
|
- /*
|
|
|
|
- * This range is tempoaray, so don't reserve it, it will not be
|
|
|
|
- * overlapped because We will not alloccate new buffer before
|
|
|
|
- * We discard this one
|
|
|
|
- */
|
|
|
|
- range = __va(mem);
|
|
|
|
- memset(range, 0, size);
|
|
|
|
-
|
|
|
|
- return range;
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
-static u64 __init __memblock_x86_memory_in_range(u64 addr, u64 limit, bool get_free)
|
|
|
|
-{
|
|
|
|
- int i, count;
|
|
|
|
- struct range *range;
|
|
|
|
- int nr_range;
|
|
|
|
- u64 final_start, final_end;
|
|
|
|
- u64 free_size;
|
|
|
|
- struct memblock_region *r;
|
|
|
|
-
|
|
|
|
- count = (memblock.reserved.cnt + memblock.memory.cnt) * 2;
|
|
|
|
-
|
|
|
|
- range = find_range_array(count);
|
|
|
|
- nr_range = 0;
|
|
|
|
-
|
|
|
|
- addr = PFN_UP(addr);
|
|
|
|
- limit = PFN_DOWN(limit);
|
|
|
|
-
|
|
|
|
- for_each_memblock(memory, r) {
|
|
|
|
- final_start = PFN_UP(r->base);
|
|
|
|
- final_end = PFN_DOWN(r->base + r->size);
|
|
|
|
- if (final_start >= final_end)
|
|
|
|
- continue;
|
|
|
|
- if (final_start >= limit || final_end <= addr)
|
|
|
|
- continue;
|
|
|
|
-
|
|
|
|
- nr_range = add_range(range, count, nr_range, final_start, final_end);
|
|
|
|
- }
|
|
|
|
- subtract_range(range, count, 0, addr);
|
|
|
|
- subtract_range(range, count, limit, -1ULL);
|
|
|
|
-
|
|
|
|
- /* Subtract memblock.reserved.region in range ? */
|
|
|
|
- if (!get_free)
|
|
|
|
- goto sort_and_count_them;
|
|
|
|
- for_each_memblock(reserved, r) {
|
|
|
|
- final_start = PFN_DOWN(r->base);
|
|
|
|
- final_end = PFN_UP(r->base + r->size);
|
|
|
|
- if (final_start >= final_end)
|
|
|
|
- continue;
|
|
|
|
- if (final_start >= limit || final_end <= addr)
|
|
|
|
- continue;
|
|
|
|
-
|
|
|
|
- subtract_range(range, count, final_start, final_end);
|
|
|
|
- }
|
|
|
|
-
|
|
|
|
-sort_and_count_them:
|
|
|
|
- nr_range = clean_sort_range(range, count);
|
|
|
|
-
|
|
|
|
- free_size = 0;
|
|
|
|
- for (i = 0; i < nr_range; i++)
|
|
|
|
- free_size += range[i].end - range[i].start;
|
|
|
|
-
|
|
|
|
- return free_size << PAGE_SHIFT;
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
-u64 __init memblock_x86_free_memory_in_range(u64 addr, u64 limit)
|
|
|
|
-{
|
|
|
|
- return __memblock_x86_memory_in_range(addr, limit, true);
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
-u64 __init memblock_x86_memory_in_range(u64 addr, u64 limit)
|
|
|
|
-{
|
|
|
|
- return __memblock_x86_memory_in_range(addr, limit, false);
|
|
|
|
-}
|
|
|
|
-
|
|
|
|
void __init memblock_x86_reserve_range(u64 start, u64 end, char *name)
|
|
void __init memblock_x86_reserve_range(u64 start, u64 end, char *name)
|
|
{
|
|
{
|
|
if (start == end)
|
|
if (start == end)
|