Blame view
kernel/resource.c
39.3 KB
1da177e4c
|
1 2 3 4 5 6 7 8 |
/* * linux/kernel/resource.c * * Copyright (C) 1999 Linus Torvalds * Copyright (C) 1999 Martin Mares <mj@ucw.cz> * * Arbitrary resource management. */ |
65fed8f6f
|
9 |
#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt |
9984de1a5
|
10 |
#include <linux/export.h> |
1da177e4c
|
11 12 13 14 15 16 17 |
#include <linux/errno.h> #include <linux/ioport.h> #include <linux/init.h> #include <linux/slab.h> #include <linux/spinlock.h> #include <linux/fs.h> #include <linux/proc_fs.h> |
8b6d043b7
|
18 |
#include <linux/sched.h> |
1da177e4c
|
19 |
#include <linux/seq_file.h> |
9ac7849e3
|
20 |
#include <linux/device.h> |
d68612b25
|
21 |
#include <linux/pfn.h> |
ebff7d8f2
|
22 |
#include <linux/mm.h> |
90e978206
|
23 |
#include <linux/resource_ext.h> |
1da177e4c
|
24 25 26 27 28 |
#include <asm/io.h> struct resource ioport_resource = { .name = "PCI IO", |
6550e07f4
|
29 |
.start = 0, |
1da177e4c
|
30 31 32 |
.end = IO_SPACE_LIMIT, .flags = IORESOURCE_IO, }; |
1da177e4c
|
33 34 35 36 |
EXPORT_SYMBOL(ioport_resource); struct resource iomem_resource = { .name = "PCI mem", |
6550e07f4
|
37 38 |
.start = 0, .end = -1, |
1da177e4c
|
39 40 |
.flags = IORESOURCE_MEM, }; |
1da177e4c
|
41 |
EXPORT_SYMBOL(iomem_resource); |
23c570a67
|
42 43 44 45 46 47 48 |
/* constraints to be met while allocating resources */ struct resource_constraint { resource_size_t min, max, align; resource_size_t (*alignf)(void *, const struct resource *, resource_size_t, resource_size_t); void *alignf_data; }; |
1da177e4c
|
49 |
static DEFINE_RWLOCK(resource_lock); |
ebff7d8f2
|
50 51 52 53 54 55 56 |
/* * For memory hotplug, there is no way to free resource entries allocated * by boot mem after the system is up. So for reusing the resource entry * we need to remember the resource. */ static struct resource *bootmem_resource_free; static DEFINE_SPINLOCK(bootmem_resource_lock); |
8c86e70ac
|
57 |
static struct resource *next_resource(struct resource *p, bool sibling_only) |
1da177e4c
|
58 |
{ |
8c86e70ac
|
59 60 61 |
/* Caller wants to traverse through siblings only */ if (sibling_only) return p->sibling; |
1da177e4c
|
62 63 64 65 66 67 |
if (p->child) return p->child; while (!p->sibling && p->parent) p = p->parent; return p->sibling; } |
8c86e70ac
|
68 69 70 71 72 73 |
static void *r_next(struct seq_file *m, void *v, loff_t *pos) { struct resource *p = v; (*pos)++; return (void *)next_resource(p, false); } |
13eb83754
|
74 75 76 |
#ifdef CONFIG_PROC_FS enum { MAX_IORES_LEVEL = 5 }; |
1da177e4c
|
77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 |
static void *r_start(struct seq_file *m, loff_t *pos) __acquires(resource_lock) { struct resource *p = m->private; loff_t l = 0; read_lock(&resource_lock); for (p = p->child; p && l < *pos; p = r_next(m, p, &l)) ; return p; } static void r_stop(struct seq_file *m, void *v) __releases(resource_lock) { read_unlock(&resource_lock); } static int r_show(struct seq_file *m, void *v) { struct resource *root = m->private; struct resource *r = v, *p; |
51d7b1204
|
98 |
unsigned long long start, end; |
1da177e4c
|
99 100 101 102 103 104 |
int width = root->end < 0x10000 ? 4 : 8; int depth; for (depth = 0, p = r; depth < MAX_IORES_LEVEL; depth++, p = p->parent) if (p->parent == root) break; |
51d7b1204
|
105 106 107 108 109 110 111 |
if (file_ns_capable(m->file, &init_user_ns, CAP_SYS_ADMIN)) { start = r->start; end = r->end; } else { start = end = 0; } |
685143ac1
|
112 113 |
seq_printf(m, "%*s%0*llx-%0*llx : %s ", |
1da177e4c
|
114 |
depth * 2, "", |
51d7b1204
|
115 116 |
width, start, width, end, |
1da177e4c
|
117 118 119 |
r->name ? r->name : "<BAD>"); return 0; } |
15ad7cdcf
|
120 |
static const struct seq_operations resource_op = { |
1da177e4c
|
121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 |
.start = r_start, .next = r_next, .stop = r_stop, .show = r_show, }; static int ioports_open(struct inode *inode, struct file *file) { int res = seq_open(file, &resource_op); if (!res) { struct seq_file *m = file->private_data; m->private = &ioport_resource; } return res; } static int iomem_open(struct inode *inode, struct file *file) { int res = seq_open(file, &resource_op); if (!res) { struct seq_file *m = file->private_data; m->private = &iomem_resource; } return res; } |
15ad7cdcf
|
146 |
static const struct file_operations proc_ioports_operations = { |
1da177e4c
|
147 148 149 150 151 |
.open = ioports_open, .read = seq_read, .llseek = seq_lseek, .release = seq_release, }; |
15ad7cdcf
|
152 |
static const struct file_operations proc_iomem_operations = { |
1da177e4c
|
153 154 155 156 157 158 159 160 |
.open = iomem_open, .read = seq_read, .llseek = seq_lseek, .release = seq_release, }; static int __init ioresources_init(void) { |
c33fff0af
|
161 162 |
proc_create("ioports", 0, NULL, &proc_ioports_operations); proc_create("iomem", 0, NULL, &proc_iomem_operations); |
1da177e4c
|
163 164 165 166 167 |
return 0; } __initcall(ioresources_init); #endif /* CONFIG_PROC_FS */ |
ebff7d8f2
|
168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 |
static void free_resource(struct resource *res) { if (!res) return; if (!PageSlab(virt_to_head_page(res))) { spin_lock(&bootmem_resource_lock); res->sibling = bootmem_resource_free; bootmem_resource_free = res; spin_unlock(&bootmem_resource_lock); } else { kfree(res); } } static struct resource *alloc_resource(gfp_t flags) { struct resource *res = NULL; spin_lock(&bootmem_resource_lock); if (bootmem_resource_free) { res = bootmem_resource_free; bootmem_resource_free = res->sibling; } spin_unlock(&bootmem_resource_lock); if (res) memset(res, 0, sizeof(struct resource)); else res = kzalloc(sizeof(struct resource), flags); return res; } |
1da177e4c
|
201 202 203 |
/* Return the conflict entry if you can't request it */ static struct resource * __request_resource(struct resource *root, struct resource *new) { |
d75fc8bbc
|
204 205 |
resource_size_t start = new->start; resource_size_t end = new->end; |
1da177e4c
|
206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 |
struct resource *tmp, **p; if (end < start) return root; if (start < root->start) return root; if (end > root->end) return root; p = &root->child; for (;;) { tmp = *p; if (!tmp || tmp->start > end) { new->sibling = tmp; *p = new; new->parent = root; return NULL; } p = &tmp->sibling; if (tmp->end < start) continue; return tmp; } } |
ff3cc952d
|
229 |
static int __release_resource(struct resource *old, bool release_child) |
1da177e4c
|
230 |
{ |
ff3cc952d
|
231 |
struct resource *tmp, **p, *chd; |
1da177e4c
|
232 233 234 235 236 237 238 |
p = &old->parent->child; for (;;) { tmp = *p; if (!tmp) break; if (tmp == old) { |
ff3cc952d
|
239 240 241 242 243 244 245 246 247 248 249 |
if (release_child || !(tmp->child)) { *p = tmp->sibling; } else { for (chd = tmp->child;; chd = chd->sibling) { chd->parent = tmp->parent; if (!(chd->sibling)) break; } *p = tmp->child; chd->sibling = tmp->sibling; } |
1da177e4c
|
250 251 252 253 254 255 256 |
old->parent = NULL; return 0; } p = &tmp->sibling; } return -EINVAL; } |
5eeec0ec9
|
257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 |
static void __release_child_resources(struct resource *r) { struct resource *tmp, *p; resource_size_t size; p = r->child; r->child = NULL; while (p) { tmp = p; p = p->sibling; tmp->parent = NULL; tmp->sibling = NULL; __release_child_resources(tmp); printk(KERN_DEBUG "release child resource %pR ", tmp); /* need to restore size, and keep flags */ size = resource_size(tmp); tmp->start = 0; tmp->end = size - 1; } } void release_child_resources(struct resource *r) { write_lock(&resource_lock); __release_child_resources(r); write_unlock(&resource_lock); } |
e1ca66d1b
|
287 |
/** |
66f1207bc
|
288 |
* request_resource_conflict - request and reserve an I/O or memory resource |
e1ca66d1b
|
289 290 291 |
* @root: root resource descriptor * @new: resource descriptor desired by caller * |
66f1207bc
|
292 |
* Returns 0 for success, conflict resource on error. |
e1ca66d1b
|
293 |
*/ |
66f1207bc
|
294 |
struct resource *request_resource_conflict(struct resource *root, struct resource *new) |
1da177e4c
|
295 296 297 298 299 300 |
{ struct resource *conflict; write_lock(&resource_lock); conflict = __request_resource(root, new); write_unlock(&resource_lock); |
66f1207bc
|
301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 |
return conflict; } /** * request_resource - request and reserve an I/O or memory resource * @root: root resource descriptor * @new: resource descriptor desired by caller * * Returns 0 for success, negative error code on error. */ int request_resource(struct resource *root, struct resource *new) { struct resource *conflict; conflict = request_resource_conflict(root, new); |
1da177e4c
|
316 317 318 319 |
return conflict ? -EBUSY : 0; } EXPORT_SYMBOL(request_resource); |
e1ca66d1b
|
320 |
/** |
e1ca66d1b
|
321 322 323 |
* release_resource - release a previously reserved resource * @old: resource pointer */ |
1da177e4c
|
324 325 326 327 328 |
int release_resource(struct resource *old) { int retval; write_lock(&resource_lock); |
ff3cc952d
|
329 |
retval = __release_resource(old, true); |
1da177e4c
|
330 331 332 333 334 |
write_unlock(&resource_lock); return retval; } EXPORT_SYMBOL(release_resource); |
2842f1141
|
335 |
/* |
3f33647c4
|
336 337 |
* Finds the lowest iomem resource existing within [res->start.res->end). * The caller must specify res->start, res->end, res->flags, and optionally |
a8fc42530
|
338 |
* desc. If found, returns 0, res is overwritten, if not found, returns -1. |
3f33647c4
|
339 340 |
* This function walks the whole tree and not just first level children until * and unless first_level_children_only is true. |
2842f1141
|
341 |
*/ |
3f33647c4
|
342 |
static int find_next_iomem_res(struct resource *res, unsigned long desc, |
a8fc42530
|
343 |
bool first_level_children_only) |
2842f1141
|
344 345 346 |
{ resource_size_t start, end; struct resource *p; |
8c86e70ac
|
347 |
bool sibling_only = false; |
2842f1141
|
348 349 350 351 352 |
BUG_ON(!res); start = res->start; end = res->end; |
58c1b5b07
|
353 |
BUG_ON(start >= end); |
2842f1141
|
354 |
|
800df627e
|
355 |
if (first_level_children_only) |
8c86e70ac
|
356 |
sibling_only = true; |
8c86e70ac
|
357 |
|
800df627e
|
358 359 360 |
read_lock(&resource_lock); for (p = iomem_resource.child; p; p = next_resource(p, sibling_only)) { |
a3650d53b
|
361 |
if ((p->flags & res->flags) != res->flags) |
2842f1141
|
362 |
continue; |
3f33647c4
|
363 364 |
if ((desc != IORES_DESC_NONE) && (desc != p->desc)) continue; |
2842f1141
|
365 366 367 368 |
if (p->start > end) { p = NULL; break; } |
58c1b5b07
|
369 |
if ((p->end >= start) && (p->start < end)) |
2842f1141
|
370 371 |
break; } |
8c86e70ac
|
372 |
|
2842f1141
|
373 374 375 376 |
read_unlock(&resource_lock); if (!p) return -1; /* copy data */ |
0f04ab5ef
|
377 378 379 380 |
if (res->start < p->start) res->start = p->start; if (res->end > p->end) res->end = p->end; |
2842f1141
|
381 382 |
return 0; } |
908eedc61
|
383 384 |
/* |
8c86e70ac
|
385 386 387 |
* Walks through iomem resources and calls func() with matching resource * ranges. This walks through whole tree and not just first level children. * All the memory ranges which overlap start,end and also match flags and |
3f33647c4
|
388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 |
* desc are valid candidates. * * @desc: I/O resource descriptor. Use IORES_DESC_NONE to skip @desc check. * @flags: I/O resource flags * @start: start addr * @end: end addr * * NOTE: For a new descriptor search, define a new IORES_DESC in * <linux/ioport.h> and set it in 'desc' of a target resource entry. */ int walk_iomem_res_desc(unsigned long desc, unsigned long flags, u64 start, u64 end, void *arg, int (*func)(u64, u64, void *)) { struct resource res; u64 orig_end; int ret = -1; res.start = start; res.end = end; res.flags = flags; orig_end = res.end; while ((res.start < res.end) && |
a8fc42530
|
411 |
(!find_next_iomem_res(&res, desc, false))) { |
3f33647c4
|
412 413 414 415 416 417 418 419 420 421 422 423 424 |
ret = (*func)(res.start, res.end, arg); if (ret) break; res.start = res.end + 1; res.end = orig_end; } return ret; } /* |
bd7e6cb30
|
425 426 427 428 429 |
* This function calls the @func callback against all memory ranges of type * System RAM which are marked as IORESOURCE_SYSTEM_RAM and IORESOUCE_BUSY. * Now, this function is only for System RAM, it deals with full ranges and * not PFNs. If resources are not PFN-aligned, dealing with PFNs can truncate * ranges. |
8c86e70ac
|
430 431 432 433 434 435 436 437 438 439 |
*/ int walk_system_ram_res(u64 start, u64 end, void *arg, int (*func)(u64, u64, void *)) { struct resource res; u64 orig_end; int ret = -1; res.start = start; res.end = end; |
bd7e6cb30
|
440 |
res.flags = IORESOURCE_SYSTEM_RAM | IORESOURCE_BUSY; |
8c86e70ac
|
441 442 |
orig_end = res.end; while ((res.start < res.end) && |
a8fc42530
|
443 |
(!find_next_iomem_res(&res, IORES_DESC_NONE, true))) { |
8c86e70ac
|
444 445 446 447 448 449 450 451 452 453 454 455 |
ret = (*func)(res.start, res.end, arg); if (ret) break; res.start = res.end + 1; res.end = orig_end; } return ret; } #if !defined(CONFIG_ARCH_HAS_WALK_MEMORY) /* |
bd7e6cb30
|
456 457 458 |
* This function calls the @func callback against all memory ranges of type * System RAM which are marked as IORESOURCE_SYSTEM_RAM and IORESOUCE_BUSY. * It is to be used only for System RAM. |
908eedc61
|
459 460 461 |
*/ int walk_system_ram_range(unsigned long start_pfn, unsigned long nr_pages, void *arg, int (*func)(unsigned long, unsigned long, void *)) |
75884fb1c
|
462 463 |
{ struct resource res; |
37b99dd53
|
464 |
unsigned long pfn, end_pfn; |
75884fb1c
|
465 466 |
u64 orig_end; int ret = -1; |
908eedc61
|
467 |
|
75884fb1c
|
468 469 |
res.start = (u64) start_pfn << PAGE_SHIFT; res.end = ((u64)(start_pfn + nr_pages) << PAGE_SHIFT) - 1; |
bd7e6cb30
|
470 |
res.flags = IORESOURCE_SYSTEM_RAM | IORESOURCE_BUSY; |
75884fb1c
|
471 |
orig_end = res.end; |
908eedc61
|
472 |
while ((res.start < res.end) && |
a8fc42530
|
473 |
(find_next_iomem_res(&res, IORES_DESC_NONE, true) >= 0)) { |
37b99dd53
|
474 475 476 |
pfn = (res.start + PAGE_SIZE - 1) >> PAGE_SHIFT; end_pfn = (res.end + 1) >> PAGE_SHIFT; if (end_pfn > pfn) |
f41496607
|
477 |
ret = (*func)(pfn, end_pfn - pfn, arg); |
75884fb1c
|
478 479 480 481 482 483 484 |
if (ret) break; res.start = res.end + 1; res.end = orig_end; } return ret; } |
2842f1141
|
485 |
#endif |
61ef2489d
|
486 487 488 489 490 491 |
static int __is_ram(unsigned long pfn, unsigned long nr_pages, void *arg) { return 1; } /* * This generic page_is_ram() returns true if specified address is |
bd7e6cb30
|
492 |
* registered as System RAM in iomem_resource list. |
61ef2489d
|
493 |
*/ |
e52730071
|
494 |
int __weak page_is_ram(unsigned long pfn) |
61ef2489d
|
495 496 497 |
{ return walk_system_ram_range(pfn, 1, NULL, __is_ram) == 1; } |
c5a130325
|
498 |
EXPORT_SYMBOL_GPL(page_is_ram); |
61ef2489d
|
499 |
|
124fe20d9
|
500 501 502 503 |
/** * region_intersects() - determine intersection of region with known resources * @start: region start address * @size: size of region |
1c29f25bf
|
504 505 |
* @flags: flags of resource (in iomem_resource) * @desc: descriptor of resource (in iomem_resource) or IORES_DESC_NONE |
67cf13cee
|
506 |
* |
124fe20d9
|
507 |
* Check if the specified region partially overlaps or fully eclipses a |
1c29f25bf
|
508 509 510 511 512 513 514 |
* resource identified by @flags and @desc (optional with IORES_DESC_NONE). * Return REGION_DISJOINT if the region does not overlap @flags/@desc, * return REGION_MIXED if the region overlaps @flags/@desc and another * resource, and return REGION_INTERSECTS if the region overlaps @flags/@desc * and no other defined resource. Note that REGION_INTERSECTS is also * returned in the case when the specified region overlaps RAM and undefined * memory holes. |
124fe20d9
|
515 516 517 518 |
* * region_intersect() is used by memory remapping functions to ensure * the user is not remapping RAM and is a vast speed up over walking * through the resource table page by page. |
67cf13cee
|
519 |
*/ |
1c29f25bf
|
520 521 |
int region_intersects(resource_size_t start, size_t size, unsigned long flags, unsigned long desc) |
67cf13cee
|
522 |
{ |
124fe20d9
|
523 524 525 |
resource_size_t end = start + size - 1; int type = 0; int other = 0; struct resource *p; |
67cf13cee
|
526 527 528 |
read_lock(&resource_lock); for (p = iomem_resource.child; p ; p = p->sibling) { |
1c29f25bf
|
529 530 531 |
bool is_type = (((p->flags & flags) == flags) && ((desc == IORES_DESC_NONE) || (desc == p->desc))); |
124fe20d9
|
532 533 534 535 536 537 538 |
if (start >= p->start && start <= p->end) is_type ? type++ : other++; if (end >= p->start && end <= p->end) is_type ? type++ : other++; if (p->start >= start && p->end <= end) is_type ? type++ : other++; |
67cf13cee
|
539 540 |
} read_unlock(&resource_lock); |
124fe20d9
|
541 542 543 544 545 546 547 548 |
if (other == 0) return type ? REGION_INTERSECTS : REGION_DISJOINT; if (type) return REGION_MIXED; return REGION_DISJOINT; |
67cf13cee
|
549 |
} |
1c29f25bf
|
550 |
EXPORT_SYMBOL_GPL(region_intersects); |
67cf13cee
|
551 |
|
fcb119183
|
552 553 554 |
void __weak arch_remove_reservations(struct resource *avail) { } |
a9cea0174
|
555 556 557 558 559 560 561 |
static resource_size_t simple_align_resource(void *data, const struct resource *avail, resource_size_t size, resource_size_t align) { return avail->start; } |
5d6b1fa30
|
562 563 564 565 566 567 568 569 |
static void resource_clip(struct resource *res, resource_size_t min, resource_size_t max) { if (res->start < min) res->start = min; if (res->end > max) res->end = max; } |
1da177e4c
|
570 |
/* |
23c570a67
|
571 572 |
* Find empty slot in the resource tree with the given range and * alignment constraints |
1da177e4c
|
573 |
*/ |
23c570a67
|
574 575 576 577 |
static int __find_resource(struct resource *root, struct resource *old, struct resource *new, resource_size_t size, struct resource_constraint *constraint) |
1da177e4c
|
578 579 |
{ struct resource *this = root->child; |
a1862e310
|
580 |
struct resource tmp = *new, avail, alloc; |
1da177e4c
|
581 |
|
0e2c8b8f5
|
582 |
tmp.start = root->start; |
1da177e4c
|
583 |
/* |
c0f5ac542
|
584 585 |
* Skip past an allocated resource that starts at 0, since the assignment * of this->start - 1 to tmp->end below would cause an underflow. |
1da177e4c
|
586 |
*/ |
23c570a67
|
587 588 |
if (this && this->start == root->start) { tmp.start = (this == old) ? old->start : this->end + 1; |
1da177e4c
|
589 590 |
this = this->sibling; } |
c0f5ac542
|
591 |
for(;;) { |
1da177e4c
|
592 |
if (this) |
23c570a67
|
593 |
tmp.end = (this == old) ? this->end : this->start - 1; |
1da177e4c
|
594 |
else |
0e2c8b8f5
|
595 |
tmp.end = root->end; |
5d6b1fa30
|
596 |
|
47ea91b40
|
597 598 |
if (tmp.end < tmp.start) goto next; |
23c570a67
|
599 |
resource_clip(&tmp, constraint->min, constraint->max); |
fcb119183
|
600 |
arch_remove_reservations(&tmp); |
a9cea0174
|
601 |
|
a1862e310
|
602 |
/* Check for overflow after ALIGN() */ |
23c570a67
|
603 |
avail.start = ALIGN(tmp.start, constraint->align); |
a1862e310
|
604 |
avail.end = tmp.end; |
5edb93b89
|
605 |
avail.flags = new->flags & ~IORESOURCE_UNSET; |
a1862e310
|
606 |
if (avail.start >= tmp.start) { |
5edb93b89
|
607 |
alloc.flags = avail.flags; |
23c570a67
|
608 609 |
alloc.start = constraint->alignf(constraint->alignf_data, &avail, size, constraint->align); |
a1862e310
|
610 |
alloc.end = alloc.start + size - 1; |
c25ef6220
|
611 612 |
if (alloc.start <= alloc.end && resource_contains(&avail, &alloc)) { |
a1862e310
|
613 614 615 616 |
new->start = alloc.start; new->end = alloc.end; return 0; } |
1da177e4c
|
617 |
} |
47ea91b40
|
618 619 |
next: if (!this || this->end == root->end) |
1da177e4c
|
620 |
break; |
47ea91b40
|
621 |
|
23c570a67
|
622 623 |
if (this != old) tmp.start = this->end + 1; |
1da177e4c
|
624 625 626 627 |
this = this->sibling; } return -EBUSY; } |
23c570a67
|
628 629 630 631 632 633 634 635 636 |
/* * Find empty slot in the resource tree given range and alignment. */ static int find_resource(struct resource *root, struct resource *new, resource_size_t size, struct resource_constraint *constraint) { return __find_resource(root, NULL, new, size, constraint); } |
e1ca66d1b
|
637 |
/** |
23c570a67
|
638 639 640 641 642 643 644 645 646 |
* reallocate_resource - allocate a slot in the resource tree given range & alignment. * The resource will be relocated if the new size cannot be reallocated in the * current location. * * @root: root resource descriptor * @old: resource descriptor desired by caller * @newsize: new size of the resource descriptor * @constraint: the size and alignment constraints to be met. */ |
28ab49ff7
|
647 |
static int reallocate_resource(struct resource *root, struct resource *old, |
23c570a67
|
648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 |
resource_size_t newsize, struct resource_constraint *constraint) { int err=0; struct resource new = *old; struct resource *conflict; write_lock(&resource_lock); if ((err = __find_resource(root, old, &new, newsize, constraint))) goto out; if (resource_contains(&new, old)) { old->start = new.start; old->end = new.end; goto out; } if (old->child) { err = -EBUSY; goto out; } if (resource_contains(old, &new)) { old->start = new.start; old->end = new.end; } else { |
ff3cc952d
|
675 |
__release_resource(old, true); |
23c570a67
|
676 677 678 679 680 681 682 683 684 685 686 687 688 |
*old = new; conflict = __request_resource(root, old); BUG_ON(conflict); } out: write_unlock(&resource_lock); return err; } /** * allocate_resource - allocate empty slot in the resource tree given range & alignment. * The resource will be reallocated with a new size if it was already allocated |
e1ca66d1b
|
689 690 691 |
* @root: root resource descriptor * @new: resource descriptor desired by caller * @size: requested resource region size |
ee5e5683d
|
692 693 |
* @min: minimum boundary to allocate * @max: maximum boundary to allocate |
e1ca66d1b
|
694 695 696 |
* @align: alignment requested, in bytes * @alignf: alignment function, optional, called if not NULL * @alignf_data: arbitrary data to pass to the @alignf function |
1da177e4c
|
697 698 |
*/ int allocate_resource(struct resource *root, struct resource *new, |
d75fc8bbc
|
699 700 |
resource_size_t size, resource_size_t min, resource_size_t max, resource_size_t align, |
b26b2d494
|
701 |
resource_size_t (*alignf)(void *, |
3b7a17fcd
|
702 |
const struct resource *, |
b26b2d494
|
703 704 |
resource_size_t, resource_size_t), |
1da177e4c
|
705 706 707 |
void *alignf_data) { int err; |
23c570a67
|
708 |
struct resource_constraint constraint; |
1da177e4c
|
709 |
|
a9cea0174
|
710 711 |
if (!alignf) alignf = simple_align_resource; |
23c570a67
|
712 713 714 715 716 717 718 719 720 721 722 |
constraint.min = min; constraint.max = max; constraint.align = align; constraint.alignf = alignf; constraint.alignf_data = alignf_data; if ( new->parent ) { /* resource is already allocated, try reallocating with the new constraints */ return reallocate_resource(root, new, size, &constraint); } |
1da177e4c
|
723 |
write_lock(&resource_lock); |
23c570a67
|
724 |
err = find_resource(root, new, size, &constraint); |
1da177e4c
|
725 726 727 728 729 730 731 |
if (err >= 0 && __request_resource(root, new)) err = -EBUSY; write_unlock(&resource_lock); return err; } EXPORT_SYMBOL(allocate_resource); |
1c388919d
|
732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 |
/** * lookup_resource - find an existing resource by a resource start address * @root: root resource descriptor * @start: resource start address * * Returns a pointer to the resource if found, NULL otherwise */ struct resource *lookup_resource(struct resource *root, resource_size_t start) { struct resource *res; read_lock(&resource_lock); for (res = root->child; res; res = res->sibling) { if (res->start == start) break; } read_unlock(&resource_lock); return res; } |
bef69ea0d
|
752 753 754 |
/* * Insert a resource into the resource tree. If successful, return NULL, * otherwise return the conflicting resource (compare to __request_resource()) |
1da177e4c
|
755 |
*/ |
bef69ea0d
|
756 |
static struct resource * __insert_resource(struct resource *parent, struct resource *new) |
1da177e4c
|
757 |
{ |
1da177e4c
|
758 |
struct resource *first, *next; |
d33b6fba2
|
759 |
for (;; parent = first) { |
d33b6fba2
|
760 761 |
first = __request_resource(parent, new); if (!first) |
bef69ea0d
|
762 |
return first; |
d33b6fba2
|
763 |
|
d33b6fba2
|
764 |
if (first == parent) |
bef69ea0d
|
765 |
return first; |
5de1cb2d0
|
766 767 |
if (WARN_ON(first == new)) /* duplicated insertion */ return first; |
d33b6fba2
|
768 769 770 771 772 |
if ((first->start > new->start) || (first->end < new->end)) break; if ((first->start == new->start) && (first->end == new->end)) break; |
1da177e4c
|
773 774 775 776 777 |
} for (next = first; ; next = next->sibling) { /* Partial overlap? Bad, and unfixable */ if (next->start < new->start || next->end > new->end) |
bef69ea0d
|
778 |
return next; |
1da177e4c
|
779 780 781 782 783 |
if (!next->sibling) break; if (next->sibling->start > new->end) break; } |
1da177e4c
|
784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 |
new->parent = parent; new->sibling = next->sibling; new->child = first; next->sibling = NULL; for (next = first; next; next = next->sibling) next->parent = new; if (parent->child == first) { parent->child = new; } else { next = parent->child; while (next->sibling != first) next = next->sibling; next->sibling = new; } |
bef69ea0d
|
800 801 |
return NULL; } |
1da177e4c
|
802 |
|
bef69ea0d
|
803 |
/** |
66f1207bc
|
804 |
* insert_resource_conflict - Inserts resource in the resource tree |
bef69ea0d
|
805 806 807 |
* @parent: parent of the new resource * @new: new resource to insert * |
66f1207bc
|
808 |
* Returns 0 on success, conflict resource if the resource can't be inserted. |
bef69ea0d
|
809 |
* |
66f1207bc
|
810 |
* This function is equivalent to request_resource_conflict when no conflict |
bef69ea0d
|
811 812 813 814 |
* happens. If a conflict happens, and the conflicting resources * entirely fit within the range of the new resource, then the new * resource is inserted and the conflicting resources become children of * the new resource. |
ff3cc952d
|
815 816 817 |
* * This function is intended for producers of resources, such as FW modules * and bus drivers. |
bef69ea0d
|
818 |
*/ |
66f1207bc
|
819 |
struct resource *insert_resource_conflict(struct resource *parent, struct resource *new) |
bef69ea0d
|
820 821 822 823 824 825 |
{ struct resource *conflict; write_lock(&resource_lock); conflict = __insert_resource(parent, new); write_unlock(&resource_lock); |
66f1207bc
|
826 827 828 829 830 831 832 833 834 |
return conflict; } /** * insert_resource - Inserts a resource in the resource tree * @parent: parent of the new resource * @new: new resource to insert * * Returns 0 on success, -EBUSY if the resource can't be inserted. |
ff3cc952d
|
835 836 837 |
* * This function is intended for producers of resources, such as FW modules * and bus drivers. |
66f1207bc
|
838 839 840 841 842 843 |
*/ int insert_resource(struct resource *parent, struct resource *new) { struct resource *conflict; conflict = insert_resource_conflict(parent, new); |
bef69ea0d
|
844 845 |
return conflict ? -EBUSY : 0; } |
8095d0f22
|
846 |
EXPORT_SYMBOL_GPL(insert_resource); |
bef69ea0d
|
847 848 849 |
/** * insert_resource_expand_to_fit - Insert a resource into the resource tree |
6781f4ae3
|
850 |
* @root: root resource descriptor |
bef69ea0d
|
851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 |
* @new: new resource to insert * * Insert a resource into the resource tree, possibly expanding it in order * to make it encompass any conflicting resources. */ void insert_resource_expand_to_fit(struct resource *root, struct resource *new) { if (new->parent) return; write_lock(&resource_lock); for (;;) { struct resource *conflict; conflict = __insert_resource(root, new); if (!conflict) break; if (conflict == root) break; /* Ok, expand resource to cover the conflict, then try again .. */ if (conflict->start < new->start) new->start = conflict->start; if (conflict->end > new->end) new->end = conflict->end; printk("Expanded resource %s due to conflict with %s ", new->name, conflict->name); } |
1da177e4c
|
880 |
write_unlock(&resource_lock); |
1da177e4c
|
881 |
} |
ff3cc952d
|
882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 |
/** * remove_resource - Remove a resource in the resource tree * @old: resource to remove * * Returns 0 on success, -EINVAL if the resource is not valid. * * This function removes a resource previously inserted by insert_resource() * or insert_resource_conflict(), and moves the children (if any) up to * where they were before. insert_resource() and insert_resource_conflict() * insert a new resource, and move any conflicting resources down to the * children of the new resource. * * insert_resource(), insert_resource_conflict() and remove_resource() are * intended for producers of resources, such as FW modules and bus drivers. */ int remove_resource(struct resource *old) { int retval; write_lock(&resource_lock); retval = __release_resource(old, false); write_unlock(&resource_lock); return retval; } |
8095d0f22
|
906 |
EXPORT_SYMBOL_GPL(remove_resource); |
ff3cc952d
|
907 |
|
ae8e3a915
|
908 909 |
static int __adjust_resource(struct resource *res, resource_size_t start, resource_size_t size) |
1da177e4c
|
910 911 |
{ struct resource *tmp, *parent = res->parent; |
d75fc8bbc
|
912 |
resource_size_t end = start + size - 1; |
1da177e4c
|
913 |
int result = -EBUSY; |
82ec90eac
|
914 915 |
if (!parent) goto skip; |
1da177e4c
|
916 917 |
if ((start < parent->start) || (end > parent->end)) goto out; |
1da177e4c
|
918 919 920 921 922 923 924 925 926 927 |
if (res->sibling && (res->sibling->start <= end)) goto out; tmp = parent->child; if (tmp != res) { while (tmp->sibling != res) tmp = tmp->sibling; if (start <= tmp->end) goto out; } |
82ec90eac
|
928 929 930 931 |
skip: for (tmp = res->child; tmp; tmp = tmp->sibling) if ((tmp->start < start) || (tmp->end > end)) goto out; |
1da177e4c
|
932 933 934 935 936 |
res->start = start; res->end = end; result = 0; out: |
ae8e3a915
|
937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 |
return result; } /** * adjust_resource - modify a resource's start and size * @res: resource to modify * @start: new start value * @size: new size * * Given an existing resource, change its start and size to match the * arguments. Returns 0 on success, -EBUSY if it can't fit. * Existing children of the resource are assumed to be immutable. */ int adjust_resource(struct resource *res, resource_size_t start, resource_size_t size) { int result; write_lock(&resource_lock); result = __adjust_resource(res, start, size); |
1da177e4c
|
957 958 959 |
write_unlock(&resource_lock); return result; } |
241057486
|
960 |
EXPORT_SYMBOL(adjust_resource); |
1da177e4c
|
961 |
|
268364a0f
|
962 963 964 965 966 967 |
static void __init __reserve_region_with_split(struct resource *root, resource_size_t start, resource_size_t end, const char *name) { struct resource *parent = root; struct resource *conflict; |
ebff7d8f2
|
968 |
struct resource *res = alloc_resource(GFP_ATOMIC); |
4965f5667
|
969 |
struct resource *next_res = NULL; |
268364a0f
|
970 971 972 973 974 975 976 977 |
if (!res) return; res->name = name; res->start = start; res->end = end; res->flags = IORESOURCE_BUSY; |
43ee493bd
|
978 |
res->desc = IORES_DESC_NONE; |
268364a0f
|
979 |
|
4965f5667
|
980 |
while (1) { |
268364a0f
|
981 |
|
4965f5667
|
982 983 984 985 986 987 988 989 |
conflict = __request_resource(parent, res); if (!conflict) { if (!next_res) break; res = next_res; next_res = NULL; continue; } |
268364a0f
|
990 |
|
4965f5667
|
991 992 993 |
/* conflict covered whole area */ if (conflict->start <= res->start && conflict->end >= res->end) { |
ebff7d8f2
|
994 |
free_resource(res); |
4965f5667
|
995 996 997 998 999 1000 1001 1002 1003 |
WARN_ON(next_res); break; } /* failed, split and try again */ if (conflict->start > res->start) { end = res->end; res->end = conflict->start - 1; if (conflict->end < end) { |
ebff7d8f2
|
1004 |
next_res = alloc_resource(GFP_ATOMIC); |
4965f5667
|
1005 |
if (!next_res) { |
ebff7d8f2
|
1006 |
free_resource(res); |
4965f5667
|
1007 1008 1009 1010 1011 1012 |
break; } next_res->name = name; next_res->start = conflict->end + 1; next_res->end = end; next_res->flags = IORESOURCE_BUSY; |
43ee493bd
|
1013 |
next_res->desc = IORES_DESC_NONE; |
4965f5667
|
1014 1015 1016 1017 1018 |
} } else { res->start = conflict->end + 1; } } |
268364a0f
|
1019 1020 |
} |
bea921124
|
1021 |
void __init reserve_region_with_split(struct resource *root, |
268364a0f
|
1022 1023 1024 |
resource_size_t start, resource_size_t end, const char *name) { |
65fed8f6f
|
1025 |
int abort = 0; |
268364a0f
|
1026 |
write_lock(&resource_lock); |
65fed8f6f
|
1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 |
if (root->start > start || root->end < end) { pr_err("requested range [0x%llx-0x%llx] not in root %pr ", (unsigned long long)start, (unsigned long long)end, root); if (start > root->end || end < root->start) abort = 1; else { if (end > root->end) end = root->end; if (start < root->start) start = root->start; pr_err("fixing request to [0x%llx-0x%llx] ", (unsigned long long)start, (unsigned long long)end); } dump_stack(); } if (!abort) __reserve_region_with_split(root, start, end, name); |
268364a0f
|
1048 1049 |
write_unlock(&resource_lock); } |
884525655
|
1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 |
/** * resource_alignment - calculate resource's alignment * @res: resource pointer * * Returns alignment on success, 0 (invalid alignment) on failure. */ resource_size_t resource_alignment(struct resource *res) { switch (res->flags & (IORESOURCE_SIZEALIGN | IORESOURCE_STARTALIGN)) { case IORESOURCE_SIZEALIGN: |
1a4e564b7
|
1060 |
return resource_size(res); |
884525655
|
1061 1062 1063 1064 1065 1066 |
case IORESOURCE_STARTALIGN: return res->start; default: return 0; } } |
1da177e4c
|
1067 1068 1069 1070 1071 1072 |
/* * This is compatibility stuff for IO resources. * * Note how this, unlike the above, knows about * the IO flag meanings (busy etc). * |
e1ca66d1b
|
1073 |
* request_region creates a new busy region. |
1da177e4c
|
1074 |
* |
e1ca66d1b
|
1075 1076 |
* release_region releases a matching busy region. */ |
8b6d043b7
|
1077 |
static DECLARE_WAIT_QUEUE_HEAD(muxed_resource_wait); |
e1ca66d1b
|
1078 1079 1080 1081 1082 1083 |
/** * __request_region - create a new busy resource region * @parent: parent resource descriptor * @start: resource start address * @n: resource region size * @name: reserving caller's ID string |
6ae301e85
|
1084 |
* @flags: IO resource flags |
1da177e4c
|
1085 |
*/ |
d75fc8bbc
|
1086 1087 |
struct resource * __request_region(struct resource *parent, resource_size_t start, resource_size_t n, |
e8de1481f
|
1088 |
const char *name, int flags) |
1da177e4c
|
1089 |
{ |
8b6d043b7
|
1090 |
DECLARE_WAITQUEUE(wait, current); |
ebff7d8f2
|
1091 |
struct resource *res = alloc_resource(GFP_KERNEL); |
1da177e4c
|
1092 |
|
c26ec88ea
|
1093 1094 1095 1096 1097 1098 |
if (!res) return NULL; res->name = name; res->start = start; res->end = start + n - 1; |
c26ec88ea
|
1099 1100 1101 1102 1103 |
write_lock(&resource_lock); for (;;) { struct resource *conflict; |
4e0d8f7ef
|
1104 1105 1106 |
res->flags = resource_type(parent) | resource_ext_type(parent); res->flags |= IORESOURCE_BUSY | flags; res->desc = parent->desc; |
c26ec88ea
|
1107 1108 |
conflict = __request_resource(parent, res); if (!conflict) |
1da177e4c
|
1109 |
break; |
c26ec88ea
|
1110 |
if (conflict != parent) { |
59ceeaaf3
|
1111 1112 |
if (!(conflict->flags & IORESOURCE_BUSY)) { parent = conflict; |
c26ec88ea
|
1113 |
continue; |
59ceeaaf3
|
1114 |
} |
1da177e4c
|
1115 |
} |
8b6d043b7
|
1116 1117 1118 1119 1120 1121 1122 1123 1124 |
if (conflict->flags & flags & IORESOURCE_MUXED) { add_wait_queue(&muxed_resource_wait, &wait); write_unlock(&resource_lock); set_current_state(TASK_UNINTERRUPTIBLE); schedule(); remove_wait_queue(&muxed_resource_wait, &wait); write_lock(&resource_lock); continue; } |
c26ec88ea
|
1125 |
/* Uhhuh, that didn't work out.. */ |
ebff7d8f2
|
1126 |
free_resource(res); |
c26ec88ea
|
1127 1128 |
res = NULL; break; |
1da177e4c
|
1129 |
} |
c26ec88ea
|
1130 |
write_unlock(&resource_lock); |
1da177e4c
|
1131 1132 |
return res; } |
1da177e4c
|
1133 |
EXPORT_SYMBOL(__request_region); |
e1ca66d1b
|
1134 |
/** |
e1ca66d1b
|
1135 1136 1137 1138 1139 1140 1141 |
* __release_region - release a previously reserved resource region * @parent: parent resource descriptor * @start: resource start address * @n: resource region size * * The described resource region must match a currently busy region. */ |
d75fc8bbc
|
1142 1143 |
void __release_region(struct resource *parent, resource_size_t start, resource_size_t n) |
1da177e4c
|
1144 1145 |
{ struct resource **p; |
d75fc8bbc
|
1146 |
resource_size_t end; |
1da177e4c
|
1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 |
p = &parent->child; end = start + n - 1; write_lock(&resource_lock); for (;;) { struct resource *res = *p; if (!res) break; if (res->start <= start && res->end >= end) { if (!(res->flags & IORESOURCE_BUSY)) { p = &res->child; continue; } if (res->start != start || res->end != end) break; *p = res->sibling; write_unlock(&resource_lock); |
8b6d043b7
|
1167 1168 |
if (res->flags & IORESOURCE_MUXED) wake_up(&muxed_resource_wait); |
ebff7d8f2
|
1169 |
free_resource(res); |
1da177e4c
|
1170 1171 1172 1173 1174 1175 |
return; } p = &res->sibling; } write_unlock(&resource_lock); |
685143ac1
|
1176 1177 1178 1179 |
printk(KERN_WARNING "Trying to free nonexistent resource " "<%016llx-%016llx> ", (unsigned long long)start, (unsigned long long)end); |
1da177e4c
|
1180 |
} |
1da177e4c
|
1181 |
EXPORT_SYMBOL(__release_region); |
825f787bb
|
1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 |
#ifdef CONFIG_MEMORY_HOTREMOVE /** * release_mem_region_adjustable - release a previously reserved memory region * @parent: parent resource descriptor * @start: resource start address * @size: resource region size * * This interface is intended for memory hot-delete. The requested region * is released from a currently busy memory resource. The requested region * must either match exactly or fit into a single busy resource entry. In * the latter case, the remaining resource is adjusted accordingly. * Existing children of the busy memory resource must be immutable in the * request. * * Note: * - Additional release conditions, such as overlapping region, can be * supported after they are confirmed as valid cases. * - When a busy memory resource gets split into two entries, the code * assumes that all children remain in the lower address entry for * simplicity. Enhance this logic when necessary. */ int release_mem_region_adjustable(struct resource *parent, resource_size_t start, resource_size_t size) { struct resource **p; struct resource *res; struct resource *new_res; resource_size_t end; int ret = -EINVAL; end = start + size - 1; if ((start < parent->start) || (end > parent->end)) return ret; |
ebff7d8f2
|
1215 1216 |
/* The alloc_resource() result gets checked later */ new_res = alloc_resource(GFP_KERNEL); |
825f787bb
|
1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 |
p = &parent->child; write_lock(&resource_lock); while ((res = *p)) { if (res->start >= end) break; /* look for the next resource if it does not fit into */ if (res->start > start || res->end < end) { p = &res->sibling; continue; } if (!(res->flags & IORESOURCE_MEM)) break; if (!(res->flags & IORESOURCE_BUSY)) { p = &res->child; continue; } /* found the target resource; let's adjust accordingly */ if (res->start == start && res->end == end) { /* free the whole entry */ *p = res->sibling; |
ebff7d8f2
|
1243 |
free_resource(res); |
825f787bb
|
1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 |
ret = 0; } else if (res->start == start && res->end != end) { /* adjust the start */ ret = __adjust_resource(res, end + 1, res->end - end); } else if (res->start != start && res->end == end) { /* adjust the end */ ret = __adjust_resource(res, res->start, start - res->start); } else { /* split into two entries */ if (!new_res) { ret = -ENOMEM; break; } new_res->name = res->name; new_res->start = end + 1; new_res->end = res->end; new_res->flags = res->flags; |
43ee493bd
|
1263 |
new_res->desc = res->desc; |
825f787bb
|
1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 |
new_res->parent = res->parent; new_res->sibling = res->sibling; new_res->child = NULL; ret = __adjust_resource(res, res->start, start - res->start); if (ret) break; res->sibling = new_res; new_res = NULL; } break; } write_unlock(&resource_lock); |
ebff7d8f2
|
1280 |
free_resource(new_res); |
825f787bb
|
1281 1282 1283 |
return ret; } #endif /* CONFIG_MEMORY_HOTREMOVE */ |
1da177e4c
|
1284 |
/* |
9ac7849e3
|
1285 1286 |
* Managed region resource */ |
8d38821cb
|
1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 |
static void devm_resource_release(struct device *dev, void *ptr) { struct resource **r = ptr; release_resource(*r); } /** * devm_request_resource() - request and reserve an I/O or memory resource * @dev: device for which to request the resource * @root: root of the resource tree from which to request the resource * @new: descriptor of the resource to request * * This is a device-managed version of request_resource(). There is usually * no need to release resources requested by this function explicitly since * that will be taken care of when the device is unbound from its driver. * If for some reason the resource needs to be released explicitly, because * of ordering issues for example, drivers must call devm_release_resource() * rather than the regular release_resource(). * * When a conflict is detected between any existing resources and the newly * requested resource, an error message will be printed. * * Returns 0 on success or a negative error code on failure. */ int devm_request_resource(struct device *dev, struct resource *root, struct resource *new) { struct resource *conflict, **ptr; ptr = devres_alloc(devm_resource_release, sizeof(*ptr), GFP_KERNEL); if (!ptr) return -ENOMEM; *ptr = new; conflict = request_resource_conflict(root, new); if (conflict) { dev_err(dev, "resource collision: %pR conflicts with %s %pR ", new, conflict->name, conflict); devres_free(ptr); return -EBUSY; } devres_add(dev, ptr); return 0; } EXPORT_SYMBOL(devm_request_resource); static int devm_resource_match(struct device *dev, void *res, void *data) { struct resource **ptr = res; return *ptr == data; } /** * devm_release_resource() - release a previously requested resource * @dev: device for which to release the resource * @new: descriptor of the resource to release * * Releases a resource previously requested using devm_request_resource(). */ void devm_release_resource(struct device *dev, struct resource *new) { WARN_ON(devres_release(dev, devm_resource_release, devm_resource_match, new)); } EXPORT_SYMBOL(devm_release_resource); |
9ac7849e3
|
1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 |
struct region_devres { struct resource *parent; resource_size_t start; resource_size_t n; }; static void devm_region_release(struct device *dev, void *res) { struct region_devres *this = res; __release_region(this->parent, this->start, this->n); } static int devm_region_match(struct device *dev, void *res, void *match_data) { struct region_devres *this = res, *match = match_data; return this->parent == match->parent && this->start == match->start && this->n == match->n; } struct resource * __devm_request_region(struct device *dev, struct resource *parent, resource_size_t start, resource_size_t n, const char *name) { struct region_devres *dr = NULL; struct resource *res; dr = devres_alloc(devm_region_release, sizeof(struct region_devres), GFP_KERNEL); if (!dr) return NULL; dr->parent = parent; dr->start = start; dr->n = n; |
e8de1481f
|
1393 |
res = __request_region(parent, start, n, name, 0); |
9ac7849e3
|
1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 |
if (res) devres_add(dev, dr); else devres_free(dr); return res; } EXPORT_SYMBOL(__devm_request_region); void __devm_release_region(struct device *dev, struct resource *parent, resource_size_t start, resource_size_t n) { struct region_devres match_data = { parent, start, n }; __release_region(parent, start, n); WARN_ON(devres_destroy(dev, devm_region_release, devm_region_match, &match_data)); } EXPORT_SYMBOL(__devm_release_region); /* |
1da177e4c
|
1415 1416 1417 1418 1419 1420 1421 1422 1423 |
* Called from init/main.c to reserve IO ports. */ #define MAXRESERVE 4 static int __init reserve_setup(char *str) { static int reserved; static struct resource reserve[MAXRESERVE]; for (;;) { |
8bc1ad7dd
|
1424 |
unsigned int io_start, io_num; |
1da177e4c
|
1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 |
int x = reserved; if (get_option (&str, &io_start) != 2) break; if (get_option (&str, &io_num) == 0) break; if (x < MAXRESERVE) { struct resource *res = reserve + x; res->name = "reserved"; res->start = io_start; res->end = io_start + io_num - 1; res->flags = IORESOURCE_BUSY; |
43ee493bd
|
1437 |
res->desc = IORES_DESC_NONE; |
1da177e4c
|
1438 1439 1440 1441 1442 1443 1444 1445 1446 |
res->child = NULL; if (request_resource(res->start >= 0x10000 ? &iomem_resource : &ioport_resource, res) == 0) reserved = x+1; } } return 1; } __setup("reserve=", reserve_setup); |
379daf629
|
1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 |
/* * Check if the requested addr and size spans more than any slot in the * iomem resource tree. */ int iomem_map_sanity_check(resource_size_t addr, unsigned long size) { struct resource *p = &iomem_resource; int err = 0; loff_t l; read_lock(&resource_lock); for (p = p->child; p ; p = r_next(NULL, p, &l)) { /* * We can probably skip the resources without * IORESOURCE_IO attribute? */ if (p->start >= addr + size) continue; if (p->end < addr) continue; |
d68612b25
|
1468 1469 |
if (PFN_DOWN(p->start) <= PFN_DOWN(addr) && PFN_DOWN(p->end) >= PFN_DOWN(addr + size - 1)) |
379daf629
|
1470 |
continue; |
3ac52669c
|
1471 1472 1473 1474 1475 1476 1477 1478 |
/* * if a resource is "BUSY", it's not a hardware resource * but a driver mapping of such a resource; we don't want * to warn for those; some drivers legitimately map only * partial hardware resources. (example: vesafb) */ if (p->flags & IORESOURCE_BUSY) continue; |
e4c729664
|
1479 1480 |
printk(KERN_WARNING "resource sanity check: requesting [mem %#010llx-%#010llx], which spans more than %s %pR ", |
13eb83754
|
1481 1482 |
(unsigned long long)addr, (unsigned long long)(addr + size - 1), |
e4c729664
|
1483 |
p->name, p); |
379daf629
|
1484 1485 1486 1487 1488 1489 1490 |
err = -1; break; } read_unlock(&resource_lock); return err; } |
e8de1481f
|
1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 |
#ifdef CONFIG_STRICT_DEVMEM static int strict_iomem_checks = 1; #else static int strict_iomem_checks; #endif /* * check if an address is reserved in the iomem resource tree * returns 1 if reserved, 0 if not reserved. */ int iomem_is_exclusive(u64 addr) { struct resource *p = &iomem_resource; int err = 0; loff_t l; int size = PAGE_SIZE; if (!strict_iomem_checks) return 0; addr = addr & PAGE_MASK; read_lock(&resource_lock); for (p = p->child; p ; p = r_next(NULL, p, &l)) { /* * We can probably skip the resources without * IORESOURCE_IO attribute? */ if (p->start >= addr + size) break; if (p->end < addr) continue; |
90a545e98
|
1524 1525 1526 1527 1528 1529 1530 1531 1532 |
/* * A resource is exclusive if IORESOURCE_EXCLUSIVE is set * or CONFIG_IO_STRICT_DEVMEM is enabled and the * resource is busy. */ if ((p->flags & IORESOURCE_BUSY) == 0) continue; if (IS_ENABLED(CONFIG_IO_STRICT_DEVMEM) || p->flags & IORESOURCE_EXCLUSIVE) { |
e8de1481f
|
1533 1534 1535 1536 1537 1538 1539 1540 |
err = 1; break; } } read_unlock(&resource_lock); return err; } |
90e978206
|
1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 |
struct resource_entry *resource_list_create_entry(struct resource *res, size_t extra_size) { struct resource_entry *entry; entry = kzalloc(sizeof(*entry) + extra_size, GFP_KERNEL); if (entry) { INIT_LIST_HEAD(&entry->node); entry->res = res ? res : &entry->__res; } return entry; } EXPORT_SYMBOL(resource_list_create_entry); void resource_list_free(struct list_head *head) { struct resource_entry *entry, *tmp; list_for_each_entry_safe(entry, tmp, head, node) resource_list_destroy_entry(entry); } EXPORT_SYMBOL(resource_list_free); |
e8de1481f
|
1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 |
static int __init strict_iomem(char *str) { if (strstr(str, "relaxed")) strict_iomem_checks = 0; if (strstr(str, "strict")) strict_iomem_checks = 1; return 1; } __setup("iomem=", strict_iomem); |