161 		e1 = rb_entry(parent, struct ubi_wl_entry, u.rb);  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()
257 		e1 = rb_entry(p, struct ubi_wl_entry, u.rb);  in in_wl_tree()
317 	e = rb_entry(rb_first(root), struct ubi_wl_entry, u.rb);  in find_wl_entry()
324 		e1 = rb_entry(p, struct ubi_wl_entry, u.rb);  in find_wl_entry()
358 	first = rb_entry(rb_first(root), struct ubi_wl_entry, u.rb);  in find_mean_wl_entry()
359 	last = rb_entry(rb_last(root), struct ubi_wl_entry, u.rb);  in find_mean_wl_entry()
362 		e = rb_entry(root->rb_node, struct ubi_wl_entry, u.rb);  in find_mean_wl_entry()
398 	rb_erase(&e->u.rb, &ubi->free);  in wl_get_wle()
706 		rb_erase(&e1->u.rb, &ubi->used);
717 		e1 = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);
732 		rb_erase(&e1->u.rb, &ubi->used);
738 		e1 = rb_entry(rb_first(&ubi->scrub), struct ubi_wl_entry, u.rb);
744 		rb_erase(&e1->u.rb, &ubi->scrub);
1022 		e1 = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);
1261 			rb_erase(&e->u.rb, &ubi->used);
1264 			rb_erase(&e->u.rb, &ubi->scrub);
1267 			rb_erase(&e->u.rb, &ubi->erroneous);
1336 		rb_erase(&e->u.rb, &ubi->used);
1429 	struct rb_node *rb;  local
1432 	rb = root->rb_node;
1433 	while (rb) {
1434 		if (rb->rb_left)
1435 			rb = rb->rb_left;
1436 		else if (rb->rb_right)
1437 			rb = rb->rb_right;
1439 			e = rb_entry(rb, struct ubi_wl_entry, u.rb);
1441 			rb = rb_parent(rb);
1442 			if (rb) {
1443 				if (rb->rb_left == &e->u.rb)
1444 					rb->rb_left = NULL;
1446 					rb->rb_right = NULL;
1635 	ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) {
1636 		ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) {
1876 	rb_erase(&e->u.rb, &ubi->free);