replace CLooG test cases with schedule tree versions
[isl.git] / test_inputs / codegen / cloog / vasilache.c
blob7dfadcf0c4e958178447d68b75620ea23ae24af2
2 S1();
3 S2();
4 for (int c0 = 0; c0 < N; c0 += 1)
5 for (int c1 = 0; c1 < N; c1 += 1) {
6 S4(c0, c1);
7 S5(c0, c1);
9 for (int c0 = 0; c0 < N; c0 += 1)
10 for (int c1 = 0; c1 < N; c1 += 1)
11 for (int c2 = 0; c2 <= (N - 1) / 32; c2 += 1) {
12 S7(c0, c1, c2, 32 * c2);
13 for (int c3 = 32 * c2 + 1; c3 <= min(N - 1, 32 * c2 + 31); c3 += 1) {
14 S6(c0, c1, c2, c3 - 1);
15 S7(c0, c1, c2, c3);
17 if (32 * c2 + 31 >= N) {
18 S6(c0, c1, c2, N - 1);
19 } else
20 S6(c0, c1, c2, 32 * c2 + 31);
22 S8();