109 	for (i = 0; i != ARRAY_SIZE(iter->spans); i++) {  in interval_tree_double_span_iter_update()
110 		if (interval_tree_span_iter_done(&iter->spans[i])) {  in interval_tree_double_span_iter_update()
115 		if (iter->spans[i].is_hole) {  in interval_tree_double_span_iter_update()
116 			last_hole = min(last_hole, iter->spans[i].last_hole);  in interval_tree_double_span_iter_update()
121 		iter->start_used = iter->spans[i].start_used;  in interval_tree_double_span_iter_update()
122 		iter->last_used = min(iter->spans[i].last_used, last_hole);  in interval_tree_double_span_iter_update()
127 	iter->start_hole = iter->spans[0].start_hole;  in interval_tree_double_span_iter_update()
129 		min(iter->spans[0].last_hole, iter->spans[1].last_hole);  in interval_tree_double_span_iter_update()
141 	for (i = 0; i != ARRAY_SIZE(iter->spans); i++)  in interval_tree_double_span_iter_first()
142 		interval_tree_span_iter_first(&iter->spans[i], iter->itrees[i],  in interval_tree_double_span_iter_first()
153 	    iter->last_hole == iter->spans[0].last_index) {  in interval_tree_double_span_iter_next()
158 	for (i = 0; i != ARRAY_SIZE(iter->spans); i++)  in interval_tree_double_span_iter_next()
160 			&iter->spans[i], iter->itrees[i], iter->last_hole + 1);  in interval_tree_double_span_iter_next()