OpenCores
URL https://opencores.org/ocsvn/openrisc_me/openrisc_me/trunk

Subversion Repositories openrisc_me

[/] [openrisc/] [trunk/] [gnu-src/] [gcc-4.5.1/] [gcc/] [testsuite/] [g++.dg/] [tree-ssa/] [pr19807.C] - Blame information for rev 320

Go to most recent revision | Details | Compare with Previous | View Log

Line No. Rev Author Line
1 301 jeremybenn
/* { dg-do compile } */
2
/* { dg-options "-O -fdump-tree-optimized" } */
3
 
4
int a[4];
5
int *x, *y, *z;
6
 
7
void foo(void)
8
{
9
        x = &a[3] - 1;
10
        y = &a[1] + 1;
11
        z = 1 + &a[1];
12
}
13
 
14
void bar(int i)
15
{
16
        x = &a[i] - 1;
17
        y = &a[i] + 1;
18
        z = 1 + &a[i];
19
}
20
 
21
/* { dg-final { scan-tree-dump-times "&a\\\[2\\\]" 3 "optimized" } } */
22
 
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" } } */

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.