27 	.start	= 0,
35 	.start	= 0,
95 			width, (unsigned long long) r->start,  in r_show()
102 	.start	= r_start,
155 	resource_size_t start = new->start;  in __request_resource()  local
159 	if (end < start)  in __request_resource()
161 	if (start < root->start)  in __request_resource()
168 		if (!tmp || tmp->start > end) {  in __request_resource()
175 		if (tmp->end < start)  in __request_resource()
218 		tmp->start = 0;  in __release_child_resources()
288 	resource_size_t start, end;  in find_next_system_ram()  local
293 	start = res->start;  in find_next_system_ram()
295 	BUG_ON(start >= end);  in find_next_system_ram()
304 		if (p->start > end) {  in find_next_system_ram()
308 		if ((p->end >= start) && (p->start < end))  in find_next_system_ram()
315 	if (res->start < p->start)  in find_next_system_ram()
316 		res->start = p->start;  in find_next_system_ram()
335 	res.start = (u64) start_pfn << PAGE_SHIFT;  in walk_system_ram_range()
339 	while ((res.start < res.end) &&  in walk_system_ram_range()
341 		pfn = (res.start + PAGE_SIZE - 1) >> PAGE_SHIFT;  in walk_system_ram_range()
347 		res.start = res.end + 1;  in walk_system_ram_range()
377 	return avail->start;  in simple_align_resource()
383 	if (res->start < min)  in resource_clip()
384 		res->start = min;  in resource_clip()
391 	return res1->start <= res2->start && res1->end >= res2->end;  in resource_contains()
407 	tmp.start = root->start;  in __find_resource()
412 	if (this && this->start == root->start) {  in __find_resource()
413 		tmp.start = (this == old) ? old->start : this->end + 1;  in __find_resource()
418 			tmp.end = (this == old) ?  this->end : this->start - 1;  in __find_resource()
422 		if (tmp.end < tmp.start)  in __find_resource()
430 		avail.start = ALIGN(tmp.start, constraint->align);  in __find_resource()
432 		if (avail.start >= tmp.start) {  in __find_resource()
433 			alloc.start = constraint->alignf(constraint->alignf_data, &avail,  in __find_resource()
435 			alloc.end = alloc.start + size - 1;  in __find_resource()
437 				new->start = alloc.start;  in __find_resource()
447 			tmp.start = this->end + 1;  in __find_resource()
487 		old->start = new.start;  in reallocate_resource()
498 		old->start = new.start;  in reallocate_resource()
568 struct resource *lookup_resource(struct resource *root, resource_size_t start)  in lookup_resource()  argument
574 		if (res->start == start)  in lookup_resource()
600 		if ((first->start > new->start) || (first->end < new->end))  in __insert_resource()
602 		if ((first->start == new->start) && (first->end == new->end))  in __insert_resource()
608 		if (next->start < new->start || next->end > new->end)  in __insert_resource()
612 		if (next->sibling->start > new->end)  in __insert_resource()
697 		if (conflict->start < new->start)  in insert_resource_expand_to_fit()
698 			new->start = conflict->start;  in insert_resource_expand_to_fit()
717 int adjust_resource(struct resource *res, resource_size_t start, resource_size_t size)  in adjust_resource()  argument
720 	resource_size_t end = start + size - 1;  in adjust_resource()
725 	if ((start < parent->start) || (end > parent->end))  in adjust_resource()
729 		if ((tmp->start < start) || (tmp->end > end))  in adjust_resource()
733 	if (res->sibling && (res->sibling->start <= end))  in adjust_resource()
740 		if (start <= tmp->end)  in adjust_resource()
744 	res->start = start;  in adjust_resource()
755 		resource_size_t start, resource_size_t end,  in __reserve_region_with_split()  argument
767 	res->start = start;  in __reserve_region_with_split()
783 		if (conflict->start <= res->start &&  in __reserve_region_with_split()
791 		if (conflict->start > res->start) {  in __reserve_region_with_split()
793 			res->end = conflict->start - 1;  in __reserve_region_with_split()
802 				next_res->start = conflict->end + 1;  in __reserve_region_with_split()
807 			res->start = conflict->end + 1;  in __reserve_region_with_split()
814 		resource_size_t start, resource_size_t end,  in reserve_region_with_split()  argument
818 	__reserve_region_with_split(root, start, end, name);  in reserve_region_with_split()
834 		return res->start;  in resource_alignment()
864 				   resource_size_t start, resource_size_t n,  in __request_region()  argument
874 	res->start = start;  in __request_region()
875 	res->end = start + n - 1;  in __request_region()
926 int __check_region(struct resource *parent, resource_size_t start,  in __check_region()  argument
931 	res = __request_region(parent, start, n, "check-region", 0);  in __check_region()
949 void __release_region(struct resource *parent, resource_size_t start,  in __release_region()  argument
956 	end = start + n - 1;  in __release_region()
965 		if (res->start <= start && res->end >= end) {  in __release_region()
970 			if (res->start != start || res->end != end)  in __release_region()
985 		"<%016llx-%016llx>\n", (unsigned long long)start,  in __release_region()
995 	resource_size_t start;  member
1003 	__release_region(this->parent, this->start, this->n);  in devm_region_release()
1011 		this->start == match->start && this->n == match->n;  in devm_region_match()
1015 				struct resource *parent, resource_size_t start,  in __devm_request_region()  argument
1027 	dr->start = start;  in __devm_request_region()
1030 	res = __request_region(parent, start, n, name, 0);  in __devm_request_region()
1041 			   resource_size_t start, resource_size_t n)  in __devm_release_region()  argument
1043 	struct region_devres match_data = { parent, start, n };  in __devm_release_region()
1045 	__release_region(parent, start, n);  in __devm_release_region()
1071 			res->start = io_start;  in reserve_setup()
1075 			if (request_resource(res->start >= 0x10000 ? &iomem_resource : &ioport_resource, res) == 0)  in reserve_setup()
1100 		if (p->start >= addr + size)  in iomem_map_sanity_check()
1104 		if (PFN_DOWN(p->start) <= PFN_DOWN(addr) &&  in iomem_map_sanity_check()
1120 		       (unsigned long long)p->start,  in iomem_map_sanity_check()
1159 		if (p->start >= addr + size)  in iomem_is_exclusive()