diff options
| author | Vivek Goyal <vgoyal@redhat.com> | 2014-08-08 17:25:50 -0400 |
|---|---|---|
| committer | Linus Torvalds <torvalds@linux-foundation.org> | 2014-08-08 18:57:32 -0400 |
| commit | 8c86e70acead629aacb4afcd818add66bf6844d9 (patch) | |
| tree | fbaa4e677b76cb8bfca7b21e9626a0607ca63c09 /kernel | |
| parent | 255aedd90e3e804fb52e1a71636a3b22cf12f81b (diff) | |
resource: provide new functions to walk through resources
I have added two more functions to walk through resources.
Currently walk_system_ram_range() deals with pfn and /proc/iomem can
contain partial pages. By dealing in pfn, callback function loses the
info that last page of a memory range is a partial page and not the full
page. So I implemented walk_system_ram_res() which returns u64 values to
callback functions and now it properly return start and end address.
walk_system_ram_range() uses find_next_system_ram() to find the next ram
resource. This in turn only travels through siblings of top level child
and does not travers through all the nodes of the resoruce tree. I also
need another function where I can walk through all the resources, for
example figure out where "GART" aperture is. Figure out where ACPI memory
is.
So I wrote another function walk_iomem_res() which walks through all
/proc/iomem resources and returns matches as asked by caller. Caller can
specify "name" of resource, start and end and flags.
Got rid of find_next_system_ram_res() and instead implemented more generic
find_next_iomem_res() which can be used to traverse top level children
only based on an argument.
Signed-off-by: Vivek Goyal <vgoyal@redhat.com>
Cc: Yinghai Lu <yinghai@kernel.org>
Cc: Borislav Petkov <bp@suse.de>
Cc: Michael Kerrisk <mtk.manpages@gmail.com>
Cc: Eric Biederman <ebiederm@xmission.com>
Cc: H. Peter Anvin <hpa@zytor.com>
Cc: Matthew Garrett <mjg59@srcf.ucam.org>
Cc: Greg Kroah-Hartman <greg@kroah.com>
Cc: Dave Young <dyoung@redhat.com>
Cc: WANG Chao <chaowang@redhat.com>
Cc: Baoquan He <bhe@redhat.com>
Cc: Andy Lutomirski <luto@amacapital.net>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
Diffstat (limited to 'kernel')
| -rw-r--r-- | kernel/resource.c | 101 |
1 files changed, 92 insertions, 9 deletions
diff --git a/kernel/resource.c b/kernel/resource.c index 3c2237ac32db..da14b8d09296 100644 --- a/kernel/resource.c +++ b/kernel/resource.c | |||
| @@ -59,10 +59,12 @@ static DEFINE_RWLOCK(resource_lock); | |||
| 59 | static struct resource *bootmem_resource_free; | 59 | static struct resource *bootmem_resource_free; |
| 60 | static DEFINE_SPINLOCK(bootmem_resource_lock); | 60 | static DEFINE_SPINLOCK(bootmem_resource_lock); |
| 61 | 61 | ||
| 62 | static void *r_next(struct seq_file *m, void *v, loff_t *pos) | 62 | static struct resource *next_resource(struct resource *p, bool sibling_only) |
| 63 | { | 63 | { |
| 64 | struct resource *p = v; | 64 | /* Caller wants to traverse through siblings only */ |
| 65 | (*pos)++; | 65 | if (sibling_only) |
| 66 | return p->sibling; | ||
| 67 | |||
| 66 | if (p->child) | 68 | if (p->child) |
| 67 | return p->child; | 69 | return p->child; |
| 68 | while (!p->sibling && p->parent) | 70 | while (!p->sibling && p->parent) |
| @@ -70,6 +72,13 @@ static void *r_next(struct seq_file *m, void *v, loff_t *pos) | |||
| 70 | return p->sibling; | 72 | return p->sibling; |
| 71 | } | 73 | } |
| 72 | 74 | ||
| 75 | static void *r_next(struct seq_file *m, void *v, loff_t *pos) | ||
| 76 | { | ||
| 77 | struct resource *p = v; | ||
| 78 | (*pos)++; | ||
| 79 | return (void *)next_resource(p, false); | ||
| 80 | } | ||
| 81 | |||
| 73 | #ifdef CONFIG_PROC_FS | 82 | #ifdef CONFIG_PROC_FS |
| 74 | 83 | ||
| 75 | enum { MAX_IORES_LEVEL = 5 }; | 84 | enum { MAX_IORES_LEVEL = 5 }; |
| @@ -322,16 +331,19 @@ int release_resource(struct resource *old) | |||
| 322 | 331 | ||
| 323 | EXPORT_SYMBOL(release_resource); | 332 | EXPORT_SYMBOL(release_resource); |
| 324 | 333 | ||
| 325 | #if !defined(CONFIG_ARCH_HAS_WALK_MEMORY) | ||
| 326 | /* | 334 | /* |
| 327 | * Finds the lowest memory reosurce exists within [res->start.res->end) | 335 | * Finds the lowest iomem reosurce exists with-in [res->start.res->end) |
| 328 | * the caller must specify res->start, res->end, res->flags and "name". | 336 | * the caller must specify res->start, res->end, res->flags and "name". |
| 329 | * If found, returns 0, res is overwritten, if not found, returns -1. | 337 | * If found, returns 0, res is overwritten, if not found, returns -1. |
| 338 | * This walks through whole tree and not just first level children | ||
| 339 | * until and unless first_level_children_only is true. | ||
| 330 | */ | 340 | */ |
| 331 | static int find_next_system_ram(struct resource *res, char *name) | 341 | static int find_next_iomem_res(struct resource *res, char *name, |
| 342 | bool first_level_children_only) | ||
| 332 | { | 343 | { |
| 333 | resource_size_t start, end; | 344 | resource_size_t start, end; |
| 334 | struct resource *p; | 345 | struct resource *p; |
| 346 | bool sibling_only = false; | ||
| 335 | 347 | ||
| 336 | BUG_ON(!res); | 348 | BUG_ON(!res); |
| 337 | 349 | ||
| @@ -340,8 +352,14 @@ static int find_next_system_ram(struct resource *res, char *name) | |||
| 340 | BUG_ON(start >= end); | 352 | BUG_ON(start >= end); |
| 341 | 353 | ||
| 342 | read_lock(&resource_lock); | 354 | read_lock(&resource_lock); |
| 343 | for (p = iomem_resource.child; p ; p = p->sibling) { | 355 | |
| 344 | /* system ram is just marked as IORESOURCE_MEM */ | 356 | if (first_level_children_only) { |
| 357 | p = iomem_resource.child; | ||
| 358 | sibling_only = true; | ||
| 359 | } else | ||
| 360 | p = &iomem_resource; | ||
| 361 | |||
| 362 | while ((p = next_resource(p, sibling_only))) { | ||
| 345 | if (p->flags != res->flags) | 363 | if (p->flags != res->flags) |
| 346 | continue; | 364 | continue; |
| 347 | if (name && strcmp(p->name, name)) | 365 | if (name && strcmp(p->name, name)) |
| @@ -353,6 +371,7 @@ static int find_next_system_ram(struct resource *res, char *name) | |||
| 353 | if ((p->end >= start) && (p->start < end)) | 371 | if ((p->end >= start) && (p->start < end)) |
| 354 | break; | 372 | break; |
| 355 | } | 373 | } |
| 374 | |||
| 356 | read_unlock(&resource_lock); | 375 | read_unlock(&resource_lock); |
| 357 | if (!p) | 376 | if (!p) |
| 358 | return -1; | 377 | return -1; |
| @@ -365,6 +384,70 @@ static int find_next_system_ram(struct resource *res, char *name) | |||
| 365 | } | 384 | } |
| 366 | 385 | ||
| 367 | /* | 386 | /* |
| 387 | * Walks through iomem resources and calls func() with matching resource | ||
| 388 | * ranges. This walks through whole tree and not just first level children. | ||
| 389 | * All the memory ranges which overlap start,end and also match flags and | ||
| 390 | * name are valid candidates. | ||
| 391 | * | ||
| 392 | * @name: name of resource | ||
| 393 | * @flags: resource flags | ||
| 394 | * @start: start addr | ||
| 395 | * @end: end addr | ||
| 396 | */ | ||
| 397 | int walk_iomem_res(char *name, unsigned long flags, u64 start, u64 end, | ||
| 398 | void *arg, int (*func)(u64, u64, void *)) | ||
| 399 | { | ||
| 400 | struct resource res; | ||
| 401 | u64 orig_end; | ||
| 402 | int ret = -1; | ||
| 403 | |||
| 404 | res.start = start; | ||
| 405 | res.end = end; | ||
| 406 | res.flags = flags; | ||
| 407 | orig_end = res.end; | ||
| 408 | while ((res.start < res.end) && | ||
| 409 | (!find_next_iomem_res(&res, name, false))) { | ||
| 410 | ret = (*func)(res.start, res.end, arg); | ||
| 411 | if (ret) | ||
| 412 | break; | ||
| 413 | res.start = res.end + 1; | ||
| 414 | res.end = orig_end; | ||
| 415 | } | ||
| 416 | return ret; | ||
| 417 | } | ||
| 418 | |||
| 419 | /* | ||
| 420 | * This function calls callback against all memory range of "System RAM" | ||
| 421 | * which are marked as IORESOURCE_MEM and IORESOUCE_BUSY. | ||
| 422 | * Now, this function is only for "System RAM". This function deals with | ||
| 423 | * full ranges and not pfn. If resources are not pfn aligned, dealing | ||
| 424 | * with pfn can truncate ranges. | ||
| 425 | */ | ||
| 426 | int walk_system_ram_res(u64 start, u64 end, void *arg, | ||
| 427 | int (*func)(u64, u64, void *)) | ||
| 428 | { | ||
| 429 | struct resource res; | ||
| 430 | u64 orig_end; | ||
| 431 | int ret = -1; | ||
| 432 | |||
| 433 | res.start = start; | ||
| 434 | res.end = end; | ||
| 435 | res.flags = IORESOURCE_MEM | IORESOURCE_BUSY; | ||
| 436 | orig_end = res.end; | ||
| 437 | while ((res.start < res.end) && | ||
| 438 | (!find_next_iomem_res(&res, "System RAM", true))) { | ||
| 439 | ret = (*func)(res.start, res.end, arg); | ||
| 440 | if (ret) | ||
| 441 | break; | ||
| 442 | res.start = res.end + 1; | ||
| 443 | res.end = orig_end; | ||
| 444 | } | ||
| 445 | return ret; | ||
| 446 | } | ||
| 447 | |||
| 448 | #if !defined(CONFIG_ARCH_HAS_WALK_MEMORY) | ||
| 449 | |||
| 450 | /* | ||
| 368 | * This function calls callback against all memory range of "System RAM" | 451 | * This function calls callback against all memory range of "System RAM" |
| 369 | * which are marked as IORESOURCE_MEM and IORESOUCE_BUSY. | 452 | * which are marked as IORESOURCE_MEM and IORESOUCE_BUSY. |
| 370 | * Now, this function is only for "System RAM". | 453 | * Now, this function is only for "System RAM". |
| @@ -382,7 +465,7 @@ int walk_system_ram_range(unsigned long start_pfn, unsigned long nr_pages, | |||
| 382 | res.flags = IORESOURCE_MEM | IORESOURCE_BUSY; | 465 | res.flags = IORESOURCE_MEM | IORESOURCE_BUSY; |
| 383 | orig_end = res.end; | 466 | orig_end = res.end; |
| 384 | while ((res.start < res.end) && | 467 | while ((res.start < res.end) && |
| 385 | (find_next_system_ram(&res, "System RAM") >= 0)) { | 468 | (find_next_iomem_res(&res, "System RAM", true) >= 0)) { |
| 386 | pfn = (res.start + PAGE_SIZE - 1) >> PAGE_SHIFT; | 469 | pfn = (res.start + PAGE_SIZE - 1) >> PAGE_SHIFT; |
| 387 | end_pfn = (res.end + 1) >> PAGE_SHIFT; | 470 | end_pfn = (res.end + 1) >> PAGE_SHIFT; |
| 388 | if (end_pfn > pfn) | 471 | if (end_pfn > pfn) |
