2018-05-18 Richard Biener <rguenther@suse.de>
[official-gcc.git] / gcc / testsuite / gcc.dg / graphite / scop-6.c
blob9bc1d9f4ccd0ef6b368eebd3485ec1b07d23256a
1 void bar (void);
3 int toto()
5 int i, j, k;
6 int a[100][100];
7 int b[100];
9 for (i = 1; i < 100; i++)
11 for (j = 1; j < 100; j++)
12 b[i+j] = b[i+j-1] + 2;
14 if (i * 2 == i + 8)
15 b[i+k] = b[i+k-1] + 2;
16 else
18 for (k = 1; k < 100; k++)
19 b[i+k] = b[i+k-1] + 2;
22 for (k = 1; k < 100; k++)
23 b[i+k] = b[i+k-5] + 2;
26 return a[3][5] + b[2];
29 /* { dg-final { scan-tree-dump-times "number of SCoPs: 1" 1 "graphite"} } */