30 	debug("\n    reserved.cnt	   = 0x%lx\n",  in lmb_dump_all()
31 		lmb->reserved.cnt);  in lmb_dump_all()
32 	debug("    reserved.size	   = 0x%llx\n",  in lmb_dump_all()
33 		(unsigned long long)lmb->reserved.size);  in lmb_dump_all()
34 	for (i = 0; i < lmb->reserved.cnt; i++) {  in lmb_dump_all()
35 		debug("    reserved.reg[0x%lx].base = 0x%llx\n", i,  in lmb_dump_all()
36 		      (unsigned long long)lmb->reserved.region[i].base);  in lmb_dump_all()
38 		      (unsigned long long)lmb->reserved.region[i].size);  in lmb_dump_all()
97 	lmb->reserved.cnt = 0;  in lmb_init()
98 	lmb->reserved.size = 0;  in lmb_init()
221 	struct lmb_region *rgn = &(lmb->reserved);  in lmb_free()
270 	struct lmb_region *_rgn = &(lmb->reserved);  in lmb_reserve()
337 			rgn = lmb_overlaps_region(&lmb->reserved, base, size);  in __lmb_alloc_base()
339 				/* This area isn't reserved, take it */  in __lmb_alloc_base()
340 				if (lmb_add_region(&lmb->reserved, base,  in __lmb_alloc_base()
345 			res_base = lmb->reserved.region[rgn].base;  in __lmb_alloc_base()
356  * reserved
389 		for (i = 0; i < lmb->reserved.cnt; i++) {  in lmb_get_free_size()
390 			if (addr < lmb->reserved.region[i].base) {  in lmb_get_free_size()
391 				/* first reserved range > requested address */  in lmb_get_free_size()
392 				return lmb->reserved.region[i].base - addr;  in lmb_get_free_size()
394 			if (lmb->reserved.region[i].base +  in lmb_get_free_size()
395 			    lmb->reserved.region[i].size > addr) {  in lmb_get_free_size()
396 				/* requested addr is in this reserved range */  in lmb_get_free_size()
400 		/* if we come here: no reserved ranges above requested addr */  in lmb_get_free_size()
411 	for (i = 0; i < lmb->reserved.cnt; i++) {  in lmb_is_reserved()
412 		phys_addr_t upper = lmb->reserved.region[i].base +  in lmb_is_reserved()
413 			lmb->reserved.region[i].size - 1;  in lmb_is_reserved()
414 		if ((addr >= lmb->reserved.region[i].base) && (addr <= upper))  in lmb_is_reserved()