Blame view
mm/mempool.c
15.5 KB
b24413180 License cleanup: ... |
1 |
// SPDX-License-Identifier: GPL-2.0 |
1da177e4c Linux-2.6.12-rc2 |
2 3 4 5 6 7 8 9 |
/* * linux/mm/mempool.c * * memory buffer pool support. Such pools are mostly used * for guaranteed, deadlock-free memory allocations during * extreme VM load. * * started by Ingo Molnar, Copyright (C) 2001 |
bdfedb76f mm, mempool: pois... |
10 |
* debugging by David Rientjes, Copyright (C) 2015 |
1da177e4c Linux-2.6.12-rc2 |
11 12 13 14 |
*/ #include <linux/mm.h> #include <linux/slab.h> |
bdfedb76f mm, mempool: pois... |
15 |
#include <linux/highmem.h> |
923936157 mm/mempool.c: kas... |
16 |
#include <linux/kasan.h> |
174119628 mm/mempool.c: upd... |
17 |
#include <linux/kmemleak.h> |
b95f1b31b mm: Map most file... |
18 |
#include <linux/export.h> |
1da177e4c Linux-2.6.12-rc2 |
19 20 21 |
#include <linux/mempool.h> #include <linux/blkdev.h> #include <linux/writeback.h> |
e244c9e66 mm, mempool: disa... |
22 |
#include "slab.h" |
1da177e4c Linux-2.6.12-rc2 |
23 |
|
bdfedb76f mm, mempool: pois... |
24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 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 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 |
#if defined(CONFIG_DEBUG_SLAB) || defined(CONFIG_SLUB_DEBUG_ON) static void poison_error(mempool_t *pool, void *element, size_t size, size_t byte) { const int nr = pool->curr_nr; const int start = max_t(int, byte - (BITS_PER_LONG / 8), 0); const int end = min_t(int, byte + (BITS_PER_LONG / 8), size); int i; pr_err("BUG: mempool element poison mismatch "); pr_err("Mempool %p size %zu ", pool, size); pr_err(" nr=%d @ %p: %s0x", nr, element, start > 0 ? "... " : ""); for (i = start; i < end; i++) pr_cont("%x ", *(u8 *)(element + i)); pr_cont("%s ", end < size ? "..." : ""); dump_stack(); } static void __check_element(mempool_t *pool, void *element, size_t size) { u8 *obj = element; size_t i; for (i = 0; i < size; i++) { u8 exp = (i < size - 1) ? POISON_FREE : POISON_END; if (obj[i] != exp) { poison_error(pool, element, size, i); return; } } memset(obj, POISON_INUSE, size); } static void check_element(mempool_t *pool, void *element) { /* Mempools backed by slab allocator */ if (pool->free == mempool_free_slab || pool->free == mempool_kfree) __check_element(pool, element, ksize(element)); /* Mempools backed by page allocator */ if (pool->free == mempool_free_pages) { int order = (int)(long)pool->pool_data; void *addr = kmap_atomic((struct page *)element); __check_element(pool, addr, 1UL << (PAGE_SHIFT + order)); kunmap_atomic(addr); } } static void __poison_element(void *element, size_t size) { u8 *obj = element; memset(obj, POISON_FREE, size - 1); obj[size - 1] = POISON_END; } static void poison_element(mempool_t *pool, void *element) { /* Mempools backed by slab allocator */ if (pool->alloc == mempool_alloc_slab || pool->alloc == mempool_kmalloc) __poison_element(element, ksize(element)); /* Mempools backed by page allocator */ if (pool->alloc == mempool_alloc_pages) { int order = (int)(long)pool->pool_data; void *addr = kmap_atomic((struct page *)element); __poison_element(addr, 1UL << (PAGE_SHIFT + order)); kunmap_atomic(addr); } } #else /* CONFIG_DEBUG_SLAB || CONFIG_SLUB_DEBUG_ON */ static inline void check_element(mempool_t *pool, void *element) { } static inline void poison_element(mempool_t *pool, void *element) { } #endif /* CONFIG_DEBUG_SLAB || CONFIG_SLUB_DEBUG_ON */ |
6860f6340 kasan: detect inv... |
108 |
static __always_inline void kasan_poison_element(mempool_t *pool, void *element) |
923936157 mm/mempool.c: kas... |
109 |
{ |
9b75a867c mm: mempool: kasa... |
110 |
if (pool->alloc == mempool_alloc_slab || pool->alloc == mempool_kmalloc) |
6860f6340 kasan: detect inv... |
111 |
kasan_poison_kfree(element, _RET_IP_); |
923936157 mm/mempool.c: kas... |
112 113 114 |
if (pool->alloc == mempool_alloc_pages) kasan_free_pages(element, (unsigned long)pool->pool_data); } |
8cded8668 mm/mempool.c: rem... |
115 |
static void kasan_unpoison_element(mempool_t *pool, void *element) |
923936157 mm/mempool.c: kas... |
116 |
{ |
9b75a867c mm: mempool: kasa... |
117 118 |
if (pool->alloc == mempool_alloc_slab || pool->alloc == mempool_kmalloc) kasan_unpoison_slab(element); |
923936157 mm/mempool.c: kas... |
119 120 121 |
if (pool->alloc == mempool_alloc_pages) kasan_alloc_pages(element, (unsigned long)pool->pool_data); } |
6860f6340 kasan: detect inv... |
122 |
static __always_inline void add_element(mempool_t *pool, void *element) |
1da177e4c Linux-2.6.12-rc2 |
123 124 |
{ BUG_ON(pool->curr_nr >= pool->min_nr); |
bdfedb76f mm, mempool: pois... |
125 |
poison_element(pool, element); |
923936157 mm/mempool.c: kas... |
126 |
kasan_poison_element(pool, element); |
1da177e4c Linux-2.6.12-rc2 |
127 128 |
pool->elements[pool->curr_nr++] = element; } |
8cded8668 mm/mempool.c: rem... |
129 |
static void *remove_element(mempool_t *pool) |
1da177e4c Linux-2.6.12-rc2 |
130 |
{ |
bdfedb76f mm, mempool: pois... |
131 132 133 |
void *element = pool->elements[--pool->curr_nr]; BUG_ON(pool->curr_nr < 0); |
8cded8668 mm/mempool.c: rem... |
134 |
kasan_unpoison_element(pool, element); |
764013103 mm/mempool: avoid... |
135 |
check_element(pool, element); |
bdfedb76f mm, mempool: pois... |
136 |
return element; |
1da177e4c Linux-2.6.12-rc2 |
137 |
} |
0565d3177 mempool: drop unn... |
138 |
/** |
c1a67fefd mempool: Add memp... |
139 140 141 142 143 144 145 146 147 148 149 150 151 |
* mempool_exit - exit a mempool initialized with mempool_init() * @pool: pointer to the memory pool which was initialized with * mempool_init(). * * Free all reserved elements in @pool and @pool itself. This function * only sleeps if the free_fn() function sleeps. * * May be called on a zeroed but uninitialized mempool (i.e. allocated with * kzalloc()). */ void mempool_exit(mempool_t *pool) { while (pool->curr_nr) { |
8cded8668 mm/mempool.c: rem... |
152 |
void *element = remove_element(pool); |
c1a67fefd mempool: Add memp... |
153 154 155 156 157 158 159 160 |
pool->free(element, pool->pool_data); } kfree(pool->elements); pool->elements = NULL; } EXPORT_SYMBOL(mempool_exit); /** |
0565d3177 mempool: drop unn... |
161 162 163 164 165 166 167 168 |
* mempool_destroy - deallocate a memory pool * @pool: pointer to the memory pool which was allocated via * mempool_create(). * * Free all reserved elements in @pool and @pool itself. This function * only sleeps if the free_fn() function sleeps. */ void mempool_destroy(mempool_t *pool) |
1da177e4c Linux-2.6.12-rc2 |
169 |
{ |
4e3ca3e03 mm/mempool: allow... |
170 171 |
if (unlikely(!pool)) return; |
c1a67fefd mempool: Add memp... |
172 |
mempool_exit(pool); |
1da177e4c Linux-2.6.12-rc2 |
173 174 |
kfree(pool); } |
0565d3177 mempool: drop unn... |
175 |
EXPORT_SYMBOL(mempool_destroy); |
1da177e4c Linux-2.6.12-rc2 |
176 |
|
c1a67fefd mempool: Add memp... |
177 178 179 180 181 182 183 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 |
int mempool_init_node(mempool_t *pool, int min_nr, mempool_alloc_t *alloc_fn, mempool_free_t *free_fn, void *pool_data, gfp_t gfp_mask, int node_id) { spin_lock_init(&pool->lock); pool->min_nr = min_nr; pool->pool_data = pool_data; pool->alloc = alloc_fn; pool->free = free_fn; init_waitqueue_head(&pool->wait); pool->elements = kmalloc_array_node(min_nr, sizeof(void *), gfp_mask, node_id); if (!pool->elements) return -ENOMEM; /* * First pre-allocate the guaranteed number of buffers. */ while (pool->curr_nr < pool->min_nr) { void *element; element = pool->alloc(gfp_mask, pool->pool_data); if (unlikely(!element)) { mempool_exit(pool); return -ENOMEM; } add_element(pool, element); } return 0; } EXPORT_SYMBOL(mempool_init_node); /** * mempool_init - initialize a memory pool |
a3bf6ce36 mm/mempool.c: add... |
213 |
* @pool: pointer to the memory pool that should be initialized |
c1a67fefd mempool: Add memp... |
214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 |
* @min_nr: the minimum number of elements guaranteed to be * allocated for this pool. * @alloc_fn: user-defined element-allocation function. * @free_fn: user-defined element-freeing function. * @pool_data: optional private data available to the user-defined functions. * * Like mempool_create(), but initializes the pool in (i.e. embedded in another * structure). */ int mempool_init(mempool_t *pool, int min_nr, mempool_alloc_t *alloc_fn, mempool_free_t *free_fn, void *pool_data) { return mempool_init_node(pool, min_nr, alloc_fn, free_fn, pool_data, GFP_KERNEL, NUMA_NO_NODE); } EXPORT_SYMBOL(mempool_init); |
1da177e4c Linux-2.6.12-rc2 |
231 232 233 234 235 236 237 238 239 |
/** * mempool_create - create a memory pool * @min_nr: the minimum number of elements guaranteed to be * allocated for this pool. * @alloc_fn: user-defined element-allocation function. * @free_fn: user-defined element-freeing function. * @pool_data: optional private data available to the user-defined functions. * * this function creates and allocates a guaranteed size, preallocated |
72fd4a35a [PATCH] Numerous ... |
240 |
* memory pool. The pool can be used from the mempool_alloc() and mempool_free() |
1da177e4c Linux-2.6.12-rc2 |
241 |
* functions. This function might sleep. Both the alloc_fn() and the free_fn() |
72fd4a35a [PATCH] Numerous ... |
242 |
* functions might sleep - as long as the mempool_alloc() function is not called |
1da177e4c Linux-2.6.12-rc2 |
243 244 |
* from IRQ contexts. */ |
1946089a1 [PATCH] NUMA awar... |
245 |
mempool_t *mempool_create(int min_nr, mempool_alloc_t *alloc_fn, |
1da177e4c Linux-2.6.12-rc2 |
246 247 |
mempool_free_t *free_fn, void *pool_data) { |
a91a5ac68 mempool: add @gfp... |
248 249 |
return mempool_create_node(min_nr,alloc_fn,free_fn, pool_data, GFP_KERNEL, NUMA_NO_NODE); |
1946089a1 [PATCH] NUMA awar... |
250 251 |
} EXPORT_SYMBOL(mempool_create); |
1da177e4c Linux-2.6.12-rc2 |
252 |
|
1946089a1 [PATCH] NUMA awar... |
253 |
mempool_t *mempool_create_node(int min_nr, mempool_alloc_t *alloc_fn, |
a91a5ac68 mempool: add @gfp... |
254 255 |
mempool_free_t *free_fn, void *pool_data, gfp_t gfp_mask, int node_id) |
1946089a1 [PATCH] NUMA awar... |
256 257 |
{ mempool_t *pool; |
c1a67fefd mempool: Add memp... |
258 |
|
7b5219db0 mm/mempool.c: con... |
259 |
pool = kzalloc_node(sizeof(*pool), gfp_mask, node_id); |
1da177e4c Linux-2.6.12-rc2 |
260 261 |
if (!pool) return NULL; |
c1a67fefd mempool: Add memp... |
262 263 264 |
if (mempool_init_node(pool, min_nr, alloc_fn, free_fn, pool_data, gfp_mask, node_id)) { |
1da177e4c Linux-2.6.12-rc2 |
265 266 267 |
kfree(pool); return NULL; } |
1da177e4c Linux-2.6.12-rc2 |
268 |
|
1da177e4c Linux-2.6.12-rc2 |
269 270 |
return pool; } |
1946089a1 [PATCH] NUMA awar... |
271 |
EXPORT_SYMBOL(mempool_create_node); |
1da177e4c Linux-2.6.12-rc2 |
272 273 274 275 276 277 278 |
/** * mempool_resize - resize an existing memory pool * @pool: pointer to the memory pool which was allocated via * mempool_create(). * @new_min_nr: the new minimum number of elements guaranteed to be * allocated for this pool. |
1da177e4c Linux-2.6.12-rc2 |
279 280 281 282 |
* * This function shrinks/grows the pool. In the case of growing, * it cannot be guaranteed that the pool will be grown to the new * size immediately, but new mempool_free() calls will refill it. |
11d833604 mm, mempool: do n... |
283 |
* This function may sleep. |
1da177e4c Linux-2.6.12-rc2 |
284 285 286 287 288 |
* * Note, the caller must guarantee that no mempool_destroy is called * while this function is running. mempool_alloc() & mempool_free() * might be called (eg. from IRQ contexts) while this function executes. */ |
11d833604 mm, mempool: do n... |
289 |
int mempool_resize(mempool_t *pool, int new_min_nr) |
1da177e4c Linux-2.6.12-rc2 |
290 291 292 293 294 295 |
{ void *element; void **new_elements; unsigned long flags; BUG_ON(new_min_nr <= 0); |
11d833604 mm, mempool: do n... |
296 |
might_sleep(); |
1da177e4c Linux-2.6.12-rc2 |
297 298 299 300 |
spin_lock_irqsave(&pool->lock, flags); if (new_min_nr <= pool->min_nr) { while (new_min_nr < pool->curr_nr) { |
8cded8668 mm/mempool.c: rem... |
301 |
element = remove_element(pool); |
1da177e4c Linux-2.6.12-rc2 |
302 303 304 305 306 307 308 309 310 311 |
spin_unlock_irqrestore(&pool->lock, flags); pool->free(element, pool->pool_data); spin_lock_irqsave(&pool->lock, flags); } pool->min_nr = new_min_nr; goto out_unlock; } spin_unlock_irqrestore(&pool->lock, flags); /* Grow the pool */ |
11d833604 mm, mempool: do n... |
312 313 |
new_elements = kmalloc_array(new_min_nr, sizeof(*new_elements), GFP_KERNEL); |
1da177e4c Linux-2.6.12-rc2 |
314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 |
if (!new_elements) return -ENOMEM; spin_lock_irqsave(&pool->lock, flags); if (unlikely(new_min_nr <= pool->min_nr)) { /* Raced, other resize will do our work */ spin_unlock_irqrestore(&pool->lock, flags); kfree(new_elements); goto out; } memcpy(new_elements, pool->elements, pool->curr_nr * sizeof(*new_elements)); kfree(pool->elements); pool->elements = new_elements; pool->min_nr = new_min_nr; while (pool->curr_nr < pool->min_nr) { spin_unlock_irqrestore(&pool->lock, flags); |
11d833604 mm, mempool: do n... |
332 |
element = pool->alloc(GFP_KERNEL, pool->pool_data); |
1da177e4c Linux-2.6.12-rc2 |
333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 |
if (!element) goto out; spin_lock_irqsave(&pool->lock, flags); if (pool->curr_nr < pool->min_nr) { add_element(pool, element); } else { spin_unlock_irqrestore(&pool->lock, flags); pool->free(element, pool->pool_data); /* Raced */ goto out; } } out_unlock: spin_unlock_irqrestore(&pool->lock, flags); out: return 0; } EXPORT_SYMBOL(mempool_resize); /** |
1da177e4c Linux-2.6.12-rc2 |
352 353 354 355 356 |
* mempool_alloc - allocate an element from a specific memory pool * @pool: pointer to the memory pool which was allocated via * mempool_create(). * @gfp_mask: the usual allocation bitmask. * |
72fd4a35a [PATCH] Numerous ... |
357 |
* this function only sleeps if the alloc_fn() function sleeps or |
1da177e4c Linux-2.6.12-rc2 |
358 359 360 |
* returns NULL. Note that due to preallocation, this function * *never* fails when called from process contexts. (it might * fail if called from an IRQ context.) |
4e390b2b2 Revert "mm, mempo... |
361 |
* Note: using __GFP_ZERO is not supported. |
1da177e4c Linux-2.6.12-rc2 |
362 |
*/ |
f9054c70d mm, mempool: only... |
363 |
void *mempool_alloc(mempool_t *pool, gfp_t gfp_mask) |
1da177e4c Linux-2.6.12-rc2 |
364 365 366 |
{ void *element; unsigned long flags; |
ac6424b98 sched/wait: Renam... |
367 |
wait_queue_entry_t wait; |
6daa0e286 [PATCH] gfp_t: mm... |
368 |
gfp_t gfp_temp; |
20a77776c [PATCH] mempool: ... |
369 |
|
8bf8fcb07 mm/mempool: warn ... |
370 |
VM_WARN_ON_ONCE(gfp_mask & __GFP_ZERO); |
d0164adc8 mm, page_alloc: d... |
371 |
might_sleep_if(gfp_mask & __GFP_DIRECT_RECLAIM); |
b84a35be0 [PATCH] mempool: ... |
372 |
|
4e390b2b2 Revert "mm, mempo... |
373 |
gfp_mask |= __GFP_NOMEMALLOC; /* don't allocate emergency reserves */ |
b84a35be0 [PATCH] mempool: ... |
374 375 |
gfp_mask |= __GFP_NORETRY; /* don't loop in __alloc_pages */ gfp_mask |= __GFP_NOWARN; /* failures are OK */ |
1da177e4c Linux-2.6.12-rc2 |
376 |
|
d0164adc8 mm, page_alloc: d... |
377 |
gfp_temp = gfp_mask & ~(__GFP_DIRECT_RECLAIM|__GFP_IO); |
20a77776c [PATCH] mempool: ... |
378 |
|
1da177e4c Linux-2.6.12-rc2 |
379 |
repeat_alloc: |
20a77776c [PATCH] mempool: ... |
380 381 |
element = pool->alloc(gfp_temp, pool->pool_data); |
1da177e4c Linux-2.6.12-rc2 |
382 383 |
if (likely(element != NULL)) return element; |
1da177e4c Linux-2.6.12-rc2 |
384 385 |
spin_lock_irqsave(&pool->lock, flags); if (likely(pool->curr_nr)) { |
8cded8668 mm/mempool.c: rem... |
386 |
element = remove_element(pool); |
1da177e4c Linux-2.6.12-rc2 |
387 |
spin_unlock_irqrestore(&pool->lock, flags); |
5b990546e mempool: fix and ... |
388 389 |
/* paired with rmb in mempool_free(), read comment there */ smp_wmb(); |
174119628 mm/mempool.c: upd... |
390 391 392 393 394 |
/* * Update the allocation stack trace as this is more useful * for debugging. */ kmemleak_update_trace(element); |
1da177e4c Linux-2.6.12-rc2 |
395 396 |
return element; } |
1da177e4c Linux-2.6.12-rc2 |
397 |
|
1ebb7044c mempool: fix firs... |
398 |
/* |
d0164adc8 mm, page_alloc: d... |
399 |
* We use gfp mask w/o direct reclaim or IO for the first round. If |
1ebb7044c mempool: fix firs... |
400 401 |
* alloc failed with that and @pool was empty, retry immediately. */ |
4e390b2b2 Revert "mm, mempo... |
402 |
if (gfp_temp != gfp_mask) { |
1ebb7044c mempool: fix firs... |
403 404 405 406 |
spin_unlock_irqrestore(&pool->lock, flags); gfp_temp = gfp_mask; goto repeat_alloc; } |
d0164adc8 mm, page_alloc: d... |
407 408 |
/* We must not sleep if !__GFP_DIRECT_RECLAIM */ if (!(gfp_mask & __GFP_DIRECT_RECLAIM)) { |
5b990546e mempool: fix and ... |
409 |
spin_unlock_irqrestore(&pool->lock, flags); |
1da177e4c Linux-2.6.12-rc2 |
410 |
return NULL; |
5b990546e mempool: fix and ... |
411 |
} |
1da177e4c Linux-2.6.12-rc2 |
412 |
|
5b990546e mempool: fix and ... |
413 |
/* Let's wait for someone else to return an element to @pool */ |
01890a4c1 [PATCH] mempool -... |
414 |
init_wait(&wait); |
1da177e4c Linux-2.6.12-rc2 |
415 |
prepare_to_wait(&pool->wait, &wait, TASK_UNINTERRUPTIBLE); |
1da177e4c Linux-2.6.12-rc2 |
416 |
|
5b990546e mempool: fix and ... |
417 418 419 420 421 422 423 424 425 |
spin_unlock_irqrestore(&pool->lock, flags); /* * FIXME: this should be io_schedule(). The timeout is there as a * workaround for some DM problems in 2.6.18. */ io_schedule_timeout(5*HZ); finish_wait(&pool->wait, &wait); |
1da177e4c Linux-2.6.12-rc2 |
426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 |
goto repeat_alloc; } EXPORT_SYMBOL(mempool_alloc); /** * mempool_free - return an element to the pool. * @element: pool element pointer. * @pool: pointer to the memory pool which was allocated via * mempool_create(). * * this function only sleeps if the free_fn() function sleeps. */ void mempool_free(void *element, mempool_t *pool) { unsigned long flags; |
c80e7a826 permit mempool_fr... |
441 442 |
if (unlikely(element == NULL)) return; |
5b990546e mempool: fix and ... |
443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 |
/* * Paired with the wmb in mempool_alloc(). The preceding read is * for @element and the following @pool->curr_nr. This ensures * that the visible value of @pool->curr_nr is from after the * allocation of @element. This is necessary for fringe cases * where @element was passed to this task without going through * barriers. * * For example, assume @p is %NULL at the beginning and one task * performs "p = mempool_alloc(...);" while another task is doing * "while (!p) cpu_relax(); mempool_free(p, ...);". This function * may end up using curr_nr value which is from before allocation * of @p without the following rmb. */ smp_rmb(); /* * For correctness, we need a test which is guaranteed to trigger * if curr_nr + #allocated == min_nr. Testing curr_nr < min_nr * without locking achieves that and refilling as soon as possible * is desirable. * * Because curr_nr visible here is always a value after the * allocation of @element, any task which decremented curr_nr below * min_nr is guaranteed to see curr_nr < min_nr unless curr_nr gets * incremented to min_nr afterwards. If curr_nr gets incremented * to min_nr after the allocation of @element, the elements * allocated after that are subject to the same guarantee. * * Waiters happen iff curr_nr is 0 and the above guarantee also * ensures that there will be frees which return elements to the * pool waking up the waiters. */ |
eb9a3c62a mempool: add unli... |
476 |
if (unlikely(pool->curr_nr < pool->min_nr)) { |
1da177e4c Linux-2.6.12-rc2 |
477 |
spin_lock_irqsave(&pool->lock, flags); |
eb9a3c62a mempool: add unli... |
478 |
if (likely(pool->curr_nr < pool->min_nr)) { |
1da177e4c Linux-2.6.12-rc2 |
479 480 481 482 483 484 485 486 487 488 489 490 491 492 |
add_element(pool, element); spin_unlock_irqrestore(&pool->lock, flags); wake_up(&pool->wait); return; } spin_unlock_irqrestore(&pool->lock, flags); } pool->free(element, pool->pool_data); } EXPORT_SYMBOL(mempool_free); /* * A commonly used alloc and free fn. */ |
dd0fc66fb [PATCH] gfp flags... |
493 |
void *mempool_alloc_slab(gfp_t gfp_mask, void *pool_data) |
1da177e4c Linux-2.6.12-rc2 |
494 |
{ |
fcc234f88 [PATCH] mm: kill ... |
495 |
struct kmem_cache *mem = pool_data; |
e244c9e66 mm, mempool: disa... |
496 |
VM_BUG_ON(mem->ctor); |
1da177e4c Linux-2.6.12-rc2 |
497 498 499 500 501 502 |
return kmem_cache_alloc(mem, gfp_mask); } EXPORT_SYMBOL(mempool_alloc_slab); void mempool_free_slab(void *element, void *pool_data) { |
fcc234f88 [PATCH] mm: kill ... |
503 |
struct kmem_cache *mem = pool_data; |
1da177e4c Linux-2.6.12-rc2 |
504 505 506 |
kmem_cache_free(mem, element); } EXPORT_SYMBOL(mempool_free_slab); |
6e0678f39 [PATCH] mempool: ... |
507 508 |
/* |
53184082b [PATCH] mempool: ... |
509 |
* A commonly used alloc and free fn that kmalloc/kfrees the amount of memory |
183ff22bb spelling fixes: mm/ |
510 |
* specified by pool_data |
53184082b [PATCH] mempool: ... |
511 512 513 |
*/ void *mempool_kmalloc(gfp_t gfp_mask, void *pool_data) { |
5e2f89b5d mempool.c: clean ... |
514 |
size_t size = (size_t)pool_data; |
53184082b [PATCH] mempool: ... |
515 516 517 518 519 520 521 522 523 524 525 |
return kmalloc(size, gfp_mask); } EXPORT_SYMBOL(mempool_kmalloc); void mempool_kfree(void *element, void *pool_data) { kfree(element); } EXPORT_SYMBOL(mempool_kfree); /* |
6e0678f39 [PATCH] mempool: ... |
526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 |
* A simple mempool-backed page allocator that allocates pages * of the order specified by pool_data. */ void *mempool_alloc_pages(gfp_t gfp_mask, void *pool_data) { int order = (int)(long)pool_data; return alloc_pages(gfp_mask, order); } EXPORT_SYMBOL(mempool_alloc_pages); void mempool_free_pages(void *element, void *pool_data) { int order = (int)(long)pool_data; __free_pages(element, order); } EXPORT_SYMBOL(mempool_free_pages); |