[linux-block.git] / lib / lmb.c

/*
 * Procedures for maintaining information about logical memory blocks.
 *
 * Peter Bergner, IBM Corp.	June 2001.
 * Copyright (C) 2001 Peter Bergner.
 *
 *      This program is free software; you can redistribute it and/or
 *      modify it under the terms of the GNU General Public License
 *      as published by the Free Software Foundation; either version
 *      2 of the License, or (at your option) any later version.
 */

#include <linux/kernel.h>
#include <linux/init.h>
#include <linux/bitops.h>
#include <linux/lmb.h>

#undef DEBUG

#ifdef DEBUG
#define DBG(fmt...) LMB_DBG(fmt)
#else
#define DBG(fmt...)
#endif

#define LMB_ALLOC_ANYWHERE	0

struct lmb lmb;

void lmb_dump_all(void)
{
#ifdef DEBUG
	unsigned long i;

	DBG("lmb_dump_all:\n");
	DBG("    memory.cnt		  = 0x%lx\n", lmb.memory.cnt);
	DBG("    memory.size		  = 0x%lx\n", lmb.memory.size);
	for (i=0; i < lmb.memory.cnt ;i++) {
		DBG("    memory.region[0x%x].base       = 0x%lx\n",
			    i, lmb.memory.region[i].base);
		DBG("		      .size     = 0x%lx\n",
			    lmb.memory.region[i].size);
	}

	DBG("\n    reserved.cnt	  = 0x%lx\n", lmb.reserved.cnt);
	DBG("    reserved.size	  = 0x%lx\n", lmb.reserved.size);
	for (i=0; i < lmb.reserved.cnt ;i++) {
		DBG("    reserved.region[0x%x].base       = 0x%lx\n",
			    i, lmb.reserved.region[i].base);
		DBG("		      .size     = 0x%lx\n",
			    lmb.reserved.region[i].size);
	}
#endif /* DEBUG */
}

static unsigned long __init lmb_addrs_overlap(unsigned long base1,
		unsigned long size1, unsigned long base2, unsigned long size2)
{
	return ((base1 < (base2+size2)) && (base2 < (base1+size1)));
}

static long __init lmb_addrs_adjacent(unsigned long base1, unsigned long size1,
		unsigned long base2, unsigned long size2)
{
	if (base2 == base1 + size1)
		return 1;
	else if (base1 == base2 + size2)
		return -1;

	return 0;
}

static long __init lmb_regions_adjacent(struct lmb_region *rgn,
		unsigned long r1, unsigned long r2)
{
	unsigned long base1 = rgn->region[r1].base;
	unsigned long size1 = rgn->region[r1].size;
	unsigned long base2 = rgn->region[r2].base;
	unsigned long size2 = rgn->region[r2].size;

	return lmb_addrs_adjacent(base1, size1, base2, size2);
}

static void __init lmb_remove_region(struct lmb_region *rgn, unsigned long r)
{
	unsigned long i;

	for (i = r; i < rgn->cnt - 1; i++) {
		rgn->region[i].base = rgn->region[i + 1].base;
		rgn->region[i].size = rgn->region[i + 1].size;
	}
	rgn->cnt--;
}

/* Assumption: base addr of region 1 < base addr of region 2 */
static void __init lmb_coalesce_regions(struct lmb_region *rgn,
		unsigned long r1, unsigned long r2)
{
	rgn->region[r1].size += rgn->region[r2].size;
	lmb_remove_region(rgn, r2);
}

/* This routine called with relocation disabled. */
void __init lmb_init(void)
{
	/* Create a dummy zero size LMB which will get coalesced away later.
	 * This simplifies the lmb_add() code below...
	 */
	lmb.memory.region[0].base = 0;
	lmb.memory.region[0].size = 0;
	lmb.memory.cnt = 1;

	/* Ditto. */
	lmb.reserved.region[0].base = 0;
	lmb.reserved.region[0].size = 0;
	lmb.reserved.cnt = 1;
}

/* This routine may be called with relocation disabled. */
void __init lmb_analyze(void)
{
	int i;

	lmb.memory.size = 0;

	for (i = 0; i < lmb.memory.cnt; i++)
		lmb.memory.size += lmb.memory.region[i].size;
}

