[deliverable/linux.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%llx\n",
	    (unsigned long long)lmb.memory.size);
	for (i=0; i < lmb.memory.cnt ;i++) {
		DBG("    memory.region[0x%x].base       = 0x%llx\n",
		    i, (unsigned long long)lmb.memory.region[i].base);
		DBG("		      .size     = 0x%llx\n",
		    (unsigned long long)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%llx\n",
		    i, (unsigned long long)lmb.reserved.region[i].base);
		DBG("		      .size     = 0x%llx\n",
		    (unsigned long long)lmb.reserved.region[i].size);
	}
#endif /* DEBUG */
}

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

static long __init lmb_addrs_adjacent(u64 base1, u64 size1,
		u64 base2, u64 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)
{
	u64 base1 = rgn->region[r1].base;
	u64 size1 = rgn->region[r1].size;
	u64 base2 = rgn->region[r2].base;
	u64 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, u64 base, u64 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++) {
		u64 rgnbase = rgn->region[i].base;
		u64 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;
		}
	}

	if (base < rgn->region[0].base) {
		rgn->region[0].base = base;
		rgn->region[0].size = size;
	}
	rgn->cnt++;

	return 0;
}

/* This routine may be called with relocation disabled. */
long __init lmb_add(u64 base, u64 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(u64 base, u64 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, u64 base,
				u64 size)
{
	unsigned long i;

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

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

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

u64 __init lmb_alloc_base(u64 size, u64 align, u64 max_addr)
{
	u64 alloc;

	alloc = __lmb_alloc_base(size, align, max_addr);

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

	return alloc;
}

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

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

u64 __init __lmb_alloc_base(u64 size, u64 align, u64 max_addr)
{
	long i, j;
	u64 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--) {
		u64 lmbbase = lmb.memory.region[i].base;
		u64 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. */
u64 __init lmb_phys_mem_size(void)
{
	return lmb.memory.size;
}

u64 __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(u64 memory_limit)
{
	unsigned long i;
	u64 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(u64 addr)
{
	int i;

	for (i = 0; i < lmb.reserved.cnt; i++) {
		u64 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");
eb481899 ME	36	DBG(" memory.cnt = 0x%lx\n", lmb.memory.cnt);
e5f27095 BB	37	DBG(" memory.size = 0x%llx\n",
e5f27095 BB	38	(unsigned long long)lmb.memory.size);
7c8c6b97	39	for (i=0; i < lmb.memory.cnt ;i++) {
e5f27095 BB	40	DBG(" memory.region[0x%x].base = 0x%llx\n",
	41	i, (unsigned long long)lmb.memory.region[i].base);
	42	DBG(" .size = 0x%llx\n",
	43	(unsigned long long)lmb.memory.region[i].size);
7c8c6b97 PM	44	}
7c8c6b97 PM	45
eb481899 ME	46	DBG("\n reserved.cnt = 0x%lx\n", lmb.reserved.cnt);
eb481899 ME	47	DBG(" reserved.size = 0x%lx\n", lmb.reserved.size);
7c8c6b97	48	for (i=0; i < lmb.reserved.cnt ;i++) {
e5f27095 BB	49	DBG(" reserved.region[0x%x].base = 0x%llx\n",
	50	i, (unsigned long long)lmb.reserved.region[i].base);
	51	DBG(" .size = 0x%llx\n",
	52	(unsigned long long)lmb.reserved.region[i].size);
7c8c6b97 PM	53	}
	54	#endif /* DEBUG */
	55	}
	56
e5f27095 BB	57	static unsigned long __init lmb_addrs_overlap(u64 base1,
e5f27095 BB	58	u64 size1, u64 base2, u64 size2)
7c8c6b97 PM	59	{
	60	return ((base1 < (base2+size2)) && (base2 < (base1+size1)));
	61	}
	62
e5f27095 BB	63	static long __init lmb_addrs_adjacent(u64 base1, u64 size1,
e5f27095 BB	64	u64 base2, u64 size2)
7c8c6b97 PM	65	{
	66	if (base2 == base1 + size1)
	67	return 1;
	68	else if (base1 == base2 + size2)
	69	return -1;
	70
	71	return 0;
	72	}
	73
	74	static long __init lmb_regions_adjacent(struct lmb_region *rgn,
	75	unsigned long r1, unsigned long r2)
	76	{
e5f27095 BB	77	u64 base1 = rgn->region[r1].base;
	78	u64 size1 = rgn->region[r1].size;
	79	u64 base2 = rgn->region[r2].base;
	80	u64 size2 = rgn->region[r2].size;
7c8c6b97 PM	81
	82	return lmb_addrs_adjacent(base1, size1, base2, size2);
	83	}
	84
2babf5c2	85	static void __init lmb_remove_region(struct lmb_region *rgn, unsigned long r)
7c8c6b97 PM	86	{
	87	unsigned long i;
	88
2babf5c2 ME	89	for (i = r; i < rgn->cnt - 1; i++) {
	90	rgn->region[i].base = rgn->region[i + 1].base;
	91	rgn->region[i].size = rgn->region[i + 1].size;
7c8c6b97 PM	92	}
	93	rgn->cnt--;
	94	}
	95
2babf5c2 ME	96	/* Assumption: base addr of region 1 < base addr of region 2 */
	97	static void __init lmb_coalesce_regions(struct lmb_region *rgn,
	98	unsigned long r1, unsigned long r2)
	99	{
	100	rgn->region[r1].size += rgn->region[r2].size;
	101	lmb_remove_region(rgn, r2);
	102	}
	103
7c8c6b97 PM	104	/* This routine called with relocation disabled. */
	105	void __init lmb_init(void)
	106	{
	107	/* Create a dummy zero size LMB which will get coalesced away later.
	108	* This simplifies the lmb_add() code below...
	109	*/
	110	lmb.memory.region[0].base = 0;
	111	lmb.memory.region[0].size = 0;
	112	lmb.memory.cnt = 1;
	113
	114	/* Ditto. */
	115	lmb.reserved.region[0].base = 0;
	116	lmb.reserved.region[0].size = 0;
	117	lmb.reserved.cnt = 1;
	118	}
	119
	120	/* This routine may be called with relocation disabled. */
	121	void __init lmb_analyze(void)
	122	{
	123	int i;
	124
	125	lmb.memory.size = 0;
	126
	127	for (i = 0; i < lmb.memory.cnt; i++)
	128	lmb.memory.size += lmb.memory.region[i].size;
	129	}
	130
	131	/* This routine called with relocation disabled. */
e5f27095	132	static long __init lmb_add_region(struct lmb_region *rgn, u64 base, u64 size)
7c8c6b97	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. */
7c8c6b97 PM	144	for (i=0; i < rgn->cnt; i++) {
e5f27095 BB	145	u64 rgnbase = rgn->region[i].base;
e5f27095 BB	146	u64 rgnsize = rgn->region[i].size;
7c8c6b97	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	}
74b20dad KG	187
	188	if (base < rgn->region[0].base) {
	189	rgn->region[0].base = base;
	190	rgn->region[0].size = size;
	191	}
7c8c6b97 PM	192	rgn->cnt++;
	193
	194	return 0;
	195	}
	196
	197	/* This routine may be called with relocation disabled. */
e5f27095	198	long __init lmb_add(u64 base, u64 size)
7c8c6b97 PM	199	{
	200	struct lmb_region *_rgn = &(lmb.memory);
	201
	202	/* On pSeries LPAR systems, the first LMB is our RMO region. */
	203	if (base == 0)
	204	lmb.rmo_size = size;
	205
	206	return lmb_add_region(_rgn, base, size);
	207
	208	}
	209
e5f27095	210	long __init lmb_reserve(u64 base, u64 size)
7c8c6b97 PM	211	{
	212	struct lmb_region *_rgn = &(lmb.reserved);
	213
8c20fafa ME	214	BUG_ON(0 == size);
8c20fafa ME	215
7c8c6b97 PM	216	return lmb_add_region(_rgn, base, size);
	217	}
	218
e5f27095 BB	219	long __init lmb_overlaps_region(struct lmb_region *rgn, u64 base,
e5f27095 BB	220	u64 size)
7c8c6b97 PM	221	{
	222	unsigned long i;
	223
	224	for (i=0; i < rgn->cnt; i++) {
e5f27095 BB	225	u64 rgnbase = rgn->region[i].base;
e5f27095 BB	226	u64 rgnsize = rgn->region[i].size;
7c8c6b97 PM	227	if ( lmb_addrs_overlap(base,size,rgnbase,rgnsize) ) {
	228	break;
	229	}
	230	}
	231
	232	return (i < rgn->cnt) ? i : -1;
	233	}
	234
e5f27095	235	u64 __init lmb_alloc(u64 size, u64 align)
7c8c6b97 PM	236	{
	237	return lmb_alloc_base(size, align, LMB_ALLOC_ANYWHERE);
	238	}
	239
e5f27095	240	u64 __init lmb_alloc_base(u64 size, u64 align, u64 max_addr)
d7a5b2ff	241	{
e5f27095	242	u64 alloc;
d7a5b2ff ME	243
	244	alloc = __lmb_alloc_base(size, align, max_addr);
	245
2c276603	246	if (alloc == 0)
e5f27095 BB	247	panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n",
e5f27095 BB	248	(unsigned long long) size, (unsigned long long) max_addr);
d7a5b2ff ME	249
	250	return alloc;
	251	}
	252
e5f27095	253	static u64 lmb_align_down(u64 addr, u64 size)
d9b2b2a2 DM	254	{
	255	return addr & ~(size - 1);
	256	}
	257
e5f27095	258	static u64 lmb_align_up(u64 addr, u64 size)
eea89e13 DM	259	{
	260	return (addr + (size - 1)) & ~(size - 1);
	261	}
	262
e5f27095	263	u64 __init __lmb_alloc_base(u64 size, u64 align, u64 max_addr)
7c8c6b97 PM	264	{
7c8c6b97 PM	265	long i, j;
e5f27095	266	u64 base = 0;
7c8c6b97	267
8c20fafa ME	268	BUG_ON(0 == size);
8c20fafa ME	269
d9b2b2a2	270	/* On some platforms, make sure we allocate lowmem */
7c8c6b97	271	if (max_addr == LMB_ALLOC_ANYWHERE)
d9b2b2a2 DM	272	max_addr = LMB_REAL_LIMIT;
d9b2b2a2 DM	273
7c8c6b97	274	for (i = lmb.memory.cnt-1; i >= 0; i--) {
e5f27095 BB	275	u64 lmbbase = lmb.memory.region[i].base;
e5f27095 BB	276	u64 lmbsize = lmb.memory.region[i].size;
7c8c6b97 PM	277
7c8c6b97 PM	278	if (max_addr == LMB_ALLOC_ANYWHERE)
d9b2b2a2	279	base = lmb_align_down(lmbbase + lmbsize - size, align);
7c8c6b97 PM	280	else if (lmbbase < max_addr) {
7c8c6b97 PM	281	base = min(lmbbase + lmbsize, max_addr);
d9b2b2a2	282	base = lmb_align_down(base - size, align);
7c8c6b97 PM	283	} else
	284	continue;
	285
	286	while ((lmbbase <= base) &&
	287	((j = lmb_overlaps_region(&lmb.reserved, base, size)) >= 0) )
d9b2b2a2 DM	288	base = lmb_align_down(lmb.reserved.region[j].base - size,
d9b2b2a2 DM	289	align);
7c8c6b97 PM	290
	291	if ((base != 0) && (lmbbase <= base))
	292	break;
	293	}
	294
	295	if (i < 0)
	296	return 0;
	297
eea89e13 DM	298	if (lmb_add_region(&lmb.reserved, base, lmb_align_up(size, align)) < 0)
eea89e13 DM	299	return 0;
7c8c6b97 PM	300
	301	return base;
	302	}
	303
	304	/* You must call lmb_analyze() before this. */
e5f27095	305	u64 __init lmb_phys_mem_size(void)
7c8c6b97 PM	306	{
	307	return lmb.memory.size;
	308	}
	309
e5f27095	310	u64 __init lmb_end_of_DRAM(void)
7c8c6b97 PM	311	{
	312	int idx = lmb.memory.cnt - 1;
	313
	314	return (lmb.memory.region[idx].base + lmb.memory.region[idx].size);
	315	}
	316
2babf5c2	317	/* You must call lmb_analyze() after this. */
e5f27095	318	void __init lmb_enforce_memory_limit(u64 memory_limit)
7c8c6b97	319	{
e5f27095 BB	320	unsigned long i;
e5f27095 BB	321	u64 limit;
2babf5c2	322	struct lmb_property *p;
7c8c6b97 PM	323
	324	if (! memory_limit)
	325	return;
	326
2babf5c2	327	/* Truncate the lmb regions to satisfy the memory limit. */
7c8c6b97 PM	328	limit = memory_limit;
	329	for (i = 0; i < lmb.memory.cnt; i++) {
	330	if (limit > lmb.memory.region[i].size) {
	331	limit -= lmb.memory.region[i].size;
	332	continue;
	333	}
	334
	335	lmb.memory.region[i].size = limit;
	336	lmb.memory.cnt = i + 1;
	337	break;
	338	}
2babf5c2	339
30f30e13 ME	340	if (lmb.memory.region[0].size < lmb.rmo_size)
30f30e13 ME	341	lmb.rmo_size = lmb.memory.region[0].size;
2babf5c2 ME	342
	343	/* And truncate any reserves above the limit also. */
	344	for (i = 0; i < lmb.reserved.cnt; i++) {
	345	p = &lmb.reserved.region[i];
	346
	347	if (p->base > memory_limit)
	348	p->size = 0;
	349	else if ((p->base + p->size) > memory_limit)
	350	p->size = memory_limit - p->base;
	351
	352	if (p->size == 0) {
	353	lmb_remove_region(&lmb.reserved, i);
	354	i--;
	355	}
	356	}
7c8c6b97	357	}
f98eeb4e	358
e5f27095	359	int __init lmb_is_reserved(u64 addr)
f98eeb4e KG	360	{
	361	int i;
	362
	363	for (i = 0; i < lmb.reserved.cnt; i++) {
e5f27095 BB	364	u64 upper = lmb.reserved.region[i].base +
e5f27095 BB	365	lmb.reserved.region[i].size - 1;
f98eeb4e KG	366	if ((addr >= lmb.reserved.region[i].base) && (addr <= upper))
	367	return 1;
	368	}
	369	return 0;
	370	}