re PR tree-optimization/33291 (a+=2; a+=2 not simplified to a+=4; with -O3 ...
[gcc.git] / gcc / testsuite / gcc.dg / tree-ssa / ssa-sccvn-2.c
1 /* { dg-do compile } */
2 /* { dg-options "-O2 -fdump-tree-fre-stats" } */
3
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;
11 for (i=0; i<stop; i++) {
12 int k = data[2];
13 data[k] = 2;
14 data[0] = m - n;
15 k = data[1];
16 m = m + k;
17 n = n + k;
18 p = data[0];
19 }
20 return p;
21 }
22 /* We should eliminate m - n, and set n = n + k into n = m, and
23 set p to 0 */
24 /* { dg-final { scan-tree-dump-times "Eliminated: 3" 1 "fre"} } */
25 /* { dg-final { cleanup-tree-dump "fre" } } */