Home
last modified time | relevance | path

Searched refs:c3 (Results 1 – 25 of 534) sorted by relevance

12345678910>>...22

/llvm-project-15.0.7/polly/lib/External/isl/test_inputs/codegen/cloog/
H A Dreservoir-mg-interp.c3 for (int c3 = 1; c3 <= M; c3 += 1) variable
5 for (int c3 = 1; c3 < M; c3 += 1) { variable
10 for (int c3 = 1; c3 <= M; c3 += 1) variable
12 for (int c3 = 1; c3 <= M; c3 += 1) variable
14 for (int c3 = 1; c3 < M; c3 += 1) { variable
18 for (int c3 = 1; c3 < M; c3 += 1) variable
21 for (int c3 = 1; c3 <= M; c3 += 1) variable
23 for (int c3 = 1; c3 < M; c3 += 1) variable
27 for (int c3 = 1; c3 < M; c3 += 1) variable
29 for (int c3 = 1; c3 <= M; c3 += 1) variable
[all …]
/llvm-project-15.0.7/polly/lib/External/isl/test_inputs/codegen/omega/
H A Dts1d-mp-i_ts-m_b-0.c12 for (int c3 = -((c1 + 9) / 8) + 2; c3 <= floord(N - 500 * c1 - 3, 4000) + 1; c3 += 1) variable
13 …(500 * c1 + 1, 1000 * c1 + 4000 * c3 - 3999); c4 <= min(min(N + T - 3, 1000 * c1 + 4000 * c3 - 300…
16 …for (int c3 = max(-((T + 4000) / 4000) + 2, -((c1 + 9) / 8) + 2); c3 <= floord(N - 500 * c1 - 3, 4… variable
17 …00 * c1 + 4000 * c3 - 3999, -4000 * c3 + 4000); c4 <= min(min(2 * T + 4000 * c3 - 4000, 1000 * c1 …
19 …for (int c3 = -((c1 + 7) / 8) + 1; c3 <= min(floord(N + T - 1000 * c1 - 1004, 4000) + 1, floord(N … variable
23 …for (int c3 = max(-((T + 4000) / 4000) + 1, -((c1 + 9) / 8) + 1); c3 <= floord(N - 500 * c1 - 3, 4… variable
24 …int c4 = max(-4000 * c3, 1000 * c1 + 4000 * c3 + 1); c4 <= min(min(2 * N - 4000 * c3 - 5, 2 * T + …
25 s4(2, -2000 * c3 + (c4 + 1) / 2 - 1, 1, 2000 * c3 + c4 - (c4 + 1) / 2 + 1, 1);
26 …for (int c3 = -((c1 + 8) / 8) + 1; c3 <= min(floord(N + T - 1000 * c1 - 4, 4000), floord(N - 500 *… variable
27 …0 * c1 + 4000 * c3 + 1, -4000 * c3 + 2); c4 <= min(min(min(N + T - 3, N + 500 * c1 + 497), 2 * T +…
[all …]
H A Dlift2-2.c5 for (int c3 = 1; c3 <= 100; c3 += 1) variable
7 s1(c0, c1, c2, c3, c4);
9 for (int c3 = 1; c3 <= 100; c3 += 1) variable
11 s1(c0, c1, c2, c3, c4);
13 for (int c3 = 1; c3 <= 100; c3 += 1) variable
15 s1(c0, c1, c2, c3, c4);
16 s0(c0, c1, c2, c3, c4);
H A Dlift2-3.c5 for (int c3 = 1; c3 <= 100; c3 += 1) variable
7 s1(c0, c1, c2, c3, c4);
10 for (int c3 = 1; c3 <= 100; c3 += 1) variable
12 s1(c0, c1, c2, c3, c4);
15 for (int c3 = 1; c3 <= 100; c3 += 1) variable
17 s1(c0, c1, c2, c3, c4);
18 s0(c0, c1, c2, c3, c4);
H A Dlefur04-0.c4 …for (int c3 = max(max(max(0, c1 - (-c1 + 3) / 3), c0 - (-c2 + 3) / 3), c2 + floord(3 * c1 - c2 - 1… variable
5 …ax(max(max(max(0, 2 * c3 - 4), c1 - (-c1 + 3) / 3), c2 - (c2 + 3) / 3), c3 - (c3 + 3) / 3); c5 <= …
6 …c3 - 199, 250 * c3 + 1), 1000 * c0 - 500 * c5 - 501), 667 * c0 - 333 * c1 - (c0 + c1 + 3) / 3 - 33…
7 … c6), 1000 * c3 - 2 * c6 + 2), 500 * c1 + (c6 + 1) / 2); c7 <= min(min(min(min(500 * c5 + 501, 2 *…
8 s0(c0, c1, c2, c3, c2 / 3, c5, c6, c7);
H A Dlift2-4.c5 for (int c3 = 1; c3 <= 100; c3 += 1) variable
7 s1(c0, c1, c2, c3, c4);
11 for (int c3 = 1; c3 <= 100; c3 += 1) variable
13 s1(c0, c1, c2, c3, c4);
17 for (int c3 = 1; c3 <= 100; c3 += 1) variable
19 s1(c0, c1, c2, c3, c4);
20 s0(c0, c1, c2, c3, c4);
H A Dlift2-5.c4 for (int c3 = 1; c3 <= 100; c3 += 1) variable
6 s1(c0, c1, c2, c3, c4);
10 for (int c3 = 1; c3 <= 100; c3 += 1) variable
12 s1(c0, c1, c2, c3, c4);
13 s0(c0, c1, c2, c3, c4);
18 for (int c3 = 1; c3 <= 100; c3 += 1) variable
20 s1(c0, c1, c2, c3, c4);
H A Dfc1-1.c1 for (int c3 = 1; c3 <= n; c3 += 1) variable
2 s2(c3);
4 for (int c3 = 0; c3 < n - c0 - 1; c3 += 1) variable
5 s0(c0 + 1, n - c3);
6 for (int c3 = 0; c3 < n - c0 - 1; c3 += 1) variable
8 s1(c0 + 1, n - c3, c6);
H A Dfc1-2.c1 for (int c3 = 1; c3 <= n; c3 += 1) variable
2 s2(c3);
4 for (int c3 = 0; c3 < n - c0 - 1; c3 += 1) variable
5 s0(c0 + 1, n - c3);
6 for (int c3 = 0; c3 < n - c0 - 1; c3 += 1) variable
8 s1(c0 + 1, n - c3, c6);
H A Dfc2-1.c1 for (int c3 = 1; c3 <= n; c3 += 1) variable
2 s2(c3);
4 for (int c3 = 0; c3 < n - c0 - 1; c3 += 1) variable
5 s0(c0 + 1, n - c3);
6 for (int c3 = 0; c3 < n - c0 - 1; c3 += 1) variable
8 s1(c0 + 1, n - c3, c6);
H A Dp.delft2-0.c4 for (int c3 = 0; c3 <= 7; c3 += 1) variable
5 if (4 * P2 >= 2 * c3 + 9 * floord(4 * P2 - 2 * c3 - 1, 9) + 6) {
7 …s0(P1 - 1, P2, c2, c3, ((-4 * P1 + 2 * c2 + 9) % 9) + 1, -4 * P2 + 2 * c3 - 9 * floord(-4 * P2 + 2…
9 s0(3, P2, c2, c3, (-c2 / 4) + 3, -4 * P2 + 2 * c3 - 9 * floord(-4 * P2 + 2 * c3, 9));
/llvm-project-15.0.7/polly/lib/External/isl/test_inputs/codegen/
H A Dseparation_class4.c4 for (int c3 = 0; c3 <= 1; c3 += 1) variable
5 for (int c5 = c3 + 58; c5 <= -c3 + 61; c5 += 1)
6 S_0(c3, c5);
9 …for (int c3 = max(4 * c0 - 2, 4 * c0 + 6 * c2 - 12); c3 <= min(4 * c0 + 1, 4 * c0 + 6 * c2 - 7); c… variable
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 +=… variable
15 …for (int c5 = max(-4 * c0 + c3 + 59, 4 * c0 - c3 + 62); c5 <= min(-4 * c0 + c3 + 63, 4 * c0 - c3 +…
16 S_0(c3, c5);
18 for (int c3 = 510; c3 <= 511; c3 += 1) variable
19 for (int c5 = -c3 + 569; c5 < c3 - 449; c5 += 1)
[all …]
H A Dshift2.c4 for (int c3 = 0; c3 <= length; c3 += 32) { variable
6 for (int c6 = max(0, -c3 + 1); c6 <= min(31, length - c3); c6 += 1)
7 S_0(c0, 0, c3 + c6 - 1);
10 S_0(c0, c2 + c5, c3 + c6 - 1);
12 for (int c6 = max(0, -c3 + 1); c6 <= min(length - c3, 2 * c2 - c3 + 2 * c5 - 1); c6 += 1)
13 S_0(c0, c2 + c5, c3 + c6 - 1);
17 for (int c6 = 2 * c2 - c3 + 2 * c5 + 1; c6 <= min(31, length - c3); c6 += 1)
21 for (int c6 = max(0, -c3 + 1); c6 <= min(31, length - c3); c6 += 1)
25 if (c3 >= 2 * c2 && 2 * c2 + 32 >= c3)
30 …for (int c3 = max(2 * c2, -(length % 32) + length + 32); c3 <= min(2 * length - 2, 2 * c2 + 62); c… variable
[all …]
H A Dcorrelation.c9 for (int c3 = max(0, (c2 / 2) - c0 + 1); c3 <= min(31, m - c0 - 2); c3 += 1) variable
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) variable
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) variable
18 for (int c5 = max(0, c0 - c2 + c3); c5 <= min(31, 2 * c0 - c2 + 2 * c3 - 1); c5 += 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) { variable
37 for (int c5 = max(0, c0 - c2 + c3); c5 <= min(31, 2 * c0 - c2 + 2 * c3 - 1); c5 += 1)
[all …]
H A Disolate7.c5 for (int c3 = 0; c3 <= 31; c3 += 1) variable
6 S_1(c0 + c2, c1 + c3);
9 for (int c3 = 0; c3 < n - c1; c3 += 1) variable
10 S_1(c0 + c2, c1 + c3);
18 for (int c3 = 0; c3 <= 31; c3 += 1) variable
19 S_1(-((n + 32) % 32) + n + c2, c1 + c3);
22 for (int c3 = 0; c3 < n - c1; c3 += 1) variable
23 S_1(c1 + c2, c1 + c3);
H A Dseparation_class2.c4 for (int c3 = 0; c3 <= 7; c3 += 1) variable
5 A(c0 + c2, c1 + c3);
7 for (int c3 = 0; c3 < n % 8; c3 += 1) variable
8 A(c0 + c2, -(n % 8) + n + c3);
12 for (int c3 = 0; c3 <= min(7, n - c1 - 1); c3 += 1) variable
13 A(-(n % 8) + n + c2, c1 + c3);
H A Dlu.c5 for (int c3 = c0; c3 <= min(c0 + 31, c2 + 30); c3 += 1) variable
7 for (int c5 = max(c2, c3 + 1); c5 <= min(n - 1, c2 + 31); c5 += 1)
8 S_6(c3, c4, c5);
10 for (int c3 = c0; c3 <= min(min(n - 2, c0 + 31), c2 + 30); c3 += 1) { variable
11 for (int c5 = max(c2, c3 + 1); c5 <= min(n - 1, c2 + 31); c5 += 1)
12 S_2(c3, c5);
13 for (int c4 = c3 + 1; c4 <= min(n - 1, c0 + 31); c4 += 1)
14 for (int c5 = max(c2, c3 + 1); c5 <= min(n - 1, c2 + 31); c5 += 1)
15 S_6(c3, c4, c5);
H A Dseparation_class.c4 for (int c3 = 10 * c1; c3 <= 10 * c1 + 9; c3 += 1) variable
5 A(c2, c3);
8 for (int c3 = 10 * c1; c3 <= min(10 * c1 + 9, -c2 + 100); c3 += 1) variable
9 A(c2, c3);
14 for (int c3 = 10 * c1; c3 <= min(10 * c1 + 9, -c2 + 100); c3 += 1) variable
15 A(c2, c3);
H A Droman.c8 for (int c3 = 0; c3 <= min(19, i + c1 - 3); c3 += 1) { variable
9 S_15(c1, c3);
10 for (int c5 = 0; c5 < c3; c5 += 1) {
11 S_16(c1, c3, c5);
12 S_17(c1, c3, c5);
14 S_16(c1, c3, c3);
15 S_18(c1, c3);
16 S_24(c1, c3);
17 S_19(c1, c3);
/llvm-project-15.0.7/polly/test/ScheduleOptimizer/
H A Dpattern-matching-based-opts_7.ll27 ; CHECK-NEXT: for (int c3 = 0; c3 <= 1023; c3 += 1)
29 ; CHECK-NEXT: CopyStmt_0(0, c3, c4);
36 ; CHECK-NEXT: for (int c3 = 0; c3 <= 127; c3 += 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_5.ll43 ; CHECK-NEXT: for (int c3 = 2048 * c0; c3 <= min(nj - 1, 2048 * c0 + 2047); c3 += 1)
45 ; CHECK-NEXT: CopyStmt_0(0, c3, c4);
54 ; CHECK-NEXT: for (int c3 = 0; c3 <= min(255, -256 * c0 + nj / 8 - 1); c3 += 1…
256 ; CHECK-NEXT: for (int c3 = 0; c3 <= min(255, -256 * c0 + (nj - 1) / 8); c3 …
262 ; CHECK-NEXT: if (nj >= 2048 * c0 + 8 * c3 + 2) {
264 ; CHECK-NEXT: if (nj >= 2048 * c0 + 8 * c3 + 3) {
266 ; CHECK-NEXT: if (nj >= 2048 * c0 + 8 * c3 + 4) {
268 ; CHECK-NEXT: if (nj >= 2048 * c0 + 8 * c3 + 5) {
284 ; CHECK-NEXT: if (nj >= 2048 * c0 + 8 * c3 + 2) {
286 ; CHECK-NEXT: if (nj >= 2048 * c0 + 8 * c3 + 3) {
[all …]
H A Dmat_mul_pattern_data_layout_2.ll28 ; CHECK-NEXT: for (int c3 = 0; c3 <= 31; c3 += 1)
29 ; CHECK-NEXT: Stmt_bb9(32 * c0 + c2, 32 * c1 + c3);
33 ; CHECK-NEXT: for (int c3 = 0; c3 <= 1055; c3 += 1)
35 ; CHECK-NEXT: CopyStmt_0(0, c3, c4);
42 ; CHECK-NEXT: for (int c3 = 0; c3 <= 131; c3 += 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);
[all …]
H A Dpattern-matching-based-opts_8.ll28 ; CHECK-NEXT: for (int c3 = 0; c3 <= 1023; c3 += 1)
30 ; CHECK-NEXT: CopyStmt_0(0, c3, c4);
37 ; CHECK-NEXT: for (int c3 = 0; c3 <= 127; c3 += 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 …]
/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/clang/test/CodeGen/
H A Darm64-abi-vector.c27 __char2 c3 = va_arg(ap, __char2); in varargs_vec_2c() local
28 sum = sum + c3.x + c3.y; in varargs_vec_2c()
47 sum = sum + c3.x + c3.y; in varargs_vec_3c()
149 sum = sum + c3.x + c3.y; in varargs_vec_3s()
193 sum = sum + c3.x + c3.y; in varargs_vec_3i()
235 sum = sum + c3.x + c3.y; in varargs_vec_3d()
254 sum = sum + c3.x + c3.y; in varargs_vec()
314 sum = sum + c3.x + c3.y; in args_vec_3c()
376 sum = sum + c3.x + c3.y; in args_vec_3s()
408 sum = sum + c3.x + c3.y; in args_vec_3i()
[all …]

12345678910>>...22