mirror of
https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git
synced 2026-06-21 15:43:21 +02:00
Christoph Hellwig
be6e0a533d
The mempool_alloc_bulk was modelled after the alloc_pages_bulk API, including some misunderstanding of it. Remove checking for NULL slots in the array, as alloc_pages_bulk and kmem_cache_alloc_bulk always fill the array from the beginning and thus we know the offset of the first failing allocation. This removes support for working well with alloc_pages_bulk used to refill page arrays that might have an entry removed from in the middle, but that is only used by sunrpc and hopefully on it's way out. Also remove the allocated parameter as it is redundant because the caller can simply specific and offset into the entries array. Signed-off-by: Christoph Hellwig <hch@lst.de> Link: https://patch.msgid.link/20260602160038.3976341-1-hch@lst.de Signed-off-by: Vlastimil Babka (SUSE) <vbabka@kernel.org>
120 lines
4.1 KiB
C
120 lines
4.1 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
/*
|
|
* memory buffer pool support
|
|
*/
|
|
#ifndef _LINUX_MEMPOOL_H
|
|
#define _LINUX_MEMPOOL_H
|
|
|
|
#include <linux/sched.h>
|
|
#include <linux/alloc_tag.h>
|
|
#include <linux/wait.h>
|
|
#include <linux/compiler.h>
|
|
|
|
struct kmem_cache;
|
|
|
|
typedef void * (mempool_alloc_t)(gfp_t gfp_mask, void *pool_data);
|
|
typedef void (mempool_free_t)(void *element, void *pool_data);
|
|
|
|
typedef struct mempool {
|
|
spinlock_t lock;
|
|
int min_nr; /* nr of elements at *elements */
|
|
int curr_nr; /* Current nr of elements at *elements */
|
|
void **elements;
|
|
|
|
void *pool_data;
|
|
mempool_alloc_t *alloc;
|
|
mempool_free_t *free;
|
|
wait_queue_head_t wait;
|
|
} mempool_t;
|
|
|
|
static inline bool mempool_initialized(struct mempool *pool)
|
|
{
|
|
return pool->elements != NULL;
|
|
}
|
|
|
|
static inline bool mempool_is_saturated(struct mempool *pool)
|
|
{
|
|
return READ_ONCE(pool->curr_nr) >= pool->min_nr;
|
|
}
|
|
|
|
void mempool_exit(struct mempool *pool);
|
|
int mempool_init_node(struct mempool *pool, int min_nr,
|
|
mempool_alloc_t *alloc_fn, mempool_free_t *free_fn,
|
|
void *pool_data, gfp_t gfp_mask, int node_id);
|
|
int mempool_init_noprof(struct mempool *pool, int min_nr,
|
|
mempool_alloc_t *alloc_fn, mempool_free_t *free_fn,
|
|
void *pool_data);
|
|
#define mempool_init(...) \
|
|
alloc_hooks(mempool_init_noprof(__VA_ARGS__))
|
|
|
|
struct mempool *mempool_create(int min_nr, mempool_alloc_t *alloc_fn,
|
|
mempool_free_t *free_fn, void *pool_data);
|
|
struct mempool *mempool_create_node_noprof(int min_nr,
|
|
mempool_alloc_t *alloc_fn, mempool_free_t *free_fn,
|
|
void *pool_data, gfp_t gfp_mask, int nid);
|
|
#define mempool_create_node(...) \
|
|
alloc_hooks(mempool_create_node_noprof(__VA_ARGS__))
|
|
|
|
#define mempool_create(_min_nr, _alloc_fn, _free_fn, _pool_data) \
|
|
mempool_create_node(_min_nr, _alloc_fn, _free_fn, _pool_data, \
|
|
GFP_KERNEL, NUMA_NO_NODE)
|
|
|
|
int mempool_resize(struct mempool *pool, int new_min_nr);
|
|
void mempool_destroy(struct mempool *pool);
|
|
|
|
void *mempool_alloc_noprof(struct mempool *pool, gfp_t gfp_mask) __malloc;
|
|
#define mempool_alloc(...) \
|
|
alloc_hooks(mempool_alloc_noprof(__VA_ARGS__))
|
|
int mempool_alloc_bulk_noprof(struct mempool *pool, void **elem,
|
|
unsigned int count);
|
|
#define mempool_alloc_bulk(...) \
|
|
alloc_hooks(mempool_alloc_bulk_noprof(__VA_ARGS__))
|
|
|
|
void *mempool_alloc_preallocated(struct mempool *pool) __malloc;
|
|
void mempool_free(void *element, struct mempool *pool);
|
|
unsigned int mempool_free_bulk(struct mempool *pool, void **elem,
|
|
unsigned int count);
|
|
|
|
/*
|
|
* A mempool_alloc_t and mempool_free_t that get the memory from
|
|
* a slab cache that is passed in through pool_data.
|
|
* Note: the slab cache may not have a ctor function.
|
|
*/
|
|
void *mempool_alloc_slab(gfp_t gfp_mask, void *pool_data);
|
|
void mempool_free_slab(void *element, void *pool_data);
|
|
|
|
#define mempool_init_slab_pool(_pool, _min_nr, _kc) \
|
|
mempool_init(_pool, (_min_nr), mempool_alloc_slab, mempool_free_slab, (void *)(_kc))
|
|
#define mempool_create_slab_pool(_min_nr, _kc) \
|
|
mempool_create((_min_nr), mempool_alloc_slab, mempool_free_slab, (void *)(_kc))
|
|
|
|
/*
|
|
* a mempool_alloc_t and a mempool_free_t to kmalloc and kfree the
|
|
* amount of memory specified by pool_data
|
|
*/
|
|
void *mempool_kmalloc(gfp_t gfp_mask, void *pool_data);
|
|
void mempool_kfree(void *element, void *pool_data);
|
|
|
|
#define mempool_init_kmalloc_pool(_pool, _min_nr, _size) \
|
|
mempool_init(_pool, (_min_nr), mempool_kmalloc, mempool_kfree, \
|
|
(void *)(unsigned long)(_size))
|
|
#define mempool_create_kmalloc_pool(_min_nr, _size) \
|
|
mempool_create((_min_nr), mempool_kmalloc, mempool_kfree, \
|
|
(void *)(unsigned long)(_size))
|
|
|
|
/*
|
|
* A mempool_alloc_t and mempool_free_t for a simple page allocator that
|
|
* allocates pages of the order specified by pool_data
|
|
*/
|
|
void *mempool_alloc_pages(gfp_t gfp_mask, void *pool_data);
|
|
void mempool_free_pages(void *element, void *pool_data);
|
|
|
|
#define mempool_init_page_pool(_pool, _min_nr, _order) \
|
|
mempool_init(_pool, (_min_nr), mempool_alloc_pages, \
|
|
mempool_free_pages, (void *)(long)(_order))
|
|
#define mempool_create_page_pool(_min_nr, _order) \
|
|
mempool_create((_min_nr), mempool_alloc_pages, \
|
|
mempool_free_pages, (void *)(long)(_order))
|
|
|
|
#endif /* _LINUX_MEMPOOL_H */
|