Searched refs:curr_nr (Results 1 – 3 of 3) sorted by relevance
27 const int nr = pool->curr_nr; in poison_error()129 BUG_ON(pool->curr_nr >= pool->min_nr); in add_element()132 pool->elements[pool->curr_nr++] = element; in add_element()139 BUG_ON(pool->curr_nr < 0); in remove_element()158 while (pool->curr_nr) { in mempool_exit()204 while (pool->curr_nr < pool->min_nr) { in mempool_init_node()315 while (new_min_nr < pool->curr_nr) { in mempool_resize()340 pool->curr_nr * sizeof(*new_elements)); in mempool_resize()345 while (pool->curr_nr < pool->min_nr) { in mempool_resize()351 if (pool->curr_nr < pool->min_nr) { in mempool_resize()[all …]
19 int curr_nr; /* Current nr of elements at *elements */ member35 return READ_ONCE(pool->curr_nr) >= pool->min_nr; in mempool_is_saturated()
1502 while (pool->curr_nr < pool->min_nr) in mempool_refill()