Home
last modified time | relevance | path

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

12345678910>>...37

/external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/
DImmutableSetTest.cpp55 ImmutableSet<int> S2 = f.add(S, 3); in TEST_F() local
57 EXPECT_FALSE(S2.isEmpty()); in TEST_F()
58 EXPECT_FALSE(S == S2); in TEST_F()
59 EXPECT_TRUE(S != S2); in TEST_F()
61 EXPECT_TRUE(S2.contains(3)); in TEST_F()
62 EXPECT_FALSE(S2.begin() == S2.end()); in TEST_F()
63 EXPECT_TRUE(S2.begin() != S2.end()); in TEST_F()
73 EXPECT_FALSE(S2 == S3); in TEST_F()
74 EXPECT_TRUE(S2 != S3); in TEST_F()
75 EXPECT_FALSE(S2.contains(2)); in TEST_F()
[all …]
DStatisticTest.cpp25 OptionalStatistic &S1, OptionalStatistic &S2) { in extractCounters() argument
30 S2 = S; in extractCounters()
80 OptionalStatistic S2; in TEST() local
81 extractCounters(Range1, S1, S2); in TEST()
84 EXPECT_EQ(S2.hasValue(), false); in TEST()
96 OptionalStatistic S2; in TEST() local
97 extractCounters(Range, S1, S2); in TEST()
100 EXPECT_EQ(S2.hasValue(), true); in TEST()
105 EXPECT_EQ(S2->first, "Counter2"); in TEST()
106 EXPECT_EQ(S2->second, 1u); in TEST()
[all …]
DImmutableMapTest.cpp34 ImmutableMap<int, int> S2 = f.add(f.add(f.add(S, 3, 10), 4, 11), 5, 12); in TEST() local
37 EXPECT_FALSE(S2.isEmpty()); in TEST()
42 EXPECT_EQ(10, *S2.lookup(3)); in TEST()
43 EXPECT_EQ(11, *S2.lookup(4)); in TEST()
44 EXPECT_EQ(12, *S2.lookup(5)); in TEST()
46 EXPECT_EQ(5, S2.getMaxElement()->first); in TEST()
47 EXPECT_EQ(3U, S2.getHeight()); in TEST()
/external/llvm/unittests/ADT/
DImmutableSetTest.cpp55 ImmutableSet<int> S2 = f.add(S, 3); in TEST_F() local
57 EXPECT_FALSE(S2.isEmpty()); in TEST_F()
58 EXPECT_FALSE(S == S2); in TEST_F()
59 EXPECT_TRUE(S != S2); in TEST_F()
61 EXPECT_TRUE(S2.contains(3)); in TEST_F()
62 EXPECT_FALSE(S2.begin() == S2.end()); in TEST_F()
63 EXPECT_TRUE(S2.begin() != S2.end()); in TEST_F()
73 EXPECT_FALSE(S2 == S3); in TEST_F()
74 EXPECT_TRUE(S2 != S3); in TEST_F()
75 EXPECT_FALSE(S2.contains(2)); in TEST_F()
[all …]
DImmutableMapTest.cpp34 ImmutableMap<int, int> S2 = f.add(f.add(f.add(S, 3, 10), 4, 11), 5, 12); in TEST() local
37 EXPECT_FALSE(S2.isEmpty()); in TEST()
42 EXPECT_EQ(10, *S2.lookup(3)); in TEST()
43 EXPECT_EQ(11, *S2.lookup(4)); in TEST()
44 EXPECT_EQ(12, *S2.lookup(5)); in TEST()
46 EXPECT_EQ(5, S2.getMaxElement()->first); in TEST()
47 EXPECT_EQ(3U, S2.getHeight()); in TEST()
/external/llvm/test/CodeGen/Hexagon/intrinsics/
Dxtype_perm.ll52 declare i32 @llvm.hexagon.S2.vrndpackwh(i64)
54 %z = call i32 @llvm.hexagon.S2.vrndpackwh(i64 %a)
59 declare i32 @llvm.hexagon.S2.vrndpackwhs(i64)
61 %z = call i32 @llvm.hexagon.S2.vrndpackwhs(i64 %a)
67 declare i32 @llvm.hexagon.S2.vsathub(i64)
69 %z = call i32 @llvm.hexagon.S2.vsathub(i64 %a)
74 declare i32 @llvm.hexagon.S2.vsatwh(i64)
76 %z = call i32 @llvm.hexagon.S2.vsatwh(i64 %a)
81 declare i32 @llvm.hexagon.S2.vsatwuh(i64)
83 %z = call i32 @llvm.hexagon.S2.vsatwuh(i64 %a)
[all …]
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)
17 %z = call i64 @llvm.hexagon.S2.lsr.i.p(i64 %a, i32 0)
22 declare i64 @llvm.hexagon.S2.asl.i.p(i64, i32)
24 %z = call i64 @llvm.hexagon.S2.asl.i.p(i64 %a, i32 0)
29 declare i32 @llvm.hexagon.S2.asr.i.r(i32, i32)
31 %z = call i32 @llvm.hexagon.S2.asr.i.r(i32 %a, i32 0)
36 declare i32 @llvm.hexagon.S2.lsr.i.r(i32, i32)
38 %z = call i32 @llvm.hexagon.S2.lsr.i.r(i32 %a, i32 0)
[all …]
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)
17 %z = call i32 @llvm.hexagon.S2.cl0p(i64 %a)
22 declare i32 @llvm.hexagon.S2.cl1p(i64)
24 %z = call i32 @llvm.hexagon.S2.cl1p(i64 %a)
50 declare i32 @llvm.hexagon.S2.cl0(i32)
52 %z = call i32 @llvm.hexagon.S2.cl0(i32 %a)
57 declare i32 @llvm.hexagon.S2.cl1(i32)
59 %z = call i32 @llvm.hexagon.S2.cl1(i32 %a)
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/Hexagon/intrinsics/
Dxtype_perm.ll52 declare i32 @llvm.hexagon.S2.vrndpackwh(i64)
54 %z = call i32 @llvm.hexagon.S2.vrndpackwh(i64 %a)
59 declare i32 @llvm.hexagon.S2.vrndpackwhs(i64)
61 %z = call i32 @llvm.hexagon.S2.vrndpackwhs(i64 %a)
67 declare i32 @llvm.hexagon.S2.vsathub(i64)
69 %z = call i32 @llvm.hexagon.S2.vsathub(i64 %a)
74 declare i32 @llvm.hexagon.S2.vsatwh(i64)
76 %z = call i32 @llvm.hexagon.S2.vsatwh(i64 %a)
81 declare i32 @llvm.hexagon.S2.vsatwuh(i64)
83 %z = call i32 @llvm.hexagon.S2.vsatwuh(i64 %a)
[all …]
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)
17 %z = call i64 @llvm.hexagon.S2.lsr.i.p(i64 %a, i32 0)
22 declare i64 @llvm.hexagon.S2.asl.i.p(i64, i32)
24 %z = call i64 @llvm.hexagon.S2.asl.i.p(i64 %a, i32 0)
29 declare i32 @llvm.hexagon.S2.asr.i.r(i32, i32)
31 %z = call i32 @llvm.hexagon.S2.asr.i.r(i32 %a, i32 0)
36 declare i32 @llvm.hexagon.S2.lsr.i.r(i32, i32)
38 %z = call i32 @llvm.hexagon.S2.lsr.i.r(i32 %a, i32 0)
[all …]
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)
17 %z = call i32 @llvm.hexagon.S2.cl0p(i64 %a)
22 declare i32 @llvm.hexagon.S2.cl1p(i64)
24 %z = call i32 @llvm.hexagon.S2.cl1p(i64 %a)
50 declare i32 @llvm.hexagon.S2.cl0(i32)
52 %z = call i32 @llvm.hexagon.S2.cl0(i32 %a)
57 declare i32 @llvm.hexagon.S2.cl1(i32)
59 %z = call i32 @llvm.hexagon.S2.cl1(i32 %a)
[all …]
/external/google-fruit/include/fruit/impl/meta/
Dset.h76 template <typename S1, typename S2>
81 using type = And(CurrentResult, IsInSet(T, S2));
91 template <typename S1, typename S2>
96 using type = Or(CurrentResult, IsInSet(T, S2));
122 template <typename S1, typename S2>
127 using type = If(IsInSet(T, S2), CurrentResult, AddToSetUnchecked(CurrentResult, T));
136 template <typename S1, typename S2>
141 using type = If(IsInSet(T, S2), AddToSetUnchecked(CurrentResult, T), CurrentResult);
145 …using type = If(GreaterThan(SetSize(S1), SetSize(S2)), SetIntersection(S2, S1), FoldSet(S1, Helper…
150 template <typename S1, typename S2>
[all …]
/external/clang/test/SemaCXX/
Dwarn-comma-operator.cpp26 class S2 { class
30 S2 operator++();
31 S2 operator++(int);
32 S2 operator--();
33 S2 operator--(int);
34 S2 operator=(int);
35 S2 operator*=(int);
36 S2 operator/=(int);
37 S2 operator%=(int);
38 S2 operator+=(int);
[all …]
Dwarn-unused-variables.cpp94 struct S2 { struct
95 S2() { in S2() argument
99 S2 makeS2();
100 void testS2(S2 a) { in testS2()
101 S2 x = makeS2(); // expected-warning {{unused variable 'x'}} in testS2()
102 S2 y; in testS2()
103 S2 z = a; // expected-warning {{unused variable 'z'}} in testS2()
144 struct S2 { struct
145 S2(const S1&);
148 S2 s((S1())); in func()
Dcxx11-crashes.cpp6 struct S2 { struct
7 S2(const S2&);
8 S2();
13 S2 y;
25 S2 y;
30 S2 y;
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/
DStringSwitch.h99 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, in Cases() argument
101 return Case(S0, Value).Cases(S1, S2, Value); in Cases()
105 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, in Cases() argument
107 return Case(S0, Value).Cases(S1, S2, S3, Value); in Cases()
111 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, in Cases() argument
113 return Case(S0, Value).Cases(S1, S2, S3, S4, Value); in Cases()
117 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, in Cases() argument
120 return Case(S0, Value).Cases(S1, S2, S3, S4, S5, Value); in Cases()
124 StringSwitch &Cases(StringLiteral S0, StringLiteral S1, StringLiteral S2, in Cases() argument
127 return Case(S0, Value).Cases(S1, S2, S3, S4, S5, S6, Value); in Cases()
[all …]
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()
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/ARM/
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]]
65 ; CHECK: vmov.f16 [[S2:s[0-9]]], r{{.}}
66 ; CHECK: vminnm.f16 s0, [[S2]], [[S0]]
[all …]
/external/llvm/include/llvm/ADT/
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()
/external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
DStringSwitch.h115 const char (&S2)[N2], const T& Value) { in Cases()
116 return Case(S0, Value).Cases(S1, S2, Value); in Cases()
122 const char (&S2)[N2], const char (&S3)[N3], in Cases()
124 return Case(S0, Value).Cases(S1, S2, S3, Value); in Cases()
130 const char (&S2)[N2], const char (&S3)[N3], in Cases()
132 return Case(S0, Value).Cases(S1, S2, S3, S4, Value); in Cases()
139 const char (&S2)[N2], const char (&S3)[N3], in Cases()
142 return Case(S0, Value).Cases(S1, S2, S3, S4, S5, Value); in Cases()
149 const char (&S2)[N2], const char (&S3)[N3], in Cases()
152 return Case(S0, Value).Cases(S1, S2, S3, S4, S5, S6, Value); in Cases()
[all …]
/external/libcxx/test/std/numerics/numeric.ops/numeric.ops.gcd/
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()
66 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()
70 accumulate &= test0<S2, S1, Output>(-TC.x, -TC.y, TC.expect); in do_test()
[all …]
/external/libcxx/test/std/numerics/numeric.ops/numeric.ops.lcm/
Dlcm.pass.cpp55 using S2 = std::make_signed_t<Input2>; in do_test() typedef
61 using Output = std::common_type_t<S1, S2>; in do_test()
62 accumulate &= test0<S1, S2, Output>(TC.x, TC.y, TC.expect); 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()
66 accumulate &= test0<S2, S1, 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()
[all …]
/external/llvm/test/CodeGen/Hexagon/vect/
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 …]
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/Hexagon/vect/
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 …]
/external/swiftshader/third_party/llvm-7.0/llvm/tools/llvm-pdbutil/
DPrettyTypeDumper.cpp34 typedef bool (*CompareFunc)(const LayoutPtr &S1, const LayoutPtr &S2);
36 static bool CompareNames(const LayoutPtr &S1, const LayoutPtr &S2) { in CompareNames() argument
37 return S1->getName() < S2->getName(); in CompareNames()
40 static bool CompareSizes(const LayoutPtr &S1, const LayoutPtr &S2) { in CompareSizes() argument
41 return S1->getSize() < S2->getSize(); in CompareSizes()
44 static bool ComparePadding(const LayoutPtr &S1, const LayoutPtr &S2) { in ComparePadding() argument
45 return S1->deepPaddingSize() < S2->deepPaddingSize(); in ComparePadding()
48 static bool ComparePaddingPct(const LayoutPtr &S1, const LayoutPtr &S2) { in ComparePaddingPct() argument
50 double Pct2 = (double)S2->deepPaddingSize() / (double)S2->getSize(); in ComparePaddingPct()
54 static bool ComparePaddingImmediate(const LayoutPtr &S1, const LayoutPtr &S2) { in ComparePaddingImmediate() argument
[all …]

12345678910>>...37