@@ -1,5 +1,5 @@
/* { dg-do compile } */
-/* { dg-options "-O2 -fdump-tree-optimized-raw" } */
+/* { dg-options "-O2 -fdump-tree-cddce1-raw" } */
/* PR tree-optimization/115238 */
@@ -10,6 +10,8 @@ void f(int a, vector8 int *b)
a = 1;
*b = a | ((~a) ^ *b);
}
-/* { dg-final { scan-tree-dump-not "bit_xor_expr, " "optimized" } } */
-/* { dg-final { scan-tree-dump-times "bit_ior_expr, " 1 "optimized" } } */
-/* { dg-final { scan-tree-dump-times "bit_not_expr, " 1 "optimized" } } */
+/* Scan early on in the phases before the vector has possibily been split
+ but late enough after forwprop or other match-simplify has happened though. */
+/* { dg-final { scan-tree-dump-not "bit_xor_expr, " "cddce1" } } */
+/* { dg-final { scan-tree-dump-times "bit_ior_expr, " 1 "cddce1" } } */
+/* { dg-final { scan-tree-dump-times "bit_not_expr, " 1 "cddce1" } } */
This just moves the tree scan earlier so we can detect the optimization and not need to detect the vector splitting too. Committed as obvious after a quick test. gcc/testsuite/ChangeLog: * gcc.dg/tree-ssa/bitops-9.c: Look at cdcde1 rather than optmization. Signed-off-by: Andrew Pinski <quic_apinski@quicinc.com> --- gcc/testsuite/gcc.dg/tree-ssa/bitops-9.c | 10 ++++++---- 1 file changed, 6 insertions(+), 4 deletions(-)