[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>

#define LMB_ALLOC_ANYWHERE	0

struct lmb lmb;

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

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

	pr_debug("    reserved.cnt	  = 0x%lx\n", lmb.reserved.cnt);
	pr_debug("    reserved.size	  = 0x%lx\n", lmb.reserved.size);
	for (i=0; i < lmb.reserved.cnt ;i++) {
		pr_debug("    reserved.region[0x%x].base       = 0x%llx\n",
		    i, (unsigned long long)lmb.reserved.region[i].base);
		pr_debug("		      .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);
}

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;
}

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;
}

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;
}

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;
}

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);
}

static u64 __init lmb_alloc_nid_unreserved(u64 start, u64 end,
					   u64 size, u64 align)
{
	u64 base, res_base;
	long j;

	base = lmb_align_down((end - size), align);
	while (start <= base) {
		j = lmb_overlaps_region(&lmb.reserved, base, size);
		if (j < 0) {
			/* this area isn't reserved, take it */
			if (lmb_add_region(&lmb.reserved, base,
					   lmb_align_up(size, align)) < 0)
				base = ~(u64)0;
			return base;
		}
		res_base = lmb.reserved.region[j].base;
		if (res_base < size)
			break;
		base = lmb_align_down(res_base - size, align);
	}

	return ~(u64)0;
}

static u64 __init lmb_alloc_nid_region(struct lmb_property *mp,
				       u64 (*nid_range)(u64, u64, int *),
				       u64 size, u64 align, int nid)
{
	u64 start, end;

	start = mp->base;
	end = start + mp->size;

	start = lmb_align_up(start, align);
	while (start < end) {
		u64 this_end;
		int this_nid;

		this_end = nid_range(start, end, &this_nid);
		if (this_nid == nid) {
			u64 ret = lmb_alloc_nid_unreserved(start, this_end,
							   size, align);
			if (ret != ~(u64)0)
				return ret;
		}
		start = this_end;
	}

	return ~(u64)0;
}

u64 __init lmb_alloc_nid(u64 size, u64 align, int nid,
			 u64 (*nid_range)(u64 start, u64 end, int *nid))
{
	struct lmb_region *mem = &lmb.memory;
	int i;

	for (i = 0; i < mem->cnt; i++) {
		u64 ret = lmb_alloc_nid_region(&mem->region[i],
					       nid_range,
					       size, align, nid);
		if (ret != ~(u64)0)
			return ret;
	}

	return lmb_alloc(size, align);
}

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;
}

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

	BUG_ON(0 == size);

	/* On some platforms, make sure we allocate lowmem */
	/* Note that LMB_REAL_LIMIT may be LMB_ALLOC_ANYWHERE */
	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 (lmbsize < size)
			continue;
		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 (base && lmbbase <= base) {
			j = lmb_overlaps_region(&lmb.reserved, base, size);
			if (j < 0) {
				/* this area isn't reserved, take it */
				if (lmb_add_region(&lmb.reserved, base,
						   lmb_align_up(size, align)) < 0)
					return 0;
				return base;
			}
			res_base = lmb.reserved.region[j].base;
			if (res_base < size)
				break;
			base = lmb_align_down(res_base - size, align);
		}
	}
	return 0;
}

/* 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
3b9331da ME	18	#define LMB_ALLOC_ANYWHERE 0
3b9331da ME	19
eb481899 ME	20	struct lmb lmb;
eb481899 ME	21
7c8c6b97 PM	22	void lmb_dump_all(void)
	23	{
	24	#ifdef DEBUG
	25	unsigned long i;
	26
300613e5 PM	27	pr_debug("lmb_dump_all:\n");
	28	pr_debug(" memory.cnt = 0x%lx\n", lmb.memory.cnt);
	29	pr_debug(" memory.size = 0x%llx\n",
e5f27095	30	(unsigned long long)lmb.memory.size);
7c8c6b97	31	for (i=0; i < lmb.memory.cnt ;i++) {
300613e5	32	pr_debug(" memory.region[0x%x].base = 0x%llx\n",
e5f27095	33	i, (unsigned long long)lmb.memory.region[i].base);
300613e5	34	pr_debug(" .size = 0x%llx\n",
e5f27095	35	(unsigned long long)lmb.memory.region[i].size);
7c8c6b97 PM	36	}
7c8c6b97 PM	37
300613e5 PM	38	pr_debug(" reserved.cnt = 0x%lx\n", lmb.reserved.cnt);
300613e5 PM	39	pr_debug(" reserved.size = 0x%lx\n", lmb.reserved.size);
7c8c6b97	40	for (i=0; i < lmb.reserved.cnt ;i++) {
300613e5	41	pr_debug(" reserved.region[0x%x].base = 0x%llx\n",
e5f27095	42	i, (unsigned long long)lmb.reserved.region[i].base);
300613e5	43	pr_debug(" .size = 0x%llx\n",
e5f27095	44	(unsigned long long)lmb.reserved.region[i].size);
7c8c6b97 PM	45	}
	46	#endif /* DEBUG */
	47	}
	48
