diff options
author | rguenth <rguenth@138bc75d-0d04-0410-961f-82ee72b054a4> | 2008-08-08 11:30:13 +0000 |
---|---|---|
committer | rguenth <rguenth@138bc75d-0d04-0410-961f-82ee72b054a4> | 2008-08-08 11:30:13 +0000 |
commit | b87477876194a77fd92bf1535bd9a690cd33067f (patch) | |
tree | ab403f41f50caaf2a0fd7966b13ae7b058ab89d6 /gcc/tree-ssa-loop-niter.c | |
parent | f08b701cb43c651acbd9401ac92b8ea331dbd00e (diff) | |
download | gcc-b87477876194a77fd92bf1535bd9a690cd33067f.tar.gz |
2008-08-08 Richard Guenther <rguenther@suse.de>
PR tree-optimization/37056
* gimple.h (gimple_assign_rhs_class): New helper function.
* tree-ssa-loop-niter.c (get_val_for): Fix tuplification, handle
unary operations properly.
* gcc.c-torture/compile/pr37056.c: New testcase.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@138865 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/tree-ssa-loop-niter.c')
-rw-r--r-- | gcc/tree-ssa-loop-niter.c | 48 |
1 files changed, 22 insertions, 26 deletions
diff --git a/gcc/tree-ssa-loop-niter.c b/gcc/tree-ssa-loop-niter.c index 1d0605e68b5..b8247a0000c 100644 --- a/gcc/tree-ssa-loop-niter.c +++ b/gcc/tree-ssa-loop-niter.c @@ -2034,7 +2034,6 @@ static tree get_val_for (tree x, tree base) { gimple stmt; - tree nx, val, retval, rhs1, rhs2; gcc_assert (is_gimple_min_invariant (base)); @@ -2050,33 +2049,30 @@ get_val_for (tree x, tree base) /* STMT must be either an assignment of a single SSA name or an expression involving an SSA name and a constant. Try to fold that expression using the value for the SSA name. */ - rhs1 = gimple_assign_rhs1 (stmt); - rhs2 = gimple_assign_rhs2 (stmt); - if (TREE_CODE (rhs1) == SSA_NAME) - nx = rhs1; - else if (rhs2 && TREE_CODE (rhs2) == SSA_NAME) - nx = rhs2; - else - gcc_unreachable (); - - /* NX is now the SSA name for which we want to discover the base value. */ - val = get_val_for (nx, base); - if (rhs2) - { - /* If this is a binary expression, fold it. If folding is - not possible, return a tree expression with the RHS of STMT. */ - rhs1 = (nx == rhs1) ? val : rhs1; - rhs2 = (nx == rhs2) ? val : rhs2; - retval = fold_binary (gimple_assign_rhs_code (stmt), - gimple_expr_type (stmt), rhs1, rhs2); - if (retval == NULL_TREE) - retval= build2 (gimple_assign_rhs_code (stmt), - gimple_expr_type (stmt), rhs1, rhs2); + if (gimple_assign_ssa_name_copy_p (stmt)) + return get_val_for (gimple_assign_rhs1 (stmt), base); + else if (gimple_assign_rhs_class (stmt) == GIMPLE_UNARY_RHS + && TREE_CODE (gimple_assign_rhs1 (stmt)) == SSA_NAME) + { + return fold_build1 (gimple_assign_rhs_code (stmt), + gimple_expr_type (stmt), + get_val_for (gimple_assign_rhs1 (stmt), base)); + } + else if (gimple_assign_rhs_class (stmt) == GIMPLE_BINARY_RHS) + { + tree rhs1 = gimple_assign_rhs1 (stmt); + tree rhs2 = gimple_assign_rhs2 (stmt); + if (TREE_CODE (rhs1) == SSA_NAME) + rhs1 = get_val_for (rhs1, base); + else if (TREE_CODE (rhs2) == SSA_NAME) + rhs2 = get_val_for (rhs2, base); + else + gcc_unreachable (); + return fold_build2 (gimple_assign_rhs_code (stmt), + gimple_expr_type (stmt), rhs1, rhs2); } else - retval = val; - - return retval; + gcc_unreachable (); } |