67 		return p->sibling;  in next_resource()
71 	while (!p->sibling && p->parent)  in next_resource()
73 	return p->sibling;  in next_resource()
180 		res->sibling = bootmem_resource_free;  in free_resource()
195 		bootmem_resource_free = res->sibling;  in alloc_resource()
224 			new->sibling = tmp;  in __request_resource()
229 		p = &tmp->sibling;  in __request_resource()
246 			*p = tmp->sibling;  in __release_resource()
250 		p = &tmp->sibling;  in __release_resource()
264 		p = p->sibling;  in __release_child_resources()
267 		tmp->sibling = NULL;  in __release_child_resources()
521 	for (p = iomem_resource.child; p ; p = p->sibling) {  in region_intersects()
582 		this = this->sibling;  in __find_resource()
617 		this = this->sibling;  in __find_resource()
742 	for (res = root->child; res; res = res->sibling) {  in lookup_resource()
775 	for (next = first; ; next = next->sibling) {  in __insert_resource()
779 		if (!next->sibling)  in __insert_resource()
781 		if (next->sibling->start > new->end)  in __insert_resource()
786 	new->sibling = next->sibling;  in __insert_resource()
789 	next->sibling = NULL;  in __insert_resource()
790 	for (next = first; next; next = next->sibling)  in __insert_resource()
797 		while (next->sibling != first)  in __insert_resource()
798 			next = next->sibling;  in __insert_resource()
799 		next->sibling = new;  in __insert_resource()
889 	if (res->sibling && (res->sibling->start <= end))  in __adjust_resource()
894 		while (tmp->sibling != res)  in __adjust_resource()
895 			tmp = tmp->sibling;  in __adjust_resource()
901 	for (tmp = res->child; tmp; tmp = tmp->sibling)  in __adjust_resource()
1141 			*p = res->sibling;  in __release_region()
1148 		p = &res->sibling;  in __release_region()
1205 			p = &res->sibling;  in release_mem_region_adjustable()
1220 			*p = res->sibling;  in release_mem_region_adjustable()
1242 			new_res->sibling = res->sibling;  in release_mem_region_adjustable()
1249 			res->sibling = new_res;  in release_mem_region_adjustable()