300613e5 PM	49	static unsigned long __init lmb_addrs_overlap(u64 base1, u64 size1,
300613e5 PM	50	u64 base2, u64 size2)
7c8c6b97	51	{
300613e5	52	return ((base1 < (base2 + size2)) && (base2 < (base1 + size1)));
7c8c6b97 PM	53	}
7c8c6b97 PM	54
e5f27095 BB	55	static long __init lmb_addrs_adjacent(u64 base1, u64 size1,
e5f27095 BB	56	u64 base2, u64 size2)
7c8c6b97 PM	57	{
	58	if (base2 == base1 + size1)
	59	return 1;
	60	else if (base1 == base2 + size2)
	61	return -1;
	62
	63	return 0;
	64	}
	65
	66	static long __init lmb_regions_adjacent(struct lmb_region *rgn,
	67	unsigned long r1, unsigned long r2)
	68	{
e5f27095 BB	69	u64 base1 = rgn->region[r1].base;
	70	u64 size1 = rgn->region[r1].size;
	71	u64 base2 = rgn->region[r2].base;
	72	u64 size2 = rgn->region[r2].size;
7c8c6b97 PM	73
	74	return lmb_addrs_adjacent(base1, size1, base2, size2);
	75	}
	76
2babf5c2	77	static void __init lmb_remove_region(struct lmb_region *rgn, unsigned long r)
7c8c6b97 PM	78	{
	79	unsigned long i;
	80
2babf5c2 ME	81	for (i = r; i < rgn->cnt - 1; i++) {
	82	rgn->region[i].base = rgn->region[i + 1].base;
	83	rgn->region[i].size = rgn->region[i + 1].size;
7c8c6b97 PM	84	}
	85	rgn->cnt--;
	86	}
	87
2babf5c2 ME	88	/* Assumption: base addr of region 1 < base addr of region 2 */
	89	static void __init lmb_coalesce_regions(struct lmb_region *rgn,
	90	unsigned long r1, unsigned long r2)
	91	{
	92	rgn->region[r1].size += rgn->region[r2].size;
	93	lmb_remove_region(rgn, r2);
	94	}
	95
7c8c6b97 PM	96	void __init lmb_init(void)
	97	{
	98	/* Create a dummy zero size LMB which will get coalesced away later.
	99	* This simplifies the lmb_add() code below...
	100	*/
	101	lmb.memory.region[0].base = 0;
	102	lmb.memory.region[0].size = 0;
	103	lmb.memory.cnt = 1;
	104
	105	/* Ditto. */
	106	lmb.reserved.region[0].base = 0;
	107	lmb.reserved.region[0].size = 0;
	108	lmb.reserved.cnt = 1;
	109	}
	110
7c8c6b97 PM	111	void __init lmb_analyze(void)
	112	{
	113	int i;
	114
	115	lmb.memory.size = 0;
	116
	117	for (i = 0; i < lmb.memory.cnt; i++)
	118	lmb.memory.size += lmb.memory.region[i].size;
	119	}
	120
