Lines Matching defs:rb_node
83 struct rb_node rb_node;
611 struct rb_node *node = wc->tree.rb_node;
617 e = container_of(node, struct wc_entry, rb_node);
622 e->rb_node.rb_left : e->rb_node.rb_right);
629 node = rb_next(&e->rb_node);
633 e = container_of(node, struct wc_entry, rb_node);
642 node = rb_prev(&e->rb_node);
644 node = rb_next(&e->rb_node);
647 e2 = container_of(node, struct wc_entry, rb_node);
657 struct rb_node **node = &wc->tree.rb_node, *parent = NULL;
660 e = container_of(*node, struct wc_entry, rb_node);
661 parent = &e->rb_node;
667 rb_link_node(&ins->rb_node, parent, node);
668 rb_insert_color(&ins->rb_node, &wc->tree);
676 rb_erase(&e->rb_node, &wc->tree);
682 struct rb_node **node = &wc->freetree.rb_node, *parent = NULL;
688 if (&e->rb_node < *node)
693 rb_link_node(&e->rb_node, parent, node);
694 rb_insert_color(&e->rb_node, &wc->freetree);
722 struct rb_node *next;
729 next = rb_next(&e->rb_node);
730 rb_erase(&e->rb_node, &wc->freetree);
733 wc->current_free = next ? container_of(next, struct wc_entry, rb_node) : NULL;
838 struct rb_node *rb_node = rb_prev(&e->rb_node);
840 if (rb_node) {
841 e2 = container_of(rb_node, struct wc_entry, rb_node);
891 struct rb_node *node = rb_next(&e->rb_node);
909 e = container_of(node, struct wc_entry, rb_node);
1401 struct rb_node *next = rb_next(&e->rb_node);
1405 f = container_of(next, struct wc_entry, rb_node);
1948 struct rb_node *node, *next_node;
2011 e = container_of(rb_first(&wc->tree), struct wc_entry, rb_node);
2020 node = rb_prev(&e->rb_node);
2022 f = container_of(node, struct wc_entry, rb_node);
2040 next_node = rb_next(&f->rb_node);
2043 g = container_of(next_node, struct wc_entry, rb_node);
2075 next_node = rb_next(&f->rb_node);
2077 g = container_of(next_node, struct wc_entry, rb_node);