650 #define rb_to_itree(N)  container_of(N, IntervalTreeNode, rb)
657     if (node->rb.rb_left) {  in interval_tree_compute_max()
658         child = rb_to_itree(node->rb.rb_left);  in interval_tree_compute_max()
663     if (node->rb.rb_right) {  in interval_tree_compute_max()
664         child = rb_to_itree(node->rb.rb_right);  in interval_tree_compute_max()
676 static void interval_tree_propagate(RBNode *rb, RBNode *stop)  in interval_tree_propagate()  argument
678     while (rb != stop) {  in interval_tree_propagate()
679         IntervalTreeNode *node = rb_to_itree(rb);  in interval_tree_propagate()
683         rb = rb_parent(&node->rb);  in interval_tree_propagate()
726             link = &parent->rb.rb_left;  in interval_tree_insert()
728             link = &parent->rb.rb_right;  in interval_tree_insert()
734     rb_link_node(&node->rb, rb_parent, link);  in interval_tree_insert()
735     rb_insert_augmented_cached(&node->rb, root, leftmost,  in interval_tree_insert()
741     rb_erase_augmented_cached(&node->rb, root, &interval_tree_augment);  in interval_tree_remove()
762         RBNode *tmp = qatomic_read(&node->rb.rb_left);  in interval_tree_subtree_search()
783             tmp = qatomic_read(&node->rb.rb_right);  in interval_tree_subtree_search()
833     RBNode *rb, *prev;  in interval_tree_iter_next()  local
835     rb = qatomic_read(&node->rb.rb_right);  in interval_tree_iter_next()
840          *   rb == node->rb.rb_right  in interval_tree_iter_next()
844         if (rb) {  in interval_tree_iter_next()
845             IntervalTreeNode *right = rb_to_itree(rb);  in interval_tree_iter_next()
854             rb = rb_parent(&node->rb);  in interval_tree_iter_next()
855             if (!rb) {  in interval_tree_iter_next()
858             prev = &node->rb;  in interval_tree_iter_next()
859             node = rb_to_itree(rb);  in interval_tree_iter_next()
860             rb = qatomic_read(&node->rb.rb_right);  in interval_tree_iter_next()
861         } while (prev == rb);  in interval_tree_iter_next()
879            level, level + 1, dir, rb_is_red(&node->rb) ? "r" : "b",
882     if (node->rb.rb_left) {
883         debug_interval_tree_int(rb_to_itree(node->rb.rb_left), "<", level + 1);
885     if (node->rb.rb_right) {
886         debug_interval_tree_int(rb_to_itree(node->rb.rb_right), ">", level + 1);