Home
last modified time | relevance | path

Searched refs:S2 (Results 1 – 25 of 948) sorted by relevance

12345678910>>...38

/llvm-project-15.0.7/llvm/unittests/ADT/
H A DImmutableSetTest.cpp56 EXPECT_FALSE(S2.isEmpty()); in TEST_F()
57 EXPECT_FALSE(S == S2); in TEST_F()
58 EXPECT_TRUE(S != S2); in TEST_F()
61 EXPECT_FALSE(S2.begin() == S2.end()); in TEST_F()
62 EXPECT_TRUE(S2.begin() != S2.end()); in TEST_F()
72 EXPECT_FALSE(S2 == S3); in TEST_F()
73 EXPECT_TRUE(S2 != S3); in TEST_F()
87 EXPECT_FALSE(S2.isEmpty()); in TEST_F()
128 EXPECT_TRUE(S2 == S4); in TEST_F()
129 EXPECT_TRUE(S3 != S2); in TEST_F()
[all …]
H A DStatisticTest.cpp30 S2 = S; in extractCounters()
92 OptionalStatistic S2; in TEST() local
93 extractCounters(Range1, S1, S2); in TEST()
108 OptionalStatistic S2; in TEST() local
109 extractCounters(Range, S1, S2); in TEST()
118 EXPECT_EQ(S2->second, 1u); in TEST()
136 OptionalStatistic S2; in TEST() local
137 extractCounters(Range, S1, S2); in TEST()
153 OptionalStatistic S2; in TEST() local
154 extractCounters(Range, S1, S2); in TEST()
[all …]
H A DImmutableMapTest.cpp36 EXPECT_FALSE(S2.isEmpty()); in TEST()
41 EXPECT_EQ(10, *S2.lookup(3)); in TEST()
42 EXPECT_EQ(11, *S2.lookup(4)); in TEST()
43 EXPECT_EQ(12, *S2.lookup(5)); in TEST()
45 EXPECT_EQ(5, S2.getMaxElement()->first); in TEST()
46 EXPECT_EQ(3U, S2.getHeight()); in TEST()
71 EXPECT_FALSE(S2.isEmpty()); in TEST()
76 EXPECT_EQ(10, *S2.lookup(3)); in TEST()
77 EXPECT_EQ(11, *S2.lookup(4)); in TEST()
78 EXPECT_EQ(12, *S2.lookup(5)); in TEST()
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/Hexagon/intrinsics/
H A Dxtype_perm.ll52 declare i32 @llvm.hexagon.S2.vrndpackwh(i64)
67 declare i32 @llvm.hexagon.S2.vsathub(i64)
74 declare i32 @llvm.hexagon.S2.vsatwh(i64)
81 declare i32 @llvm.hexagon.S2.vsatwuh(i64)
88 declare i32 @llvm.hexagon.S2.vsathb(i64)
95 declare i32 @llvm.hexagon.S2.svsathb(i32)
102 declare i32 @llvm.hexagon.S2.svsathub(i32)
199 declare i64 @llvm.hexagon.S2.vsxtbh(i32)
206 declare i64 @llvm.hexagon.S2.vsxthw(i32)
243 declare i64 @llvm.hexagon.S2.vzxtbh(i32)
[all …]
H A Dxtype_shift.ll8 declare i64 @llvm.hexagon.S2.asr.i.p(i64, i32)
10 %z = call i64 @llvm.hexagon.S2.asr.i.p(i64 %a, i32 0)
15 declare i64 @llvm.hexagon.S2.lsr.i.p(i64, i32)
22 declare i64 @llvm.hexagon.S2.asl.i.p(i64, i32)
29 declare i32 @llvm.hexagon.S2.asr.i.r(i32, i32)
36 declare i32 @llvm.hexagon.S2.lsr.i.r(i32, i32)
43 declare i32 @llvm.hexagon.S2.asl.i.r(i32, i32)
336 declare i64 @llvm.hexagon.S2.asr.r.p(i64, i32)
343 declare i64 @llvm.hexagon.S2.lsr.r.p(i64, i32)
350 declare i64 @llvm.hexagon.S2.asl.r.p(i64, i32)
[all …]
H A Dxtype_bit.ll8 declare i32 @llvm.hexagon.S2.clbp(i64)
10 %z = call i32 @llvm.hexagon.S2.clbp(i64 %a)
15 declare i32 @llvm.hexagon.S2.cl0p(i64)
22 declare i32 @llvm.hexagon.S2.cl1p(i64)
50 declare i32 @llvm.hexagon.S2.cl0(i32)
57 declare i32 @llvm.hexagon.S2.cl1(i32)
64 declare i32 @llvm.hexagon.S2.clbnorm(i32)
80 declare i32 @llvm.hexagon.S2.ct0p(i64)
87 declare i32 @llvm.hexagon.S2.ct1p(i64)
94 declare i32 @llvm.hexagon.S2.ct0(i32)
[all …]
/llvm-project-15.0.7/llvm/test/Analysis/BasicAA/
H A Drange.ll111 %gep2 = getelementptr inbounds %struct.S2, %struct.S2* %s, i64 0, i32 1, i32 0
112 load %struct.S2, %struct.S2* %s
125 %gep2 = getelementptr inbounds %struct.S2, %struct.S2* %s, i64 0, i32 1, i32 3
126 load %struct.S2, %struct.S2* %s
139 %gep2 = getelementptr inbounds %struct.S2, %struct.S2* %s, i64 0, i32 2, i32 0
140 load %struct.S2, %struct.S2* %s
153 %gep2 = getelementptr inbounds %struct.S2, %struct.S2* %s, i64 0, i32 2, i32 1
154 load %struct.S2, %struct.S2* %s
168 %gep2 = getelementptr inbounds %struct.S2, %struct.S2* %s, i64 0, i32 2, i32 0
169 load %struct.S2, %struct.S2* %s
[all …]
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DSetOperations.h23 bool set_union(S1Ty &S1, const S2Ty &S2) { in set_union() argument
26 for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end(); in set_union()
40 void set_intersect(S1Ty &S1, const S2Ty &S2) { in set_intersect() argument
44 if (!S2.count(E)) S1.erase(E); // Erase element if not in S2 in set_intersect()
51 S1Ty set_difference(const S1Ty &S1, const S2Ty &S2) { in set_difference() argument
55 if (!S2.count(*SI)) // if the element is not in set2 in set_difference()
63 void set_subtract(S1Ty &S1, const S2Ty &S2) { in set_subtract() argument
64 for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end(); in set_subtract()
72 bool set_is_subset(const S1Ty &S1, const S2Ty &S2) { in set_is_subset() argument
73 if (S1.size() > S2.size()) in set_is_subset()
[all …]
H A DStringSwitch.h94 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, in Cases() argument
96 return Case(S0, Value).Cases(S1, S2, Value); in Cases()
101 return Case(S0, Value).Cases(S1, S2, S3, Value); in Cases()
106 return Case(S0, Value).Cases(S1, S2, S3, S4, Value); in Cases()
112 return Case(S0, Value).Cases(S1, S2, S3, S4, S5, Value); in Cases()
118 return Case(S0, Value).Cases(S1, S2, S3, S4, S5, S6, Value); in Cases()
124 return Case(S0, Value).Cases(S1, S2, S3, S4, S5, S6, S7, Value); in Cases()
131 return Case(S0, Value).Cases(S1, S2, S3, S4, S5, S6, S7, S8, Value); in Cases()
169 return CaseLower(S0, Value).CasesLower(S1, S2, Value); in CasesLower()
174 return CaseLower(S0, Value).CasesLower(S1, S2, S3, Value); in CasesLower()
[all …]
/llvm-project-15.0.7/clang/test/SemaCXX/
H A Dwarn-comma-operator.cpp144 class S2 { class
148 S2 operator++();
149 S2 operator++(int);
150 S2 operator--();
151 S2 operator--(int);
152 S2 operator=(int);
153 S2 operator*=(int);
154 S2 operator/=(int);
155 S2 operator%=(int);
156 S2 operator+=(int);
[all …]
H A Dout-of-line-def-mismatch.cpp9 struct S2 { struct
20 void N2::N1::S2::func(S1*) {} // expected-error {{out-of-line definition of 'func' does not match a… in func()
21 void N2::N1::S2::func(C1&, unsigned, const S1*) {} // expected-error {{out-of-line definition of 'f… in func()
22 void N2::N1::S2::func(S1*, double) {} // expected-error {{out-of-line definition of 'func' does not… in func()
23 void N2::N1::S2::func(S1, unsigned) {} // expected-error {{out-of-line definition of 'func' does no… in func()
24 void N2::N1::S2::func(unsigned*, S1*) {} // expected-error {{out-of-line definition of 'func' does … in func()
/llvm-project-15.0.7/libcxx/test/std/concepts/concepts.callable/concept.strictweakorder/
H A Dstrict_weak_order.compile.pass.cpp31 struct S2 {}; struct
40 bool operator()(S1, S2) const;
42 static_assert(!std::strict_weak_order<P2, S1, S2>);
46 bool operator()(S1, S2) const;
47 bool operator()(S2, S1) const;
49 static_assert(!std::strict_weak_order<P3, S1, S2>);
53 bool operator()(S1, S2) const;
54 bool operator()(S2, S1) const;
55 bool operator()(S2, S2) const;
57 static_assert(std::strict_weak_order<P4, S1, S2>);
H A Dstrict_weak_order.subsumption.compile.pass.cpp17 struct S2 {}; struct
21 bool operator()(S1, S2) const;
22 bool operator()(S2, S1) const;
23 bool operator()(S2, S2) const;
43 static_assert(check_strict_weak_order_subsumes_relation<R, S1, S2>());
62 static_assert(check_relation_subsumes_strict_weak_order<R, S1, S2>());
/llvm-project-15.0.7/libcxx/test/std/concepts/concepts.callable/concept.relation/
H A Drelation.compile.pass.cpp30 struct S2 {}; struct
39 bool operator()(S1, S2) const;
41 static_assert(!std::relation<P2, S1, S2>);
45 bool operator()(S1, S2) const;
46 bool operator()(S2, S1) const;
48 static_assert(!std::relation<P3, S1, S2>);
52 bool operator()(S1, S2) const;
53 bool operator()(S2, S1) const;
54 bool operator()(S2, S2) const;
56 static_assert(std::relation<P4, S1, S2>);
/llvm-project-15.0.7/libcxx/test/std/concepts/concepts.callable/concept.equiv/
H A Dequivalence_relation.compile.pass.cpp32 struct S2 {}; struct
41 bool operator()(S1, S2) const;
43 static_assert(!std::equivalence_relation<P2, S1, S2>);
47 bool operator()(S1, S2) const;
48 bool operator()(S2, S1) const;
50 static_assert(!std::equivalence_relation<P3, S1, S2>);
54 bool operator()(S1, S2) const;
55 bool operator()(S2, S1) const;
56 bool operator()(S2, S2) const;
58 static_assert(std::equivalence_relation<P4, S1, S2>);
/llvm-project-15.0.7/llvm/test/CodeGen/ARM/
H A Dfp16-vminmaxnm.ll13 ; CHECK: vmov.f16 [[S2:s[0-9]]], r{{.}}
14 ; CHECK: vminnm.f16 s0, [[S2]], [[S0]]
26 ; CHECK: vmov.f16 [[S2:s[0-9]]], r{{.}}
27 ; CHECK: vminnm.f16 s0, [[S2]], [[S0]]
39 ; CHECK: vmov.f16 [[S2:s[0-9]]], r{{.}}
40 ; CHECK: vminnm.f16 s0, [[S2]], [[S0]]
52 ; CHECK: vmov.f16 [[S2:s[0-9]]], r{{.}}
53 ; CHECK: vminnm.f16 s0, [[S2]], [[S0]]
66 ; CHECK: vminnm.f16 s0, [[S2]], [[S0]]
79 ; CHECK: vmaxnm.f16 s0, [[S2]], [[S0]]
[all …]
/llvm-project-15.0.7/clang/test/CodeGenCXX/
H A Dubsan-new-checks.cpp8 struct alignas(32) S2 { struct
40 S2 *func_02() { in func_02()
45 return new S2; in func_02()
48 S2 *func_03() { in func_03()
54 return new S2[20]; in func_03()
95 S2 *func_10(void *p) { in func_10()
100 return new(p) S2; in func_10()
103 S2 *func_11(void *p) { in func_11()
110 return new(p) S2[10]; in func_11()
/llvm-project-15.0.7/libcxx/test/std/numerics/numeric.ops/numeric.ops.gcd/
H A Dgcd.pass.cpp56 using S2 = std::make_signed_t<Input2>; in do_test() typedef
62 using Output = std::common_type_t<S1, S2>; in do_test()
63 accumulate &= test0<S1, S2, Output>(TC.x, TC.y, TC.expect); in do_test()
64 accumulate &= test0<S1, S2, Output>(-TC.x, TC.y, TC.expect); in do_test()
65 accumulate &= test0<S1, S2, Output>(TC.x, -TC.y, TC.expect); in do_test()
67 accumulate &= test0<S2, S1, Output>(TC.x, TC.y, TC.expect); in do_test()
68 accumulate &= test0<S2, S1, Output>(-TC.x, TC.y, TC.expect); in do_test()
69 accumulate &= test0<S2, S1, Output>(TC.x, -TC.y, TC.expect); in do_test()
85 using Output = std::common_type_t<S2, U1>; in do_test()
86 accumulate &= test0<S2, U1, Output>(TC.x, TC.y, TC.expect); in do_test()
[all …]
/llvm-project-15.0.7/clang/test/Analysis/
H A Darray-init-loop.cpp132 struct S2 { struct
136 S2() : i(++c) {} in S2() argument
138 S2(const S2 &copy) { in S2() function
142 S2(S2 &&move) { in S2() argument
148 S2::c = 0; in array_init_non_pod()
149 S2 arr[4]; in array_init_non_pod()
175 S2::c = 0; in lambda_init_non_pod()
176 S2 arr[4]; in lambda_init_non_pod()
201 S2 arr[4];
205 S2::c = 0; in copy_ctor_init_non_pod()
[all …]
/llvm-project-15.0.7/libcxx/test/std/concepts/concepts.lang/concept.same/
H A Dsame_as.pass.cpp18 struct S2 { struct
77 std::same_as<typename Modifier<S2>::type, typename Modifier<S2>::type>); in CheckSameAs()
120 static_assert(!std::same_as<typename Modifier1<S2>::type, in CheckNotSameAs()
172 std::same_as<int, decltype(SubsumptionTest<int S2::*, int S2::*>())>);
175 decltype(SubsumptionTest<int& (S2::*)(), int& (S2::*)()>())>);
213 static_assert(std::same_as<int S2::*, int S2::*>); in main()
214 static_assert(std::same_as<double S2::*, double S2::*>); in main()
216 static_assert(std::same_as<int& (S2::*)(), int& (S2::*)()>); in main()
217 static_assert(std::same_as<double& (S2::*)(int), double& (S2::*)(int)>); in main()
289 static_assert(!std::same_as<int S2::*, double S2::*>); in main()
[all …]
/llvm-project-15.0.7/libcxx/test/std/numerics/numeric.ops/numeric.ops.lcm/
H A Dlcm.pass.cpp53 using S2 = std::make_signed_t<Input2>; in do_test() typedef
59 using Output = std::common_type_t<S1, S2>; in do_test()
60 accumulate &= test0<S1, S2, Output>(TC.x, TC.y, TC.expect); in do_test()
61 accumulate &= test0<S1, S2, Output>(-TC.x, TC.y, TC.expect); in do_test()
62 accumulate &= test0<S1, S2, Output>(TC.x, -TC.y, TC.expect); in do_test()
64 accumulate &= test0<S2, S1, Output>(TC.x, TC.y, TC.expect); in do_test()
65 accumulate &= test0<S2, S1, Output>(-TC.x, TC.y, TC.expect); in do_test()
66 accumulate &= test0<S2, S1, Output>(TC.x, -TC.y, TC.expect); in do_test()
82 using Output = std::common_type_t<S2, U1>; in do_test()
83 accumulate &= test0<S2, U1, Output>(TC.x, TC.y, TC.expect); in do_test()
[all …]
/llvm-project-15.0.7/llvm/test/CodeGen/Hexagon/vect/
H A Dvect-shift-imm.ll21 %0 = tail call i64 @llvm.hexagon.S2.asl.i.vw(i64 %x, i32 9)
22 %1 = tail call i64 @llvm.hexagon.S2.asr.i.vw(i64 %x, i32 8)
23 %2 = tail call i64 @llvm.hexagon.S2.lsr.i.vw(i64 %x, i32 7)
24 %3 = tail call i64 @llvm.hexagon.S2.asl.i.vh(i64 %x, i32 6)
25 %4 = tail call i64 @llvm.hexagon.S2.asr.i.vh(i64 %x, i32 5)
26 %5 = tail call i64 @llvm.hexagon.S2.lsr.i.vh(i64 %x, i32 4)
35 declare i64 @llvm.hexagon.S2.asl.i.vw(i64, i32) nounwind readnone
36 declare i64 @llvm.hexagon.S2.asr.i.vw(i64, i32) nounwind readnone
37 declare i64 @llvm.hexagon.S2.lsr.i.vw(i64, i32) nounwind readnone
38 declare i64 @llvm.hexagon.S2.asl.i.vh(i64, i32) nounwind readnone
[all …]
/llvm-project-15.0.7/polly/lib/External/isl/test_inputs/codegen/cloog/
H A Dwalters2.st1 domain: "{ S2[j, 51] : j <= 24 and j >= 1; S2[25, i] : i <= 51 and i >= 1; S2[j, 0] : j <= 25 and j…
5 schedule: "[{ S1[j, i] -> [(j)]; S2[j, i] -> [(j)] }, { S1[j, i] -> [(i)]; S2[j, i] -> [(i)] }]"
10 - filter: "{ S2[j, i] }"
H A Dequality2.st1 …i10 = -998 + i1 and i0 >= 1 and i0 <= 10000 and i1 >= 1000 and i1 <= 1016; S2[i0, i1, -1999 + 2i1,…
5 …S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14] -> [(i0)] }, { S1[i0, i1, i2, …
10 - filter: "{ S2[i0, i1, i2, i3, i4, i5, i6, i7, i8, i9, i10, i11, i12, i13, i14] }"
/llvm-project-15.0.7/clang/test/CodeGen/
H A Dmalign-double.cpp24 struct S2{ struct
31 unsigned S2_align = __alignof(struct S2); argument
32 unsigned S2_size = sizeof(struct S2);
36 unsigned S2_c_offset = (unsigned) &((struct S2*) 0)->c;
37 unsigned S2_d_offset = (unsigned) &((struct S2*) 0)->d;
38 unsigned S2_s_offset = (unsigned) &((struct S2*) 0)->s;
39 unsigned S2_n_offset = (unsigned) &((struct S2*) 0)->n;

12345678910>>...38