Lines Matching refs:ranges
4 /* This implements a simple sorted list of non-overlapping ranges. */
30 other ranges or contains them, or is contained by them, till we call
32 void add_unique_range_nosort(range_list_t *ranges,
38 /* Sorts the ranges. If there are overlapping ranges or ranges that contain
39 other ranges, it will cause the program to exit with a FAIL. */
40 range_list_t* sort_ranges(range_list_t *ranges);
43 range_t *find_range(range_list_t *ranges, GElf_Off value);
44 int get_num_ranges(const range_list_t *ranges);
45 range_t *get_sorted_ranges(const range_list_t *ranges, int *num_ranges);
46 GElf_Off get_last_address(const range_list_t *ranges);
48 /* This returns a range_list_t handle that contains ranges composed of the
49 adjacent ranges of the input range list. The user data of each range in
72 range_t *ranges;
78 ranges in s from those in r. For example, if r and s are as follows:
88 NOTE: Range s must contain ranges, which are fully contained by the span of
93 NOTE: In addition to the requirement above, range s must contain ranges,
94 each of which is a subrange of one of the ranges of r.
