adjust BB vectorization dump scanning
authorRichard Biener <rguenther@suse.de>
Thu, 8 Oct 2020 09:53:51 +0000 (11:53 +0200)
committerRichard Biener <rguenther@suse.de>
Thu, 8 Oct 2020 11:34:55 +0000 (13:34 +0200)
This adjusts BB vectorization testcases to look for the number of
SLP subgraphs vectorized rather than for the number of basic blocks
we've found opportunities in because followup patches will play
with the granularity we work on, vectorizing multiple basic blocks
at a time.

Together with this, because I noticed when looking at non-obvious
mismatches, I avoid analyzing group-size 1 SLP instances which
result in pointless V1mode vectorizations.

It might be interesting to work on adding sth like
dg-warning to look for -fopt-info-{optimized,missing} so
we could directly annotate (not) vectorized loops instead of
relying on fragile counts.

2020-10-08  Richard Biener  <rguenther@suse.de>

* tree-vectorizer.c (try_vectorize_loop_1): Do not dump
"basic block vectorized".
(pass_slp_vectorize::execute): Likewise.
* tree-vect-slp.c (vect_analyze_slp_instance): Avoid
re-analyzing split single stmts.

* g++.dg/vect/slp-pr50819.cc: Adjust.
* gcc.dg/vect/bb-slp-1.c: Adjust.
* gcc.dg/vect/bb-slp-10.c: Adjust.
* gcc.dg/vect/bb-slp-11.c: Adjust.
* gcc.dg/vect/bb-slp-13.c: Adjust.
* gcc.dg/vect/bb-slp-14.c: Adjust.
* gcc.dg/vect/bb-slp-15.c: Adjust.
* gcc.dg/vect/bb-slp-16.c: Adjust.
* gcc.dg/vect/bb-slp-17.c: Adjust.
* gcc.dg/vect/bb-slp-18.c: Adjust.
* gcc.dg/vect/bb-slp-19.c: Adjust.
* gcc.dg/vect/bb-slp-2.c: Adjust.
* gcc.dg/vect/bb-slp-20.c: Adjust.
* gcc.dg/vect/bb-slp-21.c: Adjust.
* gcc.dg/vect/bb-slp-22.c: Adjust.
* gcc.dg/vect/bb-slp-23.c: Adjust.
* gcc.dg/vect/bb-slp-24.c: Adjust.
* gcc.dg/vect/bb-slp-25.c: Adjust.
* gcc.dg/vect/bb-slp-26.c: Adjust.
* gcc.dg/vect/bb-slp-27.c: Adjust.
* gcc.dg/vect/bb-slp-28.c: Adjust.
* gcc.dg/vect/bb-slp-29.c: Adjust.
* gcc.dg/vect/bb-slp-3.c: Adjust.
* gcc.dg/vect/bb-slp-30.c: Adjust.
* gcc.dg/vect/bb-slp-31.c: Adjust.
* gcc.dg/vect/bb-slp-34.c: Adjust.
* gcc.dg/vect/bb-slp-35.c: Adjust.
* gcc.dg/vect/bb-slp-36.c: Adjust.
* gcc.dg/vect/bb-slp-38.c: Adjust.
* gcc.dg/vect/bb-slp-4.c: Adjust.
* gcc.dg/vect/bb-slp-45.c: Adjust.
* gcc.dg/vect/bb-slp-46.c: Adjust.
* gcc.dg/vect/bb-slp-48.c: Adjust.
* gcc.dg/vect/bb-slp-5.c: Adjust.
* gcc.dg/vect/bb-slp-6.c: Adjust.
* gcc.dg/vect/bb-slp-7.c: Adjust.
* gcc.dg/vect/bb-slp-8.c: Adjust.
* gcc.dg/vect/bb-slp-8a.c: Adjust.
* gcc.dg/vect/bb-slp-8b.c: Adjust.
* gcc.dg/vect/bb-slp-9.c: Adjust.
* gcc.dg/vect/bb-slp-div-2.c: Adjust.
* gcc.dg/vect/bb-slp-over-widen-1.c: Adjust.
* gcc.dg/vect/bb-slp-over-widen-2.c: Adjust.
* gcc.dg/vect/bb-slp-pattern-2.c: Adjust.
* gcc.dg/vect/bb-slp-pow-1.c: Adjust.
* gcc.dg/vect/bb-slp-pr58135.c: Adjust.
* gcc.dg/vect/bb-slp-pr65935.c: Adjust.
* gcc.dg/vect/bb-slp-pr78205.c: Adjust.
* gcc.dg/vect/bb-slp-pr81635-1.c: Adjust.
* gcc.dg/vect/bb-slp-pr81635-3.c: Adjust.
* gcc.dg/vect/bb-slp-pr95839-2.c: Adjust.
* gcc.dg/vect/bb-slp-pr95839.c: Adjust.
* gcc.dg/vect/bb-slp-pr95866.c: Adjust.
* gcc.dg/vect/bb-slp-subgroups-1.c: Adjust.
* gcc.dg/vect/bb-slp-subgroups-2.c: Adjust.
* gcc.dg/vect/bb-slp-subgroups-3.c: Adjust.
* gcc.dg/vect/fast-math-bb-slp-call-1.c: Adjust.
* gcc.dg/vect/no-tree-reassoc-bb-slp-12.c: Adjust.
* gcc.dg/vect/no-tree-sra-bb-slp-pr50730.c: Adjust.
* gfortran.dg/vect/pr62283-2.f: Adjust.
* gcc.target/i386/pr68961.c: Adjust.
* gcc.target/i386/pr84101.c: Adjust.
* gcc.dg/vect/bb-slp-pr81635-2.c: Adjust.
* gcc.dg/vect/bb-slp-pr81635-4.c: Adjust.
* gcc.dg/vect/fast-math-bb-slp-call-2.c: Adjust.
* gcc.dg/vect/costmodel/ppc/costmodel-bb-slp-9a.c: Adjust.
* gcc.dg/vect/costmodel/x86_64/costmodel-vect-slp.c: Adjust.
* gcc.dg/vect/bb-slp-div-1.c: Adjust.
* gcc.dg/vect/bb-slp-pr90006.c: Adjust.
* g++.dg/vect/slp-pr50413.cc: Adjust.

