2005-06-22 07:15:02 +07:00
|
|
|
/*
|
|
|
|
* Basic general purpose allocator for managing special purpose memory
|
|
|
|
* not managed by the regular kmalloc/kfree interface.
|
|
|
|
* Uses for this includes on-device special memory, uncached memory
|
|
|
|
* etc.
|
|
|
|
*
|
|
|
|
* Copyright 2005 (C) Jes Sorensen <jes@trained-monkey.org>
|
|
|
|
*
|
|
|
|
* This source code is licensed under the GNU General Public License,
|
|
|
|
* Version 2. See the file COPYING for more details.
|
|
|
|
*/
|
|
|
|
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 15:04:11 +07:00
|
|
|
#include <linux/slab.h>
|
2005-06-22 07:15:02 +07:00
|
|
|
#include <linux/module.h>
|
2009-12-16 07:48:31 +07:00
|
|
|
#include <linux/bitmap.h>
|
2005-06-22 07:15:02 +07:00
|
|
|
#include <linux/genalloc.h>
|
|
|
|
|
|
|
|
|
2006-10-02 16:17:01 +07:00
|
|
|
/**
|
|
|
|
* gen_pool_create - create a new special memory pool
|
2006-06-23 16:03:21 +07:00
|
|
|
* @min_alloc_order: log base 2 of number of bytes each bitmap bit represents
|
|
|
|
* @nid: node id of the node the pool structure should be allocated on, or -1
|
2006-10-02 16:17:01 +07:00
|
|
|
*
|
|
|
|
* Create a new special memory pool that can be used to manage special purpose
|
|
|
|
* memory not managed by the regular kmalloc/kfree interface.
|
2006-06-23 16:03:21 +07:00
|
|
|
*/
|
|
|
|
struct gen_pool *gen_pool_create(int min_alloc_order, int nid)
|
2005-06-22 07:15:02 +07:00
|
|
|
{
|
2006-06-23 16:03:21 +07:00
|
|
|
struct gen_pool *pool;
|
2005-06-22 07:15:02 +07:00
|
|
|
|
2006-06-23 16:03:21 +07:00
|
|
|
pool = kmalloc_node(sizeof(struct gen_pool), GFP_KERNEL, nid);
|
|
|
|
if (pool != NULL) {
|
|
|
|
rwlock_init(&pool->lock);
|
|
|
|
INIT_LIST_HEAD(&pool->chunks);
|
|
|
|
pool->min_alloc_order = min_alloc_order;
|
|
|
|
}
|
|
|
|
return pool;
|
2005-06-22 07:15:02 +07:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(gen_pool_create);
|
|
|
|
|
2006-10-02 16:17:01 +07:00
|
|
|
/**
|
2011-05-25 07:13:34 +07:00
|
|
|
* gen_pool_add_virt - add a new chunk of special memory to the pool
|
2006-06-23 16:03:21 +07:00
|
|
|
* @pool: pool to add new memory chunk to
|
2011-05-25 07:13:34 +07:00
|
|
|
* @virt: virtual starting address of memory chunk to add to pool
|
|
|
|
* @phys: physical starting address of memory chunk to add to pool
|
2006-06-23 16:03:21 +07:00
|
|
|
* @size: size in bytes of the memory chunk to add to pool
|
|
|
|
* @nid: node id of the node the chunk structure and bitmap should be
|
|
|
|
* allocated on, or -1
|
2006-10-02 16:17:01 +07:00
|
|
|
*
|
|
|
|
* Add a new chunk of special memory to the specified pool.
|
2011-05-25 07:13:34 +07:00
|
|
|
*
|
|
|
|
* Returns 0 on success or a -ve errno on failure.
|
2005-06-22 07:15:02 +07:00
|
|
|
*/
|
2011-05-25 07:13:34 +07:00
|
|
|
int gen_pool_add_virt(struct gen_pool *pool, unsigned long virt, phys_addr_t phys,
|
|
|
|
size_t size, int nid)
|
2005-06-22 07:15:02 +07:00
|
|
|
{
|
2006-06-23 16:03:21 +07:00
|
|
|
struct gen_pool_chunk *chunk;
|
|
|
|
int nbits = size >> pool->min_alloc_order;
|
|
|
|
int nbytes = sizeof(struct gen_pool_chunk) +
|
|
|
|
(nbits + BITS_PER_BYTE - 1) / BITS_PER_BYTE;
|
2005-06-22 07:15:02 +07:00
|
|
|
|
2007-07-17 18:03:29 +07:00
|
|
|
chunk = kmalloc_node(nbytes, GFP_KERNEL | __GFP_ZERO, nid);
|
2006-06-23 16:03:21 +07:00
|
|
|
if (unlikely(chunk == NULL))
|
2011-05-25 07:13:34 +07:00
|
|
|
return -ENOMEM;
|
2005-06-22 07:15:02 +07:00
|
|
|
|
2006-06-23 16:03:21 +07:00
|
|
|
spin_lock_init(&chunk->lock);
|
2011-05-25 07:13:34 +07:00
|
|
|
chunk->phys_addr = phys;
|
|
|
|
chunk->start_addr = virt;
|
|
|
|
chunk->end_addr = virt + size;
|
2005-06-22 07:15:02 +07:00
|
|
|
|
2006-06-23 16:03:21 +07:00
|
|
|
write_lock(&pool->lock);
|
|
|
|
list_add(&chunk->next_chunk, &pool->chunks);
|
|
|
|
write_unlock(&pool->lock);
|
|
|
|
|
|
|
|
return 0;
|
2005-06-22 07:15:02 +07:00
|
|
|
}
|
2011-05-25 07:13:34 +07:00
|
|
|
EXPORT_SYMBOL(gen_pool_add_virt);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* gen_pool_virt_to_phys - return the physical address of memory
|
|
|
|
* @pool: pool to allocate from
|
|
|
|
* @addr: starting address of memory
|
|
|
|
*
|
|
|
|
* Returns the physical address on success, or -1 on error.
|
|
|
|
*/
|
|
|
|
phys_addr_t gen_pool_virt_to_phys(struct gen_pool *pool, unsigned long addr)
|
|
|
|
{
|
|
|
|
struct list_head *_chunk;
|
|
|
|
struct gen_pool_chunk *chunk;
|
|
|
|
|
|
|
|
read_lock(&pool->lock);
|
|
|
|
list_for_each(_chunk, &pool->chunks) {
|
|
|
|
chunk = list_entry(_chunk, struct gen_pool_chunk, next_chunk);
|
|
|
|
|
|
|
|
if (addr >= chunk->start_addr && addr < chunk->end_addr)
|
|
|
|
return chunk->phys_addr + addr - chunk->start_addr;
|
|
|
|
}
|
|
|
|
read_unlock(&pool->lock);
|
|
|
|
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(gen_pool_virt_to_phys);
|
2005-06-22 07:15:02 +07:00
|
|
|
|
2006-10-02 16:17:01 +07:00
|
|
|
/**
|
|
|
|
* gen_pool_destroy - destroy a special memory pool
|
2006-10-02 16:17:00 +07:00
|
|
|
* @pool: pool to destroy
|
2006-10-02 16:17:01 +07:00
|
|
|
*
|
|
|
|
* Destroy the specified special memory pool. Verifies that there are no
|
|
|
|
* outstanding allocations.
|
2006-10-02 16:17:00 +07:00
|
|
|
*/
|
|
|
|
void gen_pool_destroy(struct gen_pool *pool)
|
|
|
|
{
|
|
|
|
struct list_head *_chunk, *_next_chunk;
|
|
|
|
struct gen_pool_chunk *chunk;
|
|
|
|
int order = pool->min_alloc_order;
|
|
|
|
int bit, end_bit;
|
|
|
|
|
|
|
|
|
|
|
|
list_for_each_safe(_chunk, _next_chunk, &pool->chunks) {
|
|
|
|
chunk = list_entry(_chunk, struct gen_pool_chunk, next_chunk);
|
|
|
|
list_del(&chunk->next_chunk);
|
|
|
|
|
|
|
|
end_bit = (chunk->end_addr - chunk->start_addr) >> order;
|
|
|
|
bit = find_next_bit(chunk->bits, end_bit, 0);
|
|
|
|
BUG_ON(bit < end_bit);
|
|
|
|
|
|
|
|
kfree(chunk);
|
|
|
|
}
|
|
|
|
kfree(pool);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(gen_pool_destroy);
|
|
|
|
|
2006-10-02 16:17:01 +07:00
|
|
|
/**
|
|
|
|
* gen_pool_alloc - allocate special memory from the pool
|
2006-06-23 16:03:21 +07:00
|
|
|
* @pool: pool to allocate from
|
|
|
|
* @size: number of bytes to allocate from the pool
|
2006-10-02 16:17:01 +07:00
|
|
|
*
|
|
|
|
* Allocate the requested number of bytes from the specified pool.
|
|
|
|
* Uses a first-fit algorithm.
|
2005-06-22 07:15:02 +07:00
|
|
|
*/
|
2006-06-23 16:03:21 +07:00
|
|
|
unsigned long gen_pool_alloc(struct gen_pool *pool, size_t size)
|
2005-06-22 07:15:02 +07:00
|
|
|
{
|
2006-06-23 16:03:21 +07:00
|
|
|
struct list_head *_chunk;
|
|
|
|
struct gen_pool_chunk *chunk;
|
|
|
|
unsigned long addr, flags;
|
|
|
|
int order = pool->min_alloc_order;
|
2009-12-16 07:48:31 +07:00
|
|
|
int nbits, start_bit, end_bit;
|
2005-06-22 07:15:02 +07:00
|
|
|
|
2006-06-23 16:03:21 +07:00
|
|
|
if (size == 0)
|
|
|
|
return 0;
|
2005-06-22 07:15:02 +07:00
|
|
|
|
2006-06-23 16:03:21 +07:00
|
|
|
nbits = (size + (1UL << order) - 1) >> order;
|
|
|
|
|
|
|
|
read_lock(&pool->lock);
|
|
|
|
list_for_each(_chunk, &pool->chunks) {
|
|
|
|
chunk = list_entry(_chunk, struct gen_pool_chunk, next_chunk);
|
|
|
|
|
|
|
|
end_bit = (chunk->end_addr - chunk->start_addr) >> order;
|
|
|
|
|
|
|
|
spin_lock_irqsave(&chunk->lock, flags);
|
2009-12-16 07:48:31 +07:00
|
|
|
start_bit = bitmap_find_next_zero_area(chunk->bits, end_bit, 0,
|
|
|
|
nbits, 0);
|
|
|
|
if (start_bit >= end_bit) {
|
2006-06-23 16:03:21 +07:00
|
|
|
spin_unlock_irqrestore(&chunk->lock, flags);
|
2009-12-16 07:48:31 +07:00
|
|
|
continue;
|
2005-06-22 07:15:02 +07:00
|
|
|
}
|
2009-12-16 07:48:31 +07:00
|
|
|
|
|
|
|
addr = chunk->start_addr + ((unsigned long)start_bit << order);
|
|
|
|
|
|
|
|
bitmap_set(chunk->bits, start_bit, nbits);
|
2006-06-23 16:03:21 +07:00
|
|
|
spin_unlock_irqrestore(&chunk->lock, flags);
|
2009-12-16 07:48:31 +07:00
|
|
|
read_unlock(&pool->lock);
|
|
|
|
return addr;
|
2006-06-23 16:03:21 +07:00
|
|
|
}
|
|
|
|
read_unlock(&pool->lock);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(gen_pool_alloc);
|
2005-06-22 07:15:02 +07:00
|
|
|
|
2006-10-02 16:17:01 +07:00
|
|
|
/**
|
|
|
|
* gen_pool_free - free allocated special memory back to the pool
|
2006-06-23 16:03:21 +07:00
|
|
|
* @pool: pool to free to
|
|
|
|
* @addr: starting address of memory to free back to pool
|
|
|
|
* @size: size in bytes of memory to free
|
2006-10-02 16:17:01 +07:00
|
|
|
*
|
|
|
|
* Free previously allocated special memory back to the specified pool.
|
2006-06-23 16:03:21 +07:00
|
|
|
*/
|
|
|
|
void gen_pool_free(struct gen_pool *pool, unsigned long addr, size_t size)
|
|
|
|
{
|
|
|
|
struct list_head *_chunk;
|
|
|
|
struct gen_pool_chunk *chunk;
|
|
|
|
unsigned long flags;
|
|
|
|
int order = pool->min_alloc_order;
|
|
|
|
int bit, nbits;
|
|
|
|
|
|
|
|
nbits = (size + (1UL << order) - 1) >> order;
|
|
|
|
|
|
|
|
read_lock(&pool->lock);
|
|
|
|
list_for_each(_chunk, &pool->chunks) {
|
|
|
|
chunk = list_entry(_chunk, struct gen_pool_chunk, next_chunk);
|
|
|
|
|
|
|
|
if (addr >= chunk->start_addr && addr < chunk->end_addr) {
|
|
|
|
BUG_ON(addr + size > chunk->end_addr);
|
|
|
|
spin_lock_irqsave(&chunk->lock, flags);
|
|
|
|
bit = (addr - chunk->start_addr) >> order;
|
|
|
|
while (nbits--)
|
2007-02-21 04:58:12 +07:00
|
|
|
__clear_bit(bit++, chunk->bits);
|
2006-06-23 16:03:21 +07:00
|
|
|
spin_unlock_irqrestore(&chunk->lock, flags);
|
2005-06-22 07:15:02 +07:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2006-06-23 16:03:21 +07:00
|
|
|
BUG_ON(nbits > 0);
|
|
|
|
read_unlock(&pool->lock);
|
2005-06-22 07:15:02 +07:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(gen_pool_free);
|