154      * If we have a right-hand child, go down and then left as far as we can.  in rb_next()
165      * No right-hand children. Everything down and left is smaller than us,  in rb_next()
168      * parent, keep going up. First time it's a left-hand child of its  in rb_next()
257                  * the parent's right child (left rotate at parent).  in rb_insert_augmented()
282              * the parent's left child (right rotate at gparent).  in rb_insert_augmented()
325             /* Case 3 - left rotate at gparent */  in rb_insert_augmented()
365                  * Case 1 - left rotate at parent  in rb_erase_color()
451              * Case 4 - left rotate at parent + color flips  in rb_erase_color()
501                 /* Case 3 - left rotate at sibling */  in rb_erase_color()
764             IntervalTreeNode *left = rb_to_itree(tmp);  in interval_tree_subtree_search()  local
766             if (start <= left->subtree_last) {  in interval_tree_subtree_search()
768                  * Some nodes in left subtree satisfy Cond2.  in interval_tree_subtree_search()
775                 node = left;  in interval_tree_subtree_search()
852         /* Move up the tree until we come from a node's left child */  in interval_tree_iter_next()