Lines Matching full:jitentry
36 struct jitentry const * entry;
44 static void fill_entry_array(struct jitentry * entries[])
47 struct jitentry * entry;
53 /* create an array pointing to the jitentry structures which is sorted
56 static struct jitentry ** create_sorted_array(compare_symbol compare)
58 struct jitentry ** array =
59 xmalloc(sizeof(struct jitentry *) * entry_count);
61 qsort(array, entry_count, sizeof(struct jitentry *), compare);
69 struct jitentry * a0 = *(struct jitentry **) a;
70 struct jitentry * b0 = *(struct jitentry **) b;
78 struct jitentry * a0 = *(struct jitentry **) a;
79 struct jitentry * b0 = *(struct jitentry **) b;
94 sizeof(struct jitentry *), cmp_address);
106 sizeof(struct jitentry *) * entry_count);
115 sizeof(struct jitentry *) * entry_count);
117 sizeof(struct jitentry *), cmp_symbolname);
120 /* allocate, populate and sort the jitentry arrays */
129 /* add a new create jitentry to the array. mallocs new arrays if space is
131 static void insert_entry(struct jitentry * entry)
142 entries_symbols_ascending = (struct jitentry **)
144 sizeof(struct jitentry *) * max_entry_count);
145 entries_address_ascending = (struct jitentry **)
147 sizeof(struct jitentry *) * max_entry_count);
174 static void invalidate_entry(struct jitentry * e)
189 struct jitentry * a;
213 struct jitentry const * e;
243 static void split_entry(struct jitentry * split, struct jitentry const * keep)
252 struct jitentry * new_entry =
253 xcalloc(1, sizeof(struct jitentry));
319 struct jitentry const * keep = entries_address_ascending[keep_idx];
320 struct jitentry * e;
374 struct jitentry * e;
431 struct jitentry const * a;
526 struct jitentry * a;
527 struct jitentry * b;
552 sizeof(struct jitentry *), cmp_symbolname);
