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>
11 #include <asm/early_res.h>
12 #include <asm/proto.h>
15 * Early reserved memory areas.
18 * need to make sure this one is bigger enough before
19 * find_e820_area could be used
21 #define MAX_EARLY_RES_X 32
28 static struct early_res early_res_x[MAX_EARLY_RES_X] __initdata;
30 static int max_early_res __initdata = MAX_EARLY_RES_X;
31 static struct early_res *early_res __initdata = &early_res_x[0];
32 static int early_res_count __initdata;
34 static int __init find_overlapped_early(u64 start, u64 end)
39 for (i = 0; i < max_early_res && early_res[i].end; i++) {
41 if (end > r->start && start < r->end)
49 * Drop the i-th range from the early reservation map,
50 * by copying any higher ranges down one over it, and
51 * clearing what had been the last slot.
53 static void __init drop_range(int i)
57 for (j = i + 1; j < max_early_res && early_res[j].end; j++)
60 memmove(&early_res[i], &early_res[i + 1],
61 (j - 1 - i) * sizeof(struct early_res));
63 early_res[j - 1].end = 0;
68 * Split any existing ranges that:
69 * 1) are marked 'overlap_ok', and
70 * 2) overlap with the stated range [start, end)
71 * into whatever portion (if any) of the existing range is entirely
72 * below or entirely above the stated range. Drop the portion
73 * of the existing range that overlaps with the stated range,
74 * which will allow the caller of this routine to then add that
75 * stated range without conflicting with any existing range.
77 static void __init drop_overlaps_that_are_ok(u64 start, u64 end)
81 u64 lower_start, lower_end;
82 u64 upper_start, upper_end;
85 for (i = 0; i < max_early_res && early_res[i].end; i++) {
88 /* Continue past non-overlapping ranges */
89 if (end <= r->start || start >= r->end)
93 * Leave non-ok overlaps as is; let caller
94 * panic "Overlapping early reservations"
95 * when it hits this overlap.
101 * We have an ok overlap. We will drop it from the early
102 * reservation map, and add back in any non-overlapping
103 * portions (lower or upper) as separate, overlap_ok,
104 * non-overlapping ranges.
107 /* 1. Note any non-overlapping (lower or upper) ranges. */
108 strncpy(name, r->name, sizeof(name) - 1);
110 lower_start = lower_end = 0;
111 upper_start = upper_end = 0;
112 if (r->start < start) {
113 lower_start = r->start;
121 /* 2. Drop the original ok overlapping range */
124 i--; /* resume for-loop on copied down entry */
126 /* 3. Add back in any non-overlapping ranges. */
128 reserve_early_overlap_ok(lower_start, lower_end, name);
130 reserve_early_overlap_ok(upper_start, upper_end, name);
134 static void __init __reserve_early(u64 start, u64 end, char *name,
140 i = find_overlapped_early(start, end);
141 if (i >= max_early_res)
142 panic("Too many early reservations");
145 panic("Overlapping early reservations "
146 "%llx-%llx %s to %llx-%llx %s\n",
147 start, end - 1, name ? name : "", r->start,
148 r->end - 1, r->name);
151 r->overlap_ok = overlap_ok;
153 strncpy(r->name, name, sizeof(r->name) - 1);
158 * A few early reservtations come here.
160 * The 'overlap_ok' in the name of this routine does -not- mean it
161 * is ok for these reservations to overlap an earlier reservation.
162 * Rather it means that it is ok for subsequent reservations to
165 * Use this entry point to reserve early ranges when you are doing
166 * so out of "Paranoia", reserving perhaps more memory than you need,
167 * just in case, and don't mind a subsequent overlapping reservation
168 * that is known to be needed.
170 * The drop_overlaps_that_are_ok() call here isn't really needed.
171 * It would be needed if we had two colliding 'overlap_ok'
172 * reservations, so that the second such would not panic on the
173 * overlap with the first. We don't have any such as of this
174 * writing, but might as well tolerate such if it happens in
177 void __init reserve_early_overlap_ok(u64 start, u64 end, char *name)
179 drop_overlaps_that_are_ok(start, end);
180 __reserve_early(start, end, name, 1);
183 static void __init __check_and_double_early_res(u64 ex_start, u64 ex_end)
185 u64 start, end, size, mem;
186 struct early_res *new;
188 /* do we have enough slots left ? */
189 if ((max_early_res - early_res_count) > max(max_early_res/8, 2))
194 size = sizeof(struct early_res) * max_early_res * 2;
195 if (early_res == early_res_x)
198 start = early_res[0].end;
200 if (start + size < end)
201 mem = find_e820_area(start, end, size,
202 sizeof(struct early_res));
205 end = max_pfn_mapped << PAGE_SHIFT;
206 if (start + size < end)
207 mem = find_e820_area(start, end, size,
208 sizeof(struct early_res));
211 panic("can not find more space for early_res array");
214 /* save the first one for own */
216 new[0].end = mem + size;
217 new[0].overlap_ok = 0;
218 /* copy old to new */
219 if (early_res == early_res_x) {
220 memcpy(&new[1], &early_res[0],
221 sizeof(struct early_res) * max_early_res);
222 memset(&new[max_early_res+1], 0,
223 sizeof(struct early_res) * (max_early_res - 1));
226 memcpy(&new[1], &early_res[1],
227 sizeof(struct early_res) * (max_early_res - 1));
228 memset(&new[max_early_res], 0,
229 sizeof(struct early_res) * max_early_res);
231 memset(&early_res[0], 0, sizeof(struct early_res) * max_early_res);
234 printk(KERN_DEBUG "early_res array is doubled to %d at [%llx - %llx]\n",
235 max_early_res, mem, mem + size - 1);
239 * Most early reservations come here.
241 * We first have drop_overlaps_that_are_ok() drop any pre-existing
242 * 'overlap_ok' ranges, so that we can then reserve this memory
243 * range without risk of panic'ing on an overlapping overlap_ok
246 void __init reserve_early(u64 start, u64 end, char *name)
251 __check_and_double_early_res(start, end);
253 drop_overlaps_that_are_ok(start, end);
254 __reserve_early(start, end, name, 0);
257 void __init reserve_early_without_check(u64 start, u64 end, char *name)
264 __check_and_double_early_res(start, end);
266 r = &early_res[early_res_count];
272 strncpy(r->name, name, sizeof(r->name) - 1);
276 void __init free_early(u64 start, u64 end)
281 i = find_overlapped_early(start, end);
283 if (i >= max_early_res || r->end != end || r->start != start)
284 panic("free_early on not reserved area: %llx-%llx!",
290 #ifdef CONFIG_NO_BOOTMEM
291 static void __init subtract_early_res(struct range *range, int az)
294 u64 final_start, final_end;
298 for (i = 0; i < max_early_res && early_res[i].end; i++)
301 /* need to skip first one ?*/
302 if (early_res != early_res_x)
305 #define DEBUG_PRINT_EARLY_RES 1
307 #if DEBUG_PRINT_EARLY_RES
308 printk(KERN_INFO "Subtract (%d early reservations)\n", count);
310 for (i = idx; i < count; i++) {
311 struct early_res *r = &early_res[i];
312 #if DEBUG_PRINT_EARLY_RES
313 printk(KERN_INFO " #%d [%010llx - %010llx] %15s\n", i,
314 r->start, r->end, r->name);
316 final_start = PFN_DOWN(r->start);
317 final_end = PFN_UP(r->end);
318 if (final_start >= final_end)
320 subtract_range(range, az, final_start, final_end);
325 int __init get_free_all_memory_range(struct range **rangep, int nodeid)
335 for (i = 0; i < max_early_res && early_res[i].end; i++)
340 size = sizeof(struct range) * count;
342 if (max_pfn_mapped > MAX_DMA32_PFN)
343 start = MAX_DMA32_PFN << PAGE_SHIFT;
345 end = max_pfn_mapped << PAGE_SHIFT;
346 mem = find_e820_area(start, end, size, sizeof(struct range));
348 panic("can not find more space for range free");
351 /* use early_node_map[] and early_res to get range array at first */
352 memset(range, 0, size);
355 /* need to go over early_node_map to find out good range for node */
356 nr_range = add_from_early_node_map(range, count, nr_range, nodeid);
358 subtract_range(range, count, max_low_pfn, -1ULL);
360 subtract_early_res(range, count);
361 nr_range = clean_sort_range(range, count);
363 /* need to clear it ? */
364 if (nodeid == MAX_NUMNODES) {
365 memset(&early_res[0], 0,
366 sizeof(struct early_res) * max_early_res);
375 void __init early_res_to_bootmem(u64 start, u64 end)
378 u64 final_start, final_end;
382 for (i = 0; i < max_early_res && early_res[i].end; i++)
385 /* need to skip first one ?*/
386 if (early_res != early_res_x)
389 printk(KERN_INFO "(%d/%d early reservations) ==> bootmem [%010llx - %010llx]\n",
390 count - idx, max_early_res, start, end);
391 for (i = idx; i < count; i++) {
392 struct early_res *r = &early_res[i];
393 printk(KERN_INFO " #%d [%010llx - %010llx] %16s", i,
394 r->start, r->end, r->name);
395 final_start = max(start, r->start);
396 final_end = min(end, r->end);
397 if (final_start >= final_end) {
398 printk(KERN_CONT "\n");
401 printk(KERN_CONT " ==> [%010llx - %010llx]\n",
402 final_start, final_end);
403 reserve_bootmem_generic(final_start, final_end - final_start,
407 memset(&early_res[0], 0, sizeof(struct early_res) * max_early_res);
414 /* Check for already reserved areas */
415 static inline int __init bad_addr(u64 *addrp, u64 size, u64 align)
422 i = find_overlapped_early(addr, addr + size);
424 if (i < max_early_res && r->end) {
425 *addrp = addr = round_up(r->end, align);
432 /* Check for already reserved areas */
433 static inline int __init bad_addr_size(u64 *addrp, u64 *sizep, u64 align)
436 u64 addr = *addrp, last;
441 for (i = 0; i < max_early_res && early_res[i].end; i++) {
442 struct early_res *r = &early_res[i];
443 if (last > r->start && addr < r->start) {
444 size = r->start - addr;
448 if (last > r->end && addr < r->end) {
449 addr = round_up(r->end, align);
454 if (last <= r->end && addr >= r->start) {
467 * Find a free area with specified alignment in a specific range.
468 * only with the area.between start to end is active range from early_node_map
469 * so they are good as RAM
471 u64 __init find_early_area(u64 ei_start, u64 ei_last, u64 start, u64 end,
476 addr = round_up(ei_start, align);
478 addr = round_up(start, align);
481 while (bad_addr(&addr, size, align) && addr+size <= ei_last)
495 u64 __init find_early_area_size(u64 ei_start, u64 ei_last, u64 start,
496 u64 *sizep, u64 align)
500 addr = round_up(ei_start, align);
502 addr = round_up(start, align);
505 *sizep = ei_last - addr;
506 while (bad_addr_size(&addr, sizep, align) && addr + *sizep <= ei_last)
508 last = addr + *sizep;