From: Dorit Nuzman <dorit@gcc.gnu.org>
Date: Wed, 21 Sep 2005 10:26:39 +0000 (+0000)
Subject: vect-dv-2.c: Change loop bound and restore original functionality of the testcase.
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=1c8cd54dd92314b3e5352c6497f2c46dd9cdc8ee;p=gcc.git

vect-dv-2.c: Change loop bound and restore original functionality of the testcase.

        * gcc.dg/vect/vect-dv-2.c: Change loop bound and restore original
        functionality of the testcase.

From-SVN: r104481
---

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 5c82551dd37..534e49fa9e2 100644
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -49,7 +49,7 @@
 	* tree-stdarg.c (execute_optimize_stdarg): Call
 	calculate_dominance_info.
 
-2005-09-18  Daniel Berlin  <dberlin@dberlin.org>
+2005-09-20  Daniel Berlin  <dberlin@dberlin.org>
 
 	* tree-data-ref.c (get_number_of_iters_for_loop): New function.
 	(analyze_siv_subscript_cst_affine): Add weak SIV test.
diff --git a/gcc/testsuite/ChangeLog b/gcc/testsuite/ChangeLog
index 84a05006b55..4129aeb2ded 100644
--- a/gcc/testsuite/ChangeLog
+++ b/gcc/testsuite/ChangeLog
@@ -1,3 +1,8 @@
+2005-09-21  Dorit Nuzman  <dorit@il.ibm.com>
+
+	* gcc.dg/vect/vect-dv-2.c: Change loop bound and restore original
+	functionality of the testcase.
+
 2005-09-20  Richard Henderson  <rth@redhat.com>
 
 	* gcc.dg/vect/vect-22.c: Require vect_float.
@@ -20,6 +25,11 @@
 	PR tree-optimization/23929
 	* gcc.c-torture/compile/pr23929.c: New test.
 
+2005-09-20  Daniel Berlin  <dberlin@dberlin.org>
+
+	* gcc.dg/vect/vect-dv-2.c: Expect same alignment message only
+	for one loop.
+
 2005-09-20  Steve Ellcey  <sje@cup.hp.com>
 
 	PR testsuite/23186
diff --git a/gcc/testsuite/gcc.dg/vect/vect-dv-2.c b/gcc/testsuite/gcc.dg/vect/vect-dv-2.c
index 0ecb8a03894..4822fcfe68a 100644
--- a/gcc/testsuite/gcc.dg/vect/vect-dv-2.c
+++ b/gcc/testsuite/gcc.dg/vect/vect-dv-2.c
@@ -29,15 +29,15 @@ int main ()
     }
 
   /* Vectorizable */
-  for (i = 0; i < 16; i++)
+  for (i = 0; i < N-20; i++)
     {
       A[i] = A[i+20];
     }
 
   /* check results:  */
-  for (i = 0; i < 16; i++)
+  for (i = 0; i < N-20; i++)
     {
-      if (A[i] != A[i+20])
+      if (A[i] != D[i+20])
 	abort ();
     }
 
@@ -73,5 +73,5 @@ int main ()
 
 
 /* { dg-final { scan-tree-dump-times "vectorized 2 loops" 1 "vect" } } */
-/* { dg-final { scan-tree-dump-times "accesses have the same alignment." 1 "vect" } } */
+/* { dg-final { scan-tree-dump-times "accesses have the same alignment." 2 "vect" } } */
 /* { dg-final { cleanup-tree-dump "vect" } } */