Home
last modified time | relevance | path

Searched refs:in2 (Results 1 – 25 of 170) sorted by relevance

1234567

/llvm-project-15.0.7/pstl/test/std/algorithms/alg.nonmodifying/
H A Dmismatch.pass.cpp63 Sequence<T> in2(in); in test_mismatch_by_type() local
64 invoke_on_all_policies(test_mismatch(), in.begin(), in.end(), in2.begin(), in2.end()); in test_mismatch_by_type()
72 … invoke_on_all_policies(test_mismatch(), in.begin(), in.end(), in2.begin(), in2.end()); in test_mismatch_by_type()
86 invoke_on_all_policies(test_mismatch(), in2.begin(), in2.end(), in.begin(), in.end()); in test_mismatch_by_type()
89 invoke_on_all_policies(test_mismatch(), in2.begin(), in2.end(), in.begin()); in test_mismatch_by_type()
92 in2[idx] = val; in test_mismatch_by_type()
93 in2[idx + 1] = val; in test_mismatch_by_type()
94 … invoke_on_all_policies(test_mismatch(), in.cbegin(), in.cend(), in2.cbegin(), in2.cend()); in test_mismatch_by_type()
99 Sequence<T> in2({}); in test_mismatch_by_type() local
100 invoke_on_all_policies(test_mismatch(), in2.begin(), in2.end(), in.begin(), in.end()); in test_mismatch_by_type()
[all …]
H A Dfind_first_of.pass.cpp62 Sequence<T> in2(max_n2, [](std::size_t) { return T(0); }); in test() local
68 …ke_on_all_policies(test_one_policy(), in1.begin(), in1.begin() + n1, in2.data(), in2.data() + n2, … in test()
70 in2[n2 / 2] = T(1); in test()
71 …ke_on_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + n1, in2.data(), in2.data() + n2, in test()
76 in2[2 * n2 / 3] = T(1); in test()
77 … invoke_on_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + n1, in2.begin(), in test()
78 in2.begin() + n2, pred); in test()
79 in2[2 * n2 / 3] = T(0); in test()
81 in2[n2 / 2] = T(0); in test()
/llvm-project-15.0.7/libcxx/test/std/algorithms/
H A Dranges_robust_against_differing_projections.pass.cpp28 func(in1.begin(), in1.end(), in2.begin(), in2.end(), std::forward<Args>(args)...); in test()
29 func(in1, in2, std::forward<Args>(args)...); in test()
44 std::array in2 = {A{4}, A{5}, A{6}}; in test_all() local
57 test(std::ranges::equal, in, in2, eq, proj1, proj2); in test_all()
60 test(std::ranges::includes, in, in2, less, proj1, proj2); in test_all()
61 test(std::ranges::find_first_of, in, in2, eq, proj1, proj2); in test_all()
62 test(std::ranges::mismatch, in, in2, eq, proj1, proj2); in test_all()
63 test(std::ranges::search, in, in2, eq, proj1, proj2); in test_all()
64 test(std::ranges::find_end, in, in2, eq, proj1, proj2); in test_all()
68 test(std::ranges::merge, in, in2, out, less, proj1, proj2); in test_all()
[all …]
H A Dranges_robust_against_dangling.pass.cpp52 decltype(auto) result = func(in1, R(in2), std::forward<Args>(args)...); in dangling_2nd()
59 decltype(auto) result = func(R(in1), R(in2), std::forward<Args>(args)...); in dangling_both()
102 std::array in2 = {4, 5, 6}; in test_all() local
116 dangling_1st(std::ranges::find_first_of, in, in2); in test_all()
128 dangling_1st(std::ranges::search, in, in2); in test_all()
130 dangling_1st(std::ranges::find_end, in, in2); in test_all()
144 std::ranges::transform, in, in2, out_transform.begin(), binary_pred); in test_all()
146 std::ranges::transform, in, in2, out_transform.begin(), binary_pred); in test_all()
175 std::ranges::set_symmetric_difference, in, in2, out); in test_all()
177 std::ranges::set_symmetric_difference, in, in2, out); in test_all()
[all …]
H A Dranges_robust_against_nonbool_predicates.pass.cpp47 func(in1.begin(), in1.end(), in2.begin(), in2.end(), std::forward<Args>(args)...); in test()
48 func(in1, in2, std::forward<Args>(args)...); in test()
60 std::array in2 = {4, 5, 6}; in test_all() local
75 test(std::ranges::find_first_of, in, in2, binary_pred); in test_all()
77 test(std::ranges::mismatch, in, in2, binary_pred); in test_all()
78 test(std::ranges::equal, in, in2, binary_pred); in test_all()
103 test(std::ranges::search, in, in2, binary_pred); in test_all()
105 test(std::ranges::find_end, in, in2, binary_pred); in test_all()
109 test(std::ranges::includes, in, in2, binary_pred); in test_all()
113 test(std::ranges::is_permutation, in, in2, binary_pred); in test_all()
[all …]
H A Dranges_robust_against_proxy_iterators.pass.cpp58 ProxyRange in2{input2}; in run_tests() local
81 test(std::ranges::find_first_of, in, in2); in run_tests()
83 test(std::ranges::mismatch, in, in2); in run_tests()
84 test(std::ranges::equal, in, in2); in run_tests()
97 test(std::ranges::search, in, in2); in run_tests()
99 test(std::ranges::find_end, in, in2); in run_tests()
103 test(std::ranges::includes, in, in2); in run_tests()
106 test(std::ranges::is_permutation, in, in2); in run_tests()
133 test(std::ranges::swap_ranges, in, in2); in run_tests()
140 test(std::ranges::merge, in, in2, out); in run_tests()
[all …]
H A Dranges_robust_against_omitting_invoke.pass.cpp47 constexpr void test(Func&& func, Input& in1, Input& in2, Args&&... args) { in test() argument
48 func(in1.begin(), in1.end(), in2.begin(), in2.end(), std::forward<Args>(args)...); in test()
49 func(in1, in2, std::forward<Args>(args)...); in test()
61 std::array in2 = {Bar{Foo{4}}, Bar{Foo{5}}, Bar{Foo{6}}}; in test_all() local
81 test(std::ranges::find_first_of, in, in2, &Foo::binary_pred, &Bar::val, &Bar::val); in test_all()
83 test(std::ranges::mismatch, in, in2, &Foo::binary_pred, &Bar::val, &Bar::val); in test_all()
84 test(std::ranges::equal, in, in2, &Foo::binary_pred, &Bar::val, &Bar::val); in test_all()
110 test(std::ranges::search, in, in2, &Foo::binary_pred, &Bar::val, &Bar::val); in test_all()
112 test(std::ranges::find_end, in, in2, &Foo::binary_pred, &Bar::val, &Bar::val); in test_all()
116 test(std::ranges::includes, in, in2, &Foo::binary_pred, &Bar::val, &Bar::val); in test_all()
[all …]
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/
H A Dlexicographical_compare.pass.cpp62 …invoke_on_all_policies(test_one_policy(), in1.begin(), in1.begin() + max_n, in2.cbegin(), in2.cbeg… in test()
69 …invoke_on_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.begin(), in2.beg… in test()
76 …invoke_on_all_policies(test_one_policy(), in1.begin(), in1.begin() + n1, in2.begin(), in2.begin() … in test()
81 in2[ind] = T2(-1); in test()
82 …invoke_on_all_policies(test_one_policy(), in1.begin(), in1.begin() + n1, in2.begin(), in2.begin() … in test()
83 in2[ind] = T2(ind); in test()
100 std::string in2 = ""; in test_string() local
108 in2 += n1; in test_string()
117 …invoke_on_all_policies(test_one_policy(), in1.begin(), in1.begin() + n1, in2.begin(), in2.begin() … in test_string()
121 in2[n1 / 2] = 'a'; in test_string()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/
H A Dranges_includes.pass.cpp115 …n1{in1.data()}, Sent1{In1{in1.data() + in1.size()}}, In2{in2.data()}, Sent2{In2{in2.data() + in2.s… in testIncludesImpl()
122 std::ranges::subrange r2{In2{in2.data()}, Sent2{In2{in2.data() + in2.size()}}}; in testIncludesImpl()
140 std::array in2{0, 2, 8}; in testImpl() local
156 std::array in2{0, 1, 2}; in testImpl() local
164 std::array in2{8, 10}; in testImpl() local
172 std::array in2{0, 1, 1, 2, 5}; in testImpl() local
180 std::array in2{8, 12, 12}; in testImpl() local
188 std::array in2{8, 10, 10}; in testImpl() local
196 std::array in2{3, 4, 5}; in testImpl() local
204 std::array<int, 0> in2{}; in testImpl() local
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/
H A Dranges_set_symmetric_difference.pass.cpp117 In2{in2.data()}, in testSetSymmetricDifferenceImpl()
118 Sent2{In2{in2.data() + in2.size()}}, in testSetSymmetricDifferenceImpl()
123 assert(base(result.in2) == in2.data() + in2.size()); in testSetSymmetricDifferenceImpl()
131 std::ranges::subrange r2{In2{in2.data()}, Sent2{In2{in2.data() + in2.size()}}}; in testSetSymmetricDifferenceImpl()
137 assert(base(result.in2) == in2.data() + in2.size()); in testSetSymmetricDifferenceImpl()
155 std::array in2{0, 2, 8}; in testImpl() local
171 std::array in2{0, 1, 2}; in testImpl() local
179 std::array in2{8, 10}; in testImpl() local
211 std::array in2{3, 4, 5}; in testImpl() local
219 std::array<int, 0> in2{}; in testImpl() local
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.union/
H A Dranges_set_union.pass.cpp118 In2{in2.data()}, in testSetUnionImpl()
119 Sent2{In2{in2.data() + in2.size()}}, in testSetUnionImpl()
124 assert(base(result.in2) == in2.data() + in2.size()); in testSetUnionImpl()
132 std::ranges::subrange r2{In2{in2.data()}, Sent2{In2{in2.data() + in2.size()}}}; in testSetUnionImpl()
138 assert(base(result.in2) == in2.data() + in2.size()); in testSetUnionImpl()
155 std::array in2{0, 2, 8}; in testImpl() local
171 std::array in2{0, 1, 2}; in testImpl() local
179 std::array in2{8, 10}; in testImpl() local
211 std::array in2{3, 4, 5}; in testImpl() local
219 std::array<int, 0> in2{}; in testImpl() local
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/
H A Dranges_set_intersection.pass.cpp112 In2{in2.data()}, in testSetIntersectionImpl()
113 Sent2{In2{in2.data() + in2.size()}}, in testSetIntersectionImpl()
118 assert(base(result.in2) == in2.data() + in2.size()); in testSetIntersectionImpl()
126 std::ranges::subrange r2{In2{in2.data()}, Sent2{In2{in2.data() + in2.size()}}}; in testSetIntersectionImpl()
132 assert(base(result.in2) == in2.data() + in2.size()); in testSetIntersectionImpl()
150 std::array in2{0, 2, 8}; in testImpl() local
166 std::array in2{0, 1, 2}; in testImpl() local
174 std::array in2{8, 10}; in testImpl() local
206 std::array in2{3, 4, 5}; in testImpl() local
214 std::array<int, 0> in2{}; in testImpl() local
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/RISCV/rvv/
H A Dinline-asm.ll5 define <vscale x 1 x i1> @test_1xi1(<vscale x 1 x i1> %in, <vscale x 1 x i1> %in2) nounwind {
17 define <vscale x 2 x i1> @test_2xi1(<vscale x 2 x i1> %in, <vscale x 2 x i1> %in2) nounwind {
29 define <vscale x 4 x i1> @test_4xi1(<vscale x 4 x i1> %in, <vscale x 4 x i1> %in2) nounwind {
41 define <vscale x 8 x i1> @test_8xi1(<vscale x 8 x i1> %in, <vscale x 8 x i1> %in2) nounwind {
53 define <vscale x 16 x i1> @test_16xi1(<vscale x 16 x i1> %in, <vscale x 16 x i1> %in2) nounwind {
65 define <vscale x 32 x i1> @test_32xi1(<vscale x 32 x i1> %in, <vscale x 32 x i1> %in2) nounwind {
77 define <vscale x 64 x i1> @test_64xi1(<vscale x 64 x i1> %in, <vscale x 64 x i1> %in2) nounwind {
269 define <vscale x 1 x i8> @test_1xi8(<vscale x 1 x i8> %in, <vscale x 1 x i8> %in2) nounwind {
281 define <vscale x 2 x i8> @test_2xi8(<vscale x 2 x i8> %in, <vscale x 2 x i8> %in2) nounwind {
293 define <vscale x 4 x i8> @test_4xi8(<vscale x 4 x i8> %in, <vscale x 4 x i8> %in2) nounwind {
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/AArch64/GlobalISel/
H A Dselect-bitfield-insert.ll8 define i32 @bfi_w_31(i32 %in1, i32 %in2) {
16 %tmp4 = and i32 %in2, 2147483647
21 define i32 @bfi_w_8(i32 %in1, i32 %in2) {
29 %tmp4 = and i32 %in2, 255
42 %tmp4 = and i32 %in2, 1
68 %tmp4 = and i64 %in2, 2147483647
81 %tmp4 = and i64 %in2, 255
94 %tmp4 = and i64 %in2, 1
107 %tmp4 = and i64 %in2, 1
130 %tmp4 = and i64 %in2, 1
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/
H A Dranges_mismatch.pass.cpp125 assert(r.in2 == b + 3); in test()
136 assert(ret.in2 == b + 2); in test()
145 assert(ret.in2 == b + 2); in test()
188 assert(ret.in2 == b + 4); in test()
190 assert(*ret.in2 == 5); in test()
198 assert(ret.in2 == b + 4); in test()
200 assert(*ret.in2 == 5); in test()
215 assert(*ret.in2 == 1); in test()
226 assert(*ret.in2 == 1); in test()
238 assert(*ret.in2 == 1); in test()
[all …]
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.merge/
H A Dranges_merge.pass.cpp116 In2{in2.data()}, in testMergeImpl()
117 Sent2{In2{in2.data() + in2.size()}}, in testMergeImpl()
122 assert(base(result.in2) == in2.data() + in2.size()); in testMergeImpl()
130 std::ranges::subrange r2{In2{in2.data()}, Sent2{In2{in2.data() + in2.size()}}}; in testMergeImpl()
135 assert(base(result.in2) == in2.data() + in2.size()); in testMergeImpl()
153 std::array in2{0, 1, 2}; in testImpl() local
161 std::array in2{0, 1, 2}; in testImpl() local
169 std::array in2{0, 0, 1}; in testImpl() local
177 std::array in2{7, 7}; in testImpl() local
185 std::array in2{3, 4, 5}; in testImpl() local
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/
H A Dfcmp64.ll7 double addrspace(1)* %in2) {
9 %r1 = load double, double addrspace(1)* %in2
19 double addrspace(1)* %in2) {
21 %r1 = load double, double addrspace(1)* %in2
31 double addrspace(1)* %in2) {
33 %r1 = load double, double addrspace(1)* %in2
43 double addrspace(1)* %in2) {
45 %r1 = load double, double addrspace(1)* %in2
55 double addrspace(1)* %in2) {
57 %r1 = load double, double addrspace(1)* %in2
[all …]
H A Dfma.f64.ll16 %r1 = load double, double addrspace(1)* %in2
62 %r1 = load double, double addrspace(1)* %in2
75 %r1 = load double, double addrspace(1)* %in2
89 %r1 = load double, double addrspace(1)* %in2
102 %r1 = load double, double addrspace(1)* %in2
115 %r1 = load double, double addrspace(1)* %in2
129 %r1 = load double, double addrspace(1)* %in2
142 %r1 = load double, double addrspace(1)* %in2
156 %r1 = load double, double addrspace(1)* %in2
171 %r1 = load double, double addrspace(1)* %in2
[all …]
/llvm-project-15.0.7/clang/test/CodeGen/
H A Daarch64-sve-inline-asm-datatypes.c126 __SVBool_t func_bool_##KIND(__SVBool_t in1, __SVBool_t in2)\
133 [in2] "Upa" (in2)\
149 __SVBool_t func_bool_upl_##KIND(__SVBool_t in1, DT in2, DT in3)\
156 [in2] "w" (in2),\
172 DT func_float_##DT##KIND(DT inout1, DT in2)\
179 [in2] "w" (in2)\
200 __SVBool_t func_float_y_##KIND(DT in1, DT in2)\
207 [in2] "y" (in2)\
/llvm-project-15.0.7/llvm/test/Analysis/CostModel/AArch64/
H A Dsve-widening-instruction.ll5 define <vscale x 4 x i32> @widening(<vscale x 16 x i8> %in, <vscale x 4 x i16> %in2) {
9 …ound an estimated cost of {{[0-9]+}} for instruction: %in2.ext = zext <vscale x 4 x i16> %in2 to…
10 …n estimated cost of {{[0-9]+}} for instruction: %in.add = add <vscale x 4 x i32> %in.bc, %in2.ext
14 %in2.ext = zext <vscale x 4 x i16> %in2 to <vscale x 4 x i32>
15 %in.add = add <vscale x 4 x i32> %in.bc, %in2.ext
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.sorting/alg.set.operations/
H A Dincludes.pass.cpp82 Sequence<T2> in2(m, [](std::size_t k) { return rand() % (k + 1); }); in test_includes() local
85 std::sort(in2.begin(), in2.end(), compare); in test_includes()
87 …invoke_on_all_policies(test_one_policy(), in1.begin(), in1.end(), in2.cbegin(), in2.cend(), compar… in test_includes()
91 … invoke_on_all_policies(test_one_policy(), in1.begin(), in1.end(), in2.cbegin(), in2.cend(), in test_includes()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/
H A Dranges_set_difference.pass.cpp118 In2{in2.data()}, in testSetDifferenceImpl()
119 Sent2{In2{in2.data() + in2.size()}}, in testSetDifferenceImpl()
131 std::ranges::subrange r2{In2{in2.data()}, Sent2{In2{in2.data() + in2.size()}}}; in testSetDifferenceImpl()
154 std::array in2{0, 2, 8}; in testImpl() local
162 std::array in2{0, 2, 8, 15, 17, 19}; in testImpl() local
170 std::array in2{0, 1, 2}; in testImpl() local
178 std::array in2{8, 10}; in testImpl() local
186 std::array in2{0, 1, 1, 2, 5}; in testImpl() local
194 std::array in2{3, 4, 5}; in testImpl() local
202 std::array<int, 0> in2{}; in testImpl() local
[all …]
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.merge/
H A Dmerge.pass.cpp73 Sequence<T> in2(max_size / 2, generator2); in test_merge_by_type() local
74 Sequence<T> out(in1.size() + in2.size()); in test_merge_by_type()
76 std::sort(in2.begin(), in2.end()); in test_merge_by_type()
80 …invoke_on_all_policies(test_merge(), in1.cbegin(), in1.cbegin() + size, in2.data(), in2.data() + s… in test_merge_by_type()
82 …invoke_on_all_policies(test_merge(), in1.data(), in1.data() + size, in2.cbegin(), in2.cbegin() + s… in test_merge_by_type()
/llvm-project-15.0.7/llvm/test/Transforms/NewGVN/
H A D2016-08-30-MaskedScatterGather-xfail-inseltpoison.ll16 define spir_kernel void @test(<2 x i32*> %in1, <2 x i32*> %in2, i32* %out) {
23 ; Read from in1 and in2
25 …%in2.v = call <2 x i32> @llvm.masked.gather.v2i32.v2p0i32(<2 x i32*> %in2, i32 1, <2 x i1> <i1 tru…
31 ; Store in2 to the allocas
32 …call void @llvm.masked.scatter.v2i32.v2p0i32(<2 x i32> %in2.v, <2 x i32*> %tmp, i32 1, <2 x i1> <i…
33 ; Read in2 from the allocas
36 ; Store in2 to out for good measure
H A D2016-08-30-MaskedScatterGather-xfail.ll16 define spir_kernel void @test(<2 x i32*> %in1, <2 x i32*> %in2, i32* %out) {
23 ; Read from in1 and in2
25 …%in2.v = call <2 x i32> @llvm.masked.gather.v2i32.v2p0i32(<2 x i32*> %in2, i32 1, <2 x i1> <i1 tru…
31 ; Store in2 to the allocas
32 …call void @llvm.masked.scatter.v2i32.v2p0i32(<2 x i32> %in2.v, <2 x i32*> %tmp, i32 1, <2 x i1> <i…
33 ; Read in2 from the allocas
36 ; Store in2 to out for good measure

1234567