Lines Matching defs:pool
52 * @pool: fastmap pool description object
55 struct ubi_fm_pool *pool)
60 for (i = pool->used; i < pool->size; i++) {
61 e = ubi->lookuptbl[pool->pebs[i]];
104 * Wait and execute do_work until there are enough free pebs, fill pool
105 * as much as we can. This will reduce pool refilling times, which can
111 struct ubi_fm_pool *pool = &ubi->fm_pool;
126 free += pool->size - pool->used + wl_pool->size - wl_pool->used;
171 struct ubi_fm_pool *pool = &ubi->fm_pool;
172 int pool_need = pool->max_size - pool->size +
188 struct ubi_fm_pool *pool = &ubi->fm_pool;
202 return_unused_pool_pebs(ubi, pool);
205 pool->size = 0;
222 if (pool->size < pool->max_size) {
230 pool->pebs[pool->size] = e->pnum;
231 pool->size++;
257 pool->used = 0;
297 struct ubi_fm_pool *pool = &ubi->fm_pool;
304 /* We check here also for the WL pool because at this point we can
305 * refill the WL pool synchronous. */
306 if (pool->used == pool->size || wl_pool->used == wl_pool->size) {
319 if (pool->used == pool->size) {
323 ubi_err(ubi, "Unable to get a free PEB from user WL pool");
336 ubi_assert(pool->used < pool->size);
337 ret = pool->pebs[pool->used++];
352 struct ubi_fm_pool *pool = &ubi->fm_wl_pool;
355 if (pool->used == pool->size)
358 pnum = pool->pebs[pool->used];
402 struct ubi_fm_pool *pool = &ubi->fm_wl_pool;
407 if (pool->used == pool->size) {
418 pnum = pool->pebs[pool->used++];