655     uint64_t max = node->last;  in interval_tree_compute_max()
714     uint64_t start = node->start, last = node->last;  in interval_tree_insert()  local
722         if (parent->subtree_last < last) {  in interval_tree_insert()
723             parent->subtree_last = last;  in interval_tree_insert()
733     node->subtree_last = last;  in interval_tree_insert()
745  * Iterate over intervals intersecting [start;last]
747  * Note that a node's interval intersects [start;last] iff:
748  *   Cond1: node->start <= last
750  *   Cond2: start <= node->last
755                                                       uint64_t last)  in interval_tree_subtree_search()  argument
779         if (node->start <= last) {         /* Cond1 */  in interval_tree_subtree_search()
780             if (start <= node->last) {     /* Cond2 */  in interval_tree_subtree_search()
796                                            uint64_t start, uint64_t last)  in interval_tree_iter_first()  argument
811      * 'start' and largest 'last' in the tree. For the later, we  in interval_tree_iter_first()
813      * property, holds the largest value in its last-in-subtree.  in interval_tree_iter_first()
823     if (leftmost->start > last) {  in interval_tree_iter_first()
827     return interval_tree_subtree_search(node, start, last);  in interval_tree_iter_first()
831                                           uint64_t start, uint64_t last)  in interval_tree_iter_next()  argument
839          *   Cond1: node->start <= last  in interval_tree_iter_next()
848                 return interval_tree_subtree_search(right, start, last);  in interval_tree_iter_next()
863         /* Check if the node intersects [start;last] */  in interval_tree_iter_next()
864         if (last < node->start) {  /* !Cond1 */  in interval_tree_iter_next()
867         if (start <= node->last) { /* Cond2 */  in interval_tree_iter_next()
880            node->start, node->last, node->subtree_last);