e5f27095	121	static long __init lmb_add_region(struct lmb_region *rgn, u64 base, u64 size)
7c8c6b97	122	{
56d6d1a7 MA	123	unsigned long coalesced = 0;
56d6d1a7 MA	124	long adjacent, i;
7c8c6b97	125
27e6672b KG	126	if ((rgn->cnt == 1) && (rgn->region[0].size == 0)) {
	127	rgn->region[0].base = base;
	128	rgn->region[0].size = size;
	129	return 0;
	130	}
	131
7c8c6b97	132	/* First try and coalesce this LMB with another. */
300613e5	133	for (i = 0; i < rgn->cnt; i++) {
e5f27095 BB	134	u64 rgnbase = rgn->region[i].base;
e5f27095 BB	135	u64 rgnsize = rgn->region[i].size;
7c8c6b97	136
eb6de286 DG	137	if ((rgnbase == base) && (rgnsize == size))
	138	/* Already have this region, so we're done */
	139	return 0;
	140
300613e5 PM	141	adjacent = lmb_addrs_adjacent(base, size, rgnbase, rgnsize);
300613e5 PM	142	if (adjacent > 0) {
7c8c6b97 PM	143	rgn->region[i].base -= size;
	144	rgn->region[i].size += size;
	145	coalesced++;
	146	break;
300613e5	147	} else if (adjacent < 0) {
7c8c6b97 PM	148	rgn->region[i].size += size;
	149	coalesced++;
	150	break;
	151	}
	152	}
	153
300613e5	154	if ((i < rgn->cnt - 1) && lmb_regions_adjacent(rgn, i, i+1)) {
7c8c6b97 PM	155	lmb_coalesce_regions(rgn, i, i+1);
	156	coalesced++;
	157	}
	158
	159	if (coalesced)
	160	return coalesced;
	161	if (rgn->cnt >= MAX_LMB_REGIONS)
	162	return -1;
	163
	164	/* Couldn't coalesce the LMB, so add it to the sorted table. */
300613e5	165	for (i = rgn->cnt - 1; i >= 0; i--) {
7c8c6b97 PM	166	if (base < rgn->region[i].base) {
	167	rgn->region[i+1].base = rgn->region[i].base;
	168	rgn->region[i+1].size = rgn->region[i].size;
	169	} else {
	170	rgn->region[i+1].base = base;
	171	rgn->region[i+1].size = size;
	172	break;
	173	}
	174	}
74b20dad KG	175
	176	if (base < rgn->region[0].base) {
	177	rgn->region[0].base = base;
	178	rgn->region[0].size = size;
	179	}
7c8c6b97 PM	180	rgn->cnt++;
	181
	182	return 0;
	183	}
	184
e5f27095	185	long __init lmb_add(u64 base, u64 size)
7c8c6b97	186	{
300613e5	187	struct lmb_region *_rgn = &lmb.memory;
7c8c6b97 PM	188
	189	/* On pSeries LPAR systems, the first LMB is our RMO region. */
	190	if (base == 0)
	191	lmb.rmo_size = size;
	192
	193	return lmb_add_region(_rgn, base, size);
	194
	195	}
	196
e5f27095	197	long __init lmb_reserve(u64 base, u64 size)
7c8c6b97	198	{
300613e5	199	struct lmb_region *_rgn = &lmb.reserved;
7c8c6b97	200
8c20fafa ME	201	BUG_ON(0 == size);
8c20fafa ME	202
7c8c6b97 PM	203	return lmb_add_region(_rgn, base, size);
	204	}
	205
300613e5	206	long __init lmb_overlaps_region(struct lmb_region *rgn, u64 base, u64 size)
7c8c6b97 PM	207	{
	208	unsigned long i;
	209
300613e5	210	for (i = 0; i < rgn->cnt; i++) {
e5f27095 BB	211	u64 rgnbase = rgn->region[i].base;
e5f27095 BB	212	u64 rgnsize = rgn->region[i].size;
300613e5	213	if (lmb_addrs_overlap(base, size, rgnbase, rgnsize))
7c8c6b97	214	break;
7c8c6b97 PM	215	}
	216
	217	return (i < rgn->cnt) ? i : -1;
	218	}
	219
