diff options
| author | Kazu Hirata <kazu@codesourcery.com> | 2009-01-28 18:16:57 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@gcc.gnu.org> | 2009-01-28 18:16:57 +0000 |
| commit | 59dc48988aab8274b90dfd4e0e9ebbb7dd2e7007 (patch) | |
| tree | 020e113c14ad11d3ee75393bd400d5e267b929a2 | |
| parent | 07da44aba4702478a25e8483fd8455360aba760c (diff) | |
| download | gcc-59dc48988aab8274b90dfd4e0e9ebbb7dd2e7007.zip gcc-59dc48988aab8274b90dfd4e0e9ebbb7dd2e7007.tar.gz gcc-59dc48988aab8274b90dfd4e0e9ebbb7dd2e7007.tar.bz2 | |
re PR tree-optimization/38997 (-ftree-loop-distribution ICEs)
gcc/
PR tree-optimization/38997
* tree-loop-distribution.c (generate_memset_zero): Use
POINTER_PLUS_EXPR for a pointer addition.
gcc/testsuite/
PR tree-optimization/38997
* gcc.dg/tree-ssa/pr38997.c: New.
From-SVN: r143739
| -rw-r--r-- | gcc/ChangeLog | 6 | ||||
| -rw-r--r-- | gcc/testsuite/ChangeLog | 5 | ||||
| -rw-r--r-- | gcc/tree-loop-distribution.c | 13 |
3 files changed, 20 insertions, 4 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index de59cdf..da53b53 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,9 @@ +2009-01-28 Kazu Hirata <kazu@codesourcery.com> + + PR tree-optimization/38997 + * tree-loop-distribution.c (generate_memset_zero): Use + POINTER_PLUS_EXPR for a pointer addition. + 2009-01-28 Andreas Krebbel <krebbel1@de.ibm.com> * config/s390/s390.md (bswap<mode>2): New pattern added. diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog index d3b7034..d6038a1 100644 --- a/gcc/testsuite/ChangeLog +++ b/gcc/testsuite/ChangeLog @@ -1,3 +1,8 @@ +2009-01-28 Kazu Hirata <kazu@codesourcery.com> + + PR tree-optimization/38997 + * gcc.dg/tree-ssa/pr38997.c: New. + 2009-01-28 Richard Guenther <rguenther@suse.de> PR tree-optimization/38926 diff --git a/gcc/tree-loop-distribution.c b/gcc/tree-loop-distribution.c index 745957fc..1463bee 100644 --- a/gcc/tree-loop-distribution.c +++ b/gcc/tree-loop-distribution.c @@ -256,10 +256,15 @@ generate_memset_zero (gimple stmt, tree op0, tree nb_iter, /* Test for a positive stride, iterating over every element. */ if (integer_zerop (fold_build2 (MINUS_EXPR, integer_type_node, DR_STEP (dr), TYPE_SIZE_UNIT (TREE_TYPE (op0))))) - addr_base = fold_build2 (PLUS_EXPR, TREE_TYPE (DR_BASE_ADDRESS (dr)), - DR_BASE_ADDRESS (dr), - size_binop (PLUS_EXPR, - DR_OFFSET (dr), DR_INIT (dr))); + { + tree offset = fold_convert (sizetype, + size_binop (PLUS_EXPR, + DR_OFFSET (dr), + DR_INIT (dr))); + addr_base = fold_build2 (POINTER_PLUS_EXPR, + TREE_TYPE (DR_BASE_ADDRESS (dr)), + DR_BASE_ADDRESS (dr), offset); + } /* Test for a negative stride, iterating over every element. */ else if (integer_zerop (fold_build2 (PLUS_EXPR, integer_type_node, |