50 void interval_tree_span_iter_first(struct interval_tree_span_iter *iter,  in interval_tree_span_iter_first()  argument
55 	iter->first_index = first_index;  in interval_tree_span_iter_first()
56 	iter->last_index = last_index;  in interval_tree_span_iter_first()
57 	iter->nodes[0] = NULL;  in interval_tree_span_iter_first()
58 	iter->nodes[1] =  in interval_tree_span_iter_first()
60 	if (!iter->nodes[1]) {  in interval_tree_span_iter_first()
62 		iter->start_hole = first_index;  in interval_tree_span_iter_first()
63 		iter->last_hole = last_index;  in interval_tree_span_iter_first()
64 		iter->is_hole = 1;  in interval_tree_span_iter_first()
67 	if (iter->nodes[1]->start > first_index) {  in interval_tree_span_iter_first()
69 		iter->start_hole = first_index;  in interval_tree_span_iter_first()
70 		iter->last_hole = iter->nodes[1]->start - 1;  in interval_tree_span_iter_first()
71 		iter->is_hole = 1;  in interval_tree_span_iter_first()
72 		interval_tree_span_iter_next_gap(iter);  in interval_tree_span_iter_first()
77 	iter->start_used = first_index;  in interval_tree_span_iter_first()
78 	iter->is_hole = 0;  in interval_tree_span_iter_first()
79 	interval_tree_span_iter_next_gap(iter);  in interval_tree_span_iter_first()
80 	iter->last_used = iter->nodes[0]->last;  in interval_tree_span_iter_first()
81 	if (iter->last_used >= last_index) {  in interval_tree_span_iter_first()
82 		iter->last_used = last_index;  in interval_tree_span_iter_first()
83 		iter->nodes[0] = NULL;  in interval_tree_span_iter_first()
84 		iter->nodes[1] = NULL;  in interval_tree_span_iter_first()
89 void interval_tree_span_iter_next(struct interval_tree_span_iter *iter)  in interval_tree_span_iter_next()  argument
91 	if (!iter->nodes[0] && !iter->nodes[1]) {  in interval_tree_span_iter_next()
92 		iter->is_hole = -1;  in interval_tree_span_iter_next()
96 	if (iter->is_hole) {  in interval_tree_span_iter_next()
97 		iter->start_used = iter->last_hole + 1;  in interval_tree_span_iter_next()
98 		iter->last_used = iter->nodes[0]->last;  in interval_tree_span_iter_next()
99 		if (iter->last_used >= iter->last_index) {  in interval_tree_span_iter_next()
100 			iter->last_used = iter->last_index;  in interval_tree_span_iter_next()
101 			iter->nodes[0] = NULL;  in interval_tree_span_iter_next()
102 			iter->nodes[1] = NULL;  in interval_tree_span_iter_next()
104 		iter->is_hole = 0;  in interval_tree_span_iter_next()
108 	if (!iter->nodes[1]) {  in interval_tree_span_iter_next()
110 		iter->start_hole = iter->nodes[0]->last + 1;  in interval_tree_span_iter_next()
111 		iter->last_hole = iter->last_index;  in interval_tree_span_iter_next()
112 		iter->nodes[0] = NULL;  in interval_tree_span_iter_next()
113 		iter->is_hole = 1;  in interval_tree_span_iter_next()
118 	iter->start_hole = iter->nodes[0]->last + 1;  in interval_tree_span_iter_next()
119 	iter->last_hole = iter->nodes[1]->start - 1;  in interval_tree_span_iter_next()
120 	iter->is_hole = 1;  in interval_tree_span_iter_next()
121 	interval_tree_span_iter_next_gap(iter);  in interval_tree_span_iter_next()
131 void interval_tree_span_iter_advance(struct interval_tree_span_iter *iter,  in interval_tree_span_iter_advance()  argument
135 	if (iter->is_hole == -1)  in interval_tree_span_iter_advance()
138 	iter->first_index = new_index;  in interval_tree_span_iter_advance()
139 	if (new_index > iter->last_index) {  in interval_tree_span_iter_advance()
140 		iter->is_hole = -1;  in interval_tree_span_iter_advance()
145 	if (iter->start_hole <= new_index && new_index <= iter->last_hole) {  in interval_tree_span_iter_advance()
146 		iter->start_hole = new_index;  in interval_tree_span_iter_advance()
149 	if (new_index == iter->last_hole + 1)  in interval_tree_span_iter_advance()
150 		interval_tree_span_iter_next(iter);  in interval_tree_span_iter_advance()
152 		interval_tree_span_iter_first(iter, itree, new_index,  in interval_tree_span_iter_advance()
153 					      iter->last_index);  in interval_tree_span_iter_advance()