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