# include "array.h"
/* memset belongs to string.h */
# include "string.h"
+# include "irnode.h"
#if USE_EXPICIT_PHI_IN_STACK
/* A stack needed for the automatic Phi node construction in constructor
/*********************************************** */
/** privat interfaces, for professional use only */
+/* Constructs a Block with a fixed number of predecessors.*/
inline ir_node *
new_r_Block (ir_graph *irg, int arity, ir_node **in)
{
ir_node *res;
- res = new_ir_node (current_ir_graph, NULL, op_Block, mode_R, -1, NULL);
+ res = new_ir_node (current_ir_graph, NULL, op_Block, mode_R, arity, in);
+ irn_vrfy (res);
return res;
}
res = new_ir_node (irg, block, op_Start, mode_T, 0, NULL);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
res = new_ir_node (irg, block, op_End, mode_X, -1, NULL);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
/* GL I'm not sure whether we should optimize this guy. *
res = optimize (res); ??? */
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
res = new_ir_node (irg, block, op_Phi, mode, arity, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
assert (res->kind == k_ir_node);
assert (res->op == op_Phi);
res->mode = mode;
- res->visit = 0;
+ res->visited = 0;
res->link = NULL;
assert (arity >= 0);
/* ???!!! How to free the old in array?? */
#else
res = known = new_ir_node (irg, block, op_Phi, mode, ins, in);
#endif
- /* The in-array can contain NULLs. These were returned by get_r_value_internal
- if it reached the same block/definition on a second path.
+ /* The in-array can contain NULLs. These were returned by
+ get_r_value_internal if it reached the same block/definition on a
+ second path.
The NULLs are replaced by the node itself to simplify the test in the
next loop. */
for (i=0; i < ins; ++i)
res = known;
} else {
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
}
/* return the pointer to the Phi node. This node might be deallocated! */
res = new_ir_node (irg, block, op_Const, mode, 0, NULL);
res->attr.con = con;
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
#if 0
res = local_optimize_newby (res);
ir_node *res;
res = new_ir_node (irg, block, op_Id, mode, 1, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
ir_node *
-new_r_Proj (ir_graph *irg, ir_node *block, ir_node *arg, ir_mode *mode, long proj)
+new_r_Proj (ir_graph *irg, ir_node *block, ir_node *arg, ir_mode *mode,
+ long proj)
{
ir_node *in[1] = {arg};
ir_node *res;
res = new_ir_node (irg, block, op_Proj, mode, 1, in);
res->attr.proj = proj;
+
+ assert(res);
+ assert(get_Proj_pred(res));
+ assert(get_nodes_Block(get_Proj_pred(res)));
+
res = optimize (res);
- ir_vrfy (res);
+
+ irn_vrfy (res);
return res;
}
ir_node *res;
res = new_ir_node (irg, block, op_Conv, mode, 1, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
res = new_ir_node (irg, block, op_Tuple, mode_T, arity, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
ir_node *res;
res = new_ir_node (irg, block, op_Add, mode, 2, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
ir_node *res;
res = new_ir_node (irg, block, op_Sub, mode, 2, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
ir_node *res;
res = new_ir_node (irg, block, op_Minus, mode, 1, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
ir_node *res;
res = new_ir_node (irg, block, op_Mul, mode, 2, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
{
ir_node *in[3] = {memop, op1, op2};
ir_node *res;
- res = new_ir_node (irg, block, op_Quot, mode_T, 2, in);
+ res = new_ir_node (irg, block, op_Quot, mode_T, 3, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
{
ir_node *in[3] = {memop, op1, op2};
ir_node *res;
- res = new_ir_node (irg, block, op_DivMod, mode_T, 2, in);
+ res = new_ir_node (irg, block, op_DivMod, mode_T, 3, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
{
ir_node *in[3] = {memop, op1, op2};
ir_node *res;
- res = new_ir_node (irg, block, op_Div, mode_T, 2, in);
+ res = new_ir_node (irg, block, op_Div, mode_T, 3, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
{
ir_node *in[3] = {memop, op1, op2};
ir_node *res;
- res = new_ir_node (irg, block, op_Mod, mode_T, 2, in);
+ res = new_ir_node (irg, block, op_Mod, mode_T, 3, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
ir_node *res;
res = new_ir_node (irg, block, op_And, mode, 2, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
ir_node *res;
res = new_ir_node (irg, block, op_Or, mode, 2, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
ir_node *res;
res = new_ir_node (irg, block, op_Eor, mode, 2, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
ir_node *res;
res = new_ir_node (irg, block, op_Not, mode, 1, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
ir_node *res;
res = new_ir_node (irg, block, op_Shl, mode, 2, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
ir_node *res;
res = new_ir_node (irg, block, op_Shr, mode, 2, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
ir_node *res;
res = new_ir_node (irg, block, op_Shrs, mode, 2, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
ir_node *res;
res = new_ir_node (irg, block, op_Rot, mode, 2, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
ir_node *res;
res = new_ir_node (irg, block, op_Abs, mode, 1, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
ir_node *res;
res = new_ir_node (irg, block, op_Cmp, mode_T, 2, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
ir_node *res;
res = new_ir_node (irg, block, op_Jmp, mode_X, 0, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
ir_node *res;
res = new_ir_node (irg, block, op_Cond, mode_T, 1, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
set_Call_type(res, type);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
int r_arity;
r_arity = arity+1;
-
NEW_ARR_A (ir_node *, r_in, r_arity);
-
r_in[0] = store;
-
memcpy (&r_in[1], in, sizeof (ir_node *) * arity);
-
res = new_ir_node (irg, block, op_Return, mode_X, r_arity, r_in);
-
res = optimize (res);
-
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
res = new_ir_node (irg, block, op_Raise, mode_X, 2, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
res = new_ir_node (irg, block, op_Load, mode_T, 2, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
res = new_ir_node (irg, block, op_Store, mode_T, 3, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
res->attr.a.type = alloc_type;
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
res->attr.f = free_type;
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
res->attr.s.ent = ent;
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
res->attr.i.tori.typ = (type *)value;
}
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
res = new_ir_node (irg, block, op_Sync, mode_M, arity, in);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
ir_node *
-new_r_Bad (ir_node *block)
+new_r_Bad ()
{
return current_ir_graph->bad;
}
op_Start, mode_T, 0, NULL);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
op_End, mode_X, -1, NULL);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
+
return res;
}
res = new_ir_node (current_ir_graph, NULL, op_Block, mode_R, -1, NULL);
current_ir_graph->current_block = res;
res->attr.block.matured = 0;
- set_Block_block_visit(res, 0);
+ set_Block_block_visited(res, 0);
/* forget this optimization. use this only if mature !!!!
res = optimize (res); */
- ir_vrfy (res);
+ irn_vrfy (res);
/** create a new dynamic array, which stores all parameters in irnodes */
/** using the same obstack as the whole irgraph */
*/
/* case 4 -- already visited. */
- if (block->visit == ir_visited) return NULL;
+ if (get_irn_visited(block) == get_irg_visited(current_ir_graph)) return NULL;
/* visited the first time */
- block->visit = ir_visited;
+ set_irn_visited(block, get_irg_visited(current_ir_graph));
/* Get the local valid value */
res = block->attr.block.graph_arr[pos];
if (block->attr.block.matured) { /* case 3 */
/* The Phi has the same amount of ins as the corresponding block. */
- int ins = get_irn_arity(block); // ARR_LEN (block->in)-1;
+ int ins = get_irn_arity(block);
ir_node **nin;
NEW_ARR_A (ir_node *, nin, ins);
/* Traverse a chain of Phi nodes attached to this block and mature
these, too. **/
for (n = block->link; n; n=next) {
- ir_visited++;
+ inc_irg_visited(current_ir_graph);
next = n->link;
exchange (n, phi_merge (block, n->attr.phi0_pos, n->mode, nin, ins));
}
block->attr.block.matured = 1;
block = optimize_in_place(block);
- ir_vrfy(block);
+ irn_vrfy(block);
}
}
ir_node *
get_value (int pos, ir_mode *mode)
{
- ++ir_visited;
+ inc_irg_visited(current_ir_graph);
return get_r_value_internal (current_ir_graph->current_block, pos + 1, mode);
}
get_store (void)
{
/* GL: one could call get_value instead */
- ++ir_visited;
+ inc_irg_visited(current_ir_graph);
return get_r_value_internal (current_ir_graph->current_block, 0, mode_M);
}