167 	struct resource *tmp, **p;  in __request_resource()  local
177 		tmp = *p;  in __request_resource()
178 		if (!tmp || tmp->start > end) {  in __request_resource()
179 			new->sibling = tmp;  in __request_resource()
184 		p = &tmp->sibling;  in __request_resource()
185 		if (tmp->end < start)  in __request_resource()
187 		return tmp;  in __request_resource()
193 	struct resource *tmp, **p, *chd;  in __release_resource()  local
197 		tmp = *p;  in __release_resource()
198 		if (!tmp)  in __release_resource()
200 		if (tmp == old) {  in __release_resource()
201 			if (release_child || !(tmp->child)) {  in __release_resource()
202 				*p = tmp->sibling;  in __release_resource()
204 				for (chd = tmp->child;; chd = chd->sibling) {  in __release_resource()
205 					chd->parent = tmp->parent;  in __release_resource()
209 				*p = tmp->child;  in __release_resource()
210 				chd->sibling = tmp->sibling;  in __release_resource()
215 		p = &tmp->sibling;  in __release_resource()
222 	struct resource *tmp, *p;  in __release_child_resources()  local
228 		tmp = p;  in __release_child_resources()
231 		tmp->parent = NULL;  in __release_child_resources()
232 		tmp->sibling = NULL;  in __release_child_resources()
233 		__release_child_resources(tmp);  in __release_child_resources()
235 		printk(KERN_DEBUG "release child resource %pR\n", tmp);  in __release_child_resources()
237 		size = resource_size(tmp);  in __release_child_resources()
238 		tmp->start = 0;  in __release_child_resources()
239 		tmp->end = size - 1;  in __release_child_resources()
662 	struct resource tmp = *new, avail, alloc;  in __find_resource_space()  local
665 	tmp.start = root->start;  in __find_resource_space()
671 		tmp.start = (this == old) ? old->start : this->end + 1;  in __find_resource_space()
676 			tmp.end = (this == old) ?  this->end : this->start - 1;  in __find_resource_space()
678 			tmp.end = root->end;  in __find_resource_space()
680 		if (tmp.end < tmp.start)  in __find_resource_space()
683 		resource_clip(&tmp, constraint->min, constraint->max);  in __find_resource_space()
684 		arch_remove_reservations(&tmp);  in __find_resource_space()
687 		avail.start = ALIGN(tmp.start, constraint->align);  in __find_resource_space()
688 		avail.end = tmp.end;  in __find_resource_space()
690 		if (avail.start >= tmp.start) {  in __find_resource_space()
711 			tmp.start = this->end + 1;  in __find_resource_space()
1020 	struct resource *tmp, *parent = res->parent;  in __adjust_resource()  local
1033 	tmp = parent->child;  in __adjust_resource()
1034 	if (tmp != res) {  in __adjust_resource()
1035 		while (tmp->sibling != res)  in __adjust_resource()
1036 			tmp = tmp->sibling;  in __adjust_resource()
1037 		if (start <= tmp->end)  in __adjust_resource()
1042 	for (tmp = res->child; tmp; tmp = tmp->sibling)  in __adjust_resource()
1043 		if ((tmp->start < start) || (tmp->end > end))  in __adjust_resource()
1851 	struct resource_entry *entry, *tmp;  in resource_list_free()  local
1853 	list_for_each_entry_safe(entry, tmp, head, node)  in resource_list_free()