Relax ix86_hardreg_mov_ok after split1.
[official-gcc.git] / gcc / testsuite / gcc.dg / tree-ssa / ssa-sccvn-4.c
blob500c7b6dc0e8044eafe78023a677959bb30ea1ab
1 /* { dg-do compile } */
2 /* { dg-options "-O2 -fdump-tree-fre1-stats" } */
4 int vnum_test8(int *data)
5 {
6 int i;
7 int stop = data[3];
8 int m = data[4];
9 int n = m;
10 int p = 0;
12 for (i=0; i<stop; i++) {
13 int k = data[2];
14 data[5] = 0;
15 if (i < 30)
16 data[5] = m - n;
17 p = data[5];
18 k = data[1];
19 m = m + k;
20 n = n + k;
22 return p;
24 /* We should eliminate m - n, n + k, set data[5] = 0, eliminate the
25 address arithmetic for data[5], and set p = 0.
26 /* { dg-final { scan-tree-dump-times "Eliminated: 5" 1 "fre1"} } */