Lines Matching full:range_t
8 range_t *array;
19 ranges->array = (range_t *)MALLOC(PARALLEL_ARRAY_SIZE*sizeof(range_t));
40 static inline int CONTAINS(range_t *container, range_t *contained) {
46 static inline int IN_RANGE(range_t *range, GElf_Off point) {
52 static inline int INTERSECT(range_t *left, range_t *right) {
61 range_t *left = (range_t *)l, *right = (range_t *)r;
80 range_t *left = (range_t *)l, *right = (range_t *)r;
106 range_t *left = (range_t *)l, *right = (range_t *)r;
124 void (*err_fn)(range_error_t, range_t *, range_t *),
130 ranges->array_length*sizeof(range_t));
142 qsort(ranges->array, ranges->num_ranges, sizeof(range_t), range_cmp);
147 range_t *find_range(range_list_t *ranges, GElf_Off value) {
158 range_t lookup;
162 (range_t *)bsearch(&lookup,
163 ranges->array, ranges->num_ranges, sizeof(range_t),
173 range_t *get_sorted_ranges(const range_list_t *ranges, int *num_ranges) {
189 range_t *left, range_t *right) {
217 range_t *left,
218 range_t *right)
253 range_t *ranges = get_sorted_ranges(input, &num_ranges);
271 user->ranges = (range_t *)MALLOC(user->num_ranges * sizeof(range_t));
294 range_t *r_ranges = get_sorted_ranges(r, &r_num_ranges);
298 range_t *s_ranges = get_sorted_ranges(s, &s_num_ranges);