/* This routine called with relocation disabled. */
static long __init lmb_add_region(struct lmb_region *rgn, unsigned long base,
				  unsigned long size)
{
	unsigned long coalesced = 0;
	long adjacent, i;

	if ((rgn->cnt == 1) && (rgn->region[0].size == 0)) {
		rgn->region[0].base = base;
		rgn->region[0].size = size;
		return 0;
	}

	/* First try and coalesce this LMB with another. */
	for (i=0; i < rgn->cnt; i++) {
		unsigned long rgnbase = rgn->region[i].base;
		unsigned long rgnsize = rgn->region[i].size;

		if ((rgnbase == base) && (rgnsize == size))
			/* Already have this region, so we're done */
			return 0;

		adjacent = lmb_addrs_adjacent(base,size,rgnbase,rgnsize);
		if ( adjacent > 0 ) {
			rgn->region[i].base -= size;
			rgn->region[i].size += size;
			coalesced++;
			break;
		}
		else if ( adjacent < 0 ) {
			rgn->region[i].size += size;
			coalesced++;
			break;
		}
	}

	if ((i < rgn->cnt-1) && lmb_regions_adjacent(rgn, i, i+1) ) {
		lmb_coalesce_regions(rgn, i, i+1);
		coalesced++;
	}

	if (coalesced)
		return coalesced;
	if (rgn->cnt >= MAX_LMB_REGIONS)
		return -1;

	/* Couldn't coalesce the LMB, so add it to the sorted table. */
	for (i = rgn->cnt-1; i >= 0; i--) {
		if (base < rgn->region[i].base) {
			rgn->region[i+1].base = rgn->region[i].base;
			rgn->region[i+1].size = rgn->region[i].size;
		} else {
			rgn->region[i+1].base = base;
			rgn->region[i+1].size = size;
			break;
		}
	}
	rgn->cnt++;

	return 0;
}

/* This routine may be called with relocation disabled. */
long __init lmb_add(unsigned long base, unsigned long size)
{
	struct lmb_region *_rgn = &(lmb.memory);

	/* On pSeries LPAR systems, the first LMB is our RMO region. */
	if (base == 0)
		lmb.rmo_size = size;

	return lmb_add_region(_rgn, base, size);

}

long __init lmb_reserve(unsigned long base, unsigned long size)
{
	struct lmb_region *_rgn = &(lmb.reserved);

	BUG_ON(0 == size);

	return lmb_add_region(_rgn, base, size);
}

long __init lmb_overlaps_region(struct lmb_region *rgn, unsigned long base,
				unsigned long size)
{
	unsigned long i;

	for (i=0; i < rgn->cnt; i++) {
		unsigned long rgnbase = rgn->region[i].base;
		unsigned long rgnsize = rgn->region[i].size;
		if ( lmb_addrs_overlap(base,size,rgnbase,rgnsize) ) {
			break;
		}
	}

	return (i < rgn->cnt) ? i : -1;
}

unsigned long __init lmb_alloc(unsigned long size, unsigned long align)
{
	return lmb_alloc_base(size, align, LMB_ALLOC_ANYWHERE);
}

unsigned long __init lmb_alloc_base(unsigned long size, unsigned long align,
				    unsigned long max_addr)
{
	unsigned long alloc;

	alloc = __lmb_alloc_base(size, align, max_addr);

	if (alloc == 0)
		panic("ERROR: Failed to allocate 0x%lx bytes below 0x%lx.\n",
				size, max_addr);

	return alloc;
}

static unsigned long lmb_align_down(unsigned long addr, unsigned long size)
{
	return addr & ~(size - 1);
}

static unsigned long lmb_align_up(unsigned long addr, unsigned long size)
{
	return (addr + (size - 1)) & ~(size - 1);
}

unsigned long __init __lmb_alloc_base(unsigned long size, unsigned long align,
				    unsigned long max_addr)
{
	long i, j;
	unsigned long base = 0;

	BUG_ON(0 == size);

	/* On some platforms, make sure we allocate lowmem */
	if (max_addr == LMB_ALLOC_ANYWHERE)
		max_addr = LMB_REAL_LIMIT;

	for (i = lmb.memory.cnt-1; i >= 0; i--) {
		unsigned long lmbbase = lmb.memory.region[i].base;
		unsigned long lmbsize = lmb.memory.region[i].size;

		if (max_addr == LMB_ALLOC_ANYWHERE)
			base = lmb_align_down(lmbbase + lmbsize - size, align);
		else if (lmbbase < max_addr) {
			base = min(lmbbase + lmbsize, max_addr);
			base = lmb_align_down(base - size, align);
		} else
			continue;

		while ((lmbbase <= base) &&
		       ((j = lmb_overlaps_region(&lmb.reserved, base, size)) >= 0) )
			base = lmb_align_down(lmb.reserved.region[j].base - size,
					      align);

		if ((base != 0) && (lmbbase <= base))
			break;
	}

	if (i < 0)
		return 0;

	if (lmb_add_region(&lmb.reserved, base, lmb_align_up(size, align)) < 0)
		return 0;

	return base;
}