c50f68c8 DM	220	static u64 lmb_align_down(u64 addr, u64 size)
	221	{
	222	return addr & ~(size - 1);
	223	}
	224
	225	static u64 lmb_align_up(u64 addr, u64 size)
	226	{
	227	return (addr + (size - 1)) & ~(size - 1);
	228	}
	229
	230	static u64 __init lmb_alloc_nid_unreserved(u64 start, u64 end,
	231	u64 size, u64 align)
	232	{
d9024df0	233	u64 base, res_base;
c50f68c8 DM	234	long j;
	235
	236	base = lmb_align_down((end - size), align);
d9024df0 PM	237	while (start <= base) {
	238	j = lmb_overlaps_region(&lmb.reserved, base, size);
	239	if (j < 0) {
	240	/* this area isn't reserved, take it */
	241	if (lmb_add_region(&lmb.reserved, base,
	242	lmb_align_up(size, align)) < 0)
	243	base = ~(u64)0;
	244	return base;
	245	}
	246	res_base = lmb.reserved.region[j].base;
	247	if (res_base < size)
	248	break;
	249	base = lmb_align_down(res_base - size, align);
c50f68c8 DM	250	}
	251
	252	return ~(u64)0;
	253	}
	254
	255	static u64 __init lmb_alloc_nid_region(struct lmb_property *mp,
	256	u64 (nid_range)(u64, u64, int ),
	257	u64 size, u64 align, int nid)
	258	{
	259	u64 start, end;
	260
	261	start = mp->base;
	262	end = start + mp->size;
	263
	264	start = lmb_align_up(start, align);
	265	while (start < end) {
	266	u64 this_end;
	267	int this_nid;
	268
	269	this_end = nid_range(start, end, &this_nid);
	270	if (this_nid == nid) {
	271	u64 ret = lmb_alloc_nid_unreserved(start, this_end,
	272	size, align);
	273	if (ret != ~(u64)0)
	274	return ret;
	275	}
	276	start = this_end;
	277	}
	278
	279	return ~(u64)0;
	280	}
	281
	282	u64 __init lmb_alloc_nid(u64 size, u64 align, int nid,
	283	u64 (nid_range)(u64 start, u64 end, int nid))
	284	{
	285	struct lmb_region *mem = &lmb.memory;
	286	int i;
	287
	288	for (i = 0; i < mem->cnt; i++) {
	289	u64 ret = lmb_alloc_nid_region(&mem->region[i],
	290	nid_range,
	291	size, align, nid);
	292	if (ret != ~(u64)0)
	293	return ret;
	294	}
	295
	296	return lmb_alloc(size, align);
	297	}
	298
e5f27095	299	u64 __init lmb_alloc(u64 size, u64 align)
7c8c6b97 PM	300	{
	301	return lmb_alloc_base(size, align, LMB_ALLOC_ANYWHERE);
	302	}
	303
e5f27095	304	u64 __init lmb_alloc_base(u64 size, u64 align, u64 max_addr)
d7a5b2ff	305	{
e5f27095	306	u64 alloc;
d7a5b2ff ME	307
	308	alloc = __lmb_alloc_base(size, align, max_addr);
	309
2c276603	310	if (alloc == 0)
e5f27095 BB	311	panic("ERROR: Failed to allocate 0x%llx bytes below 0x%llx.\n",
e5f27095 BB	312	(unsigned long long) size, (unsigned long long) max_addr);
d7a5b2ff ME	313
	314	return alloc;
	315	}
	316
