isl_basic_set_sort_constraints: take into account all coefficients
[isl.git] / test_inputs / codegen / omega / wak1-1.c
bloba925f6131bcd8174e4c9acb1323aace749b8d7fc
2 for (int c0 = a3; c0 <= min(min(a2 - 1, b3), a1 - 1); c0 += 1)
3 s2(c0);
4 for (int c0 = a2; c0 <= min(min(b2, a3 - 1), a1 - 1); c0 += 1)
5 s1(c0);
6 for (int c0 = max(a3, a2); c0 <= min(min(b2, b3), a1 - 1); c0 += 1) {
7 s1(c0);
8 s2(c0);
10 for (int c0 = max(max(a3, a2), b2 + 1); c0 <= min(b3, a1 - 1); c0 += 1)
11 s2(c0);
12 for (int c0 = a1; c0 <= min(min(a2 - 1, a3 - 1), b1); c0 += 1)
13 s0(c0);
14 for (int c0 = max(a1, a3); c0 <= min(min(a2 - 1, b3), b1); c0 += 1) {
15 s0(c0);
16 s2(c0);
18 for (int c0 = max(max(a1, b1 + 1), a3); c0 <= min(a2 - 1, b3); c0 += 1)
19 s2(c0);
20 for (int c0 = max(a1, a2); c0 <= min(min(b2, a3 - 1), b1); c0 += 1) {
21 s0(c0);
22 s1(c0);
24 for (int c0 = max(max(a1, b1 + 1), a2); c0 <= min(b2, a3 - 1); c0 += 1)
25 s1(c0);
26 for (int c0 = max(max(a1, a3), a2); c0 <= min(min(b2, b3), b1); c0 += 1) {
27 s0(c0);
28 s1(c0);
29 s2(c0);
31 for (int c0 = max(max(max(a1, b1 + 1), a3), a2); c0 <= min(b2, b3); c0 += 1) {
32 s1(c0);
33 s2(c0);
35 for (int c0 = max(max(a1, a2), b2 + 1); c0 <= min(a3 - 1, b1); c0 += 1)
36 s0(c0);
37 for (int c0 = max(max(max(a1, a3), a2), b2 + 1); c0 <= min(b3, b1); c0 += 1) {
38 s0(c0);
39 s2(c0);
41 for (int c0 = max(max(max(max(a1, b1 + 1), a3), a2), b2 + 1); c0 <= b3; c0 += 1)
42 s2(c0);
43 for (int c0 = max(max(a3, b3 + 1), a2); c0 <= min(b2, a1 - 1); c0 += 1)
44 s1(c0);
45 for (int c0 = max(max(a1, a3), b3 + 1); c0 <= min(a2 - 1, b1); c0 += 1)
46 s0(c0);
47 for (int c0 = max(max(max(a1, a3), b3 + 1), a2); c0 <= min(b2, b1); c0 += 1) {
48 s0(c0);
49 s1(c0);
51 for (int c0 = max(max(max(max(a1, b1 + 1), a3), b3 + 1), a2); c0 <= b2; c0 += 1)
52 s1(c0);
53 for (int c0 = max(max(max(max(a1, a3), b3 + 1), a2), b2 + 1); c0 <= b1; c0 += 1)
54 s0(c0);