Lines Matching defs:rb_node
80 struct rb_node rb_node;
591 struct rb_node *node = wc->tree.rb_node;
597 e = container_of(node, struct wc_entry, rb_node);
602 e->rb_node.rb_left : e->rb_node.rb_right);
609 node = rb_next(&e->rb_node);
612 e = container_of(node, struct wc_entry, rb_node);
621 node = rb_prev(&e->rb_node);
623 node = rb_next(&e->rb_node);
626 e2 = container_of(node, struct wc_entry, rb_node);
636 struct rb_node **node = &wc->tree.rb_node, *parent = NULL;
639 e = container_of(*node, struct wc_entry, rb_node);
640 parent = &e->rb_node;
646 rb_link_node(&ins->rb_node, parent, node);
647 rb_insert_color(&ins->rb_node, &wc->tree);
655 rb_erase(&e->rb_node, &wc->tree);
661 struct rb_node **node = &wc->freetree.rb_node, *parent = NULL;
666 if (&e->rb_node < *node)
671 rb_link_node(&e->rb_node, parent, node);
672 rb_insert_color(&e->rb_node, &wc->freetree);
700 struct rb_node *next;
706 next = rb_next(&e->rb_node);
707 rb_erase(&e->rb_node, &wc->freetree);
710 wc->current_free = next ? container_of(next, struct wc_entry, rb_node) : NULL;
815 struct rb_node *rb_node = rb_prev(&e->rb_node);
817 if (rb_node) {
818 e2 = container_of(rb_node, struct wc_entry, rb_node);
867 struct rb_node *node = rb_next(&e->rb_node);
885 e = container_of(node, struct wc_entry, rb_node);
1425 struct rb_node *next = rb_next(&e->rb_node);
1428 f = container_of(next, struct wc_entry, rb_node);
1818 struct rb_node *node, *next_node;
1859 e = container_of(rb_first(&wc->tree), struct wc_entry, rb_node);
1868 node = rb_prev(&e->rb_node);
1870 f = container_of(node, struct wc_entry, rb_node);
1890 next_node = rb_next(&f->rb_node);
1893 g = container_of(next_node, struct wc_entry, rb_node);
1926 next_node = rb_next(&f->rb_node);
1928 g = container_of(next_node, struct wc_entry, rb_node);