gcc/

[pf3gnuchains/gcc-fork.git] / gcc / testsuite / g++.dg / tree-ssa / pr19807.C

diff --git a/gcc/testsuite/g++.dg/tree-ssa/pr19807.C b/gcc/testsuite/g++.dg/tree-ssa/pr19807.C
index 0ff10db..bba79a9 100644 (file)
--- a/gcc/testsuite/g++.dg/tree-ssa/pr19807.C
+++ b/gcc/testsuite/g++.dg/tree-ssa/pr19807.C
@@ -19,6 +19,12 @@ void bar(int i)
 }
 
 /* { dg-final { scan-tree-dump-times "&a\\\[2\\\]" 3 "optimized" } } */
-/* { dg-final { scan-tree-dump-times "&a\\\[.* - 1\\\]" 1 "optimized" } } */
-/* { dg-final { scan-tree-dump-times "&a\\\[.* \\+ 1\\\]" 1 "optimized" } } */
+
+/* We want &a[D.bla + 1] and &a[D.foo - 1] in the final code, but
+   tuples mean that the offset is calculated in a separate instruction.
+   Simply test for the existence of +1 and -1 once, which also ensures
+   the above.  If the addition/subtraction would be applied to the
+   pointer we would instead see +-4 (or 8, depending on sizeof(int)).  */
+/* { dg-final { scan-tree-dump-times "\\\+ -1;" 1 "optimized" } } */
+/* { dg-final { scan-tree-dump-times "\\\+ 1;" 1 "optimized" } } */
 /* { dg-final { cleanup-tree-dump "optimized" } } */