60 	for (i = pool->used; i < pool->size; i++) {  in return_unused_pool_pebs()
126 		free += pool->size - pool->used + wl_pool->size - wl_pool->used;  in wait_free_pebs_for_pool()
256 	wl_pool->used = 0;  in ubi_refill_pools_and_lock()
257 	pool->used = 0;  in ubi_refill_pools_and_lock()
306 	if (pool->used == pool->size || wl_pool->used == wl_pool->size) {  in ubi_wl_get_peb()
319 	if (pool->used == pool->size) {  in ubi_wl_get_peb()
336 	ubi_assert(pool->used < pool->size);  in ubi_wl_get_peb()
337 	ret = pool->pebs[pool->used++];  in ubi_wl_get_peb()
357 	if (pool->used == pool->size) {  in next_peb_for_wl()
371 	pnum = pool->pebs[pool->used];  in next_peb_for_wl()
388 	if (!ubi->used.rb_node)  in need_wear_leveling()
404 	e = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);  in need_wear_leveling()
420 	if (pool->used == pool->size) {  in get_peb_for_wl()
431 	pnum = pool->pebs[pool->used++];  in get_peb_for_wl()