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