Lines Matching full:left
162 /* Overlaps with the left side of the clearing range */ in range_tree_clear()
187 struct range_node *left; 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()
201 struct range_node *left; 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()
214 /* Do we have a left-adjacent range ? */ in range_tree_set()
215 left = range_it_iter_first(rt, start - 1, start - 1); in range_tree_set()
216 if (left && left->rn_last + 1 != start) in range_tree_set()
224 if (left && right) { in range_tree_set()
225 /* Combine left and right adjacent ranges */ in range_tree_set()
226 range_it_remove(left, rt); in range_tree_set()
228 left->rn_last = right->rn_last; in range_tree_set()
229 range_it_insert(left, rt); in range_tree_set()
233 } else if (left) { in range_tree_set()
234 /* Combine with the left range */ in range_tree_set()
235 range_it_remove(left, rt); in range_tree_set()
236 left->rn_last = last; in range_tree_set()
237 range_it_insert(left, rt); in range_tree_set()
245 left = bpf_mem_alloc(&bpf_global_ma, sizeof(struct range_node)); in range_tree_set()
247 if (!left) in range_tree_set()
249 left->rn_start = start; in range_tree_set()
250 left->rn_last = last; in range_tree_set()
251 range_it_insert(left, rt); in range_tree_set()