122 	BUG_ON(pool->curr_nr >= pool->min_nr);  in add_element()
178 int mempool_init_node(mempool_t *pool, int min_nr, mempool_alloc_t *alloc_fn,  in mempool_init_node()  argument
183 	pool->min_nr	= min_nr;  in mempool_init_node()
189 	pool->elements = kmalloc_array_node(min_nr, sizeof(void *),  in mempool_init_node()
197 	while (pool->curr_nr < pool->min_nr) {  in mempool_init_node()
226 int mempool_init(mempool_t *pool, int min_nr, mempool_alloc_t *alloc_fn,  in mempool_init()  argument
229 	return mempool_init_node(pool, min_nr, alloc_fn, free_fn,  in mempool_init()
251 mempool_t *mempool_create(int min_nr, mempool_alloc_t *alloc_fn,  in mempool_create()  argument
254 	return mempool_create_node(min_nr,alloc_fn,free_fn, pool_data,  in mempool_create()
259 mempool_t *mempool_create_node(int min_nr, mempool_alloc_t *alloc_fn,  in mempool_create_node()  argument
269 	if (mempool_init_node(pool, min_nr, alloc_fn, free_fn, pool_data,  in mempool_create_node()
307 	if (new_min_nr <= pool->min_nr) {  in mempool_resize()
314 		pool->min_nr = new_min_nr;  in mempool_resize()
326 	if (unlikely(new_min_nr <= pool->min_nr)) {  in mempool_resize()
336 	pool->min_nr = new_min_nr;  in mempool_resize()
338 	while (pool->curr_nr < pool->min_nr) {  in mempool_resize()
344 		if (pool->curr_nr < pool->min_nr) {  in mempool_resize()
490 	if (unlikely(READ_ONCE(pool->curr_nr) < pool->min_nr)) {  in mempool_free()
492 		if (likely(pool->curr_nr < pool->min_nr)) {  in mempool_free()