Lines Matching full:elements
125 pool->elements[pool->curr_nr++] = element; in add_element()
130 void *element = pool->elements[--pool->curr_nr]; in remove_element()
143 * Free all reserved elements in @pool and @pool itself. This function
155 kfree(pool->elements); in mempool_exit()
156 pool->elements = NULL; in mempool_exit()
165 * Free all reserved elements in @pool and @pool itself. This function
189 pool->elements = kmalloc_array_node(min_nr, sizeof(void *), in mempool_init_node()
191 if (!pool->elements) in mempool_init_node()
215 * @min_nr: the minimum number of elements guaranteed to be
237 * @min_nr: the minimum number of elements guaranteed to be
283 * @new_min_nr: the new minimum number of elements guaranteed to be
332 memcpy(new_elements, pool->elements, in mempool_resize()
334 kfree(pool->elements); in mempool_resize()
335 pool->elements = new_elements; in mempool_resize()
483 * to min_nr after the allocation of @element, the elements in mempool_free()
487 * ensures that there will be frees which return elements to the in mempool_free()