72 files changed:
gcc/testsuite/g++.dg/vect/slp-pr50413.cc
gcc/testsuite/g++.dg/vect/slp-pr50819.cc
gcc/testsuite/gcc.dg/vect/bb-slp-1.c
gcc/testsuite/gcc.dg/vect/bb-slp-10.c
gcc/testsuite/gcc.dg/vect/bb-slp-11.c
gcc/testsuite/gcc.dg/vect/bb-slp-13.c
gcc/testsuite/gcc.dg/vect/bb-slp-14.c
gcc/testsuite/gcc.dg/vect/bb-slp-15.c
gcc/testsuite/gcc.dg/vect/bb-slp-16.c
gcc/testsuite/gcc.dg/vect/bb-slp-17.c
gcc/testsuite/gcc.dg/vect/bb-slp-18.c
gcc/testsuite/gcc.dg/vect/bb-slp-19.c
gcc/testsuite/gcc.dg/vect/bb-slp-2.c
gcc/testsuite/gcc.dg/vect/bb-slp-20.c
gcc/testsuite/gcc.dg/vect/bb-slp-21.c
gcc/testsuite/gcc.dg/vect/bb-slp-22.c
gcc/testsuite/gcc.dg/vect/bb-slp-23.c
gcc/testsuite/gcc.dg/vect/bb-slp-24.c
gcc/testsuite/gcc.dg/vect/bb-slp-25.c
gcc/testsuite/gcc.dg/vect/bb-slp-26.c
gcc/testsuite/gcc.dg/vect/bb-slp-27.c
gcc/testsuite/gcc.dg/vect/bb-slp-28.c
gcc/testsuite/gcc.dg/vect/bb-slp-29.c
gcc/testsuite/gcc.dg/vect/bb-slp-3.c
gcc/testsuite/gcc.dg/vect/bb-slp-30.c
gcc/testsuite/gcc.dg/vect/bb-slp-31.c
gcc/testsuite/gcc.dg/vect/bb-slp-34.c
gcc/testsuite/gcc.dg/vect/bb-slp-35.c
gcc/testsuite/gcc.dg/vect/bb-slp-36.c
gcc/testsuite/gcc.dg/vect/bb-slp-38.c
gcc/testsuite/gcc.dg/vect/bb-slp-4.c
gcc/testsuite/gcc.dg/vect/bb-slp-45.c
gcc/testsuite/gcc.dg/vect/bb-slp-46.c
gcc/testsuite/gcc.dg/vect/bb-slp-48.c
gcc/testsuite/gcc.dg/vect/bb-slp-5.c
gcc/testsuite/gcc.dg/vect/bb-slp-6.c
gcc/testsuite/gcc.dg/vect/bb-slp-7.c
gcc/testsuite/gcc.dg/vect/bb-slp-8.c
gcc/testsuite/gcc.dg/vect/bb-slp-8a.c
gcc/testsuite/gcc.dg/vect/bb-slp-8b.c
gcc/testsuite/gcc.dg/vect/bb-slp-9.c
gcc/testsuite/gcc.dg/vect/bb-slp-div-1.c
gcc/testsuite/gcc.dg/vect/bb-slp-div-2.c
gcc/testsuite/gcc.dg/vect/bb-slp-over-widen-1.c
gcc/testsuite/gcc.dg/vect/bb-slp-over-widen-2.c
gcc/testsuite/gcc.dg/vect/bb-slp-pattern-2.c
gcc/testsuite/gcc.dg/vect/bb-slp-pow-1.c
gcc/testsuite/gcc.dg/vect/bb-slp-pr58135.c
gcc/testsuite/gcc.dg/vect/bb-slp-pr65935.c
gcc/testsuite/gcc.dg/vect/bb-slp-pr78205.c
gcc/testsuite/gcc.dg/vect/bb-slp-pr81635-1.c
gcc/testsuite/gcc.dg/vect/bb-slp-pr81635-2.c
gcc/testsuite/gcc.dg/vect/bb-slp-pr81635-3.c
gcc/testsuite/gcc.dg/vect/bb-slp-pr81635-4.c
gcc/testsuite/gcc.dg/vect/bb-slp-pr90006.c
gcc/testsuite/gcc.dg/vect/bb-slp-pr95839-2.c
gcc/testsuite/gcc.dg/vect/bb-slp-pr95839.c
gcc/testsuite/gcc.dg/vect/bb-slp-pr95866.c
gcc/testsuite/gcc.dg/vect/bb-slp-subgroups-1.c
gcc/testsuite/gcc.dg/vect/bb-slp-subgroups-2.c
gcc/testsuite/gcc.dg/vect/bb-slp-subgroups-3.c
gcc/testsuite/gcc.dg/vect/costmodel/ppc/costmodel-bb-slp-9a.c
gcc/testsuite/gcc.dg/vect/costmodel/x86_64/costmodel-vect-slp.c
gcc/testsuite/gcc.dg/vect/fast-math-bb-slp-call-1.c
gcc/testsuite/gcc.dg/vect/fast-math-bb-slp-call-2.c
gcc/testsuite/gcc.dg/vect/no-tree-reassoc-bb-slp-12.c
gcc/testsuite/gcc.dg/vect/no-tree-sra-bb-slp-pr50730.c
gcc/testsuite/gcc.target/i386/pr68961.c
gcc/testsuite/gcc.target/i386/pr84101.c
gcc/testsuite/gfortran.dg/vect/pr62283-2.f
gcc/tree-vect-slp.c
gcc/tree-vectorizer.c

