Lines Matching refs:node
95 interval_tree_insert(struct interval_tree_node *node,
100 collision = rb_tree_insert_node(&root->rb_root.rbr_tree, node);
101 KASSERT(collision == node);
105 interval_tree_remove(struct interval_tree_node *node,
109 rb_tree_remove_node(&root->rb_root.rbr_tree, node);
116 struct interval_tree_node *node;
118 node = rb_tree_find_node_geq(&root->rb_root.rbr_tree, &start);
119 if (node == NULL)
121 if (last < node->start)
123 KASSERT(node->start <= last);
124 KASSERT(node->last >= start);
126 return node;
136 struct interval_tree_node *node, unsigned long start, unsigned long last)
140 KASSERT(node != NULL);
141 next = rb_tree_iterate(&root->rb_root.rbr_tree, node, RB_DIR_RIGHT);