| /external/llvm/unittests/IR/ |
| ValueHandleTest.cpp | 64 Value *BV = BitcastV.get();
66 EXPECT_EQ(BV < CV, BitcastWVH < ConstantWVH);
67 EXPECT_EQ(BV <= CV, BitcastWVH <= ConstantWVH);
68 EXPECT_EQ(BV > CV, BitcastWVH > ConstantWVH);
69 EXPECT_EQ(BV >= CV, BitcastWVH >= ConstantWVH);
71 EXPECT_EQ(BV < CV, BitcastV.get() < ConstantWVH);
72 EXPECT_EQ(BV <= CV, BitcastV.get() <= ConstantWVH);
73 EXPECT_EQ(BV > CV, BitcastV.get() > ConstantWVH);
74 EXPECT_EQ(BV >= CV, BitcastV.get() >= ConstantWVH);
76 EXPECT_EQ(BV < CV, BitcastWVH < ConstantV)
[all...] |
| /external/swiftshader/third_party/LLVM/unittests/Support/ |
| ValueHandleTest.cpp | 68 Value *BV = BitcastV.get();
70 EXPECT_EQ(BV < CV, BitcastWVH < ConstantWVH);
71 EXPECT_EQ(BV <= CV, BitcastWVH <= ConstantWVH);
72 EXPECT_EQ(BV > CV, BitcastWVH > ConstantWVH);
73 EXPECT_EQ(BV >= CV, BitcastWVH >= ConstantWVH);
75 EXPECT_EQ(BV < CV, BitcastV.get() < ConstantWVH);
76 EXPECT_EQ(BV <= CV, BitcastV.get() <= ConstantWVH);
77 EXPECT_EQ(BV > CV, BitcastV.get() > ConstantWVH);
78 EXPECT_EQ(BV >= CV, BitcastV.get() >= ConstantWVH);
80 EXPECT_EQ(BV < CV, BitcastWVH < ConstantV)
[all...] |
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_bitvector.h | 84 // for (BasicBitVector<>::Iterator it(bv); it.hasNext();) {
91 explicit Iterator(const BasicBitVector &bv) : bv_(bv) {}
107 // Fixed size bit vector of (kLevel1Size*BV::kSize**2) bits.
110 template <uptr kLevel1Size = 1, class BV = BasicBitVector<> >
113 // Set bit in the first level BV indicates that there are set bits
114 // in the corresponding BV of the second level.
118 enum SizeEnum { kSize = BV::kSize * BV::kSize * kLevel1Size };
131 for (uptr i1 = 0; i1 < BV::kSize; i1++
[all...] |
| sanitizer_bvgraph.h | 25 template<class BV>
28 enum SizeEnum { kSize = BV::kSize };
50 uptr addEdges(const BV &from, uptr to, uptr added_edges[],
77 bool removeEdgesTo(const BV &to) {
87 bool removeEdgesFrom(const BV &from) {
111 bool isReachable(uptr from, const BV &targets) {
112 BV &to_visit = t1,
128 uptr findPath(uptr from, const BV &targets, uptr *path, uptr path_size) {
134 // The function is recursive, so we don't want to create BV on stack.
136 for (typename BV::Iterator it(v[from]); it.hasNext(); )
[all...] |
| sanitizer_deadlock_detector.h | 36 template <class BV>
70 // lock_id < BV::kSize, can cast to a smaller int.
109 const BV &getLocks(uptr current_epoch) const {
118 BV bv_;
137 template <class BV>
140 typedef BV BitVector;
199 void ensureCurrentEpoch(DeadlockDetectorTLS<BV> *dtls) {
206 bool onLockBefore(DeadlockDetectorTLS<BV> *dtls, uptr cur_node) {
212 u32 findLockContext(DeadlockDetectorTLS<BV> *dtls, uptr node) {
217 void onLockAfter(DeadlockDetectorTLS<BV> *dtls, uptr cur_node, u32 stk = 0)
[all...] |
| /external/compiler-rt/lib/sanitizer_common/tests/ |
| sanitizer_deadlock_detector_test.cc | 33 template<class BV>
36 dp = new DeadlockDetector<BV>;
41 DeadlockDetector<BV> *dp;
42 DeadlockDetectorTLS<BV> dtls;
45 template <class BV>
48 ScopedDD<BV> sdd;
49 DeadlockDetector<BV> &d = *sdd.dp;
50 DeadlockDetectorTLS<BV> &dtls = sdd.dtls;
137 template <class BV>
139 ScopedDD<BV> sdd
[all...] |
| sanitizer_bvgraph_test.cc | 69 template <class BV>
71 BVGraph<BV> g;
73 BV target;
93 uptr path[BV::kSize];
95 for (len = 1; len < BV::kSize; len++) {
99 EXPECT_LT(len, BV::kSize);
117 template <class BV>
120 BVGraph<BV> g;
122 BV bv; local
[all...] |
| sanitizer_bitvector_test.cc | 28 // Check the 'bv' == 's' and that the indexes go in increasing order.
29 // Also check the BV::Iterator
30 template <class BV>
31 static void CheckBV(const BV &bv, const set<uptr> &s) {
32 BV t;
33 t.copyFrom(bv);
35 uptr last_idx = bv.size();
37 for (typename BV::Iterator it(bv); it.hasNext();)
78 BV bv, bv1, t_bv; local
[all...] |
| /external/spirv-llvm/lib/SPIRV/ |
| SPIRVReader.cpp | 314 Value *transConvertInst(SPIRVValue* BV, Function* F, BasicBlock* BB);
419 Value *mapValue(SPIRVValue *BV, Value *V) {
420 auto Loc = ValueMap.find(BV);
436 ValueMap[BV] = V;
465 Value *getTranslatedValue(SPIRVValue *BV);
480 BinaryOperator *transShiftLogicalBitwiseInst(SPIRVValue* BV, BasicBlock* BB,
483 Instruction *transCmpInst(SPIRVValue* BV, BasicBlock* BB, Function* F);
498 void setName(llvm::Value* V, SPIRVValue* BV);
514 SPIRVToLLVM::getTranslatedType(SPIRVType *BV){
515 auto Loc = TypeMap.find(BV);
[all...] |
| SPIRVWriter.cpp | 134 void transDbgInfo(Value *V, SPIRVValue *BV) {
142 if (!BV->hasId())
144 BM->addLine(BV, File, DL.getLine(), DL.getCol());
149 BM->addLine(BV, File, DIS->getLine(), 0);
194 bool transAlign(Value *V, SPIRVValue *BV);
202 bool transDecoration(Value *V, SPIRVValue *BV);
240 SPIRVValue *mapValue(Value *V, SPIRVValue *BV) {
243 if (Loc->second == BV)
244 return BV;
248 BV->setId(Forward->getId())
[all...] |
| /external/clang/test/Sema/ |
| ms_class_layout.cpp | 132 struct BV : AV {
134 struct CV : virtual BV {
138 struct DV : BV {
435 // CHECK: 0 | struct BV
444 // CHECK-NEXT: 4 | (vtordisp for vbase BV)
445 // CHECK-NEXT: 8 | struct BV (virtual base)
452 // CHECK: %struct.BV = type { %struct.AV }
453 // CHECK: %struct.CV = type { i32*, i32, %struct.BV }
457 // CHECK-NEXT: 0 | struct BV (primary base)
463 // CHECK: %struct.DV = type { %struct.BV }
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| SmallBitVector.h | 98 void switchToLarge(BitVector *BV) {
99 X = reinterpret_cast<uintptr_t>(BV);
254 BitVector *BV = new BitVector(N, t);
257 (*BV)[i] = (OldBits >> i) & 1;
258 switchToLarge(BV);
267 BitVector *BV = new BitVector(SmallSize);
270 BV->set(i);
271 BV->reserve(N);
272 switchToLarge(BV);
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
| RegisterScavenging.h | 148 /// Add Reg and all its sub-registers to BV.
149 void addRegWithSubRegs(BitVector &BV, unsigned Reg);
151 /// Add Reg and its aliases to BV.
152 void addRegWithAliases(BitVector &BV, unsigned Reg);
|
| /external/llvm/include/llvm/ADT/ |
| SmallBitVector.h | 102 void switchToLarge(BitVector *BV) {
103 X = reinterpret_cast<uintptr_t>(BV);
249 BitVector *BV = new BitVector(N, t);
252 (*BV)[i] = (OldBits >> i) & 1;
253 switchToLarge(BV);
262 BitVector *BV = new BitVector(SmallSize);
265 BV->set(i);
266 BV->reserve(N);
267 switchToLarge(BV);
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| SmallBitVector.h | 102 void switchToLarge(BitVector *BV) {
103 X = reinterpret_cast<uintptr_t>(BV);
278 BitVector *BV = new BitVector(N, t);
281 (*BV)[i] = (OldBits >> i) & 1;
282 switchToLarge(BV);
291 BitVector *BV = new BitVector(SmallSize);
294 BV->set(i);
295 BV->reserve(N);
296 switchToLarge(BV);
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| SmallBitVector.h | 102 void switchToLarge(BitVector *BV) {
103 X = reinterpret_cast<uintptr_t>(BV);
278 BitVector *BV = new BitVector(N, t);
281 (*BV)[i] = (OldBits >> i) & 1;
282 switchToLarge(BV);
291 BitVector *BV = new BitVector(SmallSize);
294 BV->set(i);
295 BV->reserve(N);
296 switchToLarge(BV);
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| RangeConstraintManager.cpp | 114 void IntersectInRange(BasicValueFactory &BV, Factory &F,
138 newRanges = F.add(newRanges, Range(BV.getValue(Lower),
139 BV.getValue(Upper)));
142 newRanges = F.add(newRanges, Range(BV.getValue(Lower), i->To()));
145 newRanges = F.add(newRanges, Range(i->From(), BV.getValue(Upper)));
247 RangeSet Intersect(BasicValueFactory &BV, Factory &F,
256 IntersectInRange(BV, F, Lower, Upper, newRanges, i, e);
261 IntersectInRange(BV, F, BV.getMinValue(Upper), Upper, newRanges, i, e);
262 IntersectInRange(BV, F, Lower, BV.getMaxValue(Lower), newRanges, i, e)
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| RegisterScavenging.cpp | 111 void RegScavenger::addRegWithSubRegs(BitVector &BV, unsigned Reg) {
112 BV.set(Reg);
114 BV.set(*R);
117 void RegScavenger::addRegWithAliases(BitVector &BV, unsigned Reg) {
118 BV.set(Reg);
120 BV.set(*R);
|
| MachineFunction.cpp | 460 BitVector BV(TRI->getNumRegs());
465 return BV;
468 BV.set(*CSR);
472 return BV;
478 BV.reset(I->getReg());
480 return BV;
672 if (const ConstantVector *BV = dyn_cast<ConstantVector>(B)) {
673 if (AV->getType()->getNumElements() != BV->getType()->getNumElements())
677 BV->getOperand(i), TD))
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
| RegisterScavenging.h | 185 /// Add all Reg Units that Reg contains to BV.
186 void addRegUnits(BitVector &BV, unsigned Reg);
188 /// Remove all Reg Units that \p Reg contains from \p BV.
189 void removeRegUnits(BitVector &BV, unsigned Reg);
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
| RegisterScavenging.h | 185 /// Add all Reg Units that Reg contains to BV.
186 void addRegUnits(BitVector &BV, unsigned Reg);
188 /// Remove all Reg Units that \p Reg contains from \p BV.
189 void removeRegUnits(BitVector &BV, unsigned Reg);
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| SmallBitVector.h | 110 void switchToLarge(BitVector *BV) {
111 X = reinterpret_cast<uintptr_t>(BV);
338 BitVector *BV = new BitVector(N, t);
341 (*BV)[i] = (OldBits >> i) & 1;
342 switchToLarge(BV);
351 BitVector *BV = new BitVector(SmallSize);
354 BV->set(i);
355 BV->reserve(N);
356 switchToLarge(BV);
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| SmallBitVector.h | 110 void switchToLarge(BitVector *BV) {
111 X = reinterpret_cast<uintptr_t>(BV);
338 BitVector *BV = new BitVector(N, t);
341 (*BV)[i] = (OldBits >> i) & 1;
342 switchToLarge(BV);
351 BitVector *BV = new BitVector(SmallSize);
354 BV->set(i);
355 BV->reserve(N);
356 switchToLarge(BV);
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| SmallBitVector.h | 110 void switchToLarge(BitVector *BV) {
111 X = reinterpret_cast<uintptr_t>(BV);
338 BitVector *BV = new BitVector(N, t);
341 (*BV)[i] = (OldBits >> i) & 1;
342 switchToLarge(BV);
351 BitVector *BV = new BitVector(SmallSize);
354 BV->set(i);
355 BV->reserve(N);
356 switchToLarge(BV);
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| SmallBitVector.h | 110 void switchToLarge(BitVector *BV) {
111 X = reinterpret_cast<uintptr_t>(BV);
338 BitVector *BV = new BitVector(N, t);
341 (*BV)[i] = (OldBits >> i) & 1;
342 switchToLarge(BV);
351 BitVector *BV = new BitVector(SmallSize);
354 BV->set(i);
355 BV->reserve(N);
356 switchToLarge(BV);
|
