[deliverable/linux.git] / arch / x86 / kernel / early_res.c

/*
 * early_res, could be used to replace bootmem
 */
#include <linux/kernel.h>
#include <linux/types.h>
#include <linux/init.h>
#include <linux/bootmem.h>
#include <linux/mm.h>

#include <asm/e820.h>
#include <asm/early_res.h>
#include <asm/proto.h>

/*
 * Early reserved memory areas.
 */
/*
 * need to make sure this one is bigger enough before
 * find_e820_area could be used
 */
#define MAX_EARLY_RES_X 32

struct early_res {
	u64 start, end;
	char name[15];
	char overlap_ok;
};
static struct early_res early_res_x[MAX_EARLY_RES_X] __initdata;

static int max_early_res __initdata = MAX_EARLY_RES_X;
static struct early_res *early_res __initdata = &early_res_x[0];
static int early_res_count __initdata;

static int __init find_overlapped_early(u64 start, u64 end)
{
	int i;
	struct early_res *r;

	for (i = 0; i < max_early_res && early_res[i].end; i++) {
		r = &early_res[i];
		if (end > r->start && start < r->end)
			break;
	}

	return i;
}

/*
 * Drop the i-th range from the early reservation map,
 * by copying any higher ranges down one over it, and
 * clearing what had been the last slot.
 */
static void __init drop_range(int i)
{
	int j;

	for (j = i + 1; j < max_early_res && early_res[j].end; j++)
		;

	memmove(&early_res[i], &early_res[i + 1],
	       (j - 1 - i) * sizeof(struct early_res));

	early_res[j - 1].end = 0;
	early_res_count--;
}

/*
 * Split any existing ranges that:
 *  1) are marked 'overlap_ok', and
 *  2) overlap with the stated range [start, end)
 * into whatever portion (if any) of the existing range is entirely
 * below or entirely above the stated range.  Drop the portion
 * of the existing range that overlaps with the stated range,
 * which will allow the caller of this routine to then add that
 * stated range without conflicting with any existing range.
 */
static void __init drop_overlaps_that_are_ok(u64 start, u64 end)
{
	int i;
	struct early_res *r;
	u64 lower_start, lower_end;
	u64 upper_start, upper_end;
	char name[15];

	for (i = 0; i < max_early_res && early_res[i].end; i++) {
		r = &early_res[i];

		/* Continue past non-overlapping ranges */
		if (end <= r->start || start >= r->end)
			continue;

		/*
		 * Leave non-ok overlaps as is; let caller
		 * panic "Overlapping early reservations"
		 * when it hits this overlap.
		 */
		if (!r->overlap_ok)
			return;

		/*
		 * We have an ok overlap.  We will drop it from the early
		 * reservation map, and add back in any non-overlapping
		 * portions (lower or upper) as separate, overlap_ok,
		 * non-overlapping ranges.
		 */

		/* 1. Note any non-overlapping (lower or upper) ranges. */
		strncpy(name, r->name, sizeof(name) - 1);

		lower_start = lower_end = 0;
		upper_start = upper_end = 0;
		if (r->start < start) {
			lower_start = r->start;
			lower_end = start;
		}
		if (r->end > end) {
			upper_start = end;
			upper_end = r->end;
		}

		/* 2. Drop the original ok overlapping range */
		drop_range(i);

		i--;		/* resume for-loop on copied down entry */

		/* 3. Add back in any non-overlapping ranges. */
		if (lower_end)
			reserve_early_overlap_ok(lower_start, lower_end, name);
		if (upper_end)
			reserve_early_overlap_ok(upper_start, upper_end, name);
	}
}

static void __init __reserve_early(u64 start, u64 end, char *name,
						int overlap_ok)
{
	int i;
	struct early_res *r;

	i = find_overlapped_early(start, end);
	if (i >= max_early_res)
		panic("Too many early reservations");
	r = &early_res[i];
	if (r->end)
		panic("Overlapping early reservations "
		      "%llx-%llx %s to %llx-%llx %s\n",
		      start, end - 1, name ? name : "", r->start,
		      r->end - 1, r->name);
	r->start = start;
	r->end = end;
	r->overlap_ok = overlap_ok;
	if (name)
		strncpy(r->name, name, sizeof(r->name) - 1);
	early_res_count++;
}

