1 /* { dg-require-effective-target size32plus } */
toto()2 int toto()
3 {
4 int i, j, k;
5 int a[100][200];
6 int b[100];
7
8 for (i = 1; i < 100; i++)
9 {
10 for (j = 1; j < 80; j++)
11 a[j][i] = a[j+1][2*i-1*j] + 12;
12
13 b[i] = b[i-1] + 10;
14
15 for (j = 1; j < 60; j++)
16 a[j][i] = a[j+1][i-1] + 8;
17
18 if (i == 23)
19 b[i] = a[i-1][i] + 6;
20
21 for (j = 1; j < 40; j++)
22 a[j][i] = a[j+1][i-1] + 4;
23 }
24
25 return a[3][5] + b[1];
26 }
27
28 /* { dg-final { scan-tree-dump-times "number of SCoPs: 1" 1 "graphite"} } */
29