===================================================================
@@ -16,7 +16,7 @@ f (int c, int s)
return x1 + x2;
}
-/* { dg-final { scan-tree-dump-times " \\* y" 1 "optimized" } } */
-/* { dg-final { scan-tree-dump-times " \\* 2" 1 "optimized" } } */
+/* { dg-final { scan-tree-dump-times " \\* " 2 "optimized" } } */
+/* { dg-final { scan-tree-dump-times " \\* 2;" 1 "optimized" } } */
/* { dg-final { cleanup-tree-dump "optimized" } } */
===================================================================
@@ -15,6 +15,6 @@ int main(void)
printf ("%d %d\n", e, f);
}
-/* { dg-final { scan-tree-dump-times "b.._. \\\+ a.._." 1 "optimized" } } */
+/* { dg-final { scan-tree-dump-times "\[ab\].._. \\\+ \[ab\].._." 1 "optimized" } } */
/* { dg-final { scan-tree-dump-times " \\\+ " 2 "optimized" } } */
/* { dg-final { cleanup-tree-dump "optimized" } } */