e5f27095	317	u64 __init __lmb_alloc_base(u64 size, u64 align, u64 max_addr)
7c8c6b97 PM	318	{
7c8c6b97 PM	319	long i, j;
e5f27095	320	u64 base = 0;
d9024df0	321	u64 res_base;
7c8c6b97	322
8c20fafa ME	323	BUG_ON(0 == size);
8c20fafa ME	324
d9b2b2a2	325	/* On some platforms, make sure we allocate lowmem */
d9024df0	326	/* Note that LMB_REAL_LIMIT may be LMB_ALLOC_ANYWHERE */
7c8c6b97	327	if (max_addr == LMB_ALLOC_ANYWHERE)
d9b2b2a2 DM	328	max_addr = LMB_REAL_LIMIT;
d9b2b2a2 DM	329
300613e5	330	for (i = lmb.memory.cnt - 1; i >= 0; i--) {
e5f27095 BB	331	u64 lmbbase = lmb.memory.region[i].base;
e5f27095 BB	332	u64 lmbsize = lmb.memory.region[i].size;
7c8c6b97	333
d9024df0 PM	334	if (lmbsize < size)
d9024df0 PM	335	continue;
7c8c6b97	336	if (max_addr == LMB_ALLOC_ANYWHERE)
d9b2b2a2	337	base = lmb_align_down(lmbbase + lmbsize - size, align);
7c8c6b97 PM	338	else if (lmbbase < max_addr) {
7c8c6b97 PM	339	base = min(lmbbase + lmbsize, max_addr);
d9b2b2a2	340	base = lmb_align_down(base - size, align);
7c8c6b97 PM	341	} else
	342	continue;
	343
d9024df0	344	while (base && lmbbase <= base) {
300613e5	345	j = lmb_overlaps_region(&lmb.reserved, base, size);
d9024df0 PM	346	if (j < 0) {
	347	/* this area isn't reserved, take it */
	348	if (lmb_add_region(&lmb.reserved, base,
7347aefb	349	lmb_align_up(size, align)) < 0)
d9024df0 PM	350	return 0;
	351	return base;
	352	}
	353	res_base = lmb.reserved.region[j].base;
	354	if (res_base < size)
300613e5	355	break;
d9024df0	356	base = lmb_align_down(res_base - size, align);
300613e5	357	}
7c8c6b97	358	}
d9024df0	359	return 0;
7c8c6b97 PM	360	}
	361
	362	/* You must call lmb_analyze() before this. */
e5f27095	363	u64 __init lmb_phys_mem_size(void)
7c8c6b97 PM	364	{
	365	return lmb.memory.size;
	366	}
	367
e5f27095	368	u64 __init lmb_end_of_DRAM(void)
7c8c6b97 PM	369	{
	370	int idx = lmb.memory.cnt - 1;
	371
	372	return (lmb.memory.region[idx].base + lmb.memory.region[idx].size);
	373	}
	374
2babf5c2	375	/* You must call lmb_analyze() after this. */
e5f27095	376	void __init lmb_enforce_memory_limit(u64 memory_limit)
7c8c6b97	377	{
e5f27095 BB	378	unsigned long i;
e5f27095 BB	379	u64 limit;
2babf5c2	380	struct lmb_property *p;
7c8c6b97	381
300613e5	382	if (!memory_limit)
7c8c6b97 PM	383	return;
7c8c6b97 PM	384
2babf5c2	385	/* Truncate the lmb regions to satisfy the memory limit. */
7c8c6b97 PM	386	limit = memory_limit;
	387	for (i = 0; i < lmb.memory.cnt; i++) {
	388	if (limit > lmb.memory.region[i].size) {
	389	limit -= lmb.memory.region[i].size;
	390	continue;
	391	}
	392
	393	lmb.memory.region[i].size = limit;
	394	lmb.memory.cnt = i + 1;
	395	break;
	396	}
2babf5c2	397
30f30e13 ME	398	if (lmb.memory.region[0].size < lmb.rmo_size)
30f30e13 ME	399	lmb.rmo_size = lmb.memory.region[0].size;
2babf5c2 ME	400
	401	/* And truncate any reserves above the limit also. */
	402	for (i = 0; i < lmb.reserved.cnt; i++) {
	403	p = &lmb.reserved.region[i];
	404
	405	if (p->base > memory_limit)
	406	p->size = 0;
	407	else if ((p->base + p->size) > memory_limit)
	408	p->size = memory_limit - p->base;
	409
	410	if (p->size == 0) {
	411	lmb_remove_region(&lmb.reserved, i);
	412	i--;
	413	}
	414	}
7c8c6b97	415	}
f98eeb4e	416
e5f27095	417	int __init lmb_is_reserved(u64 addr)
f98eeb4e KG	418	{
	419	int i;
	420
	421	for (i = 0; i < lmb.reserved.cnt; i++) {
e5f27095 BB	422	u64 upper = lmb.reserved.region[i].base +
e5f27095 BB	423	lmb.reserved.region[i].size - 1;
f98eeb4e KG	424	if ((addr >= lmb.reserved.region[i].base) && (addr <= upper))
	425	return 1;
	426	}
	427	return 0;
	428	}