Lines Matching refs:min_nr
123 BUG_ON(pool->curr_nr >= pool->min_nr); in add_element()
179 int mempool_init_node(mempool_t *pool, int min_nr, mempool_alloc_t *alloc_fn, in mempool_init_node() argument
184 pool->min_nr = min_nr; in mempool_init_node()
190 pool->elements = kmalloc_array_node(min_nr, sizeof(void *), in mempool_init_node()
198 while (pool->curr_nr < pool->min_nr) { in mempool_init_node()
227 int mempool_init(mempool_t *pool, int min_nr, mempool_alloc_t *alloc_fn, in mempool_init() argument
230 return mempool_init_node(pool, min_nr, alloc_fn, free_fn, in mempool_init()
252 mempool_t *mempool_create(int min_nr, mempool_alloc_t *alloc_fn, in mempool_create() argument
255 return mempool_create_node(min_nr, alloc_fn, free_fn, pool_data, in mempool_create()
260 mempool_t *mempool_create_node(int min_nr, mempool_alloc_t *alloc_fn, in mempool_create_node() argument
270 if (mempool_init_node(pool, min_nr, alloc_fn, free_fn, pool_data, in mempool_create_node()
308 if (new_min_nr <= pool->min_nr) { in mempool_resize()
315 pool->min_nr = new_min_nr; in mempool_resize()
327 if (unlikely(new_min_nr <= pool->min_nr)) { in mempool_resize()
337 pool->min_nr = new_min_nr; in mempool_resize()
339 while (pool->curr_nr < pool->min_nr) { in mempool_resize()
345 if (pool->curr_nr < pool->min_nr) { in mempool_resize()
491 if (unlikely(READ_ONCE(pool->curr_nr) < pool->min_nr)) { in mempool_free()
493 if (likely(pool->curr_nr < pool->min_nr)) { in mempool_free()