/*
 * A few early reservtations come here.
 *
 * The 'overlap_ok' in the name of this routine does -not- mean it
 * is ok for these reservations to overlap an earlier reservation.
 * Rather it means that it is ok for subsequent reservations to
 * overlap this one.
 *
 * Use this entry point to reserve early ranges when you are doing
 * so out of "Paranoia", reserving perhaps more memory than you need,
 * just in case, and don't mind a subsequent overlapping reservation
 * that is known to be needed.
 *
 * The drop_overlaps_that_are_ok() call here isn't really needed.
 * It would be needed if we had two colliding 'overlap_ok'
 * reservations, so that the second such would not panic on the
 * overlap with the first.  We don't have any such as of this
 * writing, but might as well tolerate such if it happens in
 * the future.
 */
void __init reserve_early_overlap_ok(u64 start, u64 end, char *name)
{
	drop_overlaps_that_are_ok(start, end);
	__reserve_early(start, end, name, 1);
}

static void __init __check_and_double_early_res(u64 start)
{
	u64 end, size, mem;
	struct early_res *new;

	/* do we have enough slots left ? */
	if ((max_early_res - early_res_count) > max(max_early_res/8, 2))
		return;

	/* double it */
	end = max_pfn_mapped << PAGE_SHIFT;
	size = sizeof(struct early_res) * max_early_res * 2;
	mem = find_e820_area(start, end, size, sizeof(struct early_res));

	if (mem == -1ULL)
		panic("can not find more space for early_res array");

	new = __va(mem);
	/* save the first one for own */
	new[0].start = mem;
	new[0].end = mem + size;
	new[0].overlap_ok = 0;
	/* copy old to new */
	if (early_res == early_res_x) {
		memcpy(&new[1], &early_res[0],
			 sizeof(struct early_res) * max_early_res);
		memset(&new[max_early_res+1], 0,
			 sizeof(struct early_res) * (max_early_res - 1));
		early_res_count++;
	} else {
		memcpy(&new[1], &early_res[1],
			 sizeof(struct early_res) * (max_early_res - 1));
		memset(&new[max_early_res], 0,
			 sizeof(struct early_res) * max_early_res);
	}
	memset(&early_res[0], 0, sizeof(struct early_res) * max_early_res);
	early_res = new;
	max_early_res *= 2;
	printk(KERN_DEBUG "early_res array is doubled to %d at [%llx - %llx]\n",
		max_early_res, mem, mem + size - 1);
}

/*
 * Most early reservations come here.
 *
 * We first have drop_overlaps_that_are_ok() drop any pre-existing
 * 'overlap_ok' ranges, so that we can then reserve this memory
 * range without risk of panic'ing on an overlapping overlap_ok
 * early reservation.
 */
void __init reserve_early(u64 start, u64 end, char *name)
{
	if (start >= end)
		return;

	__check_and_double_early_res(end);

	drop_overlaps_that_are_ok(start, end);
	__reserve_early(start, end, name, 0);
}

void __init reserve_early_without_check(u64 start, u64 end, char *name)
{
	struct early_res *r;

	if (start >= end)
		return;

	__check_and_double_early_res(end);

	r = &early_res[early_res_count];

	r->start = start;
	r->end = end;
	r->overlap_ok = 0;
	if (name)
		strncpy(r->name, name, sizeof(r->name) - 1);
	early_res_count++;
}

void __init free_early(u64 start, u64 end)
{
	struct early_res *r;
	int i;

	i = find_overlapped_early(start, end);
	r = &early_res[i];
	if (i >= max_early_res || r->end != end || r->start != start)
		panic("free_early on not reserved area: %llx-%llx!",
			 start, end - 1);

	drop_range(i);
}

