Home | History | Annotate | Line # | Download | only in cloog 
      1  1.1  mrg for (int c0 = -27 * n + 2; c0 <= 1; c0 += 1)
      2  1.1  mrg   S1(c0 - 1);
      3  1.1  mrg for (int c0 = 2; c0 <= min(2 * n, n + 29); c0 += 1) {
      4  1.1  mrg   if (c0 >= 3) {
      5  1.1  mrg     if (2 * n >= c0 + 1) {
      6  1.1  mrg       S4(c0 - c0 / 2 - 1, c0 / 2 + 1);
      7  1.1  mrg       if (c0 + 2 >= 2 * n) {
      8  1.1  mrg         for (int c2 = 1; c2 < -n + c0; c2 += 1)
      9  1.1  mrg           S5(-n + c0, n, c2);
     10  1.1  mrg       } else if (c0 >= 5) {
     11  1.1  mrg         S4(c0 - c0 / 2 - 2, c0 / 2 + 2);
     12  1.1  mrg         for (int c2 = 1; c2 < c0 - c0 / 2 - 1; c2 += 1)
     13  1.1  mrg           S5(c0 - c0 / 2 - 1, c0 / 2 + 1, c2);
     14  1.1  mrg       }
     15  1.1  mrg     }
     16  1.1  mrg     for (int c1 = -c0 + c0 / 2 + 3; c1 <= min(-1, n - c0); c1 += 1) {
     17  1.1  mrg       S4(-c1, c0 + c1);
     18  1.1  mrg       S6(-c1 + 2, c0 + c1 - 2);
     19  1.1  mrg       for (int c2 = 1; c2 <= -c1; c2 += 1)
     20  1.1  mrg         S5(-c1 + 1, c0 + c1 - 1, c2);
     21  1.1  mrg     }
     22  1.1  mrg     if (2 * n >= c0 + 3 && c0 >= n + 2) {
     23  1.1  mrg       S6(-n + c0 + 1, n - 1);
     24  1.1  mrg       for (int c2 = 1; c2 < -n + c0; c2 += 1)
     25  1.1  mrg         S5(-n + c0, n, c2);
     26  1.1  mrg     }
     27  1.1  mrg     if (c0 >= n + 3 && 2 * n >= c0 + 1)
     28  1.1  mrg       S6(-n + c0, n);
     29  1.1  mrg     if (c0 >= n + 3) {
     30  1.1  mrg       S1(c0 - 1);
     31  1.1  mrg     } else {
     32  1.1  mrg       if (n + 1 >= c0 && c0 <= 4) {
     33  1.1  mrg         S1(c0 - 1);
     34  1.1  mrg       } else if (c0 >= 5 && n + 1 >= c0) {
     35  1.1  mrg         S1(c0 - 1);
     36  1.1  mrg         S6(2, c0 - 2);
     37  1.1  mrg       }
     38  1.1  mrg       if (n + 1 >= c0) {
     39  1.1  mrg         S6(1, c0 - 1);
     40  1.1  mrg       } else if (n >= 3) {
     41  1.1  mrg         S1(n + 1);
     42  1.1  mrg         S6(2, n);
     43  1.1  mrg       }
     44  1.1  mrg     }
     45  1.1  mrg     if (n == 2 && c0 == 4)
     46  1.1  mrg       S1(3);
     47  1.1  mrg   } else {
     48  1.1  mrg     S1(1);
     49  1.1  mrg   }
     50  1.1  mrg   if (c0 % 2 == 0)
     51  1.1  mrg     S3(c0 / 2);
     52  1.1  mrg   for (int c1 = max(1, -n + c0); c1 < (c0 + 1) / 2; c1 += 1)
     53  1.1  mrg     S2(c0 - c1, c1);
     54  1.1  mrg }
     55  1.1  mrg for (int c0 = max(2 * n + 1, -27 * n + 2); c0 <= n + 29; c0 += 1)
     56  1.1  mrg   S1(c0 - 1);
     57  1.1  mrg for (int c0 = n + 30; c0 <= 2 * n; c0 += 1) {
     58  1.1  mrg   if (2 * n >= c0 + 1) {
     59  1.1  mrg     S4(c0 - c0 / 2 - 1, c0 / 2 + 1);
     60  1.1  mrg     if (c0 + 2 >= 2 * n) {
     61  1.1  mrg       for (int c2 = 1; c2 < -n + c0; c2 += 1)
     62  1.1  mrg         S5(-n + c0, n, c2);
     63  1.1  mrg     } else {
     64  1.1  mrg       S4(c0 - c0 / 2 - 2, c0 / 2 + 2);
     65  1.1  mrg       for (int c2 = 1; c2 < c0 - c0 / 2 - 1; c2 += 1)
     66  1.1  mrg         S5(c0 - c0 / 2 - 1, c0 / 2 + 1, c2);
     67  1.1  mrg     }
     68  1.1  mrg     for (int c1 = -c0 + c0 / 2 + 3; c1 <= n - c0; c1 += 1) {
     69  1.1  mrg       S4(-c1, c0 + c1);
     70  1.1  mrg       S6(-c1 + 2, c0 + c1 - 2);
     71  1.1  mrg       for (int c2 = 1; c2 <= -c1; c2 += 1)
     72  1.1  mrg         S5(-c1 + 1, c0 + c1 - 1, c2);
     73  1.1  mrg     }
     74  1.1  mrg     if (2 * n >= c0 + 3) {
     75  1.1  mrg       S6(-n + c0 + 1, n - 1);
     76  1.1  mrg       for (int c2 = 1; c2 < -n + c0; c2 += 1)
     77  1.1  mrg         S5(-n + c0, n, c2);
     78  1.1  mrg     }
     79  1.1  mrg     S6(-n + c0, n);
     80  1.1  mrg   }
     81  1.1  mrg   if (c0 % 2 == 0)
     82  1.1  mrg     S3(c0 / 2);
     83  1.1  mrg   for (int c1 = -n + c0; c1 < (c0 + 1) / 2; c1 += 1)
     84  1.1  mrg     S2(c0 - c1, c1);
     85  1.1  mrg }
     86