2 * early_res, could be used to replace bootmem
4 #include <linux/kernel.h>
5 #include <linux/types.h>
6 #include <linux/init.h>
7 #include <linux/bootmem.h>
9 #include <linux/early_res.h>
12 * Early reserved memory areas.
15 * need to make sure this one is bigger enough before
16 * find_fw_memmap_area could be used
18 #define MAX_EARLY_RES_X 32
25 static struct early_res early_res_x[MAX_EARLY_RES_X] __initdata;
27 static int max_early_res __initdata = MAX_EARLY_RES_X;
28 static struct early_res *early_res __initdata = &early_res_x[0];
29 static int early_res_count __initdata;
31 static int __init find_overlapped_early(u64 start, u64 end)
36 for (i = 0; i < max_early_res && early_res[i].end; i++) {
38 if (end > r->start && start < r->end)
46 * Drop the i-th range from the early reservation map,
47 * by copying any higher ranges down one over it, and
48 * clearing what had been the last slot.
50 static void __init drop_range(int i)
54 for (j = i + 1; j < max_early_res && early_res[j].end; j++)
57 memmove(&early_res[i], &early_res[i + 1],
58 (j - 1 - i) * sizeof(struct early_res));
60 early_res[j - 1].end = 0;
65 * Split any existing ranges that:
66 * 1) are marked 'overlap_ok', and
67 * 2) overlap with the stated range [start, end)
68 * into whatever portion (if any) of the existing range is entirely
69 * below or entirely above the stated range. Drop the portion
70 * of the existing range that overlaps with the stated range,
71 * which will allow the caller of this routine to then add that
72 * stated range without conflicting with any existing range.
74 static void __init drop_overlaps_that_are_ok(u64 start, u64 end)
78 u64 lower_start, lower_end;
79 u64 upper_start, upper_end;
82 for (i = 0; i < max_early_res && early_res[i].end; i++) {
85 /* Continue past non-overlapping ranges */
86 if (end <= r->start || start >= r->end)
90 * Leave non-ok overlaps as is; let caller
91 * panic "Overlapping early reservations"
92 * when it hits this overlap.
98 * We have an ok overlap. We will drop it from the early
99 * reservation map, and add back in any non-overlapping
100 * portions (lower or upper) as separate, overlap_ok,
101 * non-overlapping ranges.
104 /* 1. Note any non-overlapping (lower or upper) ranges. */
105 strncpy(name, r->name, sizeof(name) - 1);
107 lower_start = lower_end = 0;
108 upper_start = upper_end = 0;
109 if (r->start < start) {
110 lower_start = r->start;
118 /* 2. Drop the original ok overlapping range */
121 i--; /* resume for-loop on copied down entry */
123 /* 3. Add back in any non-overlapping ranges. */
125 reserve_early_overlap_ok(lower_start, lower_end, name);
127 reserve_early_overlap_ok(upper_start, upper_end, name);
131 static void __init __reserve_early(u64 start, u64 end, char *name,
137 i = find_overlapped_early(start, end);
138 if (i >= max_early_res)
139 panic("Too many early reservations");
142 panic("Overlapping early reservations "
143 "%llx-%llx %s to %llx-%llx %s\n",
144 start, end - 1, name ? name : "", r->start,
145 r->end - 1, r->name);
148 r->overlap_ok = overlap_ok;
150 strncpy(r->name, name, sizeof(r->name) - 1);
155 * A few early reservtations come here.
157 * The 'overlap_ok' in the name of this routine does -not- mean it
158 * is ok for these reservations to overlap an earlier reservation.
159 * Rather it means that it is ok for subsequent reservations to
162 * Use this entry point to reserve early ranges when you are doing
163 * so out of "Paranoia", reserving perhaps more memory than you need,
164 * just in case, and don't mind a subsequent overlapping reservation
165 * that is known to be needed.
167 * The drop_overlaps_that_are_ok() call here isn't really needed.
168 * It would be needed if we had two colliding 'overlap_ok'
169 * reservations, so that the second such would not panic on the
170 * overlap with the first. We don't have any such as of this
171 * writing, but might as well tolerate such if it happens in
174 void __init reserve_early_overlap_ok(u64 start, u64 end, char *name)
176 drop_overlaps_that_are_ok(start, end);
177 __reserve_early(start, end, name, 1);
180 static void __init __check_and_double_early_res(u64 ex_start, u64 ex_end)
182 u64 start, end, size, mem;
183 struct early_res *new;
185 /* do we have enough slots left ? */
186 if ((max_early_res - early_res_count) > max(max_early_res/8, 2))
191 size = sizeof(struct early_res) * max_early_res * 2;
192 if (early_res == early_res_x)
195 start = early_res[0].end;
197 if (start + size < end)
198 mem = find_fw_memmap_area(start, end, size,
199 sizeof(struct early_res));
202 end = get_max_mapped();
203 if (start + size < end)
204 mem = find_fw_memmap_area(start, end, size,
205 sizeof(struct early_res));
208 panic("can not find more space for early_res array");
211 /* save the first one for own */
213 new[0].end = mem + size;
214 new[0].overlap_ok = 0;
215 /* copy old to new */
216 if (early_res == early_res_x) {
217 memcpy(&new[1], &early_res[0],
218 sizeof(struct early_res) * max_early_res);
219 memset(&new[max_early_res+1], 0,
220 sizeof(struct early_res) * (max_early_res - 1));
223 memcpy(&new[1], &early_res[1],
224 sizeof(struct early_res) * (max_early_res - 1));
225 memset(&new[max_early_res], 0,
226 sizeof(struct early_res) * max_early_res);
228 memset(&early_res[0], 0, sizeof(struct early_res) * max_early_res);
231 printk(KERN_DEBUG "early_res array is doubled to %d at [%llx - %llx]\n",
232 max_early_res, mem, mem + size - 1);
236 * Most early reservations come here.
238 * We first have drop_overlaps_that_are_ok() drop any pre-existing
239 * 'overlap_ok' ranges, so that we can then reserve this memory
240 * range without risk of panic'ing on an overlapping overlap_ok
243 void __init reserve_early(u64 start, u64 end, char *name)
248 __check_and_double_early_res(start, end);
250 drop_overlaps_that_are_ok(start, end);
251 __reserve_early(start, end, name, 0);
254 void __init reserve_early_without_check(u64 start, u64 end, char *name)
261 __check_and_double_early_res(start, end);
263 r = &early_res[early_res_count];
269 strncpy(r->name, name, sizeof(r->name) - 1);
273 void __init free_early(u64 start, u64 end)
278 i = find_overlapped_early(start, end);
280 if (i >= max_early_res || r->end != end || r->start != start)
281 panic("free_early on not reserved area: %llx-%llx!",
287 #ifdef CONFIG_NO_BOOTMEM
288 static void __init subtract_early_res(struct range *range, int az)
291 u64 final_start, final_end;
295 for (i = 0; i < max_early_res && early_res[i].end; i++)
298 /* need to skip first one ?*/
299 if (early_res != early_res_x)
302 #define DEBUG_PRINT_EARLY_RES 1
304 #if DEBUG_PRINT_EARLY_RES
305 printk(KERN_INFO "Subtract (%d early reservations)\n", count);
307 for (i = idx; i < count; i++) {
308 struct early_res *r = &early_res[i];
309 #if DEBUG_PRINT_EARLY_RES
310 printk(KERN_INFO " #%d [%010llx - %010llx] %15s\n", i,
311 r->start, r->end, r->name);
313 final_start = PFN_DOWN(r->start);
314 final_end = PFN_UP(r->end);
315 if (final_start >= final_end)
317 subtract_range(range, az, final_start, final_end);
322 int __init get_free_all_memory_range(struct range **rangep, int nodeid)
332 for (i = 0; i < max_early_res && early_res[i].end; i++)
337 size = sizeof(struct range) * count;
338 end = get_max_mapped();
340 if (end > (MAX_DMA32_PFN << PAGE_SHIFT))
341 start = MAX_DMA32_PFN << PAGE_SHIFT;
343 mem = find_fw_memmap_area(start, end, size, sizeof(struct range));
345 panic("can not find more space for range free");
348 /* use early_node_map[] and early_res to get range array at first */
349 memset(range, 0, size);
352 /* need to go over early_node_map to find out good range for node */
353 nr_range = add_from_early_node_map(range, count, nr_range, nodeid);
355 subtract_range(range, count, max_low_pfn, -1ULL);
357 subtract_early_res(range, count);
358 nr_range = clean_sort_range(range, count);
360 /* need to clear it ? */
361 if (nodeid == MAX_NUMNODES) {
362 memset(&early_res[0], 0,
363 sizeof(struct early_res) * max_early_res);
372 void __init early_res_to_bootmem(u64 start, u64 end)
375 u64 final_start, final_end;
379 for (i = 0; i < max_early_res && early_res[i].end; i++)
382 /* need to skip first one ?*/
383 if (early_res != early_res_x)
386 printk(KERN_INFO "(%d/%d early reservations) ==> bootmem [%010llx - %010llx]\n",
387 count - idx, max_early_res, start, end);
388 for (i = idx; i < count; i++) {
389 struct early_res *r = &early_res[i];
390 printk(KERN_INFO " #%d [%010llx - %010llx] %16s", i,
391 r->start, r->end, r->name);
392 final_start = max(start, r->start);
393 final_end = min(end, r->end);
394 if (final_start >= final_end) {
395 printk(KERN_CONT "\n");
398 printk(KERN_CONT " ==> [%010llx - %010llx]\n",
399 final_start, final_end);
400 reserve_bootmem_generic(final_start, final_end - final_start,
404 memset(&early_res[0], 0, sizeof(struct early_res) * max_early_res);
411 /* Check for already reserved areas */
412 static inline int __init bad_addr(u64 *addrp, u64 size, u64 align)
419 i = find_overlapped_early(addr, addr + size);
421 if (i < max_early_res && r->end) {
422 *addrp = addr = round_up(r->end, align);
429 /* Check for already reserved areas */
430 static inline int __init bad_addr_size(u64 *addrp, u64 *sizep, u64 align)
433 u64 addr = *addrp, last;
438 for (i = 0; i < max_early_res && early_res[i].end; i++) {
439 struct early_res *r = &early_res[i];
440 if (last > r->start && addr < r->start) {
441 size = r->start - addr;
445 if (last > r->end && addr < r->end) {
446 addr = round_up(r->end, align);
451 if (last <= r->end && addr >= r->start) {
464 * Find a free area with specified alignment in a specific range.
465 * only with the area.between start to end is active range from early_node_map
466 * so they are good as RAM
468 u64 __init find_early_area(u64 ei_start, u64 ei_last, u64 start, u64 end,
473 addr = round_up(ei_start, align);
475 addr = round_up(start, align);
478 while (bad_addr(&addr, size, align) && addr+size <= ei_last)
492 u64 __init find_early_area_size(u64 ei_start, u64 ei_last, u64 start,
493 u64 *sizep, u64 align)
497 addr = round_up(ei_start, align);
499 addr = round_up(start, align);
502 *sizep = ei_last - addr;
503 while (bad_addr_size(&addr, sizep, align) && addr + *sizep <= ei_last)
505 last = addr + *sizep;