Home
last modified time | relevance | path

Searched refs:c4 (Results 1 – 25 of 271) sorted by relevance

1234567891011

/netbsd-src/external/mit/isl/dist/test_inputs/codegen/omega/
H A Dts1d-mp-i_ts-m_b-0.c13 …r (int c4 = max(500 * c1 + 1, 1000 * c1 + 4000 * c3 - 3999); c4 <= min(min(N + T - 3, 1000 * c1 + … variable
14 …int c5 = max(0, -N - 500 * c1 + c4 + 2); c5 <= min(min(T - 500 * c1 - 1, -500 * c1 + c4 - 1), -500…
15 s1(2, 500 * c1 + c5, 1, -500 * c1 + c4 - c5, 1);
17 …c4 = max(1000 * c1 + 4000 * c3 - 3999, -4000 * c3 + 4000); c4 <= min(min(2 * T + 4000 * c3 - 4000,… variable
18 s2(2, -2000 * c3 + (c4 + 1) / 2 + 1999, 1, 2000 * c3 + c4 - (c4 + 1) / 2 - 1999, 1);
20 …for (int c4 = max(500 * c1 + 1, 1000 * c1 + 4000 * c3 - 2999); c4 <= min(min(N + T - 3, N + 500 * … variable
21 …for (int c5 = max(0, -N - 500 * c1 + c4 + 2); c5 <= min(min(499, T - 500 * c1 - 1), -500 * c1 + c4…
22 s3(2, 500 * c1 + c5, 1, -500 * c1 + c4 - c5, 1);
24 …r (int c4 = max(-4000 * c3, 1000 * c1 + 4000 * c3 + 1); c4 <= min(min(2 * N - 4000 * c3 - 5, 2 * T… variable
25 s4(2, -2000 * c3 + (c4 + 1) / 2 - 1, 1, 2000 * c3 + c4 - (c4 + 1) / 2 + 1, 1);
[all …]
H A Dlift2-1.c6 for (int c4 = 1; c4 <= 100; c4 += 1) variable
7 s1(c0, c1, c2, c3, c4);
9 for (int c4 = 1; c4 <= 100; c4 += 1) variable
10 s1(c0, c1, c2, c3, c4);
12 for (int c4 = 1; c4 <= 100; c4 += 1) { variable
13 s1(c0, c1, c2, c3, c4);
14 s0(c0, c1, c2, c3, c4);
H A Dlift2-2.c6 for (int c4 = 1; c4 <= 100; c4 += 1) variable
7 s1(c0, c1, c2, c3, c4);
10 for (int c4 = 1; c4 <= 100; c4 += 1) variable
11 s1(c0, c1, c2, c3, c4);
14 for (int c4 = 1; c4 <= 100; c4 += 1) { variable
15 s1(c0, c1, c2, c3, c4);
16 s0(c0, c1, c2, c3, c4);
H A Dlift2-3.c6 for (int c4 = 1; c4 <= 100; c4 += 1) variable
7 s1(c0, c1, c2, c3, c4);
11 for (int c4 = 1; c4 <= 100; c4 += 1) variable
12 s1(c0, c1, c2, c3, c4);
16 for (int c4 = 1; c4 <= 100; c4 += 1) { variable
17 s1(c0, c1, c2, c3, c4);
18 s0(c0, c1, c2, c3, c4);
H A Dlift2-4.c6 for (int c4 = 1; c4 <= 100; c4 += 1) variable
7 s1(c0, c1, c2, c3, c4);
12 for (int c4 = 1; c4 <= 100; c4 += 1) variable
13 s1(c0, c1, c2, c3, c4);
18 for (int c4 = 1; c4 <= 100; c4 += 1) { variable
19 s1(c0, c1, c2, c3, c4);
20 s0(c0, c1, c2, c3, c4);
H A Dlift2-5.c5 for (int c4 = 1; c4 <= 100; c4 += 1) variable
6 s1(c0, c1, c2, c3, c4);
11 for (int c4 = 1; c4 <= 100; c4 += 1) { variable
12 s1(c0, c1, c2, c3, c4);
13 s0(c0, c1, c2, c3, c4);
19 for (int c4 = 1; c4 <= 100; c4 += 1) variable
20 s1(c0, c1, c2, c3, c4);
H A Dcollard-0.c1 for (int c4 = 1; c4 <= n; c4 += 1) variable
2 s2(c4);
4 for (int c4 = 0; c4 < n - c1; c4 += 1) variable
5 s0(c1, n - c4);
7 for (int c4 = c1 + 1; c4 <= n; c4 += 1) variable
8 s1(c1, n - c3, c4);
H A Dlu-3.c5 for (int c4 = max(c1, c3 + 1); c4 <= min(n, c1 + 63); c4 += 1) variable
6 s1(c3, c4, c2);
7 for (int c4 = max(c1, c2 + 1); c4 <= min(n, c1 + 63); c4 += 1) variable
8 s0(c2, c4);
12 for (int c4 = max(c1, c3 + 1); c4 <= min(n, c1 + 63); c4 += 1) variable
13 s1(c3, c4, c2);
H A Dlefur03-0.c5 …c4 = max(max(max(max(-200 * c1 + 400 * c3 - 199, 250 * c3 + 1), 667 * c0 - 333 * c1 - (c0 + c1 + 3… variable
6 …c4, 1000 * c0 - c4), 1000 * c3 - 2 * c4 + 2), 500 * c1 + (c4 + 1) / 2); c5 <= min(min(min(2 * c4 +…
7 s0(c0, c1, c2, c3, c4, c5);
H A Dlift1-1.c6 for (int c4 = 1; c4 <= 100; c4 += 1) variable
7 s1(c0, c1, c2, c3, c4);
9 for (int c4 = 1; c4 <= 100; c4 += 1) { variable
10 s1(c0, c1, c2, c3, c4);
11 s0(c0, c1, c2, c3, c4);
H A Dlift1-2.c6 for (int c4 = 1; c4 <= 100; c4 += 1) variable
7 s1(c0, c1, c2, c3, c4);
10 for (int c4 = 1; c4 <= 100; c4 += 1) { variable
11 s1(c0, c1, c2, c3, c4);
12 s0(c0, c1, c2, c3, c4);
H A Dlift1-3.c6 for (int c4 = 1; c4 <= 100; c4 += 1) variable
7 s1(c0, c1, c2, c3, c4);
11 for (int c4 = 1; c4 <= 100; c4 += 1) { variable
12 s1(c0, c1, c2, c3, c4);
13 s0(c0, c1, c2, c3, c4);
H A Dlift1-4.c6 for (int c4 = 1; c4 <= 100; c4 += 1) variable
7 s1(c0, c1, c2, c3, c4);
12 for (int c4 = 1; c4 <= 100; c4 += 1) { variable
13 s1(c0, c1, c2, c3, c4);
14 s0(c0, c1, c2, c3, c4);
H A Dlift1-5.c5 for (int c4 = 1; c4 <= 100; c4 += 1) { variable
6 s1(c0, c1, c2, c3, c4);
7 s0(c0, c1, c2, c3, c4);
13 for (int c4 = 1; c4 <= 100; c4 += 1) variable
14 s1(c0, c1, c2, c3, c4);
H A Dlu-2.c5 for (int c4 = max(c1, c3 + 1); c4 <= min(n, c1 + 63); c4 += 1) variable
6 s1(c3, c4, c2);
8 for (int c4 = max(c1, c2 + 1); c4 <= min(n, c1 + 63); c4 += 1) variable
9 s0(c2, c4);
H A Dlu-0.c5 for (int c4 = max(c1, c3 + 1); c4 <= min(n, c1 + 63); c4 += 1) variable
6 s1(c3, c4, c2);
8 for (int c4 = max(c1, c2 + 1); c4 <= min(n, c1 + 63); c4 += 1) variable
9 s0(c2, c4);
H A Dlu-1.c5 for (int c4 = max(c1, c3 + 1); c4 <= min(n, c1 + 63); c4 += 1) variable
6 s1(c3, c4, c2);
8 for (int c4 = max(c1, c2 + 1); c4 <= min(n, c1 + 63); c4 += 1) variable
9 s0(c2, c4);
H A Dlift1-0.c5 for (int c4 = 1; c4 <= 100; c4 += 1) { variable
6 s1(c0, c1, c2, c3, c4);
8 s0(c0, c1, c2, c3, c4);
H A Dlift2-0.c5 for (int c4 = 1; c4 <= 100; c4 += 1) { variable
6 s1(c0, c1, c2, c3, c4);
8 s0(c0, c1, c2, c3, c4);
H A Dm11-0.c5 for (int c4 = 5 * c1 + 10 * c2 - 4; c4 <= min(5 * c1 + 10 * c2, m - c3 + 1); c4 += 1) variable
6 s0(c0, c1, c2, c3, c4, -9 * c0 + c3 + c0 / 2 + 9, -5 * c1 - 5 * c2 + c4 + 5);
/netbsd-src/external/mit/isl/dist/test_inputs/codegen/
H A Dseparation_class3.c10 for (int c4 = 2 * c0 - 1; c4 <= 2 * c0; c4 += 1) variable
11 for (int c6 = -2 * c0 + c4 + 4; c6 <= 2 * c0 - c4 + 4; c6 += 1)
12 S_0(c4, c6);
15 for (int c4 = max(0, 2 * c0 - 1); c4 <= min(7, 2 * c0); c4 += 1) variable
16 for (int c6 = -2 * c0 + c4 + 8; c6 <= 8; c6 += 1)
17 S_0(c4, c6);
20 for (int c4 = 2 * c0 - 1; c4 <= 2 * c0; c4 += 1) variable
21 for (int c6 = 2 * c0 + 4 * c2 - c4 + 1; c6 <= -2 * c0 + 4 * c2 + c4 + 3; c6 += 1)
22 S_0(c4, c6);
H A Dshift2.c26 for (int c4 = 1; c4 <= min(min(31, length - 2), (c3 / 2) + 14); c4 += 1) variable
27 …for (int c5 = max((c3 / 2) - c2, -c2 + c4 + 1); c5 <= min(length - c2 - 1, (c3 / 2) - c2 + 15); c5…
28 S_3(c0, c4, c2 + c5);
31 for (int c4 = 0; c4 <= min(31, length - 2); c4 += 1) { variable
32 …for (int c5 = max((c3 / 2) - c2, -c2 + c4 + 1); c5 <= min(length - c2 - 1, (c3 / 2) - c2 + 15); c5…
33 S_3(c0, c4, c2 + c5);
34 if (c3 + 30 >= 2 * length && c4 == 0)
48 for (int c4 = 0; c4 <= min(min(31, length - c1 - 2), -c1 + c3 + 14); c4 += 1) variable
49 … for (int c5 = max(-c2 + c3, c1 - c2 + c4 + 1); c5 <= min(length - c2 - 1, -c2 + c3 + 15); c5 += 1)
50 S_3(c0, c1 + c4, c2 + c5);
H A Dcorrelation.c22 for (int c4 = 0; c4 <= min(31, n - c1 - 1); c4 += 1) { variable
24 if (c1 == 0 && c4 == 0)
26 S_19(c1 + c4, 0);
29 if (c0 == 0 && c1 == 0 && c3 == 0 && c4 == 0)
32 S_19(c1 + c4, c2 + c5);
33 S_27(c0 + c3, c2 + c5, c1 + c4);
48 for (int c4 = 0; c4 <= min(31, n - c1 - 1); c4 += 1) variable
49 S_19(c1 + c4, 0);
52 for (int c4 = 0; c4 <= min(31, n - 1); c4 += 1) variable
53 S_19(c4, 0);
H A Ddisjuncts.c5 for (int c4 = 0; c4 <= n; c4 += 1) variable
6 a(c0, c1, c3, c4);
8 for (int c4 = 0; c4 <= n; c4 += 1) variable
9 b(c0, c1, c3, c4);
H A Dlu.c6 for (int c4 = c1; c4 <= min(n - 1, c1 + 31); c4 += 1) variable
8 S_6(c3, c4, c5);
13 for (int c4 = c3 + 1; c4 <= min(n - 1, c0 + 31); c4 += 1) variable
15 S_6(c3, c4, c5);

1234567891011