Blame view
kernel/resource.c
23 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 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> #include <linux/seq_file.h> |
9ac7849e3
|
18 |
#include <linux/device.h> |
d68612b25
|
19 |
#include <linux/pfn.h> |
1da177e4c
|
20 21 22 23 24 |
#include <asm/io.h> struct resource ioport_resource = { .name = "PCI IO", |
6550e07f4
|
25 |
.start = 0, |
1da177e4c
|
26 27 28 |
.end = IO_SPACE_LIMIT, .flags = IORESOURCE_IO, }; |
1da177e4c
|
29 30 31 32 |
EXPORT_SYMBOL(ioport_resource); struct resource iomem_resource = { .name = "PCI mem", |
6550e07f4
|
33 34 |
.start = 0, .end = -1, |
1da177e4c
|
35 36 |
.flags = IORESOURCE_MEM, }; |
1da177e4c
|
37 38 39 |
EXPORT_SYMBOL(iomem_resource); static DEFINE_RWLOCK(resource_lock); |
1da177e4c
|
40 41 42 43 44 45 46 47 48 49 |
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
|
50 51 52 |
#ifdef CONFIG_PROC_FS enum { MAX_IORES_LEVEL = 5 }; |
1da177e4c
|
53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 |
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
|
80 81 |
seq_printf(m, "%*s%0*llx-%0*llx : %s ", |
1da177e4c
|
82 |
depth * 2, "", |
685143ac1
|
83 84 |
width, (unsigned long long) r->start, width, (unsigned long long) r->end, |
1da177e4c
|
85 86 87 |
r->name ? r->name : "<BAD>"); return 0; } |
15ad7cdcf
|
88 |
static const struct seq_operations resource_op = { |
1da177e4c
|
89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 |
.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
|
114 |
static const struct file_operations proc_ioports_operations = { |
1da177e4c
|
115 116 117 118 119 |
.open = ioports_open, .read = seq_read, .llseek = seq_lseek, .release = seq_release, }; |
15ad7cdcf
|
120 |
static const struct file_operations proc_iomem_operations = { |
1da177e4c
|
121 122 123 124 125 126 127 128 |
.open = iomem_open, .read = seq_read, .llseek = seq_lseek, .release = seq_release, }; static int __init ioresources_init(void) { |
c33fff0af
|
129 130 |
proc_create("ioports", 0, NULL, &proc_ioports_operations); proc_create("iomem", 0, NULL, &proc_iomem_operations); |
1da177e4c
|
131 132 133 134 135 136 137 138 139 |
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
|
140 141 |
resource_size_t start = new->start; resource_size_t end = new->end; |
1da177e4c
|
142 143 144 145 146 147 148 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 |
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
|
184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 |
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
|
214 |
/** |
66f1207bc
|
215 |
* request_resource_conflict - request and reserve an I/O or memory resource |
e1ca66d1b
|
216 217 218 |
* @root: root resource descriptor * @new: resource descriptor desired by caller * |
66f1207bc
|
219 |
* Returns 0 for success, conflict resource on error. |
e1ca66d1b
|
220 |
*/ |
66f1207bc
|
221 |
struct resource *request_resource_conflict(struct resource *root, struct resource *new) |
1da177e4c
|
222 223 224 225 226 227 |
{ struct resource *conflict; write_lock(&resource_lock); conflict = __request_resource(root, new); write_unlock(&resource_lock); |
66f1207bc
|
228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 |
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
|
243 244 245 246 |
return conflict ? -EBUSY : 0; } EXPORT_SYMBOL(request_resource); |
e1ca66d1b
|
247 |
/** |
e1ca66d1b
|
248 249 250 |
* release_resource - release a previously reserved resource * @old: resource pointer */ |
1da177e4c
|
251 252 253 254 255 256 257 258 259 260 261 |
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
|
262 |
#if !defined(CONFIG_ARCH_HAS_WALK_MEMORY) |
2842f1141
|
263 264 |
/* * Finds the lowest memory reosurce exists within [res->start.res->end) |
908eedc61
|
265 |
* the caller must specify res->start, res->end, res->flags and "name". |
2842f1141
|
266 267 |
* If found, returns 0, res is overwritten, if not found, returns -1. */ |
908eedc61
|
268 |
static int find_next_system_ram(struct resource *res, char *name) |
2842f1141
|
269 270 271 272 273 274 275 276 |
{ resource_size_t start, end; struct resource *p; BUG_ON(!res); start = res->start; end = res->end; |
58c1b5b07
|
277 |
BUG_ON(start >= end); |
2842f1141
|
278 279 280 281 282 283 |
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
|
284 285 |
if (name && strcmp(p->name, name)) continue; |
2842f1141
|
286 287 288 289 |
if (p->start > end) { p = NULL; break; } |
58c1b5b07
|
290 |
if ((p->end >= start) && (p->start < end)) |
2842f1141
|
291 292 293 294 295 296 |
break; } read_unlock(&resource_lock); if (!p) return -1; /* copy data */ |
0f04ab5ef
|
297 298 299 300 |
if (res->start < p->start) res->start = p->start; if (res->end > p->end) res->end = p->end; |
2842f1141
|
301 302 |
return 0; } |
908eedc61
|
303 304 305 306 307 308 309 310 |
/* * 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
|
311 312 |
{ struct resource res; |
37b99dd53
|
313 |
unsigned long pfn, end_pfn; |
75884fb1c
|
314 315 |
u64 orig_end; int ret = -1; |
908eedc61
|
316 |
|
75884fb1c
|
317 318 |
res.start = (u64) start_pfn << PAGE_SHIFT; res.end = ((u64)(start_pfn + nr_pages) << PAGE_SHIFT) - 1; |
887c3cb18
|
319 |
res.flags = IORESOURCE_MEM | IORESOURCE_BUSY; |
75884fb1c
|
320 |
orig_end = res.end; |
908eedc61
|
321 322 |
while ((res.start < res.end) && (find_next_system_ram(&res, "System RAM") >= 0)) { |
37b99dd53
|
323 324 325 |
pfn = (res.start + PAGE_SIZE - 1) >> PAGE_SHIFT; end_pfn = (res.end + 1) >> PAGE_SHIFT; if (end_pfn > pfn) |
f41496607
|
326 |
ret = (*func)(pfn, end_pfn - pfn, arg); |
75884fb1c
|
327 328 329 330 331 332 333 |
if (ret) break; res.start = res.end + 1; res.end = orig_end; } return ret; } |
2842f1141
|
334 |
#endif |
61ef2489d
|
335 336 337 338 339 340 341 342 |
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
|
343 |
int __weak page_is_ram(unsigned long pfn) |
61ef2489d
|
344 345 346 |
{ return walk_system_ram_range(pfn, 1, NULL, __is_ram) == 1; } |
1da177e4c
|
347 348 349 350 |
/* * Find empty slot in the resource tree given range and alignment. */ static int find_resource(struct resource *root, struct resource *new, |
d75fc8bbc
|
351 352 |
resource_size_t size, resource_size_t min, resource_size_t max, resource_size_t align, |
b26b2d494
|
353 |
resource_size_t (*alignf)(void *, |
3b7a17fcd
|
354 |
const struct resource *, |
b26b2d494
|
355 356 |
resource_size_t, resource_size_t), |
1da177e4c
|
357 358 359 |
void *alignf_data) { struct resource *this = root->child; |
0e2c8b8f5
|
360 |
struct resource tmp = *new; |
1da177e4c
|
361 |
|
0e2c8b8f5
|
362 |
tmp.start = root->start; |
1da177e4c
|
363 364 |
/* * Skip past an allocated resource that starts at 0, since the assignment |
0e2c8b8f5
|
365 |
* of this->start - 1 to tmp->end below would cause an underflow. |
1da177e4c
|
366 367 |
*/ if (this && this->start == 0) { |
0e2c8b8f5
|
368 |
tmp.start = this->end + 1; |
1da177e4c
|
369 370 371 372 |
this = this->sibling; } for(;;) { if (this) |
0e2c8b8f5
|
373 |
tmp.end = this->start - 1; |
1da177e4c
|
374 |
else |
0e2c8b8f5
|
375 376 377 378 379 380 |
tmp.end = root->end; if (tmp.start < min) tmp.start = min; if (tmp.end > max) tmp.end = max; tmp.start = ALIGN(tmp.start, align); |
1da177e4c
|
381 |
if (alignf) |
b26b2d494
|
382 |
tmp.start = alignf(alignf_data, &tmp, size, align); |
0e2c8b8f5
|
383 384 385 |
if (tmp.start < tmp.end && tmp.end - tmp.start >= size - 1) { new->start = tmp.start; new->end = tmp.start + size - 1; |
1da177e4c
|
386 387 388 389 |
return 0; } if (!this) break; |
0e2c8b8f5
|
390 |
tmp.start = this->end + 1; |
1da177e4c
|
391 392 393 394 |
this = this->sibling; } return -EBUSY; } |
e1ca66d1b
|
395 396 397 398 399 400 401 402 403 404 |
/** * allocate_resource - allocate empty slot in the resource tree given range & alignment * @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
|
405 406 |
*/ int allocate_resource(struct resource *root, struct resource *new, |
d75fc8bbc
|
407 408 |
resource_size_t size, resource_size_t min, resource_size_t max, resource_size_t align, |
b26b2d494
|
409 |
resource_size_t (*alignf)(void *, |
3b7a17fcd
|
410 |
const struct resource *, |
b26b2d494
|
411 412 |
resource_size_t, resource_size_t), |
1da177e4c
|
413 414 415 416 417 418 419 420 421 422 423 424 425 |
void *alignf_data) { int err; write_lock(&resource_lock); err = find_resource(root, new, size, min, max, align, alignf, alignf_data); if (err >= 0 && __request_resource(root, new)) err = -EBUSY; write_unlock(&resource_lock); return err; } EXPORT_SYMBOL(allocate_resource); |
bef69ea0d
|
426 427 428 |
/* * Insert a resource into the resource tree. If successful, return NULL, * otherwise return the conflicting resource (compare to __request_resource()) |
1da177e4c
|
429 |
*/ |
bef69ea0d
|
430 |
static struct resource * __insert_resource(struct resource *parent, struct resource *new) |
1da177e4c
|
431 |
{ |
1da177e4c
|
432 |
struct resource *first, *next; |
d33b6fba2
|
433 |
for (;; parent = first) { |
d33b6fba2
|
434 435 |
first = __request_resource(parent, new); if (!first) |
bef69ea0d
|
436 |
return first; |
d33b6fba2
|
437 |
|
d33b6fba2
|
438 |
if (first == parent) |
bef69ea0d
|
439 |
return first; |
d33b6fba2
|
440 441 442 443 444 |
if ((first->start > new->start) || (first->end < new->end)) break; if ((first->start == new->start) && (first->end == new->end)) break; |
1da177e4c
|
445 446 447 448 449 |
} for (next = first; ; next = next->sibling) { /* Partial overlap? Bad, and unfixable */ if (next->start < new->start || next->end > new->end) |
bef69ea0d
|
450 |
return next; |
1da177e4c
|
451 452 453 454 455 |
if (!next->sibling) break; if (next->sibling->start > new->end) break; } |
1da177e4c
|
456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 |
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
|
472 473 |
return NULL; } |
1da177e4c
|
474 |
|
bef69ea0d
|
475 |
/** |
66f1207bc
|
476 |
* insert_resource_conflict - Inserts resource in the resource tree |
bef69ea0d
|
477 478 479 |
* @parent: parent of the new resource * @new: new resource to insert * |
66f1207bc
|
480 |
* Returns 0 on success, conflict resource if the resource can't be inserted. |
bef69ea0d
|
481 |
* |
66f1207bc
|
482 |
* This function is equivalent to request_resource_conflict when no conflict |
bef69ea0d
|
483 484 485 486 487 |
* 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
|
488 |
struct resource *insert_resource_conflict(struct resource *parent, struct resource *new) |
bef69ea0d
|
489 490 491 492 493 494 |
{ struct resource *conflict; write_lock(&resource_lock); conflict = __insert_resource(parent, new); write_unlock(&resource_lock); |
66f1207bc
|
495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 |
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
|
510 511 512 513 514 |
return conflict ? -EBUSY : 0; } /** * insert_resource_expand_to_fit - Insert a resource into the resource tree |
6781f4ae3
|
515 |
* @root: root resource descriptor |
bef69ea0d
|
516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 |
* @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
|
545 |
write_unlock(&resource_lock); |
1da177e4c
|
546 |
} |
e1ca66d1b
|
547 548 549 550 551 552 |
/** * adjust_resource - modify a resource's start and size * @res: resource to modify * @start: new start value * @size: new size * |
1da177e4c
|
553 |
* Given an existing resource, change its start and size to match the |
e1ca66d1b
|
554 555 |
* arguments. Returns 0 on success, -EBUSY if it can't fit. * Existing children of the resource are assumed to be immutable. |
1da177e4c
|
556 |
*/ |
d75fc8bbc
|
557 |
int adjust_resource(struct resource *res, resource_size_t start, resource_size_t size) |
1da177e4c
|
558 559 |
{ struct resource *tmp, *parent = res->parent; |
d75fc8bbc
|
560 |
resource_size_t end = start + size - 1; |
1da177e4c
|
561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 |
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
|
592 593 594 595 596 597 |
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
|
598 |
struct resource *res = kzalloc(sizeof(*res), GFP_ATOMIC); |
268364a0f
|
599 600 601 602 603 604 605 606 |
if (!res) return; res->name = name; res->start = start; res->end = end; res->flags = IORESOURCE_BUSY; |
ff54250a0
|
607 608 609 |
conflict = __request_resource(parent, res); if (!conflict) return; |
268364a0f
|
610 |
|
ff54250a0
|
611 612 |
/* failed, split and try again */ kfree(res); |
268364a0f
|
613 |
|
ff54250a0
|
614 615 616 |
/* conflict covered whole area */ if (conflict->start <= start && conflict->end >= end) return; |
268364a0f
|
617 |
|
ff54250a0
|
618 619 620 621 |
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
|
622 |
} |
bea921124
|
623 |
void __init reserve_region_with_split(struct resource *root, |
268364a0f
|
624 625 626 627 628 629 630 |
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
|
631 |
EXPORT_SYMBOL(adjust_resource); |
884525655
|
632 633 634 635 636 637 638 639 640 641 |
/** * 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
|
642 |
return resource_size(res); |
884525655
|
643 644 645 646 647 648 |
case IORESOURCE_STARTALIGN: return res->start; default: return 0; } } |
1da177e4c
|
649 650 651 652 653 654 |
/* * This is compatibility stuff for IO resources. * * Note how this, unlike the above, knows about * the IO flag meanings (busy etc). * |
e1ca66d1b
|
655 |
* request_region creates a new busy region. |
1da177e4c
|
656 |
* |
e1ca66d1b
|
657 |
* check_region returns non-zero if the area is already busy. |
1da177e4c
|
658 |
* |
e1ca66d1b
|
659 660 661 662 663 664 665 666 667 |
* release_region releases a matching busy region. */ /** * __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
|
668 |
* @flags: IO resource flags |
1da177e4c
|
669 |
*/ |
d75fc8bbc
|
670 671 |
struct resource * __request_region(struct resource *parent, resource_size_t start, resource_size_t n, |
e8de1481f
|
672 |
const char *name, int flags) |
1da177e4c
|
673 |
{ |
dd3927105
|
674 |
struct resource *res = kzalloc(sizeof(*res), GFP_KERNEL); |
1da177e4c
|
675 |
|
c26ec88ea
|
676 677 678 679 680 681 682 |
if (!res) return NULL; res->name = name; res->start = start; res->end = start + n - 1; res->flags = IORESOURCE_BUSY; |
e8de1481f
|
683 |
res->flags |= flags; |
c26ec88ea
|
684 685 686 687 688 689 690 691 |
write_lock(&resource_lock); for (;;) { struct resource *conflict; conflict = __request_resource(parent, res); if (!conflict) |
1da177e4c
|
692 |
break; |
c26ec88ea
|
693 694 695 696 |
if (conflict != parent) { parent = conflict; if (!(conflict->flags & IORESOURCE_BUSY)) continue; |
1da177e4c
|
697 |
} |
c26ec88ea
|
698 699 700 701 702 |
/* Uhhuh, that didn't work out.. */ kfree(res); res = NULL; break; |
1da177e4c
|
703 |
} |
c26ec88ea
|
704 |
write_unlock(&resource_lock); |
1da177e4c
|
705 706 |
return res; } |
1da177e4c
|
707 |
EXPORT_SYMBOL(__request_region); |
e1ca66d1b
|
708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 |
/** * __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
|
723 724 |
int __check_region(struct resource *parent, resource_size_t start, resource_size_t n) |
1da177e4c
|
725 726 |
{ struct resource * res; |
e8de1481f
|
727 |
res = __request_region(parent, start, n, "check-region", 0); |
1da177e4c
|
728 729 730 731 732 733 734 |
if (!res) return -EBUSY; release_resource(res); kfree(res); return 0; } |
1da177e4c
|
735 |
EXPORT_SYMBOL(__check_region); |
e1ca66d1b
|
736 737 738 739 740 741 742 743 |
/** * __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
|
744 745 |
void __release_region(struct resource *parent, resource_size_t start, resource_size_t n) |
1da177e4c
|
746 747 |
{ struct resource **p; |
d75fc8bbc
|
748 |
resource_size_t end; |
1da177e4c
|
749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 |
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); kfree(res); return; } p = &res->sibling; } write_unlock(&resource_lock); |
685143ac1
|
776 777 778 779 |
printk(KERN_WARNING "Trying to free nonexistent resource " "<%016llx-%016llx> ", (unsigned long long)start, (unsigned long long)end); |
1da177e4c
|
780 |
} |
1da177e4c
|
781 782 783 |
EXPORT_SYMBOL(__release_region); /* |
9ac7849e3
|
784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 |
* 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
|
822 |
res = __request_region(parent, start, n, name, 0); |
9ac7849e3
|
823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 |
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
|
844 845 846 847 848 849 850 851 852 |
* 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
|
853 |
unsigned int io_start, io_num; |
1da177e4c
|
854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 |
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
|
875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 |
/* * 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
|
896 897 |
if (PFN_DOWN(p->start) <= PFN_DOWN(addr) && PFN_DOWN(p->end) >= PFN_DOWN(addr + size - 1)) |
379daf629
|
898 |
continue; |
3ac52669c
|
899 900 901 902 903 904 905 906 |
/* * 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
|
907 908 909 |
printk(KERN_WARNING "resource map sanity check conflict: " "0x%llx 0x%llx 0x%llx 0x%llx %s ", |
13eb83754
|
910 911 912 913 914 |
(unsigned long long)addr, (unsigned long long)(addr + size - 1), (unsigned long long)p->start, (unsigned long long)p->end, p->name); |
379daf629
|
915 916 917 918 919 920 921 |
err = -1; break; } read_unlock(&resource_lock); return err; } |
e8de1481f
|
922 923 924 925 926 927 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 966 967 968 969 970 971 972 973 974 975 |
#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); |