test_inputs/codegen/cloog/vivien.c

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