98 		le = rb_entry(p, struct ubi_ltree_entry, rb);  in ltree_lookup()
164 			le1 = rb_entry(parent, struct ubi_ltree_entry, rb);  in ltree_add_entry()
179 		rb_link_node(&le->rb, parent, p);  in ltree_add_entry()
180 		rb_insert_color(&le->rb, &ubi->ltree);  in ltree_add_entry()
225 		rb_erase(&le->rb, &ubi->ltree);  in leb_read_unlock()
277 		rb_erase(&le->rb, &ubi->ltree);  in leb_write_trylock()
301 		rb_erase(&le->rb, &ubi->ltree);  in leb_write_unlock()
1299 	struct rb_node *rb;  in self_check_eba()  local
1339 		ubi_rb_for_each_entry(rb, aeb, &av->root, u.rb)  in self_check_eba()
1346 		ubi_rb_for_each_entry(rb, aeb, &av->root, u.rb)  in self_check_eba()
1391 	struct rb_node *rb;  in ubi_eba_init()  local
1423 		ubi_rb_for_each_entry(rb, aeb, &av->root, u.rb) {  in ubi_eba_init()