Blame view
kernel/resource.c
36.3 KB
1da177e4c Linux-2.6.12-rc2 |
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 resource: make su... |
9 |
#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt |
9984de1a5 kernel: Map most ... |
10 |
#include <linux/export.h> |
1da177e4c Linux-2.6.12-rc2 |
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 resource: shared ... |
18 |
#include <linux/sched.h> |
1da177e4c Linux-2.6.12-rc2 |
19 |
#include <linux/seq_file.h> |
9ac7849e3 devres: device re... |
20 |
#include <linux/device.h> |
d68612b25 resources: fix x8... |
21 |
#include <linux/pfn.h> |
ebff7d8f2 mem hotunplug: fi... |
22 |
#include <linux/mm.h> |
90e978206 resources: Move s... |
23 |
#include <linux/resource_ext.h> |
1da177e4c Linux-2.6.12-rc2 |
24 25 26 27 28 |
#include <asm/io.h> struct resource ioport_resource = { .name = "PCI IO", |
6550e07f4 [PATCH] 64bit Res... |
29 |
.start = 0, |
1da177e4c Linux-2.6.12-rc2 |
30 31 32 |
.end = IO_SPACE_LIMIT, .flags = IORESOURCE_IO, }; |
1da177e4c Linux-2.6.12-rc2 |
33 34 35 36 |
EXPORT_SYMBOL(ioport_resource); struct resource iomem_resource = { .name = "PCI mem", |
6550e07f4 [PATCH] 64bit Res... |
37 38 |
.start = 0, .end = -1, |
1da177e4c Linux-2.6.12-rc2 |
39 40 |
.flags = IORESOURCE_MEM, }; |
1da177e4c Linux-2.6.12-rc2 |
41 |
EXPORT_SYMBOL(iomem_resource); |
23c570a67 resource: ability... |
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 Linux-2.6.12-rc2 |
49 |
static DEFINE_RWLOCK(resource_lock); |
ebff7d8f2 mem hotunplug: fi... |
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 resource: provide... |
57 |
static struct resource *next_resource(struct resource *p, bool sibling_only) |
1da177e4c Linux-2.6.12-rc2 |
58 |
{ |
8c86e70ac resource: provide... |
59 60 61 |
/* Caller wants to traverse through siblings only */ if (sibling_only) return p->sibling; |
1da177e4c Linux-2.6.12-rc2 |
62 63 64 65 66 67 |
if (p->child) return p->child; while (!p->sibling && p->parent) p = p->parent; return p->sibling; } |
8c86e70ac resource: provide... |
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 IO resources, x86... |
74 75 76 |
#ifdef CONFIG_PROC_FS enum { MAX_IORES_LEVEL = 5 }; |
1da177e4c Linux-2.6.12-rc2 |
77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 |
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 [PATCH] 64bit res... |
104 105 |
seq_printf(m, "%*s%0*llx-%0*llx : %s ", |
1da177e4c Linux-2.6.12-rc2 |
106 |
depth * 2, "", |
685143ac1 [PATCH] 64bit res... |
107 108 |
width, (unsigned long long) r->start, width, (unsigned long long) r->end, |
1da177e4c Linux-2.6.12-rc2 |
109 110 111 |
r->name ? r->name : "<BAD>"); return 0; } |
15ad7cdcf [PATCH] struct se... |
112 |
static const struct seq_operations resource_op = { |
1da177e4c Linux-2.6.12-rc2 |
113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 |
.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 [PATCH] struct se... |
138 |
static const struct file_operations proc_ioports_operations = { |
1da177e4c Linux-2.6.12-rc2 |
139 140 141 142 143 |
.open = ioports_open, .read = seq_read, .llseek = seq_lseek, .release = seq_release, }; |
15ad7cdcf [PATCH] struct se... |
144 |
static const struct file_operations proc_iomem_operations = { |
1da177e4c Linux-2.6.12-rc2 |
145 146 147 148 149 150 151 152 |
.open = iomem_open, .read = seq_read, .llseek = seq_lseek, .release = seq_release, }; static int __init ioresources_init(void) { |
c33fff0af kernel: use non-r... |
153 154 |
proc_create("ioports", 0, NULL, &proc_ioports_operations); proc_create("iomem", 0, NULL, &proc_iomem_operations); |
1da177e4c Linux-2.6.12-rc2 |
155 156 157 158 159 |
return 0; } __initcall(ioresources_init); #endif /* CONFIG_PROC_FS */ |
ebff7d8f2 mem hotunplug: fi... |
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 191 192 |
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 Linux-2.6.12-rc2 |
193 194 195 |
/* Return the conflict entry if you can't request it */ static struct resource * __request_resource(struct resource *root, struct resource *new) { |
d75fc8bbc [PATCH] 64bit res... |
196 197 |
resource_size_t start = new->start; resource_size_t end = new->end; |
1da177e4c Linux-2.6.12-rc2 |
198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 |
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 resource: add rel... |
240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 |
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 [PATCH] kernel-do... |
270 |
/** |
66f1207bc resources: add in... |
271 |
* request_resource_conflict - request and reserve an I/O or memory resource |
e1ca66d1b [PATCH] kernel-do... |
272 273 274 |
* @root: root resource descriptor * @new: resource descriptor desired by caller * |
66f1207bc resources: add in... |
275 |
* Returns 0 for success, conflict resource on error. |
e1ca66d1b [PATCH] kernel-do... |
276 |
*/ |
66f1207bc resources: add in... |
277 |
struct resource *request_resource_conflict(struct resource *root, struct resource *new) |
1da177e4c Linux-2.6.12-rc2 |
278 279 280 281 282 283 |
{ struct resource *conflict; write_lock(&resource_lock); conflict = __request_resource(root, new); write_unlock(&resource_lock); |
66f1207bc resources: add in... |
284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 |
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 Linux-2.6.12-rc2 |
299 300 301 302 |
return conflict ? -EBUSY : 0; } EXPORT_SYMBOL(request_resource); |
e1ca66d1b [PATCH] kernel-do... |
303 |
/** |
e1ca66d1b [PATCH] kernel-do... |
304 305 306 |
* release_resource - release a previously reserved resource * @old: resource pointer */ |
1da177e4c Linux-2.6.12-rc2 |
307 308 309 310 311 312 313 314 315 316 317 |
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); |
2842f1141 [PATCH] catch val... |
318 |
/* |
8c86e70ac resource: provide... |
319 |
* Finds the lowest iomem reosurce exists with-in [res->start.res->end) |
908eedc61 walk system ram r... |
320 |
* the caller must specify res->start, res->end, res->flags and "name". |
2842f1141 [PATCH] catch val... |
321 |
* If found, returns 0, res is overwritten, if not found, returns -1. |
8c86e70ac resource: provide... |
322 323 |
* This walks through whole tree and not just first level children * until and unless first_level_children_only is true. |
2842f1141 [PATCH] catch val... |
324 |
*/ |
8c86e70ac resource: provide... |
325 326 |
static int find_next_iomem_res(struct resource *res, char *name, bool first_level_children_only) |
2842f1141 [PATCH] catch val... |
327 328 329 |
{ resource_size_t start, end; struct resource *p; |
8c86e70ac resource: provide... |
330 |
bool sibling_only = false; |
2842f1141 [PATCH] catch val... |
331 332 333 334 335 |
BUG_ON(!res); start = res->start; end = res->end; |
58c1b5b07 [PATCH] memory ho... |
336 |
BUG_ON(start >= end); |
2842f1141 [PATCH] catch val... |
337 |
|
800df627e resource: fix the... |
338 |
if (first_level_children_only) |
8c86e70ac resource: provide... |
339 |
sibling_only = true; |
8c86e70ac resource: provide... |
340 |
|
800df627e resource: fix the... |
341 342 343 |
read_lock(&resource_lock); for (p = iomem_resource.child; p; p = next_resource(p, sibling_only)) { |
2842f1141 [PATCH] catch val... |
344 345 |
if (p->flags != res->flags) continue; |
908eedc61 walk system ram r... |
346 347 |
if (name && strcmp(p->name, name)) continue; |
2842f1141 [PATCH] catch val... |
348 349 350 351 |
if (p->start > end) { p = NULL; break; } |
58c1b5b07 [PATCH] memory ho... |
352 |
if ((p->end >= start) && (p->start < end)) |
2842f1141 [PATCH] catch val... |
353 354 |
break; } |
8c86e70ac resource: provide... |
355 |
|
2842f1141 [PATCH] catch val... |
356 357 358 359 |
read_unlock(&resource_lock); if (!p) return -1; /* copy data */ |
0f04ab5ef [PATCH] memory ho... |
360 361 362 363 |
if (res->start < p->start) res->start = p->start; if (res->end > p->end) res->end = p->end; |
2842f1141 [PATCH] catch val... |
364 365 |
return 0; } |
908eedc61 walk system ram r... |
366 367 |
/* |
8c86e70ac resource: provide... |
368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 |
* 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 * name are valid candidates. * * @name: name of resource * @flags: resource flags * @start: start addr * @end: end addr */ int walk_iomem_res(char *name, 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) && (!find_next_iomem_res(&res, name, false))) { ret = (*func)(res.start, res.end, arg); if (ret) break; res.start = res.end + 1; res.end = orig_end; } return ret; } /* * 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". This function deals with * full ranges and not pfn. If resources are not pfn aligned, dealing * with pfn can truncate ranges. */ 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; res.flags = IORESOURCE_MEM | IORESOURCE_BUSY; orig_end = res.end; while ((res.start < res.end) && (!find_next_iomem_res(&res, "System RAM", true))) { 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) /* |
908eedc61 walk system ram r... |
432 433 434 435 436 437 |
* 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 memory unplug: me... |
438 439 |
{ struct resource res; |
37b99dd53 resource: Fix gen... |
440 |
unsigned long pfn, end_pfn; |
75884fb1c memory unplug: me... |
441 442 |
u64 orig_end; int ret = -1; |
908eedc61 walk system ram r... |
443 |
|
75884fb1c memory unplug: me... |
444 445 |
res.start = (u64) start_pfn << PAGE_SHIFT; res.end = ((u64)(start_pfn + nr_pages) << PAGE_SHIFT) - 1; |
887c3cb18 Add IORESOUCE_BUS... |
446 |
res.flags = IORESOURCE_MEM | IORESOURCE_BUSY; |
75884fb1c memory unplug: me... |
447 |
orig_end = res.end; |
908eedc61 walk system ram r... |
448 |
while ((res.start < res.end) && |
8c86e70ac resource: provide... |
449 |
(find_next_iomem_res(&res, "System RAM", true) >= 0)) { |
37b99dd53 resource: Fix gen... |
450 451 452 |
pfn = (res.start + PAGE_SIZE - 1) >> PAGE_SHIFT; end_pfn = (res.end + 1) >> PAGE_SHIFT; if (end_pfn > pfn) |
f41496607 resource: Fix bro... |
453 |
ret = (*func)(pfn, end_pfn - pfn, arg); |
75884fb1c memory unplug: me... |
454 455 456 457 458 459 460 |
if (ret) break; res.start = res.end + 1; res.end = orig_end; } return ret; } |
2842f1141 [PATCH] catch val... |
461 |
#endif |
61ef2489d resources: introd... |
462 463 464 465 466 467 468 469 |
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 Generic page_is_r... |
470 |
int __weak page_is_ram(unsigned long pfn) |
61ef2489d resources: introd... |
471 472 473 |
{ return walk_system_ram_range(pfn, 1, NULL, __is_ram) == 1; } |
c5a130325 ACPI/APEI: Add pa... |
474 |
EXPORT_SYMBOL_GPL(page_is_ram); |
61ef2489d resources: introd... |
475 |
|
67cf13cee x86: optimize res... |
476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 |
/* * Search for a resouce entry that fully contains the specified region. * If found, return 1 if it is RAM, 0 if not. * If not found, or region is not fully contained, return -1 * * Used by the ioremap functions to ensure the user is not remapping RAM and is * a vast speed up over walking through the resource table page by page. */ int region_is_ram(resource_size_t start, unsigned long size) { struct resource *p; resource_size_t end = start + size - 1; int flags = IORESOURCE_MEM | IORESOURCE_BUSY; const char *name = "System RAM"; int ret = -1; read_lock(&resource_lock); for (p = iomem_resource.child; p ; p = p->sibling) { if (end < p->start) continue; if (p->start <= start && end <= p->end) { /* resource fully contains region */ if ((p->flags != flags) || strcmp(p->name, name)) ret = 0; else ret = 1; break; } if (p->end < start) break; /* not found */ } read_unlock(&resource_lock); return ret; } |
fcb119183 resources: add ar... |
511 512 513 |
void __weak arch_remove_reservations(struct resource *avail) { } |
a9cea0174 resources: add a ... |
514 515 516 517 518 519 520 |
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 resources: factor... |
521 522 523 524 525 526 527 528 |
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 Linux-2.6.12-rc2 |
529 |
/* |
23c570a67 resource: ability... |
530 531 |
* Find empty slot in the resource tree with the given range and * alignment constraints |
1da177e4c Linux-2.6.12-rc2 |
532 |
*/ |
23c570a67 resource: ability... |
533 534 535 536 |
static int __find_resource(struct resource *root, struct resource *old, struct resource *new, resource_size_t size, struct resource_constraint *constraint) |
1da177e4c Linux-2.6.12-rc2 |
537 538 |
{ struct resource *this = root->child; |
a1862e310 resources: handle... |
539 |
struct resource tmp = *new, avail, alloc; |
1da177e4c Linux-2.6.12-rc2 |
540 |
|
0e2c8b8f5 resources: fix ca... |
541 |
tmp.start = root->start; |
1da177e4c Linux-2.6.12-rc2 |
542 |
/* |
c0f5ac542 Revert "resources... |
543 544 |
* 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 Linux-2.6.12-rc2 |
545 |
*/ |
23c570a67 resource: ability... |
546 547 |
if (this && this->start == root->start) { tmp.start = (this == old) ? old->start : this->end + 1; |
1da177e4c Linux-2.6.12-rc2 |
548 549 |
this = this->sibling; } |
c0f5ac542 Revert "resources... |
550 |
for(;;) { |
1da177e4c Linux-2.6.12-rc2 |
551 |
if (this) |
23c570a67 resource: ability... |
552 |
tmp.end = (this == old) ? this->end : this->start - 1; |
1da177e4c Linux-2.6.12-rc2 |
553 |
else |
0e2c8b8f5 resources: fix ca... |
554 |
tmp.end = root->end; |
5d6b1fa30 resources: factor... |
555 |
|
47ea91b40 Resource: fix wro... |
556 557 |
if (tmp.end < tmp.start) goto next; |
23c570a67 resource: ability... |
558 |
resource_clip(&tmp, constraint->min, constraint->max); |
fcb119183 resources: add ar... |
559 |
arch_remove_reservations(&tmp); |
a9cea0174 resources: add a ... |
560 |
|
a1862e310 resources: handle... |
561 |
/* Check for overflow after ALIGN() */ |
23c570a67 resource: ability... |
562 |
avail.start = ALIGN(tmp.start, constraint->align); |
a1862e310 resources: handle... |
563 |
avail.end = tmp.end; |
5edb93b89 resource: Add res... |
564 |
avail.flags = new->flags & ~IORESOURCE_UNSET; |
a1862e310 resources: handle... |
565 |
if (avail.start >= tmp.start) { |
5edb93b89 resource: Add res... |
566 |
alloc.flags = avail.flags; |
23c570a67 resource: ability... |
567 568 |
alloc.start = constraint->alignf(constraint->alignf_data, &avail, size, constraint->align); |
a1862e310 resources: handle... |
569 570 571 572 573 574 |
alloc.end = alloc.start + size - 1; if (resource_contains(&avail, &alloc)) { new->start = alloc.start; new->end = alloc.end; return 0; } |
1da177e4c Linux-2.6.12-rc2 |
575 |
} |
47ea91b40 Resource: fix wro... |
576 577 |
next: if (!this || this->end == root->end) |
1da177e4c Linux-2.6.12-rc2 |
578 |
break; |
47ea91b40 Resource: fix wro... |
579 |
|
23c570a67 resource: ability... |
580 581 |
if (this != old) tmp.start = this->end + 1; |
1da177e4c Linux-2.6.12-rc2 |
582 583 584 585 |
this = this->sibling; } return -EBUSY; } |
23c570a67 resource: ability... |
586 587 588 589 590 591 592 593 594 |
/* * 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 [PATCH] kernel-do... |
595 |
/** |
23c570a67 resource: ability... |
596 597 598 599 600 601 602 603 604 |
* 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 kernel/resource.c... |
605 |
static int reallocate_resource(struct resource *root, struct resource *old, |
23c570a67 resource: ability... |
606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 |
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 [PATCH] kernel-do... |
647 648 649 |
* @root: root resource descriptor * @new: resource descriptor desired by caller * @size: requested resource region size |
ee5e5683d kernel/resource.c... |
650 651 |
* @min: minimum boundary to allocate * @max: maximum boundary to allocate |
e1ca66d1b [PATCH] kernel-do... |
652 653 654 |
* @align: alignment requested, in bytes * @alignf: alignment function, optional, called if not NULL * @alignf_data: arbitrary data to pass to the @alignf function |
1da177e4c Linux-2.6.12-rc2 |
655 656 |
*/ int allocate_resource(struct resource *root, struct resource *new, |
d75fc8bbc [PATCH] 64bit res... |
657 658 |
resource_size_t size, resource_size_t min, resource_size_t max, resource_size_t align, |
b26b2d494 resource/PCI: ali... |
659 |
resource_size_t (*alignf)(void *, |
3b7a17fcd resource/PCI: mar... |
660 |
const struct resource *, |
b26b2d494 resource/PCI: ali... |
661 662 |
resource_size_t, resource_size_t), |
1da177e4c Linux-2.6.12-rc2 |
663 664 665 |
void *alignf_data) { int err; |
23c570a67 resource: ability... |
666 |
struct resource_constraint constraint; |
1da177e4c Linux-2.6.12-rc2 |
667 |
|
a9cea0174 resources: add a ... |
668 669 |
if (!alignf) alignf = simple_align_resource; |
23c570a67 resource: ability... |
670 671 672 673 674 675 676 677 678 679 680 |
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 Linux-2.6.12-rc2 |
681 |
write_lock(&resource_lock); |
23c570a67 resource: ability... |
682 |
err = find_resource(root, new, size, &constraint); |
1da177e4c Linux-2.6.12-rc2 |
683 684 685 686 687 688 689 |
if (err >= 0 && __request_resource(root, new)) err = -EBUSY; write_unlock(&resource_lock); return err; } EXPORT_SYMBOL(allocate_resource); |
1c388919d resources: Add lo... |
690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 |
/** * 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 Resource handling... |
710 711 712 |
/* * Insert a resource into the resource tree. If successful, return NULL, * otherwise return the conflicting resource (compare to __request_resource()) |
1da177e4c Linux-2.6.12-rc2 |
713 |
*/ |
bef69ea0d Resource handling... |
714 |
static struct resource * __insert_resource(struct resource *parent, struct resource *new) |
1da177e4c Linux-2.6.12-rc2 |
715 |
{ |
1da177e4c Linux-2.6.12-rc2 |
716 |
struct resource *first, *next; |
d33b6fba2 Resources: insert... |
717 |
for (;; parent = first) { |
d33b6fba2 Resources: insert... |
718 719 |
first = __request_resource(parent, new); if (!first) |
bef69ea0d Resource handling... |
720 |
return first; |
d33b6fba2 Resources: insert... |
721 |
|
d33b6fba2 Resources: insert... |
722 |
if (first == parent) |
bef69ea0d Resource handling... |
723 |
return first; |
5de1cb2d0 kernel/resource.c... |
724 725 |
if (WARN_ON(first == new)) /* duplicated insertion */ return first; |
d33b6fba2 Resources: insert... |
726 727 728 729 730 |
if ((first->start > new->start) || (first->end < new->end)) break; if ((first->start == new->start) && (first->end == new->end)) break; |
1da177e4c Linux-2.6.12-rc2 |
731 732 733 734 735 |
} for (next = first; ; next = next->sibling) { /* Partial overlap? Bad, and unfixable */ if (next->start < new->start || next->end > new->end) |
bef69ea0d Resource handling... |
736 |
return next; |
1da177e4c Linux-2.6.12-rc2 |
737 738 739 740 741 |
if (!next->sibling) break; if (next->sibling->start > new->end) break; } |
1da177e4c Linux-2.6.12-rc2 |
742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 |
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 Resource handling... |
758 759 |
return NULL; } |
1da177e4c Linux-2.6.12-rc2 |
760 |
|
bef69ea0d Resource handling... |
761 |
/** |
66f1207bc resources: add in... |
762 |
* insert_resource_conflict - Inserts resource in the resource tree |
bef69ea0d Resource handling... |
763 764 765 |
* @parent: parent of the new resource * @new: new resource to insert * |
66f1207bc resources: add in... |
766 |
* Returns 0 on success, conflict resource if the resource can't be inserted. |
bef69ea0d Resource handling... |
767 |
* |
66f1207bc resources: add in... |
768 |
* This function is equivalent to request_resource_conflict when no conflict |
bef69ea0d Resource handling... |
769 770 771 772 773 |
* 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 resources: add in... |
774 |
struct resource *insert_resource_conflict(struct resource *parent, struct resource *new) |
bef69ea0d Resource handling... |
775 776 777 778 779 780 |
{ struct resource *conflict; write_lock(&resource_lock); conflict = __insert_resource(parent, new); write_unlock(&resource_lock); |
66f1207bc resources: add in... |
781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 |
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 Resource handling... |
796 797 798 799 800 |
return conflict ? -EBUSY : 0; } /** * insert_resource_expand_to_fit - Insert a resource into the resource tree |
6781f4ae3 kernel/resource.c... |
801 |
* @root: root resource descriptor |
bef69ea0d Resource handling... |
802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 |
* @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 Linux-2.6.12-rc2 |
831 |
write_unlock(&resource_lock); |
1da177e4c Linux-2.6.12-rc2 |
832 |
} |
ae8e3a915 resource: add __a... |
833 834 |
static int __adjust_resource(struct resource *res, resource_size_t start, resource_size_t size) |
1da177e4c Linux-2.6.12-rc2 |
835 836 |
{ struct resource *tmp, *parent = res->parent; |
d75fc8bbc [PATCH] 64bit res... |
837 |
resource_size_t end = start + size - 1; |
1da177e4c Linux-2.6.12-rc2 |
838 |
int result = -EBUSY; |
82ec90eac resources: allow ... |
839 840 |
if (!parent) goto skip; |
1da177e4c Linux-2.6.12-rc2 |
841 842 |
if ((start < parent->start) || (end > parent->end)) goto out; |
1da177e4c Linux-2.6.12-rc2 |
843 844 845 846 847 848 849 850 851 852 |
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 resources: allow ... |
853 854 855 856 |
skip: for (tmp = res->child; tmp; tmp = tmp->sibling) if ((tmp->start < start) || (tmp->end > end)) goto out; |
1da177e4c Linux-2.6.12-rc2 |
857 858 859 860 861 |
res->start = start; res->end = end; result = 0; out: |
ae8e3a915 resource: add __a... |
862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 |
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 Linux-2.6.12-rc2 |
882 883 884 |
write_unlock(&resource_lock); return result; } |
241057486 kernel/resource.c... |
885 |
EXPORT_SYMBOL(adjust_resource); |
1da177e4c Linux-2.6.12-rc2 |
886 |
|
268364a0f IO resources: add... |
887 888 889 890 891 892 |
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 mem hotunplug: fi... |
893 |
struct resource *res = alloc_resource(GFP_ATOMIC); |
4965f5667 kernel/resource.c... |
894 |
struct resource *next_res = NULL; |
268364a0f IO resources: add... |
895 896 897 898 899 900 901 902 |
if (!res) return; res->name = name; res->start = start; res->end = end; res->flags = IORESOURCE_BUSY; |
4965f5667 kernel/resource.c... |
903 |
while (1) { |
268364a0f IO resources: add... |
904 |
|
4965f5667 kernel/resource.c... |
905 906 907 908 909 910 911 912 |
conflict = __request_resource(parent, res); if (!conflict) { if (!next_res) break; res = next_res; next_res = NULL; continue; } |
268364a0f IO resources: add... |
913 |
|
4965f5667 kernel/resource.c... |
914 915 916 |
/* conflict covered whole area */ if (conflict->start <= res->start && conflict->end >= res->end) { |
ebff7d8f2 mem hotunplug: fi... |
917 |
free_resource(res); |
4965f5667 kernel/resource.c... |
918 919 920 921 922 923 924 925 926 |
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 mem hotunplug: fi... |
927 |
next_res = alloc_resource(GFP_ATOMIC); |
4965f5667 kernel/resource.c... |
928 |
if (!next_res) { |
ebff7d8f2 mem hotunplug: fi... |
929 |
free_resource(res); |
4965f5667 kernel/resource.c... |
930 931 932 933 934 935 936 937 938 939 940 |
break; } next_res->name = name; next_res->start = conflict->end + 1; next_res->end = end; next_res->flags = IORESOURCE_BUSY; } } else { res->start = conflict->end + 1; } } |
268364a0f IO resources: add... |
941 942 |
} |
bea921124 kernel/resource: ... |
943 |
void __init reserve_region_with_split(struct resource *root, |
268364a0f IO resources: add... |
944 945 946 |
resource_size_t start, resource_size_t end, const char *name) { |
65fed8f6f resource: make su... |
947 |
int abort = 0; |
268364a0f IO resources: add... |
948 |
write_lock(&resource_lock); |
65fed8f6f resource: make su... |
949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 |
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 IO resources: add... |
970 971 |
write_unlock(&resource_lock); } |
884525655 PCI: clean up res... |
972 973 974 975 976 977 978 979 980 981 |
/** * 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 resource: add res... |
982 |
return resource_size(res); |
884525655 PCI: clean up res... |
983 984 985 986 987 988 |
case IORESOURCE_STARTALIGN: return res->start; default: return 0; } } |
1da177e4c Linux-2.6.12-rc2 |
989 990 991 992 993 994 |
/* * This is compatibility stuff for IO resources. * * Note how this, unlike the above, knows about * the IO flag meanings (busy etc). * |
e1ca66d1b [PATCH] kernel-do... |
995 |
* request_region creates a new busy region. |
1da177e4c Linux-2.6.12-rc2 |
996 |
* |
e1ca66d1b [PATCH] kernel-do... |
997 998 |
* release_region releases a matching busy region. */ |
8b6d043b7 resource: shared ... |
999 |
static DECLARE_WAIT_QUEUE_HEAD(muxed_resource_wait); |
e1ca66d1b [PATCH] kernel-do... |
1000 1001 1002 1003 1004 1005 |
/** * __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 resources: fix pa... |
1006 |
* @flags: IO resource flags |
1da177e4c Linux-2.6.12-rc2 |
1007 |
*/ |
d75fc8bbc [PATCH] 64bit res... |
1008 1009 |
struct resource * __request_region(struct resource *parent, resource_size_t start, resource_size_t n, |
e8de1481f resource: allow M... |
1010 |
const char *name, int flags) |
1da177e4c Linux-2.6.12-rc2 |
1011 |
{ |
8b6d043b7 resource: shared ... |
1012 |
DECLARE_WAITQUEUE(wait, current); |
ebff7d8f2 mem hotunplug: fi... |
1013 |
struct resource *res = alloc_resource(GFP_KERNEL); |
1da177e4c Linux-2.6.12-rc2 |
1014 |
|
c26ec88ea resources: tidy _... |
1015 1016 1017 1018 1019 1020 |
if (!res) return NULL; res->name = name; res->start = start; res->end = start + n - 1; |
6404e88e8 resources: Set ty... |
1021 1022 |
res->flags = resource_type(parent); res->flags |= IORESOURCE_BUSY | flags; |
c26ec88ea resources: tidy _... |
1023 1024 1025 1026 1027 1028 1029 1030 |
write_lock(&resource_lock); for (;;) { struct resource *conflict; conflict = __request_resource(parent, res); if (!conflict) |
1da177e4c Linux-2.6.12-rc2 |
1031 |
break; |
c26ec88ea resources: tidy _... |
1032 1033 1034 1035 |
if (conflict != parent) { parent = conflict; if (!(conflict->flags & IORESOURCE_BUSY)) continue; |
1da177e4c Linux-2.6.12-rc2 |
1036 |
} |
8b6d043b7 resource: shared ... |
1037 1038 1039 1040 1041 1042 1043 1044 1045 |
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 resources: tidy _... |
1046 |
/* Uhhuh, that didn't work out.. */ |
ebff7d8f2 mem hotunplug: fi... |
1047 |
free_resource(res); |
c26ec88ea resources: tidy _... |
1048 1049 |
res = NULL; break; |
1da177e4c Linux-2.6.12-rc2 |
1050 |
} |
c26ec88ea resources: tidy _... |
1051 |
write_unlock(&resource_lock); |
1da177e4c Linux-2.6.12-rc2 |
1052 1053 |
return res; } |
1da177e4c Linux-2.6.12-rc2 |
1054 |
EXPORT_SYMBOL(__request_region); |
e1ca66d1b [PATCH] kernel-do... |
1055 |
/** |
e1ca66d1b [PATCH] kernel-do... |
1056 1057 1058 1059 1060 1061 1062 |
* __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 [PATCH] 64bit res... |
1063 1064 |
void __release_region(struct resource *parent, resource_size_t start, resource_size_t n) |
1da177e4c Linux-2.6.12-rc2 |
1065 1066 |
{ struct resource **p; |
d75fc8bbc [PATCH] 64bit res... |
1067 |
resource_size_t end; |
1da177e4c Linux-2.6.12-rc2 |
1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 |
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 resource: shared ... |
1088 1089 |
if (res->flags & IORESOURCE_MUXED) wake_up(&muxed_resource_wait); |
ebff7d8f2 mem hotunplug: fi... |
1090 |
free_resource(res); |
1da177e4c Linux-2.6.12-rc2 |
1091 1092 1093 1094 1095 1096 |
return; } p = &res->sibling; } write_unlock(&resource_lock); |
685143ac1 [PATCH] 64bit res... |
1097 1098 1099 1100 |
printk(KERN_WARNING "Trying to free nonexistent resource " "<%016llx-%016llx> ", (unsigned long long)start, (unsigned long long)end); |
1da177e4c Linux-2.6.12-rc2 |
1101 |
} |
1da177e4c Linux-2.6.12-rc2 |
1102 |
EXPORT_SYMBOL(__release_region); |
825f787bb resource: add rel... |
1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 |
#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 mem hotunplug: fi... |
1136 1137 |
/* The alloc_resource() result gets checked later */ new_res = alloc_resource(GFP_KERNEL); |
825f787bb resource: add rel... |
1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 |
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 mem hotunplug: fi... |
1164 |
free_resource(res); |
825f787bb resource: add rel... |
1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 |
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; 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 mem hotunplug: fi... |
1200 |
free_resource(new_res); |
825f787bb resource: add rel... |
1201 1202 1203 |
return ret; } #endif /* CONFIG_MEMORY_HOTREMOVE */ |
1da177e4c Linux-2.6.12-rc2 |
1204 |
/* |
9ac7849e3 devres: device re... |
1205 1206 |
* Managed region resource */ |
8d38821cb resources: Add de... |
1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 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 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 |
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 devres: device re... |
1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 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 |
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 resource: allow M... |
1313 |
res = __request_region(parent, start, n, name, 0); |
9ac7849e3 devres: device re... |
1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 |
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 Linux-2.6.12-rc2 |
1335 1336 1337 1338 1339 1340 1341 1342 1343 |
* 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 kernel/resource.c... |
1344 |
unsigned int io_start, io_num; |
1da177e4c Linux-2.6.12-rc2 |
1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 |
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 IO resources, x86... |
1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 |
/* * 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 resources: fix x8... |
1387 1388 |
if (PFN_DOWN(p->start) <= PFN_DOWN(addr) && PFN_DOWN(p->end) >= PFN_DOWN(addr + size - 1)) |
379daf629 IO resources, x86... |
1389 |
continue; |
3ac52669c resources: skip s... |
1390 1391 1392 1393 1394 1395 1396 1397 |
/* * 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 resources: Clarif... |
1398 1399 |
printk(KERN_WARNING "resource sanity check: requesting [mem %#010llx-%#010llx], which spans more than %s %pR ", |
13eb83754 IO resources, x86... |
1400 1401 |
(unsigned long long)addr, (unsigned long long)(addr + size - 1), |
e4c729664 resources: Clarif... |
1402 |
p->name, p); |
379daf629 IO resources, x86... |
1403 1404 1405 1406 1407 1408 1409 |
err = -1; break; } read_unlock(&resource_lock); return err; } |
e8de1481f resource: allow M... |
1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 |
#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; } |
90e978206 resources: Move s... |
1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 |
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 resource: allow M... |
1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 |
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); |