isl_ast_build_ast_from_schedule: use "<" if upper bound has negative constant
[isl.git] / test_inputs / codegen / cloog / reservoir-QR.c
blob253791a50b01839d5e0bc6e2ebfe769139e2d1ca
1 if (N >= 1) {
2 S1(0);
3 if (N == 1) {
4 for (int c3 = 0; c3 < M; c3 += 1)
5 S2(0, c3);
6 S3(0);
7 for (int c3 = 0; c3 < M; c3 += 1)
8 S4(0, c3);
9 S10(0);
10 S5(0);
11 } else {
12 for (int c3 = 0; c3 < M; c3 += 1)
13 S2(0, c3);
14 S3(0);
15 for (int c3 = 0; c3 < M; c3 += 1)
16 S4(0, c3);
17 S10(0);
18 S1(1);
19 S5(0);
21 for (int c1 = 2; c1 < N; c1 += 1) {
22 for (int c3 = c1 - 1; c3 < N; c3 += 1) {
23 S6(c1 - 2, c3);
24 for (int c5 = c1 - 2; c5 < M; c5 += 1)
25 S7(c1 - 2, c3, c5);
26 S8(c1 - 2, c3);
27 for (int c5 = c1 - 2; c5 < M; c5 += 1)
28 S9(c1 - 2, c3, c5);
30 for (int c3 = c1 - 1; c3 < M; c3 += 1)
31 S2(c1 - 1, c3);
32 S3(c1 - 1);
33 for (int c3 = c1 - 1; c3 < M; c3 += 1)
34 S4(c1 - 1, c3);
35 S10(c1 - 1);
36 S1(c1);
37 S5(c1 - 1);
39 if (N >= 2) {
40 S6(N - 2, N - 1);
41 for (int c5 = N - 2; c5 < M; c5 += 1)
42 S7(N - 2, N - 1, c5);
43 S8(N - 2, N - 1);
44 for (int c5 = N - 2; c5 < M; c5 += 1)
45 S9(N - 2, N - 1, c5);
46 for (int c3 = N - 1; c3 < M; c3 += 1)
47 S2(N - 1, c3);
48 S3(N - 1);
49 for (int c3 = N - 1; c3 < M; c3 += 1)
50 S4(N - 1, c3);
51 S10(N - 1);
52 S5(N - 1);