add faber test case from CLooG
[isl.git] / test_inputs / codegen / cloog / reservoir-liu-zhuge1.c
blob9c9847125f7b2fb0d438585fd2e2feef0846757f
1 if (M >= 0 && N >= 0)
2 for (int c1 = -4; c1 <= 3 * M + N; c1 += 1) {
3 if (c1 >= 3 * M) {
4 S2(M, -3 * M + c1);
5 } else if (3 * M >= c1 + 4 && (c1 + 4) % 3 == 0)
6 S1((c1 + 4) / 3, 0);
7 for (int c3 = max(-3 * M + c1 + 3, (c1 + 6) % 3); c3 <= min(N - 1, c1); c3 += 3) {
8 S2((c1 - c3) / 3, c3);
9 S1(((c1 - c3) / 3) + 1, c3 + 1);
11 if (3 * M + N >= c1 + 3 && c1 >= N && (-N + c1) % 3 == 0) {
12 S2((-N + c1) / 3, N);
13 } else if (N >= c1 + 4 && c1 >= -3)
14 S1(0, c1 + 4);
15 for (int c3 = max(-3 * M + c1, (c1 + 6) % 3); c3 <= min(N, c1); c3 += 3)
16 S3((c1 - c3) / 3, c3);