# include "array.h"
# include "irbackedge_t.h"
# include "irflag_t.h"
+# include "iredges_t.h"
#if USE_EXPLICIT_PHI_IN_STACK
/* A stack needed for the automatic Phi node construction in constructor
return new_rd_Const_type (db, irg, block, mode, con, firm_unknown_type);
}
+ir_node *
+new_rd_Const_long (dbg_info* db, ir_graph *irg, ir_node *block, ir_mode *mode, long value)
+{
+ return new_rd_Const(db, irg, block, mode, new_tarval_from_long(value, mode));
+}
+
ir_node *
new_rd_Id (dbg_info* db, ir_graph *irg, ir_node *block, ir_node *val, ir_mode *mode)
{
ir_mode *mode, tarval *con) {
return new_rd_Const(NULL, irg, block, mode, con);
}
+
+ir_node *new_r_Const_long(ir_graph *irg, ir_node *block,
+ ir_mode *mode, long value) {
+ return new_rd_Const_long(NULL, irg, block, mode, value);
+}
+
+
ir_node *new_r_SymConst (ir_graph *irg, ir_node *block,
symconst_symbol value, symconst_kind symkind) {
return new_rd_SymConst(NULL, irg, block, value, symkind);
#if USE_EXPLICIT_PHI_IN_STACK
free_to_Phi_in_stack(res);
#else
+ edges_node_deleted(res, current_ir_graph);
obstack_free (current_ir_graph->obst, res);
#endif
res = known;
/* i==ins: there is at most one predecessor, we don't need a phi node. */
if (i == ins) {
if (res != known) {
+ edges_node_deleted(res, current_ir_graph);
obstack_free (current_ir_graph->obst, res);
if (is_Phi(known)) {
/* If pred is a phi node we want to optmize it: If loops are matured in a bad
}
ir_node *
+new_d_Const_long(dbg_info* db, ir_mode *mode, long value)
+{
+ return new_rd_Const_long(db, current_ir_graph, current_ir_graph->start_block, mode, value);
+}
+
+ ir_node *
new_d_Const_type (dbg_info* db, ir_mode *mode, tarval *con, type *tp)
{
return new_rd_Const_type(db, current_ir_graph, current_ir_graph->start_block,
return new_d_Const(NULL, mode, con);
}
+ir_node *new_Const_long(ir_mode *mode, long value)
+{
+ return new_d_Const_long(NULL, mode, value);
+}
+
ir_node *new_Const_type(tarval *con, type *tp) {
return new_d_Const_type(NULL, get_type_mode(tp), con, tp);
}