Home
last modified time | relevance | path

Searched refs:c5 (Results 1 – 25 of 183) sorted by relevance

12345678

/llvm-project-15.0.7/polly/lib/External/isl/test_inputs/codegen/
H A Dshift2.c8 for (int c5 = max(0, -c2 + 1); c5 <= min(31, (c3 / 2) - c2 - 1); c5 += 1) variable
11 …for (int c5 = max(max(0, -c2 + 1), (c3 / 2) - c2); c5 <= min(min(31, length - c2 - 1), (c3 / 2) - … variable
14 S_3(c0, 0, c2 + c5);
15 if (length >= 2 * c2 + 2 * c5)
16 S_0(c0, c2 + c5, 2 * c2 + 2 * c5 - 1);
20 for (int c5 = max(0, (c3 / 2) - c2 + 16); c5 <= min(31, length - c2 - 1); c5 += 1) variable
27 …for (int c5 = max((c3 / 2) - c2, -c2 + c4 + 1); c5 <= min(length - c2 - 1, (c3 / 2) - c2 + 15); c5… variable
28 S_3(c0, c4, c2 + c5);
32 …for (int c5 = max((c3 / 2) - c2, -c2 + c4 + 1); c5 <= min(length - c2 - 1, (c3 / 2) - c2 + 15); c5… variable
33 S_3(c0, c4, c2 + c5);
[all …]
H A Dcorrelation.c6 for (int c5 = 0; c5 <= min(31, m - c2 - 1); c5 += 1) variable
7 S_14(c2 + c5);
10 for (int c5 = max(0, c0 - c2 + c3); c5 <= min(31, 2 * c0 - c2 + 2 * c3 - 1); c5 += 1) variable
14 for (int c5 = 0; c5 <= min(31, 2 * c0 - c2 + 2 * c3 - 1); c5 += 1) variable
18 for (int c5 = max(0, c0 - c2 + c3); c5 <= min(31, 2 * c0 - c2 + 2 * c3 - 1); c5 += 1) variable
28 for (int c5 = max(0, c0 - c2 + c3 + 1); c5 <= min(31, m - c2 - 1); c5 += 1) { variable
30 S_14(c2 + c5);
32 S_19(c1 + c4, c2 + c5);
37 for (int c5 = max(0, c0 - c2 + c3); c5 <= min(31, 2 * c0 - c2 + 2 * c3 - 1); c5 += 1) variable
42 for (int c5 = max(0, m - c2 - 1); c5 <= min(31, 2 * m - c2 - 3); c5 += 1) variable
[all …]
H A Dseparation_class4.c5 for (int c5 = c3 + 58; c5 <= -c3 + 61; c5 += 1) variable
6 S_0(c3, c5);
10 …for (int c5 = max(4 * c0 - c3 + 57, -4 * c0 + c3 + 58); c5 <= min(4 * c0 - c3 + 61, -4 * c0 + c3 +… variable
11 S_0(c3, c5);
15 …for (int c5 = max(-4 * c0 + c3 + 59, 4 * c0 - c3 + 62); c5 <= min(-4 * c0 + c3 + 63, 4 * c0 - c3 +… variable
16 S_0(c3, c5);
19 for (int c5 = -c3 + 569; c5 < c3 - 449; c5 += 1) variable
20 S_0(c3, c5);
H A Dlu.c7 for (int c5 = max(c2, c3 + 1); c5 <= min(n - 1, c2 + 31); c5 += 1) variable
8 S_6(c3, c4, c5);
11 for (int c5 = max(c2, c3 + 1); c5 <= min(n - 1, c2 + 31); c5 += 1) variable
12 S_2(c3, c5);
14 for (int c5 = max(c2, c3 + 1); c5 <= min(n - 1, c2 + 31); c5 += 1) variable
15 S_6(c3, c4, c5);
H A Dseparate2.c2 for (int c5 = 0; c5 <= 31; c5 += 1) variable
3 for (int c6 = max(0, 2 * (length % 16) + 2 * c5 - 62); c6 <= 30; c6 += 1) {
4 …) + 2 * c5 && 2 * (length % 16) >= c6 + 2 && 2 * (length % 16) + 2 * c5 >= c6 && 2 * (length % 32)…
6 if (length <= 15 && length >= c5 + 1 && c6 >= 1 && length >= c6)
7 S_0(c0, c5, c6 - 1);
H A Droman.c10 for (int c5 = 0; c5 < c3; c5 += 1) { variable
11 S_16(c1, c3, c5);
12 S_17(c1, c3, c5);
21 for (int c5 = 0; c5 < i + c1 - 2; c5 += 1) { variable
22 S_16(c1, i + c1 - 2, c5);
23 S_17(c1, i + c1 - 2, c5);
H A Dstride6.c3 …for (int c5 = max(max(0, -c1 - 1023), niter - c1 - c2 - 32); c5 <= min(min(31, -c1), niter - c1 - … variable
4 S_4(niter - 1, -c1 - c5);
/llvm-project-15.0.7/polly/test/ScheduleOptimizer/
H A Dpattern-matching-based-opts_5.ll56 ; CHECK-NEXT: for (int c5 = 0; c5 <= min(255, nk - 256 * c1 - 1); c5 += 1)…
96 ; CHECK-NEXT: for (int c5 = 0; c5 <= min(255, nk - 256 * c1 - 1); c5 += …
100 …EXT: Stmt_for_body6(96 * c2 + 4, 2048 * c0 + 8 * c3, 256 * c1 + c5);
118 …NEXT: Stmt_for_body6(ni - 1, 2048 * c0 + 8 * c3, 256 * c1 + c5);
131 ; CHECK-NEXT: for (int c5 = 0; c5 <= min(255, nk - 256 * c1 - 1); c5 += …
171 ; CHECK-NEXT: for (int c5 = 0; c5 <= min(255, nk - 256 * c1 - 1); c5 += 1)…
175 …HECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 2048 * c0, 256 * c1 + c5);
257 ; CHECK-NEXT: for (int c5 = 0; c5 <= min(255, nk - 256 * c1 - 1); c5 += 1)…
261 …HECK-NEXT: Stmt_for_body6(96 * c2, 2048 * c0 + 8 * c3, 256 * c1 + c5);
305 …K-NEXT: Stmt_for_body6(ni - 1, 2048 * c0 + 8 * c3, 256 * c1 + c5);
[all …]
H A Dpattern-matching-based-opts_7.ll38 ; CHECK-NEXT: for (int c5 = 0; c5 <= min(383, -384 * c1 + 1023); c5 += 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);
49 ; CHECK-NEXT: Stmt_for_body6(128 * c2 + 8 * c4, 8 * c3 + 7, 384 * c1 + c5);
50 ; CHECK-NEXT: Stmt_for_body6(128 * c2 + 8 * c4 + 1, 8 * c3, 384 * c1 + c5);
[all …]
H A Dpattern-matching-based-opts_13.ll28 ; CHECK-NEXT: for (int c5 = 0; c5 <= min(306, -307 * c1 + 1999); c5 += 1) {
66 ; CHECK-NEXT: for (int c5 = 0; c5 <= min(306, -307 * c1 + 1999); c5 += 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);
76 ; CHECK-NEXT: Stmt_for_body6(80 * c2 + 5 * c4 + 3, 1998, 307 * c1 + c5);
77 ; CHECK-NEXT: Stmt_for_body6(80 * c2 + 5 * c4 + 3, 1999, 307 * c1 + c5);
[all …]
H A Dpattern-matching-based-opts_6.ll55 ; CHECK-NEXT: for (int c5 = 0; c5 <= min(255, -256 * c1 + 1019); c5 += 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);
62 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 8 * c3 + 3, 256 * c1 + c5);
63 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 8 * c3 + 4, 256 * c1 + c5);
94 ; CHECK-NEXT: for (int c5 = 0; c5 <= min(255, -256 * c1 + 1019); c5 += 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.ll44 ; CHECK-NEXT: for (int c5 = 0; c5 <= min(255, -256 * c1 + 1022); c5 += 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);
55 ; CHECK-NEXT: Stmt_Copy_0(96 * c2 + 4 * c4, 8 * c3 + 7, 256 * c1 + c5);
56 ; CHECK-NEXT: Stmt_Copy_0(96 * c2 + 4 * c4 + 1, 8 * c3, 256 * c1 + c5);
[all …]
H A Dpattern-matching-based-opts_8.ll39 ; CHECK-NEXT: for (int c5 = 0; c5 <= 255; c5 += 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);
50 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 8 * c3 + 7, 256 * c1 + c5);
51 ; CHECK-NEXT: Stmt_for_body6(96 * c2 + 4 * c4 + 1, 8 * c3, 256 * c1 + c5);
[all …]
H A Dpattern-matching-based-opts_4.ll38 ; PATTERN-MATCHING-OPTS-NEXT: for (int c5 = 0; c5 <= 255; c5 += 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…
49 ; PATTERN-MATCHING-OPTS-NEXT: Stmt_for_body6(96 * c2 + 4 * c4, 256 * c1 + c5, 8 * c3…
50 ; PATTERN-MATCHING-OPTS-NEXT: Stmt_for_body6(96 * c2 + 4 * c4 + 1, 256 * c1 + c5, 8 …
[all …]
H A Dpattern-matching-based-opts_3.ll102 ; EXTRACTION-OF-MACRO-KERNEL-NEXT: for (int c5 = 0; c5 <= 255; c5 += 1) {
106 …ACTION-OF-MACRO-KERNEL-NEXT: Stmt_Copy_0(96 * c2 + 4 * c4, 8 * c3, 256 * c1 + c5);
107 …ON-OF-MACRO-KERNEL-NEXT: Stmt_Copy_0(96 * c2 + 4 * c4, 8 * c3 + 1, 256 * c1 + c5);
108 …ON-OF-MACRO-KERNEL-NEXT: Stmt_Copy_0(96 * c2 + 4 * c4, 8 * c3 + 2, 256 * c1 + c5);
109 …ON-OF-MACRO-KERNEL-NEXT: Stmt_Copy_0(96 * c2 + 4 * c4, 8 * c3 + 3, 256 * c1 + c5);
110 …ON-OF-MACRO-KERNEL-NEXT: Stmt_Copy_0(96 * c2 + 4 * c4, 8 * c3 + 4, 256 * c1 + c5);
111 …ON-OF-MACRO-KERNEL-NEXT: Stmt_Copy_0(96 * c2 + 4 * c4, 8 * c3 + 5, 256 * c1 + c5);
112 …ON-OF-MACRO-KERNEL-NEXT: Stmt_Copy_0(96 * c2 + 4 * c4, 8 * c3 + 6, 256 * c1 + c5);
113 …ON-OF-MACRO-KERNEL-NEXT: Stmt_Copy_0(96 * c2 + 4 * c4, 8 * c3 + 7, 256 * c1 + c5);
114 …ON-OF-MACRO-KERNEL-NEXT: Stmt_Copy_0(96 * c2 + 4 * c4 + 1, 8 * c3, 256 * c1 + c5);
[all …]
H A Drectangular-tiling.ll29 ; TWOLEVEL: for (int c5 = 0; c5 <= 7; c5 += 1)
30 ; TWOLEVEL: Stmt_for_body3(256 * c0 + 16 * c2 + c4, 16 * c1 + 8 * c3 + c5);
43 ; TWO-PLUS-REGISTER: for (int c5 = 0; c5 <= 3; c5 += 1)
46 …LUS-REGISTER: Stmt_for_body3(256 * c0 + 16 * c2 + 2 * c4, 16 * c1 + 8 * c3 + 2 * c5);
47 …REGISTER: Stmt_for_body3(256 * c0 + 16 * c2 + 2 * c4, 16 * c1 + 8 * c3 + 2 * c5 + 1);
48 …REGISTER: Stmt_for_body3(256 * c0 + 16 * c2 + 2 * c4 + 1, 16 * c1 + 8 * c3 + 2 * c5);
49 …STER: Stmt_for_body3(256 * c0 + 16 * c2 + 2 * c4 + 1, 16 * c1 + 8 * c3 + 2 * c5 + 1);
58 ; TWO-PLUS-REGISTER-PLUS-VECTORIZATION: for (int c5 = 0; c5 <= 1; c5 += 1) {
61 …IZATION: Stmt_for_body3(256 * c0 + 16 * c2 + 2 * c4, 16 * c1 + 8 * c3 + 4 * c5 + c8);
64 …ION: Stmt_for_body3(256 * c0 + 16 * c2 + 2 * c4 + 1, 16 * c1 + 8 * c3 + 4 * c5 + c8);
/llvm-project-15.0.7/polly/lib/External/isl/test_inputs/codegen/omega/
H A Dts1d-mp-i_ts-m_b-0.c14 …r (int c5 = max(0, -N - 500 * c1 + c4 + 2); c5 <= min(min(T - 500 * c1 - 1, -500 * c1 + c4 - 1), -… variable
15 s1(2, 500 * c1 + c5, 1, -500 * c1 + c4 - c5, 1);
21 …for (int c5 = max(0, -N - 500 * c1 + c4 + 2); c5 <= min(min(499, T - 500 * c1 - 1), -500 * c1 + c4… variable
22 s3(2, 500 * c1 + c5, 1, -500 * c1 + c4 - c5, 1);
28 …for (int c5 = max(-N - 500 * c1 + c4 + 2, -500 * c1 - 2000 * c3 + (c4 + 1) / 2); c5 <= min(min(499… variable
29 s5(2, 500 * c1 + c5, 1, -500 * c1 + c4 - c5, 1);
H A Dlefur04-0.c5 …c5 = max(max(max(max(0, 2 * c3 - 4), c1 - (-c1 + 3) / 3), c2 - (c2 + 3) / 3), c3 - (c3 + 3) / 3); … variable
6 …c5 - 501), 667 * c0 - 333 * c1 - (c0 + c1 + 3) / 3 - 332), 333 * c1 + c1 / 3), 333 * c2 + (c2 + 1)…
7 …ax(max(max(max(500 * c5 + 2, c6), 1000 * c0 - c6), 1000 * c3 - 2 * c6 + 2), 500 * c1 + (c6 + 1) / …
8 s0(c0, c1, c2, c3, c2 / 3, c5, c6, c7);
H A Dlefur03-0.c6 …c5 = max(max(max(c4, 1000 * c0 - c4), 1000 * c3 - 2 * c4 + 2), 500 * c1 + (c4 + 1) / 2); c5 <= min… variable
7 s0(c0, c1, c2, c3, c4, c5);
/llvm-project-15.0.7/clang/test/CodeGen/
H A Darm64-abi-vector.c86 __char5 c5 = va_arg(ap, __char5); in varargs_vec_5c() local
87 sum = sum + c5.x + c5.y; in varargs_vec_5c()
170 __short5 c5 = va_arg(ap, __short5); in varargs_vec_5s() local
171 sum = sum + c5.x + c5.y; in varargs_vec_5s()
213 __int5 c5 = va_arg(ap, __int5); in varargs_vec_5i() local
214 sum = sum + c5.x + c5.y; in varargs_vec_5i()
255 __char5 c5 = va_arg(ap, __char5); in varargs_vec() local
258 sum = sum + c5.x + c5.y; in varargs_vec()
330 sum = sum + c5.x + c5.y; in args_vec_5c()
392 sum = sum + c5.x + c5.y; in args_vec_5s()
[all …]
H A Darm-abi-vector.c118 __char5 c5 = va_arg(ap, __char5); in varargs_vec_5c() local
119 sum = sum + c5.x + c5.y; in varargs_vec_5c()
273 __short5 c5 = va_arg(ap, __short5); in varargs_vec_5s() local
274 sum = sum + c5.x + c5.y; in varargs_vec_5s()
/llvm-project-15.0.7/mlir/test/Integration/Dialect/Vector/CPU/
H A Dtest-create-mask-v4i1.mlir14 %c5 = arith.constant 5 : index
24 scf.for %i = %c0 to %c5 step %c1 {
46 scf.for %i = %c0 to %c5 step %c1 {
56 scf.for %i = %c0 to %c5 step %c1 {
66 scf.for %i = %c0 to %c5 step %c1 {
67 scf.for %j = %c0 to %c5 step %c1 {
/llvm-project-15.0.7/llvm/test/tools/llvm-objdump/ELF/ARM/
H A Dliteral-arm.s48 ldc p14, c5, foo
52 @ CHECK-NEXT: 2c: ldc p14, c5, [pc, #-52] @ 0x0 <foo>
59 ldc p14, c5, [r1, #8]
60 ldc p14, c5, [pc], {16}
61 @ CHECK-NEXT: 3c: ldc p14, c5, [r1, #8]{{$}}
62 @ CHECK-NEXT: 40: ldc p14, c5, [pc], {16}{{$}}
H A Dliteral-thumb2.s86 ldc p14, c5, foo
90 @ CHECK: 68: ldc p14, c5, [pc, #-108] @ 0x0 <foo>
97 ldc p14, c5, foo
101 @ CHECK: 7a: ldc p14, c5, [pc, #-124] @ 0x0 <foo>
108 ldc p14, c5, [r1, #8]
109 ldc p14, c5, [pc], {16}
110 @ CHECK: 8a: ldc p14, c5, [r1, #8]{{$}}
111 @ CHECK-NEXT: 8e: ldc p14, c5, [pc], {16}{{$}}
/llvm-project-15.0.7/libcxx/test/std/ranges/range.adaptors/range.counted/
H A Dcounted.pass.cpp81 auto c5 = std::views::counted(cit, 3); in test() local
90 ASSERT_SAME_TYPE(decltype(c5), std::span<const int>); in test()
99 assert(c5.data() == buffer && c5.size() == 3); in test()
113 auto c5 = std::views::counted(cit, 3); in test() local
122 ASSERT_SAME_TYPE(decltype(c5), std::ranges::subrange<random_access_iterator<const int*>>); in test()
131 assert(c5.begin() == cit && c5.end() == cit + 3); in test()
145 auto c5 = std::views::counted(cit, 3); in test() local
157 ASSERT_SAME_TYPE(decltype(c5), ConstExpected); in test()
166 assert(c5.begin().base() == cit && c5.size() == 3); in test()

12345678