Lines Matching refs:tree
191 rb_move(&root, &ref->tree);
192 rb_tree_init(&ref->tree.rbr_tree, &active_rb_ops);
194 root = ref->tree;
195 ref->tree = RB_ROOT;
301 node = rb_tree_find_node(&ref->tree.rbr_tree, &idx);
308 p = &ref->tree.rb_node;
333 collision = rb_tree_insert_node(&ref->tree.rbr_tree, node);
337 rb_insert_color(&node->node, &ref->tree);
372 rb_tree_init(&ref->tree.rbr_tree, &active_rb_ops);
374 ref->tree = RB_ROOT;
445 /* Prevent reaping in case we malloc/wait while building the tree */
546 rbtree_postorder_for_each_entry_safe(it, n, &ref->tree, node) {
595 GEM_BUG_ON(!RB_EMPTY_ROOT(&ref->tree));
609 if (RB_EMPTY_ROOT(&ref->tree))
630 rb_tree_find_node_leq(&ref->tree.rbr_tree, &idx);
643 p = ref->tree.rb_node;
665 for (p = prev; p; p = rb_next2(&ref->tree, p)) {
698 rb_erase(p, &ref->tree); /* Hide from waits and sibling allocations */
813 collision = rb_tree_insert_node(&ref->tree.rbr_tree, node);
817 p = &ref->tree.rb_node;
830 rb_insert_color(&node->node, &ref->tree);