Searched refs:curr_nr (Results 1 – 3 of 3) sorted by relevance
27 const int nr = pool->curr_nr; in poison_error()139 BUG_ON(pool->curr_nr >= pool->min_nr); in add_element()142 pool->elements[pool->curr_nr++] = element; in add_element()147 void *element = pool->elements[--pool->curr_nr]; in remove_element()149 BUG_ON(pool->curr_nr < 0); in remove_element()168 while (pool->curr_nr) { in mempool_exit()214 while (pool->curr_nr < pool->min_nr) { in mempool_init_node()319 while (new_min_nr < pool->curr_nr) { in mempool_resize()344 pool->curr_nr * sizeof(*new_elements)); in mempool_resize()349 while (pool->curr_nr < pool->min_nr) { in mempool_resize()[all …]
21 int curr_nr; /* Current nr of elements at *elements */ member37 return READ_ONCE(pool->curr_nr) >= pool->min_nr; in mempool_is_saturated()
1740 while (pool->curr_nr < pool->min_nr) in mempool_refill()