# include "irouts.h"
# include "irhooks.h"
# include "irgwalk.h"
+# include "iredges_t.h"
/**
* Indicates, whether additional data can be registered to graphs.
res = alloc_graph();
res->kind = k_ir_graph;
+ edges_init_graph(res);
+
/* inform statistics here, as blocks will be already build on this graph */
hook_new_graph(res, ent);
res->op_pin_state_pinned = op_pin_state_pinned;
res->outs_state = outs_none;
res->dom_state = dom_none;
- res->typeinfo_state = irg_typeinfo_none;
+ res->typeinfo_state = ir_typeinfo_none;
+ set_irp_typeinfo_inconsistent(); /* there is a new graph with typeinfo_none. */
res->loopinfo_state = loopinfo_none;
/*-- Type information for the procedure of the graph --*/
set_irn_visited(res->no_mem, -1);
res->phase_state = phase_high;
+
return res;
}
struct _obstack_chunk *p;
/*
- * checks wheater the ir_node pointer i on the obstack.
+ * checks weather the ir_node pointer is on the obstack.
* A more sophisticated check would test the "whole" ir_node
*/
for (p = irg->obst->chunk; p; p = p->prev) {
assert(0 <= n && n < irg->n_loc);
if (! irg->loc_descriptions)
- irg->loc_descriptions = xmalloc(sizeof(*irg->loc_descriptions) * irg->n_loc);
+ irg->loc_descriptions = xcalloc(sizeof(*irg->loc_descriptions), irg->n_loc);
irg->loc_descriptions[n] = description;
}