Lines Matching refs:start
31 .start = 0,
39 .start = 0,
116 width, (unsigned long long) r->start, in r_show()
123 .start = r_start,
210 resource_size_t start = new->start; in __request_resource() local
214 if (end < start) in __request_resource()
216 if (start < root->start) in __request_resource()
223 if (!tmp || tmp->start > end) { in __request_resource()
230 if (tmp->end < start) in __request_resource()
273 tmp->start = 0; in __release_child_resources()
345 resource_size_t start, end; in find_next_iomem_res() local
351 start = res->start; in find_next_iomem_res()
353 BUG_ON(start >= end); in find_next_iomem_res()
365 if (p->start > end) { in find_next_iomem_res()
369 if ((p->end >= start) && (p->start < end)) in find_next_iomem_res()
377 if (res->start < p->start) in find_next_iomem_res()
378 res->start = p->start; in find_next_iomem_res()
395 int walk_iomem_res(char *name, unsigned long flags, u64 start, u64 end, in walk_iomem_res() argument
402 res.start = start; in walk_iomem_res()
406 while ((res.start < res.end) && in walk_iomem_res()
408 ret = (*func)(res.start, res.end, arg); in walk_iomem_res()
411 res.start = res.end + 1; in walk_iomem_res()
424 int walk_system_ram_res(u64 start, u64 end, void *arg, in walk_system_ram_res() argument
431 res.start = start; in walk_system_ram_res()
435 while ((res.start < res.end) && in walk_system_ram_res()
437 ret = (*func)(res.start, res.end, arg); in walk_system_ram_res()
440 res.start = res.end + 1; in walk_system_ram_res()
461 res.start = (u64) start_pfn << PAGE_SHIFT; in walk_system_ram_range()
465 while ((res.start < res.end) && in walk_system_ram_range()
467 pfn = (res.start + PAGE_SIZE - 1) >> PAGE_SHIFT; in walk_system_ram_range()
473 res.start = res.end + 1; in walk_system_ram_range()
513 int region_intersects(resource_size_t start, size_t size, const char *name) in region_intersects() argument
516 resource_size_t end = start + size - 1; in region_intersects()
524 if (start >= p->start && start <= p->end) in region_intersects()
526 if (end >= p->start && end <= p->end) in region_intersects()
528 if (p->start >= start && p->end <= end) in region_intersects()
551 return avail->start; in simple_align_resource()
557 if (res->start < min) in resource_clip()
558 res->start = min; in resource_clip()
575 tmp.start = root->start; in __find_resource()
580 if (this && this->start == root->start) { in __find_resource()
581 tmp.start = (this == old) ? old->start : this->end + 1; in __find_resource()
586 tmp.end = (this == old) ? this->end : this->start - 1; in __find_resource()
590 if (tmp.end < tmp.start) in __find_resource()
597 avail.start = ALIGN(tmp.start, constraint->align); in __find_resource()
600 if (avail.start >= tmp.start) { in __find_resource()
602 alloc.start = constraint->alignf(constraint->alignf_data, &avail, in __find_resource()
604 alloc.end = alloc.start + size - 1; in __find_resource()
606 new->start = alloc.start; in __find_resource()
616 tmp.start = this->end + 1; in __find_resource()
656 old->start = new.start; in reallocate_resource()
667 old->start = new.start; in reallocate_resource()
737 struct resource *lookup_resource(struct resource *root, resource_size_t start) in lookup_resource() argument
743 if (res->start == start) in lookup_resource()
769 if ((first->start > new->start) || (first->end < new->end)) in __insert_resource()
771 if ((first->start == new->start) && (first->end == new->end)) in __insert_resource()
777 if (next->start < new->start || next->end > new->end) in __insert_resource()
781 if (next->sibling->start > new->end) in __insert_resource()
866 if (conflict->start < new->start) in insert_resource_expand_to_fit()
867 new->start = conflict->start; in insert_resource_expand_to_fit()
876 static int __adjust_resource(struct resource *res, resource_size_t start, in __adjust_resource() argument
880 resource_size_t end = start + size - 1; in __adjust_resource()
886 if ((start < parent->start) || (end > parent->end)) in __adjust_resource()
889 if (res->sibling && (res->sibling->start <= end)) in __adjust_resource()
896 if (start <= tmp->end) in __adjust_resource()
902 if ((tmp->start < start) || (tmp->end > end)) in __adjust_resource()
905 res->start = start; in __adjust_resource()
923 int adjust_resource(struct resource *res, resource_size_t start, in adjust_resource() argument
929 result = __adjust_resource(res, start, size); in adjust_resource()
936 resource_size_t start, resource_size_t end, in __reserve_region_with_split() argument
948 res->start = start; in __reserve_region_with_split()
964 if (conflict->start <= res->start && in __reserve_region_with_split()
972 if (conflict->start > res->start) { in __reserve_region_with_split()
974 res->end = conflict->start - 1; in __reserve_region_with_split()
982 next_res->start = conflict->end + 1; in __reserve_region_with_split()
987 res->start = conflict->end + 1; in __reserve_region_with_split()
994 resource_size_t start, resource_size_t end, in reserve_region_with_split() argument
1000 if (root->start > start || root->end < end) { in reserve_region_with_split()
1002 (unsigned long long)start, (unsigned long long)end, in reserve_region_with_split()
1004 if (start > root->end || end < root->start) in reserve_region_with_split()
1009 if (start < root->start) in reserve_region_with_split()
1010 start = root->start; in reserve_region_with_split()
1012 (unsigned long long)start, in reserve_region_with_split()
1018 __reserve_region_with_split(root, start, end, name); in reserve_region_with_split()
1034 return res->start; in resource_alignment()
1062 resource_size_t start, resource_size_t n, in __request_region() argument
1072 res->start = start; in __request_region()
1073 res->end = start + n - 1; in __request_region()
1118 void __release_region(struct resource *parent, resource_size_t start, in __release_region() argument
1125 end = start + n - 1; in __release_region()
1134 if (res->start <= start && res->end >= end) { in __release_region()
1139 if (res->start != start || res->end != end) in __release_region()
1154 "<%016llx-%016llx>\n", (unsigned long long)start, in __release_region()
1181 resource_size_t start, resource_size_t size) in release_mem_region_adjustable() argument
1189 end = start + size - 1; in release_mem_region_adjustable()
1190 if ((start < parent->start) || (end > parent->end)) in release_mem_region_adjustable()
1200 if (res->start >= end) in release_mem_region_adjustable()
1204 if (res->start > start || res->end < end) { in release_mem_region_adjustable()
1218 if (res->start == start && res->end == end) { in release_mem_region_adjustable()
1223 } else if (res->start == start && res->end != end) { in release_mem_region_adjustable()
1227 } else if (res->start != start && res->end == end) { in release_mem_region_adjustable()
1229 ret = __adjust_resource(res, res->start, in release_mem_region_adjustable()
1230 start - res->start); in release_mem_region_adjustable()
1238 new_res->start = end + 1; in release_mem_region_adjustable()
1245 ret = __adjust_resource(res, res->start, in release_mem_region_adjustable()
1246 start - res->start); in release_mem_region_adjustable()
1337 resource_size_t start; member
1345 __release_region(this->parent, this->start, this->n); in devm_region_release()
1353 this->start == match->start && this->n == match->n; in devm_region_match()
1357 struct resource *parent, resource_size_t start, in __devm_request_region() argument
1369 dr->start = start; in __devm_request_region()
1372 res = __request_region(parent, start, n, name, 0); in __devm_request_region()
1383 resource_size_t start, resource_size_t n) in __devm_release_region() argument
1385 struct region_devres match_data = { parent, start, n }; in __devm_release_region()
1387 __release_region(parent, start, n); in __devm_release_region()
1413 res->start = io_start; in reserve_setup()
1417 if (request_resource(res->start >= 0x10000 ? &iomem_resource : &ioport_resource, res) == 0) in reserve_setup()
1442 if (p->start >= addr + size) in iomem_map_sanity_check()
1446 if (PFN_DOWN(p->start) <= PFN_DOWN(addr) && in iomem_map_sanity_check()
1498 if (p->start >= addr + size) in iomem_is_exclusive()