# include "irgopt_t.h"
# include "irnode_t.h"
# include "irouts.h"
+# include "trouts.h"
# include "hashptr.h"
# include "pset.h"
# include "strength_red.h"
* @param n The node to be copied
* @param env if non-NULL, the node number attribute will be copied to the new node
*/
-
static void
copy_node (ir_node *n, void *env)
{
- ir_node *nn, *block;
+ ir_node *nn;
int new_arity;
ir_op *op = get_irn_op(n);
int copy_node_nr = false;
nn = new_ir_node(get_irn_dbg_info(n),
current_ir_graph,
- block,
+ NULL, /* no block yet, will be set later */
op,
get_irn_mode(n),
new_arity,
copy_loop_body(set *l_n, induct_var_info *info, int unroll_factor)
{
int i;
- copies_t *value, *info_op, *phi, *loop_h, key, *value_block;
+ copies_t *value, *info_op, *phi, *loop_h = NULL, key, *value_block;
ir_node *loop_head = get_loop_node(info->l_itervar_phi, 0);
else if (is_Phi_in_loop_head(value->irn, loop_head))
phi = value;
else if (copy_loop_head){
- /* If the loop head must be copied. */
+ /* The loop head must be copied. */
for (i = 0; i < unroll_factor - 1; i++){
copy_node(value->irn, NULL);
value->copy[i] = get_irn_link(value->irn);
}
} else {
- /* If the loop head and its nodes mustn't be copied. */
+ /* The loop head and its nodes must not be copied. */
if((value->irn->op == op_Block &&
value->irn != loop_head) ||
(value->irn->op != op_Block &&
}
}
/**
- * is_exception_possible
- *
- * If a Proj node from the loop have as predecessor a Call, Div or Load node, then is a
- * exception possible.
+ * Returns non-zero if a Proj node from the loop has a predecessor that
+ * can throw an exception.
*
* @param node A Proj node from the loop.
+ *
+ * @return non-zero if the predecessor of the Proj node can throw an exception
*/
-static int
-is_exception_possible(ir_node *node)
+static int is_exception_possible(ir_node *node)
{
- int possible = 1;
ir_node *pred = get_Proj_pred(node);
- switch(get_irn_opcode(pred)){
- case iro_Call:
- break;
- case iro_Div:
- break;
- case iro_Load:
- break;
- default:
- possible = 0;
- }
+ /* only fragile ops can throw an exception */
+ if (! is_fragile_op(pred))
+ return 0;
- return possible;
+ /*
+ * fragile ops that are known NOT to throw
+ * an exception if their pin_state is op_pin_state_floats
+ */
+ return get_irn_pinned(pred) != op_pin_state_floats;
}
-
/**
* If a node from the loop is predecessor of the end block, then the end block must get all copies
* of this node as predecessors. This is possible with function calls in the unrolling loop.
static void
new_after_loop_node(set *l_n, set *loop_outs, ir_node *node, copies_t *loop_in, int unroll_factor)
{
- ir_node *pred, *block_pred, *node_block, *new_phi;
+ ir_node *pred, *block_pred = NULL, *node_block, *new_phi;
int phi = 0, old_preds, new_preds, all_new_preds, p, q, i, s;
copies_t key, *value = NULL;
ir_node **all_in;
if (get_irn_op(block_pred) == op_Proj) {
if (get_Proj_pred(block_pred) == pred)
- break;
+ break;
}
- else
+ else {
block_pred = NULL;
+ }
}
if (! block_pred) return;
* Called from a post walker.
*
* @param n An IR node.
- * @param env Free environment pointer.
+ * @param env points to a result
*/
static void do_loop_unroll(ir_node *n, void *env)
{
+ int *unroll_done = env;
induct_var_info info;
copies_t *value;
set *loop_nodes, *loop_outs, *loop_endblock_outs;
if ((cmp_typ == pn_Cmp_Le || cmp_typ == pn_Cmp_Ge) && (iter_end % iter_increment == 0))
iter_number ++;
- if (iter_number & 3 == 0)
+ if ((iter_number & 3) == 0)
unroll_factor = 4;
- else if (iter_number % 3 == 0)
+ else if ((iter_number % 3) == 0)
unroll_factor = 3;
- else if (iter_number & 1 == 0)
+ else if ((iter_number & 1) == 0)
unroll_factor = 2;
else return;
- printf("\nloop unrolling with factor %d \n", unroll_factor);
+ if (get_firm_verbosity())
+ printf("\nloop unrolling with factor %d \n", unroll_factor);
- DDMG(get_irn_irg(n));
+ /* ok, we will do unrolling */
+ *unroll_done += 1;
/* The unroll factor must be less than 4. */
assert(unroll_factor <= MAX_UNROLL);
/* Set the backedge of the loop head. */
for (value = set_first(loop_nodes); value != NULL; value = set_next(loop_nodes)) {
- if(value->irn == backedge_jmp){
-
+ if (value->irn == backedge_jmp)
set_Block_cfgpred(loop_head, backedge_pos, value->copy[unroll_factor-2]);
- }
}
set_loop_outs(loop_nodes, loop_outs, loop_endblock_outs, &info, unroll_factor);
}
void optimize_loop_unrolling(ir_graph *irg /* unroll factor, max body size */)
{
ir_graph *rem;
+ int unroll_done = 0;
if ( !get_opt_loop_unrolling()) return;
compute_doms(irg);
/* Call algorithm that computes the out edges */
- compute_outs(irg);
+ compute_irg_outs(irg);
collect_phiprojs(irg);
/* -- Search expressions that can be optimized -- */
- irg_walk_graph(irg, NULL, do_loop_unroll, NULL);
+ irg_walk_graph(irg, NULL, do_loop_unroll, &unroll_done);
+
+ if (unroll_done) {
+ /* unrolling was done, all info is invalid */
+ set_irg_dom_inconsistent(irg);
+ set_irg_outs_inconsistent(irg);
+ set_irg_loopinfo_state(current_ir_graph, loopinfo_cf_inconsistent);
+ set_trouts_inconsistent();
+ set_irg_callee_info_state(irg, irg_callee_info_inconsistent);
+ }
current_ir_graph = rem;
}