Lines Matching refs:early_res
2 * early_res, could be used to replace bootmem
9 #include <linux/early_res.h>
22 struct early_res {
27 static struct early_res early_res_x[MAX_EARLY_RES_X] __initdata;
30 static struct early_res *early_res __initdata = &early_res_x[0];
36 struct early_res *r;
38 for (i = 0; i < max_early_res && early_res[i].end; i++) {
39 r = &early_res[i];
56 for (j = i + 1; j < max_early_res && early_res[j].end; j++)
59 memmove(&early_res[i], &early_res[i + 1],
60 (j - 1 - i) * sizeof(struct early_res));
62 early_res[j - 1].end = 0;
71 old_start = early_res[i].start;
72 old_end = early_res[i].end;
82 early_res[i].end = common_start;
88 * early_res array could get resized inside
93 strncpy(name, early_res[i].name,
94 sizeof(early_res[i].name) - 1);
102 early_res[i].start = common_end;
123 struct early_res *r;
128 for (i = 0; i < max_early_res && early_res[i].end; i++) {
129 r = &early_res[i];
181 struct early_res *r;
186 r = &early_res[i];
229 struct early_res *new;
237 size = sizeof(struct early_res) * max_early_res * 2;
238 if (early_res == early_res_x)
241 start = early_res[0].end;
245 sizeof(struct early_res));
251 sizeof(struct early_res));
254 panic("can not find more space for early_res array");
262 if (early_res == early_res_x) {
263 memcpy(&new[1], &early_res[0],
264 sizeof(struct early_res) * max_early_res);
266 sizeof(struct early_res) * (max_early_res - 1));
269 memcpy(&new[1], &early_res[1],
270 sizeof(struct early_res) * (max_early_res - 1));
272 sizeof(struct early_res) * max_early_res);
274 memset(&early_res[0], 0, sizeof(struct early_res) * max_early_res);
275 early_res = new;
277 printk(KERN_DEBUG "early_res array is doubled to %d at [%llx - %llx]\n",
302 struct early_res *r;
309 r = &early_res[early_res_count];
321 struct early_res *r;
327 r = &early_res[i];
337 struct early_res *r;
353 r = &early_res[i];
372 for (i = 0; i < max_early_res && early_res[i].end; i++)
376 if (early_res != early_res_x)
385 struct early_res *r = &early_res[i];
409 for (i = 0; i < max_early_res && early_res[i].end; i++)
425 /* use early_node_map[] and early_res to get range array at first */
439 memset(&early_res[0], 0,
440 sizeof(struct early_res) * max_early_res);
441 early_res = NULL;
456 for (i = 0; i < max_early_res && early_res[i].end; i++)
460 if (early_res != early_res_x)
466 struct early_res *r = &early_res[i];
481 memset(&early_res[0], 0, sizeof(struct early_res) * max_early_res);
482 early_res = NULL;
494 struct early_res *r;
497 r = &early_res[i];
515 for (i = 0; i < max_early_res && early_res[i].end; i++) {
516 struct early_res *r = &early_res[i];