148 		e1 = rb_entry(parent, struct ubi_wl_entry, u.rb);  in wl_tree_add()
163 	rb_link_node(&e->u.rb, parent, p);  in wl_tree_add()
164 	rb_insert_color(&e->u.rb, root);  in wl_tree_add()
244 		e1 = rb_entry(p, struct ubi_wl_entry, u.rb);  in in_wl_tree()
281 		list_for_each_entry(p, &ubi->pq[i], u.list)  in in_pq()
305 	list_add_tail(&e->u.list, &ubi->pq[pq_tail]);  in prot_queue_add()
325 	e = rb_entry(rb_first(root), struct ubi_wl_entry, u.rb);  in find_wl_entry()
332 		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()
424 	list_del(&e->u.list);  in prot_queue_del()
510 	list_for_each_entry_safe(e, tmp, &ubi->pq[ubi->pq_head], u.list) {  in serve_prot_queue()
514 		list_del(&e->u.list);  in serve_prot_queue()
712 		rb_erase(&e1->u.rb, &ubi->used);
724 		e1 = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);
739 		rb_erase(&e1->u.rb, &ubi->used);
745 		e1 = rb_entry(rb_first(&ubi->scrub), struct ubi_wl_entry, u.rb);
751 		rb_erase(&e1->u.rb, &ubi->scrub);
1029 		e1 = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);
1279 			rb_erase(&e->u.rb, &ubi->used);
1282 			rb_erase(&e->u.rb, &ubi->scrub);
1285 			rb_erase(&e->u.rb, &ubi->erroneous);
1354 		rb_erase(&e->u.rb, &ubi->used);
1550 			rb_erase(&e->u.rb, &ubi->used);
1556 			rb_erase(&e->u.rb, &ubi->free);
1601 			e = rb_entry(rb, struct ubi_wl_entry, u.rb);
1605 				if (rb->rb_left == &e->u.rb)
1620 int ubi_thread(void *u)  argument
1623 	struct ubi_device *ubi = u;
1779 	list_for_each_entry_safe(aeb, tmp, &ai->erase, u.list) {
1789 	list_for_each_entry(aeb, &ai->free, u.list) {
1811 		ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) {
1838 	list_for_each_entry(aeb, &ai->fastmap, u.list) {
1927 		list_for_each_entry_safe(e, tmp, &ubi->pq[i], u.list) {
1928 			list_del(&e->u.list);
2050 	rb_erase(&e->u.rb, &ubi->free);