test_inputs/codegen/cloog/levenshtein-1-2-3.c

   1 {
   2   S1(0, 0);
   3   for (int c0 = 1; c0 <= N; c0 += 1) {
   4     S2(c0, 0);
   5     for (int c1 = 1; c1 < c0; c1 += 1)
   6       S6(c0, c1);
   7     S3(c0, c0);
   8   }
   9   S7(N + 1, 0);
  10   for (int c1 = 1; c1 <= N; c1 += 1) {
  11     S6(N + 1, c1);
  12     S8(N + 1, c1);
  13   }
  14   for (int c0 = N + 2; c0 < 2 * M - N - 1; c0 += 1) {
  15     S7(c0, -N + (N + c0 + 1) / 2 - 1);
  16     if ((-N + c0) % 2 == 0) {
  17       S5(c0, (-N + c0) / 2);
  18       S8(c0, (-N + c0) / 2);
  19     }
  20     for (int c1 = -N + (N + c0) / 2 + 1; c1 < (N + c0 + 1) / 2; c1 += 1) {
  21       S6(c0, c1);
  22       S8(c0, c1);
  23     }
  24     if ((-N + c0) % 2 == 0) {
  25       S4(c0, (N + c0) / 2);
  26       S8(c0, (N + c0) / 2);
  27     }
  28   }
  29   for (int c0 = 2 * M - N - 1; c0 < 2 * M - 1; c0 += 1)
  30     for (int c1 = -M + c0 + 1; c1 < M; c1 += 1)
  31       S6(c0, c1);
  32 }