qemu/util/interval-tree.c

650 #define rb_to_itree(N)  container_of(N, IntervalTreeNode, rb)
652 static bool interval_tree_compute_max(IntervalTreeNode *node, bool exit)  in interval_tree_compute_max()
654     IntervalTreeNode *child;  in interval_tree_compute_max()
679         IntervalTreeNode *node = rb_to_itree(rb);  in interval_tree_propagate()
689     IntervalTreeNode *old = rb_to_itree(rb_old);  in interval_tree_copy()
690     IntervalTreeNode *new = rb_to_itree(rb_new);  in interval_tree_copy()
697     IntervalTreeNode *old = rb_to_itree(rb_old);  in interval_tree_rotate()
698     IntervalTreeNode *new = rb_to_itree(rb_new);  in interval_tree_rotate()
711 void interval_tree_insert(IntervalTreeNode *node, IntervalTreeRoot *root)  in interval_tree_insert()
715     IntervalTreeNode *parent;  in interval_tree_insert()
739 void interval_tree_remove(IntervalTreeNode *node, IntervalTreeRoot *root)  in interval_tree_remove()
753 static IntervalTreeNode *interval_tree_subtree_search(IntervalTreeNode *node,  in interval_tree_subtree_search()
764             IntervalTreeNode *left = rb_to_itree(tmp);  in interval_tree_subtree_search()
795 IntervalTreeNode *interval_tree_iter_first(IntervalTreeRoot *root,  in interval_tree_iter_first()
798     IntervalTreeNode *node, *leftmost;  in interval_tree_iter_first()
830 IntervalTreeNode *interval_tree_iter_next(IntervalTreeNode *node,  in interval_tree_iter_next()
845             IntervalTreeNode *right = rb_to_itree(rb);  in interval_tree_iter_next()
875 static void debug_interval_tree_int(IntervalTreeNode *node,
890 void debug_interval_tree(IntervalTreeNode *node);
891 void debug_interval_tree(IntervalTreeNode *node)