index 12f92fc5b14aeb2a685c47c13643c390e776d88f..3e11c34d5c6ed056ccb8615ca72bd8c31a6f1826 100644 (file)
@@ -160,5 +160,4 @@ void shift(unsigned char t)
   V.bitmap.b96 = t;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 0 "slp2" } } */
-
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 0 "slp2" } } */
index ce5c20f406a8d49a0458f2a16153a3540793cb01..b15c34a3ab5756d95b2243108cfe8faa4712c927 100644 (file)
@@ -49,4 +49,4 @@ const & v2) {
   res = res + s*(v1+v2);
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 2 "slp2" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 2 "slp2" } } */
index e6818cb8d8fb3bf84bba03e3b4a78700f2f3a068..793c41f6b724d2b6f5ecca6511ea8504e1731a8c 100644 (file)
@@ -55,4 +55,4 @@ int main (void)
 }
 
 /* { dg-final { scan-tree-dump-not "can't force alignment" "slp1" } } */
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp1" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp1" } } */
index ad6f878e4076a9aa969efbc35d747dbcbd43c72b..697dc4ed83359c7e42da6a8dc352aa2112081d29 100644 (file)
@@ -50,5 +50,5 @@ int main (void)
 }
 
 /* { dg-final { scan-tree-dump "unsupported unaligned access" "slp2" { target { ! vect_element_align } } } } */
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" { target vect_element_align } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" { target vect_element_align } } } */
   
index cb8bddde1cf2148875d679c7011d3699e1e41b47..ff4325342531e97fced0fec5b2ffacc420fbb49e 100644 (file)
@@ -49,5 +49,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" { target vect64 } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" { target vect64 } } } */
   
index 302e20fb218e92b5175d4e441ecc976da3f1e9ae..fdff76e9f7cb97d40ba3154df3bfc78e846028f1 100644 (file)
@@ -46,5 +46,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" { target vect_int_mult } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" { target vect_int_mult } } } */
   
index e7d4e6ca5b820b51884ab87c7043b108b1b0c38f..62ee757ebe16e1884780ec970bfeabcf32678f50 100644 (file)
@@ -48,5 +48,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" { target vect_int_mult } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" { target vect_int_mult } } } */
   
index a749041ed776f03a1967c3937caa0af2ed4b1137..efe7d6a649e6a174959383c9f2cf81cdd30f5c16 100644 (file)
@@ -51,5 +51,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" { target vect_int_mult } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" { target vect_int_mult } } } */
   
index 42abd64c2906e8ca284c4e7796c4ba81c798daeb..e68a9b6253534be8b35ee0e8961dd66dff68c63c 100644 (file)
@@ -65,5 +65,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp1" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp1" } } */
   
index c20e0ff3057f4340f26f02cdcd4c79e81cd920af..f8bfb4b8b1a7745a5c15994de8160446ed3e3ca2 100644 (file)
@@ -57,5 +57,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" { target vect_int_mult } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" { target vect_int_mult } } } */
   
index 94766537a59e9127215097c75d8ffb19bc1177bd..db3f0ba7fbebe5ddb85d10a057c65c66c62f2e4e 100644 (file)
@@ -46,5 +46,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" { target vect_int_mult } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" { target vect_int_mult } } } */
   
index db446be745482fd0ecb2662213b1f25ef59e756d..7e3ccb4847fb874ba6e6b3ca780420234b47fcff 100644 (file)
@@ -52,5 +52,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" } } */
   
index cee9db5e032d712b1a3163eb22e2e098ad17ffae..fcf1cd327e0b20582e3512faacfebfe6b7db7278 100644 (file)
@@ -53,5 +53,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp1" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp1" } } */
   