/* You must call lmb_analyze() before this. */
unsigned long __init lmb_phys_mem_size(void)
{
	return lmb.memory.size;
}

unsigned long __init lmb_end_of_DRAM(void)
{
	int idx = lmb.memory.cnt - 1;

	return (lmb.memory.region[idx].base + lmb.memory.region[idx].size);
}

/* You must call lmb_analyze() after this. */
void __init lmb_enforce_memory_limit(unsigned long memory_limit)
{
	unsigned long i, limit;
	struct lmb_property *p;

	if (! memory_limit)
		return;

	/* Truncate the lmb regions to satisfy the memory limit. */
	limit = memory_limit;
	for (i = 0; i < lmb.memory.cnt; i++) {
		if (limit > lmb.memory.region[i].size) {
			limit -= lmb.memory.region[i].size;
			continue;
		}

		lmb.memory.region[i].size = limit;
		lmb.memory.cnt = i + 1;
		break;
	}

	if (lmb.memory.region[0].size < lmb.rmo_size)
		lmb.rmo_size = lmb.memory.region[0].size;

	/* And truncate any reserves above the limit also. */
	for (i = 0; i < lmb.reserved.cnt; i++) {
		p = &lmb.reserved.region[i];

		if (p->base > memory_limit)
			p->size = 0;
		else if ((p->base + p->size) > memory_limit)
			p->size = memory_limit - p->base;

		if (p->size == 0) {
			lmb_remove_region(&lmb.reserved, i);
			i--;
		}
	}
}

int __init lmb_is_reserved(unsigned long addr)
{
	int i;

	for (i = 0; i < lmb.reserved.cnt; i++) {
		unsigned long upper = lmb.reserved.region[i].base +
				      lmb.reserved.region[i].size - 1;
		if ((addr >= lmb.reserved.region[i].base) && (addr <= upper))
			return 1;
	}
	return 0;
}
Commit	Line	Data
7c8c6b97 PM	1	/*
	2	* Procedures for maintaining information about logical memory blocks.
	3	*
	4	* Peter Bergner, IBM Corp. June 2001.
	5	* Copyright (C) 2001 Peter Bergner.
d9b2b2a2	6	*
7c8c6b97 PM	7	* This program is free software; you can redistribute it and/or
	8	* modify it under the terms of the GNU General Public License
	9	* as published by the Free Software Foundation; either version
	10	* 2 of the License, or (at your option) any later version.
	11	*/
	12
7c8c6b97 PM	13	#include <linux/kernel.h>
	14	#include <linux/init.h>
	15	#include <linux/bitops.h>
d9b2b2a2	16	#include <linux/lmb.h>
7c8c6b97	17
7c8c6b97 PM	18	#undef DEBUG
7c8c6b97 PM	19
eb481899	20	#ifdef DEBUG
d9b2b2a2	21	#define DBG(fmt...) LMB_DBG(fmt)
eb481899 ME	22	#else
	23	#define DBG(fmt...)
	24	#endif
	25
