Lines Matching refs:entry_count
59 xmalloc(sizeof(struct jitentry *) * entry_count);
61 qsort(array, entry_count, sizeof(struct jitentry *), compare);
93 qsort(entries_address_ascending, entry_count,
96 // lower entry_count if entries are invalidated
97 for (i = 0; i < entry_count; ++i) {
103 entry_count -= i;
106 sizeof(struct jitentry *) * entry_count);
115 sizeof(struct jitentry *) * entry_count);
116 qsort(entries_symbols_ascending, entry_count,
123 max_entry_count = entry_count = count_entries();
133 if (entry_count == max_entry_count) {
149 entries_address_ascending[entry_count++] = entry;
192 for (i = 0; i < entry_count; i++) {
433 // entry_count can be incremented by split_entry() during the loop,
435 int loop_count = entry_count;
437 verbprintf(debug,"count=%i, scan overlaps...\n", entry_count);
530 for (j = 1; j < entry_count; j++) {
547 } while (j < entry_count);
551 qsort(entries_symbols_ascending, entry_count,
