154 		e1 = rb_entry(parent, struct ubi_wl_entry, u.rb);  in wl_tree_add()
169 	rb_link_node(&e->u.rb, parent, p);  in wl_tree_add()
170 	rb_insert_color(&e->u.rb, root);  in wl_tree_add()
250 		e1 = rb_entry(p, struct ubi_wl_entry, u.rb);  in in_wl_tree()
310 	e = rb_entry(rb_first(root), struct ubi_wl_entry, u.rb);  in find_wl_entry()
317 		e1 = rb_entry(p, struct ubi_wl_entry, u.rb);  in find_wl_entry()
351 	first = rb_entry(rb_first(root), struct ubi_wl_entry, u.rb);  in find_mean_wl_entry()
352 	last = rb_entry(rb_last(root), struct ubi_wl_entry, u.rb);  in find_mean_wl_entry()
355 		e = rb_entry(root->rb_node, struct ubi_wl_entry, u.rb);  in find_mean_wl_entry()
391 	rb_erase(&e->u.rb, &ubi->free);  in wl_get_wle()
726 		rb_erase(&e1->u.rb, &ubi->used);
737 		e1 = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);
752 		rb_erase(&e1->u.rb, &ubi->used);
758 		e1 = rb_entry(rb_first(&ubi->scrub), struct ubi_wl_entry, u.rb);
764 		rb_erase(&e1->u.rb, &ubi->scrub);
1008 		e1 = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);
1246 			rb_erase(&e->u.rb, &ubi->used);
1249 			rb_erase(&e->u.rb, &ubi->scrub);
1252 			rb_erase(&e->u.rb, &ubi->erroneous);
1321 		rb_erase(&e->u.rb, &ubi->used);
1414 	struct rb_node *rb;  local
1417 	rb = root->rb_node;
1418 	while (rb) {
1419 		if (rb->rb_left)
1420 			rb = rb->rb_left;
1421 		else if (rb->rb_right)
1422 			rb = rb->rb_right;
1424 			e = rb_entry(rb, struct ubi_wl_entry, u.rb);
1426 			rb = rb_parent(rb);
1427 			if (rb) {
1428 				if (rb->rb_left == &e->u.rb)
1429 					rb->rb_left = NULL;
1431 					rb->rb_right = NULL;
1592 	ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) {
1593 		ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) {
1800 	rb_erase(&e->u.rb, &ubi->free);