diff options
| author | Zdenek Dvorak <ook@ucw.cz> | 2008-11-20 09:05:12 +0100 |
|---|---|---|
| committer | Zdenek Dvorak <rakdver@gcc.gnu.org> | 2008-11-20 08:05:12 +0000 |
| commit | dc5b3407f2997631c15eebccd8c9260e186f3e0a (patch) | |
| tree | 049852a66bb3c2b176b99851ac916058e794f7d0 /gcc/tree-ssa-loop-ivopts.c | |
| parent | f9487002a446cc5f4c777a77afe7c6eaecfec4d0 (diff) | |
| download | gcc-dc5b3407f2997631c15eebccd8c9260e186f3e0a.zip gcc-dc5b3407f2997631c15eebccd8c9260e186f3e0a.tar.gz gcc-dc5b3407f2997631c15eebccd8c9260e186f3e0a.tar.bz2 | |
re PR rtl-optimization/32283 (Missed induction variable optimization)
PR rtl-optimization/32283
* tree-ssa-loop-niter.c (scev_probably_wraps_p): Use type of the base
of the induction variable to decide whether it may wrap.
* tree-ssa-loop-ivopts.c (rewrite_use_compare): Emit the initialization
of the bound before the loop.
* simplify-rtx.c (simplify_binary_operation_1): Add two simplifications
regarding AND.
(simplify_plus_minus): Only fail if no simplification is possible.
* loop-iv.c (simple_rhs_p): Consider reg + reg and reg << cst simple.
From-SVN: r142035
Diffstat (limited to 'gcc/tree-ssa-loop-ivopts.c')
| -rw-r--r-- | gcc/tree-ssa-loop-ivopts.c | 8 |
1 files changed, 6 insertions, 2 deletions
diff --git a/gcc/tree-ssa-loop-ivopts.c b/gcc/tree-ssa-loop-ivopts.c index 92d9c75..aa0472e 100644 --- a/gcc/tree-ssa-loop-ivopts.c +++ b/gcc/tree-ssa-loop-ivopts.c @@ -5323,11 +5323,15 @@ rewrite_use_compare (struct ivopts_data *data, { tree var = var_at_stmt (data->current_loop, cand, use->stmt); tree var_type = TREE_TYPE (var); + gimple_seq stmts; compare = iv_elimination_compare (data, use); bound = unshare_expr (fold_convert (var_type, bound)); - op = force_gimple_operand_gsi (&bsi, bound, true, NULL_TREE, - true, GSI_SAME_STMT); + op = force_gimple_operand (bound, &stmts, true, NULL_TREE); + if (stmts) + gsi_insert_seq_on_edge_immediate ( + loop_preheader_edge (data->current_loop), + stmts); gimple_cond_set_lhs (use->stmt, var); gimple_cond_set_code (use->stmt, compare); |