29 	struct ubi_wl_entry *e, *victim = NULL;  in find_anchor_wl_entry()  local
32 	ubi_rb_for_each_entry(p, e, root, u.rb) {  in find_anchor_wl_entry()
33 		if (e->pnum < UBI_FM_MAX_START && e->ec < max_ec) {  in find_anchor_wl_entry()
34 			victim = e;  in find_anchor_wl_entry()
35 			max_ec = e->ec;  in find_anchor_wl_entry()
51 	struct ubi_wl_entry *e;  in return_unused_pool_pebs()  local
54 		e = ubi->lookuptbl[pool->pebs[i]];  in return_unused_pool_pebs()
55 		wl_tree_add(e, &ubi->free);  in return_unused_pool_pebs()
63 	struct ubi_wl_entry *e;  in anchor_pebs_available()  local
65 	ubi_rb_for_each_entry(p, e, root, u.rb)  in anchor_pebs_available()
66 		if (e->pnum < UBI_FM_MAX_START)  in anchor_pebs_available()
83 	struct ubi_wl_entry *e = NULL;  in ubi_wl_get_fm_peb()  local
89 		e = find_anchor_wl_entry(&ubi->free);  in ubi_wl_get_fm_peb()
91 		e = find_mean_wl_entry(ubi, &ubi->free);  in ubi_wl_get_fm_peb()
93 	if (!e)  in ubi_wl_get_fm_peb()
96 	self_check_in_wl_tree(ubi, e, &ubi->free);  in ubi_wl_get_fm_peb()
100 	rb_erase(&e->u.rb, &ubi->free);  in ubi_wl_get_fm_peb()
103 	return e;  in ubi_wl_get_fm_peb()
114 	struct ubi_wl_entry *e;  in ubi_refill_pools()  local
131 			e = wl_get_wle(ubi);  in ubi_refill_pools()
132 			if (!e)  in ubi_refill_pools()
135 			pool->pebs[pool->size] = e->pnum;  in ubi_refill_pools()
145 			e = find_wl_entry(ubi, &ubi->free, WL_FREE_MAX_DIFF);  in ubi_refill_pools()
146 			self_check_in_wl_tree(ubi, e, &ubi->free);  in ubi_refill_pools()
147 			rb_erase(&e->u.rb, &ubi->free);  in ubi_refill_pools()
150 			wl_pool->pebs[wl_pool->size] = e->pnum;  in ubi_refill_pools()
316 	struct ubi_wl_entry *e;  in ubi_wl_put_fm_peb()  local
325 	e = ubi->lookuptbl[pnum];  in ubi_wl_put_fm_peb()
331 	if (!e) {  in ubi_wl_put_fm_peb()
332 		e = fm_e;  in ubi_wl_put_fm_peb()
333 		ubi_assert(e->ec >= 0);  in ubi_wl_put_fm_peb()
334 		ubi->lookuptbl[pnum] = e;  in ubi_wl_put_fm_peb()
340 	return schedule_erase(ubi, e, vol_id, lnum, torture, true);  in ubi_wl_put_fm_peb()
361 			kfree(ubi->fm->e[i]);  in ubi_fastmap_close()
375 					   struct ubi_wl_entry *e,  in may_reserve_for_fm()  argument
377 	if (e && !ubi->fm_disabled && !ubi->fm &&  in may_reserve_for_fm()
378 	    e->pnum < UBI_FM_MAX_START)  in may_reserve_for_fm()
379 		e = rb_entry(rb_next(root->rb_node),  in may_reserve_for_fm()
382 	return e;  in may_reserve_for_fm()