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()
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()
64 	phys_addr_t base1 = rgn->region[r1].base;  in lmb_regions_adjacent()
65 	phys_size_t size1 = rgn->region[r1].size;  in lmb_regions_adjacent()
66 	phys_addr_t base2 = rgn->region[r2].base;  in lmb_regions_adjacent()
67 	phys_size_t size2 = rgn->region[r2].size;  in lmb_regions_adjacent()
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()
83 /* Assumption: base addr of region 1 < base addr of region 2 */
87 	rgn->region[r1].size += rgn->region[r2].size;  in lmb_coalesce_regions()
96 	lmb->memory.region[0].base = 0;  in lmb_init()
97 	lmb->memory.region[0].size = 0;  in lmb_init()
102 	lmb->reserved.region[0].base = 0;  in lmb_init()
103 	lmb->reserved.region[0].size = 0;  in lmb_init()
114 	if ((rgn->cnt == 1) && (rgn->region[0].size == 0)) {  in lmb_add_region()
115 		rgn->region[0].base = base;  in lmb_add_region()
116 		rgn->region[0].size = size;  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()
126 			/* Already have this region, so we're done */  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()
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()
165 	if (base < rgn->region[0].base) {  in lmb_add_region()
166 		rgn->region[0].base = base;  in lmb_add_region()
167 		rgn->region[0].size = size;  in lmb_add_region()
192 	/* Find the region where (base, size) belongs to */  in lmb_free()
194 		rgnbegin = rgn->region[i].base;  in lmb_free()
195 		rgnend = rgnbegin + rgn->region[i].size;  in lmb_free()
201 	/* Didn't find the region */  in lmb_free()
205 	/* Check to see if we are removing entire region */  in lmb_free()
211 	/* Check to see if region is matching at the front */  in lmb_free()
213 		rgn->region[i].base = end;  in lmb_free()
214 		rgn->region[i].size -= size;  in lmb_free()
218 	/* Check to see if the region is matching at the end */  in lmb_free()
220 		rgn->region[i].size -= size;  in lmb_free()
226 	 * beginging of the hole and add the region after hole.  in lmb_free()
228 	rgn->region[i].size = base - rgn->region[i].base;  in lmb_free()
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()
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()
316 			res_base = lmb->reserved.region[j].base;  in __lmb_alloc_base()
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()