mtd/ubi/wl.c

508 		wl_tree_add(e, &ubi->used);  in serve_prot_queue()
696 	    (!ubi->used.rb_node && !ubi->scrub.rb_node)) {
708 		       !ubi->free.rb_node, !ubi->used.rb_node);
718 		e1 = find_anchor_wl_entry(&ubi->used);
725 		self_check_in_wl_tree(ubi, e1, &ubi->used);
726 		rb_erase(&e1->u.rb, &ubi->used);
737 		e1 = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);
751 		self_check_in_wl_tree(ubi, e1, &ubi->used);
752 		rb_erase(&e1->u.rb, &ubi->used);
877 		wl_tree_add(e2, &ubi->used);
928 		wl_tree_add(e1, &ubi->used);
998 		if (!ubi->used.rb_node || !ubi->free.rb_node)
1008 		e1 = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);
1244 		if (in_wl_tree(e, &ubi->used)) {
1245 			self_check_in_wl_tree(ubi, e, &ubi->used);
1246 			rb_erase(&e->u.rb, &ubi->used);
1273 		wl_tree_add(e, &ubi->used);
1319 	if (in_wl_tree(e, &ubi->used)) {
1320 		self_check_in_wl_tree(ubi, e, &ubi->used);
1321 		rb_erase(&e->u.rb, &ubi->used);
1536 	ubi->used = ubi->erroneous = ubi->free = ubi->scrub = RB_ROOT;
1607 				wl_tree_add(e, &ubi->used);
1655 	tree_destroy(ubi, &ubi->used);
1689 	tree_destroy(ubi, &ubi->used);