Lines Matching +full:last +full:- +full:used

1 /* SPDX-License-Identifier: GPL-2.0 */
10 	unsigned long last;	/* Last location _in_ interval */  member
24 			 unsigned long start, unsigned long last);
28 			unsigned long start, unsigned long last);
31  * struct interval_tree_span_iter - Find used and unused spans.
34  * @start_used: Start of a used interval when is_hole == 0
35  * @last_used: Inclusive end of a used interval when is_hole == 0
36  * @is_hole: 0 == used, 1 == is_hole, -1 == done iteration
40  * a used, which is fully covered by nodes. Each iteration step toggles between
41  * hole and used until the entire range is covered. The returned spans always
44  * The iterator is greedy, it always returns the largest hole or used possible,
79 	return state->is_hole == -1;  in interval_tree_span_iter_done()