void compute_callgraph(void)
{
/* initialize */
free_callgraph();
foreach_irp_irg(i, irg) {
assert(get_irg_callee_info_state(irg) == irg_callee_info_consistent);
irg->callees = (cg_callee_entry **)new_pset(cg_callee_entry_cmp, 8);
irg->callers = (ir_graph **)new_pset(graph_cmp, 8);
//construct_cf_backedges(irg);
}
/**
* Process a call node.
*
* @param call A ir_node to be checked.
* @param callee The entity of the callee
* @param hmap The quadruple-set containing the calls with constant parameters
*/
static void process_call(ir_node *call, ir_entity *callee, q_set *hmap)
{
/* TODO
* Beware: We cannot clone variadic parameters as well as the
* last non-variadic one, which might be needed for the va_start()
* magic. */
/* In this for loop we collect the calls, that have
a constant parameter. */
size_t const n_params = get_Call_n_params(call);
for (size_t i = n_params; i-- > 0;) {
ir_node *const call_param = get_Call_param(call, i);
if (is_Const(call_param)) {
/* we have found a Call to collect and we save the information
* we need.*/
if (!hmap->map)
hmap->map = new_pset(entry_cmp, 8);
entry_t *const key = OALLOC(&hmap->obst, entry_t);
key->q.ent = callee;
key->q.pos = i;
key->q.tv = get_Const_tarval(call_param);
key->q.calls = NULL;
key->weight = 0.0F;
key->next = NULL;
/* Insert entry or get existing equivalent entry */
entry_t *const entry = (entry_t*)pset_insert(hmap->map, key, hash_entry(key));
/* Free memory if entry already is in set */
if (entry != key)
obstack_free(&hmap->obst, key);
/* add the call to the list */
if (!entry->q.calls) {
entry->q.calls = NEW_ARR_F(ir_node*, 1);
entry->q.calls[0] = call;
} else {
ARR_APP1(ir_node *, entry->q.calls, call);
}
}
