Blame view
kernel/resource.c
26.8 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. */ |
1da177e4c
|
9 |
#include <linux/module.h> |
1da177e4c
|
10 11 12 13 14 15 16 |
#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
|
17 |
#include <linux/sched.h> |
1da177e4c
|
18 |
#include <linux/seq_file.h> |
9ac7849e3
|
19 |
#include <linux/device.h> |
d68612b25
|
20 |
#include <linux/pfn.h> |
1da177e4c
|
21 22 23 24 25 |
#include <asm/io.h> struct resource ioport_resource = { .name = "PCI IO", |
6550e07f4
|
26 |
.start = 0, |
1da177e4c
|
27 28 29 |
.end = IO_SPACE_LIMIT, .flags = IORESOURCE_IO, }; |
1da177e4c
|
30 31 32 33 |
EXPORT_SYMBOL(ioport_resource); struct resource iomem_resource = { .name = "PCI mem", |
6550e07f4
|
34 35 |
.start = 0, .end = -1, |
1da177e4c
|
36 37 |
.flags = IORESOURCE_MEM, }; |
1da177e4c
|
38 |
EXPORT_SYMBOL(iomem_resource); |
23c570a67
|
39 40 41 42 43 44 45 |
/* 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
|
46 |
static DEFINE_RWLOCK(resource_lock); |
1da177e4c
|
47 48 49 50 51 52 53 54 55 56 |
static void *r_next(struct seq_file *m, void *v, loff_t *pos) { struct resource *p = v; (*pos)++; if (p->child) return p->child; while (!p->sibling && p->parent) p = p->parent; return p->sibling; } |
13eb83754
|
57 58 59 |
#ifdef CONFIG_PROC_FS enum { MAX_IORES_LEVEL = 5 }; |
1da177e4c
|
60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 |
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; 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; |
685143ac1
|
87 88 |
seq_printf(m, "%*s%0*llx-%0*llx : %s ", |
1da177e4c
|
89 |
depth * 2, "", |
685143ac1
|
90 91 |
width, (unsigned long long) r->start, width, (unsigned long long) r->end, |
1da177e4c
|
92 93 94 |
r->name ? r->name : "<BAD>"); return 0; } |
15ad7cdcf
|
95 |
static const struct seq_operations resource_op = { |
1da177e4c
|
96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 |
.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
|
121 |
static const struct file_operations proc_ioports_operations = { |
1da177e4c
|
122 123 124 125 126 |
.open = ioports_open, .read = seq_read, .llseek = seq_lseek, .release = seq_release, }; |
15ad7cdcf
|
127 |
static const struct file_operations proc_iomem_operations = { |
1da177e4c
|
128 129 130 131 132 133 134 135 |
.open = iomem_open, .read = seq_read, .llseek = seq_lseek, .release = seq_release, }; static int __init ioresources_init(void) { |
c33fff0af
|
136 137 |
proc_create("ioports", 0, NULL, &proc_ioports_operations); proc_create("iomem", 0, NULL, &proc_iomem_operations); |
1da177e4c
|
138 139 140 141 142 143 144 145 146 |
return 0; } __initcall(ioresources_init); #endif /* CONFIG_PROC_FS */ /* Return the conflict entry if you can't request it */ static struct resource * __request_resource(struct resource *root, struct resource *new) { |
d75fc8bbc
|
147 148 |
resource_size_t start = new->start; resource_size_t end = new->end; |
1da177e4c
|
149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 |
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; } } static int __release_resource(struct resource *old) { struct resource *tmp, **p; p = &old->parent->child; for (;;) { tmp = *p; if (!tmp) break; if (tmp == old) { *p = tmp->sibling; old->parent = NULL; return 0; } p = &tmp->sibling; } return -EINVAL; } |
5eeec0ec9
|
191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 |
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
|
221 |
/** |
66f1207bc
|
222 |
* request_resource_conflict - request and reserve an I/O or memory resource |
e1ca66d1b
|
223 224 225 |
* @root: root resource descriptor * @new: resource descriptor desired by caller * |
66f1207bc
|
226 |
* Returns 0 for success, conflict resource on error. |
e1ca66d1b
|
227 |
*/ |
66f1207bc
|
228 |
struct resource *request_resource_conflict(struct resource *root, struct resource *new) |
1da177e4c
|
229 230 231 232 233 234 |
{ struct resource *conflict; write_lock(&resource_lock); conflict = __request_resource(root, new); write_unlock(&resource_lock); |
66f1207bc
|
235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 |
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
|
250 251 252 253 |
return conflict ? -EBUSY : 0; } EXPORT_SYMBOL(request_resource); |
e1ca66d1b
|
254 |
/** |
e1ca66d1b
|
255 256 257 |
* release_resource - release a previously reserved resource * @old: resource pointer */ |
1da177e4c
|
258 259 260 261 262 263 264 265 266 267 268 |
int release_resource(struct resource *old) { int retval; write_lock(&resource_lock); retval = __release_resource(old); write_unlock(&resource_lock); return retval; } EXPORT_SYMBOL(release_resource); |
908eedc61
|
269 |
#if !defined(CONFIG_ARCH_HAS_WALK_MEMORY) |
2842f1141
|
270 271 |
/* * Finds the lowest memory reosurce exists within [res->start.res->end) |
908eedc61
|
272 |
* the caller must specify res->start, res->end, res->flags and "name". |
2842f1141
|
273 274 |
* If found, returns 0, res is overwritten, if not found, returns -1. */ |
908eedc61
|
275 |
static int find_next_system_ram(struct resource *res, char *name) |
2842f1141
|
276 277 278 279 280 281 282 283 |
{ resource_size_t start, end; struct resource *p; BUG_ON(!res); start = res->start; end = res->end; |
58c1b5b07
|
284 |
BUG_ON(start >= end); |
2842f1141
|
285 286 287 288 289 290 |
read_lock(&resource_lock); for (p = iomem_resource.child; p ; p = p->sibling) { /* system ram is just marked as IORESOURCE_MEM */ if (p->flags != res->flags) continue; |
908eedc61
|
291 292 |
if (name && strcmp(p->name, name)) continue; |
2842f1141
|
293 294 295 296 |
if (p->start > end) { p = NULL; break; } |
58c1b5b07
|
297 |
if ((p->end >= start) && (p->start < end)) |
2842f1141
|
298 299 300 301 302 303 |
break; } read_unlock(&resource_lock); if (!p) return -1; /* copy data */ |
0f04ab5ef
|
304 305 306 307 |
if (res->start < p->start) res->start = p->start; if (res->end > p->end) res->end = p->end; |
2842f1141
|
308 309 |
return 0; } |
908eedc61
|
310 311 312 313 314 315 316 317 |
/* * This function calls callback against all memory range of "System RAM" * which are marked as IORESOURCE_MEM and IORESOUCE_BUSY. * Now, this function is only for "System RAM". */ int walk_system_ram_range(unsigned long start_pfn, unsigned long nr_pages, void *arg, int (*func)(unsigned long, unsigned long, void *)) |
75884fb1c
|
318 319 |
{ struct resource res; |
37b99dd53
|
320 |
unsigned long pfn, end_pfn; |
75884fb1c
|
321 322 |
u64 orig_end; int ret = -1; |
908eedc61
|
323 |
|
75884fb1c
|
324 325 |
res.start = (u64) start_pfn << PAGE_SHIFT; res.end = ((u64)(start_pfn + nr_pages) << PAGE_SHIFT) - 1; |
887c3cb18
|
326 |
res.flags = IORESOURCE_MEM | IORESOURCE_BUSY; |
75884fb1c
|
327 |
orig_end = res.end; |
908eedc61
|
328 329 |
while ((res.start < res.end) && (find_next_system_ram(&res, "System RAM") >= 0)) { |
37b99dd53
|
330 331 332 |
pfn = (res.start + PAGE_SIZE - 1) >> PAGE_SHIFT; end_pfn = (res.end + 1) >> PAGE_SHIFT; if (end_pfn > pfn) |
f41496607
|
333 |
ret = (*func)(pfn, end_pfn - pfn, arg); |
75884fb1c
|
334 335 336 337 338 339 340 |
if (ret) break; res.start = res.end + 1; res.end = orig_end; } return ret; } |
2842f1141
|
341 |
#endif |
61ef2489d
|
342 343 344 345 346 347 348 349 |
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 * registered as "System RAM" in iomem_resource list. */ |
e52730071
|
350 |
int __weak page_is_ram(unsigned long pfn) |
61ef2489d
|
351 352 353 |
{ return walk_system_ram_range(pfn, 1, NULL, __is_ram) == 1; } |
fcb119183
|
354 355 356 |
void __weak arch_remove_reservations(struct resource *avail) { } |
a9cea0174
|
357 358 359 360 361 362 363 |
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
|
364 365 366 367 368 369 370 371 |
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; } |
6909ba14c
|
372 373 374 375 |
static bool resource_contains(struct resource *res1, struct resource *res2) { return res1->start <= res2->start && res1->end >= res2->end; } |
1da177e4c
|
376 |
/* |
23c570a67
|
377 378 |
* Find empty slot in the resource tree with the given range and * alignment constraints |
1da177e4c
|
379 |
*/ |
23c570a67
|
380 381 382 383 |
static int __find_resource(struct resource *root, struct resource *old, struct resource *new, resource_size_t size, struct resource_constraint *constraint) |
1da177e4c
|
384 385 |
{ struct resource *this = root->child; |
a1862e310
|
386 |
struct resource tmp = *new, avail, alloc; |
1da177e4c
|
387 |
|
fcb119183
|
388 |
tmp.flags = new->flags; |
0e2c8b8f5
|
389 |
tmp.start = root->start; |
1da177e4c
|
390 |
/* |
c0f5ac542
|
391 392 |
* 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
|
393 |
*/ |
23c570a67
|
394 395 |
if (this && this->start == root->start) { tmp.start = (this == old) ? old->start : this->end + 1; |
1da177e4c
|
396 397 |
this = this->sibling; } |
c0f5ac542
|
398 |
for(;;) { |
1da177e4c
|
399 |
if (this) |
23c570a67
|
400 |
tmp.end = (this == old) ? this->end : this->start - 1; |
1da177e4c
|
401 |
else |
0e2c8b8f5
|
402 |
tmp.end = root->end; |
5d6b1fa30
|
403 |
|
47ea91b40
|
404 405 |
if (tmp.end < tmp.start) goto next; |
23c570a67
|
406 |
resource_clip(&tmp, constraint->min, constraint->max); |
fcb119183
|
407 |
arch_remove_reservations(&tmp); |
a9cea0174
|
408 |
|
a1862e310
|
409 410 |
/* Check for overflow after ALIGN() */ avail = *new; |
23c570a67
|
411 |
avail.start = ALIGN(tmp.start, constraint->align); |
a1862e310
|
412 413 |
avail.end = tmp.end; if (avail.start >= tmp.start) { |
23c570a67
|
414 415 |
alloc.start = constraint->alignf(constraint->alignf_data, &avail, size, constraint->align); |
a1862e310
|
416 417 418 419 420 421 |
alloc.end = alloc.start + size - 1; if (resource_contains(&avail, &alloc)) { new->start = alloc.start; new->end = alloc.end; return 0; } |
1da177e4c
|
422 |
} |
47ea91b40
|
423 424 |
next: if (!this || this->end == root->end) |
1da177e4c
|
425 |
break; |
47ea91b40
|
426 |
|
23c570a67
|
427 428 |
if (this != old) tmp.start = this->end + 1; |
1da177e4c
|
429 430 431 432 |
this = this->sibling; } return -EBUSY; } |
23c570a67
|
433 434 435 436 437 438 439 440 441 |
/* * 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
|
442 |
/** |
23c570a67
|
443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 |
* 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. */ int reallocate_resource(struct resource *root, struct resource *old, 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 { __release_resource(old); *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
|
494 495 496 497 498 499 500 501 |
* @root: root resource descriptor * @new: resource descriptor desired by caller * @size: requested resource region size * @min: minimum size to allocate * @max: maximum size to allocate * @align: alignment requested, in bytes * @alignf: alignment function, optional, called if not NULL * @alignf_data: arbitrary data to pass to the @alignf function |
1da177e4c
|
502 503 |
*/ int allocate_resource(struct resource *root, struct resource *new, |
d75fc8bbc
|
504 505 |
resource_size_t size, resource_size_t min, resource_size_t max, resource_size_t align, |
b26b2d494
|
506 |
resource_size_t (*alignf)(void *, |
3b7a17fcd
|
507 |
const struct resource *, |
b26b2d494
|
508 509 |
resource_size_t, resource_size_t), |
1da177e4c
|
510 511 512 |
void *alignf_data) { int err; |
23c570a67
|
513 |
struct resource_constraint constraint; |
1da177e4c
|
514 |
|
a9cea0174
|
515 516 |
if (!alignf) alignf = simple_align_resource; |
23c570a67
|
517 518 519 520 521 522 523 524 525 526 527 |
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
|
528 |
write_lock(&resource_lock); |
23c570a67
|
529 |
err = find_resource(root, new, size, &constraint); |
1da177e4c
|
530 531 532 533 534 535 536 |
if (err >= 0 && __request_resource(root, new)) err = -EBUSY; write_unlock(&resource_lock); return err; } EXPORT_SYMBOL(allocate_resource); |
1c388919d
|
537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 |
/** * 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
|
557 558 559 |
/* * Insert a resource into the resource tree. If successful, return NULL, * otherwise return the conflicting resource (compare to __request_resource()) |
1da177e4c
|
560 |
*/ |
bef69ea0d
|
561 |
static struct resource * __insert_resource(struct resource *parent, struct resource *new) |
1da177e4c
|
562 |
{ |
1da177e4c
|
563 |
struct resource *first, *next; |
d33b6fba2
|
564 |
for (;; parent = first) { |
d33b6fba2
|
565 566 |
first = __request_resource(parent, new); if (!first) |
bef69ea0d
|
567 |
return first; |
d33b6fba2
|
568 |
|
d33b6fba2
|
569 |
if (first == parent) |
bef69ea0d
|
570 |
return first; |
5de1cb2d0
|
571 572 |
if (WARN_ON(first == new)) /* duplicated insertion */ return first; |
d33b6fba2
|
573 574 575 576 577 |
if ((first->start > new->start) || (first->end < new->end)) break; if ((first->start == new->start) && (first->end == new->end)) break; |
1da177e4c
|
578 579 580 581 582 |
} for (next = first; ; next = next->sibling) { /* Partial overlap? Bad, and unfixable */ if (next->start < new->start || next->end > new->end) |
bef69ea0d
|
583 |
return next; |
1da177e4c
|
584 585 586 587 588 |
if (!next->sibling) break; if (next->sibling->start > new->end) break; } |
1da177e4c
|
589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 |
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
|
605 606 |
return NULL; } |
1da177e4c
|
607 |
|
bef69ea0d
|
608 |
/** |
66f1207bc
|
609 |
* insert_resource_conflict - Inserts resource in the resource tree |
bef69ea0d
|
610 611 612 |
* @parent: parent of the new resource * @new: new resource to insert * |
66f1207bc
|
613 |
* Returns 0 on success, conflict resource if the resource can't be inserted. |
bef69ea0d
|
614 |
* |
66f1207bc
|
615 |
* This function is equivalent to request_resource_conflict when no conflict |
bef69ea0d
|
616 617 618 619 620 |
* 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. */ |
66f1207bc
|
621 |
struct resource *insert_resource_conflict(struct resource *parent, struct resource *new) |
bef69ea0d
|
622 623 624 625 626 627 |
{ struct resource *conflict; write_lock(&resource_lock); conflict = __insert_resource(parent, new); write_unlock(&resource_lock); |
66f1207bc
|
628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 |
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. */ int insert_resource(struct resource *parent, struct resource *new) { struct resource *conflict; conflict = insert_resource_conflict(parent, new); |
bef69ea0d
|
643 644 645 646 647 |
return conflict ? -EBUSY : 0; } /** * insert_resource_expand_to_fit - Insert a resource into the resource tree |
6781f4ae3
|
648 |
* @root: root resource descriptor |
bef69ea0d
|
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 675 676 677 |
* @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
|
678 |
write_unlock(&resource_lock); |
1da177e4c
|
679 |
} |
e1ca66d1b
|
680 681 682 683 684 685 |
/** * adjust_resource - modify a resource's start and size * @res: resource to modify * @start: new start value * @size: new size * |
1da177e4c
|
686 |
* Given an existing resource, change its start and size to match the |
e1ca66d1b
|
687 688 |
* arguments. Returns 0 on success, -EBUSY if it can't fit. * Existing children of the resource are assumed to be immutable. |
1da177e4c
|
689 |
*/ |
d75fc8bbc
|
690 |
int adjust_resource(struct resource *res, resource_size_t start, resource_size_t size) |
1da177e4c
|
691 692 |
{ struct resource *tmp, *parent = res->parent; |
d75fc8bbc
|
693 |
resource_size_t end = start + size - 1; |
1da177e4c
|
694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 |
int result = -EBUSY; write_lock(&resource_lock); if ((start < parent->start) || (end > parent->end)) goto out; for (tmp = res->child; tmp; tmp = tmp->sibling) { if ((tmp->start < start) || (tmp->end > end)) goto out; } 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; } res->start = start; res->end = end; result = 0; out: write_unlock(&resource_lock); return result; } |
268364a0f
|
725 726 727 728 729 730 |
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; |
42c020236
|
731 |
struct resource *res = kzalloc(sizeof(*res), GFP_ATOMIC); |
268364a0f
|
732 733 734 735 736 737 738 739 |
if (!res) return; res->name = name; res->start = start; res->end = end; res->flags = IORESOURCE_BUSY; |
ff54250a0
|
740 741 742 |
conflict = __request_resource(parent, res); if (!conflict) return; |
268364a0f
|
743 |
|
ff54250a0
|
744 745 |
/* failed, split and try again */ kfree(res); |
268364a0f
|
746 |
|
ff54250a0
|
747 748 749 |
/* conflict covered whole area */ if (conflict->start <= start && conflict->end >= end) return; |
268364a0f
|
750 |
|
ff54250a0
|
751 752 753 754 |
if (conflict->start > start) __reserve_region_with_split(root, start, conflict->start-1, name); if (conflict->end < end) __reserve_region_with_split(root, conflict->end+1, end, name); |
268364a0f
|
755 |
} |
bea921124
|
756 |
void __init reserve_region_with_split(struct resource *root, |
268364a0f
|
757 758 759 760 761 762 763 |
resource_size_t start, resource_size_t end, const char *name) { write_lock(&resource_lock); __reserve_region_with_split(root, start, end, name); write_unlock(&resource_lock); } |
1da177e4c
|
764 |
EXPORT_SYMBOL(adjust_resource); |
884525655
|
765 766 767 768 769 770 771 772 773 774 |
/** * 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
|
775 |
return resource_size(res); |
884525655
|
776 777 778 779 780 781 |
case IORESOURCE_STARTALIGN: return res->start; default: return 0; } } |
1da177e4c
|
782 783 784 785 786 787 |
/* * This is compatibility stuff for IO resources. * * Note how this, unlike the above, knows about * the IO flag meanings (busy etc). * |
e1ca66d1b
|
788 |
* request_region creates a new busy region. |
1da177e4c
|
789 |
* |
e1ca66d1b
|
790 |
* check_region returns non-zero if the area is already busy. |
1da177e4c
|
791 |
* |
e1ca66d1b
|
792 793 |
* release_region releases a matching busy region. */ |
8b6d043b7
|
794 |
static DECLARE_WAIT_QUEUE_HEAD(muxed_resource_wait); |
e1ca66d1b
|
795 796 797 798 799 800 |
/** * __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
|
801 |
* @flags: IO resource flags |
1da177e4c
|
802 |
*/ |
d75fc8bbc
|
803 804 |
struct resource * __request_region(struct resource *parent, resource_size_t start, resource_size_t n, |
e8de1481f
|
805 |
const char *name, int flags) |
1da177e4c
|
806 |
{ |
8b6d043b7
|
807 |
DECLARE_WAITQUEUE(wait, current); |
dd3927105
|
808 |
struct resource *res = kzalloc(sizeof(*res), GFP_KERNEL); |
1da177e4c
|
809 |
|
c26ec88ea
|
810 811 812 813 814 815 816 |
if (!res) return NULL; res->name = name; res->start = start; res->end = start + n - 1; res->flags = IORESOURCE_BUSY; |
e8de1481f
|
817 |
res->flags |= flags; |
c26ec88ea
|
818 819 820 821 822 823 824 825 |
write_lock(&resource_lock); for (;;) { struct resource *conflict; conflict = __request_resource(parent, res); if (!conflict) |
1da177e4c
|
826 |
break; |
c26ec88ea
|
827 828 829 830 |
if (conflict != parent) { parent = conflict; if (!(conflict->flags & IORESOURCE_BUSY)) continue; |
1da177e4c
|
831 |
} |
8b6d043b7
|
832 833 834 835 836 837 838 839 840 |
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
|
841 842 843 844 |
/* Uhhuh, that didn't work out.. */ kfree(res); res = NULL; break; |
1da177e4c
|
845 |
} |
c26ec88ea
|
846 |
write_unlock(&resource_lock); |
1da177e4c
|
847 848 |
return res; } |
1da177e4c
|
849 |
EXPORT_SYMBOL(__request_region); |
e1ca66d1b
|
850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 |
/** * __check_region - check if a resource region is busy or free * @parent: parent resource descriptor * @start: resource start address * @n: resource region size * * Returns 0 if the region is free at the moment it is checked, * returns %-EBUSY if the region is busy. * * NOTE: * This function is deprecated because its use is racy. * Even if it returns 0, a subsequent call to request_region() * may fail because another driver etc. just allocated the region. * Do NOT use it. It will be removed from the kernel. */ |
d75fc8bbc
|
865 866 |
int __check_region(struct resource *parent, resource_size_t start, resource_size_t n) |
1da177e4c
|
867 868 |
{ struct resource * res; |
e8de1481f
|
869 |
res = __request_region(parent, start, n, "check-region", 0); |
1da177e4c
|
870 871 872 873 874 875 876 |
if (!res) return -EBUSY; release_resource(res); kfree(res); return 0; } |
1da177e4c
|
877 |
EXPORT_SYMBOL(__check_region); |
e1ca66d1b
|
878 879 880 881 882 883 884 885 |
/** * __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
|
886 887 |
void __release_region(struct resource *parent, resource_size_t start, resource_size_t n) |
1da177e4c
|
888 889 |
{ struct resource **p; |
d75fc8bbc
|
890 |
resource_size_t end; |
1da177e4c
|
891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 |
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
|
911 912 |
if (res->flags & IORESOURCE_MUXED) wake_up(&muxed_resource_wait); |
1da177e4c
|
913 914 915 916 917 918 919 |
kfree(res); return; } p = &res->sibling; } write_unlock(&resource_lock); |
685143ac1
|
920 921 922 923 |
printk(KERN_WARNING "Trying to free nonexistent resource " "<%016llx-%016llx> ", (unsigned long long)start, (unsigned long long)end); |
1da177e4c
|
924 |
} |
1da177e4c
|
925 926 927 |
EXPORT_SYMBOL(__release_region); /* |
9ac7849e3
|
928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 |
* Managed region resource */ 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
|
966 |
res = __request_region(parent, start, n, name, 0); |
9ac7849e3
|
967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 |
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
|
988 989 990 991 992 993 994 995 996 |
* 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
|
997 |
unsigned int io_start, io_num; |
1da177e4c
|
998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 |
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; 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
|
1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 |
/* * 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
|
1040 1041 |
if (PFN_DOWN(p->start) <= PFN_DOWN(addr) && PFN_DOWN(p->end) >= PFN_DOWN(addr + size - 1)) |
379daf629
|
1042 |
continue; |
3ac52669c
|
1043 1044 1045 1046 1047 1048 1049 1050 |
/* * 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; |
379daf629
|
1051 1052 1053 |
printk(KERN_WARNING "resource map sanity check conflict: " "0x%llx 0x%llx 0x%llx 0x%llx %s ", |
13eb83754
|
1054 1055 1056 1057 1058 |
(unsigned long long)addr, (unsigned long long)(addr + size - 1), (unsigned long long)p->start, (unsigned long long)p->end, p->name); |
379daf629
|
1059 1060 1061 1062 1063 1064 1065 |
err = -1; break; } read_unlock(&resource_lock); return err; } |
e8de1481f
|
1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 |
#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; if (p->flags & IORESOURCE_BUSY && p->flags & IORESOURCE_EXCLUSIVE) { err = 1; break; } } read_unlock(&resource_lock); return err; } 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); |