Home
last modified time | relevance | path

Searched refs:is_hole (Results 1 – 2 of 2) sorted by relevance

/lib/
A Dinterval_tree.c63 iter->is_hole = 1; in interval_tree_span_iter_first()
70 iter->is_hole = 1; in interval_tree_span_iter_first()
77 iter->is_hole = 0; in interval_tree_span_iter_first()
91 iter->is_hole = -1; in interval_tree_span_iter_next()
95 if (iter->is_hole) { in interval_tree_span_iter_next()
103 iter->is_hole = 0; in interval_tree_span_iter_next()
112 iter->is_hole = 1; in interval_tree_span_iter_next()
119 iter->is_hole = 1; in interval_tree_span_iter_next()
134 if (iter->is_hole == -1) in interval_tree_span_iter_advance()
139 iter->is_hole = -1; in interval_tree_span_iter_advance()
A Dinterval_tree_test.c206 int is_hole; in mas_cur_span() local
212 state->is_hole = mas_walk(mas) ? 0 : 1; in mas_cur_span()
223 is_hole = mas_next_range(mas, state->last_index) ? 0 : 1; in mas_cur_span()
225 } while (mas->status != ma_overflow && is_hole == state->is_hole); in mas_cur_span()
227 if (state->is_hole) { in mas_cur_span()
279 mas_span.is_hole = -1; in span_iteration_check()
285 WARN_ON_ONCE(span.is_hole != mas_span.is_hole); in span_iteration_check()
287 if (span.is_hole) { in span_iteration_check()

Completed in 4 milliseconds