3b9331da ME	26	#define LMB_ALLOC_ANYWHERE 0
3b9331da ME	27
eb481899 ME	28	struct lmb lmb;
eb481899 ME	29
7c8c6b97 PM	30	void lmb_dump_all(void)
	31	{
	32	#ifdef DEBUG
	33	unsigned long i;
	34
eb481899 ME	35	DBG("lmb_dump_all:\n");
	36	DBG(" memory.cnt = 0x%lx\n", lmb.memory.cnt);
	37	DBG(" memory.size = 0x%lx\n", lmb.memory.size);
7c8c6b97	38	for (i=0; i < lmb.memory.cnt ;i++) {
eb481899	39	DBG(" memory.region[0x%x].base = 0x%lx\n",
7c8c6b97	40	i, lmb.memory.region[i].base);
eb481899	41	DBG(" .size = 0x%lx\n",
7c8c6b97 PM	42	lmb.memory.region[i].size);
	43	}
	44
eb481899 ME	45	DBG("\n reserved.cnt = 0x%lx\n", lmb.reserved.cnt);
eb481899 ME	46	DBG(" reserved.size = 0x%lx\n", lmb.reserved.size);
7c8c6b97	47	for (i=0; i < lmb.reserved.cnt ;i++) {
eb481899	48	DBG(" reserved.region[0x%x].base = 0x%lx\n",
7c8c6b97	49	i, lmb.reserved.region[i].base);
eb481899	50	DBG(" .size = 0x%lx\n",
7c8c6b97 PM	51	lmb.reserved.region[i].size);
	52	}
	53	#endif /* DEBUG */
	54	}
	55
	56	static unsigned long __init lmb_addrs_overlap(unsigned long base1,
	57	unsigned long size1, unsigned long base2, unsigned long size2)
	58	{
	59	return ((base1 < (base2+size2)) && (base2 < (base1+size1)));
	60	}
	61
	62	static long __init lmb_addrs_adjacent(unsigned long base1, unsigned long size1,
	63	unsigned long base2, unsigned long size2)
	64	{
	65	if (base2 == base1 + size1)
	66	return 1;
	67	else if (base1 == base2 + size2)
	68	return -1;
	69
	70	return 0;
	71	}
	72
	73	static long __init lmb_regions_adjacent(struct lmb_region *rgn,
	74	unsigned long r1, unsigned long r2)
	75	{
	76	unsigned long base1 = rgn->region[r1].base;
	77	unsigned long size1 = rgn->region[r1].size;
	78	unsigned long base2 = rgn->region[r2].base;
	79	unsigned long size2 = rgn->region[r2].size;
	80
	81	return lmb_addrs_adjacent(base1, size1, base2, size2);
	82	}
	83
2babf5c2	84	static void __init lmb_remove_region(struct lmb_region *rgn, unsigned long r)
7c8c6b97 PM	85	{
	86	unsigned long i;
	87
2babf5c2 ME	88	for (i = r; i < rgn->cnt - 1; i++) {
	89	rgn->region[i].base = rgn->region[i + 1].base;
	90	rgn->region[i].size = rgn->region[i + 1].size;
7c8c6b97 PM	91	}
	92	rgn->cnt--;
	93	}
	94
2babf5c2 ME	95	/* Assumption: base addr of region 1 < base addr of region 2 */
	96	static void __init lmb_coalesce_regions(struct lmb_region *rgn,
	97	unsigned long r1, unsigned long r2)
	98	{
	99	rgn->region[r1].size += rgn->region[r2].size;
	100	lmb_remove_region(rgn, r2);
	101	}
	102
