test_inputs/codegen/cloog/vivien2.c

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