#ifdef CONFIG_NO_BOOTMEM
static void __init subtract_early_res(struct range *range, int az)
{
	int i, count;
	u64 final_start, final_end;
	int idx = 0;

	count  = 0;
	for (i = 0; i < max_early_res && early_res[i].end; i++)
		count++;

	/* need to skip first one ?*/
	if (early_res != early_res_x)
		idx = 1;

#define DEBUG_PRINT_EARLY_RES 1

#if DEBUG_PRINT_EARLY_RES
	printk(KERN_INFO "Subtract (%d early reservations)\n", count);
#endif
	for (i = idx; i < count; i++) {
		struct early_res *r = &early_res[i];
#if DEBUG_PRINT_EARLY_RES
		printk(KERN_INFO "  #%d [%010llx - %010llx] %15s\n", i,
			r->start, r->end, r->name);
#endif
		final_start = PFN_DOWN(r->start);
		final_end = PFN_UP(r->end);
		if (final_start >= final_end)
			continue;
		subtract_range(range, az, final_start, final_end);
	}

}

int __init get_free_all_memory_range(struct range **rangep, int nodeid)
{
	int i, count;
	u64 start = 0, end;
	u64 size;
	u64 mem;
	struct range *range;
	int nr_range;

	count  = 0;
	for (i = 0; i < max_early_res && early_res[i].end; i++)
		count++;

	count *= 2;

	size = sizeof(struct range) * count;
#ifdef MAX_DMA32_PFN
	if (max_pfn_mapped > MAX_DMA32_PFN)
		start = MAX_DMA32_PFN << PAGE_SHIFT;
#endif
	end = max_pfn_mapped << PAGE_SHIFT;
	mem = find_e820_area(start, end, size, sizeof(struct range));
	if (mem == -1ULL)
		panic("can not find more space for range free");

	range = __va(mem);
	/* use early_node_map[] and early_res to get range array at first */
	memset(range, 0, size);
	nr_range = 0;

	/* need to go over early_node_map to find out good range for node */
	nr_range = add_from_early_node_map(range, count, nr_range, nodeid);
	subtract_early_res(range, count);
	nr_range = clean_sort_range(range, count);

	/* need to clear it ? */
	if (nodeid == MAX_NUMNODES) {
		memset(&early_res[0], 0,
			 sizeof(struct early_res) * max_early_res);
		early_res = NULL;
		max_early_res = 0;
	}

	*rangep = range;
	return nr_range;
}
#else
void __init early_res_to_bootmem(u64 start, u64 end)
{
	int i, count;
	u64 final_start, final_end;
	int idx = 0;

	count  = 0;
	for (i = 0; i < max_early_res && early_res[i].end; i++)
		count++;

	/* need to skip first one ?*/
	if (early_res != early_res_x)
		idx = 1;

	printk(KERN_INFO "(%d/%d early reservations) ==> bootmem [%010llx - %010llx]\n",
			 count - idx, max_early_res, start, end);
	for (i = idx; i < count; i++) {
		struct early_res *r = &early_res[i];
		printk(KERN_INFO "  #%d [%010llx - %010llx] %16s", i,
			r->start, r->end, r->name);
		final_start = max(start, r->start);
		final_end = min(end, r->end);
		if (final_start >= final_end) {
			printk(KERN_CONT "\n");
			continue;
		}
		printk(KERN_CONT " ==> [%010llx - %010llx]\n",
			final_start, final_end);
		reserve_bootmem_generic(final_start, final_end - final_start,
				BOOTMEM_DEFAULT);
	}
	/* clear them */
	memset(&early_res[0], 0, sizeof(struct early_res) * max_early_res);
	early_res = NULL;
	max_early_res = 0;
	early_res_count = 0;
}
#endif

/* Check for already reserved areas */
static inline int __init bad_addr(u64 *addrp, u64 size, u64 align)
{
	int i;
	u64 addr = *addrp;
	int changed = 0;
	struct early_res *r;
again:
	i = find_overlapped_early(addr, addr + size);
	r = &early_res[i];
	if (i < max_early_res && r->end) {
		*addrp = addr = round_up(r->end, align);
		changed = 1;
		goto again;
	}
	return changed;
}