index f6dfaa7d3d4c4ddb74f6639ea91dab76970a2212..134858c934a493586fe83ccc0baf61432169ff62 100644 (file)
@@ -63,6 +63,6 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" { target vect_int_mult } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" { target vect_int_mult } } } */
 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 2 "slp2" { target vect_int_mult } } } */
   
index 5464d0952019192816eb3857c04f9b54a28c7ef9..d4c98d67f551c0056efa98595b5fbb41ddf45522 100644 (file)
@@ -63,6 +63,6 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2"  } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2"  } } */
 /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 2 "slp2" } } */
   
index b5316514f42c4dcecb72d1e37634686356daf745..21552300e11bf326c7ad2435d1ee11208ba62013 100644 (file)
@@ -63,5 +63,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 2 "slp2" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 2 "slp2" } } */
 /* { dg-final { scan-tree-dump "vectorizing SLP node starting from: _\[0-9\]+ = _\[0-9\]+ \\\* a0" "slp2" { target vect_int_mult  } } } */
index e57ca41520aaea62aaf306bc498d18796d14be54..ed4a595822842e58e86592c5bc4cc7c4576c7b60 100644 (file)
@@ -51,5 +51,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" { target vect_int_mult } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" { target vect_int_mult } } } */
   
index d5b6bfbc4de180cb942275c5f1dbe24f45374eb6..ca049c81ba05482813dbab50ab3f4c6df94570e4 100644 (file)
@@ -55,5 +55,5 @@ int main (void)
 
 /* Exclude POWER8 (only POWER cpu for which vect_element_align is true)
    because loops have vectorized before SLP gets a shot.  */
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp1" { target { vect_element_align && { ! powerpc*-*-* } } } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp1" { target { vect_element_align && { ! powerpc*-*-* } } } } } */
 
index ec31329f3535576797adba796d45a36ab3fcb1b7..7a9cf955e3e540e08b42cd80872bb99b53cabcb2 100644 (file)
@@ -56,5 +56,5 @@ int main (void)
 
 /* Exclude POWER8 (only POWER cpu for which vect_element_align is true)
    because loops have vectorized before SLP gets a shot.  */
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp1" { target { vect_element_align && { ! powerpc*-*-* } } } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp1" { target { vect_element_align && { ! powerpc*-*-* } } } } } */
 
index 91b6cacd4c59bbd8b422adcdfab35a4a9e5730fa..df529673f6c817620a8423ab14724fe4e72bca49 100644 (file)
@@ -54,5 +54,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp1" { target { vect64 && vect_hw_misalign } } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp1" { target { vect64 && vect_hw_misalign } } } } */
 
index 8ef8bb0961486fc8f70ce6db6c167ddb69066731..bc27f2fca04de8f837ce51090657c8f2cc250c24 100644 (file)
@@ -44,5 +44,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" { target { vect_int_mult && { vect_unpack && vect_pack_trunc } } } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" { target { vect_int_mult && { vect_unpack && vect_pack_trunc } } } } } */
 
index a4c01b9b243a9bc077323015fb1f8b08650aaa54..8749a1f22a6cc1e62a15bd988c50f6f63f26a0a2 100644 (file)
@@ -66,5 +66,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" { target { vect_int_mult &&  { vect_pack_trunc && vect_unpack } } } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 2 "slp2" { target { vect_int_mult &&  { vect_pack_trunc && vect_unpack } } } } } */
 
index 747896b034bab91612ce142091bb4e5c9aba553a..b531350ff3073b7f54b9c03609d6c8279e0374db 100644 (file)
@@ -56,5 +56,5 @@ int main (void)
 
 /* Exclude POWER8 (only POWER cpu for which vect_element_align is true)
    because loops have vectorized before SLP gets a shot.  */
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp1"  { target { { vect_int_mult && vect_element_align } && { ! powerpc*-*-* } } } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp1"  { target { { vect_int_mult && vect_element_align } && { ! powerpc*-*-* } } } } } */
 
index 4f47738686afaa5af87a90effb4a1bcfef515256..26366706cec1afb54b45553be37be6d06d592afb 100644 (file)
@@ -42,5 +42,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" } } */
   
index 224f9dec647ec174d577633a523a05522c0fa880..c3d7ae11ad9ad08d58e4facec1886e5210ec504c 100644 (file)
@@ -50,4 +50,4 @@ int main()
   return a[21];
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" } } */
index 8e4e2d4c2d2d9544f2d47b89d71fe1fa7436730b..6a131e7a9110284f08b1254e0464b4eb102f503e 100644 (file)
@@ -9,4 +9,4 @@ void f(){
   a[1]=1+2*a[1]*a[1];
 }
 
-/* { dg-final { scan-tree-dump "basic block vectorized" "slp2" } } */
+/* { dg-final { scan-tree-dump "optimized: basic block" "slp2" } } */
index c51c7706adcb010af71a0f5ba8e412ed382908e9..a625c45514d896c0ac24da8c04ecb9065b660a56 100644 (file)
@@ -32,4 +32,4 @@ int main()
   return 0;
 }
 
