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()
167      * Go up the tree; any time the ancestor is a right-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()
312                 /* Case 2 - right rotate at parent */  in rb_insert_augmented()
413                  * Case 3 - right rotate at sibling  in rb_erase_color()
475                 /* Case 1 - right rotate at parent */  in rb_erase_color()
513             /* Case 4 - right rotate at parent + color flips */  in rb_erase_color()
567              * Case 2: node's successor is its right child  in rb_erase_augmented()
582              * node's right child subtree  in rb_erase_augmented()
773                  * right of N can't satisfy Cond1 either.  in interval_tree_subtree_search()
842          * First, search right subtree if suitable  in interval_tree_iter_next()
845             IntervalTreeNode *right = rb_to_itree(rb);  in interval_tree_iter_next()  local
847             if (start <= right->subtree_last) {  in interval_tree_iter_next()
848                 return interval_tree_subtree_search(right, start, last);  in interval_tree_iter_next()