Lines Matching refs:used

515 		wl_tree_add(e, &ubi->used);  in serve_prot_queue()
670 	    (!ubi->used.rb_node && !ubi->scrub.rb_node)) {
682 		       !ubi->free.rb_node, !ubi->used.rb_node);
692 		e1 = find_anchor_wl_entry(&ubi->used);
699 		self_check_in_wl_tree(ubi, e1, &ubi->used);
700 		rb_erase(&e1->u.rb, &ubi->used);
711 		e1 = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);
725 		self_check_in_wl_tree(ubi, e1, &ubi->used);
726 		rb_erase(&e1->u.rb, &ubi->used);
851 		wl_tree_add(e2, &ubi->used);
902 		wl_tree_add(e1, &ubi->used);
972 		if (!ubi->used.rb_node || !ubi->free.rb_node)
982 		e1 = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);
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);
1240 		wl_tree_add(e, &ubi->used);
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);
1499 	ubi->used = ubi->erroneous = ubi->free = ubi->scrub = RB_ROOT;
1570 				wl_tree_add(e, &ubi->used);
1619 	tree_destroy(ubi, &ubi->used);
1653 	tree_destroy(ubi, &ubi->used);