18 	unsigned long i;  in lmb_dump_all()  local
24 	for (i=0; i < lmb->memory.cnt ;i++) {  in lmb_dump_all()
25 		debug("    memory.reg[0x%lx].base   = 0x%llx\n", i,  in lmb_dump_all()
26 			(long long unsigned)lmb->memory.region[i].base);  in lmb_dump_all()
28 			(long long unsigned)lmb->memory.region[i].size);  in lmb_dump_all()
35 	for (i=0; i < lmb->reserved.cnt ;i++) {  in lmb_dump_all()
36 		debug("    reserved.reg[0x%lx].base = 0x%llx\n", i,  in lmb_dump_all()
37 			(long long unsigned)lmb->reserved.region[i].base);  in lmb_dump_all()
39 			(long long unsigned)lmb->reserved.region[i].size);  in lmb_dump_all()
74 	unsigned long i;  in lmb_remove_region()  local
76 	for (i = r; i < rgn->cnt - 1; i++) {  in lmb_remove_region()
77 		rgn->region[i].base = rgn->region[i + 1].base;  in lmb_remove_region()
78 		rgn->region[i].size = rgn->region[i + 1].size;  in lmb_remove_region()
112 	long adjacent, i;  in lmb_add_region()  local
121 	for (i=0; i < rgn->cnt; i++) {  in lmb_add_region()
122 		phys_addr_t rgnbase = rgn->region[i].base;  in lmb_add_region()
123 		phys_size_t rgnsize = rgn->region[i].size;  in lmb_add_region()
131 			rgn->region[i].base -= size;  in lmb_add_region()
132 			rgn->region[i].size += size;  in lmb_add_region()
137 			rgn->region[i].size += size;  in lmb_add_region()
143 	if ((i < rgn->cnt-1) && lmb_regions_adjacent(rgn, i, i+1) ) {  in lmb_add_region()
144 		lmb_coalesce_regions(rgn, i, i+1);  in lmb_add_region()
154 	for (i = rgn->cnt-1; i >= 0; i--) {  in lmb_add_region()
155 		if (base < rgn->region[i].base) {  in lmb_add_region()
156 			rgn->region[i+1].base = rgn->region[i].base;  in lmb_add_region()
157 			rgn->region[i+1].size = rgn->region[i].size;  in lmb_add_region()
159 			rgn->region[i+1].base = base;  in lmb_add_region()
160 			rgn->region[i+1].size = size;  in lmb_add_region()
188 	int i;  in lmb_free()  local
193 	for (i=0; i < rgn->cnt; i++) {  in lmb_free()
194 		rgnbegin = rgn->region[i].base;  in lmb_free()
195 		rgnend = rgnbegin + rgn->region[i].size;  in lmb_free()
202 	if (i == rgn->cnt)  in lmb_free()
207 		lmb_remove_region(rgn, i);  in lmb_free()
213 		rgn->region[i].base = end;  in lmb_free()
214 		rgn->region[i].size -= size;  in lmb_free()
220 		rgn->region[i].size -= size;  in lmb_free()
228 	rgn->region[i].size = base - rgn->region[i].base;  in lmb_free()
242 	unsigned long i;  in lmb_overlaps_region()  local
244 	for (i=0; i < rgn->cnt; i++) {  in lmb_overlaps_region()
245 		phys_addr_t rgnbase = rgn->region[i].base;  in lmb_overlaps_region()
246 		phys_size_t rgnsize = rgn->region[i].size;  in lmb_overlaps_region()
252 	return (i < rgn->cnt) ? i : -1;  in lmb_overlaps_region()
285 	long i, j;  in __lmb_alloc_base()  local
289 	for (i = lmb->memory.cnt-1; i >= 0; i--) {  in __lmb_alloc_base()
290 		phys_addr_t lmbbase = lmb->memory.region[i].base;  in __lmb_alloc_base()
291 		phys_size_t lmbsize = lmb->memory.region[i].size;  in __lmb_alloc_base()
327 	int i;  in lmb_is_reserved()  local
329 	for (i = 0; i < lmb->reserved.cnt; i++) {  in lmb_is_reserved()
330 		phys_addr_t upper = lmb->reserved.region[i].base +  in lmb_is_reserved()
331 			lmb->reserved.region[i].size - 1;  in lmb_is_reserved()
332 		if ((addr >= lmb->reserved.region[i].base) && (addr <= upper))  in lmb_is_reserved()