-/* { dg-final { scan-tree-dump "basic block vectorized" "slp2" { target vect_perm } } } */
+/* { dg-final { scan-tree-dump "optimized: basic block" "slp2" { target vect_perm } } } */
index 5803f8e80804c8207a412f063ae3a9b5ea1b9fe8..81b228b304e58f261af8b97737fd44eda0355797 100644 (file)
@@ -9,4 +9,4 @@ void foo (int * __restrict__ p, short * __restrict__ q)
   p[3] = q[3] + 1;
 }
 
-/* { dg-final { scan-tree-dump "basic block vectorized" "slp2" { target vect_hw_misalign } } } */
+/* { dg-final { scan-tree-dump "optimized: basic block" "slp2" { target vect_hw_misalign } } } */
index f424d12835302e81a681cd8bf18cd653abc28c11..fbcedd0a15d9950129813f195a68c735d630464a 100644 (file)
@@ -32,4 +32,4 @@ int main()
   return 0;
 }
 
-/* { dg-final { scan-tree-dump "basic block vectorized" "slp2" { target vect_perm } } } */
+/* { dg-final { scan-tree-dump "optimized: basic block" "slp2" { target vect_perm } } } */
index 9c57ea3c2c149d47834a51c19be3e8c033265f80..a7bc032252eaf69898c99df46f40d6bf8433c4c6 100644 (file)
@@ -40,5 +40,4 @@ int main()
   return 0;
 }
 
-/* { dg-final { scan-tree-dump "basic block vectorized" "slp2" { target vect_perm } } } */
-/* { dg-final { scan-tree-dump "basic block part vectorized" "slp2" { target vect_perm } } } */
+/* { dg-final { scan-tree-dump "optimized: basic block" "slp2" { target vect_perm } } } */
index 293b0e3405e850acfe30d71725fb591c9498ba18..9e36963c917bff10153b83f946bb682d986a3ca0 100644 (file)
@@ -38,4 +38,4 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" } } */
index 4107a34cb9313e31334d3f3e12f3d5bbac8aa4bd..d24ef2a038d4baee462a246d8bff5b9043ec963c 100644 (file)
@@ -33,4 +33,4 @@ int main()
   return 0;
 }
 
-/* { dg-final { scan-tree-dump "basic block vectorized" "slp2" } } */
+/* { dg-final { scan-tree-dump "optimized: basic block" "slp2" } } */
index 4e4571ef6400ad9fb2e488a43d02c54f1e3f4d49..8daa5c1cfce64fbf749d826bb9d6ee499ccf5b39 100644 (file)
@@ -21,7 +21,7 @@ int foo ()
 /* We should extract the live lane from the vectorized add rather than
    keeping the original scalar add.
    ???  Because of a too conservative check we fail for temx here.  */
-/* { dg-final { scan-tree-dump "basic block vectorized" "slp2" } } */
+/* { dg-final { scan-tree-dump "optimized: basic block" "slp2" } } */
 /* { dg-final { scan-tree-dump "extracting lane for live stmt" "slp2" } } */
 /* { dg-final { scan-tree-dump-times "extracting lane for live stmt" 2 "slp2" { xfail *-*-* } } } */
 /* { dg-final { scan-tree-dump-times " \\+ " 3 "optimized" } } */
index cd229323ecfab210f8f559d67b6e8dd1fa342194..dfae6177b21f8a0525721d7f4c4000019ec42ddf 100644 (file)
@@ -49,7 +49,7 @@ bar (double x)
   return;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block part vectorized" 2 "slp2" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 2 "slp2" } } */
 /* We want to vectorize as { a[0], a[1] } + { x*3, x+1 } and thus
    elide one add in each function.  */
 /* { dg-final { scan-tree-dump-times " \\+ " 4 "optimized" } } */
index 192b7dce8b426ef66d9e0ac0d891a0821ddafee6..bb78e1b29ea10130bdad359c4392702d52694560 100644 (file)
@@ -47,5 +47,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" } } */
   
index 98fe5ea6283e714f38848c2632576ab53ae89b11..fa3e76dbccbdb0994c86a5521cb532aacceee4b2 100644 (file)
@@ -45,5 +45,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" { target vect_int_mult } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" { target vect_int_mult } } } */
   
index f12dc275667c842f3fb74addb465ebeca6f3adbb..ebe8189d3197ab9aa1f90bdc305c2e0dd6aba5e6 100644 (file)
@@ -47,5 +47,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" } } */
 
index 750d713da0c19e8b95c6e758af6083725e30502e..b653469ac474c8d52106b4bfa1fe3f92d49e651c 100644 (file)
@@ -48,5 +48,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2"  { target vect_hw_misalign } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2"  { target vect_hw_misalign } } } */
   
index cf355efe69aa04db113a923607a8551f62b92016..381593b450c479a278317a1d6fbc31548573d312 100644 (file)
@@ -47,5 +47,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 0 "slp2" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 0 "slp2" } } */
   
index a5b643bc7499d1ce2f890779546095f94d2ac3a6..03a47fdc78c46c0210019b97b0eac396d47a33a4 100644 (file)
@@ -49,5 +49,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2"  { target vect_hw_misalign } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2"  { target vect_hw_misalign } } } */
   
index d022d5f89db22213689d9edcadb99d536b2fa56e..b4cc1017f7ea5c5c3f4ef3521f4e798c69317c0b 100644 (file)
@@ -46,5 +46,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2"  { xfail  { vect_no_align && { ! vect_hw_misalign } } } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2"  { xfail  { vect_no_align && { ! vect_hw_misalign } } } } } */
   