/* Check for already reserved areas */
static inline int __init bad_addr_size(u64 *addrp, u64 *sizep, u64 align)
{
	int i;
	u64 addr = *addrp, last;
	u64 size = *sizep;
	int changed = 0;
again:
	last = addr + size;
	for (i = 0; i < max_early_res && early_res[i].end; i++) {
		struct early_res *r = &early_res[i];
		if (last > r->start && addr < r->start) {
			size = r->start - addr;
			changed = 1;
			goto again;
		}
		if (last > r->end && addr < r->end) {
			addr = round_up(r->end, align);
			size = last - addr;
			changed = 1;
			goto again;
		}
		if (last <= r->end && addr >= r->start) {
			(*sizep)++;
			return 0;
		}
	}
	if (changed) {
		*addrp = addr;
		*sizep = size;
	}
	return changed;
}

/*
 * Find a free area with specified alignment in a specific range.
 * only with the area.between start to end is active range from early_node_map
 * so they are good as RAM
 */
u64 __init find_early_area(u64 ei_start, u64 ei_last, u64 start, u64 end,
			 u64 size, u64 align)
{
	u64 addr, last;

	addr = round_up(ei_start, align);
	if (addr < start)
		addr = round_up(start, align);
	if (addr >= ei_last)
		goto out;
	while (bad_addr(&addr, size, align) && addr+size <= ei_last)
		;
	last = addr + size;
	if (last > ei_last)
		goto out;
	if (last > end)
		goto out;

	return addr;

out:
	return -1ULL;
}

