arch/x86/mm/memblock.c

   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>
   7 #include <linux/mm.h>
   8 #include <linux/range.h>
   9
  10 /* Check for already reserved areas */
  11 static inline bool __init bad_addr_size(u64 *addrp, u64 *sizep, u64 align)
  12 {
  13         struct memblock_region *r;
  14         u64 addr = *addrp, last;
  15         u64 size = *sizep;
  16         bool changed = false;
  17
  18 again:
  19         last = addr + size;
  20         for_each_memblock(reserved, r) {
  21                 if (last > r->base && addr < r->base) {
  22                         size = r->base - addr;
  23                         changed = true;
  24                         goto again;
  25                 }
  26                 if (last > (r->base + r->size) && addr < (r->base + r->size)) {
  27                         addr = round_up(r->base + r->size, align);
  28                         size = last - addr;
  29                         changed = true;
  30                         goto again;
  31                 }
  32                 if (last <= (r->base + r->size) && addr >= r->base) {
  33                         (*sizep)++;
  34                         return false;
  35                 }
  36         }
  37         if (changed) {
  38                 *addrp = addr;
  39                 *sizep = size;
  40         }
  41         return changed;
  42 }
  43
  44 static u64 __init __memblock_x86_find_in_range_size(u64 ei_start, u64 ei_last, u64 start,
  45                          u64 *sizep, u64 align)
  46 {
  47         u64 addr, last;
  48
  49         addr = round_up(ei_start, align);
  50         if (addr < start)
  51                 addr = round_up(start, align);
  52         if (addr >= ei_last)
  53                 goto out;
  54         *sizep = ei_last - addr;
  55         while (bad_addr_size(&addr, sizep, align) && addr + *sizep <= ei_last)
  56                 ;
  57         last = addr + *sizep;
  58         if (last > ei_last)
  59                 goto out;
  60
  61         return addr;
  62
  63 out:
  64         return MEMBLOCK_ERROR;
  65 }
  66
  67 /*
  68  * Find next free range after start, and size is returned in *sizep
  69  */
  70 u64 __init memblock_x86_find_in_range_size(u64 start, u64 *sizep, u64 align)
  71 {
  72         struct memblock_region *r;
  73
  74         for_each_memblock(memory, r) {
  75                 u64 ei_start = r->base;
  76                 u64 ei_last = ei_start + r->size;
  77                 u64 addr;
  78
  79                 addr = __memblock_x86_find_in_range_size(ei_start, ei_last, start,
  80                                          sizep, align);
  81
  82                 if (addr != MEMBLOCK_ERROR)
  83                         return addr;
  84         }
  85
  86         return MEMBLOCK_ERROR;
  87 }
  88
  89 static __init struct range *find_range_array(int count)
  90 {
  91         u64 end, size, mem;
  92         struct range *range;
  93
  94         size = sizeof(struct range) * count;
  95         end = memblock.current_limit;
  96
  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");
 100
 101         /*
 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
 105          */
 106         range = __va(mem);
 107         memset(range, 0, size);
 108
 109         return range;
 110 }
 111
 112 #ifdef CONFIG_NO_BOOTMEM
 113 static void __init memblock_x86_subtract_reserved(struct range *range, int az)
 114 {
 115         u64 final_start, final_end;
 116         struct memblock_region *r;
 117
 118         /* Take out region array itself at first*/
 119         memblock_free_reserved_regions();
 120
 121         pr_info("Subtract (%ld early reservations)\n", memblock.reserved.cnt);
 122
 123         for_each_memblock(reserved, r) {
 124                 pr_info("  [%010llx-%010llx]\n", (u64)r->base, (u64)r->base + r->size - 1);
 125                 final_start = PFN_DOWN(r->base);
 126                 final_end = PFN_UP(r->base + r->size);
 127                 if (final_start >= final_end)
 128                         continue;
 129                 subtract_range(range, az, final_start, final_end);
 130         }
 131
 132         /* Put region array back ? */
 133         memblock_reserve_reserved_regions();
 134 }
 135
 136 struct count_data {
 137         int nr;
 138 };
 139
 140 static int __init count_work_fn(unsigned long start_pfn,
 141                                 unsigned long end_pfn, void *datax)
 142 {
 143         struct count_data *data = datax;
 144
 145         data->nr++;
 146
 147         return 0;
 148 }
 149
 150 static int __init count_early_node_map(int nodeid)
 151 {
 152         struct count_data data;
 153
 154         data.nr = 0;
 155         work_with_active_regions(nodeid, count_work_fn, &data);
 156
 157         return data.nr;
 158 }
 159
 160 int __init get_free_all_memory_range(struct range **rangep, int nodeid)
 161 {
 162         int count;
 163         struct range *range;
 164         int nr_range;
 165
 166         count = (memblock.reserved.cnt + count_early_node_map(nodeid)) * 2;
 167
 168         range = find_range_array(count);
 169         nr_range = 0;
 170
 171         /*
 172          * Use early_node_map[] and memblock.reserved.region to get range array
 173          * at first
 174          */
 175         nr_range = add_from_early_node_map(range, count, nr_range, nodeid);
 176 #ifdef CONFIG_X86_32
 177         subtract_range(range, count, max_low_pfn, -1ULL);
 178 #endif
 179         memblock_x86_subtract_reserved(range, count);
 180         nr_range = clean_sort_range(range, count);
 181
 182         *rangep = range;
 183         return nr_range;
 184 }
 185 #else
 186 void __init memblock_x86_to_bootmem(u64 start, u64 end)
 187 {
 188         int count;
 189         u64 final_start, final_end;
 190         struct memblock_region *r;
 191
 192         /* Take out region array itself */
 193         memblock_free_reserved_regions();
 194
 195         count  = memblock.reserved.cnt;
 196         pr_info("(%d early reservations) ==> bootmem [%010llx-%010llx]\n", count, start, end - 1);
 197         for_each_memblock(reserved, r) {
 198                 pr_info("  [%010llx-%010llx] ", (u64)r->base, (u64)r->base + r->size - 1);
 199                 final_start = max(start, r->base);
 200                 final_end = min(end, r->base + r->size);
 201                 if (final_start >= final_end) {
 202                         pr_cont("\n");
 203                         continue;
 204                 }
 205                 pr_cont(" ==> [%010llx-%010llx]\n", final_start, final_end - 1);
 206                 reserve_bootmem_generic(final_start, final_end - final_start, BOOTMEM_DEFAULT);
 207         }
 208
 209         /* Put region array back ? */
 210         memblock_reserve_reserved_regions();
 211 }
 212 #endif
 213
 214 void __init memblock_x86_reserve_range(u64 start, u64 end, char *name)
 215 {
 216         if (start == end)
 217                 return;
 218
 219         if (WARN_ONCE(start > end, "memblock_x86_reserve_range: wrong range [%#llx, %#llx]\n", start, end))
 220                 return;
 221
 222         memblock_reserve(start, end - start);
 223 }
 224
 225 void __init memblock_x86_free_range(u64 start, u64 end)
 226 {
 227         if (start == end)
 228                 return;
 229
 230         if (WARN_ONCE(start > end, "memblock_x86_free_range: wrong range [%#llx, %#llx]\n", start, end))
 231                 return;
 232
 233         memblock_free(start, end - start);
 234 }