index 65d83a437b6a7705faf9929c023f104064b6e6f4..87ffc9b897b8e23330187f864ad534a1f47193d7 100644 (file)
@@ -16,4 +16,4 @@ f (void)
   x[7] /= 9;
 }
 
-/* { dg-final { scan-tree-dump "basic block vectorized" "slp2" { xfail *-*-* } } } */
+/* { dg-final { scan-tree-dump "optimized: basic block" "slp2" { xfail *-*-* } } } */
index 715c22ac6c61fe94fce52a6ff75f31c9bdc63ed5..dd17e8c1c20670d974cd2726160639dc0c6b5c9e 100644 (file)
@@ -11,4 +11,4 @@ f (void)
   x[3] += y[3] / z[3] * 2;
 }
 
-/* { dg-final { scan-tree-dump "basic block vectorized" "slp2" { target vect_int } } } */
+/* { dg-final { scan-tree-dump "optimized: basic block" "slp2" { target vect_int } } } */
index 0082b83254e8df00959a71519499a8b044715b39..5a9fe423691e549ea877c42e46e9ba70d6ab5b00 100644 (file)
@@ -64,4 +64,4 @@ main (void)
 /* { dg-final { scan-tree-dump "demoting int to signed short" "slp2" { target { ! vect_widen_shift } } } } */
 /* { dg-final { scan-tree-dump "demoting int to unsigned short" "slp2" { target { ! vect_widen_shift } } } } */
 /* { dg-final { scan-tree-dump {\.AVG_FLOOR} "slp2" { target vect_avg_qi } } } */
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 2 "slp2" { target vect_hw_misalign } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 2 "slp2" { target vect_hw_misalign } } } */
index 042b7e9ea1baa93fc46b1fb2be237153b0a49d44..15a94e680be4568232e31956732d7416549a18ff 100644 (file)
@@ -63,4 +63,4 @@ main (void)
 /* { dg-final { scan-tree-dump "demoting int to signed short" "slp2" { target { ! vect_widen_shift } } } } */
 /* { dg-final { scan-tree-dump "demoting int to unsigned short" "slp2" { target { ! vect_widen_shift } } } } */
 /* { dg-final { scan-tree-dump {\.AVG_FLOOR} "slp2" { target vect_avg_qi } } } */
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 2 "slp2" { target vect_hw_misalign } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 2 "slp2" { target vect_hw_misalign } } } */
index d32cb758591bf86f32f97a30977347908ec61559..f6b99ea69a4169adb3898369eafca0b13f3b1a46 100644 (file)
@@ -49,4 +49,4 @@ int main ()
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp1" { target { vect_element_align && vect_pack_trunc } } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp1" { target { vect_element_align && vect_pack_trunc } } } } */
index cfe654e813638c0d71dac29c6e77a3f699c0672d..fc76700ced3d4f439b0f12eaf9dbc2b1fec72c20 100644 (file)
@@ -29,4 +29,4 @@ main (void)
    -mno-allow-movmisalign prevents vectorization.  On POWER8 and later,
    when vect_hw_misalign is true, vectorization occurs.  */
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" { target {{ ! powerpc*-*-* } || { powerpc*-*-* && vect_hw_misalign }} } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" { target {{ ! powerpc*-*-* } || { powerpc*-*-* && vect_hw_misalign }} } } } */
index ca250000c8534ee4ea07441bb3ae4bdea8efbc09..d3ac0de7f63a1640a33b0a0d4e4e879090aaaed3 100644 (file)
@@ -7,4 +7,4 @@ void foo ()
   a[0] = a[1] = a[2] = a[3] = a[4]= 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" } } */
index 0e4f1a71b6b55d8570b26acac6685600332f45d6..4e3448eccd7cd4cdb6448aea5038a3e650f597c6 100644 (file)
@@ -59,4 +59,4 @@ int main()
 
 /* We should also be able to use 2-lane SLP to initialize the real and
    imaginary components in the first loop of main.  */
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 2 "slp1" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 10 "slp1" } } */
index f5dc534079294d07a557c2f8bcb9cf763847eb34..27cba9beed3791deda16af8a38762cd165e14187 100644 (file)
@@ -22,6 +22,6 @@ void foo ()
    but we do want to vectorize the other two store groups.  But we may
    end up using scalar loads to vectorize the last group.  */
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 3 "slp2" } } */
 /* { dg-final { scan-tree-dump-times "BB vectorization with gaps at the end of a load is not supported" 1 "slp2" } } */
 /* { dg-final { scan-tree-dump-times " = c\\\[4\\\];" 1 "optimized" } } */
index f024dc781112504fb99812a103ba4fb8bc6948c4..dcba9a02d23be93a5860050aad4fdee2d5686706 100644 (file)
@@ -89,4 +89,4 @@ f6 (int n)
     }
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 6 "slp1" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 6 "slp1" } } */
index 11e8f0f8526fbf1c108e168d51951a457935e996..6b213d4da28d36ead9957530e0a2f980656a3340 100644 (file)
@@ -61,4 +61,4 @@ f4 (double *p, double *q)
     }
 }
 
