From e838422b9eee3123812624de39ed76259e212492 Mon Sep 17 00:00:00 2001 From: Ira Rosen Date: Sun, 11 Mar 2007 11:13:34 +0000 Subject: [PATCH] tree-data-ref.c (analyze_offset): Add a return value (bool) to indicate success/failure of the analysis. * tree-data-ref.c (analyze_offset): Add a return value (bool) to indicate success/failure of the analysis. Add negation to subtrahend in case of subtraction. Fail if both operands contain constants. (create_data_ref): Fail if analyze_offset fails. From-SVN: r122817 --- gcc/ChangeLog | 7 ++++ gcc/testsuite/ChangeLog | 5 +++ .../gcc.dg/vect/fast-math-vect-pr29925.c | 39 +++++++++++++++++++ gcc/tree-data-ref.c | 37 ++++++++++++++---- 4 files changed, 81 insertions(+), 7 deletions(-) create mode 100644 gcc/testsuite/gcc.dg/vect/fast-math-vect-pr29925.c diff --git a/gcc/ChangeLog b/gcc/ChangeLog index f726f3e2e5b..1bdc3064224 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,10 @@ +2007-03-11 Ira Rosen + + * tree-data-ref.c (analyze_offset): Add a return value (bool) to + indicate success/failure of the analysis. Add negation to subtrahend + in case of subtraction. Fail if both operands contain constants. + (create_data_ref): Fail if analyze_offset fails. + 2007-03-11 Uros Bizjak * config/i386/i386.md (frndintxf2): Rename to ... diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog index edc908c5b9f..ac53f61749d 100644 --- a/gcc/testsuite/ChangeLog +++ b/gcc/testsuite/ChangeLog @@ -1,3 +1,8 @@ +2007-03-11 Ira Rosen + + PR tree-optimization/29925 + * gcc.dg/vect/fast-math-vect-pr29925.c: New test. + 2007-03-10 Mark Mitchell PR c++/30274 diff --git a/gcc/testsuite/gcc.dg/vect/fast-math-vect-pr29925.c b/gcc/testsuite/gcc.dg/vect/fast-math-vect-pr29925.c new file mode 100644 index 00000000000..caa6a3ca67d --- /dev/null +++ b/gcc/testsuite/gcc.dg/vect/fast-math-vect-pr29925.c @@ -0,0 +1,39 @@ +/* { dg-require-effective-target vect_float } */ + +#include +#include "tree-vect.h" + +void interp_pitch(float *exc, float *interp, int pitch, int len) +{ + int i,k; + int maxj; + + maxj=3; + for (i=0;i