49 	struct memblock *mem;  in bidram_dump()  local
79 		mem = list_entry(node, struct memblock, node);  in bidram_dump()
80 		reserved_size += mem->size;  in bidram_dump()
81 		printf("    reserved.rgn[%ld].name   = \"%s\"\n", i, mem->attr.name);  in bidram_dump()
83 		       (ulong)mem->base, (ulong)mem->base + (ulong)mem->size,  in bidram_dump()
84 		       (ulong)mem->size);  in bidram_dump()
259 	struct memblock *mem;  in bidram_reserved_is_overlap()  local
265 		mem = list_entry(node, struct memblock, node);  in bidram_reserved_is_overlap()
266 		if (bidram_is_overlap(mem->base, mem->size, base, size))  in bidram_reserved_is_overlap()
267 			return mem;  in bidram_reserved_is_overlap()
278 	struct memblock *mem;  in bidram_core_reserve()  local
313 		mem = list_entry(node, struct memblock, node);  in bidram_core_reserve()
315 			 mem->attr.name, (ulong)mem->base,  in bidram_core_reserve()
316 			 (ulong)(mem->base + mem->size));  in bidram_core_reserve()
317 		if (!strcmp(mem->attr.name, name)) {  in bidram_core_reserve()
320 		} else if (bidram_is_overlap(mem->base, mem->size, base, size)) {  in bidram_core_reserve()
324 				 name, (ulong)base, (ulong)(base + size), mem->attr.name,  in bidram_core_reserve()
325 				 (ulong)mem->base, (ulong)(mem->base + mem->size));  in bidram_core_reserve()
334 		mem = malloc(sizeof(*mem));  in bidram_core_reserve()
335 		if (!mem) {  in bidram_core_reserve()
355 		mem->base = base;  in bidram_core_reserve()
356 		mem->size = size;  in bidram_core_reserve()
358 			mem->attr.name = name;  in bidram_core_reserve()
359 			mem->attr.flags = 0;  in bidram_core_reserve()
361 			mem->attr = attr;  in bidram_core_reserve()
363 		list_add_tail(&mem->node, &bidram->reserved_head);  in bidram_core_reserve()