-/* { dg-final { scan-tree-dump-not "basic block vectorized" "slp1" } } */
+/* { dg-final { scan-tree-dump-not "optimized: basic block" "slp1" } } */
index 1cca1d0d2654dcf5b91ed2d1a6dae8c5008ed30a..793f1859907bbe8e128a3689a3f1b08b2a0cf68d 100644 (file)
@@ -59,4 +59,4 @@ f4 (double *p, double *q, unsigned int start, unsigned int n)
     }
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 4 "slp1" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 4 "slp1" } } */
index 1aa3c8d1bac48ac81d33b201a282fad0f56041ef..599f718ecdcbbb10e2217c6179f1d5792c0c87aa 100644 (file)
@@ -44,4 +44,4 @@ f3 (double *p, double *q, unsigned int start, unsigned int n)
     }
 }
 
-/* { dg-final { scan-tree-dump-not "basic block vectorized" "slp1" } } */
+/* { dg-final { scan-tree-dump-not "optimized: basic block" "slp1" } } */
index 104d3fb89b04dc5d0dadcbdd860278d8592cec2f..7d82e94e97d803a068ea6b0dff6436d7c95305d8 100644 (file)
@@ -28,4 +28,4 @@ int e()
   return 0;
 }
 
-/* { dg-final { scan-tree-dump "basic block vectorized" "slp2" { target { { x86_64-*-* i?86-*-* } && ilp32 } } } } */
+/* { dg-final { scan-tree-dump "optimized: basic block" "slp2" { target { { x86_64-*-* i?86-*-* } && ilp32 } } } } */
index 49e75d8c95cbb977c8d64e9bfeca981bb5c322ed..5a831ae7efcf3ecd0e0464c4c21058d9b9601fd7 100644 (file)
@@ -16,5 +16,5 @@ v2df g(v2df a, v2df b)
 
 /* Verify we manage to vectorize this with using the original vectors
    and do not end up with any vector CTORs.  */
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 2 "slp2" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 2 "slp2" } } */
 /* { dg-final { scan-tree-dump-not "vect_cst" "slp2" } } */
index 0bfba01452de25158bd946d8223f70c3fffa799f..931fd46aaaad2144f71ed5cd482e9563c1fbea5f 100644 (file)
@@ -10,4 +10,4 @@ v4f32 f(v4f32 a, v4f32 b)
   return (v4f32){a[0] + b[0], a[1] + b[1], a[2] + b[2], a[3] + b[3]};
 }
 
-/* { dg-final { scan-tree-dump "basic block vectorized" "slp2" } } */
+/* { dg-final { scan-tree-dump "optimized: basic block" "slp2" } } */
index 5de46719101e9d3ea1c4ab2434cba88c31e04623..edcaf17728e2d134679e2a530adb68c3dc56c30e 100644 (file)
@@ -14,4 +14,4 @@ void foo()
 
 /* The scalar shift argument should be extracted from the available vector.  */
 /* { dg-final { scan-tree-dump "BIT_FIELD_REF" "slp2" } } */
-/* { dg-final { scan-tree-dump "basic block vectorized" "slp2" } } */
+/* { dg-final { scan-tree-dump "optimized: basic block" "slp2" } } */
index 39c23c397e7ed18652488907e9473efe8bcd43dc..40a02ed1309e2b6b4dc44cf56018a4bb71cc519f 100644 (file)
@@ -41,4 +41,4 @@ main (int argc, char **argv)
 }
 
 /* { dg-final { scan-tree-dump-times "Basic block will be vectorized using SLP" 1 "slp2" } } */
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 2 "slp2" } } */
index 36938d05d100f598904c944653eaacd3c60ce8d6..968cdf1cc515301c4fbb9981b60dee72c34e237e 100644 (file)
@@ -39,4 +39,4 @@ main (int argc, char **argv)
 }
 
 /* { dg-final { scan-tree-dump-times "Basic block will be vectorized using SLP" 1 "slp2" } } */
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" } } */
index 6ae9a8976865f5f0f6d87521003e847df7faef98..fe36f90bb9020048c40c42465891c9ee8e278b3f 100644 (file)
@@ -38,4 +38,4 @@ main (int argc, char **argv)
 }
 
 /* { dg-final { scan-tree-dump-times "Basic block will be vectorized using SLP" 1 "slp2" } } */
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 2 "slp2" } } */
index 915a962619264bf3ee492f725a2dfc584d1f6d9f..df0191815aad5468557a840cc2d9119cf2da5d4f 100644 (file)
@@ -38,4 +38,4 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2"  { xfail  { vect_no_align && { ! vect_hw_misalign } } } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2"  { xfail  { vect_no_align && { ! vect_hw_misalign } } } } } */
index 5121a88efea3c2320eb9a306f1717c263efc10f2..819c4f62f696a176ddb4067ec60c6fcf2e43368a 100644 (file)
@@ -25,4 +25,4 @@ foo ()
 }
 
 /* { dg-final { scan-tree-dump-not "vectorization is not profitable" "slp2" } } */
