140 				 struct ubi_wl_entry *e, struct rb_root *root);
142 			    struct ubi_wl_entry *e);
152 static void wl_tree_add(struct ubi_wl_entry *e, struct rb_root *root)  in wl_tree_add()  argument
163 		if (e->ec < e1->ec)  in wl_tree_add()
165 		else if (e->ec > e1->ec)  in wl_tree_add()
168 			ubi_assert(e->pnum != e1->pnum);  in wl_tree_add()
169 			if (e->pnum < e1->pnum)  in wl_tree_add()
176 	rb_link_node(&e->u.rb, parent, p);  in wl_tree_add()
177 	rb_insert_color(&e->u.rb, root);  in wl_tree_add()
188 static void wl_entry_destroy(struct ubi_device *ubi, struct ubi_wl_entry *e)  in wl_entry_destroy()  argument
190 	ubi->lookuptbl[e->pnum] = NULL;  in wl_entry_destroy()
191 	kmem_cache_free(ubi_wl_entry_slab, e);  in wl_entry_destroy()
249 static int in_wl_tree(struct ubi_wl_entry *e, struct rb_root *root)  in in_wl_tree()  argument
259 		if (e->pnum == e1->pnum) {  in in_wl_tree()
260 			ubi_assert(e == e1);  in in_wl_tree()
264 		if (e->ec < e1->ec)  in in_wl_tree()
266 		else if (e->ec > e1->ec)  in in_wl_tree()
269 			ubi_assert(e->pnum != e1->pnum);  in in_wl_tree()
270 			if (e->pnum < e1->pnum)  in in_wl_tree()
290 static void prot_queue_add(struct ubi_device *ubi, struct ubi_wl_entry *e)  in prot_queue_add()  argument
297 	list_add_tail(&e->u.list, &ubi->pq[pq_tail]);  in prot_queue_add()
298 	dbg_wl("added PEB %d EC %d to the protection queue", e->pnum, e->ec);  in prot_queue_add()
314 	struct ubi_wl_entry *e, *prev_e = NULL;  in find_wl_entry()  local
317 	e = rb_entry(rb_first(root), struct ubi_wl_entry, u.rb);  in find_wl_entry()
318 	max = e->ec + diff;  in find_wl_entry()
329 			prev_e = e;  in find_wl_entry()
330 			e = e1;  in find_wl_entry()
338 	    !ubi->fm && e->pnum < UBI_FM_MAX_START)  in find_wl_entry()
341 	return e;  in find_wl_entry()
356 	struct ubi_wl_entry *e, *first, *last;  in find_mean_wl_entry()  local
362 		e = rb_entry(root->rb_node, struct ubi_wl_entry, u.rb);  in find_mean_wl_entry()
367 		e = may_reserve_for_fm(ubi, e, root);  in find_mean_wl_entry()
369 		e = find_wl_entry(ubi, root, WL_FREE_MAX_DIFF/2);  in find_mean_wl_entry()
371 	return e;  in find_mean_wl_entry()
384 	struct ubi_wl_entry *e;  in wl_get_wle()  local
386 	e = find_mean_wl_entry(ubi, &ubi->free);  in wl_get_wle()
387 	if (!e) {  in wl_get_wle()
392 	self_check_in_wl_tree(ubi, e, &ubi->free);  in wl_get_wle()
398 	rb_erase(&e->u.rb, &ubi->free);  in wl_get_wle()
400 	dbg_wl("PEB %d EC %d", e->pnum, e->ec);  in wl_get_wle()
402 	return e;  in wl_get_wle()
415 	struct ubi_wl_entry *e;  in prot_queue_del()  local
417 	e = ubi->lookuptbl[pnum];  in prot_queue_del()
418 	if (!e)  in prot_queue_del()
421 	if (self_check_in_pq(ubi, e))  in prot_queue_del()
424 	list_del(&e->u.list);  in prot_queue_del()
425 	dbg_wl("deleted PEB %d from the protection queue", e->pnum);  in prot_queue_del()
438 static int sync_erase(struct ubi_device *ubi, struct ubi_wl_entry *e,  in sync_erase()  argument
443 	unsigned long long ec = e->ec;  in sync_erase()
445 	dbg_wl("erase PEB %d, old EC %llu", e->pnum, ec);  in sync_erase()
447 	err = self_check_ec(ubi, e->pnum, e->ec);  in sync_erase()
455 	err = ubi_io_sync_erase(ubi, e->pnum, torture);  in sync_erase()
466 			e->pnum, ec);  in sync_erase()
471 	dbg_wl("erased PEB %d, new EC %llu", e->pnum, ec);  in sync_erase()
475 	err = ubi_io_write_ec_hdr(ubi, e->pnum, ec_hdr);  in sync_erase()
479 	e->ec = ec;  in sync_erase()
481 	if (e->ec > ubi->max_ec)  in sync_erase()
482 		ubi->max_ec = e->ec;  in sync_erase()
500 	struct ubi_wl_entry *e, *tmp;  in serve_prot_queue()  local
510 	list_for_each_entry_safe(e, tmp, &ubi->pq[ubi->pq_head], u.list) {  in serve_prot_queue()
512 			e->pnum, e->ec);  in serve_prot_queue()
514 		list_del(&e->u.list);  in serve_prot_queue()
515 		wl_tree_add(e, &ubi->used);  in serve_prot_queue()
582 static int schedule_erase(struct ubi_device *ubi, struct ubi_wl_entry *e,  in schedule_erase()  argument
587 	ubi_assert(e);  in schedule_erase()
590 	       e->pnum, e->ec, torture);  in schedule_erase()
597 	wl_wrk->e = e;  in schedule_erase()
615 static int do_sync_erase(struct ubi_device *ubi, struct ubi_wl_entry *e,  in do_sync_erase()  argument
620 	dbg_wl("sync erase of PEB %i", e->pnum);  in do_sync_erase()
626 	wl_wrk->e = e;  in do_sync_erase()
1031 	struct ubi_wl_entry *e = wl_wrk->e;  local
1032 	int pnum = e->pnum;
1038 		dbg_wl("cancel erasure of PEB %d EC %d", pnum, e->ec);
1040 		wl_entry_destroy(ubi, e);
1045 	       pnum, e->ec, wl_wrk->vol_id, wl_wrk->lnum);
1047 	err = sync_erase(ubi, e, wl_wrk->torture);
1053 		wl_tree_add(e, &ubi->free);
1076 		err1 = schedule_erase(ubi, e, vol_id, lnum, 0);
1084 	wl_entry_destroy(ubi, e);
1170 	struct ubi_wl_entry *e;  local
1180 	e = ubi->lookuptbl[pnum];
1181 	if (e == ubi->move_from) {
1194 	} else if (e == ubi->move_to) {
1211 		if (in_wl_tree(e, &ubi->used)) {
1212 			self_check_in_wl_tree(ubi, e, &ubi->used);
1213 			rb_erase(&e->u.rb, &ubi->used);
1214 		} else if (in_wl_tree(e, &ubi->scrub)) {
1215 			self_check_in_wl_tree(ubi, e, &ubi->scrub);
1216 			rb_erase(&e->u.rb, &ubi->scrub);
1217 		} else if (in_wl_tree(e, &ubi->erroneous)) {
1218 			self_check_in_wl_tree(ubi, e, &ubi->erroneous);
1219 			rb_erase(&e->u.rb, &ubi->erroneous);
1225 			err = prot_queue_del(ubi, e->pnum);
1237 	err = schedule_erase(ubi, e, vol_id, lnum, torture);
1240 		wl_tree_add(e, &ubi->used);
1260 	struct ubi_wl_entry *e;  local
1266 	e = ubi->lookuptbl[pnum];
1267 	if (e == ubi->move_from || in_wl_tree(e, &ubi->scrub) ||
1268 				   in_wl_tree(e, &ubi->erroneous)) {
1273 	if (e == ubi->move_to) {
1286 	if (in_wl_tree(e, &ubi->used)) {
1287 		self_check_in_wl_tree(ubi, e, &ubi->used);
1288 		rb_erase(&e->u.rb, &ubi->used);
1292 		err = prot_queue_del(ubi, e->pnum);
1301 	wl_tree_add(e, &ubi->scrub);
1382 	struct ubi_wl_entry *e;  local
1391 			e = rb_entry(rb, struct ubi_wl_entry, u.rb);
1395 				if (rb->rb_left == &e->u.rb)
1401 			wl_entry_destroy(ubi, e);
1497 	struct ubi_wl_entry *e;  local
1520 		e = kmem_cache_alloc(ubi_wl_entry_slab, GFP_KERNEL);
1521 		if (!e)
1524 		e->pnum = aeb->pnum;
1525 		e->ec = aeb->ec;
1526 		ubi->lookuptbl[e->pnum] = e;
1527 		if (schedule_erase(ubi, e, aeb->vol_id, aeb->lnum, 0)) {
1528 			wl_entry_destroy(ubi, e);
1539 		e = kmem_cache_alloc(ubi_wl_entry_slab, GFP_KERNEL);
1540 		if (!e)
1543 		e->pnum = aeb->pnum;
1544 		e->ec = aeb->ec;
1545 		ubi_assert(e->ec >= 0);
1547 		wl_tree_add(e, &ubi->free);
1550 		ubi->lookuptbl[e->pnum] = e;
1559 			e = kmem_cache_alloc(ubi_wl_entry_slab, GFP_KERNEL);
1560 			if (!e)
1563 			e->pnum = aeb->pnum;
1564 			e->ec = aeb->ec;
1565 			ubi->lookuptbl[e->pnum] = e;
1569 				       e->pnum, e->ec);
1570 				wl_tree_add(e, &ubi->used);
1573 				       e->pnum, e->ec);
1574 				wl_tree_add(e, &ubi->scrub);
1588 			e = ubi->fm->e[i];
1589 			ubi->lookuptbl[e->pnum] = e;
1633 	struct ubi_wl_entry *e, *tmp;  local
1636 		list_for_each_entry_safe(e, tmp, &ubi->pq[i], u.list) {
1637 			list_del(&e->u.list);
1638 			wl_entry_destroy(ubi, e);
1714 				 struct ubi_wl_entry *e, struct rb_root *root)  argument
1719 	if (in_wl_tree(e, root))
1723 		e->pnum, e->ec, root);
1737 			    struct ubi_wl_entry *e)  argument
1747 			if (p == e)
1751 		e->pnum, e->ec);
1758 	struct ubi_wl_entry *e;  local
1760 	e = find_wl_entry(ubi, &ubi->free, WL_FREE_MAX_DIFF);
1761 	self_check_in_wl_tree(ubi, e, &ubi->free);
1764 	rb_erase(&e->u.rb, &ubi->free);
1766 	return e;
1807 	struct ubi_wl_entry *e;  local
1830 	e = wl_get_wle(ubi);
1831 	prot_queue_add(ubi, e);
1834 	err = ubi_self_check_all_ff(ubi, e->pnum, ubi->vid_hdr_aloffset,
1837 		ubi_err(ubi, "new PEB %d does not contain all 0xFF bytes", e->pnum);
1841 	return e->pnum;