test_inputs/codegen/cloog/reservoir-liu-zhuge1.c

   1 if (N >= 0 && M >= 0)
   2   for (int c1 = -4; c1 <= 3 * M + N; c1 += 1) {
   3     if (c1 >= 3 * M) {
   4       S2(M, -3 * M + c1);
   5     } else if (3 * floord(c1 - 2, 3) + 2 == c1 && c1 + 1 >= 0 && 3 * M >= c1 + 4)
   6       S1((c1 + 4) / 3, 0);
   7     for (int c3 = max(-3 * M + c1 + 3, c1 + 3 * floord(-c1 - 1, 3) + 3); c3 <= min(N - 1, c1); c3 += 3) {
   8       S2((c1 - c3) / 3, c3);
   9       S1((c1 - c3 + 3) / 3, c3 + 1);
  10     }
  11     if (N + 3 * floord(-N + c1, 3) == c1 && 3 * M + N >= c1 + 3 && c1 >= N) {
  12       S2((-N + c1) / 3, N);
  13     } else if (N >= c1 + 4)
  14       S1(0, c1 + 4);
  15     for (int c3 = max(-3 * M + c1, c1 + 3 * floord(-c1 - 1, 3) + 3); c3 <= min(N, c1); c3 += 3)
  16       S3((c1 - c3) / 3, c3);
  17   }