Lines Matching full:last
108 #define LAST(node) ((node)->rn_last) macro
111 __rn_subtree_last, START, LAST, in INTERVAL_TREE_DEFINE() argument
131 range_it_iter_first(struct range_tree *rt, u32 start, u32 last) in range_it_iter_first() argument
133 return __range_it_iter_first(&rt->it_root, start, last); in range_it_iter_first()
139 u32 last = start + len - 1; in range_tree_clear() local
143 while ((rn = range_it_iter_first(rt, start, last))) { in range_tree_clear()
144 if (rn->rn_start < start && rn->rn_last > last) { in range_tree_clear()
158 new_rn->rn_start = last + 1; in range_tree_clear()
166 } else if (rn->rn_last > last) { in range_tree_clear()
169 rn->rn_start = last + 1; in range_tree_clear()
186 u32 last = start + len - 1; in is_range_tree_set() local
190 left = range_it_iter_first(rt, start, last); in is_range_tree_set()
191 if (left && left->rn_start <= start && left->rn_last >= last) in is_range_tree_set()
199 u32 last = start + len - 1; in range_tree_set() local
205 left = range_it_iter_first(rt, start, last); in range_tree_set()
206 if (left && left->rn_start <= start && left->rn_last >= last) in range_tree_set()
220 right = range_it_iter_first(rt, last + 1, last + 1); in range_tree_set()
221 if (right && right->rn_start != last + 1) in range_tree_set()
236 left->rn_last = last; in range_tree_set()
250 left->rn_last = last; in range_tree_set()