replace CLooG test cases with schedule tree versions
[isl.git] / test_inputs / codegen / cloog / reservoir-mg-interp.c
blobc5d7774abc81df8394ab41ecc6a87baf87137a7c
2 if (N >= 2)
3 for (int c0 = 1; c0 < O; c0 += 1) {
4 for (int c3 = 1; c3 <= M; c3 += 1)
5 S1(c0, 1, c3);
6 for (int c3 = 1; c3 < M; c3 += 1) {
7 S6(c0, 1, c3);
8 S7(c0, 1, c3);
10 if (N >= 3) {
11 for (int c3 = 1; c3 <= M; c3 += 1)
12 S3(c0, 1, c3);
13 for (int c3 = 1; c3 <= M; c3 += 1)
14 S1(c0, 2, c3);
15 for (int c3 = 1; c3 < M; c3 += 1) {
16 S6(c0, 2, c3);
17 S7(c0, 2, c3);
19 for (int c3 = 1; c3 < M; c3 += 1)
20 S11(c0, 1, c3);
21 } else {
22 for (int c3 = 1; c3 <= M; c3 += 1)
23 S3(c0, 1, c3);
24 for (int c3 = 1; c3 < M; c3 += 1)
25 S11(c0, 1, c3);
27 for (int c1 = 3; c1 < 2 * N - 4; c1 += 2) {
28 for (int c3 = 1; c3 < M; c3 += 1)
29 S10(c0, (c1 - 1) / 2, c3);
30 for (int c3 = 1; c3 <= M; c3 += 1)
31 S3(c0, (c1 + 1) / 2, c3);
32 for (int c3 = 1; c3 <= M; c3 += 1)
33 S1(c0, (c1 + 3) / 2, c3);
34 for (int c3 = 1; c3 < M; c3 += 1) {
35 S6(c0, (c1 + 3) / 2, c3);
36 S7(c0, (c1 + 3) / 2, c3);
38 for (int c3 = 1; c3 < M; c3 += 1)
39 S11(c0, (c1 + 1) / 2, c3);
41 if (N >= 3) {
42 for (int c3 = 1; c3 < M; c3 += 1)
43 S10(c0, N - 2, c3);
44 for (int c3 = 1; c3 <= M; c3 += 1)
45 S3(c0, N - 1, c3);
46 for (int c3 = 1; c3 < M; c3 += 1)
47 S11(c0, N - 1, c3);
49 for (int c3 = 1; c3 < M; c3 += 1)
50 S10(c0, N - 1, c3);
52 for (int c0 = 1; c0 < O; c0 += 1)
53 for (int c1 = 1; c1 < N; c1 += 1) {
54 for (int c3 = 1; c3 <= M; c3 += 1)
55 S2(c0, c1, c3);
56 for (int c3 = 1; c3 < M; c3 += 1)
57 S8(c0, c1, c3);
58 for (int c3 = 1; c3 < M; c3 += 1)
59 S9(c0, c1, c3);
61 for (int c0 = 1; c0 < O; c0 += 1)
62 for (int c1 = 1; c1 < N; c1 += 1)
63 for (int c2 = 1; c2 < M; c2 += 1)
64 S4(c0, c1, c2);
65 for (int c0 = 1; c0 < O; c0 += 1)
66 for (int c1 = 1; c1 < N; c1 += 1)
67 for (int c2 = 1; c2 < M; c2 += 1)
68 S5(c0, c1, c2);
69 for (int c0 = R; c0 < O; c0 += 1)
70 for (int c1 = Q; c1 < N; c1 += 1)
71 for (int c2 = P; c2 < M; c2 += 1)
72 S12(c0, c1, c2);
73 for (int c0 = R; c0 < O; c0 += 1)
74 for (int c1 = Q; c1 < N; c1 += 1)
75 for (int c2 = 1; c2 < M; c2 += 1)
76 S13(c0, c1, c2);
77 for (int c0 = R; c0 < O; c0 += 1)
78 for (int c1 = 1; c1 < N; c1 += 1)
79 for (int c2 = P; c2 < M; c2 += 1)
80 S14(c0, c1, c2);
81 for (int c0 = R; c0 < O; c0 += 1)
82 for (int c1 = 1; c1 < N; c1 += 1)
83 for (int c2 = 1; c2 < M; c2 += 1)
84 S15(c0, c1, c2);