| int toto() | |
| { | |
| int i,j, b; | |
| int a[100]; | |
| if (i == 20) | |
| { | |
| for (j = 0; j <= 20; j++) | |
| a[j] = b + i; | |
| for (j = 2; j <= 23; j++) | |
| a[j] = b + i; | |
| b = 3; | |
| } | |
| else if (i == 12) | |
| { | |
| if (i == 30) | |
| { | |
| for (j = 0; j <= 30; j++) | |
| a[j] = b + i; | |
| b = 5; | |
| } | |
| else | |
| { | |
| for (j = 0; j <= 40; j++) | |
| a[j] = b + i; | |
| b = 8; | |
| } | |
| } | |
| else if (i == 10) | |
| { | |
| b = 8; | |
| } | |
| for (j = 0; j <= 40; j++) | |
| a[j] = b + i; | |
| return a[b]; | |
| } | |
| /* { dg-final { scan-tree-dump-times "number of SCoPs: 1" 1 "graphite"} } */ |