[u-boot.git] / lib_generic / 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 <common.h>
#include <lmb.h>

#define LMB_ALLOC_ANYWHERE	0

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

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

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

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

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

	return 0;
}

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

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

static void 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 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 lmb_init(struct lmb *lmb)
{
	/* 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;
	lmb->memory.size = 0;

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

/* This routine called with relocation disabled. */
static long lmb_add_region(struct lmb_region *rgn, phys_addr_t base, phys_size_t 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++) {
		phys_addr_t rgnbase = rgn->region[i].base;
		phys_size_t 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 lmb_add(struct lmb *lmb, phys_addr_t base, phys_size_t size)
{
	struct lmb_region *_rgn = &(lmb->memory);

	return lmb_add_region(_rgn, base, size);
}

long lmb_free(struct lmb *lmb, phys_addr_t base, phys_size_t size)
{
	struct lmb_region *rgn = &(lmb->reserved);
	phys_addr_t rgnbegin, rgnend;
	phys_addr_t end = base + size;
	int i;

	rgnbegin = rgnend = 0; /* supress gcc warnings */

	/* Find the region where (base, size) belongs to */
	for (i=0; i < rgn->cnt; i++) {
		rgnbegin = rgn->region[i].base;
		rgnend = rgnbegin + rgn->region[i].size;

		if ((rgnbegin <= base) && (end <= rgnend))
			break;
	}

	/* Didn't find the region */
	if (i == rgn->cnt)
		return -1;

	/* Check to see if we are removing entire region */
	if ((rgnbegin == base) && (rgnend == end)) {
		lmb_remove_region(rgn, i);
		return 0;
	}

	/* Check to see if region is matching at the front */
	if (rgnbegin == base) {
		rgn->region[i].base = end;
		rgn->region[i].size -= size;
		return 0;
	}

	/* Check to see if the region is matching at the end */
	if (rgnend == end) {
		rgn->region[i].size -= size;
		return 0;
	}

	/*
	 * We need to split the entry -  adjust the current one to the
	 * beginging of the hole and add the region after hole.
	 */
	rgn->region[i].size = base - rgn->region[i].base;
	return lmb_add_region(rgn, end, rgnend - end);
}

long lmb_reserve(struct lmb *lmb, phys_addr_t base, phys_size_t size)
{
	struct lmb_region *_rgn = &(lmb->reserved);

	return lmb_add_region(_rgn, base, size);
}

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

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

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

phys_addr_t lmb_alloc(struct lmb *lmb, phys_size_t size, ulong align)
{
	return lmb_alloc_base(lmb, size, align, LMB_ALLOC_ANYWHERE);
}

phys_addr_t lmb_alloc_base(struct lmb *lmb, phys_size_t size, ulong align, phys_addr_t max_addr)
{
	phys_addr_t alloc;

	alloc = __lmb_alloc_base(lmb, size, align, max_addr);

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

	return alloc;
}

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

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

phys_addr_t __lmb_alloc_base(struct lmb *lmb, phys_size_t size, ulong align, phys_addr_t max_addr)
{
	long i, j;
	phys_addr_t base = 0;
	phys_addr_t res_base;

	for (i = lmb->memory.cnt-1; i >= 0; i--) {
		phys_addr_t lmbbase = lmb->memory.region[i].base;
		phys_size_t 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;
}

int lmb_is_reserved(struct lmb *lmb, phys_addr_t addr)
{
	int i;

	for (i = 0; i < lmb->reserved.cnt; i++) {
		phys_addr_t 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
4ed6552f KG	1	/*
	2	* Procedures for maintaining information about logical memory blocks.
	3	*
	4	* Peter Bergner, IBM Corp. June 2001.
	5	* Copyright (C) 2001 Peter Bergner.
	6	*
	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
	13	#include <common.h>
	14	#include <lmb.h>
	15
	16	#define LMB_ALLOC_ANYWHERE 0
	17
	18	void lmb_dump_all(struct lmb *lmb)
	19	{
	20	#ifdef DEBUG
	21	unsigned long i;
	22
	23	debug("lmb_dump_all:\n");
	24	debug(" memory.cnt = 0x%lx\n", lmb->memory.cnt);
391fd93a BB	25	debug(" memory.size = 0x%llx\n",
391fd93a BB	26	(unsigned long long)lmb->memory.size);
4ed6552f	27	for (i=0; i < lmb->memory.cnt ;i++) {
9b55a253 WD	28	debug(" memory.reg[0x%lx].base = 0x%llx\n", i,
9b55a253 WD	29	(long long unsigned)lmb->memory.region[i].base);
391fd93a	30	debug(" .size = 0x%llx\n",
9b55a253	31	(long long unsigned)lmb->memory.region[i].size);
4ed6552f KG	32	}
4ed6552f KG	33
9b55a253 WD	34	debug("\n reserved.cnt = 0x%lx\n",
	35	lmb->reserved.cnt);
	36	debug(" reserved.size = 0x%llx\n",
	37	(long long unsigned)lmb->reserved.size);
4ed6552f	38	for (i=0; i < lmb->reserved.cnt ;i++) {
9b55a253 WD	39	debug(" reserved.reg[0x%lx].base = 0x%llx\n", i,
9b55a253 WD	40	(long long unsigned)lmb->reserved.region[i].base);
391fd93a	41	debug(" .size = 0x%llx\n",
9b55a253	42	(long long unsigned)lmb->reserved.region[i].size);
4ed6552f KG	43	}
	44	#endif /* DEBUG */
	45	}
	46
391fd93a BB	47	static long lmb_addrs_overlap(phys_addr_t base1,
391fd93a BB	48	phys_size_t size1, phys_addr_t base2, phys_size_t size2)
4ed6552f KG	49	{
	50	return ((base1 < (base2+size2)) && (base2 < (base1+size1)));
	51	}
	52
391fd93a BB	53	static long lmb_addrs_adjacent(phys_addr_t base1, phys_size_t size1,
391fd93a BB	54	phys_addr_t base2, phys_size_t size2)
4ed6552f KG	55	{
	56	if (base2 == base1 + size1)
	57	return 1;
	58	else if (base1 == base2 + size2)
	59	return -1;
	60
	61	return 0;
	62	}
	63
	64	static long lmb_regions_adjacent(struct lmb_region *rgn,
	65	unsigned long r1, unsigned long r2)
	66	{
391fd93a BB	67	phys_addr_t base1 = rgn->region[r1].base;
	68	phys_size_t size1 = rgn->region[r1].size;
	69	phys_addr_t base2 = rgn->region[r2].base;
	70	phys_size_t size2 = rgn->region[r2].size;
4ed6552f KG	71
	72	return lmb_addrs_adjacent(base1, size1, base2, size2);
	73	}
	74
	75	static void lmb_remove_region(struct lmb_region *rgn, unsigned long r)
	76	{
	77	unsigned long i;
	78
	79	for (i = r; i < rgn->cnt - 1; i++) {
	80	rgn->region[i].base = rgn->region[i + 1].base;
	81	rgn->region[i].size = rgn->region[i + 1].size;
	82	}
	83	rgn->cnt--;
	84	}
	85
	86	/* Assumption: base addr of region 1 < base addr of region 2 */
	87	static void lmb_coalesce_regions(struct lmb_region *rgn,
	88	unsigned long r1, unsigned long r2)
	89	{
	90	rgn->region[r1].size += rgn->region[r2].size;
	91	lmb_remove_region(rgn, r2);
	92	}
	93
	94	void lmb_init(struct lmb *lmb)
	95	{
	96	/* Create a dummy zero size LMB which will get coalesced away later.
	97	* This simplifies the lmb_add() code below...
	98	*/
	99	lmb->memory.region[0].base = 0;
	100	lmb->memory.region[0].size = 0;
	101	lmb->memory.cnt = 1;
	102	lmb->memory.size = 0;
	103
	104	/* Ditto. */
	105	lmb->reserved.region[0].base = 0;
	106	lmb->reserved.region[0].size = 0;
	107	lmb->reserved.cnt = 1;
	108	lmb->reserved.size = 0;
	109	}
	110
	111	/* This routine called with relocation disabled. */
391fd93a	112	static long lmb_add_region(struct lmb_region *rgn, phys_addr_t base, phys_size_t size)
4ed6552f KG	113	{
	114	unsigned long coalesced = 0;
	115	long adjacent, i;
	116
	117	if ((rgn->cnt == 1) && (rgn->region[0].size == 0)) {
	118	rgn->region[0].base = base;
	119	rgn->region[0].size = size;
	120	return 0;
	121	}
	122
	123	/* First try and coalesce this LMB with another. */
	124	for (i=0; i < rgn->cnt; i++) {
391fd93a BB	125	phys_addr_t rgnbase = rgn->region[i].base;
391fd93a BB	126	phys_size_t rgnsize = rgn->region[i].size;
4ed6552f KG	127
	128	if ((rgnbase == base) && (rgnsize == size))
	129	/* Already have this region, so we're done */
	130	return 0;
	131
	132	adjacent = lmb_addrs_adjacent(base,size,rgnbase,rgnsize);
	133	if ( adjacent > 0 ) {
	134	rgn->region[i].base -= size;
	135	rgn->region[i].size += size;
	136	coalesced++;
	137	break;
	138	}
	139	else if ( adjacent < 0 ) {
	140	rgn->region[i].size += size;
	141	coalesced++;
	142	break;
	143	}
	144	}
	145
	146	if ((i < rgn->cnt-1) && lmb_regions_adjacent(rgn, i, i+1) ) {
	147	lmb_coalesce_regions(rgn, i, i+1);
	148	coalesced++;
	149	}
	150
	151	if (coalesced)
	152	return coalesced;
	153	if (rgn->cnt >= MAX_LMB_REGIONS)
	154	return -1;
	155
	156	/* Couldn't coalesce the LMB, so add it to the sorted table. */
	157	for (i = rgn->cnt-1; i >= 0; i--) {
	158	if (base < rgn->region[i].base) {
	159	rgn->region[i+1].base = rgn->region[i].base;
	160	rgn->region[i+1].size = rgn->region[i].size;
	161	} else {
	162	rgn->region[i+1].base = base;
	163	rgn->region[i+1].size = size;
	164	break;
	165	}
	166	}
	167
	168	if (base < rgn->region[0].base) {
	169	rgn->region[0].base = base;
	170	rgn->region[0].size = size;
	171	}
	172
	173	rgn->cnt++;
	174
	175	return 0;
	176	}
	177
	178	/* This routine may be called with relocation disabled. */
391fd93a	179	long lmb_add(struct lmb *lmb, phys_addr_t base, phys_size_t size)
4ed6552f KG	180	{
	181	struct lmb_region *_rgn = &(lmb->memory);
	182
	183	return lmb_add_region(_rgn, base, size);
	184	}
	185
98874ff3	186	long lmb_free(struct lmb *lmb, phys_addr_t base, phys_size_t size)
63796c4e AF	187	{
63796c4e AF	188	struct lmb_region *rgn = &(lmb->reserved);
98874ff3 AF	189	phys_addr_t rgnbegin, rgnend;
98874ff3 AF	190	phys_addr_t end = base + size;
63796c4e AF	191	int i;
	192
	193	rgnbegin = rgnend = 0; /* supress gcc warnings */
	194
	195	/* Find the region where (base, size) belongs to */
	196	for (i=0; i < rgn->cnt; i++) {
	197	rgnbegin = rgn->region[i].base;
	198	rgnend = rgnbegin + rgn->region[i].size;
	199
	200	if ((rgnbegin <= base) && (end <= rgnend))
	201	break;
	202	}
	203
	204	/* Didn't find the region */
	205	if (i == rgn->cnt)
	206	return -1;
	207
	208	/* Check to see if we are removing entire region */
	209	if ((rgnbegin == base) && (rgnend == end)) {
	210	lmb_remove_region(rgn, i);
	211	return 0;
	212	}
	213
	214	/* Check to see if region is matching at the front */
	215	if (rgnbegin == base) {
	216	rgn->region[i].base = end;
	217	rgn->region[i].size -= size;
	218	return 0;
	219	}
	220
	221	/* Check to see if the region is matching at the end */
	222	if (rgnend == end) {
	223	rgn->region[i].size -= size;
	224	return 0;
	225	}
	226
	227	/*
	228	* We need to split the entry - adjust the current one to the
	229	* beginging of the hole and add the region after hole.
	230	*/
	231	rgn->region[i].size = base - rgn->region[i].base;
	232	return lmb_add_region(rgn, end, rgnend - end);
	233	}
	234
391fd93a	235	long lmb_reserve(struct lmb *lmb, phys_addr_t base, phys_size_t size)
4ed6552f KG	236	{
	237	struct lmb_region *_rgn = &(lmb->reserved);
	238
	239	return lmb_add_region(_rgn, base, size);
	240	}
	241
391fd93a BB	242	long lmb_overlaps_region(struct lmb_region *rgn, phys_addr_t base,
391fd93a BB	243	phys_size_t size)
4ed6552f KG	244	{
	245	unsigned long i;
	246
	247	for (i=0; i < rgn->cnt; i++) {
391fd93a BB	248	phys_addr_t rgnbase = rgn->region[i].base;
391fd93a BB	249	phys_size_t rgnsize = rgn->region[i].size;
4ed6552f KG	250	if ( lmb_addrs_overlap(base,size,rgnbase,rgnsize) ) {
	251	break;
	252	}
	253	}
	254
	255	return (i < rgn->cnt) ? i : -1;
	256	}
	257
391fd93a	258	phys_addr_t lmb_alloc(struct lmb *lmb, phys_size_t size, ulong align)
4ed6552f KG	259	{
	260	return lmb_alloc_base(lmb, size, align, LMB_ALLOC_ANYWHERE);
	261	}
	262
391fd93a	263	phys_addr_t lmb_alloc_base(struct lmb *lmb, phys_size_t size, ulong align, phys_addr_t max_addr)
4ed6552f	264	{
391fd93a	265	phys_addr_t alloc;
4ed6552f KG	266
	267	alloc = __lmb_alloc_base(lmb, size, align, max_addr);
	268
	269	if (alloc == 0)
	270	printf("ERROR: Failed to allocate 0x%lx bytes below 0x%lx.\n",
9b55a253	271	(ulong)size, (ulong)max_addr);
4ed6552f KG	272
	273	return alloc;
	274	}
	275
391fd93a	276	static phys_addr_t lmb_align_down(phys_addr_t addr, phys_size_t size)
4ed6552f KG	277	{
	278	return addr & ~(size - 1);
	279	}
	280
391fd93a	281	static phys_addr_t lmb_align_up(phys_addr_t addr, ulong size)
4ed6552f KG	282	{
	283	return (addr + (size - 1)) & ~(size - 1);
	284	}
	285
391fd93a	286	phys_addr_t __lmb_alloc_base(struct lmb *lmb, phys_size_t size, ulong align, phys_addr_t max_addr)
4ed6552f KG	287	{
4ed6552f KG	288	long i, j;
391fd93a	289	phys_addr_t base = 0;
7570a994	290	phys_addr_t res_base;
4ed6552f KG	291
4ed6552f KG	292	for (i = lmb->memory.cnt-1; i >= 0; i--) {
391fd93a BB	293	phys_addr_t lmbbase = lmb->memory.region[i].base;
391fd93a BB	294	phys_size_t lmbsize = lmb->memory.region[i].size;
4ed6552f	295
7570a994 AF	296	if (lmbsize < size)
7570a994 AF	297	continue;
4ed6552f KG	298	if (max_addr == LMB_ALLOC_ANYWHERE)
	299	base = lmb_align_down(lmbbase + lmbsize - size, align);
	300	else if (lmbbase < max_addr) {
	301	base = min(lmbbase + lmbsize, max_addr);
	302	base = lmb_align_down(base - size, align);
	303	} else
	304	continue;
	305
7570a994 AF	306	while (base && lmbbase <= base) {
	307	j = lmb_overlaps_region(&lmb->reserved, base, size);
	308	if (j < 0) {
	309	/* This area isn't reserved, take it */
	310	if (lmb_add_region(&lmb->reserved, base,
	311	lmb_align_up(size,
	312	align)) < 0)
	313	return 0;
	314	return base;
	315	}
	316	res_base = lmb->reserved.region[j].base;
	317	if (res_base < size)
	318	break;
	319	base = lmb_align_down(res_base - size, align);
	320	}
4ed6552f	321	}
7570a994	322	return 0;
4ed6552f KG	323	}
4ed6552f KG	324
391fd93a	325	int lmb_is_reserved(struct lmb *lmb, phys_addr_t addr)
4ed6552f KG	326	{
	327	int i;
	328
	329	for (i = 0; i < lmb->reserved.cnt; i++) {
391fd93a	330	phys_addr_t upper = lmb->reserved.region[i].base +
4ed6552f KG	331	lmb->reserved.region[i].size - 1;
	332	if ((addr >= lmb->reserved.region[i].base) && (addr <= upper))
	333	return 1;
	334	}
	335	return 0;
	336	}