Lines Matching full:last

8 #define LAST(node)  ((node)->last)  macro
12 		     START, LAST,, interval_tree)
22  * span of nodes. This makes nodes[0]->last the end of that contiguous used span
26  * next used span. A hole span is between nodes[0]->last and nodes[1]->start.
29  * nodes[0]->last and last_index.
40 		if (cur->last > state->nodes[0]->last)  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()
79 	iter->last_used = iter->nodes[0]->last;  in interval_tree_span_iter_first()
97 		iter->last_used = iter->nodes[0]->last;  in interval_tree_span_iter_next()
109 		iter->start_hole = iter->nodes[0]->last + 1;  in interval_tree_span_iter_next()
117 	iter->start_hole = iter->nodes[0]->last + 1;  in interval_tree_span_iter_next()