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()
697 		rb_erase(&e1->u.rb, &ubi->used);
708 		e1 = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);
723 		rb_erase(&e1->u.rb, &ubi->used);
729 		e1 = rb_entry(rb_first(&ubi->scrub), struct ubi_wl_entry, u.rb);
735 		rb_erase(&e1->u.rb, &ubi->scrub);
979 		e1 = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);
1218 			rb_erase(&e->u.rb, &ubi->used);
1221 			rb_erase(&e->u.rb, &ubi->scrub);
1224 			rb_erase(&e->u.rb, &ubi->erroneous);
1293 		rb_erase(&e->u.rb, &ubi->used);
1386 	struct rb_node *rb;  local
1389 	rb = root->rb_node;
1390 	while (rb) {
1391 		if (rb->rb_left)
1392 			rb = rb->rb_left;
1393 		else if (rb->rb_right)
1394 			rb = rb->rb_right;
1396 			e = rb_entry(rb, struct ubi_wl_entry, u.rb);
1398 			rb = rb_parent(rb);
1399 			if (rb) {
1400 				if (rb->rb_left == &e->u.rb)
1401 					rb->rb_left = NULL;
1403 					rb->rb_right = NULL;
1560 	ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) {
1561 		ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) {
1769 	rb_erase(&e->u.rb, &ubi->free);