Blame view
lib/genalloc.c
5.1 KB
f14f75b81
|
1 2 3 4 5 6 |
/* * 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. * |
f14f75b81
|
7 8 9 10 11 |
* 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. */ |
5a0e3ad6a
|
12 |
#include <linux/slab.h> |
f14f75b81
|
13 |
#include <linux/module.h> |
243797f59
|
14 |
#include <linux/bitmap.h> |
f14f75b81
|
15 |
#include <linux/genalloc.h> |
f14f75b81
|
16 |
|
a58cbd7c2
|
17 18 |
/** * gen_pool_create - create a new special memory pool |
929f97276
|
19 20 |
* @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 |
a58cbd7c2
|
21 22 23 |
* * Create a new special memory pool that can be used to manage special purpose * memory not managed by the regular kmalloc/kfree interface. |
929f97276
|
24 25 |
*/ struct gen_pool *gen_pool_create(int min_alloc_order, int nid) |
f14f75b81
|
26 |
{ |
929f97276
|
27 |
struct gen_pool *pool; |
f14f75b81
|
28 |
|
929f97276
|
29 30 31 32 33 34 35 |
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; |
f14f75b81
|
36 37 |
} EXPORT_SYMBOL(gen_pool_create); |
a58cbd7c2
|
38 39 |
/** * gen_pool_add - add a new chunk of special memory to the pool |
929f97276
|
40 41 42 43 44 |
* @pool: pool to add new memory chunk to * @addr: starting address of memory chunk to add to pool * @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 |
a58cbd7c2
|
45 46 |
* * Add a new chunk of special memory to the specified pool. |
f14f75b81
|
47 |
*/ |
929f97276
|
48 49 |
int gen_pool_add(struct gen_pool *pool, unsigned long addr, size_t size, int nid) |
f14f75b81
|
50 |
{ |
929f97276
|
51 52 53 54 |
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; |
f14f75b81
|
55 |
|
94f6030ca
|
56 |
chunk = kmalloc_node(nbytes, GFP_KERNEL | __GFP_ZERO, nid); |
929f97276
|
57 58 |
if (unlikely(chunk == NULL)) return -1; |
f14f75b81
|
59 |
|
929f97276
|
60 61 62 |
spin_lock_init(&chunk->lock); chunk->start_addr = addr; chunk->end_addr = addr + size; |
f14f75b81
|
63 |
|
929f97276
|
64 65 66 67 68 |
write_lock(&pool->lock); list_add(&chunk->next_chunk, &pool->chunks); write_unlock(&pool->lock); return 0; |
f14f75b81
|
69 |
} |
929f97276
|
70 |
EXPORT_SYMBOL(gen_pool_add); |
f14f75b81
|
71 |
|
a58cbd7c2
|
72 73 |
/** * gen_pool_destroy - destroy a special memory pool |
322acc96d
|
74 |
* @pool: pool to destroy |
a58cbd7c2
|
75 76 77 |
* * Destroy the specified special memory pool. Verifies that there are no * outstanding allocations. |
322acc96d
|
78 79 80 81 82 83 84 |
*/ 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; |
322acc96d
|
85 86 87 88 89 90 91 92 93 94 95 96 97 98 |
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); |
a58cbd7c2
|
99 100 |
/** * gen_pool_alloc - allocate special memory from the pool |
929f97276
|
101 102 |
* @pool: pool to allocate from * @size: number of bytes to allocate from the pool |
a58cbd7c2
|
103 104 105 |
* * Allocate the requested number of bytes from the specified pool. * Uses a first-fit algorithm. |
f14f75b81
|
106 |
*/ |
929f97276
|
107 |
unsigned long gen_pool_alloc(struct gen_pool *pool, size_t size) |
f14f75b81
|
108 |
{ |
929f97276
|
109 110 111 112 |
struct list_head *_chunk; struct gen_pool_chunk *chunk; unsigned long addr, flags; int order = pool->min_alloc_order; |
243797f59
|
113 |
int nbits, start_bit, end_bit; |
f14f75b81
|
114 |
|
929f97276
|
115 116 |
if (size == 0) return 0; |
f14f75b81
|
117 |
|
929f97276
|
118 119 120 121 122 123 124 |
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; |
929f97276
|
125 126 |
spin_lock_irqsave(&chunk->lock, flags); |
243797f59
|
127 128 129 |
start_bit = bitmap_find_next_zero_area(chunk->bits, end_bit, 0, nbits, 0); if (start_bit >= end_bit) { |
929f97276
|
130 |
spin_unlock_irqrestore(&chunk->lock, flags); |
243797f59
|
131 |
continue; |
f14f75b81
|
132 |
} |
243797f59
|
133 134 135 136 |
addr = chunk->start_addr + ((unsigned long)start_bit << order); bitmap_set(chunk->bits, start_bit, nbits); |
929f97276
|
137 |
spin_unlock_irqrestore(&chunk->lock, flags); |
243797f59
|
138 139 |
read_unlock(&pool->lock); return addr; |
929f97276
|
140 141 142 143 144 |
} read_unlock(&pool->lock); return 0; } EXPORT_SYMBOL(gen_pool_alloc); |
f14f75b81
|
145 |
|
a58cbd7c2
|
146 147 |
/** * gen_pool_free - free allocated special memory back to the pool |
929f97276
|
148 149 150 |
* @pool: pool to free to * @addr: starting address of memory to free back to pool * @size: size in bytes of memory to free |
a58cbd7c2
|
151 152 |
* * Free previously allocated special memory back to the specified pool. |
929f97276
|
153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 |
*/ 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--) |
96c62d51c
|
173 |
__clear_bit(bit++, chunk->bits); |
929f97276
|
174 |
spin_unlock_irqrestore(&chunk->lock, flags); |
f14f75b81
|
175 176 |
break; } |
f14f75b81
|
177 |
} |
929f97276
|
178 179 |
BUG_ON(nbits > 0); read_unlock(&pool->lock); |
f14f75b81
|
180 181 |
} EXPORT_SYMBOL(gen_pool_free); |