u64 __init find_early_area_size(u64 ei_start, u64 ei_last, u64 start,
			 u64 *sizep, u64 align)
{
	u64 addr, last;

	addr = round_up(ei_start, align);
	if (addr < start)
		addr = round_up(start, align);
	if (addr >= ei_last)
		goto out;
	*sizep = ei_last - addr;
	while (bad_addr_size(&addr, sizep, align) && addr + *sizep <= ei_last)
		;
	last = addr + *sizep;
	if (last > ei_last)
		goto out;

	return addr;

out:
	return -1ULL;
}
Commit	Line	Data
a678c2be YL	1	/*
	2	* early_res, could be used to replace bootmem
	3	*/
	4	#include <linux/kernel.h>
	5	#include <linux/types.h>
	6	#include <linux/init.h>
	7	#include <linux/bootmem.h>
	8	#include <linux/mm.h>
	9
	10	#include <asm/e820.h>
	11	#include <asm/early_res.h>
	12	#include <asm/proto.h>
	13
	14	/*
	15	* Early reserved memory areas.
	16	*/
	17	/*
	18	* need to make sure this one is bigger enough before
	19	* find_e820_area could be used
	20	*/
	21	#define MAX_EARLY_RES_X 32
	22
	23	struct early_res {
	24	u64 start, end;
	25	char name[15];
	26	char overlap_ok;
	27	};
	28	static struct early_res early_res_x[MAX_EARLY_RES_X] __initdata;
	29
	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;
	33
	34	static int __init find_overlapped_early(u64 start, u64 end)
	35	{
	36	int i;
	37	struct early_res *r;
	38
	39	for (i = 0; i < max_early_res && early_res[i].end; i++) {
	40	r = &early_res[i];
	41	if (end > r->start && start < r->end)
	42	break;
	43	}
	44
	45	return i;
	46	}
	47
	48	/*
	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.
	52	*/
	53	static void __init drop_range(int i)
	54	{
	55	int j;
	56
	57	for (j = i + 1; j < max_early_res && early_res[j].end; j++)
	58	;
	59
	60	memmove(&early_res[i], &early_res[i + 1],
	61	(j - 1 - i) * sizeof(struct early_res));
	62
	63	early_res[j - 1].end = 0;
	64	early_res_count--;
65	}
66
67	/*
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.
76	*/
77	static void __init drop_overlaps_that_are_ok(u64 start, u64 end)
78	{
79	int i;
80	struct early_res *r;
81	u64 lower_start, lower_end;
82	u64 upper_start, upper_end;
83	char name[15];
84
85	for (i = 0; i < max_early_res && early_res[i].end; i++) {
86	r = &early_res[i];
87
88	/* Continue past non-overlapping ranges */
89	if (end <= r->start \|\| start >= r->end)
90	continue;
91
92	/*
93	* Leave non-ok overlaps as is; let caller
94	* panic "Overlapping early reservations"
95	* when it hits this overlap.
96	*/
97	if (!r->overlap_ok)
98	return;
99
100	/*
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.
105	*/
106
107	/* 1. Note any non-overlapping (lower or upper) ranges. */
108	strncpy(name, r->name, sizeof(name) - 1);
109
110	lower_start = lower_end = 0;
111	upper_start = upper_end = 0;
112	if (r->start < start) {
113	lower_start = r->start;
114	lower_end = start;
115	}
116	if (r->end > end) {
117	upper_start = end;
118	upper_end = r->end;
119	}
120
121	/* 2. Drop the original ok overlapping range */
122	drop_range(i);
123
124	i--; /* resume for-loop on copied down entry */
125
126	/* 3. Add back in any non-overlapping ranges. */
127	if (lower_end)
128	reserve_early_overlap_ok(lower_start, lower_end, name);
129	if (upper_end)
130	reserve_early_overlap_ok(upper_start, upper_end, name);
131	}
132	}
133
134	static void __init __reserve_early(u64 start, u64 end, char *name,
135	int overlap_ok)
136	{
137	int i;
138	struct early_res *r;
139
140	i = find_overlapped_early(start, end);
141	if (i >= max_early_res)
142	panic("Too many early reservations");
143	r = &early_res[i];
144	if (r->end)
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);
149	r->start = start;
150	r->end = end;
151	r->overlap_ok = overlap_ok;
152	if (name)
153	strncpy(r->name, name, sizeof(r->name) - 1);
154	early_res_count++;
155	}
156
157	/*
158	* A few early reservtations come here.
159	*
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
163	* overlap this one.
164	*
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.
169	*
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
175	* the future.
176	*/
177	void __init reserve_early_overlap_ok(u64 start, u64 end, char *name)
178	{
179	drop_overlaps_that_are_ok(start, end);
180	__reserve_early(start, end, name, 1);
181	}
182
183	static void __init __check_and_double_early_res(u64 start)
184	{
185	u64 end, size, mem;
186	struct early_res *new;
187
188	/* do we have enough slots left ? */
189	if ((max_early_res - early_res_count) > max(max_early_res/8, 2))
190	return;
191
192	/* double it */
193	end = max_pfn_mapped << PAGE_SHIFT;
194	size = sizeof(struct early_res) * max_early_res * 2;
195	mem = find_e820_area(start, end, size, sizeof(struct early_res));
196
197	if (mem == -1ULL)
198	panic("can not find more space for early_res array");
199
200	new = __va(mem);
201	/* save the first one for own */
202	new[0].start = mem;
203	new[0].end = mem + size;
204	new[0].overlap_ok = 0;
205	/* copy old to new */
206	if (early_res == early_res_x) {
207	memcpy(&new[1], &early_res[0],
208	sizeof(struct early_res) * max_early_res);
209	memset(&new[max_early_res+1], 0,
210	sizeof(struct early_res) * (max_early_res - 1));
211	early_res_count++;
212	} else {
213	memcpy(&new[1], &early_res[1],
214	sizeof(struct early_res) * (max_early_res - 1));
215	memset(&new[max_early_res], 0,
216	sizeof(struct early_res) * max_early_res);
217	}
218	memset(&early_res[0], 0, sizeof(struct early_res) * max_early_res);
219	early_res = new;
220	max_early_res *= 2;
221	printk(KERN_DEBUG "early_res array is doubled to %d at [%llx - %llx]\n",
222	max_early_res, mem, mem + size - 1);
223	}
224
225	/*
226	* Most early reservations come here.
227	*
228	* We first have drop_overlaps_that_are_ok() drop any pre-existing
229	* 'overlap_ok' ranges, so that we can then reserve this memory
230	* range without risk of panic'ing on an overlapping overlap_ok
231	* early reservation.
232	*/
233	void __init reserve_early(u64 start, u64 end, char *name)
234	{
235	if (start >= end)
236	return;
237
238	__check_and_double_early_res(end);
239
240	drop_overlaps_that_are_ok(start, end);
241	__reserve_early(start, end, name, 0);
242	}
243
244	void __init reserve_early_without_check(u64 start, u64 end, char *name)
245	{
246	struct early_res *r;
247
248	if (start >= end)
249	return;
250
251	__check_and_double_early_res(end);
252
253	r = &early_res[early_res_count];
254
255	r->start = start;
256	r->end = end;
257	r->overlap_ok = 0;
258	if (name)
259	strncpy(r->name, name, sizeof(r->name) - 1);
260	early_res_count++;
261	}
262
263	void __init free_early(u64 start, u64 end)
264	{
265	struct early_res *r;
266	int i;
267
268	i = find_overlapped_early(start, end);
269	r = &early_res[i];
270	if (i >= max_early_res \|\| r->end != end \|\| r->start != start)
271	panic("free_early on not reserved area: %llx-%llx!",
272	start, end - 1);
273
274	drop_range(i);
275	}
276
277	#ifdef CONFIG_NO_BOOTMEM
278	static void __init subtract_early_res(struct range *range, int az)
279	{
280	int i, count;
281	u64 final_start, final_end;
282	int idx = 0;
283
284	count = 0;
285	for (i = 0; i < max_early_res && early_res[i].end; i++)
286	count++;
287
288	/* need to skip first one ?*/
289	if (early_res != early_res_x)
290	idx = 1;
291
292	#define DEBUG_PRINT_EARLY_RES 1
293
294	#if DEBUG_PRINT_EARLY_RES
295	printk(KERN_INFO "Subtract (%d early reservations)\n", count);
296	#endif
297	for (i = idx; i < count; i++) {
298	struct early_res *r = &early_res[i];
299	#if DEBUG_PRINT_EARLY_RES
300	printk(KERN_INFO " #%d [%010llx - %010llx] %15s\n", i,
301	r->start, r->end, r->name);
302	#endif
303	final_start = PFN_DOWN(r->start);
304	final_end = PFN_UP(r->end);
305	if (final_start >= final_end)
306	continue;
307	subtract_range(range, az, final_start, final_end);
308	}
309
310	}
311
312	int __init get_free_all_memory_range(struct range **rangep, int nodeid)
313	{
314	int i, count;
315	u64 start = 0, end;
316	u64 size;
317	u64 mem;
318	struct range *range;
319	int nr_range;
320
321	count = 0;
322	for (i = 0; i < max_early_res && early_res[i].end; i++)
323	count++;
324
325	count *= 2;
326
327	size = sizeof(struct range) * count;
328	#ifdef MAX_DMA32_PFN
329	if (max_pfn_mapped > MAX_DMA32_PFN)
330	start = MAX_DMA32_PFN << PAGE_SHIFT;
331	#endif
332	end = max_pfn_mapped << PAGE_SHIFT;
333	mem = find_e820_area(start, end, size, sizeof(struct range));
334	if (mem == -1ULL)
335	panic("can not find more space for range free");
336
337	range = __va(mem);
338	/* use early_node_map[] and early_res to get range array at first */
339	memset(range, 0, size);
340	nr_range = 0;
341
342	/* need to go over early_node_map to find out good range for node */
343	nr_range = add_from_early_node_map(range, count, nr_range, nodeid);
344	subtract_early_res(range, count);
345	nr_range = clean_sort_range(range, count);
346
347	/* need to clear it ? */
348	if (nodeid == MAX_NUMNODES) {
349	memset(&early_res[0], 0,
350	sizeof(struct early_res) * max_early_res);
351	early_res = NULL;
352	max_early_res = 0;
353	}
354
355	*rangep = range;
356	return nr_range;
357	}
358	#else
359	void __init early_res_to_bootmem(u64 start, u64 end)
360	{
361	int i, count;
362	u64 final_start, final_end;
363	int idx = 0;
364
365	count = 0;
366	for (i = 0; i < max_early_res && early_res[i].end; i++)
367	count++;
368
369	/* need to skip first one ?*/
370	if (early_res != early_res_x)
371	idx = 1;
372
373	printk(KERN_INFO "(%d/%d early reservations) ==> bootmem [%010llx - %010llx]\n",
374	count - idx, max_early_res, start, end);
375	for (i = idx; i < count; i++) {
376	struct early_res *r = &early_res[i];
377	printk(KERN_INFO " #%d [%010llx - %010llx] %16s", i,
378	r->start, r->end, r->name);
379	final_start = max(start, r->start);
380	final_end = min(end, r->end);
381	if (final_start >= final_end) {
382	printk(KERN_CONT "\n");
383	continue;
384	}
385	printk(KERN_CONT " ==> [%010llx - %010llx]\n",
386	final_start, final_end);
387	reserve_bootmem_generic(final_start, final_end - final_start,
388	BOOTMEM_DEFAULT);
389	}
390	/* clear them */
391	memset(&early_res[0], 0, sizeof(struct early_res) * max_early_res);
392	early_res = NULL;
393	max_early_res = 0;
394	early_res_count = 0;
395	}
396	#endif
397
398	/* Check for already reserved areas */
399	static inline int __init bad_addr(u64 *addrp, u64 size, u64 align)
400	{
401	int i;
402	u64 addr = *addrp;
403	int changed = 0;
404	struct early_res *r;
405	again:
406	i = find_overlapped_early(addr, addr + size);
407	r = &early_res[i];
408	if (i < max_early_res && r->end) {
409	*addrp = addr = round_up(r->end, align);
410	changed = 1;
411	goto again;
412	}
413	return changed;
414	}
415
416	/* Check for already reserved areas */
417	static inline int __init bad_addr_size(u64 addrp, u64 sizep, u64 align)
418	{
419	int i;
420	u64 addr = *addrp, last;
421	u64 size = *sizep;
422	int changed = 0;
423	again:
424	last = addr + size;
425	for (i = 0; i < max_early_res && early_res[i].end; i++) {
426	struct early_res *r = &early_res[i];
427	if (last > r->start && addr < r->start) {
428	size = r->start - addr;
429	changed = 1;
430	goto again;
431	}
432	if (last > r->end && addr < r->end) {
433	addr = round_up(r->end, align);
434	size = last - addr;
435	changed = 1;
436	goto again;
437	}
438	if (last <= r->end && addr >= r->start) {
439	(*sizep)++;
440	return 0;
441	}
442	}
443	if (changed) {
444	*addrp = addr;
445	*sizep = size;
446	}
447	return changed;
448	}
449
450	/*
451	* Find a free area with specified alignment in a specific range.
452	* only with the area.between start to end is active range from early_node_map
453	* so they are good as RAM
454	*/
455	u64 __init find_early_area(u64 ei_start, u64 ei_last, u64 start, u64 end,
456	u64 size, u64 align)
457	{
458	u64 addr, last;
459
460	addr = round_up(ei_start, align);
461	if (addr < start)
462	addr = round_up(start, align);
463	if (addr >= ei_last)
464	goto out;
465	while (bad_addr(&addr, size, align) && addr+size <= ei_last)
466	;
467	last = addr + size;
468	if (last > ei_last)
469	goto out;
470	if (last > end)
471	goto out;
472
473	return addr;
474
475	out:
476	return -1ULL;
477	}
478
7da657d1 YL	479	u64 __init find_early_area_size(u64 ei_start, u64 ei_last, u64 start,
	480	u64 *sizep, u64 align)
	481	{
	482	u64 addr, last;
	483
	484	addr = round_up(ei_start, align);
	485	if (addr < start)
	486	addr = round_up(start, align);
	487	if (addr >= ei_last)
	488	goto out;
	489	*sizep = ei_last - addr;
	490	while (bad_addr_size(&addr, sizep, align) && addr + *sizep <= ei_last)
	491	;
	492	last = addr + *sizep;
	493	if (last > ei_last)
	494	goto out;
	495
	496	return addr;
	497
	498	out:
	499	return -1ULL;
	500	}