]> git.ipfire.org Git - thirdparty/gcc.git/commitdiff
vect-multitypes-15.c: Fix typo.
authorVictor Kaplansky <victork@il.ibm.com>
Wed, 20 Aug 2008 12:05:38 +0000 (12:05 +0000)
committerVictor Kaplansky <victork@gcc.gnu.org>
Wed, 20 Aug 2008 12:05:38 +0000 (12:05 +0000)
2008-08-20  Victor Kaplansky  <victork@il.ibm.com>

        * gcc.dg/vect/vect-multitypes-15.c: Fix typo.
        * gcc/testsuite/lib/target-supports.exp
           (check_effective_target_vect_long_long): Remove spu-*-*.
        * gcc.dg/vect/vect-multitypes-16.c: Make init loop unvectorizable.
        * gcc.dg/vect/slp-widen-mult-u8.c: Likewise.

From-SVN: r139270

gcc/testsuite/ChangeLog
gcc/testsuite/gcc.dg/vect/slp-widen-mult-u8.c
gcc/testsuite/gcc.dg/vect/vect-multitypes-15.c
gcc/testsuite/gcc.dg/vect/vect-multitypes-16.c
gcc/testsuite/lib/target-supports.exp

index 791d51bc7ee92f26e749d4be54e97d51a43c4882..bb5cf794f65a6b05ba0f7c234d5ebc4d703c802e 100644 (file)
@@ -1,3 +1,11 @@
+2008-08-20  Victor Kaplansky  <victork@il.ibm.com>
+
+        * gcc.dg/vect/vect-multitypes-15.c: Fix typo.
+       * gcc/testsuite/lib/target-supports.exp
+          (check_effective_target_vect_long_long): Remove spu-*-*.
+       * gcc.dg/vect/vect-multitypes-16.c: Make init loop unvectorizable.
+       * gcc.dg/vect/slp-widen-mult-u8.c: Likewise.
+       
 2008-08-20  Richard Guenther  <rguenther@suse.de>
 
        * gcc.dg/tree-ssa/pr20701.c: Scan vrp1 dump.
index d510421889a13b963e7ab5663f5e4eff64aa29fb..16bf578168455ee5276f7812f84cda9fba7f1274 100644 (file)
@@ -29,6 +29,8 @@ int main (void)
   for (i=0; i<N; i++) {
     X[i] = i;
     Y[i] = 64-i;
+    if (i % 5)
+      X[i] = i;
   }
 
   foo1 (N);
@@ -41,7 +43,7 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 2 "vect" { target { vect_widen_mult_qi_to_hi || vect_unpack } } } } */
-/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" { target { vect_widen_mult_hi_to_si || vect_inpack } } } } */
+/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_widen_mult_qi_to_hi || vect_unpack } } } } */
+/* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect" { target { vect_widen_mult_hi_to_si || vect_unpack } } } } */
 /* { dg-final { cleanup-tree-dump "vect" } } */
 
index 458705adada8b2c45abeeeb2a9f5dedb838e8f20..ad09ff95679c6f7efb3f2babd125ff4a17756a12 100644 (file)
@@ -45,6 +45,6 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_sdot_hi  || vect_uncpack } } } } */
+/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { vect_sdot_hi  || vect_unpack } } } } */
 /* { dg-final { cleanup-tree-dump "vect" } } */
 
index 171de501e8438a52156e170cbfa75bb06270319e..b5347ebecc3afd661b73d5a0facdd3c5e780dc46 100644 (file)
@@ -26,6 +26,8 @@ int main (void)
 
   for (i=0; i<N; i++) {
     x[i] = i;
+    if (i % 5)
+      x[i] = i;
   }
 
   foo (N,z+2);
@@ -38,7 +40,7 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 2 "vect" { target vect_unpack } } } */
-/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { ! vect_unpack } } } } */
+/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_unpack } } } */
+/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 0 "vect" { target { ! vect_unpack } } } } */
 /* { dg-final { cleanup-tree-dump "vect" } } */
 
index 78c143c3f0fa304642c46809369aec20b12d31e8..d525a5bf5a146b057b232ac50811087aa3077797 100644 (file)
@@ -1538,8 +1538,7 @@ proc check_effective_target_vect_long_long { } {
     } else {
         set et_vect_long_long_saved 0
         if { [istarget i?86-*-*]
-              || [istarget x86_64-*-*]
-              || [istarget spu-*-*] } {
+              || [istarget x86_64-*-*] } {
            set et_vect_long_long_saved 1
         }
     }