Lines Matching refs:used

515 		wl_tree_add(e, &ubi->used);  in serve_prot_queue()
667 	    (!ubi->used.rb_node && !ubi->scrub.rb_node)) {
679 		       !ubi->free.rb_node, !ubi->used.rb_node);
689 		e1 = find_anchor_wl_entry(&ubi->used);
696 		self_check_in_wl_tree(ubi, e1, &ubi->used);
697 		rb_erase(&e1->u.rb, &ubi->used);
708 		e1 = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);
722 		self_check_in_wl_tree(ubi, e1, &ubi->used);
723 		rb_erase(&e1->u.rb, &ubi->used);
848 		wl_tree_add(e2, &ubi->used);
899 		wl_tree_add(e1, &ubi->used);
969 		if (!ubi->used.rb_node || !ubi->free.rb_node)
979 		e1 = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);
1216 		if (in_wl_tree(e, &ubi->used)) {
1217 			self_check_in_wl_tree(ubi, e, &ubi->used);
1218 			rb_erase(&e->u.rb, &ubi->used);
1245 		wl_tree_add(e, &ubi->used);
1291 	if (in_wl_tree(e, &ubi->used)) {
1292 		self_check_in_wl_tree(ubi, e, &ubi->used);
1293 		rb_erase(&e->u.rb, &ubi->used);
1504 	ubi->used = ubi->erroneous = ubi->free = ubi->scrub = RB_ROOT;
1575 				wl_tree_add(e, &ubi->used);
1624 	tree_destroy(ubi, &ubi->used);
1658 	tree_destroy(ubi, &ubi->used);