*
* Note that we use the terminology from Click's work here, which is different
* in some cases from Firm terminology. Especially, Click's type is a
- * Firm tarval, nevertheless we call it type here for "maximum compatibility".
+ * Firm tarval/entity, nevertheless we call it type here for "maximum compatibility".
*/
#ifdef HAVE_CONFIG_H
# include "config.h"
#include "irflag.h"
#include "ircons.h"
#include "list.h"
-#include "array.h"
#include "set.h"
#include "pmap.h"
#include "obstack.h"
#include "irouts.h"
#include "irgmod.h"
#include "debug.h"
+#include "error.h"
#include "tv_t.h"
#include "irprintf.h"
#include "irdump.h"
+/* define this to check that all type translations are monotone */
+#define VERIFY_MONOTONE
+
typedef struct node_t node_t;
typedef struct partition_t partition_t;
typedef struct opcode_key_t opcode_key_t;
struct opcode_key_t {
ir_opcode code; /**< The Firm opcode. */
ir_mode *mode; /**< The mode of all nodes in the partition. */
- long proj; /**< For Proj nodes, its proj number */
+ union {
+ long proj; /**< For Proj nodes, its proj number */
+ ir_entity *ent; /**< For Sel Nodes, its entity */
+ } u;
};
/**
struct node_t {
ir_node *node; /**< The IR-node itself. */
list_head node_list; /**< Double-linked list of entries. */
+ list_head cprop_list; /**< Double-linked partition.cprop list. */
partition_t *part; /**< points to the partition this node belongs to */
- node_t *cprop_next; /**< Next node on partition.cprop list. */
node_t *next; /**< Next node on local list (partition.touched, fallen). */
lattice_elem_t type; /**< The associated lattice element "type". */
int max_user_input; /**< Maximum input number of Def-Use edges. */
*/
struct partition_t {
list_head entries; /**< The head of partition node list. */
- node_t *cprop; /**< The partition.cprop list. */
+ list_head cprop; /**< The head of partition.cprop list. */
+ list_head split_list; /**< Double-linked list of entries that must be processed by split_by(). */
partition_t *wl_next; /**< Next entry in the work list if any. */
partition_t *touched_next; /**< Points to the next partition in the touched set. */
partition_t *cprop_next; /**< Points to the next partition in the cprop list. */
partition_t *cprop; /**< The constant propagation list. */
partition_t *touched; /**< the touched set. */
partition_t *initial; /**< The initial partition. */
-#ifdef DEBUG_libfirm
- partition_t *dbg_list; /**< List of all partitions. */
-#endif
set *opcode2id_map; /**< The opcodeMode->id map. */
pmap *type2id_map; /**< The type->id map. */
int end_idx; /**< -1 for local and 0 for global congruences. */
int lambda_input; /**< Captured argument for lambda_partition(). */
+#ifdef DEBUG_libfirm
+ partition_t *dbg_list; /**< List of all partitions. */
+#endif
} environment_t;
/** Type of the what function. */
#define get_irn_node(irn) ((node_t *)get_irn_link(irn))
#define set_irn_node(irn, node) set_irn_link(irn, node)
+/* we do NOT use tarval_unreachable here, instead we use Top for this purpose */
+#undef tarval_unreachable
+#define tarval_unreachable tarval_top
+
+
/** The debug module handle. */
DEBUG_ONLY(static firm_dbg_module_t *dbg;)
#define dump_all_partitions(env)
#endif
+#if defined(VERIFY_MONOTONE) && defined (DEBUG_libfirm)
+/**
+ * Verify that a type transition is monotone
+ */
+static void verify_type(const lattice_elem_t old_type, const lattice_elem_t new_type) {
+ if (old_type.tv == new_type.tv) {
+ /* no change */
+ return;
+ }
+ if (old_type.tv == tarval_top) {
+ /* from Top down-to is always allowed */
+ return;
+ }
+ if (old_type.tv == tarval_reachable) {
+ panic("verify_type(): wrong translation from %+F to %+F", old_type, new_type);
+ }
+ if (new_type.tv == tarval_bottom || new_type.tv == tarval_reachable) {
+ /* bottom reached */
+ return;
+ }
+ panic("verify_type(): wrong translation from %+F to %+F", old_type, new_type);
+}
+#else
+#define verify_type(old_type, new_type)
+#endif
+
/**
* Compare two pointer values of a listmap.
*/
* @return a hash value for the given opcode map entry
*/
static unsigned opcode_hash(const opcode_key_t *entry) {
- return (entry->mode - (ir_mode *)0) * 9 + entry->code + entry->proj * 3;
+ return (entry->mode - (ir_mode *)0) * 9 + entry->code + entry->u.proj * 3 + HASH_PTR(entry->u.ent);
} /* opcode_hash */
/**
const opcode_key_t *o2 = key;
(void) size;
- return o1->code != o2->code || o1->mode != o2->mode || o1->proj != o2->proj;
+ return o1->code != o2->code || o1->mode != o2->mode ||
+ o1->u.proj != o2->u.proj || o1->u.ent != o2->u.ent;
} /* cmp_opcode */
/**
if (n_outs > 1) {
qsort(&irn->out[1], n_outs, sizeof(irn->out[0]), cmp_def_use_edge);
}
- node->max_user_input = irn->out[n_outs + 1].pos;
+ node->max_user_input = irn->out[n_outs].pos;
} /* sort_irn_outs */
/**
partition_t *part = obstack_alloc(&env->obst, sizeof(*part));
INIT_LIST_HEAD(&part->entries);
- part->cprop = NULL;
+ INIT_LIST_HEAD(&part->cprop);
+ INIT_LIST_HEAD(&part->split_list);
part->wl_next = NULL;
part->touched_next = NULL;
part->cprop_next = NULL;
static node_t *create_partition_node(ir_node *irn, partition_t *part, environment_t *env) {
/* create a partition node and place it in the partition */
node_t *node = obstack_alloc(&env->obst, sizeof(*node));
- ir_mode *mode = get_irn_mode(irn);
INIT_LIST_HEAD(&node->node_list);
+ INIT_LIST_HEAD(&node->cprop_list);
node->node = irn;
node->part = part;
- node->cprop_next = NULL;
node->next = NULL;
- node->type.tv = (mode == mode_X || mode == mode_BB) ? tarval_unreachable : tarval_top;
+ node->type.tv = tarval_top;
node->max_user_input = 0;
node->next_edge = 0;
node->on_touched = 0;
} /* create_partition_node */
/**
- * Walker, initialize all Nodes' type to U or top and place
+ * Pre-Walker, init all Block-Phi lists.
+ */
+static void init_block_phis(ir_node *irn, void *env) {
+ (void) env;
+
+ if (is_Block(irn)) {
+ set_Block_phis(irn, NULL);
+ }
+}
+
+/**
+ * Post-Walker, initialize all Nodes' type to U or top and place
* all nodes into the TOP partition.
*/
static void create_initial_partitions(ir_node *irn, void *ctx) {
part->max_arity = arity;
if (node->max_user_input > part->max_user_inputs)
part->max_user_inputs = node->max_user_input;
+
+ if (is_Phi(irn)) {
+ add_Block_phi(get_nodes_block(irn), irn);
+ }
} /* create_initial_partitions */
/**
if (y->on_cprop == 0) {
partition_t *Y = y->part;
- y->cprop_next = Y->cprop;
- Y->cprop = y;
+ list_add_tail(&y->cprop_list, &Y->cprop);
y->on_cprop = 1;
DB((dbg, LEVEL_3, "Add %+F to part%u.cprop\n", y->node, Y->nr));
add_node_to_cprop(proj, env);
}
}
+
+ if (is_Block(y->node)) {
+ /* Due to the way we handle Phi's, we must place all Phis of a block on the list
+ * if someone placed the block. The Block is only placed if the reachability
+ * changes, and this must be re-evaluated in compute_Phi(). */
+ ir_node *phi;
+ for (phi = get_Block_phis(y->node); phi != NULL; phi = get_Phi_next(phi)) {
+ node_t *p = get_irn_node(phi);
+ add_node_to_cprop(p, env);
+ }
+ }
} /* add_node_to_cprop */
+/**
+ * Check whether a type is neither Top or a constant.
+ * Note: U is handled like Top here, R is a constant.
+ *
+ * @param type the type to check
+ */
+static int type_is_neither_top_nor_const(const lattice_elem_t type) {
+ if (is_tarval(type.tv)) {
+ if (type.tv == tarval_top)
+ return 0;
+ if (tarval_is_constant(type.tv))
+ return 0;
+ } else {
+ /* is a symconst */
+ return 0;
+ }
+ return 1;
+}
+
/**
* Split the partitions if caused by the first entry on the worklist.
*
y = get_irn_node(succ);
if (is_constant_type(y->type)) {
code = get_irn_opcode(succ);
- if (code == iro_Sub || (code == iro_Proj && is_Cmp(get_Proj_pred(succ))))
+ if (code == iro_Sub || code == iro_Cmp)
add_node_to_cprop(y, env);
}
/* Partitions of constants should not be split simply because their Nodes have unequal
functions or incongruent inputs. */
- if (y->type.tv == tarval_bottom &&
- (! is_Phi(x->node) || is_live_input(x->node, i))) {
+ if (type_is_neither_top_nor_const(y->type) &&
+ (! is_Phi(y->node) || is_live_input(y->node, i))) {
Y = y->part;
add_to_touched(Y, env);
add_to_partition_touched(y);
Z->on_touched = 0;
if (Z->n_nodes != Z->n_touched) {
+ DB((dbg, LEVEL_2, "Split part%d by touched\n", Z->nr));
split(Z, Z->touched, env);
}
/* Empty local Z.touched. */
*
* @param X the partition to split
* @param What a function returning an Id for every node of the partition X
- * @param P an flexible array to store the result partitions or NULL
+ * @param P a list head to store the result partitions
* @param env the environment
*
- * @return if P != NULL P will be filled with the resulting partitions and returned
+ * @return P
*/
-static partition_t **split_by_what(partition_t *X, what_func What,
- partition_t **P, environment_t *env) {
+static list_head *split_by_what(partition_t *X, what_func What,
+ list_head *P, environment_t *env) {
node_t *x, *S;
listmap_t map;
listmap_entry_t *iter;
S = iter->list;
/* Add SPLIT( X, S ) to P. */
+ DB((dbg, LEVEL_2, "Split part%d by what\n", X->nr));
R = split(X, S, env);
- if (P != NULL) {
- ARR_APP1(partition_t *, P, R);
- }
+ list_add(&R->split_list, P);
}
/* Add X to P. */
- if (P != NULL) {
- ARR_APP1(partition_t *, P, X);
- }
+ list_add(&X->split_list, P);
listmap_term(&map);
return P;
opcode_key_t key, *entry;
ir_node *irn = node->node;
- key.code = get_irn_opcode(irn);
- key.mode = get_irn_mode(irn);
- key.proj = is_Proj(irn) ? get_Proj_proj(irn) : 0;
+ key.code = get_irn_opcode(irn);
+ key.mode = get_irn_mode(irn);
+ key.u.proj = 0;
+ key.u.ent = NULL;
+
+ switch (get_irn_opcode(irn)) {
+ case iro_Proj:
+ key.u.proj = get_Proj_proj(irn);
+ break;
+ case iro_Sel:
+ key.u.ent = get_Sel_entity(irn);
+ break;
+ default:
+ break;
+ }
+
entry = set_insert(env->opcode2id_map, &key, sizeof(key), opcode_hash(&key));
return entry;
} /* lambda_opcode */
/** lambda n.(n[i].partition) */
static void *lambda_partition(const node_t *node, environment_t *env) {
+ ir_node *skipped = skip_Proj(node->node);
ir_node *pred;
node_t *p;
int i = env->lambda_input;
/* ignore the "control input" for non-pinned nodes
if we are running in GCSE mode */
- if (i < env->end_idx && get_irn_pinned(node->node) != op_pin_state_pinned)
+ if (i < env->end_idx && get_irn_pinned(skipped) != op_pin_state_pinned)
return NULL;
- pred = get_irn_n(node->node, i);
+ pred = i == -1 ? get_irn_n(skipped, i) : get_irn_n(node->node, i);
p = get_irn_node(pred);
return p->part;
* @param env the environment
*/
static void split_by(partition_t *X, environment_t *env) {
- partition_t **P = NEW_ARR_F(partition_t *, 0);
- int i, j, k;
+ list_head hP;
+ list_head *P = &hP;
+ int input;
+ INIT_LIST_HEAD(P);
+ DB((dbg, LEVEL_2, "WHAT = lambda n.(n.type) on part%d\n", X->nr));
P = split_by_what(X, lambda_type, P, env);
- for (i = ARR_LEN(P) - 1; i >= 0; --i) {
- partition_t *Y = P[i];
+ do {
+ partition_t *Y = list_entry(P->next, partition_t, split_list);
+ list_del(&Y->split_list);
if (Y->n_nodes > 1) {
lattice_elem_t type = get_partition_type(Y);
- /* we do not want split the TOP, unreachable or constant partitions */
- if (type.tv != tarval_top && type.tv != tarval_unreachable && !is_type_constant(type)) {
- partition_t **Q = NEW_ARR_F(partition_t *, 0);
+ /* we do not want split the TOP or constant partitions */
+ if (type.tv != tarval_top && !is_type_constant(type)) {
+ list_head hQ;
+ list_head *Q = &hQ;
+ INIT_LIST_HEAD(Q);
+ DB((dbg, LEVEL_2, "WHAT = lambda n.(n.opcode) on part%d\n", Y->nr));
Q = split_by_what(Y, lambda_opcode, Q, env);
- for (j = ARR_LEN(Q) - 1; j >= 0; --j) {
- partition_t *Z = Q[j];
-
- for (k = Z->max_arity - 1; k >= -1; --k) {
- if (Z->n_nodes > 1) {
- env->lambda_input = k;
- split_by_what(Z, lambda_partition, NULL, env);
+ do {
+ list_head hR, hS;
+ partition_t *Z = list_entry(Q->next, partition_t, split_list);
+ int max_arity = Z->max_arity;
+ list_head *R = &hR, *S = &hS, *T;
+
+ list_del(&Z->split_list);
+
+ if (Z->n_nodes > 1) {
+ INIT_LIST_HEAD(R);
+ INIT_LIST_HEAD(S);
+
+ /*
+ * BEWARE: during splitting by input 2 for instance we might
+ * create new partitions which are different by input 1, so collect
+ * them and split further.
+ */
+ list_add(&Z->split_list, R);
+ for (input = max_arity - 1; input >= -1; --input) {
+ do {
+ partition_t *Z_prime = list_entry(R->next, partition_t, split_list);
+
+ list_del(&Z_prime->split_list);
+ if (Z_prime->n_nodes > 1) {
+ env->lambda_input = input;
+ DB((dbg, LEVEL_2, "WHAT = lambda n.(n[%d].partition) on part%d\n", input, Z_prime->nr));
+ S = split_by_what(Z_prime, lambda_partition, S, env);
+ } else {
+ list_add(&Z_prime->split_list, S);
+ }
+ } while (!list_empty(R));
+ T = R;
+ R = S;
+ S = T;
}
}
- }
- DEL_ARR_F(Q);
+ } while (!list_empty(Q));
}
}
- }
- DEL_ARR_F(P);
+ } while (!list_empty(P));
} /* split_by */
/**
static void default_compute(node_t *node) {
int i;
ir_node *irn = node->node;
- tarval *top = tarval_top;
-
- if (get_irn_mode(node->node) == mode_X)
- top = tarval_unreachable;
-
- if (get_irn_pinned(irn) == op_pin_state_pinned) {
- node_t *block = get_irn_node(get_nodes_block(irn));
+ node_t *block = get_irn_node(get_nodes_block(irn));
- if (block->type.tv == tarval_unreachable) {
- node->type.tv = top;
- return;
- }
+ if (block->type.tv == tarval_unreachable) {
+ node->type.tv = tarval_top;
+ return;
}
/* if any of the data inputs have type top, the result is type top */
node_t *p = get_irn_node(pred);
if (p->type.tv == tarval_top) {
- node->type.tv = top;
+ node->type.tv = tarval_top;
return;
}
}
return;
}
}
- node->type.tv = tarval_unreachable;
+ node->type.tv = tarval_top;
} /* compute_Block */
+/**
+ * (Re-)compute the type for a Bad node.
+ *
+ * @param node the node
+ */
+static void compute_Bad(node_t *node) {
+ /* Bad nodes ALWAYS compute Top */
+ node->type.tv = tarval_top;
+} /* compute_Bad */
+
+/**
+ * (Re-)compute the type for an Unknown node.
+ *
+ * @param node the node
+ */
+static void compute_Unknown(node_t *node) {
+ /* While Unknown nodes compute Top, but this is dangerous:
+ * a if (unknown) would lead to BOTH control flows unreachable.
+ * While this is correct in the given semantics, it would destroy the Firm
+ * graph.
+ * For now, we compute bottom here.
+ */
+ node->type.tv = tarval_bottom;
+} /* compute_Unknown */
+
/**
* (Re-)compute the type for a Jmp node.
*
}
} /* compute_Add */
+/**
+ * Returns true if a type is a constant.
+ */
+static int is_con(const lattice_elem_t type) {
+ return is_entity(type.sym.entity_p) || tarval_is_constant(type.tv);
+}
+
/**
* (Re-)compute the type for a Sub. Special case: both nodes are congruent.
*
node->type.tv = tarval_top;
return;
}
-
if (a.tv == tarval_top || b.tv == tarval_top) {
node->type.tv = tarval_top;
- } else if (r->part == l->part) {
- ir_mode *mode = get_irn_mode(sub);
- node->type.tv = get_mode_null(mode);
- } else if (a.tv == tarval_bottom || b.tv == tarval_bottom) {
- node->type.tv = tarval_bottom;
- } else {
- if (is_tarval(a.tv) && is_tarval(b.tv))
+ } else if (is_con(a) && is_con(b)) {
+ if (is_tarval(a.tv) && is_tarval(b.tv)) {
node->type.tv = tarval_sub(a.tv, b.tv);
- else
+ } else if (is_tarval(a.tv) && tarval_is_null(a.tv)) {
+ node->type = b;
+ } else if (is_tarval(b.tv) && tarval_is_null(b.tv)) {
+ node->type = a;
+ } else {
+ node->type.tv = tarval_bottom;
+ }
+ } else if (r->part == l->part &&
+ (!mode_is_float(get_irn_mode(l->node)))) {
+ if (node->type.tv == tarval_top) {
+ /*
+ * BEWARE: a - a is NOT always 0 for floating Point values, as
+ * NaN op NaN = NaN, so we must check this here.
+ */
+ ir_mode *mode = get_irn_mode(sub);
+ node->type.tv = get_mode_null(mode);
+ } else {
node->type.tv = tarval_bottom;
+ }
+ } else {
+ node->type.tv = tarval_bottom;
}
} /* compute_Sub */
+/**
+ * (Re-)compute the type for Cmp.
+ *
+ * @param node the node
+ */
+static void compute_Cmp(node_t *node) {
+ ir_node *cmp = node->node;
+ node_t *l = get_irn_node(get_Cmp_left(cmp));
+ node_t *r = get_irn_node(get_Cmp_right(cmp));
+ lattice_elem_t a = l->type;
+ lattice_elem_t b = r->type;
+
+ if (a.tv == tarval_top || b.tv == tarval_top) {
+ node->type.tv = tarval_top;
+ } else if (is_con(a) && is_con(b)) {
+ /* both nodes are constants, we can propbably do something */
+ node->type.tv = tarval_b_true;
+ } else if (r->part == l->part) {
+ /* both nodes congruent, we can probably do something */
+ node->type.tv = tarval_b_true;
+ } else {
+ node->type.tv = tarval_bottom;
+ }
+} /* compute_Proj_Cmp */
+
/**
* (Re-)compute the type for a Proj(Cmp).
*
lattice_elem_t b = r->type;
pn_Cmp pnc = get_Proj_proj(proj);
- /*
- * BEWARE: a == a is NOT always True for floating Point values, as
- * NaN != NaN is defined, so we must check this here.
- */
- if (!mode_is_float(get_irn_mode(l->node)) || pnc == pn_Cmp_Lt || pnc == pn_Cmp_Gt) {
- if (a.tv == tarval_top || b.tv == tarval_top) {
- node->type.tv = tarval_top;
- } else if (r->part == l->part) {
+ if (a.tv == tarval_top || b.tv == tarval_top) {
+ node->type.tv = tarval_top;
+ } else if (is_con(a) && is_con(b)) {
+ default_compute(node);
+ } else if (r->part == l->part &&
+ (!mode_is_float(get_irn_mode(l->node)) || pnc == pn_Cmp_Lt || pnc == pn_Cmp_Gt)) {
+ if (node->type.tv == tarval_top) {
+ /*
+ * BEWARE: a == a is NOT always True for floating Point values, as
+ * NaN != NaN is defined, so we must check this here.
+ */
node->type.tv = new_tarval_from_long(pnc & pn_Cmp_Eq, mode_b);
- } else if (a.tv == tarval_bottom || b.tv == tarval_bottom) {
- node->type.tv = tarval_bottom;
} else {
- default_compute(node);
+ node->type.tv = tarval_bottom;
}
} else {
- default_compute(node);
+ node->type.tv = tarval_bottom;
}
} /* compute_Proj_Cmp */
static void compute_Proj(node_t *node) {
ir_node *proj = node->node;
ir_mode *mode = get_irn_mode(proj);
- ir_node *pred;
+ node_t *block = get_irn_node(get_nodes_block(skip_Proj(proj)));
+ ir_node *pred = get_Proj_pred(proj);
+
+ if (get_Proj_proj(proj) == pn_Start_X_initial_exec && is_Start(pred)) {
+ /* The initial_exec node is ALWAYS reachable. */
+ node->type.tv = tarval_reachable;
+ return;
+ }
+
+ if (block->type.tv == tarval_unreachable) {
+ /* a Proj in a unreachable Block stay Top */
+ node->type.tv = tarval_top;
+ return;
+ }
+ if (get_irn_node(pred)->type.tv == tarval_top) {
+ /* if the predecessor is Top, its Proj follow */
+ node->type.tv = tarval_top;
+ return;
+ }
if (mode == mode_M) {
/* mode M is always bottom */
return;
}
if (mode != mode_X) {
- ir_node *cmp = get_Proj_pred(proj);
- if (is_Cmp(cmp))
- compute_Proj_Cmp(node, cmp);
+ if (is_Cmp(pred))
+ compute_Proj_Cmp(node, pred);
else
default_compute(node);
return;
}
/* handle mode_X nodes */
- pred = get_Proj_pred(proj);
switch (get_irn_opcode(pred)) {
case iro_Start:
- /* the Proj_X from the Start is always reachable */
+ /* the Proj_X from the Start is always reachable.
+ However this is already handled at the top. */
node->type.tv = tarval_reachable;
break;
case iro_Cond:
}
} /* compute_Proj */
+/**
+ * (Re-)compute the type for a Confirm-Nodes.
+ *
+ * @param node the node
+ */
+static void compute_Confirm(node_t *node) {
+ ir_node *confirm = node->node;
+ node_t *pred = get_irn_node(get_Confirm_value(confirm));
+
+ if (get_Confirm_cmp(confirm) == pn_Cmp_Eq) {
+ node_t *bound = get_irn_node(get_Confirm_bound(confirm));
+
+ if (is_con(bound->type)) {
+ /* is equal to a constant */
+ node->type = bound->type;
+ return;
+ }
+ }
+ /* a Confirm is a copy OR a Const */
+ node->type = pred->type;
+} /* compute_Confirm */
+
/**
* (Re-)compute the type for a given node.
*
while (env->cprop != NULL) {
/* remove the first partition X from cprop */
- X = env->cprop;
+ X = env->cprop;
X->on_cprop = 0;
- env->cprop = X->cprop_next;
+ env->cprop = X->cprop_next;
+ DB((dbg, LEVEL_2, "Propagate type on part%d\n", X->nr));
fallen = NULL;
n_fallen = 0;
- while (X->cprop != NULL) {
+ while (! list_empty(&X->cprop)) {
/* remove the first Node x from X.cprop */
- x = X->cprop;
+ x = list_entry(X->cprop.next, node_t, cprop_list);
+ list_del(&x->cprop_list);
x->on_cprop = 0;
- X->cprop = x->cprop_next;
/* compute a new type for x */
old_type = x->type;
DB((dbg, LEVEL_3, "computing type of %+F\n", x->node));
compute(x);
if (x->type.tv != old_type.tv) {
+ verify_type(old_type, x->type);
DB((dbg, LEVEL_2, "node %+F has changed type from %+F to %+F\n", x->node, old_type, x->type));
if (x->on_fallen == 0) {
x->on_fallen = 1;
fallen = x;
++n_fallen;
+ DB((dbg, LEVEL_2, "Add node %+F to fallen\n", x->node));
}
for (i = get_irn_n_outs(x->node) - 1; i >= 0; --i) {
ir_node *succ = get_irn_out(x->node, i);
}
if (n_fallen > 0 && n_fallen != X->n_nodes) {
+ DB((dbg, LEVEL_2, "Splitting part%d by fallen\n", X->nr));
Y = split(X, fallen, env);
} else {
Y = X;
return get_first_node(part)->node;
}
return node->node;
+} /* get_leader */
+
+/**
+ * Return non-zero if the control flow predecessor node pred
+ * is the only reachable control flow exit of its block.
+ *
+ * @param pred the control flow exit
+ */
+static int can_exchange(ir_node *pred) {
+ if (is_Start(pred))
+ return 0;
+ else if (is_Jmp(pred))
+ return 1;
+ else if (get_irn_mode(pred) == mode_T) {
+ int i, k;
+
+ /* if the predecessor block has more than one
+ reachable outputs we cannot remove the block */
+ k = 0;
+ for (i = get_irn_n_outs(pred) - 1; i >= 0; --i) {
+ ir_node *proj = get_irn_out(pred, i);
+ node_t *node;
+
+ /* skip non-control flow Proj's */
+ if (get_irn_mode(proj) != mode_X)
+ continue;
+
+ node = get_irn_node(proj);
+ if (node->type.tv == tarval_reachable) {
+ if (++k > 1)
+ return 0;
+ }
+ }
+ return 1;
+ }
+ return 0;
}
/**
- * Post-Walker, apply the analysis results;
+ * Block Post-Walker, apply the analysis results on control flow by
+ * shortening Phi's and Block inputs.
*/
-static void apply_result(ir_node *irn, void *ctx) {
- node_t *node = get_irn_node(irn);
+static void apply_cf(ir_node *block, void *ctx) {
+ node_t *node = get_irn_node(block);
+ int i, j, k, n;
+ ir_node **ins, **in_X;
+ ir_node *phi, *next;
(void) ctx;
- if (is_Block(irn)) {
- if (irn == get_irg_end_block(current_ir_graph)) {
- /* the EndBlock is always reachable even if the analysis
- finds out the opposite :-) */
- return;
+ if (block == get_irg_end_block(current_ir_graph) ||
+ block == get_irg_start_block(current_ir_graph)) {
+ /* the EndBlock is always reachable even if the analysis
+ finds out the opposite :-) */
+ return;
+ }
+ if (node->type.tv == tarval_unreachable) {
+ /* mark dead blocks */
+ set_Block_dead(block);
+ return;
+ }
+
+ n = get_Block_n_cfgpreds(block);
+
+ if (n == 1) {
+ /* only one predecessor combine */
+ ir_node *pred = skip_Proj(get_Block_cfgpred(block, 0));
+
+ if (can_exchange(pred))
+ exchange(block, get_nodes_block(pred));
+ return;
+ }
+
+ NEW_ARR_A(ir_node *, in_X, n);
+ k = 0;
+ for (i = 0; i < n; ++i) {
+ ir_node *pred = get_Block_cfgpred(block, i);
+ node_t *node = get_irn_node(pred);
+
+ if (node->type.tv == tarval_reachable) {
+ in_X[k++] = pred;
}
+ }
+ if (k >= n)
+ return;
- if (node->type.tv == tarval_unreachable) {
- /* mark dead blocks */
- set_Block_dead(irn);
+ NEW_ARR_A(ir_node *, ins, n);
+ for (phi = get_Block_phis(block); phi != NULL; phi = next) {
+ node_t *node = get_irn_node(phi);
+
+ next = get_Phi_next(phi);
+ if (is_tarval(node->type.tv) && tarval_is_constant(node->type.tv)) {
+ /* this Phi is replaced by a constant */
+ tarval *tv = node->type.tv;
+ ir_node *c = new_r_Const(current_ir_graph, block, get_tarval_mode(tv), tv);
+
+ set_irn_node(c, node);
+ node->node = c;
+ DB((dbg, LEVEL_1, "%+F is replaced by %+F\n", phi, c));
+ exchange(phi, c);
+ } else {
+ j = 0;
+ for (i = 0; i < n; ++i) {
+ node_t *pred = get_irn_node(get_Block_cfgpred(block, i));
+
+ if (pred->type.tv == tarval_reachable) {
+ ins[j++] = get_Phi_pred(phi, i);
+ }
+ }
+ if (j <= 1) {
+ /* this Phi is replaced by a single predecessor */
+ ir_node *s = ins[0];
+
+ node->node = s;
+ DB((dbg, LEVEL_1, "%+F is replaced by %+F\n", phi, s));
+ exchange(phi, s);
+ } else {
+ set_irn_in(phi, j, ins);
+ }
}
- } else if (is_End(irn)) {
- /* do not touch the End node */
+ }
+
+ if (k <= 1) {
+ /* this Block has only one live predecessor */
+ ir_node *pred = skip_Proj(in_X[0]);
+
+ if (can_exchange(pred))
+ exchange(block, get_nodes_block(pred));
+ } else {
+ set_irn_in(block, k, in_X);
+ }
+}
+
+/**
+ * Post-Walker, apply the analysis results;
+ */
+static void apply_result(ir_node *irn, void *ctx) {
+ node_t *node = get_irn_node(irn);
+
+ (void) ctx;
+ if (is_Block(irn) || is_End(irn) || is_Bad(irn)) {
+ /* blocks already handled, do not touch the End node */
} else {
node_t *block = get_irn_node(get_nodes_block(irn));
DB((dbg, LEVEL_1, "%+F is unreachable\n", irn));
exchange(irn, bad);
}
+ else if (node->type.tv == tarval_unreachable) {
+ ir_node *bad = get_irg_bad(current_ir_graph);
+
+ /* see comment above */
+ set_irn_node(bad, node);
+ node->node = bad;
+ DB((dbg, LEVEL_1, "%+F is unreachable\n", irn));
+ exchange(irn, bad);
+ }
else if (get_irn_mode(irn) == mode_X) {
- if (node->type.tv == tarval_unreachable) {
- ir_node *bad = get_irg_bad(current_ir_graph);
-
- /* see comment above */
- set_irn_node(bad, node);
- node->node = bad;
- DB((dbg, LEVEL_1, "%+F is unreachable\n", irn));
- exchange(irn, get_irg_bad(current_ir_graph));
- }
- else if (is_Proj(irn)) {
+ if (is_Proj(irn)) {
/* leave or Jmp */
ir_node *cond = get_Proj_pred(irn);
ir_node *leader = get_leader(node);
if (leader != irn) {
- DB((dbg, LEVEL_1, "%+F is replaced by %+F\n", irn, leader));
+ DB((dbg, LEVEL_1, "%+F from part%d is replaced by %+F\n", irn, node->part->nr, leader));
exchange(irn, leader);
}
}
}
}
-} /* static void apply_result(ir_node *irn, void *ctx) {
- */
+} /* apply_result */
#define SET(code) op_##code->ops.generic = (op_func)compute_##code
/* set specific functions */
SET(Block);
+ SET(Unknown);
+ SET(Bad);
SET(Jmp);
SET(Phi);
SET(Add);
SET(Sub);
SET(SymConst);
+ SET(Cmp);
SET(Proj);
+ SET(Confirm);
SET(End);
} /* set_compute_functions */
/* register a debug mask */
FIRM_DBG_REGISTER(dbg, "firm.opt.combo");
+ //firm_dbg_set_mask(dbg, SET_LEVEL_3);
DB((dbg, LEVEL_1, "Doing COMBO for %+F\n", irg));
set_value_of_func(get_node_tarval);
set_compute_functions();
+ DEBUG_ONLY(part_nr = 0);
/* create the initial partition and place it on the work list */
env.initial = new_partition(&env);
add_to_worklist(env.initial, &env);
- irg_walk_graph(irg, NULL, create_initial_partitions, &env);
+ irg_walk_graph(irg, init_block_phis, create_initial_partitions, &env);
/* Place the START Node's partition on cprop.
Place the START Node on its local worklist. */
dump_all_partitions(&env);
+#if 0
set_dump_node_vcgattr_hook(dump_partition_hook);
dump_ir_block_graph(irg, "-partition");
set_dump_node_vcgattr_hook(NULL);
-
+#else
+ (void)dump_partition_hook;
+#endif
/* apply the result */
+ irg_block_walk_graph(irg, NULL, apply_cf, &env);
irg_walk_graph(irg, NULL, apply_result, &env);
pmap_destroy(env.type2id_map);