Lines Matching refs:start

20 	resource_size_t start;  member
141 .start = (_start), \
177 resource_size_t start, resource_size_t end,
192 struct resource *lookup_resource(struct resource *root, resource_size_t start);
193 int adjust_resource(struct resource *res, resource_size_t start,
198 return res->end - res->start + 1; in resource_size()
215 return r1->start <= r2->start && r1->end >= r2->end; in resource_contains()
220 #define request_region(start,n,name) __request_region(&ioport_resource, (start), (n), (name), 0) argument
221 #define request_muxed_region(start,n,name) __request_region(&ioport_resource, (start), (n), (name),… argument
222 #define __request_mem_region(start,n,name, excl) __request_region(&iomem_resource, (start), (n), (n… argument
223 #define request_mem_region(start,n,name) __request_region(&iomem_resource, (start), (n), (name), 0) argument
224 #define request_mem_region_exclusive(start,n,name) \ argument
225 __request_region(&iomem_resource, (start), (n), (name), IORESOURCE_EXCLUSIVE)
229 resource_size_t start,
234 #define release_region(start,n) __release_region(&ioport_resource, (start), (n)) argument
235 #define release_mem_region(start,n) __release_region(&iomem_resource, (start), (n)) argument
251 #define devm_request_region(dev,start,n,name) \ argument
252 __devm_request_region(dev, &ioport_resource, (start), (n), (name))
253 #define devm_request_mem_region(dev,start,n,name) \ argument
254 __devm_request_region(dev, &iomem_resource, (start), (n), (name))
257 struct resource *parent, resource_size_t start,
260 #define devm_release_region(dev, start, n) \ argument
261 __devm_release_region(dev, &ioport_resource, (start), (n))
262 #define devm_release_mem_region(dev, start, n) \ argument
263 __devm_release_region(dev, &iomem_resource, (start), (n))
266 resource_size_t start, resource_size_t n);
274 walk_mem_res(u64 start, u64 end, void *arg,
277 walk_system_ram_res(u64 start, u64 end, void *arg,
280 walk_iomem_res_desc(unsigned long desc, unsigned long flags, u64 start, u64 end,
286 return (r1->start <= r2->end && r1->end >= r2->start); in resource_overlaps()