Home
last modified time | relevance | path

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

12345678910>>...45

/llvm-project-15.0.7/polly/lib/External/isl/test_inputs/codegen/cloog/
H A Dclassen.c16 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);
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);
23 S3(c0, 1, c0 + 1, 2, c0 + 1, 1, c0 + 1, 2);
24 S4(c0, 1, c0 + 2, 2, c0 + 1, 1, c0 + 2, 2);
48 S6(c0 - 1, c0, c0, c0 + 1, 1, c0, 1, c0 + 1);
49 S7(c0 - 1, c0, c0 + 1, c0 + 1, 1, c0, 2, c0 + 1);
51 S3(c0, c0 + 1, c0 + 1, c0 + 2, 1, c0 + 1, 1, c0 + 2);
52 S4(c0, c0 + 1, c0 + 2, c0 + 2, 1, c0 + 1, 2, c0 + 2);
[all …]
H A Dvivien.c1 for (int c0 = -27 * n + 2; c0 <= 1; c0 += 1) variable
3 for (int c0 = 2; c0 <= min(2 * n, n + 29); c0 += 1) { variable
6 S4(c0 - c0 / 2 - 1, c0 / 2 + 1);
11 S4(c0 - c0 / 2 - 2, c0 / 2 + 2);
13 S5(c0 - c0 / 2 - 1, c0 / 2 + 1, c2);
16 for (int c1 = -c0 + c0 / 2 + 3; c1 <= min(-1, n - c0); c1 += 1) {
57 for (int c0 = n + 30; c0 <= 2 * n; c0 += 1) { variable
59 S4(c0 - c0 / 2 - 1, c0 / 2 + 1);
64 S4(c0 - c0 / 2 - 2, c0 / 2 + 2);
66 S5(c0 - c0 / 2 - 1, c0 / 2 + 1, c2);
[all …]
H A Dvivien2.c1 for (int c0 = -27 * n + 2; c0 <= 1; c0 += 1) variable
3 for (int c0 = 2; c0 <= n + 29; c0 += 1) { variable
5 S4(c0 - c0 / 2 - 1, c0 / 2 + 1);
12 S4(c0 - c0 / 2 - 2, c0 / 2 + 2);
14 S5(c0 - c0 / 2 - 1, c0 / 2 + 1, c2);
16 for (int c1 = -c0 + c0 / 2 + 3; c1 <= min(-1, n - c0); c1 += 1) {
48 for (int c0 = n + 30; c0 <= 2 * n; c0 += 1) { variable
50 S4(c0 - c0 / 2 - 1, c0 / 2 + 1);
55 S4(c0 - c0 / 2 - 2, c0 / 2 + 2);
57 S5(c0 - c0 / 2 - 1, c0 / 2 + 1, c2);
[all …]
H A Dswim.c29 for (int c0 = 1; c0 <= N; c0 += 1) { variable
35 S31(c0);
44 for (int c0 = 2; c0 <= P; c0 += 1) { variable
45 S38(c0);
46 S39(c0);
66 S52(c0);
67 S53(c0);
68 S54(c0);
69 S55(c0);
70 S56(c0);
[all …]
H A Dfaber.c1 for (int c0 = 0; c0 <= 36; c0 += 1) { variable
4 S6(c0, c1, c2);
6 S2(c0, c1, c2);
18 S3(c0, 0, 0);
19 S10(c0, 0, 0);
21 S3(c0, 0, c2);
23 S3(c0, 0, c2);
69 for (int c0 = 37; c0 <= 218; c0 += 1) { variable
87 if (c0 >= 70 && c0 % 14 >= 9)
88 …for (int c2 = max((c0 + 5) / 14 + 18, -((3 * c0 + 14) / 14) + c0 / 14 + 44); c2 <= -((3 * c0 + 17)…
[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);
51 for (int c0 = 1; c0 < O; c0 += 1) variable
60 for (int c0 = 1; c0 < O; c0 += 1) variable
64 for (int c0 = 1; c0 < O; c0 += 1) variable
68 for (int c0 = R; c0 < O; c0 += 1) variable
72 for (int c0 = R; c0 < O; c0 += 1) variable
76 for (int c0 = R; c0 < O; c0 += 1) variable
[all …]
H A Dlevenshtein-1-2-3.c2 for (int c0 = 1; c0 <= N; c0 += 1) { variable
3 S2(c0, 0);
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);
16 S5(c0, (-N + c0) / 2);
17 S8(c0, (-N + c0) / 2);
24 S4(c0, (N + c0) / 2);
25 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);
12 if (N >= c0 + 4 && c0 >= -3) {
13 S1(0, c0 + 4);
14 } else if (3 * M + N >= c0 + 3 && c0 >= N && (N - c0) % 3 == 0) {
[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);
8 S2(c0 + c1, c0);
9 S1(c0, c1);
12 S1(c0, c1);
14 S2(c0 + c1, c0);
16 for (int c0 = M - 9; c0 <= M; c0 += 1) variable
[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
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);
13 if (c0 >= M + 1)
[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 …]
/llvm-project-15.0.7/polly/lib/External/isl/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
5 for (int c0 = max(a3, a2); c0 <= min(min(a1 - 1, b3), b2); c0 += 1) { variable
9 for (int c0 = max(max(a3, b3 + 1), a2); c0 <= min(a1 - 1, b2); c0 += 1) variable
11 for (int c0 = a1; c0 <= min(min(b1, a3 - 1), a2 - 1); c0 += 1) variable
13 for (int c0 = max(a1, a2); c0 <= min(min(b1, a3 - 1), b2); c0 += 1) { variable
17 for (int c0 = max(a1, a3); c0 <= min(min(b1, b3), a2 - 1); c0 += 1) { variable
21 for (int c0 = max(max(a1, a3), b3 + 1); c0 <= min(b1, a2 - 1); c0 += 1) variable
32 for (int c0 = max(max(a1, a2), b2 + 1); c0 <= min(b1, a3 - 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)
8 for (int c0 = max(max(a1, a2), b2 + 1); c0 <= min(b1, a3 - 1); c0 += 1) variable
10 for (int c0 = a3; c0 <= b3; c0 += 1) { variable
11 if (c0 >= a1 && b1 >= c0)
13 if (c0 >= a2 && b2 >= c0)
17 for (int c0 = max(max(a1, a3), b3 + 1); c0 <= min(b1, a2 - 1); c0 += 1) variable
19 for (int c0 = max(max(a3, b3 + 1), a2); c0 <= b2; c0 += 1) { variable
[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);
14 for (int c0 = max(a + 20, b + 1); c0 <= b + 10; c0 += 1) { variable
[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)
14 if (c0 >= a1 && b1 >= c0 && c1_0 >= c1 && d1 >= c1_0)
16 s1(c0, c1_0);
18 if (c0 >= a1 && b1 >= c0)
22 for (int c0 = max(max(a1, a2), b2 + 1); c0 <= b1; c0 += 1) variable
[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);
15 s1(c0, c1_0);
18 s1(c0, c1_0);
31 for (int c0 = max(max(a1, a2), b2 + 1); c0 <= b1; c0 += 1) variable
[all …]
/llvm-project-15.0.7/polly/lib/External/isl/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…
9 for (int c3 = max(0, (c2 / 2) - c0 + 1); c3 <= min(31, m - c0 - 2); c3 += 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)
15 S_29(-c0 + c2 - c3 + c5, c0 + c3);
17 for (int c3 = max(0, (c2 / 2) - c0 + 1); c3 <= min(31, m - c0 - 2); c3 += 1)
19 S_29(-c0 + c2 - c3 + c5, c0 + c3);
21 for (int c3 = 0; c3 <= min(min(31, m - c0 - 2), -c0 + c2 + 30); c3 += 1) {
[all …]
/llvm-project-15.0.7/polly/test/ScheduleOptimizer/
H A Densure-correct-tile-sizes.ll27 ; CHECK-NEXT: for (int c0 = 0; c0 <= 93; c0 += 1)
35 ; CHECK-NEXT: for (int c0 = 0; c0 <= 23; c0 += 1)
40 ; CHECK-NEXT: Stmt_for_body8(c1, 128 * c0, c2);
41 ; CHECK-NEXT: Stmt_for_body8(c1, 128 * c0 + 1, c2);
42 ; CHECK-NEXT: Stmt_for_body8(c1, 128 * c0 + 2, c2);
43 ; CHECK-NEXT: Stmt_for_body8(c1, 128 * c0 + 3, c2);
44 ; CHECK-NEXT: Stmt_for_body8(c1, 128 * c0 + 4, c2);
45 ; CHECK-NEXT: Stmt_for_body8(c1, 128 * c0 + 5, c2);
46 ; CHECK-NEXT: Stmt_for_body8(c1, 128 * c0 + 6, c2);
47 ; CHECK-NEXT: Stmt_for_body8(c1, 128 * c0 + 7, c2);
[all …]
/llvm-project-15.0.7/mlir/test/Conversion/GPUToSPIRV/
H A Dbuiltins.mlir7 blocks in (%c0, %c0, %c0) threads in (%c0, %c0, %c0)
32 blocks in (%c0, %c0, %c0) threads in (%c0, %c0, %c0)
57 blocks in (%c0, %c0, %c0) threads in (%c0, %c0, %c0)
81 blocks in (%c0, %c0, %c0) threads in (%c0, %c0, %c0)
106 blocks in (%c0, %c0, %c0) threads in (%c0, %c0, %c0)
128 blocks in (%c0, %c0, %c0) threads in (%c0, %c0, %c0)
150 blocks in (%c0, %c0, %c0) threads in (%c0, %c0, %c0)
174 blocks in (%c0, %c0, %c0) threads in (%c0, %c0, %c0)
230 blocks in (%c0, %c0, %c0) threads in (%c0, %c0, %c0)
254 blocks in (%c0, %c0, %c0) threads in (%c0, %c0, %c0)
[all …]

12345678910>>...45