test_inputs/codegen/cloog/vivien.c

   1 for (int c0 = -27 * n + 2; c0 <= 1; c0 += 1)
   2   S1(c0 - 1);
   3 for (int c0 = 2; c0 <= min(2 * n, n + 29); c0 += 1) {
   4   if (c0 >= 3) {
   5     if (2 * n >= c0 + 1) {
   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 - c0 / 2 - 1; c2 += 1)
  13           S5(c0 - c0 / 2 - 1, c0 / 2 + 1, c2);
  14       }
  15     }
  16     for (int c1 = -c0 + c0 / 2 + 3; c1 <= min(-1, n - c0); 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 (n >= 3 && c0 == n + 2) {
  28       S1(n + 1);
  29       S6(2, n);
  30     } else {
  31       if (c0 >= n + 3 && 2 * n >= c0 + 1)
  32         S6(-n + c0, n);
  33       if (c0 >= n + 3) {
  34         S1(c0 - 1);
  35       } else {
  36         if (n + 1 >= c0 && c0 <= 4) {
  37           S1(c0 - 1);
  38         } else if (c0 >= 5 && n + 1 >= c0) {
  39           S1(c0 - 1);
  40           S6(2, c0 - 2);
  41         }
  42         if (n + 1 >= c0)
  43           S6(1, c0 - 1);
  44       }
  45     }
  46     if (n == 2 && c0 == 4)
  47       S1(3);
  48   } else {
  49     S1(1);
  50   }
  51   if (c0 % 2 == 0)
  52     S3(c0 / 2);
  53   for (int c1 = max(1, -n + c0); c1 < (c0 + 1) / 2; c1 += 1)
  54     S2(c0 - c1, c1);
  55 }
  56 for (int c0 = max(2 * n + 1, -27 * n + 2); c0 <= n + 29; c0 += 1)
  57   S1(c0 - 1);
  58 for (int c0 = n + 30; c0 <= 2 * n; c0 += 1) {
  59   if (2 * n >= c0 + 1) {
  60     S4(c0 - c0 / 2 - 1, c0 / 2 + 1);
  61     if (c0 + 2 >= 2 * n) {
  62       for (int c2 = 1; c2 < -n + c0; c2 += 1)
  63         S5(-n + c0, n, c2);
  64     } else {
  65       S4(c0 - c0 / 2 - 2, c0 / 2 + 2);
  66       for (int c2 = 1; c2 < c0 - c0 / 2 - 1; c2 += 1)
  67         S5(c0 - c0 / 2 - 1, c0 / 2 + 1, c2);
  68     }
  69     for (int c1 = -c0 + c0 / 2 + 3; c1 <= n - c0; c1 += 1) {
  70       S6(-c1 + 2, c0 + c1 - 2);
  71       S4(-c1, c0 + c1);
  72       for (int c2 = 1; c2 <= -c1; c2 += 1)
  73         S5(-c1 + 1, c0 + c1 - 1, c2);
  74     }
  75     if (2 * n >= c0 + 3) {
  76       S6(-n + c0 + 1, n - 1);
  77       for (int c2 = 1; c2 < -n + c0; c2 += 1)
  78         S5(-n + c0, n, c2);
  79     }
  80     S6(-n + c0, n);
  81   }
  82   if (c0 % 2 == 0)
  83     S3(c0 / 2);
  84   for (int c1 = -n + c0; c1 < (c0 + 1) / 2; c1 += 1)
  85     S2(c0 - c1, c1);
  86 }