-/* { dg-final { scan-tree-dump "basic block vectorized" "slp2" } } */
+/* { dg-final { scan-tree-dump "optimized: basic block" "slp2" } } */
index 1c75c87ead2db9ab4e30ea9e8f5e89dd1e7fd154..cfea8723ba2731c334c1fffd749dc157d8f68e36 100644 (file)
@@ -45,4 +45,4 @@ main ()
   return main1 ();
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" { target { vect_call_copysignf && vect_call_sqrtf } } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" { target { vect_call_copysignf && vect_call_sqrtf } } } } */
index 49a7c057ee26529a3d57fc3819b1b0044060e2ba..6d67d12f9961f5cbc53d6f7df5240ac2178a08ac 100644 (file)
@@ -63,4 +63,4 @@ main ()
   return main1 ();
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 2 "slp2" { target vect_call_lrint } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 2 "slp2" { target vect_call_lrint } } } */
index c7f9cd3c59896304b4e595f384113ba4a52d2038..2202362f3ae3d816971a6285272d49ef3fcf3e7b 100644 (file)
@@ -47,5 +47,5 @@ int main (void)
   return 0;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" { target vect_int_mult } } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" { target vect_int_mult } } } */
   
index 8fe67f45faa4651b4d5a479c456222e58a955692..e837418a87bc4696779695e300b13c6f2de1720a 100644 (file)
@@ -13,4 +13,4 @@ A sum(A a,A b)
   return a;
 }
 
-/* { dg-final { scan-tree-dump-times "basic block vectorized" 1 "slp2" } } */
+/* { dg-final { scan-tree-dump-times "optimized: basic block" 1 "slp2" } } */
index ef379c4701a3a5de98cc9f920331911ae5e36548..dfa8977580a5d2174ef2e351f9c76e4ea8b13b55 100644 (file)
@@ -15,5 +15,5 @@ pack (double a, double aa)
 /* The function should be optimized to just return as arguments and
    result exactly overlap even when previously vectorized.  */
 
-/* { dg-final { scan-tree-dump "basic block vectorized" "slp2" } } */
+/* { dg-final { scan-tree-dump "optimized: basic block" "slp2" } } */
 /* { dg-final { scan-assembler-not "mov" } } */
index 65117f1dc08c96c2118688290f974b4ab2c53ba0..994ada66c762d7cdf57d7ada4ab6ac42f3bb981a 100644 (file)
@@ -19,4 +19,4 @@ uint64_pair_t pair(int num)
 }
 
 /* See PR92266 for the XFAIL.  */
-/* { dg-final { scan-tree-dump-not "basic block vectorized" "slp2" { xfail ilp32 } } } */
+/* { dg-final { scan-tree-dump-not "optimized: basic block" "slp2" { xfail ilp32 } } } */
index 8f5b6d62a2b9743bb954e1f192469e1044f9d74a..0c4e103148628787eefec109d4db29d6ac41b843 100644 (file)
@@ -8,4 +8,4 @@
       y(3)=y(3)+alpha*x(3)
       y(4)=y(4)+alpha*x(4)
       end
-! { dg-final { scan-tree-dump "basic block vectorized" "slp2" } }
+! { dg-final { scan-tree-dump "optimized: basic block" "slp2" } }
index e0614fb472f1584a937b1732b64b483b68cbd866..568fc5d3a90dd23281995141337a6e46be0b8049 100644 (file)
@@ -2407,14 +2407,15 @@ vect_analyze_slp_instance (vec_info *vinfo,
          bool res = vect_analyze_slp_instance (vinfo, bst_map, stmt_info,
                                                max_tree_size);
          /* If the first non-match was in the middle of a vector,
-            skip the rest of that vector.  */
+            skip the rest of that vector.  Do not bother to re-analyze
+            single stmt groups.  */
          if (group1_size < i)
            {
              i = group1_size + const_nunits;
-             if (i < group_size)
+             if (i + 1 < group_size)
                rest = vect_split_slp_store_group (rest, const_nunits);
            }
-         if (i < group_size)
+         if (i + 1 < group_size)
            res |= vect_analyze_slp_instance (vinfo, bst_map,
                                              rest, max_tree_size);
          return res;
index 37e36f556e54662e329d22d2ebff7162451f54a3..626f0ce314612eac10c1935bd4be6203a99ad681 100644 (file)
@@ -1052,9 +1052,6 @@ try_vectorize_loop_1 (hash_table<simduid_to_vf> *&simduid_to_vf_htab,
            }
          if (!require_loop_vectorize && vect_slp_bb (bb))
            {
-             if (dump_enabled_p ())
-               dump_printf_loc (MSG_NOTE, vect_location,
-                                "basic block vectorized\n");
              fold_loop_internal_call (loop_vectorized_call,
                                       boolean_true_node);
              loop_vectorized_call = NULL;
@@ -1429,11 +1426,7 @@ pass_slp_vectorize::execute (function *fun)
     }
 
   FOR_EACH_BB_FN (bb, fun)
-    {
-      if (vect_slp_bb (bb))
-       if (dump_enabled_p ())
-         dump_printf_loc (MSG_NOTE, vect_location, "basic block vectorized\n");
-    }
+    vect_slp_bb (bb);
 
   if (!in_loop_pipeline)
     {