isl_aff_ceil: compute ceil(e/m) as floor((e + m - 1)/m)

[isl.git] / test_inputs / codegen / cloog / nul_complex1.c

for (int c0 = 0; c0 <= 5 * n; c0 += 1)
  for (int c1 = max(-((n + c0 + 1) % 2) - n + c0 + 1, 2 * floord(c0 - (c0 + 3) / 3, 2) + 2); c1 <= min(n + c0 - (n + c0 + 2) / 3, c0); c1 += 2)
    S1((-2 * c0 + 3 * c1) / 2, c0 - c1);