Home
last modified time | relevance | path

Searched refs:insert (Results 1 – 25 of 3504) sorted by relevance

12345678910>>...141

/llvm-project/llvm/test/CodeGen/AArch64/
H A Dls64-inline-asm.ll79 %s.sroa.10.0.insert.ext = zext i64 %conv20 to i512
80 %s.sroa.10.0.insert.shift = shl nuw i512 %s.sroa.10.0.insert.ext, 448
81 %s.sroa.9.0.insert.ext = zext i64 %conv17 to i512
82 %s.sroa.9.0.insert.shift = shl nuw nsw i512 %s.sroa.9.0.insert.ext, 384
83 %s.sroa.9.0.insert.insert = or i512 %s.sroa.10.0.insert.shift, %s.sroa.9.0.insert
[all...]
H A Dsve-insert-vector-to-predicate-load.ll10 …%insert = tail call <vscale x 2 x i8> @llvm.vector.insert.nxv2i8.v2i8(<vscale x 2 x i8> undef, <2 …
11 %ret = bitcast <vscale x 2 x i8> %insert to <vscale x 16 x i1>
20 …%insert = tail call <vscale x 2 x i8> @llvm.vector.insert.nxv2i8.v4i8(<vscale x 2 x i8> undef, <4 …
21 %ret = bitcast <vscale x 2 x i8> %insert to <vscale x 16 x i1>
30 …%insert = tail call <vscale x 2 x i8> @llvm.vector.insert.nxv2i8.v8i8(<vscale x 2 x i8> undef, <8 …
31 %ret = bitcast <vscale x 2 x i8> %insert to <vscale x 16 x i1>
48 …%insert = tail call <vscale x 2 x i8> @llvm.vector.insert.nxv2i8.v2i8(<vscale x 2 x i8> undef, <2 …
49 %ret = bitcast <vscale x 2 x i8> %insert to <vscale x 16 x i1>
56 ; CHECK: call <vscale x 2 x i8> @llvm.vector.insert
58 …%insert = tail call <vscale x 2 x i8> @llvm.vector.insert.nxv2i8.v4i8(<vscale x 2 x i8> undef, <4 …
[all …]
/llvm-project/llvm/unittests/ADT/
H A DPriorityWorklistTest.cpp33 EXPECT_TRUE(W.insert(21)); in TYPED_TEST()
34 EXPECT_TRUE(W.insert(42)); in TYPED_TEST()
35 EXPECT_TRUE(W.insert(17)); in TYPED_TEST()
54 EXPECT_TRUE(W.insert(21)); in TYPED_TEST()
55 EXPECT_TRUE(W.insert(42)); in TYPED_TEST()
56 EXPECT_TRUE(W.insert(12)); in TYPED_TEST()
57 EXPECT_TRUE(W.insert(17)); in TYPED_TEST()
68 EXPECT_FALSE(W.insert(42)); in TYPED_TEST()
78 ASSERT_TRUE(W.insert(2)); in TYPED_TEST()
79 ASSERT_TRUE(W.insert(4)); in TYPED_TEST()
[all …]
H A DSmallPtrSetTest.cpp30 (s2 = s1).insert(&buf[2]); in TEST()
33 (s2 = static_cast<SmallPtrSet<int *, 4> &>(s2)).insert(&buf[3]); in TEST()
43 // Assign and insert with initializer lists, and ones that contain both in TEST()
45 (s2 = {&buf[6], &buf[7], &buf[6]}).insert({&buf[5], &buf[4]}); in TEST()
62 s.insert(&buf[0]); in TEST()
63 s.insert(&buf[1]); in TEST()
64 s.insert(&buf[2]); in TEST()
65 s.insert(&buf[3]); in TEST()
75 s.insert(&buf[4]); in TEST()
76 s.insert( in TEST()
[all...]
H A DMapVectorTest.cpp48 R = MV1.insert(std::make_pair(1, 2)); in TEST()
73 R = MV.insert(std::make_pair(1, 2)); in TEST()
79 R = MV.insert(std::make_pair(1, 3)); in TEST()
85 R = MV.insert(std::make_pair(4, 5)); in TEST()
99 R = MV.insert(std::make_pair(4, 7)); in TEST()
194 MV.insert(std::make_pair(1, 2)); in TEST()
195 MV.insert(std::make_pair(3, 4)); in TEST()
196 MV.insert(std::make_pair(5, 6)); in TEST()
219 MV.insert(std::make_pair(1, 11)); in TEST()
220 MV.insert(std::make_pair(2, 12)); in TEST()
[all …]
H A DSmallSetTest.cpp77 auto InsertResult = s1.insert(i); in TEST()
83 auto InsertResult = s1.insert(i); in TEST()
112 S.insert(V1);
115 S.insert(std::move(V2)); in TEST()
122 S.insert(V1); in TEST()
125 S.insert(std::move(V2)); in TEST()
134 auto InsertResult = s1.insert(i); in TEST()
140 auto InsertResult = s1.insert(i); in TEST()
157 s1.insert(i); in TEST()
179 s1.insert( in TEST()
[all...]
H A DSparseMultiSetTest.cpp43 USet::iterator I = Set.insert(5); in TEST()
57 I = Set.insert(5); in TEST()
84 Set.insert(5); in TEST()
85 Set.insert(5); in TEST()
86 Set.insert(5); in TEST()
87 Set.insert(3); in TEST()
88 Set.insert(2); in TEST()
89 Set.insert(1); in TEST()
90 Set.insert(4); in TEST()
106 Set.insert(6); in TEST()
[all …]
/llvm-project/clang/unittests/Tooling/
H A DHeaderIncludesTest.cpp23 std::string insert(llvm::StringRef Code, llvm::StringRef Header, in insert() function in clang::tooling::__anon231119940111::HeaderIncludesTest
27 auto R = Includes.insert(Header.trim("\"<>"), Header.starts_with("<"), in insert()
54 EXPECT_EQ(Expected, insert(Code, "\"a.h\"")); in TEST_F()
63 EXPECT_EQ(Expected, insert(Code, "\"a2.h\"")); in TEST_F()
69 EXPECT_EQ(Expected, insert(Code, "\"a.h\"", IncludeDirective::Import)); in TEST_F()
74 EXPECT_EQ(Code, insert(Code, "\"a.h\"", IncludeDirective::Import)); in TEST_F()
98 EXPECT_EQ(Expected, insert(Code, "\"b.h\"")); in TEST_F()
122 EXPECT_EQ(Expected, insert(Code, "\"a.h\"")); in TEST_F()
135 EXPECT_EQ(Expected, insert(Code, "<a>")); in TEST_F()
138 EXPECT_EQ(Expected, insert(Code, "<a>")); in TEST_F()
[all …]
/llvm-project/libcxx/test/std/namespace/
H A Daddressable_functions.sh.cpp67 all_funcs.insert(std::make_pair("boolalpha", &std::boolalpha)); in get_formatflag_tu1()
68 all_funcs.insert(std::make_pair("noboolalpha", &std::noboolalpha)); in get_formatflag_tu1()
69 all_funcs.insert(std::make_pair("showbase", &std::showbase)); in get_formatflag_tu1()
70 all_funcs.insert(std::make_pair("noshowbase", &std::noshowbase)); in get_formatflag_tu1()
71 all_funcs.insert(std::make_pair("showpoint", &std::showpoint)); in get_formatflag_tu1()
72 all_funcs.insert(std::make_pair("noshowpoint", &std::noshowpoint)); in get_formatflag_tu1()
73 all_funcs.insert(std::make_pair("showpos", &std::showpos)); in get_formatflag_tu1()
74 all_funcs.insert(std::make_pair("noshowpos", &std::noshowpos)); in get_formatflag_tu1()
75 all_funcs.insert(std::make_pair("skipws", &std::skipws)); in get_formatflag_tu1()
76 all_funcs.insert(std::make_pair("noskipws", &std::noskipws)); in get_formatflag_tu1()
[all …]
/llvm-project/llvm/test/Transforms/SLPVectorizer/ARM/
H A Dsroa.ll52 %a.sroa.0.0.insert.ext = zext i32 %a.coerce.fca.0.extract to i64
54 %a.sroa.0.4.insert.ext = zext i32 %a.coerce.fca.1.extract to i64
55 %a.sroa.0.4.insert.shift = shl nuw i64 %a.sroa.0.4.insert.ext, 32
56 %a.sroa.0.4.insert.insert = or i64 %a.sroa.0.4.insert.shift, %a.sroa.0.0.insert.ext
57 %0 = bitcast i64 %a.sroa.0.4.insert.insert to double
59 %a.sroa.3.8.insert.ext = zext i32 %a.coerce.fca.2.extract to i64
61 %a.sroa.3.12.insert.ext = zext i32 %a.coerce.fca.3.extract to i64
62 %a.sroa.3.12.insert.shift = shl nuw i64 %a.sroa.3.12.insert.ext, 32
63 %a.sroa.3.12.insert.insert = or i64 %a.sroa.3.12.insert.shift, %a.sroa.3.8.insert.ext
64 %1 = bitcast i64 %a.sroa.3.12.insert.insert to double
[all …]
/llvm-project/llvm/test/CodeGen/AMDGPU/
H A Dbfi_nested.ll25 %shl.inner.insert = shl i32 %y.i32, 10
26 %bfi1.and = and i32 %shl.inner.insert, 1047552
29 %mul.outer.insert = fmul reassoc nnan nsz arcp contract afn float %x, 1.023000e+03
30 %mul.outer.insert.i32 = fptoui float %mul.outer.insert to i32
31 %shl.outer.insert = shl i32 %mul.outer.insert.i32, 20
32 %and.outer = and i32 %shl.outer.insert, 1072693248
59 %shl.inner.insert = shl i32 %y.i32, 10
60 %bfi1.and = and i32 1047552, %shl.inner.insert
[all...]
/llvm-project/libcxx/test/std/containers/associative/multimap/multimap.nonmember/
H A Dop_compare.pass.cpp46 m1.insert(value_type(1, "abc")); in main()
47 m2.insert(value_type(2, "abc")); in main()
53 m1.insert(value_type(1, "abc")); in main()
54 m2.insert(value_type(1, "abc")); in main()
60 m1.insert(value_type(1, "ab")); in main()
61 m2.insert(value_type(1, "abc")); in main()
67 m1.insert(value_type(1, "abc")); in main()
68 m2.insert(value_type(1, "bcd")); in main()
74 m1.insert(value_type(1, "abc")); in main()
75 m2.insert(value_type(1, "abc")); in main()
[all …]
/llvm-project/mlir/test/Integration/Dialect/Vector/CPU/
H A Dsparse-saxpy-jagged-matvec.mlir114 %0 = vector.insert %f3, %vf1[3] : f32 into vector<8xf32>
115 %1 = vector.insert %f5, %0[4] : f32 into vector<8xf32>
116 %2 = vector.insert %f3, %1[5] : f32 into vector<8xf32>
117 %3 = vector.insert %f4, %2[6] : f32 into vector<8xf32>
118 %4 = vector.insert %f3, %3[7] : f32 into vector<8xf32>
121 %5 = vector.insert %f2, %vf1[0] : f32 into vector<8xf32>
122 %6 = vector.insert %f8, %5[1] : f32 into vector<8xf32>
123 %7 = vector.insert %f2, %6[2] : f32 into vector<8xf32>
124 %8 = vector.insert %f2, %7[5] : f32 into vector<8xf32>
125 %9 = vector.insert
[all...]
H A Dsparse-dot-matvec.mlir120 %0 = vector.insert %f2, %vf1[1] : f32 into vector<4xf32>
123 %1 = vector.insert %f8, %vf1[1] : f32 into vector<4xf32>
124 %2 = vector.insert %f3, %1[2] : f32 into vector<4xf32>
127 %3 = vector.insert %f2, %vf1[1] : f32 into vector<4xf32>
128 %4 = vector.insert %f6, %3[2] : f32 into vector<4xf32>
129 %5 = vector.insert %f2, %4[3] : f32 into vector<4xf32>
132 %6 = vector.insert %f3, %vf1[0] : f32 into vector<4xf32>
135 %7 = vector.insert %f5, %vf1[0] : f32 into vector<4xf32>
138 %8 = vector.insert %f3, %vf1[0] : f32 into vector<4xf32>
139 %9 = vector.insert
[all...]
/llvm-project/llvm/test/Analysis/CostModel/RISCV/
H A Drvv-vectorinsert.ll7 …1 for instruction: %scalable_mf8 = call <vscale x 128 x i8> @llvm.vector.insert.nxv128i8.nxv1i8(<v…
8 …1 for instruction: %scalable_mf4 = call <vscale x 128 x i8> @llvm.vector.insert.nxv128i8.nxv2i8(<v…
9 …1 for instruction: %scalable_mf2 = call <vscale x 128 x i8> @llvm.vector.insert.nxv128i8.nxv4i8(<v…
10 … 1 for instruction: %scalable_m1 = call <vscale x 128 x i8> @llvm.vector.insert.nxv128i8.nxv8i8(<v…
11 … 1 for instruction: %scalable_m2 = call <vscale x 128 x i8> @llvm.vector.insert.nxv128i8.nxv16i8(<…
12 … 1 for instruction: %scalable_m4 = call <vscale x 128 x i8> @llvm.vector.insert.nxv128i8.nxv32i8(<…
13 … 1 for instruction: %scalable_m8 = call <vscale x 128 x i8> @llvm.vector.insert.nxv128i8.nxv64i8(<…
14 …f 16 for instruction: %fixed_mf8 = call <vscale x 128 x i8> @llvm.vector.insert.nxv128i8.v2i8(<vsc…
15 …f 16 for instruction: %fixed_mf4 = call <vscale x 128 x i8> @llvm.vector.insert.nxv128i8.v4i8(<vsc…
16 …f 16 for instruction: %fixed_mf2 = call <vscale x 128 x i8> @llvm.vector.insert.nxv128i8.v8i8(<vsc…
[all …]
/llvm-project/llvm/unittests/Support/
H A DAddressRangeTest.cpp81 Ranges.insert(AddressRange(0x1000, 0x2000)); in TEST()
82 Ranges.insert(AddressRange(0x2000, 0x3000)); in TEST()
83 Ranges.insert(AddressRange(0x4000, 0x5000)); in TEST()
111 Ranges.insert(AddressRange(0x1100, 0x1F00)); in TEST()
113 Ranges.insert(AddressRange(0x1500, 0x1F00)); in TEST()
118 Ranges.insert(AddressRange(0x1000, Ranges[0].start() + 1)); in TEST()
123 Ranges.insert(AddressRange(Ranges[0].end() - 1, 0x2000)); in TEST()
128 Ranges.insert(AddressRange(0x2000, 0x2fff)); in TEST()
133 Ranges.insert(AddressRange(0x3000, 0x4000)); in TEST()
140 Ranges.insert(AddressRange(Ranges[0].end() - 1, Ranges[1].start() + 1)); in TEST()
[all …]
/llvm-project/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/
H A Dinsert_rvalue.pass.cpp35 R r = c.insert(P(3.5, static_cast<short>(3))); in main()
40 r = c.insert(P(3.5, static_cast<short>(4))); in main()
45 r = c.insert(P(4.5, static_cast<short>(4))); in main()
50 r = c.insert(P(5.5, static_cast<short>(4))); in main()
60 R r = c.insert(P(3, 3)); in main()
65 r = c.insert(P(3, 4)); in main()
70 r = c.insert(P(4, 4)); in main()
75 r = c.insert(P(5, 4)); in main()
86 R r = c.insert(P(3.5, static_cast<short>(3))); in main()
91 r = c.insert(P(3.5, static_cast<short>(4))); in main()
[all …]
/llvm-project/clang/unittests/Analysis/FlowSensitive/
H A DMapLatticeTest.cpp59 EXPECT_THAT(Lattice.insert({Key1, BooleanLattice(false)}), Pair(_, true)); in TEST()
60 EXPECT_THAT(Lattice.insert({Key2, BooleanLattice(false)}), Pair(_, true)); in TEST()
63 EXPECT_THAT(Lattice.insert({Key1, BooleanLattice(false)}), Pair(_, false)); in TEST()
64 EXPECT_THAT(Lattice.insert({Key2, BooleanLattice(false)}), Pair(_, false)); in TEST()
72 Lattice1.insert({Key1, BooleanLattice(true)}); in TEST()
73 Lattice1.insert({Key2, BooleanLattice(false)}); in TEST()
83 Lattice1.insert({Key1, BooleanLattice(false)}); in TEST()
84 Lattice1.insert({Key2, BooleanLattice(false)}); in TEST()
87 Lattice2.insert({Key1, BooleanLattice(true)}); in TEST()
88 Lattice2.insert({Key2, BooleanLattice(true)}); in TEST()
[all …]
/llvm-project/libcxx/test/std/containers/unord/unord.multiset/
H A Dinsert_rvalue.pass.cpp31 R r = c.insert(P(3.5)); in main()
35 r = c.insert(P(3.5)); in main()
39 r = c.insert(P(4.5)); in main()
43 r = c.insert(P(5.5)); in main()
53 R r = c.insert(P(3)); in main()
57 r = c.insert(P(3)); in main()
61 r = c.insert(P(4)); in main()
65 r = c.insert(P(5)); in main()
75 R r = c.insert(P(3.5)); in main()
79 r = c.insert(P(3.5)); in main()
[all …]
H A Dinsert_hint_rvalue.pass.cpp32 R r = c.insert(e, P(3.5)); in main()
36 r = c.insert(r, P(3.5)); in main()
40 r = c.insert(c.end(), P(4.5)); in main()
44 r = c.insert(c.end(), P(5.5)); in main()
55 R r = c.insert(e, P(3)); in main()
59 r = c.insert(r, P(3)); in main()
63 r = c.insert(c.end(), P(4)); in main()
67 r = c.insert(c.end(), P(5)); in main()
78 R r = c.insert(e, P(3.5)); in main()
82 r = c.insert(r, P(3.5)); in main()
[all …]
/llvm-project/lldb/test/API/functionalities/data-formatter/data-formatter-stl/generic/set/
H A Dmain.cpp24 ii.insert(0); in main()
25 ii.insert(1); in main()
26 ii.insert(2); in main()
27 ii.insert(3); in main()
28 ii.insert(4); in main()
29 ii.insert(5); in main()
32 ii.insert(6); in main()
43 ss.insert("a"); in main()
44 ss.insert("a very long string is right here"); in main()
47 ss.insert("b"); in main()
[all …]
/llvm-project/lldb/test/API/functionalities/data-formatter/data-formatter-stl/generic/multiset/
H A Dmain.cpp24 ii.insert(0); in main()
25 ii.insert(1); in main()
26 ii.insert(2); in main()
27 ii.insert(3); in main()
28 ii.insert(4); in main()
29 ii.insert(5); in main()
32 ii.insert(6); in main()
43 ss.insert("a"); in main()
44 ss.insert("a very long string is right here"); in main()
47 ss.insert("b"); in main()
[all …]
/llvm-project/mlir/test/Integration/Dialect/Vector/CPU/X86Vector/
H A Dvp2intersect-i32.mlir18 %v1 = vector.insert %i2, %v0[1] : i32 into vector<16xi32>
19 %v2 = vector.insert %i3, %v1[4] : i32 into vector<16xi32>
20 %v3 = vector.insert %i4, %v2[6] : i32 into vector<16xi32>
21 %v4 = vector.insert %i5, %v3[7] : i32 into vector<16xi32>
22 %v5 = vector.insert %i0, %v4[10] : i32 into vector<16xi32>
23 %v6 = vector.insert %i0, %v5[12] : i32 into vector<16xi32>
24 %v7 = vector.insert %i3, %v6[13] : i32 into vector<16xi32>
25 %v8 = vector.insert %i3, %v7[14] : i32 into vector<16xi32>
26 %v9 = vector.insert %i0, %v8[15] : i32 into vector<16xi32>
31 %w1 = vector.insert %i2, %w0[4] : i32 into vector<16xi32>
[all …]
/llvm-project/llvm/test/CodeGen/X86/
H A Dshift_minsize.ll118 %x.sroa.2.0.insert.ext = zext i64 %x.coerce1 to i128
119 %x.sroa.2.0.insert.shift = shl nuw i128 %x.sroa.2.0.insert.ext, 64
120 %x.sroa.0.0.insert.ext = zext i64 %x.coerce0 to i128
121 %x.sroa.0.0.insert.insert = or i128 %x.sroa.2.0.insert.shift, %x.sroa.0.0.insert.ext
124 %shl = shl i128 %x.sroa.0.0.insert.insert, %sh_prom
128 %.fca.0.insert = insertvalue { i64, i64 } undef, i64 %retval.sroa.0.0.extract.trunc, 0
129 %.fca.1.insert = insertvalue { i64, i64 } %.fca.0.insert, i64 %retval.sroa.2.0.extract.trunc, 1
130 ret { i64, i64 } %.fca.1.insert
157 %x.sroa.2.0.insert.ext = zext i64 %x.coerce1 to i128
158 %x.sroa.2.0.insert.shift = shl nuw i128 %x.sroa.2.0.insert.ext, 64
[all …]
/llvm-project/libcxx/test/std/containers/unord/unord.set/
H A Dinsert_hint_rvalue.pass.cpp32 R r = c.insert(e, P(3.5)); in main()
36 r = c.insert(r, P(3.5)); in main()
40 r = c.insert(c.end(), P(4.5)); in main()
44 r = c.insert(c.end(), P(5.5)); in main()
55 R r = c.insert(e, P(3)); in main()
59 r = c.insert(r, P(3)); in main()
63 r = c.insert(c.end(), P(4)); in main()
67 r = c.insert(c.end(), P(5)); in main()
78 R r = c.insert(e, P(3.5)); in main()
82 r = c.insert(r, P(3.5)); in main()
[all …]

12345678910>>...141