7c8c6b97 PM	103	/* This routine called with relocation disabled. */
	104	void __init lmb_init(void)
	105	{
	106	/* Create a dummy zero size LMB which will get coalesced away later.
	107	* This simplifies the lmb_add() code below...
	108	*/
	109	lmb.memory.region[0].base = 0;
	110	lmb.memory.region[0].size = 0;
	111	lmb.memory.cnt = 1;
	112
	113	/* Ditto. */
	114	lmb.reserved.region[0].base = 0;
	115	lmb.reserved.region[0].size = 0;
	116	lmb.reserved.cnt = 1;
	117	}
	118
	119	/* This routine may be called with relocation disabled. */
	120	void __init lmb_analyze(void)
	121	{
	122	int i;
	123
	124	lmb.memory.size = 0;
	125
	126	for (i = 0; i < lmb.memory.cnt; i++)
	127	lmb.memory.size += lmb.memory.region[i].size;
	128	}
	129
	130	/* This routine called with relocation disabled. */
	131	static long __init lmb_add_region(struct lmb_region *rgn, unsigned long base,
	132	unsigned long size)
	133	{
56d6d1a7 MA	134	unsigned long coalesced = 0;
56d6d1a7 MA	135	long adjacent, i;
7c8c6b97	136
27e6672b KG	137	if ((rgn->cnt == 1) && (rgn->region[0].size == 0)) {
	138	rgn->region[0].base = base;
	139	rgn->region[0].size = size;
	140	return 0;
	141	}
	142
7c8c6b97 PM	143	/* First try and coalesce this LMB with another. */
	144	for (i=0; i < rgn->cnt; i++) {
	145	unsigned long rgnbase = rgn->region[i].base;
	146	unsigned long rgnsize = rgn->region[i].size;
	147
eb6de286 DG	148	if ((rgnbase == base) && (rgnsize == size))
	149	/* Already have this region, so we're done */
	150	return 0;
	151
7c8c6b97 PM	152	adjacent = lmb_addrs_adjacent(base,size,rgnbase,rgnsize);
	153	if ( adjacent > 0 ) {
	154	rgn->region[i].base -= size;
	155	rgn->region[i].size += size;
	156	coalesced++;
	157	break;
	158	}
	159	else if ( adjacent < 0 ) {
	160	rgn->region[i].size += size;
	161	coalesced++;
	162	break;
	163	}
	164	}
	165
	166	if ((i < rgn->cnt-1) && lmb_regions_adjacent(rgn, i, i+1) ) {
	167	lmb_coalesce_regions(rgn, i, i+1);
	168	coalesced++;
	169	}
	170
	171	if (coalesced)
	172	return coalesced;
	173	if (rgn->cnt >= MAX_LMB_REGIONS)
	174	return -1;
	175
	176	/* Couldn't coalesce the LMB, so add it to the sorted table. */
	177	for (i = rgn->cnt-1; i >= 0; i--) {
	178	if (base < rgn->region[i].base) {
	179	rgn->region[i+1].base = rgn->region[i].base;
	180	rgn->region[i+1].size = rgn->region[i].size;
	181	} else {
	182	rgn->region[i+1].base = base;
	183	rgn->region[i+1].size = size;
	184	break;
	185	}
	186	}
	187	rgn->cnt++;
	188
	189	return 0;
	190	}
	191
	192	/* This routine may be called with relocation disabled. */
	193	long __init lmb_add(unsigned long base, unsigned long size)
	194	{
	195	struct lmb_region *_rgn = &(lmb.memory);
	196
	197	/* On pSeries LPAR systems, the first LMB is our RMO region. */
	198	if (base == 0)
	199	lmb.rmo_size = size;
	200
	201	return lmb_add_region(_rgn, base, size);
	202
	203	}
	204
	205	long __init lmb_reserve(unsigned long base, unsigned long size)
	206	{
	207	struct lmb_region *_rgn = &(lmb.reserved);
	208
8c20fafa ME	209	BUG_ON(0 == size);
8c20fafa ME	210
7c8c6b97 PM	211	return lmb_add_region(_rgn, base, size);
	212	}
	213
	214	long __init lmb_overlaps_region(struct lmb_region *rgn, unsigned long base,
	215	unsigned long size)
	216	{
	217	unsigned long i;
	218
	219	for (i=0; i < rgn->cnt; i++) {
	220	unsigned long rgnbase = rgn->region[i].base;
	221	unsigned long rgnsize = rgn->region[i].size;
	222	if ( lmb_addrs_overlap(base,size,rgnbase,rgnsize) ) {
	223	break;
	224	}
	225	}
	226
	227	return (i < rgn->cnt) ? i : -1;
	228	}
	229
	230	unsigned long __init lmb_alloc(unsigned long size, unsigned long align)
	231	{
	232	return lmb_alloc_base(size, align, LMB_ALLOC_ANYWHERE);
	233	}
	234
	235	unsigned long __init lmb_alloc_base(unsigned long size, unsigned long align,
	236	unsigned long max_addr)
d7a5b2ff ME	237	{
	238	unsigned long alloc;
	239
	240	alloc = __lmb_alloc_base(size, align, max_addr);
	241
2c276603	242	if (alloc == 0)
d7a5b2ff ME	243	panic("ERROR: Failed to allocate 0x%lx bytes below 0x%lx.\n",
	244	size, max_addr);
	245
	246	return alloc;
	247	}
	248
d9b2b2a2 DM	249	static unsigned long lmb_align_down(unsigned long addr, unsigned long size)
	250	{
	251	return addr & ~(size - 1);
	252	}
	253
eea89e13 DM	254	static unsigned long lmb_align_up(unsigned long addr, unsigned long size)
	255	{
	256	return (addr + (size - 1)) & ~(size - 1);
	257	}
	258
