Lines Matching refs:start
31 .start = 0,
39 .start = 0,
108 unsigned long long start, end; in r_show() local
117 start = r->start; in r_show()
120 start = end = 0; in r_show()
125 width, start, in r_show()
132 .start = r_start,
186 resource_size_t start = new->start; in __request_resource() local
190 if (end < start) in __request_resource()
192 if (start < root->start) in __request_resource()
199 if (!tmp || tmp->start > end) { in __request_resource()
206 if (tmp->end < start) in __request_resource()
259 tmp->start = 0; in __release_child_resources()
331 resource_size_t start, end; in find_next_iomem_res() local
337 start = res->start; in find_next_iomem_res()
339 BUG_ON(start >= end); in find_next_iomem_res()
351 if (p->start > end) { in find_next_iomem_res()
355 if ((p->end >= start) && (p->start < end)) in find_next_iomem_res()
363 if (res->start < p->start) in find_next_iomem_res()
364 res->start = p->start; in find_next_iomem_res()
380 while ((res->start < res->end) && in __walk_iomem_res_desc()
386 res->start = res->end + 1; in __walk_iomem_res_desc()
407 int walk_iomem_res_desc(unsigned long desc, unsigned long flags, u64 start, in walk_iomem_res_desc() argument
412 res.start = start; in walk_iomem_res_desc()
427 int walk_system_ram_res(u64 start, u64 end, void *arg, in walk_system_ram_res() argument
432 res.start = start; in walk_system_ram_res()
444 int walk_mem_res(u64 start, u64 end, void *arg, in walk_mem_res() argument
449 res.start = start; in walk_mem_res()
472 res.start = (u64) start_pfn << PAGE_SHIFT; in walk_system_ram_range()
476 while ((res.start < res.end) && in walk_system_ram_range()
478 pfn = (res.start + PAGE_SIZE - 1) >> PAGE_SHIFT; in walk_system_ram_range()
484 res.start = res.end + 1; in walk_system_ram_range()
527 int region_intersects(resource_size_t start, size_t size, unsigned long flags, in region_intersects() argument
530 resource_size_t end = start + size - 1; in region_intersects()
540 if (start >= p->start && start <= p->end) in region_intersects()
542 if (end >= p->start && end <= p->end) in region_intersects()
544 if (p->start >= start && p->end <= end) in region_intersects()
568 return avail->start; in simple_align_resource()
574 if (res->start < min) in resource_clip()
575 res->start = min; in resource_clip()
592 tmp.start = root->start; in __find_resource()
597 if (this && this->start == root->start) { in __find_resource()
598 tmp.start = (this == old) ? old->start : this->end + 1; in __find_resource()
603 tmp.end = (this == old) ? this->end : this->start - 1; in __find_resource()
607 if (tmp.end < tmp.start) in __find_resource()
614 avail.start = ALIGN(tmp.start, constraint->align); in __find_resource()
617 if (avail.start >= tmp.start) { in __find_resource()
619 alloc.start = constraint->alignf(constraint->alignf_data, &avail, in __find_resource()
621 alloc.end = alloc.start + size - 1; in __find_resource()
622 if (alloc.start <= alloc.end && in __find_resource()
624 new->start = alloc.start; in __find_resource()
634 tmp.start = this->end + 1; in __find_resource()
674 old->start = new.start; in reallocate_resource()
685 old->start = new.start; in reallocate_resource()
755 struct resource *lookup_resource(struct resource *root, resource_size_t start) in lookup_resource() argument
761 if (res->start == start) in lookup_resource()
787 if ((first->start > new->start) || (first->end < new->end)) in __insert_resource()
789 if ((first->start == new->start) && (first->end == new->end)) in __insert_resource()
795 if (next->start < new->start || next->end > new->end) in __insert_resource()
799 if (next->sibling->start > new->end) in __insert_resource()
891 if (conflict->start < new->start) in insert_resource_expand_to_fit()
892 new->start = conflict->start; in insert_resource_expand_to_fit()
927 static int __adjust_resource(struct resource *res, resource_size_t start, in __adjust_resource() argument
931 resource_size_t end = start + size - 1; in __adjust_resource()
937 if ((start < parent->start) || (end > parent->end)) in __adjust_resource()
940 if (res->sibling && (res->sibling->start <= end)) in __adjust_resource()
947 if (start <= tmp->end) in __adjust_resource()
953 if ((tmp->start < start) || (tmp->end > end)) in __adjust_resource()
956 res->start = start; in __adjust_resource()
974 int adjust_resource(struct resource *res, resource_size_t start, in adjust_resource() argument
980 result = __adjust_resource(res, start, size); in adjust_resource()
987 resource_size_t start, resource_size_t end, in __reserve_region_with_split() argument
1000 res->start = start; in __reserve_region_with_split()
1017 if (conflict->start <= res->start && in __reserve_region_with_split()
1025 if (conflict->start > res->start) { in __reserve_region_with_split()
1027 res->end = conflict->start - 1; in __reserve_region_with_split()
1035 next_res->start = conflict->end + 1; in __reserve_region_with_split()
1041 res->start = conflict->end + 1; in __reserve_region_with_split()
1048 resource_size_t start, resource_size_t end, in reserve_region_with_split() argument
1054 if (root->start > start || root->end < end) { in reserve_region_with_split()
1056 (unsigned long long)start, (unsigned long long)end, in reserve_region_with_split()
1058 if (start > root->end || end < root->start) in reserve_region_with_split()
1063 if (start < root->start) in reserve_region_with_split()
1064 start = root->start; in reserve_region_with_split()
1066 (unsigned long long)start, in reserve_region_with_split()
1072 __reserve_region_with_split(root, start, end, name); in reserve_region_with_split()
1088 return res->start; in resource_alignment()
1116 resource_size_t start, resource_size_t n, in __request_region() argument
1126 res->start = start; in __request_region()
1127 res->end = start + n - 1; in __request_region()
1174 void __release_region(struct resource *parent, resource_size_t start, in __release_region() argument
1181 end = start + n - 1; in __release_region()
1190 if (res->start <= start && res->end >= end) { in __release_region()
1195 if (res->start != start || res->end != end) in __release_region()
1210 "<%016llx-%016llx>\n", (unsigned long long)start, in __release_region()
1237 resource_size_t start, resource_size_t size) in release_mem_region_adjustable() argument
1245 end = start + size - 1; in release_mem_region_adjustable()
1246 if ((start < parent->start) || (end > parent->end)) in release_mem_region_adjustable()
1256 if (res->start >= end) in release_mem_region_adjustable()
1260 if (res->start > start || res->end < end) { in release_mem_region_adjustable()
1274 if (res->start == start && res->end == end) { in release_mem_region_adjustable()
1279 } else if (res->start == start && res->end != end) { in release_mem_region_adjustable()
1283 } else if (res->start != start && res->end == end) { in release_mem_region_adjustable()
1285 ret = __adjust_resource(res, res->start, in release_mem_region_adjustable()
1286 start - res->start); in release_mem_region_adjustable()
1294 new_res->start = end + 1; in release_mem_region_adjustable()
1302 ret = __adjust_resource(res, res->start, in release_mem_region_adjustable()
1303 start - res->start); in release_mem_region_adjustable()
1394 resource_size_t start; member
1402 __release_region(this->parent, this->start, this->n); in devm_region_release()
1410 this->start == match->start && this->n == match->n; in devm_region_match()
1414 struct resource *parent, resource_size_t start, in __devm_request_region() argument
1426 dr->start = start; in __devm_request_region()
1429 res = __request_region(parent, start, n, name, 0); in __devm_request_region()
1440 resource_size_t start, resource_size_t n) in __devm_release_region() argument
1442 struct region_devres match_data = { parent, start, n }; in __devm_release_region()
1444 __release_region(parent, start, n); in __devm_release_region()
1483 res->start = io_start; in reserve_setup()
1512 if (p->start >= addr + size) in iomem_map_sanity_check()
1516 if (PFN_DOWN(p->start) <= PFN_DOWN(addr) && in iomem_map_sanity_check()
1568 if (p->start >= addr + size) in iomem_is_exclusive()