60 	for (i = pool->used; i < pool->size; i++) {  in return_unused_pool_pebs()
190 	wl_pool->used = 0;  in ubi_refill_pools()
191 	pool->used = 0;  in ubi_refill_pools()
240 	if (pool->used == pool->size || wl_pool->used == wl_pool->size) {  in ubi_wl_get_peb()
253 	if (pool->used == pool->size) {  in ubi_wl_get_peb()
270 	ubi_assert(pool->used < pool->size);  in ubi_wl_get_peb()
271 	ret = pool->pebs[pool->used++];  in ubi_wl_get_peb()
289 	if (pool->used == pool->size)  in next_peb_for_wl()
292 	pnum = pool->pebs[pool->used];  in next_peb_for_wl()
309 	if (!ubi->used.rb_node)  in need_wear_leveling()
325 	e = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);  in need_wear_leveling()
341 	if (pool->used == pool->size) {  in get_peb_for_wl()
352 	pnum = pool->pebs[pool->used++];  in get_peb_for_wl()