Lines Matching refs:iter
43 void interval_tree_span_iter_first(struct interval_tree_span_iter *iter,
48 iter->first_index = first_index;
49 iter->last_index = last_index;
50 iter->nodes[0] = NULL;
51 iter->nodes[1] =
53 if (!iter->nodes[1]) {
55 iter->start_hole = first_index;
56 iter->last_hole = last_index;
57 iter->is_hole = 1;
60 if (iter->nodes[1]->start > first_index) {
62 iter->start_hole = first_index;
63 iter->last_hole = iter->nodes[1]->start - 1;
64 iter->is_hole = 1;
65 interval_tree_span_iter_next_gap(iter);
70 iter->start_used = first_index;
71 iter->is_hole = 0;
72 interval_tree_span_iter_next_gap(iter);
73 iter->last_used = iter->nodes[0]->last;
74 if (iter->last_used >= last_index) {
75 iter->last_used = last_index;
76 iter->nodes[0] = NULL;
77 iter->nodes[1] = NULL;
82 void interval_tree_span_iter_next(struct interval_tree_span_iter *iter)
84 if (!iter->nodes[0] && !iter->nodes[1]) {
85 iter->is_hole = -1;
89 if (iter->is_hole) {
90 iter->start_used = iter->last_hole + 1;
91 iter->last_used = iter->nodes[0]->last;
92 if (iter->last_used >= iter->last_index) {
93 iter->last_used = iter->last_index;
94 iter->nodes[0] = NULL;
95 iter->nodes[1] = NULL;
97 iter->is_hole = 0;
101 if (!iter->nodes[1]) {
103 iter->start_hole = iter->nodes[0]->last + 1;
104 iter->last_hole = iter->last_index;
105 iter->nodes[0] = NULL;
106 iter->is_hole = 1;
111 iter->start_hole = iter->nodes[0]->last + 1;
112 iter->last_hole = iter->nodes[1]->start - 1;
113 iter->is_hole = 1;
114 interval_tree_span_iter_next_gap(iter);
124 void interval_tree_span_iter_advance(struct interval_tree_span_iter *iter,
128 if (iter->is_hole == -1)
131 iter->first_index = new_index;
132 if (new_index > iter->last_index) {
133 iter->is_hole = -1;
138 if (iter->start_hole <= new_index && new_index <= iter->last_hole) {
139 iter->start_hole = new_index;
142 if (new_index == iter->last_hole + 1)
143 interval_tree_span_iter_next(iter);
145 interval_tree_span_iter_first(iter, itree, new_index,
146 iter->last_index);