Home
last modified time | relevance | path

Searched full:c0 (Results 1 – 25 of 3707) sorted by relevance

12345678910>>...149

/external/llvm-project/polly/lib/External/isl/test_inputs/codegen/cloog/
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 (m >= c0 + 2) {
16 S5(c0 - 1, 1, c0, 1, c0, 1, c0 + 1, 1);
17 S1(c0, 1, c0 + 1, 1);
18 S2(c0, 1, c0 + 1, 1, c0 + 1, 1, c0 + 2, 1);
19 S4(c0, 1, c0 + 2, 2, c0 + 1, 1, c0 + 2, 2);
20 S3(c0, 1, c0 + 1, 2, c0 + 1, 1, c0 + 1, 2);
22 S5(c0 - 1, -m + c0 + 2, c0, -m + c0 + 2, m - 1, -m + c0 + 2, m, -m + c0 + 2);
[all …]
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 …]
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 …]
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 >= 5 && 2 * n >= c0 + 3) {
7 S4(c0 - c0 / 2 - 2, c0 / 2 + 2);
8 for (int c2 = 1; c2 < c0 - c0 / 2 - 1; c2 += 1)
9 S5(c0 - c0 / 2 - 1, c0 / 2 + 1, c2);
11 for (int c1 = -c0 + c0 / 2 + 3; c1 <= min(-1, n - c0); c1 += 1) {
[all …]
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 …]
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 …]
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 …]
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);
Dreservoir-liu-zhuge1.c2 for (int c0 = -4; c0 <= 3 * M + N; c0 += 1) { variable
3 if (c0 >= 3 * M) {
4 S2(M, -3 * M + c0);
5 } else if (3 * M >= c0 + 4 && (c0 + 1) % 3 == 0) {
6 S1((c0 + 4) / 3, 0);
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 (3 * M + N >= c0 + 3 && c0 >= N && (N - c0) % 3 == 0) {
13 S2((-N + c0) / 3, N);
[all …]
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 …]
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 = max(0, T_66 + 1); c0 < min(T_2, T_67); c0 += 1) variable
6 S1(c0);
7 for (int c0 = T_67; c0 <= min(T_2 - 1, T_66); c0 += 1) { variable
8 S1(c0);
9 S2(c0);
11 for (int c0 = max(T_67, T_66 + 1); c0 < T_2; c0 += 1) variable
12 S1(c0);
[all …]
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 …]
/external/llvm-project/polly/lib/External/isl/test_inputs/codegen/omega/
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 …]
Dwak1-0.c1 for (int c0 = a3; c0 <= min(min(a1 - 1, b3), a2 - 1); c0 += 1) variable
2 s2(c0);
3 for (int c0 = a1; c0 <= min(b1, a2 - 1); c0 += 1) { variable
4 s0(c0);
5 if (c0 >= a3 && b3 >= c0)
6 s2(c0);
8 for (int c0 = max(max(a1, b1 + 1), a3); c0 <= min(b3, a2 - 1); c0 += 1) variable
9 s2(c0);
10 for (int c0 = a2; c0 <= b2; c0 += 1) { variable
11 if (c0 >= a1 && b1 >= c0)
[all …]
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 …]
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 …]
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 …]
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 …]
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 …]
/external/llvm-project/polly/test/ScheduleOptimizer/
Densure-correct-tile-sizes.ll27 ; CHECK-NEXT: for (int c0 = 0; c0 <= 93; c0 += 1)
30 ; CHECK-NEXT: for (int c2 = 0; c2 <= min(31, -32 * c0 + 2999); c2 += 1)
32 ; CHECK-NEXT: Stmt_for_body3(32 * c0 + c2, 32 * c1 + c3);
36 ; CHECK-NEXT: for (int c0 = 0; c0 <= 23; c0 += 1)
41 ; CHECK-NEXT: Stmt_for_body8(c1, 128 * c0, c2);
42 ; CHECK-NEXT: Stmt_for_body8(c1, 128 * c0 + 1, c2);
43 ; CHECK-NEXT: Stmt_for_body8(c1, 128 * c0 + 2, c2);
44 ; CHECK-NEXT: Stmt_for_body8(c1, 128 * c0 + 3, c2);
45 ; CHECK-NEXT: Stmt_for_body8(c1, 128 * c0 + 4, c2);
46 ; CHECK-NEXT: Stmt_for_body8(c1, 128 * c0 + 5, c2);
[all …]
Dpattern-matching-based-opts_5.ll42 ; CHECK-NEXT: for (int c0 = 0; c0 <= floord(nj - 1, 2048); c0 += 1)
44 ; CHECK-NEXT: for (int c3 = 2048 * c0; c3 <= min(nj - 1, 2048 * c0 + 2047); c3 += 1)
48 ; CHECK-NEXT: if (c0 == 0)
56 ; CHECK-NEXT: for (int c3 = 0; c3 <= min(255, -256 * c0 + nj / 8 - 1); c3 += 1…
62 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 2048 * c0 + 8 * c3, 256…
63 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 2048 * c0 + 8 * c3 + 1,…
64 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 2048 * c0 + 8 * c3 + 2,…
65 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 2048 * c0 + 8 * c3 + 3,…
66 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 2048 * c0 + 8 * c3 + 4,…
67 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 2048 * c0 + 8 * c3 + 5,…
[all …]
/external/llvm-project/polly/lib/External/isl/test_inputs/codegen/
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…
4 if (n >= c1 + 32 && c1 >= 0 && 2 * c0 >= c2 + 32) {
6 for (int c5 = max(0, c0 - c2 + 1); c5 <= min(31, m - c2 - 1); c5 += 1)
7 S_27(c0, c2 + c5, c1 + c4);
8 } else if (c0 >= 32 && c1 >= 0 && c2 >= 2 * c0) {
11 S_27(c0, c2 + c5, c1 + c4);
12 } else if (c0 == 0 && c1 >= 0) {
23 for (int c3 = 1; c3 <= min(31, (c2 / 2) - c0); c3 += 1)
[all …]
/external/llvm-project/mlir/test/Conversion/GPUToSPIRV/
Dbuiltins.mlir5 %c0 = constant 1 : index
7 blocks in (%c0, %c0, %c0) threads in (%c0, %c0, %c0)
29 %c0 = constant 1 : index
31 blocks in (%c0, %c0, %c0) threads in (%c0, %c0, %c0)
53 %c0 = constant 1 : index
55 blocks in (%c0, %c0, %c0) threads in (%c0, %c0, %c0)
77 %c0 = constant 1 : index
79 blocks in (%c0, %c0, %c0) threads in (%c0, %c0, %c0)
102 %c0 = constant 1 : index
104 blocks in (%c0, %c0, %c0) threads in (%c0, %c0, %c0)
[all …]
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
DRow.java19 public class Row<C0, C1, C2, C3, C4> implements java.lang.Comparable, Cloneable,
20 Freezable<Row<C0, C1, C2, C3, C4>>{
27 public static <C0, C1> R2<C0,C1> of(C0 p0, C1 p1) { in of()
30 public static <C0, C1, C2> R3<C0,C1,C2> of(C0 p0, C1 p1, C2 p2) { in of()
33 public static <C0, C1, C2, C3> R4<C0,C1,C2,C3> of(C0 p0, C1 p1, C2 p2, C3 p3) { in of()
36 public static <C0, C1, C2, C3, C4> R5<C0,C1,C2,C3,C4> of(C0 p0, C1 p1, C2 p2, C3 p3, C4 p4) { in of()
40 public static class R2<C0, C1> extends Row<C0, C1, C1, C1, C1> {
41 public R2(C0 a, C1 b) { in R2()
45 public static class R3<C0, C1, C2> extends Row<C0, C1, C2, C2, C2> {
46 public R3(C0 a, C1 b, C2 c) { in R3()
[all …]
/external/icu/android_icu4j/src/main/java/android/icu/impl/
DRow.java23 public class Row<C0, C1, C2, C3, C4> implements java.lang.Comparable, Cloneable,
24 Freezable<Row<C0, C1, C2, C3, C4>>{
31 public static <C0, C1> R2<C0,C1> of(C0 p0, C1 p1) { in of()
34 public static <C0, C1, C2> R3<C0,C1,C2> of(C0 p0, C1 p1, C2 p2) { in of()
37 public static <C0, C1, C2, C3> R4<C0,C1,C2,C3> of(C0 p0, C1 p1, C2 p2, C3 p3) { in of()
40 public static <C0, C1, C2, C3, C4> R5<C0,C1,C2,C3,C4> of(C0 p0, C1 p1, C2 p2, C3 p3, C4 p4) { in of()
47 public static class R2<C0, C1> extends Row<C0, C1, C1, C1, C1> {
48 public R2(C0 a, C1 b) { in R2()
55 public static class R3<C0, C1, C2> extends Row<C0, C1, C2, C2, C2> {
56 public R3(C0 a, C1 b, C2 c) { in R3()
[all …]

12345678910>>...149