** Authors: Martin Trapp, Christian Schaefer
**
** ircons.c: basic and more detailed irnode constructors
-** store, block and parameter administration ,
+** store, block and parameter administration.
** Adapted to extended FIRM nodes (exceptions...) and commented
** by Goetz Lindenmaier
*/
+/* $Id$ */
+
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif
+
+# include "irgraph_t.h"
+# include "irnode_t.h"
+# include "irmode_t.h"
# include "ircons.h"
# include "common.h"
# include "irvrfy.h"
# include "irop.h"
-# include "iropt.h"
+# include "iropt_t.h"
# include "irgmod.h"
# include "array.h"
/* memset belongs to string.h */
#if USE_EXPICIT_PHI_IN_STACK
/* A stack needed for the automatic Phi node construction in constructor
- Phi_in. */
+ Phi_in. Redefinition in irgraph.c!! */
struct Phi_in_stack {
ir_node **stack;
int pos;
};
+typedef struct Phi_in_stack Phi_in_stack;
#endif
-/*********************************************** */
+/*** ******************************************** */
/** privat interfaces, for professional use only */
-
+/* Constructs a Block with a fixed number of predecessors.
+ Does not set current_block. Can not be used with automatic
+ Phi node construction. */
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 (irg, NULL, op_Block, mode_R, arity, in);
+ set_Block_matured(res, 1);
+ set_Block_block_visited(res, 0);
+ 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);
- return res;
-}
-
-/* Creates a Phi node with 0 predecessors */
-inline ir_node *
-new_r_Phi0 (ir_graph *irg, ir_node *block, ir_mode *mode)
-{
- ir_node *res;
-
- res = new_ir_node (irg, block, op_Phi, mode, 0, NULL);
-
- /* 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);
- return res;
-}
-
-/* This is a stack used for allocating and deallocating nodes in
- new_r_Phi_in. The original implementation used the obstack
- to model this stack, now it is explicit. This reduces side effects.
-*/
-#if USE_EXPICIT_PHI_IN_STACK
-Phi_in_stack *
-new_Phi_in_stack() {
- Phi_in_stack *res;
-
- res = (Phi_in_stack *) malloc ( sizeof (Phi_in_stack));
-
- res->stack = NEW_ARR_F (ir_node *, 1);
- res->pos = 0;
-
- return res;
-}
-
-void free_to_Phi_in_stack(ir_node *phi) {
- assert(get_irn_opcode(phi) == iro_Phi);
-
- if (ARR_LEN(current_ir_graph->Phi_in_stack->stack) ==
- current_ir_graph->Phi_in_stack->pos)
- ARR_APP1 (ir_node *, current_ir_graph->Phi_in_stack->stack, phi);
- else
- current_ir_graph->Phi_in_stack->stack[current_ir_graph->Phi_in_stack->pos] = phi;
-
- (current_ir_graph->Phi_in_stack->pos)++;
-}
-
-ir_node *
-alloc_or_pop_from_Phi_in_stack(ir_graph *irg, ir_node *block, ir_mode *mode,
- int arity, ir_node **in) {
- ir_node *res;
- ir_node **stack = current_ir_graph->Phi_in_stack->stack;
- int pos = current_ir_graph->Phi_in_stack->pos;
-
-
- if (pos == 0) {
- /* We need to allocate a new node */
- res = new_ir_node (irg, block, op_Phi, mode, arity, in);
- } else {
- /* reuse the old node and initialize it again. */
- res = stack[pos-1];
-
- assert (res->kind == k_ir_node);
- assert (res->op == op_Phi);
- res->mode = mode;
- res->visit = 0;
- res->link = NULL;
- assert (arity >= 0);
- /* ???!!! How to free the old in array?? */
- res->in = NEW_ARR_D (ir_node *, irg->obst, (arity+1));
- res->in[0] = block;
- memcpy (&res->in[1], in, sizeof (ir_node *) * arity);
-
- (current_ir_graph->Phi_in_stack->pos)--;
- }
- return res;
-}
-#endif
-
-
-/* Creates a Phi node with a given, fixed array **in of predecessors.
- If the Phi node is unnecessary, as the same value reaches the block
- through all control flow paths, it is eliminated and the value
- returned directly. This constructor is only intended for use in
- the automatic Phi node generation triggered by get_value or mature.
- The implementation is quite tricky and depends on the fact, that
- the nodes are allocated on a stack:
- The in array contains predecessors and NULLs. The NULLs appear,
- if get_r_value_internal, that computed the predecessors, reached
- the same block on two paths. In this case the same value reaches
- this block on both paths, there is no definition in between. We need
- not allocate a Phi where these path's merge, but we have to communicate
- this fact to the caller. This happens by returning a pointer to the
- node the caller _will_ allocate. (Yes, we predict the address. We can
- do so because the nodes are allocated on the obstack.) The caller then
- finds a pointer to itself and, when this routine is called again,
- eliminates itself.
- */
-inline ir_node *
-new_r_Phi_in (ir_graph *irg, ir_node *block, ir_mode *mode,
- ir_node **in, int ins)
-{
- int i;
- ir_node *res, *known;
-
- /* allocate a new node on the obstack.
- This can return a node to which some of the pointers in the in-array
- already point.
- Attention: the constructor copies the in array, i.e., the later changes
- to the array in this routine do not affect the constructed node! If
- the in array contains NULLs, there will be missing predecessors in the
- returned node.
- Is this a possible internal state of the Phi node generation? */
-#if USE_EXPICIT_PHI_IN_STACK
- res = known = alloc_or_pop_from_Phi_in_stack(irg, block, mode, ins, in);
-#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 NULLs are replaced by the node itself to simplify the test in the
- next loop. */
- for (i=0; i < ins; ++i)
- if (in[i] == NULL) in[i] = res;
-
- /* This loop checks whether the Phi has more than one predecessor.
- If so, it is a real Phi node and we break the loop. Else the
- Phi node merges the same definition on several paths and therefore
- is not needed. */
- for (i=0; i < ins; ++i)
- {
- if (in[i]==res || in[i]==known) continue;
-
- if (known==res)
- known = in[i];
- else
- break;
- }
-
- /* i==ins: there is at most one predecessor, we don't need a phi node. */
- if (i==ins) {
-#if USE_EXPICIT_PHI_IN_STACK
- free_to_Phi_in_stack(res);
-#else
- obstack_free (current_ir_graph->obst, res);
-#endif
- res = known;
- } else {
- res = optimize (res);
- ir_vrfy (res);
- }
+ irn_vrfy (res);
- /* return the pointer to the Phi node. This node might be deallocated! */
+ /* Memory Phis in endless loops must be kept alive.
+ As we can't distinguish these easily we keep all of them alive. */
+ if ((res->op == op_Phi) && (mode == mode_M))
+ add_End_keepalive(irg->end, res);
return res;
}
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 *
+new_r_defaultProj (ir_graph *irg, ir_node *block, ir_node *arg,
+ long max_proj)
+{
+ ir_node *res;
+ assert((arg->op==op_Cond) && (get_irn_mode(arg->in[1]) == mode_I));
+ arg->attr.c.kind = fragmentary;
+ arg->attr.c.default_proj = max_proj;
+ res = new_r_Proj (irg, block, arg, mode_X, max_proj);
+ return res;
+}
+
ir_node *
new_r_Conv (ir_graph *irg, ir_node *block, ir_node *op, ir_mode *mode)
{
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 *in[1] = {c};
ir_node *res;
res = new_ir_node (irg, block, op_Cond, mode_T, 1, in);
+ res->attr.c.kind = dense;
+ res->attr.c.default_proj = 0;
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
ir_node *
new_r_Call (ir_graph *irg, ir_node *block, ir_node *store,
- ir_node *callee, int arity, ir_node **in, type_method *type)
+ ir_node *callee, int arity, ir_node **in, type *type)
{
ir_node **r_in;
ir_node *res;
res = new_ir_node (irg, block, op_Call, mode_T, r_arity, r_in);
+ assert(is_method_type(type));
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;
}
{
ir_node *in[2] = {store, obj};
ir_node *res;
- res = new_ir_node (irg, block, op_Raise, mode_X, 2, in);
-
+ res = new_ir_node (irg, block, op_Raise, mode_T, 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;
}
inline ir_node *
-new_r_SymConst (ir_graph *irg, ir_node *block, type_or_id *value,
+new_r_SymConst (ir_graph *irg, ir_node *block, type_or_id_p value,
symconst_kind symkind)
{
ir_node *in[0] = {};
ir_node *res;
- res = new_ir_node (irg, block, op_SymConst, mode_I, 0, in);
+ ir_mode *mode;
+ if (symkind == linkage_ptr_info)
+ mode = mode_p;
+ else
+ mode = mode_I;
+ res = new_ir_node (irg, block, op_SymConst, mode, 0, in);
res->attr.i.num = symkind;
if (symkind == linkage_ptr_info) {
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;
}
-/***********************/
+/** ********************/
/** public interfaces */
/** construction tools */
+/****f* ircons/new_Start
+ *
+ * NAME
+ * new_Start -- create a new Start node in the current block
+ *
+ * SYNOPSIS
+ * s = new_Start(void);
+ * ir_node* new_Start(void);
+ *
+ * RESULT
+ * s - pointer to the created Start node
+ *
+ ****
+ */
ir_node *
new_Start (void)
{
op_Start, mode_T, 0, NULL);
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
return res;
}
new_End (void)
{
ir_node *res;
-
res = new_ir_node (current_ir_graph, current_ir_graph->current_block,
op_End, mode_X, -1, NULL);
-
res = optimize (res);
- ir_vrfy (res);
+ irn_vrfy (res);
+
return res;
}
+/* Constructs a Block with a fixed number of predecessors.
+ Does set current_block. Can be used with automatic Phi
+ node construction. */
ir_node *
-new_Block (void)
+new_Block (int arity, ir_node **in)
{
ir_node *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);
-
- /* forget this optimization. use this only if mature !!!!
- res = optimize (res); */
- ir_vrfy (res);
+ res = new_r_Block (current_ir_graph, arity, in);
- /** create a new dynamic array, which stores all parameters in irnodes */
- /** using the same obstack as the whole irgraph */
+ /* Create and initialize array for Phi-node construction. */
res->attr.block.graph_arr = NEW_ARR_D (ir_node *, current_ir_graph->obst,
- current_ir_graph->params);
+ current_ir_graph->n_loc);
+ memset(res->attr.block.graph_arr, 0, sizeof(ir_node *)*current_ir_graph->n_loc);
+
+ res = optimize (res);
+ current_ir_graph->current_block = res;
- /** initialize the parameter array */
- memset(res->attr.block.graph_arr, 0, sizeof(ir_node *)*current_ir_graph->params);
+ irn_vrfy (res);
return res;
}
-inline ir_node *
-get_r_value_internal (ir_node *block, int pos, ir_mode *mode);
+/* ***********************************************************************/
+/* Methods necessary for automatic Phi node creation */
+/*
+ ir_node *phi_merge (ir_node *block, int pos, ir_mode *mode, ir_node **nin, int ins)
+ ir_node *get_r_value_internal (ir_node *block, int pos, ir_mode *mode);
+ ir_node *new_r_Phi0 (ir_graph *irg, ir_node *block, ir_mode *mode)
+ ir_node *new_r_Phi_in (ir_graph *irg, ir_node *block, ir_mode *mode, ir_node **in, int ins)
+
+ Call Graph: ( A ---> B == A "calls" B)
+
+ get_value mature_block
+ | |
+ | |
+ | |
+ | ---> phi_merge
+ | / / \
+ | / / \
+ \|/ / |/_ \
+ get_r_value_internal |
+ | |
+ | |
+ \|/ \|/
+ new_r_Phi0 new_r_Phi_in
+
+* *************************************************************************** */
-/** This function computes the predecessors for a real Phi node, and then
- allocates and returns this node. The routine called to allocate the
- node might optimize it away and return a real value, or even a pointer
- to a deallocated Phi node on top of the obstack!
- This function is called with an in-array of proper size. **/
-static inline ir_node *
-phi_merge (ir_node *block, int pos, ir_mode *mode, ir_node **nin, int ins)
+/* Creates a Phi node with 0 predecessors */
+inline ir_node *
+new_r_Phi0 (ir_graph *irg, ir_node *block, ir_mode *mode)
{
- ir_node *prevBlock, *res;
- int i;
+ ir_node *res;
+ res = new_ir_node (irg, block, op_Phi, mode, 0, NULL);
+ irn_vrfy (res);
+ return res;
+}
- /* This loop goes to all predecessor blocks of the block the Phi node is in
- and there finds the operands of the Phi node by calling
- get_r_value_internal. */
- for (i = 1; i <= ins; ++i) {
- assert (block->in[i]);
- prevBlock = block->in[i]->in[0]; /* go past control flow op to prev block */
- assert (prevBlock);
- nin[i-1] = get_r_value_internal (prevBlock, pos, mode);
- }
+/* There are two implementations of the Phi node construction. The first
+ is faster, but does not work for blocks with more than 2 predecessors.
+ The second works always but is slower and causes more unnecessary Phi
+ nodes.
+ Select the implementations by the following preprocessor flag set in
+ common/common.h: */
+#if USE_FAST_PHI_CONSTRUCTION
- /* After collecting all predecessors into the array nin a new Phi node
- with these predecessors is created. This constructor contains an
- optimization: If all predecessors of the Phi node are identical it
- returns the only operand instead of a new Phi node. If the value
- passes two different control flow edges without being defined, and
- this is the second path treated, a pointer to the node that will be
- allocated for the first path (recurstion) is returned. We already
- know the address of this node, as it is the next node to be allocated
- and will be placed on top of the obstack. (The obstack is a _stack_!) */
- res = new_r_Phi_in (current_ir_graph, block, mode, nin, ins);
+/* This is a stack used for allocating and deallocating nodes in
+ new_r_Phi_in. The original implementation used the obstack
+ to model this stack, now it is explicit. This reduces side effects.
+*/
+#if USE_EXPICIT_PHI_IN_STACK
+Phi_in_stack *
+new_Phi_in_stack() {
+ Phi_in_stack *res;
- /* Now we now the value "pos" and can enter it in the array with
- all known local variables. Attention: this might be a pointer to
- a node, that later will be allocated!!! See new_r_Phi_in.
- If this is called in mature, after some set_value in the same block,
- the proper value must not be overwritten:
- The call order
- get_value (makes Phi0, put's it into graph_arr)
- set_value (overwrites Phi0 in graph_arr)
- mature_block (upgrades Phi0, puts it again into graph_arr, overwriting
- the proper value.)
- fails. */
- if (!block->attr.block.graph_arr[pos]) {
- block->attr.block.graph_arr[pos] = res;
- } else {
- // printf(" value already computed by %s\n",
- // id_to_str(block->attr.block.graph_arr[pos]->op->name));
- }
+ res = (Phi_in_stack *) malloc ( sizeof (Phi_in_stack));
+
+ res->stack = NEW_ARR_F (ir_node *, 1);
+ res->pos = 0;
return res;
}
-/* This function returns the last definition of a variable. In case
- this variable was last defined in a previous block, Phi nodes are
- inserted. If the part of the firm graph containing the definition
- is not yet constructed, a dummy Phi node is returned. */
-inline ir_node *
-get_r_value_internal (ir_node *block, int pos, ir_mode *mode)
-{
- ir_node *res;
- /* There are 4 cases to treat.
+void
+free_Phi_in_stack(Phi_in_stack *s) {
+ DEL_ARR_F(s->stack);
+ free(s);
+}
- 1. The block is not mature and we visit it the first time. We can not
- create a proper Phi node, therefore a Phi0, i.e., a Phi without
- predecessors is returned. This node is added to the linked list (field
- "link") of the containing block to be completed when this block is
- matured. (Comlpletion will add a new Phi and turn the Phi0 into a Id
- node.)
+void free_to_Phi_in_stack(ir_node *phi) {
+ assert(get_irn_opcode(phi) == iro_Phi);
+
+ if (ARR_LEN(current_ir_graph->Phi_in_stack->stack) ==
+ current_ir_graph->Phi_in_stack->pos)
+ ARR_APP1 (ir_node *, current_ir_graph->Phi_in_stack->stack, phi);
+ else
+ current_ir_graph->Phi_in_stack->stack[current_ir_graph->Phi_in_stack->pos] = phi;
+
+ (current_ir_graph->Phi_in_stack->pos)++;
+}
+
+ir_node *
+alloc_or_pop_from_Phi_in_stack(ir_graph *irg, ir_node *block, ir_mode *mode,
+ int arity, ir_node **in) {
+ ir_node *res;
+ ir_node **stack = current_ir_graph->Phi_in_stack->stack;
+ int pos = current_ir_graph->Phi_in_stack->pos;
+
+
+ if (pos == 0) {
+ /* We need to allocate a new node */
+ res = new_ir_node (irg, block, op_Phi, mode, arity, in);
+ } else {
+ /* reuse the old node and initialize it again. */
+ res = stack[pos-1];
+
+ assert (res->kind == k_ir_node);
+ assert (res->op == op_Phi);
+ res->mode = mode;
+ res->visited = 0;
+ res->link = NULL;
+ assert (arity >= 0);
+ /* ???!!! How to free the old in array?? */
+ res->in = NEW_ARR_D (ir_node *, irg->obst, (arity+1));
+ res->in[0] = block;
+ memcpy (&res->in[1], in, sizeof (ir_node *) * arity);
+
+ (current_ir_graph->Phi_in_stack->pos)--;
+ }
+ return res;
+}
+#endif /* USE_EXPICIT_PHI_IN_STACK */
+
+/* Creates a Phi node with a given, fixed array **in of predecessors.
+ If the Phi node is unnecessary, as the same value reaches the block
+ through all control flow paths, it is eliminated and the value
+ returned directly. This constructor is only intended for use in
+ the automatic Phi node generation triggered by get_value or mature.
+ The implementation is quite tricky and depends on the fact, that
+ the nodes are allocated on a stack:
+ The in array contains predecessors and NULLs. The NULLs appear,
+ if get_r_value_internal, that computed the predecessors, reached
+ the same block on two paths. In this case the same value reaches
+ this block on both paths, there is no definition in between. We need
+ not allocate a Phi where these path's merge, but we have to communicate
+ this fact to the caller. This happens by returning a pointer to the
+ node the caller _will_ allocate. (Yes, we predict the address. We can
+ do so because the nodes are allocated on the obstack.) The caller then
+ finds a pointer to itself and, when this routine is called again,
+ eliminates itself.
+ */
+inline ir_node *
+new_r_Phi_in (ir_graph *irg, ir_node *block, ir_mode *mode,
+ ir_node **in, int ins)
+{
+ int i;
+ ir_node *res, *known;
+
+ /* allocate a new node on the obstack.
+ This can return a node to which some of the pointers in the in-array
+ already point.
+ Attention: the constructor copies the in array, i.e., the later changes
+ to the array in this routine do not affect the constructed node! If
+ the in array contains NULLs, there will be missing predecessors in the
+ returned node.
+ Is this a possible internal state of the Phi node generation? */
+#if USE_EXPICIT_PHI_IN_STACK
+ res = known = alloc_or_pop_from_Phi_in_stack(irg, block, mode, ins, in);
+#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 NULLs are replaced by the node itself to simplify the test in the
+ next loop. */
+ for (i=0; i < ins; ++i)
+ if (in[i] == NULL) in[i] = res;
+
+ /* This loop checks whether the Phi has more than one predecessor.
+ If so, it is a real Phi node and we break the loop. Else the
+ Phi node merges the same definition on several paths and therefore
+ is not needed. */
+ for (i=0; i < ins; ++i)
+ {
+ if (in[i]==res || in[i]==known) continue;
+
+ if (known==res)
+ known = in[i];
+ else
+ break;
+ }
+
+ /* i==ins: there is at most one predecessor, we don't need a phi node. */
+ if (i==ins) {
+#if USE_EXPICIT_PHI_IN_STACK
+ free_to_Phi_in_stack(res);
+#else
+ obstack_free (current_ir_graph->obst, res);
+#endif
+ res = known;
+ } else {
+ res = optimize (res);
+ irn_vrfy (res);
+ }
+
+ /* return the pointer to the Phi node. This node might be deallocated! */
+ return res;
+}
+
+inline ir_node *
+get_r_value_internal (ir_node *block, int pos, ir_mode *mode);
+
+/** This function computes the predecessors for a real Phi node, and then
+ allocates and returns this node. The routine called to allocate the
+ node might optimize it away and return a real value, or even a pointer
+ to a deallocated Phi node on top of the obstack!
+ This function is called with an in-array of proper size. **/
+static inline ir_node *
+phi_merge (ir_node *block, int pos, ir_mode *mode, ir_node **nin, int ins)
+{
+ ir_node *prevBlock, *res;
+ int i;
+
+ /* This loop goes to all predecessor blocks of the block the Phi node is in
+ and there finds the operands of the Phi node by calling
+ get_r_value_internal. */
+ for (i = 1; i <= ins; ++i) {
+ assert (block->in[i]);
+ prevBlock = block->in[i]->in[0]; /* go past control flow op to prev block */
+ assert (prevBlock);
+ nin[i-1] = get_r_value_internal (prevBlock, pos, mode);
+ }
+
+ /* After collecting all predecessors into the array nin a new Phi node
+ with these predecessors is created. This constructor contains an
+ optimization: If all predecessors of the Phi node are identical it
+ returns the only operand instead of a new Phi node. If the value
+ passes two different control flow edges without being defined, and
+ this is the second path treated, a pointer to the node that will be
+ allocated for the first path (recursion) is returned. We already
+ know the address of this node, as it is the next node to be allocated
+ and will be placed on top of the obstack. (The obstack is a _stack_!) */
+ res = new_r_Phi_in (current_ir_graph, block, mode, nin, ins);
+
+ /* Now we now the value for "pos" and can enter it in the array with
+ all known local variables. Attention: this might be a pointer to
+ a node, that later will be allocated!!! See new_r_Phi_in.
+ If this is called in mature, after some set_value in the same block,
+ the proper value must not be overwritten:
+ The call order
+ get_value (makes Phi0, put's it into graph_arr)
+ set_value (overwrites Phi0 in graph_arr)
+ mature_block (upgrades Phi0, puts it again into graph_arr, overwriting
+ the proper value.)
+ fails. */
+ if (!block->attr.block.graph_arr[pos]) {
+ block->attr.block.graph_arr[pos] = res;
+ } else {
+ /* printf(" value already computed by %s\n",
+ id_to_str(block->attr.block.graph_arr[pos]->op->name)); */
+ }
+
+ return res;
+}
+
+/* This function returns the last definition of a variable. In case
+ this variable was last defined in a previous block, Phi nodes are
+ inserted. If the part of the firm graph containing the definition
+ is not yet constructed, a dummy Phi node is returned. */
+inline ir_node *
+get_r_value_internal (ir_node *block, int pos, ir_mode *mode)
+{
+ ir_node *res;
+ /* There are 4 cases to treat.
+
+ 1. The block is not mature and we visit it the first time. We can not
+ create a proper Phi node, therefore a Phi0, i.e., a Phi without
+ predecessors is returned. This node is added to the linked list (field
+ "link") of the containing block to be completed when this block is
+ matured. (Completion will add a new Phi and turn the Phi0 into an Id
+ node.)
2. The value is already known in this block, graph_arr[pos] is set and we
visit the block the first time. We can return the value without
3. The block is mature and we visit it the first time. A Phi node needs
to be created (phi_merge). If the Phi is not needed, as all it's
operands are the same value reaching the block through different
- paths, it's optimizes away and the value itself is returned.
+ paths, it's optimized away and the value itself is returned.
4. The block is mature, and we visit it the second time. Now two
subcases are possible:
- * The value was computed completely the last time we were here.
- This is the case if there is no loop. We can return the proper value.
+ * The value was computed completely the last time we were here. This
+ is the case if there is no loop. We can return the proper value.
* The recursion that visited this node and set the flag did not
return yet. We are computing a value in a loop and need to
break the recursion without knowing the result yet.
+ @@@ strange case. Straight forward we would create a Phi before
+ starting the computation of it's predecessors. In this case we will
+ find a Phi here in any case. The problem is that this implementation
+ only creates a Phi after computing the predecessors, so that it is
+ hard to compute self references of this Phi. @@@
There is no simple check for the second subcase. Therefore we check
for a second visit and treat all such cases as the second subcase.
Anyways, the basic situation is the same: we reached a block
We return this information "Two paths, no Phi needed" by a very tricky
implementation that relies on the fact that an obstack is a stack and
will return a node with the same address on different allocations.
- Look also at phi_merge and get_r_phi_in to understand this.
+ Look also at phi_merge and new_r_phi_in to understand this.
+ @@@ Unfortunately this does not work, see testprogram
+ three_cfpred_example.
+
*/
/* 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);
/* If we get here, the frontend missed a use-before-definition error */
if (!res) {
/* Error Message */
- printf("Error: no value set\n");
+ printf("Error: no value set. Use of undefined variable. Initializing
+ to zero.\n");
assert (mode->code >= irm_f && mode->code <= irm_p);
res = new_r_Const (current_ir_graph, block, mode,
tarval_mode_null[mode->code]);
return res;
}
+#else /* if 0 */
+
+/** This is the simple algorithm. If first generates a Phi0, then
+ it starts the recursion. This causes an Id at the entry of
+ every block that has no definition of the value! **/
+
+#if USE_EXPICIT_PHI_IN_STACK
+/* Just dummies */
+Phi_in_stack * new_Phi_in_stack() { return NULL; }
+void free_Phi_in_stack(Phi_in_stack *s) { }
+#endif
+
+inline ir_node *
+new_r_Phi_in (ir_graph *irg, ir_node *block, ir_mode *mode,
+ ir_node **in, int ins)
+{
+ int i;
+ ir_node *res, *known;
+
+ /* Allocate a new node on the obstack. The allocation copies the in
+ array. */
+ res = new_ir_node (irg, block, op_Phi, mode, ins, in);
+
+ /* This loop checks whether the Phi has more than one predecessor.
+ If so, it is a real Phi node and we break the loop. Else the
+ Phi node merges the same definition on several paths and therefore
+ is not needed. Don't consider Bad nodes! */
+ known = res;
+ for (i=0; i < ins; ++i)
+ {
+ assert(in[i]);
+
+ if (in[i]==res || in[i]==known || is_Bad(in[i])) continue;
+
+ if (known==res)
+ known = in[i];
+ else
+ break;
+ }
+
+ /* i==ins: there is at most one predecessor, we don't need a phi node. */
+ if (i==ins) {
+ if (res != known) {
+ obstack_free (current_ir_graph->obst, res);
+ res = known;
+ } else {
+ /* A undefined value, e.g., in unreachable code. */
+ res = new_Bad();
+ }
+ } else {
+ res = optimize (res);
+ irn_vrfy (res);
+ /* Memory Phis in endless loops must be kept alive.
+ As we can't distinguish these easily we keep all of the alive. */
+ if ((res->op == op_Phi) && (mode == mode_M))
+ add_End_keepalive(irg->end, res);
+ }
+
+ return res;
+}
+
+inline ir_node *
+get_r_value_internal (ir_node *block, int pos, ir_mode *mode);
+
+#if PRECISE_EXC_CONTEXT
+static inline ir_node *
+phi_merge (ir_node *block, int pos, ir_mode *mode, ir_node **nin, int ins);
+
+ir_node **
+new_frag_arr (ir_node *n) {
+ ir_node **arr;
+ int opt;
+ arr = NEW_ARR_D (ir_node *, current_ir_graph->obst, current_ir_graph->n_loc);
+ memcpy(arr, current_ir_graph->current_block->attr.block.graph_arr,
+ sizeof(ir_node *)*current_ir_graph->n_loc);
+ /* turn off optimization before allocating Proj nodes, as res isn't
+ finished yet. */
+ opt = get_optimize(); set_optimize(0);
+ /* Here we rely on the fact that all frag ops have Memory as first result! */
+ if (get_irn_op(n) == op_Call)
+ arr[0] = new_Proj(n, mode_M, 3);
+ else
+ arr[0] = new_Proj(n, mode_M, 0);
+ set_optimize(opt);
+ current_ir_graph->current_block->attr.block.graph_arr[current_ir_graph->n_loc-1] = n;
+ return arr;
+}
+
+inline ir_node **
+get_frag_arr (ir_node *n) {
+ if (get_irn_op(n) == op_Call) {
+ return n->attr.call.frag_arr;
+ } else if (get_irn_op(n) == op_Alloc) {
+ return n->attr.a.frag_arr;
+ } else {
+ return n->attr.frag_arr;
+ }
+}
+
+inline ir_node *
+set_frag_value(ir_node **frag_arr, int pos, ir_node *val) {
+ if (!frag_arr[pos]) frag_arr[pos] = val;
+ if (frag_arr[current_ir_graph->n_loc - 1])
+ set_frag_value (get_frag_arr(frag_arr[current_ir_graph->n_loc - 1]), pos, val);
+}
+
+inline ir_node *
+get_r_frag_value_internal (ir_node *block, ir_node *cfOp, int pos, ir_mode *mode) {
+ ir_node *res;
+ ir_node **rem;
+ ir_node **frag_arr;
+
+ assert(is_fragile_op(cfOp) && (get_irn_op(cfOp) != op_Bad));
+
+ frag_arr = get_frag_arr(cfOp);
+ res = frag_arr[pos];
+ if (!res) {
+ if (block->attr.block.graph_arr[pos]) {
+ /* There was a set_value after the cfOp and no get_value before that
+ set_value. We must build a Phi node now. */
+ if (block->attr.block.matured) {
+ int ins = get_irn_arity(block);
+ ir_node **nin;
+ NEW_ARR_A (ir_node *, nin, ins);
+ res = phi_merge(block, pos, mode, nin, ins);
+ } else {
+ res = new_r_Phi0 (current_ir_graph, block, mode);
+ res->attr.phi0_pos = pos;
+ res->link = block->link;
+ block->link = res;
+ }
+ assert(res);
+ /* @@@ tested by Flo: set_frag_value(frag_arr, pos, res);
+ but this should be better: (remove comment if this works) */
+ /* It's a Phi, we can write this into all graph_arrs with NULL */
+ set_frag_value(block->attr.block.graph_arr, pos, res);
+ } else {
+ res = get_r_value_internal(block, pos, mode);
+ set_frag_value(block->attr.block.graph_arr, pos, res);
+ }
+ }
+ return res;
+}
+#endif
+
+/** This function allocates a dummy Phi node to break recursions,
+ computes the predecessors for the real phi node, and then
+ allocates and returns this node. The routine called to allocate the
+ node might optimize it away and return a real value.
+ This function is called with an in-array of proper size. **/
+static inline ir_node *
+phi_merge (ir_node *block, int pos, ir_mode *mode, ir_node **nin, int ins)
+{
+ ir_node *prevBlock, *prevCfOp, *res, *phi0;
+ int i;
+
+ /* If this block has no value at pos create a Phi0 and remember it
+ in graph_arr to break recursions.
+ Else we may not set graph_arr as there a later value is remembered. */
+ phi0 = NULL;
+ if (!block->attr.block.graph_arr[pos]) {
+ /* This is commented out as collapsing to Bads is no good idea.
+ Either we need an assert here, or we need to call a routine
+ that deals with this case as appropriate for the given language.
+ Right now a self referencing Id is created which will crash irg_vrfy().
+
+ Even if all variables are defined before use, it can happen that
+ we get to the start block, if a cond has been replaced by a tuple
+ (bad, jmp). As the start has a self referencing control flow edge,
+ we get a self referencing Id, which is hard to optimize away. We avoid
+ this by defining the value as a Bad node.
+ Returning a const with tarval_bad is a preliminary solution. In some
+ situations we might want a Warning or an Error. */
+
+ if (block == get_irg_start_block(current_ir_graph)) {
+ block->attr.block.graph_arr[pos] = new_Const(mode, tarval_bad);
+ /* We don't need to care about exception ops in the start block.
+ There are none by definition. */
+ return block->attr.block.graph_arr[pos];
+ } else {
+ phi0 = new_r_Phi0(current_ir_graph, block, mode);
+ block->attr.block.graph_arr[pos] = phi0;
+#if PRECISE_EXC_CONTEXT
+ /* Set graph_arr for fragile ops. Also here we should break recursion.
+ We could choose a cyclic path through an cfop. But the recursion would
+ break at some point. */
+ set_frag_value(block->attr.block.graph_arr, pos, phi0);
+#endif
+ }
+ }
+
+ /* This loop goes to all predecessor blocks of the block the Phi node
+ is in and there finds the operands of the Phi node by calling
+ get_r_value_internal. */
+ for (i = 1; i <= ins; ++i) {
+ prevCfOp = skip_Proj(block->in[i]);
+ assert (prevCfOp);
+ if (is_Bad(prevCfOp)) {
+ /* In case a Cond has been optimized we would get right to the start block
+ with an invalid definition. */
+ nin[i-1] = new_Bad();
+ continue;
+ }
+ prevBlock = block->in[i]->in[0]; /* go past control flow op to prev block */
+ assert (prevBlock);
+ if (!is_Bad(prevBlock)) {
+#if PRECISE_EXC_CONTEXT
+ if (is_fragile_op(prevCfOp) && (get_irn_op (prevCfOp) != op_Bad)) {
+ assert(get_r_frag_value_internal (prevBlock, prevCfOp, pos, mode));
+ nin[i-1] = get_r_frag_value_internal (prevBlock, prevCfOp, pos, mode);
+ } else
+#endif
+ nin[i-1] = get_r_value_internal (prevBlock, pos, mode);
+ } else {
+ nin[i-1] = new_Bad();
+ }
+ }
+
+ /* After collecting all predecessors into the array nin a new Phi node
+ with these predecessors is created. This constructor contains an
+ optimization: If all predecessors of the Phi node are identical it
+ returns the only operand instead of a new Phi node. */
+ res = new_r_Phi_in (current_ir_graph, block, mode, nin, ins);
+
+ /* In case we allocated a Phi0 node at the beginning of this procedure,
+ we need to exchange this Phi0 with the real Phi. */
+ if (phi0) {
+ exchange(phi0, res);
+ block->attr.block.graph_arr[pos] = res;
+ /* Don't set_frag_value as it does not overwrite. Doesn't matter, is
+ only an optimization. */
+ }
+
+ return res;
+}
+
+/* This function returns the last definition of a variable. In case
+ this variable was last defined in a previous block, Phi nodes are
+ inserted. If the part of the firm graph containing the definition
+ is not yet constructed, a dummy Phi node is returned. */
+inline ir_node *
+get_r_value_internal (ir_node *block, int pos, ir_mode *mode)
+{
+ ir_node *res;
+ /* There are 4 cases to treat.
+
+ 1. The block is not mature and we visit it the first time. We can not
+ create a proper Phi node, therefore a Phi0, i.e., a Phi without
+ predecessors is returned. This node is added to the linked list (field
+ "link") of the containing block to be completed when this block is
+ matured. (Comlpletion will add a new Phi and turn the Phi0 into an Id
+ node.)
+
+ 2. The value is already known in this block, graph_arr[pos] is set and we
+ visit the block the first time. We can return the value without
+ creating any new nodes.
+
+ 3. The block is mature and we visit it the first time. A Phi node needs
+ to be created (phi_merge). If the Phi is not needed, as all it's
+ operands are the same value reaching the block through different
+ paths, it's optimized away and the value itself is returned.
+
+ 4. The block is mature, and we visit it the second time. Now two
+ subcases are possible:
+ * The value was computed completely the last time we were here. This
+ is the case if there is no loop. We can return the proper value.
+ * The recursion that visited this node and set the flag did not
+ return yet. We are computing a value in a loop and need to
+ break the recursion. This case only happens if we visited
+ the same block with phi_merge before, which inserted a Phi0.
+ So we return the Phi0.
+ */
+
+ /* case 4 -- already visited. */
+ if (get_irn_visited(block) == get_irg_visited(current_ir_graph)) {
+ /* As phi_merge allocates a Phi0 this value is always defined. Here
+ is the critical difference of the two algorithms. */
+ assert(block->attr.block.graph_arr[pos]);
+ return block->attr.block.graph_arr[pos];
+ }
+
+ /* visited the first time */
+ set_irn_visited(block, get_irg_visited(current_ir_graph));
+
+ /* Get the local valid value */
+ res = block->attr.block.graph_arr[pos];
+
+ /* case 2 -- If the value is actually computed, return it. */
+ if (res) { return res; };
+
+ 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);
+ ir_node **nin;
+ NEW_ARR_A (ir_node *, nin, ins);
+
+ /* Phi merge collects the predecessors and then creates a node. */
+ res = phi_merge (block, pos, mode, nin, ins);
+
+ } else { /* case 1 */
+ /* The block is not mature, we don't know how many in's are needed. A Phi
+ with zero predecessors is created. Such a Phi node is called Phi0
+ node. The Phi0 is then added to the list of Phi0 nodes in this block
+ to be matured by mature_block later.
+ The Phi0 has to remember the pos of it's internal value. If the real
+ Phi is computed, pos is used to update the array with the local
+ values. */
+ res = new_r_Phi0 (current_ir_graph, block, mode);
+ res->attr.phi0_pos = pos;
+ res->link = block->link;
+ block->link = res;
+ }
+
+ /* If we get here, the frontend missed a use-before-definition error */
+ if (!res) {
+ /* Error Message */
+ printf("Error: no value set. Use of undefined variable. Initializing
+ to zero.\n");
+ assert (mode->code >= irm_f && mode->code <= irm_p);
+ res = new_r_Const (current_ir_graph, block, mode,
+ tarval_mode_null[mode->code]);
+ }
+
+ /* The local valid value is available now. */
+ block->attr.block.graph_arr[pos] = res;
+
+ return res;
+}
+
+#endif /* USE_FAST_PHI_CONSTRUCTION */
+
+/* ************************************************************************** */
+
/** Finalize a Block node, when all control flows are known. */
/** Acceptable parameters are only Block nodes. */
void
ir_node *next;
assert (get_irn_opcode(block) == iro_Block);
+ // assert (!get_Block_matured(block) && "Block already matured");
if (!get_Block_matured(block)) {
- /* turn the dynamic in-array into a static one. */
+ /* An array for building the Phi nodes. */
ins = ARR_LEN (block->in)-1;
NEW_ARR_A (ir_node *, nin, ins);
+ /* shouldn't we delete this array at the end of the procedure? @@@ memory leak? */
/* 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);
+ /* Now, as the block is a finished firm node, we can optimize it.
+ Since other nodes have been allocated since the block was created
+ we can not free the node on the obstack. Therefore we have to call
+ optimize_in_place.
+ Unfortunately the optimization does not change a lot, as all allocated
+ nodes refer to the unoptimized node.
+ We can call _2, as global cse has no effect on blocks. */
+ block = optimize_in_place_2(block);
+ irn_vrfy(block);
}
-
}
ir_node *
arg, mode, proj);
}
+ir_node *
+new_defaultProj (ir_node *arg, long max_proj)
+{
+ ir_node *res;
+ assert((arg->op==op_Cond) && (get_irn_mode(arg->in[1]) == mode_I));
+ arg->attr.c.kind = fragmentary;
+ arg->attr.c.default_proj = max_proj;
+ res = new_Proj (arg, mode_X, max_proj);
+ return res;
+}
+
ir_node *
new_Conv (ir_node *op, ir_mode *mode)
{
ir_node *
new_Quot (ir_node *memop, ir_node *op1, ir_node *op2)
{
- return new_r_Quot (current_ir_graph, current_ir_graph->current_block,
+ ir_node *res;
+ res = new_r_Quot (current_ir_graph, current_ir_graph->current_block,
memop, op1, op2);
+#if PRECISE_EXC_CONTEXT
+ if ((current_ir_graph->phase_state == phase_building) &&
+ (get_irn_op(res) == op_Quot)) /* Could be optimized away. */
+ res->attr.frag_arr = new_frag_arr(res);
+#endif
+
+ return res;
}
ir_node *
new_DivMod (ir_node *memop, ir_node *op1, ir_node *op2)
{
- return new_r_DivMod (current_ir_graph, current_ir_graph->current_block,
+ ir_node *res;
+ res = new_r_DivMod (current_ir_graph, current_ir_graph->current_block,
memop, op1, op2);
+#if PRECISE_EXC_CONTEXT
+ if ((current_ir_graph->phase_state == phase_building) &&
+ (get_irn_op(res) == op_DivMod)) /* Could be optimized away. */
+ res->attr.frag_arr = new_frag_arr(res);
+#endif
+
+ return res;
}
ir_node *
new_Div (ir_node *memop, ir_node *op1, ir_node *op2)
{
- return new_r_Div (current_ir_graph, current_ir_graph->current_block,
+ ir_node *res;
+ res = new_r_Div (current_ir_graph, current_ir_graph->current_block,
memop, op1, op2);
+#if PRECISE_EXC_CONTEXT
+ if ((current_ir_graph->phase_state == phase_building) &&
+ (get_irn_op(res) == op_Div)) /* Could be optimized away. */
+ res->attr.frag_arr = new_frag_arr(res);
+#endif
+
+ return res;
}
ir_node *
new_Mod (ir_node *memop, ir_node *op1, ir_node *op2)
{
- return new_r_Mod (current_ir_graph, current_ir_graph->current_block,
+ ir_node *res;
+ res = new_r_Mod (current_ir_graph, current_ir_graph->current_block,
memop, op1, op2);
+#if PRECISE_EXC_CONTEXT
+ if ((current_ir_graph->phase_state == phase_building) &&
+ (get_irn_op(res) == op_Mod)) /* Could be optimized away. */
+ res->attr.frag_arr = new_frag_arr(res);
+#endif
+
+ return res;
}
ir_node *
ir_node *
new_Call (ir_node *store, ir_node *callee, int arity, ir_node **in,
- type_method *type)
+ type *type)
{
- return new_r_Call (current_ir_graph, current_ir_graph->current_block,
+ ir_node *res;
+ res = new_r_Call (current_ir_graph, current_ir_graph->current_block,
store, callee, arity, in, type);
+#if PRECISE_EXC_CONTEXT
+ if ((current_ir_graph->phase_state == phase_building) &&
+ (get_irn_op(res) == op_Call)) /* Could be optimized away. */
+ res->attr.call.frag_arr = new_frag_arr(res);
+#endif
+
+ return res;
}
ir_node *
ir_node *
new_Load (ir_node *store, ir_node *addr)
{
- return new_r_Load (current_ir_graph, current_ir_graph->current_block,
+ ir_node *res;
+ res = new_r_Load (current_ir_graph, current_ir_graph->current_block,
store, addr);
+#if PRECISE_EXC_CONTEXT
+ if ((current_ir_graph->phase_state == phase_building) &&
+ (get_irn_op(res) == op_Load)) /* Could be optimized away. */
+ res->attr.frag_arr = new_frag_arr(res);
+#endif
+
+ return res;
}
ir_node *
new_Store (ir_node *store, ir_node *addr, ir_node *val)
{
- return new_r_Store (current_ir_graph, current_ir_graph->current_block,
+ ir_node *res;
+ res = new_r_Store (current_ir_graph, current_ir_graph->current_block,
store, addr, val);
+#if PRECISE_EXC_CONTEXT
+ if ((current_ir_graph->phase_state == phase_building) &&
+ (get_irn_op(res) == op_Store)) /* Could be optimized away. */
+ res->attr.frag_arr = new_frag_arr(res);
+#endif
+
+ return res;
}
ir_node *
new_Alloc (ir_node *store, ir_node *size, type *alloc_type,
where_alloc where)
{
- return new_r_Alloc (current_ir_graph, current_ir_graph->current_block,
+ ir_node *res;
+ res = new_r_Alloc (current_ir_graph, current_ir_graph->current_block,
store, size, alloc_type, where);
+#if PRECISE_EXC_CONTEXT
+ if ((current_ir_graph->phase_state == phase_building) &&
+ (get_irn_op(res) == op_Alloc)) /* Could be optimized away. */
+ res->attr.a.frag_arr = new_frag_arr(res);
+#endif
+
+ return res;
}
ir_node *
}
ir_node *
-new_SymConst (type_or_id *value, symconst_kind kind)
+new_SymConst (type_or_id_p value, symconst_kind kind)
{
return new_r_SymConst (current_ir_graph, current_ir_graph->current_block,
value, kind);
return current_ir_graph->bad;
}
-/*************************************************************************/
+/* ********************************************************************* */
/* Comfortable interface with automatic Phi node construction. */
/* (Uses also constructors of ?? interface, except new_Block. */
-/* add an adge to a jmp node */
+/* ********************************************************************* */
+
+/** Block construction **/
+/* immature Block without predecessors */
+ir_node *new_immBlock (void) {
+ ir_node *res;
+
+ assert(get_irg_phase_state (current_ir_graph) == phase_building);
+ /* creates a new dynamic in-array as length of in is -1 */
+ 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_visited(res, 0);
+
+ /* Create and initialize array for Phi-node construction. */
+ res->attr.block.graph_arr = NEW_ARR_D (ir_node *, current_ir_graph->obst,
+ current_ir_graph->n_loc);
+ memset(res->attr.block.graph_arr, 0, sizeof(ir_node *)*current_ir_graph->n_loc);
+
+ /* Immature block may not be optimized! */
+ irn_vrfy (res);
+
+ return res;
+}
+
+/* add an adge to a jmp/control flow node */
void
add_in_edge (ir_node *block, ir_node *jmp)
{
if (block->attr.block.matured) {
- printf("Error: Block already matured!\n");
+ assert(0 && "Error: Block already matured!\n");
}
else {
assert (jmp != NULL);
current_ir_graph->current_block = target;
}
-/****************************/
+/* ************************ */
/* parameter administration */
/* get a value from the parameter array from the current block by its index */
ir_node *
get_value (int pos, ir_mode *mode)
{
- ++ir_visited;
+ assert(get_irg_phase_state (current_ir_graph) == phase_building);
+ inc_irg_visited(current_ir_graph);
return get_r_value_internal (current_ir_graph->current_block, pos + 1, mode);
}
+
/* set a value at position pos in the parameter array from the current block */
inline void
set_value (int pos, ir_node *value)
{
+ assert(get_irg_phase_state (current_ir_graph) == phase_building);
current_ir_graph->current_block->attr.block.graph_arr[pos + 1] = value;
}
inline ir_node *
get_store (void)
{
+ assert(get_irg_phase_state (current_ir_graph) == phase_building);
/* 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);
}
inline void
set_store (ir_node *store)
{
+ assert(get_irg_phase_state (current_ir_graph) == phase_building);
/* GL: one could call set_value instead */
current_ir_graph->current_block->attr.block.graph_arr[0] = store;
}
-/*************************************************************************/
+inline void
+keep_alive (ir_node *ka)
+{
+ add_End_keepalive(current_ir_graph->end, ka);
+}
+
+/** Useful access routines **/
+/* Returns the current block of the current graph. To set the current
+ block use switch_block(). */
+ir_node *get_cur_block() {
+ return get_irg_current_block(current_ir_graph);
+}
+
+/* Returns the frame type of the current graph */
+type *get_cur_frame_type() {
+ return get_irg_frame_type(current_ir_graph);
+}
+
+
+/* ********************************************************************* */
/* initialize */
/* call once for each run of the library */
init_cons (void)
{
}
+
+/* call for each graph */
+void
+finalize_cons (ir_graph *irg) {
+ irg->phase_state = phase_high;
+}
projects / libfirm / blobdiff