isl_tab_basic_map_partial_lexopt: detect modulos and integer divisions
[isl.git] / test_inputs / codegen / omega / if_then-0.c
blobd2e100b440212b040025aaa3b58a4ecb7b74345e
1 if (m <= 1) {
2 for (int c0 = 1; c0 <= n; c0 += 1)
3 for (int c1 = 1; c1 <= n; c1 += 1)
4 s2(c0, c1);
5 } else if (n >= m + 1) {
6 for (int c0 = 1; c0 <= n; c0 += 1)
7 for (int c1 = 1; c1 <= n; c1 += 1)
8 s0(c0, c1);
9 } else {
10 for (int c0 = 1; c0 <= n; c0 += 1)
11 for (int c1 = 1; c1 <= n; c1 += 1)
12 s1(c0, c1);