Lines Matching defs:rb
155 e1 = rb_entry(parent, struct ubi_wl_entry, u.rb);
170 rb_link_node(&e->u.rb, parent, p);
171 rb_insert_color(&e->u.rb, root);
251 e1 = rb_entry(p, struct ubi_wl_entry, u.rb);
311 e = rb_entry(rb_first(root), struct ubi_wl_entry, u.rb);
318 e1 = rb_entry(p, struct ubi_wl_entry, u.rb);
352 first = rb_entry(rb_first(root), struct ubi_wl_entry, u.rb);
353 last = rb_entry(rb_last(root), struct ubi_wl_entry, u.rb);
356 e = rb_entry(root->rb_node, struct ubi_wl_entry, u.rb);
392 rb_erase(&e->u.rb, &ubi->free);
727 rb_erase(&e1->u.rb, &ubi->used);
738 e1 = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);
753 rb_erase(&e1->u.rb, &ubi->used);
759 e1 = rb_entry(rb_first(&ubi->scrub), struct ubi_wl_entry, u.rb);
765 rb_erase(&e1->u.rb, &ubi->scrub);
1009 e1 = rb_entry(rb_first(&ubi->used), struct ubi_wl_entry, u.rb);
1247 rb_erase(&e->u.rb, &ubi->used);
1250 rb_erase(&e->u.rb, &ubi->scrub);
1253 rb_erase(&e->u.rb, &ubi->erroneous);
1322 rb_erase(&e->u.rb, &ubi->used);
1415 struct rb_node *rb;
1418 rb = root->rb_node;
1419 while (rb) {
1420 if (rb->rb_left)
1421 rb = rb->rb_left;
1422 else if (rb->rb_right)
1423 rb = rb->rb_right;
1425 e = rb_entry(rb, struct ubi_wl_entry, u.rb);
1427 rb = rb_parent(rb);
1428 if (rb) {
1429 if (rb->rb_left == &e->u.rb)
1430 rb->rb_left = NULL;
1432 rb->rb_right = NULL;
1593 ubi_rb_for_each_entry(rb1, av, &ai->volumes, rb) {
1594 ubi_rb_for_each_entry(rb2, aeb, &av->root, u.rb) {
1801 rb_erase(&e->u.rb, &ubi->free);