d7a5b2ff ME	259	unsigned long __init __lmb_alloc_base(unsigned long size, unsigned long align,
d7a5b2ff ME	260	unsigned long max_addr)
7c8c6b97 PM	261	{
	262	long i, j;
	263	unsigned long base = 0;
	264
8c20fafa ME	265	BUG_ON(0 == size);
8c20fafa ME	266
d9b2b2a2	267	/* On some platforms, make sure we allocate lowmem */
7c8c6b97	268	if (max_addr == LMB_ALLOC_ANYWHERE)
d9b2b2a2 DM	269	max_addr = LMB_REAL_LIMIT;
d9b2b2a2 DM	270
7c8c6b97 PM	271	for (i = lmb.memory.cnt-1; i >= 0; i--) {
	272	unsigned long lmbbase = lmb.memory.region[i].base;
	273	unsigned long lmbsize = lmb.memory.region[i].size;
	274
	275	if (max_addr == LMB_ALLOC_ANYWHERE)
d9b2b2a2	276	base = lmb_align_down(lmbbase + lmbsize - size, align);
7c8c6b97 PM	277	else if (lmbbase < max_addr) {
7c8c6b97 PM	278	base = min(lmbbase + lmbsize, max_addr);
d9b2b2a2	279	base = lmb_align_down(base - size, align);
7c8c6b97 PM	280	} else
	281	continue;
	282
	283	while ((lmbbase <= base) &&
	284	((j = lmb_overlaps_region(&lmb.reserved, base, size)) >= 0) )
d9b2b2a2 DM	285	base = lmb_align_down(lmb.reserved.region[j].base - size,
d9b2b2a2 DM	286	align);
7c8c6b97 PM	287
	288	if ((base != 0) && (lmbbase <= base))
	289	break;
	290	}
	291
	292	if (i < 0)
	293	return 0;
	294
eea89e13 DM	295	if (lmb_add_region(&lmb.reserved, base, lmb_align_up(size, align)) < 0)
eea89e13 DM	296	return 0;
7c8c6b97 PM	297
	298	return base;
	299	}
	300
	301	/* You must call lmb_analyze() before this. */
	302	unsigned long __init lmb_phys_mem_size(void)
	303	{
	304	return lmb.memory.size;
	305	}
	306
	307	unsigned long __init lmb_end_of_DRAM(void)
	308	{
	309	int idx = lmb.memory.cnt - 1;
	310
	311	return (lmb.memory.region[idx].base + lmb.memory.region[idx].size);
	312	}
	313
2babf5c2	314	/* You must call lmb_analyze() after this. */
7c8c6b97 PM	315	void __init lmb_enforce_memory_limit(unsigned long memory_limit)
	316	{
	317	unsigned long i, limit;
2babf5c2	318	struct lmb_property *p;
7c8c6b97 PM	319
	320	if (! memory_limit)
	321	return;
	322
2babf5c2	323	/* Truncate the lmb regions to satisfy the memory limit. */
7c8c6b97 PM	324	limit = memory_limit;
	325	for (i = 0; i < lmb.memory.cnt; i++) {
	326	if (limit > lmb.memory.region[i].size) {
	327	limit -= lmb.memory.region[i].size;
	328	continue;
	329	}
	330
	331	lmb.memory.region[i].size = limit;
	332	lmb.memory.cnt = i + 1;
	333	break;
	334	}
2babf5c2	335
30f30e13 ME	336	if (lmb.memory.region[0].size < lmb.rmo_size)
30f30e13 ME	337	lmb.rmo_size = lmb.memory.region[0].size;
2babf5c2 ME	338
	339	/* And truncate any reserves above the limit also. */
	340	for (i = 0; i < lmb.reserved.cnt; i++) {
	341	p = &lmb.reserved.region[i];
	342
	343	if (p->base > memory_limit)
	344	p->size = 0;
	345	else if ((p->base + p->size) > memory_limit)
	346	p->size = memory_limit - p->base;
	347
	348	if (p->size == 0) {
	349	lmb_remove_region(&lmb.reserved, i);
	350	i--;
	351	}
	352	}
7c8c6b97	353	}
f98eeb4e KG	354
	355	int __init lmb_is_reserved(unsigned long addr)
	356	{
	357	int i;
	358
	359	for (i = 0; i < lmb.reserved.cnt; i++) {
	360	unsigned long upper = lmb.reserved.region[i].base +
	361	lmb.reserved.region[i].size - 1;
	362	if ((addr >= lmb.reserved.region[i].base) && (addr <= upper))
	363	return 1;
	364	}
	365	return 0;
	366	}