1 /* { dg-do compile } */
2 /* { dg-options "-O -fdump-tree-optimized" } */
21 /* { dg-final { scan-tree-dump-times "&a\\\[2\\\]" 3 "optimized" } } */
23 /* We want &a[D.bla + 1] and &a[D.foo - 1] in the final code, but
24 tuples mean that the offset is calculated in a separate instruction.
25 Simply test for the existence of +1 and -1 once, which also ensures
26 the above. If the addition/subtraction would be applied to the
27 pointer we would instead see +-4 (or 8, depending on sizeof(int)). */
28 /* { dg-final { scan-tree-dump-times "\\\+ -1;" 1 "optimized" } } */
29 /* { dg-final { scan-tree-dump-times "\\\+ 1;" 1 "optimized" } } */
30 /* { dg-final { cleanup-tree-dump "optimized" } } */