Home
last modified time | relevance | path

Searched refs:entries_address_ascending (Results 1 – 6 of 6) sorted by relevance

/external/oprofile/opjitconv/
Djitsymbol.c93 qsort(entries_address_ascending, entry_count, in resort_address()
98 if (entries_address_ascending[i]->vma) in resort_address()
104 memmove(&entries_address_ascending[0], in resort_address()
105 &entries_address_ascending[i], in resort_address()
114 memcpy(entries_symbols_ascending, entries_address_ascending, in resort_symbol()
125 entries_address_ascending = create_sorted_array(cmp_address); in create_arrays()
145 entries_address_ascending = (struct jitentry **) in insert_entry()
146 xrealloc(entries_address_ascending, in insert_entry()
149 entries_address_ascending[entry_count++] = entry; in insert_entry()
193 a = entries_address_ascending[i]; in invalidate_earlybirds()
[all …]
Dcreate_bfd.c46 e = entries_address_ascending[i]; in fill_symtab()
113 entries_address_ascending[start_idx]->vma; in create_text_section()
114 struct jitentry * ee = entries_address_ascending[end_idx]; in create_text_section()
125 entries_address_ascending[start_idx]->section = section; in create_text_section()
152 entries_address_ascending[start_idx]->vma; in fill_text_section_content()
157 e = entries_address_ascending[i]; in fill_text_section_content()
195 entry = entries_address_ascending[j]; in partition_sections()
196 pred = entries_address_ascending[j - 1]; in partition_sections()
229 if (entries_address_ascending[j]->section) { in fill_sections()
230 section = entries_address_ascending[i]->section; in fill_sections()
[all …]
Dconversion.c54 entries_symbols_ascending = entries_address_ascending = NULL; in op_jit_convert()
89 free(entries_address_ascending); in op_jit_convert()
Dopjitconv.h131 extern struct jitentry ** entries_address_ascending;
Dopjitconv.c69 struct jitentry ** entries_address_ascending; variable
/external/oprofile/
DTODO194 o We need a more dynamic structure to handle entries_address_ascending and