36 	struct interval_tree_node *cur = state->nodes[1];  in interval_tree_span_iter_next_gap()
38 	state->nodes[0] = cur;  in interval_tree_span_iter_next_gap()
40 		if (cur->last > state->nodes[0]->last)  in interval_tree_span_iter_next_gap()
41 			state->nodes[0] = cur;  in interval_tree_span_iter_next_gap()
44 	} while (cur && (state->nodes[0]->last >= cur->start ||  in interval_tree_span_iter_next_gap()
45 			 state->nodes[0]->last + 1 == cur->start));  in interval_tree_span_iter_next_gap()
46 	state->nodes[1] = cur;  in interval_tree_span_iter_next_gap()
56 	iter->nodes[0] = NULL;  in interval_tree_span_iter_first()
57 	iter->nodes[1] =  in interval_tree_span_iter_first()
59 	if (!iter->nodes[1]) {  in interval_tree_span_iter_first()
66 	if (iter->nodes[1]->start > first_index) {  in interval_tree_span_iter_first()
69 		iter->last_hole = iter->nodes[1]->start - 1;  in interval_tree_span_iter_first()
79 	iter->last_used = iter->nodes[0]->last;  in interval_tree_span_iter_first()
82 		iter->nodes[0] = NULL;  in interval_tree_span_iter_first()
83 		iter->nodes[1] = NULL;  in interval_tree_span_iter_first()
90 	if (!iter->nodes[0] && !iter->nodes[1]) {  in interval_tree_span_iter_next()
97 		iter->last_used = iter->nodes[0]->last;  in interval_tree_span_iter_next()
100 			iter->nodes[0] = NULL;  in interval_tree_span_iter_next()
101 			iter->nodes[1] = NULL;  in interval_tree_span_iter_next()
107 	if (!iter->nodes[1]) {  in interval_tree_span_iter_next()
109 		iter->start_hole = iter->nodes[0]->last + 1;  in interval_tree_span_iter_next()
111 		iter->nodes[0] = NULL;  in interval_tree_span_iter_next()
117 	iter->start_hole = iter->nodes[0]->last + 1;  in interval_tree_span_iter_next()
118 	iter->last_hole = iter->nodes[1]->start - 1;  in interval_tree_span_iter_next()