111
|
1 void bar ();
|
|
2
|
|
3 int toto()
|
|
4 {
|
|
5 int i,j, b;
|
|
6 int a[100];
|
|
7
|
|
8 switch (i)
|
|
9 {
|
|
10
|
|
11 case 5:
|
|
12 for (j = 0; j <= 20; j++)
|
|
13 a[j] = b + i + 12;
|
|
14 break;
|
|
15 case 8:
|
|
16 for (j = 0; j <= 20; j++)
|
|
17 a[j] = b + i + 122;
|
|
18 break;
|
|
19 case 15:
|
|
20 for (j = 0; j <= 20; j++)
|
|
21 a[j] = b + i + 12;
|
|
22 break;
|
|
23 case 18:
|
|
24 for (j = 0; j <= 20; j++)
|
|
25 a[j] = b + i + 4;
|
|
26 break;
|
|
27 default:
|
|
28 for (j = 0; j <= 20; j++)
|
|
29 a[j] = b + i + 3;
|
|
30 }
|
|
31
|
|
32 return a[b];
|
|
33 }
|
|
34
|
|
35 /* { dg-final { scan-tree-dump-times "number of SCoPs: 0" 1 "graphite"} } */
|