Home
last modified time | relevance | path

Searched refs:c0 (Results 1 – 25 of 727) sorted by relevance

12345678910>>...30

/netbsd-src/external/mit/isl/dist/test_inputs/codegen/cloog/
H A Dclassen.c9 for (int c0 = 1; c0 < 2 * m - 1; c0 += 1) { variable
10 if (2 * m >= c0 + 3) {
11 if (c0 + 1 == m) {
15 } else if (c0 >= m) {
16 S5(c0 - 1, -m + c0 + 2, c0, -m + c0 + 2, m - 1, -m + c0 + 2, m, -m + c0 + 2);
17 S6(c0 - 1, -m + c0 + 1, c0, -m + c0 + 2, m, -m + c0 + 1, m, -m + c0 + 2);
18 S1(c0, -m + c0 + 2, m, -m + c0 + 2);
19 S3(c0, -m + c0 + 2, c0 + 1, -m + c0 + 3, m, -m + c0 + 2, m, -m + c0 + 3);
21 S5(c0 - 1, 1, c0, 1, c0, 1, c0 + 1, 1);
22 S1(c0, 1, c0 + 1, 1);
[all …]
H A Dvivien.c1 for (int c0 = -27 * n + 2; c0 <= 1; c0 += 1) variable
2 S1(c0 - 1);
3 for (int c0 = 2; c0 <= min(2 * n, n + 29); c0 += 1) { variable
4 if (c0 >= 3) {
5 if (2 * n >= c0 + 1) {
6 S4(c0 - c0 / 2 - 1, c0 / 2 + 1);
7 if (c0 + 2 >= 2 * n) {
8 for (int c2 = 1; c2 < -n + c0; c2 += 1)
9 S5(-n + c0, n, c2);
10 } else if (c0 >= 5) {
[all …]
H A Dvivien2.c1 for (int c0 = -27 * n + 2; c0 <= 1; c0 += 1) variable
2 S1(c0 - 1);
3 for (int c0 = 2; c0 <= n + 29; c0 += 1) { variable
4 if (c0 >= 3) {
5 S4(c0 - c0 / 2 - 1, c0 / 2 + 1);
6 if (c0 <= 4) {
7 S1(c0 - 1);
8 } else if (c0 + 2 >= 2 * n) {
9 for (int c2 = 1; c2 < -n + c0; c2 += 1)
10 S5(-n + c0, n, c2);
[all …]
H A Dfaber.c1 for (int c0 = 0; c0 <= 36; c0 += 1) { variable
2 for (int c1 = -6; c1 < c0 / 14 - 5; c1 += 1) {
4 S6(c0, c1, c2);
6 S2(c0, c1, c2);
8 S1(c0, c1, c2);
10 for (int c1 = c0 / 14 - 5; c1 < 0; c1 += 1) {
11 if (c1 >= -3 && 2 * c0 >= 7 * c1 + 42)
12 S7(c0, c1, 6);
13 … for (int c2 = max(c1 - (6 * c0 + 77) / 77 + 13, -((-2 * c1 + 3) / 5) + 9); c2 <= c1 + 12; c2 += 1)
14 S6(c0, c1, c2);
[all …]
H A Dswim.c29 for (int c0 = 1; c0 <= N; c0 += 1) { variable
31 S28(c0, c1);
32 S29(c0, c1);
33 S30(c0, c1);
35 S31(c0);
44 for (int c0 = 2; c0 <= P; c0 += 1) { variable
45 S38(c0);
46 S39(c0);
49 S40(c0, c1, c2);
50 S41(c0, c1, c2);
[all …]
H A Dreservoir-mg-interp.c2 for (int c0 = 1; c0 < O; c0 += 1) { variable
4 S1(c0, 1, c3);
6 S6(c0, 1, c3);
7 S7(c0, 1, c3);
11 S3(c0, 1, c3);
13 S1(c0, 2, c3);
15 S6(c0, 2, c3);
16 S7(c0, 2, c3);
19 S11(c0, 1, c3);
22 S3(c0, 1, c3);
[all …]
H A Dlevenshtein-1-2-3.c2 for (int c0 = 1; c0 <= N; c0 += 1) { variable
3 S2(c0, 0);
4 for (int c1 = 1; c1 < c0; c1 += 1)
5 S6(c0, c1);
6 S3(c0, c0);
13 for (int c0 = N + 2; c0 < 2 * M - N - 1; c0 += 1) { variable
14 S7(c0, -N + (N + c0 + 1) / 2 - 1);
15 if ((N + c0) % 2 == 0) {
16 S5(c0, (-N + c0) / 2);
17 S8(c0, (-N + c0) / 2);
[all …]
H A Dwalters.c5 for (int c0 = 3; c0 <= 10; c0 += 1) { variable
6 if ((c0 + 1) % 3 == 0) {
7 S3(c0, (c0 - 2) / 3, (c0 + 1) / 3, (c0 + 1) / 3);
8 } else if (c0 % 3 == 0) {
9 S1(c0, c0 / 3, c0 / 3, c0 / 3);
11 S2(c0, (c0 - 1) / 3, (c0 + 2) / 3, (c0 - 1) / 3);
13 S4(c0, c0 / 3, (c0 - 1) / 3 + 1, c0 - (c0 - 1) / 3 - c0 / 3 - 1);
H A Dreservoir-liu-zhuge1.c2 for (int c0 = -4; c0 <= 3 * M + N; c0 += 1) { variable
3 if (3 * M >= c0 + 4 && (c0 + 1) % 3 == 0) {
4 S1((c0 + 4) / 3, 0);
5 } else if (c0 >= 3 * M) {
6 S2(M, -3 * M + c0);
8 for (int c1 = max(-3 * M + c0 + 3, (c0 + 6) % 3); c1 <= min(N - 1, c0); c1 += 3) {
9 S2((c0 - c1) / 3, c1);
10 S1(((c0 - c1) / 3) + 1, c1 + 1);
12 if (N >= c0 + 4 && c0 >= -3) {
13 S1(0, c0 + 4);
[all …]
H A Dgesced2.c1 for (int c0 = 1; c0 <= 4; c0 += 1) variable
3 S1(c0, c1);
4 for (int c0 = 5; c0 < M - 9; c0 += 1) { variable
5 for (int c1 = -c0 + 1; c1 <= 4; c1 += 1)
6 S2(c0 + c1, c0);
7 for (int c1 = 5; c1 <= min(M - 10, M - c0); c1 += 1) {
8 S2(c0 + c1, c0);
9 S1(c0, c1);
11 for (int c1 = M - c0 + 1; c1 < M - 9; c1 += 1)
12 S1(c0, c1);
[all …]
H A DdealII.c1 for (int c0 = 0; c0 <= min(min(T_2 - 1, T_67 - 1), T_66); c0 += 1) { variable
2 S1(c0);
3 S2(c0);
5 for (int c0 = T_2; c0 <= min(T_67 - 1, T_66); c0 += 1) variable
6 S2(c0);
7 for (int c0 = max(0, T_66 + 1); c0 < min(T_2, T_67); c0 += 1) variable
8 S1(c0);
9 for (int c0 = T_67; c0 <= min(T_2 - 1, T_66); c0 += 1) { variable
10 S1(c0);
11 S2(c0);
[all …]
H A D4-param.c1 for (int c0 = p; c0 <= min(m - 1, q); c0 += 1) variable
2 S2(c0);
3 for (int c0 = m; c0 <= min(n, p - 1); c0 += 1) variable
4 S1(c0);
5 for (int c0 = max(m, p); c0 <= min(n, q); c0 += 1) { variable
6 S1(c0);
7 S2(c0);
9 for (int c0 = max(max(m, n + 1), p); c0 <= q; c0 += 1) variable
10 S2(c0);
11 for (int c0 = max(max(m, p), q + 1); c0 <= n; c0 += 1) variable
[all …]
H A Dbyu98-1-2-3.c1 for (int c0 = 2; c0 <= 3; c0 += 1) variable
2 for (int c1 = -c0 + 6; c1 <= 6; c1 += 1)
3 S1(c0, c1);
4 for (int c0 = 4; c0 <= 8; c0 += 1) { variable
5 if (c0 == 4)
8 if (c0 <= 5) {
9 S1(c0, -c0 + 9);
10 S2(c0, -c0 + 9);
12 S2(c0, -c0 + 9);
14 for (int c1 = max(c0 - 1, -c0 + 10); c1 <= 6; c1 += 1)
[all …]
H A Dtest.c1 for (int c0 = 1; c0 <= 2; c0 += 1) variable
3 S1(c0, c1);
4 for (int c0 = 3; c0 <= N; c0 += 1) { variable
5 for (int c1 = 1; c1 <= min(M, c0 - 1); c1 += 1)
6 S1(c0, c1);
7 if (M >= c0) {
8 S1(c0, c0);
9 S2(c0, c0);
11 for (int c1 = c0 + 1; c1 <= M; c1 += 1)
12 S1(c0, c1);
[all …]
H A Dforwardsub-3-1-2.c3 for (int c0 = 4; c0 <= M + 1; c0 += 1) { variable
4 S1(c0, 1);
5 for (int c1 = 2; c1 < (c0 + 1) / 2; c1 += 1)
6 S2(c0, c1);
7 if (c0 % 2 == 0)
8 S4(c0, c0 / 2);
10 for (int c0 = M + 2; c0 <= 2 * M; c0 += 1) { variable
11 for (int c1 = -M + c0; c1 < (c0 + 1) / 2; c1 += 1)
12 S2(c0, c1);
13 if (c0 % 2 == 0)
[all …]
/netbsd-src/external/mit/isl/dist/test_inputs/codegen/omega/
H A Dwak1-1.c1 for (int c0 = a2; c0 <= min(min(a1 - 1, a3 - 1), b2); c0 += 1) variable
2 s1(c0);
3 for (int c0 = a3; c0 <= min(min(a1 - 1, b3), a2 - 1); c0 += 1) variable
4 s2(c0);
5 for (int c0 = max(a3, a2); c0 <= min(min(a1 - 1, b3), b2); c0 += 1) { variable
6 s1(c0);
7 s2(c0);
9 for (int c0 = max(max(a3, b3 + 1), a2); c0 <= min(a1 - 1, b2); c0 += 1) variable
10 s1(c0);
11 for (int c0 = a1; c0 <= min(min(b1, a3 - 1), a2 - 1); c0 += 1) variable
[all …]
H A Dwak1-0.c1 for (int c0 = a1; c0 <= min(min(b1, a3 - 1), a2 - 1); c0 += 1) variable
2 s0(c0);
3 for (int c0 = a2; c0 <= min(a3 - 1, b2); c0 += 1) { variable
4 if (c0 >= a1 && b1 >= c0)
5 s0(c0);
6 s1(c0);
8 for (int c0 = max(max(a1, a2), b2 + 1); c0 <= min(b1, a3 - 1); c0 += 1) variable
9 s0(c0);
10 for (int c0 = a3; c0 <= b3; c0 += 1) { variable
11 if (c0 >= a1 && b1 >= c0)
[all …]
H A Dwak3-1.c1 for (int c0 = a; c0 <= min(a + 9, b); c0 += 1) variable
2 s0(c0);
3 for (int c0 = a + 10; c0 <= min(a + 19, b); c0 += 1) { variable
4 s0(c0);
5 s1(c0);
7 for (int c0 = max(a + 10, b + 1); c0 <= min(a + 19, b + 10); c0 += 1) variable
8 s1(c0);
9 for (int c0 = a + 20; c0 <= b; c0 += 1) { variable
10 s0(c0);
11 s1(c0);
[all …]
H A Dx-1.c1 for (int c0 = 1; c0 <= 11; c0 += 1) { variable
2 for (int c1 = max(1, c0 - 3); c1 <= min(c0, -c0 + 8); c1 += 1)
3 s1(c1, c0 - c1 + 1);
4 for (int c1 = max(1, -c0 + 9); c1 <= min(c0 - 4, -c0 + 12); c1 += 1)
5 s0(c1, c0 + c1 - 8);
6 for (int c1 = max(c0 - 3, -c0 + 9); c1 <= min(c0, -c0 + 12); c1 += 1) {
7 s0(c1, c0 + c1 - 8);
8 s1(c1, c0 - c1 + 1);
10 for (int c1 = max(c0 - 3, -c0 + 13); c1 <= min(8, c0); c1 += 1)
11 s1(c1, c0 - c1 + 1);
[all …]
H A Dx-0.c1 for (int c0 = 1; c0 <= 11; c0 += 1) { variable
2 for (int c1 = max(1, c0 - 3); c1 <= min(c0, -c0 + 8); c1 += 1)
3 s1(c1, c0 - c1 + 1);
4 for (int c1 = max(1, -c0 + 9); c1 <= min(c0 - 4, -c0 + 12); c1 += 1)
5 s0(c1, c0 + c1 - 8);
6 for (int c1 = max(c0 - 3, -c0 + 9); c1 <= min(c0, -c0 + 12); c1 += 1) {
7 s0(c1, c0 + c1 - 8);
8 s1(c1, c0 - c1 + 1);
10 for (int c1 = max(c0 - 3, -c0 + 13); c1 <= min(8, c0); c1 += 1)
11 s1(c1, c0 - c1 + 1);
[all …]
H A Dwak2-0.c2 for (int c0 = a1; c0 <= b1; c0 += 1) variable
4 s0(c0, c1_0);
6 for (int c0 = a1; c0 <= min(b1, a2 - 1); c0 += 1) variable
8 s0(c0, c1_0);
9 for (int c0 = a2; c0 <= b2; c0 += 1) { variable
10 if (c0 >= a1 && b1 >= c0)
12 s0(c0, c1_0);
14 if (c0 >= a1 && b1 >= c0 && c1_0 >= c1 && d1 >= c1_0)
15 s0(c0, c1_0);
16 s1(c0, c1_0);
[all …]
H A Dwak2-1.c2 for (int c0 = a1; c0 <= b1; c0 += 1) variable
4 s0(c0, c1_0);
6 for (int c0 = a1; c0 <= min(b1, a2 - 1); c0 += 1) variable
8 s0(c0, c1_0);
9 for (int c0 = a2; c0 <= b2; c0 += 1) { variable
10 if (a1 >= c0 + 1) {
12 s1(c0, c1_0);
13 } else if (c0 >= b1 + 1) {
15 s1(c0, c1_0);
18 s1(c0, c1_0);
[all …]
/netbsd-src/external/mit/isl/dist/test_inputs/codegen/
H A Dcorrelation.c1 for (int c0 = 0; c0 < m; c0 += 32) variable
2 … 32 && m >= c0 + 2) || (m == 1 && c0 == 0) ? 0 : 32 * n - 32 * floord(31 * n + 31, 32); c1 <= ((n …
3 …c0; c2 <= (m >= 2 && c0 + 31 >= m && n >= c1 && c1 + 31 >= n ? 2 * m - 3 : (m >= 2 * c0 + 63 && c1…
5 if (n <= 0 && c0 == 0 && c1 == 0)
9 for (int c3 = max(0, (c2 / 2) - c0 + 1); c3 <= min(31, m - c0 - 2); c3 += 1)
10 for (int c5 = max(0, c0 - c2 + c3); c5 <= min(31, 2 * c0 - c2 + 2 * c3 - 1); c5 += 1)
11 S_29(-c0 + c2 - c3 + c5, c0 + c3);
13 for (int c3 = max(0, (c2 / 2) - c0 + 1); c3 <= min(31, m - c0 - 2); c3 += 1)
14 for (int c5 = 0; c5 <= min(31, 2 * c0 - c2 + 2 * c3 - 1); c5 += 1)
15 S_29(-c0 + c2 - c3 + c5, c0 + c3);
[all …]
H A Dseparation_class4.c1 for (int c0 = 0; c0 <= 128; c0 += 1) { variable
2 if (c0 <= 127) {
3 if (c0 == 0) {
9 …for (int c3 = max(4 * c0 - 2, 4 * c0 + 6 * c2 - 12); c3 <= min(4 * c0 + 1, 4 * c0 + 6 * c2 - 7); c…
10 …for (int c5 = max(4 * c0 - c3 + 57, -4 * c0 + c3 + 58); c5 <= min(4 * c0 - c3 + 61, -4 * c0 + c3 +…
14 …for (int c3 = max(4 * c0, 4 * c0 + 6 * c2 - 10); c3 <= min(4 * c0 + 3, 4 * c0 + 6 * c2 - 5); c3 +=…
15 …for (int c5 = max(-4 * c0 + c3 + 59, 4 * c0 - c3 + 62); c5 <= min(-4 * c0 + c3 + 63, 4 * c0 - c3 +…
H A Dseparation_class3.c1 for (int c0 = 0; c0 <= 4; c0 += 1) { variable
2 if (c0 == 0) {
5 S_0(2 * c0 - 1, 1);
6 if (c0 == 4) {
10 for (int c4 = 2 * c0 - 1; c4 <= 2 * c0; c4 += 1)
11 for (int c6 = -2 * c0 + c4 + 4; c6 <= 2 * c0 - c4 + 4; c6 += 1)
15 for (int c4 = max(0, 2 * c0 - 1); c4 <= min(7, 2 * c0); c4 += 1)
16 for (int c6 = -2 * c0 + c4 + 8; c6 <= 8; c6 += 1)
18 if (c0 >= 1 && c0 <= 3) {
20 for (int c4 = 2 * c0 - 1; c4 <= 2 * c0; c4 += 1)
[all …]

12345678910>>...30