Home
last modified time | relevance | path

Searched refs:i3 (Results 1 – 25 of 603) sorted by relevance

12345678910>>...25

/llvm-project-15.0.7/llvm/test/Transforms/InstSimplify/ConstProp/
H A Dsmul-fix.ll47 <8 x i3> <i3 -4, i3 -3, i3 -2, i3 -1, i3 0, i3 1, i3 2, i3 3>,
48 <8 x i3> <i3 -4, i3 -4, i3 -4, i3 -4, i3 -4, i3 -4, i3 -4, i3 -4>,
58 <8 x i3> <i3 -4, i3 -3, i3 -2, i3 -1, i3 0, i3 1, i3 2, i3 3>,
59 <8 x i3> <i3 -4, i3 -4, i3 -4, i3 -4, i3 -4, i3 -4, i3 -4, i3 -4>,
69 <8 x i3> <i3 -4, i3 -3, i3 -2, i3 -1, i3 0, i3 1, i3 2, i3 3>,
70 <8 x i3> <i3 -4, i3 -4, i3 -4, i3 -4, i3 -4, i3 -4, i3 -4, i3 -4>,
80 <8 x i3> <i3 -4, i3 -3, i3 -2, i3 -1, i3 0, i3 1, i3 2, i3 3>,
91 <8 x i3> <i3 -4, i3 -3, i3 -2, i3 -1, i3 0, i3 1, i3 2, i3 3>,
114 <8 x i3> <i3 3, i3 3, i3 3, i3 3, i3 3, i3 3, i3 3, i3 3>,
125 <8 x i3> <i3 3, i3 3, i3 3, i3 3, i3 3, i3 3, i3 3, i3 3>,
[all …]
H A Dsmul-fix-sat.ll46 <8 x i3> <i3 -4, i3 -3, i3 -2, i3 -1, i3 0, i3 1, i3 2, i3 3>,
47 <8 x i3> <i3 -4, i3 -4, i3 -4, i3 -4, i3 -4, i3 -4, i3 -4, i3 -4>,
57 <8 x i3> <i3 -4, i3 -3, i3 -2, i3 -1, i3 0, i3 1, i3 2, i3 3>,
58 <8 x i3> <i3 -4, i3 -4, i3 -4, i3 -4, i3 -4, i3 -4, i3 -4, i3 -4>,
68 <8 x i3> <i3 -4, i3 -3, i3 -2, i3 -1, i3 0, i3 1, i3 2, i3 3>,
69 <8 x i3> <i3 -4, i3 -4, i3 -4, i3 -4, i3 -4, i3 -4, i3 -4, i3 -4>,
79 <8 x i3> <i3 -4, i3 -3, i3 -2, i3 -1, i3 0, i3 1, i3 2, i3 3>,
90 <8 x i3> <i3 -4, i3 -3, i3 -2, i3 -1, i3 0, i3 1, i3 2, i3 3>,
113 <8 x i3> <i3 3, i3 3, i3 3, i3 3, i3 3, i3 3, i3 3, i3 3>,
124 <8 x i3> <i3 3, i3 3, i3 3, i3 3, i3 3, i3 3, i3 3, i3 3>,
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/LoopUnroll/
H A Druntime-loop5.ll11 define i3 @test(i3* %a, i3 %n) {
19 ; UNROLL-16-NEXT: [[TMP0:%.*]] = load i3, i3* [[A:%.*]], align 1
24 ; UNROLL-16-NEXT: [[TMP1:%.*]] = load i3, i3* [[ARRAYIDX_1]], align 1
30 ; UNROLL-16-NEXT: [[TMP2:%.*]] = load i3, i3* [[ARRAYIDX_2]], align 1
36 ; UNROLL-16-NEXT: [[TMP3:%.*]] = load i3, i3* [[ARRAYIDX_3]], align 1
42 ; UNROLL-16-NEXT: [[TMP4:%.*]] = load i3, i3* [[ARRAYIDX_4]], align 1
48 ; UNROLL-16-NEXT: [[TMP5:%.*]] = load i3, i3* [[ARRAYIDX_5]], align 1
54 ; UNROLL-16-NEXT: [[TMP6:%.*]] = load i3, i3* [[ARRAYIDX_6]], align 1
81 ; UNROLL-4-NEXT: [[TMP2:%.*]] = load i3, i3* [[ARRAYIDX]], align 1
145 %arrayidx = getelementptr inbounds i3, i3* %a, i64 %indvars.iv
[all …]
H A Druntime-loop-branchweight.ll13 define i3 @test(i3* %a, i3 %n) {
15 %cmp1 = icmp eq i3 %n, 0
20 %sum.02 = phi i3 [ %add, %for.body ], [ 0, %entry ]
21 %arrayidx = getelementptr inbounds i3, i3* %a, i64 %indvars.iv
22 %0 = load i3, i3* %arrayidx
23 %add = add nsw i3 %0, %sum.02
25 %lftr.wideiv = trunc i64 %indvars.iv.next to i3
26 %exitcond = icmp eq i3 %lftr.wideiv, %n
30 %sum.0.lcssa = phi i3 [ 0, %entry ], [ %add, %for.body ]
31 ret i3 %sum.0.lcssa
/llvm-project-15.0.7/clang/test/Analysis/
H A Dstl-algorithm-modeling-aggressive-std-find-modeling.cpp24 if (i3 != i2) { in test_find1()
45 if (i3 != i2) { in test_find2()
68 if (i3 != i2) { in test_find_if1()
89 if (i3 != i2) { in test_find_if2()
110 if (i3 != i2) { in test_find_if_not1()
132 if (i3 != i2) { in test_find_if_not2()
343 if (i3 != i2) { in test_lower_bound1()
364 if (i3 != i2) { in test_lower_bound2()
385 if (i3 != i2) { in test_upper_bound1()
406 if (i3 != i2) { in test_upper_bound2()
[all …]
H A Dstl-algorithm-modeling.cpp19 const auto i3 = std::find(i1, i2, n); in test_find1() local
59 const auto i3 = std::find_if(i1, i2, odd); in test_find_if1() local
97 const auto i3 = std::find_if_not(i1, i2, odd); in test_find_if_not1() local
135 const auto i3 = return_any_iterator(V2.begin()); in test_find_first_of1() local
224 const auto i5 = std::find_end(i1, i2, i3, i4); in test_find_end1()
246 i1, i2, i3, i4); in test_find_end2()
310 const auto i3 = std::lower_bound(i1, i2, n); in test_lower_bound1() local
348 const auto i3 = std::upper_bound(i1, i2, n); in test_upper_bound1() local
388 const auto i5 = std::search(i1, i2, i3, i4); in test_search1()
410 i1, i2, i3, i4); in test_search2()
[all …]
/llvm-project-15.0.7/libcxx/test/std/iterators/stream.iterators/istreambuf.iterator/istreambuf.iterator_op==/
H A Dequal.pass.cpp37 assert(!(i1 == i3)); in main()
43 assert(!(i2 == i3)); in main()
47 assert(!(i3 == i1)); in main()
48 assert(!(i3 == i2)); in main()
49 assert( (i3 == i3)); in main()
50 assert( (i3 == i4)); in main()
51 assert( (i3 == i5)); in main()
55 assert( (i4 == i3)); in main()
61 assert( (i5 == i3)); in main()
97 assert(!(i1 == i3)); in main()
[all …]
/llvm-project-15.0.7/libcxx/test/std/iterators/stream.iterators/istreambuf.iterator/istreambuf.iterator_op!=/
H A Dnot_equal.pass.cpp35 assert( (i1 != i3)); in main()
41 assert( (i2 != i3)); in main()
45 assert( (i3 != i1)); in main()
46 assert( (i3 != i2)); in main()
47 assert(!(i3 != i3)); in main()
48 assert(!(i3 != i4)); in main()
49 assert(!(i3 != i5)); in main()
53 assert(!(i4 != i3)); in main()
59 assert(!(i5 != i3)); in main()
95 assert( (i1 != i3)); in main()
[all …]
/llvm-project-15.0.7/polly/lib/External/isl/test_inputs/codegen/cloog/
H A Dclassen.st5 …i3, i4, i5, i6, i7] -> [(1 + i0)]; S4[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i0)]; S8[i0, i1] -> [(i…
9 …i3, i4, i5, i6, i7]; S6[i0, i1, i2, i3, i4, i5, i6, i7]; S4[i0, i1, i2, i3, i4, i5, i6, i7]; S1[i0…
11 …i3, i4, i5, i6, i7] -> [(i3)]; S4[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i1)]; S3[i0, i1, i2, i3, i4…
15 …- filter: "[m] -> { S6[i0, i1, i2, i3, i4, i5, i6, i7]; S5[i0, i1, i2, i3, i4, i5, i6, i7]; S7[i0,…
17 …i3, i4, i5, i6, i7] -> [(i4)]; S5[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i4)]; S6[i0, i1, i2, i3, i4…
19 - filter: "[m] -> { S1[i0, i1, i2, i3] }"
20 …- filter: "[m] -> { S2[i0, i1, i2, i3, i4, i5, i6, i7]; S4[i0, i1, i2, i3, i4, i5, i6, i7]; S3[i0,…
22 …i3, i4, i5, i6, i7] -> [(i4)]; S3[i0, i1, i2, i3, i4, i5, i6, i7] -> [(i4)]; S2[i0, i1, i2, i3, i4…
H A Dvasilache.st1 …i3] : i0 >= 0 and i0 <= -1 + N and i1 >= 0 and i1 <= -1 + N and i3 >= 0 and i3 <= -1 + N and i3 >=…
20 - filter: "[M, N] -> { S7[i0, i1, i2, i3]; S6[i0, i1, i2, i3] }"
22 schedule: "[M, N] -> [{ S7[i0, i1, i2, i3] -> [(i0)]; S6[i0, i1, i2, i3] -> [(i0)] }]"
25 schedule: "[M, N] -> [{ S7[i0, i1, i2, i3] -> [(i1)]; S6[i0, i1, i2, i3] -> [(i1)] }]"
28 schedule: "[M, N] -> [{ S7[i0, i1, i2, i3] -> [(i2)]; S6[i0, i1, i2, i3] -> [(i2)] }]"
31 … schedule: "[M, N] -> [{ S7[i0, i1, i2, i3] -> [(i3)]; S6[i0, i1, i2, i3] -> [(1 + i3)] }]"
35 - filter: "[M, N] -> { S6[i0, i1, i2, i3] }"
36 - filter: "[M, N] -> { S7[i0, i1, i2, i3] }"
H A Dlux.st1 domain: "[M] -> { S1[i0, i0, M, i3] : i0 >= 1 and i0 <= M and i3 >= 1 + i0 and i3 <= M; S2[i0, i1, …
5 …i3] -> [(i0)]; S2[i0, i1, i2, i3, i4] -> [(i0)] }, { S1[i0, i1, i2, i3] -> [(i1)]; S2[i0, i1, i2, …
9 - filter: "[M] -> { S1[i0, i1, i2, i3] }"
10 - filter: "[M] -> { S2[i0, i1, i2, i3, i4] }"
H A Dlu2.st1 …1 <= n and i2 <= -1 + i0 and i0 <= n; S1[i0, n, i0, i3] : i0 >= 1 and i0 <= n and i3 >= 1 + i0 and…
5 …i3, i4] -> [(i0)]; S1[i0, i1, i2, i3] -> [(i0)] }, { S2[i0, i1, i2, i3, i4] -> [(i1)]; S1[i0, i1, …
9 - filter: "[n] -> { S1[i0, i1, i2, i3] }"
10 - filter: "[n] -> { S2[i0, i1, i2, i3, i4] }"
H A Dequality2.st5 …i3, i4, i5, i6, i7, i8, i9, i10] -> [(i0)]; S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i…
9 - filter: "{ S1[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10] }"
10 - filter: "{ S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14] }"
H A Dsor1d.st1 …N >= 5 - 2M and M >= 1; S1[i0, i1, i2, i3] : i3 >= 4 + 100i0 - 2i2 and i3 >= 2 and i3 <= 103 + 100…
5 …chedule: "[M, N] -> [{ S2[i0, i1, i2, i3, i4] -> [(i0 + i1)]; S1[i0, i1, i2, i3] -> [(i0 + i1)]; S…
9 - filter: "[M, N] -> { S2[i0, i1, i2, i3, i4]; S3[i0, i1, i2, i3, i4]; S1[i0, i1, i2, i3] }"
11 …i3, i4] -> [(i1)]; S1[i0, i1, i2, i3] -> [(i1)]; S3[i0, i1, i2, i3, i4] -> [(i2)] }, { S2[i0, i1, …
15 - filter: "[M, N] -> { S3[i0, i1, i2, i3, i4] }"
17 … schedule: "[M, N] -> [{ S3[i0, i1, i2, i3, i4] -> [(i1)] }, { S3[i0, i1, i2, i3, i4] -> [(i4)] }]"
19 - filter: "[M, N] -> { S1[i0, i1, i2, i3] }"
20 - filter: "[M, N] -> { S2[i0, i1, i2, i3, i4] }"
22 … schedule: "[M, N] -> [{ S2[i0, i1, i2, i3, i4] -> [(i2)] }, { S2[i0, i1, i2, i3, i4] -> [(i4)] }]"
H A Dpouchet.st5 …i3, i4] -> [(i0 + i1)]; S2[i0, i1, i2, i3, i4] -> [(i0 + i1)] }, { S1[i0, i1, i2, i3, i4] -> [(i1)…
H A Dreservoir-tang-xue1.st1 …S1[i0, i1, i2, i3] : i3 <= 4 - 2i0 - 2i1 and i3 >= i2 and i2 <= 9 - 2i0 and i2 >= 0 and i2 >= 1 - …
5 schedule: "[{ S1[i0, i1, i2, i3] -> [(2i0)] }]"
8 schedule: "[{ S1[i0, i1, i2, i3] -> [(2i0 + 2i1)] }]"
11 schedule: "[{ S1[i0, i1, i2, i3] -> [(2i0 + i2)] }]"
14 schedule: "[{ S1[i0, i1, i2, i3] -> [(2i0 + 2i1 + i3)] }]"
/llvm-project-15.0.7/polly/lib/External/isl/test_inputs/schedule/
H A Dniewang.st1 …i3, i4, i5, i6] : 0 <= i0 <= 223 and 0 <= i1 <= 223 and 0 <= i2 <= 15 and 0 <= i3 <= 3 and 0 <= i4…
4 - filter: "{ group0[i0, i1, i2, i3] }"
6 …0[i0, i1, i2, i3] -> [(i0)] }, { group0[i0, i1, i2, i3] -> [(i1)] }, { group0[i0, i1, i2, i3] -> […
9 - filter: "{ S_3[i0, i1, i2, i3, i4, i5, i6] }"
11 …i3, i4, i5, i6] -> [(i0)] }, { S_3[i0, i1, i2, i3, i4, i5, i6] -> [(i1)] }, { S_3[i0, i1, i2, i3, …
15 schedule: "[{ S_3[i0, i1, i2, i3, i4, i5, i6] -> [(i4)] }]"
19 schedule: "[{ S_3[i0, i1, i2, i3, i4, i5, i6] -> [(i5)] }]"
23 schedule: "[{ S_3[i0, i1, i2, i3, i4, i5, i6] -> [(i6)] }]"
/llvm-project-15.0.7/libcxx/test/std/re/re.iter/re.tokiter/re.tokiter.incr/
H A Dpost.pass.cpp34 i3 = i++; in main()
41 i3 = i++; in main()
47 assert(i3->str() == ", "); in main()
48 i3 = i++; in main()
54 assert(i3->str() == ", "); in main()
55 i3 = i++; in main()
73 i3 = i; in main()
81 i3 = i; in main()
88 assert(i3->str() == ", "); in main()
89 i3 = i; in main()
[all …]
/llvm-project-15.0.7/libcxx/test/std/iterators/stream.iterators/istreambuf.iterator/istreambuf.iterator_equal/
H A Dequal.pass.cpp34 assert(!i1.equal(i3)); in main()
40 assert(!i2.equal(i3)); in main()
44 assert(!i3.equal(i1)); in main()
45 assert(!i3.equal(i2)); in main()
46 assert( i3.equal(i3)); in main()
47 assert( i3.equal(i4)); in main()
48 assert( i3.equal(i5)); in main()
52 assert( i4.equal(i3)); in main()
58 assert( i5.equal(i3)); in main()
74 assert(!i1.equal(i3)); in main()
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/SimplifyCFG/X86/
H A DCoveredLookupTable.ll9 define i3 @coveredswitch_test(i3 %input) {
12 ; CHECK-NEXT: [[SWITCH_TABLEIDX:%.*]] = sub i3 [[INPUT:%.*]], -4
17 ; CHECK-NEXT: ret i3 [[SWITCH_MASKED]]
20 switch i3 %input, label %bb8 [
21 i3 0, label %bb7
22 i3 1, label %bb
23 i3 2, label %bb3
24 i3 3, label %bb4
25 i3 4, label %bb5
26 i3 5, label %bb6
[all …]
/llvm-project-15.0.7/libcxx/test/std/iterators/stream.iterators/istream.iterator/istream.iterator.ops/
H A Dequal.pass.cpp35 std::istream_iterator<int> i3(inf2); in main() local
40 assert(i1 != i3); in main()
45 assert(i2 != i3); in main()
49 assert(i3 == i3); in main()
50 assert(i3 != i4); in main()
51 assert(i3 != i5); in main()
58 assert(std::operator!=(i1, i3)); in main()
78 std::istream_iterator<int> i3(stream); in main() local
80 assert(!(i3 == std::default_sentinel)); in main()
82 assert(i3 != std::default_sentinel); in main()
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/InstSimplify/
H A Dbitreverse-fold.ll90 ; CHECK-NEXT: ret i3 1
91 define i3 @reverse_100_i3() {
92 %x = call i3 @llvm.bitreverse.i3(i3 100)
93 ret i3 %x
97 ; CHECK-NEXT: ret <2 x i3> <i3 3, i3 -2>
98 define <2 x i3> @reverse_6_3_v2i3() {
99 %x = call <2 x i3> @llvm.bitreverse.v2i3(<2 x i3> <i3 6, i3 3>)
100 ret <2 x i3> %x
106 declare i3 @llvm.bitreverse.i3(i3) readnone
107 declare <2 x i3> @llvm.bitreverse.v2i3(<2 x i3>) readnone
/llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/
H A Damdgpu-codegenprepare-i16-to-i32.ll5 define amdgpu_kernel void @add_i3(i3 %a, i3 %b) {
20 store volatile i3 %r, i3 addrspace(1)* undef
461 %sel = select i1 %cmp, i3 %a, i3 %b
485 %sel = select i1 %cmp, i3 %a, i3 %b
509 %sel = select i1 %cmp, i3 %a, i3 %b
533 %sel = select i1 %cmp, i3 %a, i3 %b
557 %sel = select i1 %cmp, i3 %a, i3 %b
581 %sel = select i1 %cmp, i3 %a, i3 %b
682 declare i3 @llvm.bitreverse.i3(i3)
685 ; SI-NEXT: [[BREV:%.*]] = call i3 @llvm.bitreverse.i3(i3 [[A:%.*]])
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/InstCombine/
H A Dicmp-vec-inseltpoison.ll99 ; CHECK-NEXT: [[CMP:%.*]] = icmp sgt <3 x i3> [[X:%.*]], <i3 -4, i3 2, i3 -1>
102 %cmp = icmp sge <3 x i3> %x, <i3 -3, i3 -5, i3 0>
108 ; CHECK-NEXT: [[CMP:%.*]] = icmp ugt <3 x i3> [[X:%.*]], <i3 -2, i3 0, i3 1>
111 %cmp = icmp uge <3 x i3> %x, <i3 -1, i3 1, i3 2>
117 ; CHECK-NEXT: [[CMP:%.*]] = icmp slt <3 x i3> [[X:%.*]], <i3 3, i3 -3, i3 1>
120 %cmp = icmp sle <3 x i3> %x, <i3 2, i3 4, i3 0>
129 %cmp = icmp ule <3 x i3> %x, <i3 6, i3 0, i3 1>
140 %cmp = icmp sge <2 x i3> %x, <i3 -4, i3 1>
149 %cmp = icmp uge <2 x i3> %x, <i3 1, i3 0>
158 %cmp = icmp sle <2 x i3> %x, <i3 1, i3 3>
[all …]
H A Dicmp-vec.ll101 ; CHECK-NEXT: [[CMP:%.*]] = icmp sgt <3 x i3> [[X:%.*]], <i3 -4, i3 2, i3 -1>
104 %cmp = icmp sge <3 x i3> %x, <i3 -3, i3 -5, i3 0>
110 ; CHECK-NEXT: [[CMP:%.*]] = icmp ugt <3 x i3> [[X:%.*]], <i3 -2, i3 0, i3 1>
113 %cmp = icmp uge <3 x i3> %x, <i3 -1, i3 1, i3 2>
119 ; CHECK-NEXT: [[CMP:%.*]] = icmp slt <3 x i3> [[X:%.*]], <i3 3, i3 -3, i3 1>
122 %cmp = icmp sle <3 x i3> %x, <i3 2, i3 4, i3 0>
131 %cmp = icmp ule <3 x i3> %x, <i3 6, i3 0, i3 1>
142 %cmp = icmp sge <2 x i3> %x, <i3 -4, i3 1>
151 %cmp = icmp uge <2 x i3> %x, <i3 1, i3 0>
160 %cmp = icmp sle <2 x i3> %x, <i3 1, i3 3>
[all …]

12345678910>>...25