| /external/llvm-project/llvm/unittests/ADT/ |
| D | CoalescingBitVectorTest.cpp | 19 bool elementsMatch(const UBitVec &BV, std::initializer_list<unsigned> List) { in elementsMatch() argument
20 if (!std::equal(BV.begin(), BV.end(), List.begin(), List.end())) { in elementsMatch()
28 BV.print(dbgs()); in elementsMatch()
54 UBitVec BV(Alloc); in TEST() local
55 EXPECT_EQ(BV.count(), 0u); in TEST()
56 BV.set(0); in TEST()
57 EXPECT_EQ(BV.count(), 1u); in TEST()
58 BV.set({11, 12, 13, 14, 15}); in TEST()
59 EXPECT_EQ(BV.count(), 6u); in TEST()
64 UBitVec BV(Alloc); in TEST() local
[all …]
|
| /external/autotest/server/site_tests/bluetooth_AdapterCLHealth/ |
| D | control.cl_sdp_service_search_attribute_request_test | 27 TP/SERVER/SSA/BV-01-C
28 TP/SERVER/SSA/BV-02-C
29 TP/SERVER/SSA/BV-03-C
30 TP/SERVER/SSA/BV-04-C
31 TP/SERVER/SSA/BV-06-C
32 TP/SERVER/SSA/BV-07-C
33 TP/SERVER/SSA/BV-08-C
34 TP/SERVER/SSA/BV-09-C
35 TP/SERVER/SSA/BV-10-C
36 TP/SERVER/SSA/BV-11-C
[all …]
|
| D | control.cl_sdp_service_attribute_request_test | 27 TP/SERVER/SA/BV-01-C
28 TP/SERVER/SA/BV-03-C
29 TP/SERVER/SA/BV-04-C
30 TP/SERVER/SA/BV-05-C
31 TP/SERVER/SA/BV-06-C
32 TP/SERVER/SA/BV-07-C
33 TP/SERVER/SA/BV-08-C
34 TP/SERVER/SA/BV-09-C
35 TP/SERVER/SA/BV-10-C
36 TP/SERVER/SA/BV-11-C
[all …]
|
| /external/llvm-project/llvm/unittests/IR/ |
| D | ValueHandleTest.cpp | 81 Value *BV = BitcastV.get(); in TEST_F() local
83 EXPECT_EQ(BV < CV, BitcastWVH < ConstantWVH); in TEST_F()
84 EXPECT_EQ(BV <= CV, BitcastWVH <= ConstantWVH); in TEST_F()
85 EXPECT_EQ(BV > CV, BitcastWVH > ConstantWVH); in TEST_F()
86 EXPECT_EQ(BV >= CV, BitcastWVH >= ConstantWVH); in TEST_F()
88 EXPECT_EQ(BV < CV, BitcastV.get() < ConstantWVH); in TEST_F()
89 EXPECT_EQ(BV <= CV, BitcastV.get() <= ConstantWVH); in TEST_F()
90 EXPECT_EQ(BV > CV, BitcastV.get() > ConstantWVH); in TEST_F()
91 EXPECT_EQ(BV >= CV, BitcastV.get() >= ConstantWVH); in TEST_F()
93 EXPECT_EQ(BV < CV, BitcastWVH < ConstantV); in TEST_F()
[all …]
|
| /external/llvm/unittests/IR/ |
| D | ValueHandleTest.cpp | 64 Value *BV = BitcastV.get(); in TEST_F() local
66 EXPECT_EQ(BV < CV, BitcastWVH < ConstantWVH); in TEST_F()
67 EXPECT_EQ(BV <= CV, BitcastWVH <= ConstantWVH); in TEST_F()
68 EXPECT_EQ(BV > CV, BitcastWVH > ConstantWVH); in TEST_F()
69 EXPECT_EQ(BV >= CV, BitcastWVH >= ConstantWVH); in TEST_F()
71 EXPECT_EQ(BV < CV, BitcastV.get() < ConstantWVH); in TEST_F()
72 EXPECT_EQ(BV <= CV, BitcastV.get() <= ConstantWVH); in TEST_F()
73 EXPECT_EQ(BV > CV, BitcastV.get() > ConstantWVH); in TEST_F()
74 EXPECT_EQ(BV >= CV, BitcastV.get() >= ConstantWVH); in TEST_F()
76 EXPECT_EQ(BV < CV, BitcastWVH < ConstantV); in TEST_F()
[all …]
|
| /external/llvm-project/llvm/lib/Support/ |
| D | GlobPattern.cpp | 28 BitVector BV(256, false); in expand() local
41 BV[Start] = true; in expand()
53 BV[(uint8_t)C] = true; in expand()
58 BV[(uint8_t)C] = true; in expand()
59 return BV; in expand()
88 Expected<BitVector> BV = expand(Chars.substr(1), Original); in scan() local
89 if (!BV) in scan()
90 return BV.takeError(); in scan()
91 return BV->flip(); in scan()
101 BitVector BV(256, false); in scan()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
| D | GlobPattern.cpp | 28 BitVector BV(256, false); in expand() local
41 BV[Start] = true; in expand()
53 BV[(uint8_t)C] = true; in expand()
58 BV[(uint8_t)C] = true; in expand()
59 return BV; in expand()
88 Expected<BitVector> BV = expand(Chars.substr(1), Original); in scan() local
89 if (!BV) in scan()
90 return BV.takeError(); in scan()
91 return BV->flip(); in scan()
101 BitVector BV(256, false); in scan()
[all …]
|
| /external/llvm-project/compiler-rt/lib/sanitizer_common/tests/ |
| D | sanitizer_deadlock_detector_test.cpp | 32 template<class BV>
35 dp = new DeadlockDetector<BV>; in ScopedDD()
40 DeadlockDetector<BV> *dp;
41 DeadlockDetectorTLS<BV> dtls;
44 template <class BV>
47 ScopedDD<BV> sdd; in RunBasicTest()
48 DeadlockDetector<BV> &d = *sdd.dp; in RunBasicTest()
49 DeadlockDetectorTLS<BV> &dtls = sdd.dtls; in RunBasicTest()
136 template <class BV>
138 ScopedDD<BV> sdd; in RunRemoveNodeTest()
[all …]
|
| D | sanitizer_bvgraph_test.cpp | 68 template <class BV>
70 BVGraph<BV> g; in BasicTest()
72 BV target; in BasicTest()
92 uptr path[BV::kSize]; in BasicTest()
94 for (len = 1; len < BV::kSize; len++) { in BasicTest()
98 EXPECT_LT(len, BV::kSize); in BasicTest()
116 template <class BV>
119 BVGraph<BV> g; in RemoveEdges()
121 BV bv; in RemoveEdges()
163 template <class BV>
[all …]
|
| D | sanitizer_bitvector_test.cpp | 30 template <class BV>
31 static void CheckBV(const BV &bv, const set<uptr> &s) { in CheckBV()
32 BV t; in CheckBV()
37 for (typename BV::Iterator it(bv); it.hasNext();) { in CheckBV()
58 template <class BV>
59 void Print(const BV &bv) { in Print()
60 BV t; in Print()
80 template <class BV>
83 BV bv, bv1, t_bv; in TestBitVector()
84 EXPECT_EQ(expected_size, BV::kSize); in TestBitVector()
|
| /external/compiler-rt/lib/sanitizer_common/tests/ |
| D | sanitizer_deadlock_detector_test.cc | 33 template<class BV>
36 dp = new DeadlockDetector<BV>; in ScopedDD()
41 DeadlockDetector<BV> *dp;
42 DeadlockDetectorTLS<BV> dtls;
45 template <class BV>
48 ScopedDD<BV> sdd; in RunBasicTest()
49 DeadlockDetector<BV> &d = *sdd.dp; in RunBasicTest()
50 DeadlockDetectorTLS<BV> &dtls = sdd.dtls; in RunBasicTest()
137 template <class BV>
139 ScopedDD<BV> sdd; in RunRemoveNodeTest()
[all …]
|
| D | sanitizer_bvgraph_test.cc | 69 template <class BV>
71 BVGraph<BV> g; in BasicTest()
73 BV target; in BasicTest()
93 uptr path[BV::kSize]; in BasicTest()
95 for (len = 1; len < BV::kSize; len++) { in BasicTest()
99 EXPECT_LT(len, BV::kSize); in BasicTest()
117 template <class BV>
120 BVGraph<BV> g; in RemoveEdges()
122 BV bv; in RemoveEdges()
164 template <class BV>
[all …]
|
| D | sanitizer_bitvector_test.cc | 30 template <class BV>
31 static void CheckBV(const BV &bv, const set<uptr> &s) { in CheckBV()
32 BV t; in CheckBV()
37 for (typename BV::Iterator it(bv); it.hasNext();) { in CheckBV()
58 template <class BV>
59 void Print(const BV &bv) { in Print()
60 BV t; in Print()
76 template <class BV>
78 BV bv, bv1, t_bv; in TestBitVector()
79 EXPECT_EQ(expected_size, BV::kSize); in TestBitVector()
|
| /external/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_bitvector.h | 110 template <uptr kLevel1Size = 1, class BV = BasicBitVector<> >
118 enum SizeEnum { kSize = BV::kSize * BV::kSize * kLevel1Size };
131 for (uptr i1 = 0; i1 < BV::kSize; i1++) in setAll()
189 uptr res = i0 * BV::kSize * BV::kSize + i1 * BV::kSize + i2; in getAndClearFirstOne()
201 BV t = v.l1_[i0]; in setUnion()
220 BV t = l1_[i0]; in setIntersection()
237 BV t = l1_[i0]; in setDifference()
258 BV t = l1_[i0]; in intersectsWith()
295 it1_ = typename BV::Iterator(bv_.l1_[i0_]); in next()
304 it2_ = typename BV::Iterator(bv_.l2_[i0_][i1_]); in next()
[all …]
|
| D | sanitizer_bvgraph.h | 25 template<class BV>
28 enum SizeEnum { kSize = BV::kSize };
50 uptr addEdges(const BV &from, uptr to, uptr added_edges[], in addEdges()
77 bool removeEdgesTo(const BV &to) { in removeEdgesTo()
87 bool removeEdgesFrom(const BV &from) { in removeEdgesFrom()
111 bool isReachable(uptr from, const BV &targets) { in isReachable()
112 BV &to_visit = t1, in isReachable()
128 uptr findPath(uptr from, const BV &targets, uptr *path, uptr path_size) { in findPath()
136 for (typename BV::Iterator it(v[from]); it.hasNext(); ) { in findPath()
145 uptr findShortestPath(uptr from, const BV &targets, uptr *path, in findShortestPath()
[all …]
|
| D | sanitizer_deadlock_detector.h | 36 template <class BV>
109 const BV &getLocks(uptr current_epoch) const { in getLocks()
118 BV bv_;
137 template <class BV>
140 typedef BV BitVector;
199 void ensureCurrentEpoch(DeadlockDetectorTLS<BV> *dtls) { in ensureCurrentEpoch()
206 bool onLockBefore(DeadlockDetectorTLS<BV> *dtls, uptr cur_node) { in onLockBefore()
212 u32 findLockContext(DeadlockDetectorTLS<BV> *dtls, uptr node) { in findLockContext()
217 void onLockAfter(DeadlockDetectorTLS<BV> *dtls, uptr cur_node, u32 stk = 0) {
225 bool hasAllEdges(DeadlockDetectorTLS<BV> *dtls, uptr cur_node) { in hasAllEdges()
[all …]
|
| /external/llvm-project/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_bitvector.h | 109 template <uptr kLevel1Size = 1, class BV = BasicBitVector<> >
117 enum SizeEnum : uptr { kSize = BV::kSize * BV::kSize * kLevel1Size };
130 for (uptr i1 = 0; i1 < BV::kSize; i1++) in setAll()
188 uptr res = i0 * BV::kSize * BV::kSize + i1 * BV::kSize + i2; in getAndClearFirstOne()
200 BV t = v.l1_[i0]; in setUnion()
219 BV t = l1_[i0]; in setIntersection()
236 BV t = l1_[i0]; in setDifference()
257 BV t = l1_[i0]; in intersectsWith()
294 it1_ = typename BV::Iterator(bv_.l1_[i0_]); in next()
303 it2_ = typename BV::Iterator(bv_.l2_[i0_][i1_]); in next()
[all …]
|
| D | sanitizer_bvgraph.h | 24 template<class BV>
27 enum SizeEnum : uptr { kSize = BV::kSize };
49 uptr addEdges(const BV &from, uptr to, uptr added_edges[], in addEdges()
76 bool removeEdgesTo(const BV &to) { in removeEdgesTo()
86 bool removeEdgesFrom(const BV &from) { in removeEdgesFrom()
110 bool isReachable(uptr from, const BV &targets) { in isReachable()
111 BV &to_visit = t1, in isReachable()
127 uptr findPath(uptr from, const BV &targets, uptr *path, uptr path_size) { in findPath()
135 for (typename BV::Iterator it(v[from]); it.hasNext(); ) { in findPath()
144 uptr findShortestPath(uptr from, const BV &targets, uptr *path, in findShortestPath()
[all …]
|
| D | sanitizer_deadlock_detector.h | 35 template <class BV>
106 const BV &getLocks(uptr current_epoch) const { in getLocks()
115 BV bv_;
134 template <class BV>
137 typedef BV BitVector;
195 void ensureCurrentEpoch(DeadlockDetectorTLS<BV> *dtls) { in ensureCurrentEpoch()
202 bool onLockBefore(DeadlockDetectorTLS<BV> *dtls, uptr cur_node) { in onLockBefore()
208 u32 findLockContext(DeadlockDetectorTLS<BV> *dtls, uptr node) { in findLockContext()
213 void onLockAfter(DeadlockDetectorTLS<BV> *dtls, uptr cur_node, u32 stk = 0) {
221 bool hasAllEdges(DeadlockDetectorTLS<BV> *dtls, uptr cur_node) { in hasAllEdges()
[all …]
|
| /external/llvm-project/clang/lib/StaticAnalyzer/Core/ |
| D | RangeConstraintManager.cpp | 104 void RangeSet::IntersectInRange(BasicValueFactory &BV, Factory &F, in IntersectInRange() argument
129 F.add(newRanges, Range(BV.getValue(Lower), BV.getValue(Upper))); in IntersectInRange()
132 newRanges = F.add(newRanges, Range(BV.getValue(Lower), i->To())); in IntersectInRange()
135 newRanges = F.add(newRanges, Range(i->From(), BV.getValue(Upper))); in IntersectInRange()
253 RangeSet RangeSet::Intersect(BasicValueFactory &BV, Factory &F, in Intersect() argument
262 IntersectInRange(BV, F, Lower, Upper, newRanges, i, e); in Intersect()
267 IntersectInRange(BV, F, BV.getMinValue(Upper), Upper, newRanges, i, e); in Intersect()
268 IntersectInRange(BV, F, Lower, BV.getMaxValue(Lower), newRanges, i, e); in Intersect()
276 RangeSet RangeSet::Intersect(BasicValueFactory &BV, Factory &F, in Intersect() argument
281 RangeSet newPiece = Intersect(BV, F, i->From(), i->To()); in Intersect()
[all …]
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| D | RangeConstraintManager.cpp | 114 void IntersectInRange(BasicValueFactory &BV, Factory &F, in IntersectInRange() argument
138 newRanges = F.add(newRanges, Range(BV.getValue(Lower), in IntersectInRange()
139 BV.getValue(Upper))); in IntersectInRange()
142 newRanges = F.add(newRanges, Range(BV.getValue(Lower), i->To())); in IntersectInRange()
145 newRanges = F.add(newRanges, Range(i->From(), BV.getValue(Upper))); in IntersectInRange()
247 RangeSet Intersect(BasicValueFactory &BV, Factory &F, in Intersect() argument
256 IntersectInRange(BV, F, Lower, Upper, newRanges, i, e); in Intersect()
261 IntersectInRange(BV, F, BV.getMinValue(Upper), Upper, newRanges, i, e); in Intersect()
262 IntersectInRange(BV, F, Lower, BV.getMaxValue(Lower), newRanges, i, e); in Intersect()
385 BasicValueFactory &BV = getBasicVals(); in checkNull() local
[all …]
|
| /external/llvm/include/llvm/ADT/ |
| D | SmallBitVector.h | 102 void switchToLarge(BitVector *BV) { in switchToLarge() argument
103 X = reinterpret_cast<uintptr_t>(BV); in switchToLarge()
249 BitVector *BV = new BitVector(N, t);
252 (*BV)[i] = (OldBits >> i) & 1;
253 switchToLarge(BV);
262 BitVector *BV = new BitVector(SmallSize); in reserve() local
265 BV->set(i); in reserve()
266 BV->reserve(N); in reserve()
267 switchToLarge(BV); in reserve()
|
| /external/clang/test/Sema/ |
| D | ms_class_layout.cpp | 132 struct BV : AV { struct
134 struct CV : virtual BV {
138 struct DV : BV {
|
| /external/llvm-project/clang/test/Sema/ |
| D | ms_class_layout.cpp | 132 struct BV : AV { struct
134 struct CV : virtual BV {
138 struct DV : BV {
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | MachineFrameInfo.cpp | 116 BitVector BV(TRI->getNumRegs()); in getPristineRegs() local
121 return BV; in getPristineRegs()
126 BV.set(*CSR); in getPristineRegs()
131 BV.reset(*S); in getPristineRegs()
133 return BV; in getPristineRegs()
|