| /build/tools/apriori/ |
| rangesort.h | 15 typedef struct range_t range_t; typedef in typeref:struct:range_t
16 struct range_t { struct
20 void (*err_fn)(range_error_t, range_t *, range_t *);
35 void (*err_fn)(range_error_t, range_t *, range_t *),
43 range_t *find_range(range_list_t *ranges, GElf_Off value);
45 range_t *get_sorted_ranges(const range_list_t *ranges, int *num_ranges);
52 range_t structures comprising each new contiguous range, as well as the
[all...] |
| rangesort.c | 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
[all...] |
| source.c | 8 range_t *range = find_range(source->sorted_sections, address);
|
| apriori.c | 128 range_t *left, range_t *right) {
[all...] |
| /external/elfcopy/ |
| rangesort.h | 15 typedef struct range_t range_t; typedef in typeref:struct:range_t
16 struct range_t { struct
20 void (*err_fn)(range_error_t, range_t *, range_t *);
35 void (*err_fn)(range_error_t, range_t *, range_t *),
43 range_t *find_range(range_list_t *ranges, GElf_Off value);
45 range_t *get_sorted_ranges(const range_list_t *ranges, int *num_ranges);
52 range_t structures comprising each new contiguous range, as well as the
[all...] |
| rangesort.c | 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
[all...] |
| elfcopy.c | 101 void handle_range_error(range_error_t err, range_t *left, range_t *right);
[all...] |
