Home
last modified time | relevance | path

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

12345678910>>...13

/llvm-project-15.0.7/polly/lib/External/isl/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…
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
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);
27 …c4 = max(1000 * c1 + 4000 * c3 + 1, -4000 * c3 + 2); c4 <= min(min(min(N + T - 3, N + 500 * c1 + 4… variable
28 …t c5 = max(-N - 500 * c1 + c4 + 2, -500 * c1 - 2000 * c3 + (c4 + 1) / 2); c5 <= min(min(499, T - 5…
33 …for (int c4 = max(T, 2 * T + 4000 * c3 - 4001); c4 < min(N + T - 2, 2 * T + 4000 * c3 - 1); c4 += … variable
[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);
/llvm-project-15.0.7/llvm/test/MC/Sparc/
H A Dsparc-coproc.s8 ld [%i1], %c4
9 ld [%i1 - 15], %c4
10 ld [%i1 +%o3], %c4
11 ld [%i7], %c4
20 ldd [%i1], %c4
21 ldd [%i7], %c4
32 st %c4, [%i1]
33 st %c4, [%i7]
34 st %c4, [%i7+48]
44 std %c4, [%i1]
[all …]
/llvm-project-15.0.7/polly/test/ScheduleOptimizer/
H A Dpattern-matching-based-opts_7.ll28 ; CHECK-NEXT: for (int c4 = 384 * c1; c4 <= min(1023, 384 * c1 + 383); c4 += 1)
29 ; CHECK-NEXT: CopyStmt_0(0, c3, c4);
37 ; CHECK-NEXT: for (int c4 = 0; c4 <= 15; c4 += 1)
42 ; CHECK-NEXT: Stmt_for_body6(128 * c2 + 8 * c4, 8 * c3, 384 * c1 + c5);
43 ; CHECK-NEXT: Stmt_for_body6(128 * c2 + 8 * c4, 8 * c3 + 1, 384 * c1 + c5);
44 ; CHECK-NEXT: Stmt_for_body6(128 * c2 + 8 * c4, 8 * c3 + 2, 384 * c1 + c5);
45 ; CHECK-NEXT: Stmt_for_body6(128 * c2 + 8 * c4, 8 * c3 + 3, 384 * c1 + c5);
46 ; CHECK-NEXT: Stmt_for_body6(128 * c2 + 8 * c4, 8 * c3 + 4, 384 * c1 + c5);
47 ; CHECK-NEXT: Stmt_for_body6(128 * c2 + 8 * c4, 8 * c3 + 5, 384 * c1 + c5);
48 ; CHECK-NEXT: Stmt_for_body6(128 * c2 + 8 * c4, 8 * c3 + 6, 384 * c1 + c5);
[all …]
H A Dpattern-matching-based-opts_13.ll17 ; CHECK-NEXT: for (int c4 = 307 * c1; c4 <= min(1999, 307 * c1 + 306); c4 += 1)
18 ; CHECK-NEXT: CopyStmt_0(0, c3, c4);
27 ; CHECK-NEXT: for (int c4 = 0; c4 <= 15; c4 += 1)
65 ; CHECK-NEXT: for (int c4 = 0; c4 <= 15; c4 += 1)
70 ; CHECK-NEXT: Stmt_for_body6(80 * c2 + 5 * c4, 1998, 307 * c1 + c5);
71 ; CHECK-NEXT: Stmt_for_body6(80 * c2 + 5 * c4, 1999, 307 * c1 + c5);
72 ; CHECK-NEXT: Stmt_for_body6(80 * c2 + 5 * c4 + 1, 1998, 307 * c1 + c5);
73 ; CHECK-NEXT: Stmt_for_body6(80 * c2 + 5 * c4 + 1, 1999, 307 * c1 + c5);
74 ; CHECK-NEXT: Stmt_for_body6(80 * c2 + 5 * c4 + 2, 1998, 307 * c1 + c5);
75 ; CHECK-NEXT: Stmt_for_body6(80 * c2 + 5 * c4 + 2, 1999, 307 * c1 + c5);
[all …]
H A Dpattern-matching-based-opts_6.ll44 ; CHECK-NEXT: for (int c4 = 256 * c1; c4 <= min(1019, 256 * c1 + 255); c4 += 1)
45 ; CHECK-NEXT: CopyStmt_0(0, c3, c4);
54 ; CHECK-NEXT: for (int c4 = 0; c4 <= min(23, -24 * c2 + 254); c4 += 1)
59 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 8 * c3, 256 * c1 + c5);
60 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 8 * c3 + 1, 256 * c1 + c5);
61 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 8 * c3 + 2, 256 * c1 + c5);
93 ; CHECK-NEXT: for (int c4 = 0; c4 <= min(23, -24 * c2 + 254); c4 += 1)
98 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 1016, 256 * c1 + c5);
99 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 1017, 256 * c1 + c5);
100 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 1018, 256 * c1 + c5);
[all …]
H A Dmat_mul_pattern_data_layout_2.ll34 ; CHECK-NEXT: for (int c4 = 256 * c1; c4 <= min(1022, 256 * c1 + 255); c4 += 1)
35 ; CHECK-NEXT: CopyStmt_0(0, c3, c4);
43 ; CHECK-NEXT: for (int c4 = 0; c4 <= 23; c4 += 1)
48 ; CHECK-NEXT: Stmt_Copy_0(96 * c2 + 4 * c4, 8 * c3, 256 * c1 + c5);
49 ; CHECK-NEXT: Stmt_Copy_0(96 * c2 + 4 * c4, 8 * c3 + 1, 256 * c1 + c5);
50 ; CHECK-NEXT: Stmt_Copy_0(96 * c2 + 4 * c4, 8 * c3 + 2, 256 * c1 + c5);
51 ; CHECK-NEXT: Stmt_Copy_0(96 * c2 + 4 * c4, 8 * c3 + 3, 256 * c1 + c5);
52 ; CHECK-NEXT: Stmt_Copy_0(96 * c2 + 4 * c4, 8 * c3 + 4, 256 * c1 + c5);
53 ; CHECK-NEXT: Stmt_Copy_0(96 * c2 + 4 * c4, 8 * c3 + 5, 256 * c1 + c5);
54 ; CHECK-NEXT: Stmt_Copy_0(96 * c2 + 4 * c4, 8 * c3 + 6, 256 * c1 + c5);
[all …]
H A Dpattern-matching-based-opts_8.ll29 ; CHECK-NEXT: for (int c4 = 256 * c1; c4 <= 256 * c1 + 255; c4 += 1)
30 ; CHECK-NEXT: CopyStmt_0(0, c3, c4);
38 ; CHECK-NEXT: for (int c4 = 0; c4 <= min(23, -24 * c2 + 255); c4 += 1)
43 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 8 * c3, 256 * c1 + c5);
44 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 8 * c3 + 1, 256 * c1 + c5);
45 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 8 * c3 + 2, 256 * c1 + c5);
46 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 8 * c3 + 3, 256 * c1 + c5);
47 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 8 * c3 + 4, 256 * c1 + c5);
48 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 8 * c3 + 5, 256 * c1 + c5);
49 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 8 * c3 + 6, 256 * c1 + c5);
[all …]
H A Dpattern-matching-based-opts_5.ll44 ; CHECK-NEXT: for (int c4 = 256 * c1; c4 <= min(nk - 1, 256 * c1 + 255); c4 += 1)
45 ; CHECK-NEXT: CopyStmt_0(0, c3, c4);
55 ; CHECK-NEXT: for (int c4 = 0; c4 <= min(23, -24 * c2 + ni / 4 - 1); c4 += 1)
170 ; CHECK-NEXT: for (int c4 = 0; c4 <= min(23, -24 * c2 + (ni - 1) / 4); c4 +=…
193 ; CHECK-NEXT: if (ni >= 96 * c2 + 4 * c4 + 2) {
212 ; CHECK-NEXT: if (ni >= 96 * c2 + 4 * c4 + 3) {
231 ; CHECK-NEXT: if (ni >= 96 * c2 + 4 * c4 + 4) {
331 ; CHECK-NEXT: for (int c4 = 0; c4 <= min(23, -24 * c2 + (ni - 1) / 4); c4 +=…
354 ; CHECK-NEXT: if (ni >= 96 * c2 + 4 * c4 + 2) {
373 ; CHECK-NEXT: if (ni >= 96 * c2 + 4 * c4 + 3) {
[all …]
H A Dpattern-matching-based-opts_4.ll28 ; PATTERN-MATCHING-OPTS-NEXT: for (int c4 = 0; c4 <= 1023; c4 += 1)
29 ; PATTERN-MATCHING-OPTS-NEXT: CopyStmt_0(0, c3, c4);
37 ; PATTERN-MATCHING-OPTS-NEXT: for (int c4 = 0; c4 <= min(23, -24 * c2 + 255); c4 += 1)
42 ; PATTERN-MATCHING-OPTS-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 256 * c1 + c5, 8 * c3…
43 ; PATTERN-MATCHING-OPTS-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 256 * c1 + c5, 8 * c3…
44 ; PATTERN-MATCHING-OPTS-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 256 * c1 + c5, 8 * c3…
45 ; PATTERN-MATCHING-OPTS-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 256 * c1 + c5, 8 * c3…
46 ; PATTERN-MATCHING-OPTS-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 256 * c1 + c5, 8 * c3…
47 ; PATTERN-MATCHING-OPTS-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 256 * c1 + c5, 8 * c3…
48 ; PATTERN-MATCHING-OPTS-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 256 * c1 + c5, 8 * c3…
[all …]
/llvm-project-15.0.7/polly/lib/External/isl/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);
/llvm-project-15.0.7/llvm/test/MC/ARM/
H A Dcoprocessors.s10 mrc p0, #1, r2, c3, c4, #5
14 mrc p1, #1, r2, c3, c4, #5
18 mrc p2, #1, r2, c3, c4, #5
22 mrc p3, #1, r2, c3, c4, #5
26 mrc p4, #1, r2, c3, c4, #5
30 mrc p5, #1, r2, c3, c4, #5
34 mrc p6, #1, r2, c3, c4, #5
38 mrc p7, #1, r2, c3, c4, #5
42 mrc p8, #1, r2, c3, c4, #5
46 mrc p9, #1, r2, c3, c4, #5
[all …]
/llvm-project-15.0.7/mlir/test/Dialect/Arithmetic/
H A Dunsigned-when-equivalent.mlir18 %c4 = arith.constant 4 : i32
21 %2 = arith.divsi %1, %c4 : i32
24 %5 = arith.remsi %1, %c4 : i32
25 %6 = arith.minsi %1, %c4 : i32
26 %7 = arith.maxsi %1, %c4 : i32
50 %c4 = arith.constant 4 : i32
53 %2 = arith.divsi %1, %c4 : i32
56 %5 = arith.remsi %1, %c4 : i32
57 %6 = arith.minsi %1, %c4 : i32
58 %7 = arith.maxsi %1, %c4 : i32
[all …]

12345678910>>...13