Searched refs:BV (Results 1 - 25 of 39) sorted by relevance

12

/external/llvm/unittests/IR/
H A DValueHandleTest.cpp64 Value *BV = BitcastV.get(); local
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 < C
142 Value *BV = BitcastV.get(); local
219 Value *BV = BitcastV.get(); local
[all...]
/external/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_bvgraph.h25 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
[all...]
H A Dsanitizer_bitvector.h107 // 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++)
189 uptr res = i0 * BV::kSize * BV::kSize + i1 * BV
[all...]
H A Dsanitizer_deadlock_detector.h36 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> *dtl
[all...]
/external/compiler-rt/lib/sanitizer_common/tests/
H A Dsanitizer_deadlock_detector_test.cc33 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> sd
[all...]
H A Dsanitizer_bvgraph_test.cc69 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;
164 template <class BV>
[all...]
H A Dsanitizer_bitvector_test.cc29 // Also check the BV::Iterator
30 template <class BV>
31 static void CheckBV(const BV &bv, const set<uptr> &s) {
32 BV t;
37 for (typename BV::Iterator it(bv); it.hasNext();) {
58 template <class BV>
59 void Print(const BV &bv) {
60 BV t;
76 template <class BV>
78 BV b
[all...]
/external/clang/test/Sema/
H A Dms_class_layout.cpp132 struct BV : AV { struct in inherits:AV
134 struct CV : virtual BV {
138 struct DV : BV {
442 // CHECK: 0 | struct BV
451 // CHECK-NEXT: 4 | (vtordisp for vbase BV)
452 // CHECK-NEXT: 8 | struct BV (virtual base)
459 // CHECK: %struct.BV = type { %struct.AV }
460 // CHECK: %struct.CV = type { i32*, i32, %struct.BV }
464 // CHECK-NEXT: 0 | struct BV (primary base)
470 // CHECK: %struct.DV = type { %struct.BV }
[all...]
/external/clang/lib/StaticAnalyzer/Core/
H A DRangeConstraintManager.cpp105 void IntersectInRange(BasicValueFactory &BV, Factory &F, argument
129 newRanges = F.add(newRanges, Range(BV.getValue(Lower),
130 BV.getValue(Upper)));
133 newRanges = F.add(newRanges, Range(BV.getValue(Lower), i->To()));
136 newRanges = F.add(newRanges, Range(i->From(), BV.getValue(Upper)));
238 RangeSet Intersect(BasicValueFactory &BV, Factory &F, argument
247 IntersectInRange(BV, F, Lower, Upper, newRanges, i, e);
252 IntersectInRange(BV, F, BV.getMinValue(Upper), Upper, newRanges, i, e);
253 IntersectInRange(BV,
[all...]
H A DMemRegion.cpp1389 VarVec *BV = (VarVec*) A.Allocate<VarVec>(); local
1390 new (BV) VarVec(BC, NumBlockVars);
1400 BV->push_back(VR, BC);
1404 ReferencedVars = BV;
/external/llvm/include/llvm/ADT/
H A DSmallBitVector.h105 void switchToLarge(BitVector *BV) { argument
106 X = reinterpret_cast<uintptr_t>(BV);
253 BitVector *BV = new BitVector(N, t); local
256 (*BV)[i] = (OldBits >> i) & 1;
257 switchToLarge(BV);
266 BitVector *BV = new BitVector(SmallSize); local
269 BV->set(i);
270 BV->reserve(N);
271 switchToLarge(BV);
/external/llvm/lib/CodeGen/
H A DAggressiveAntiDepBreaker.cpp506 BitVector BV(TRI->getNumRegs(), false);
525 BV |= RCBV;
528 BV &= RCBV;
534 return BV;
571 BitVector BV = GetRenameRegisters(Reg);
572 RenameRegisterMap.insert(std::pair<unsigned, BitVector>(Reg, BV));
575 DEBUG(for (int r = BV.find_first(); r != -1; r = BV.find_next(r))
658 BitVector BV = RenameRegisterMap[Reg];
659 if (!BV
[all...]
H A DMachineFunction.cpp593 BitVector BV(TRI->getNumRegs());
598 return BV;
601 BV.set(*CSR);
605 return BV;
611 BV.reset(I->getReg());
613 return BV;
H A DRegisterScavenging.cpp92 void RegScavenger::addRegUnits(BitVector &BV, unsigned Reg) { argument
94 BV.set(*RUI);
/external/clang/lib/Analysis/
H A DAnalysisDeclContext.cpp517 DeclVec *BV = (DeclVec*) A.Allocate<DeclVec>(); local
518 new (BV) DeclVec(BC, 10);
522 BV->push_back(CI.getVariable(), BC);
526 FindBlockDeclRefExprsVals F(*BV, BC);
529 Vec = BV;
530 return BV;
/external/llvm/include/llvm/CodeGen/
H A DRegisterScavenging.h177 /// Add all Reg Units that Reg contains to BV.
178 void addRegUnits(BitVector &BV, unsigned Reg);
/external/deqp/modules/gles2/performance/
H A Des2pShaderOperatorTests.cpp1957 BV = VALUE_BOOL_VEC,
2103 { floatCompareGroup, "lessThan", "lessThan", { BV, FV, FV, N }, attrNegPos, -1, false, false, PRECMASK_ALL },
2104 { floatCompareGroup, "lessThanEqual", "lessThanEqual", { BV, FV, FV, N }, attrNegPos, -1, false, false, PRECMASK_ALL },
2105 { floatCompareGroup, "greaterThan", "greaterThan", { BV, FV, FV, N }, attrNegPos, -1, false, false, PRECMASK_ALL },
2106 { floatCompareGroup, "greaterThanEqual", "greaterThanEqual", { BV, FV, FV, N }, attrNegPos, -1, false, false, PRECMASK_ALL },
2107 { floatCompareGroup, "equal", "equal", { BV, FV, FV, N }, attrNegPos, -1, false, false, PRECMASK_ALL },
2108 { floatCompareGroup, "notEqual", "notEqual", { BV, FV, FV, N }, attrNegPos, -1, false, false, PRECMASK_ALL },
2110 { intCompareGroup, "lessThan", "lessThan", { BV, IV, IV, N }, attrNegPos, -1, false, false, PRECMASK_ALL },
2111 { intCompareGroup, "lessThanEqual", "lessThanEqual", { BV, IV, IV, N }, attrNegPos, -1, false, false, PRECMASK_ALL },
2112 { intCompareGroup, "greaterThan", "greaterThan", { BV, I
[all...]
/external/deqp/modules/gles3/performance/
H A Des3pShaderOperatorTests.cpp1967 BV = VALUE_BOOL_VEC,
2146 { floatCompareGroup, "lessThan", "lessThan", { BV, FV, FV, N }, attrNegPos, -1, false, false, PRECMASK_ALL },
2147 { floatCompareGroup, "lessThanEqual", "lessThanEqual", { BV, FV, FV, N }, attrNegPos, -1, false, false, PRECMASK_ALL },
2148 { floatCompareGroup, "greaterThan", "greaterThan", { BV, FV, FV, N }, attrNegPos, -1, false, false, PRECMASK_ALL },
2149 { floatCompareGroup, "greaterThanEqual", "greaterThanEqual", { BV, FV, FV, N }, attrNegPos, -1, false, false, PRECMASK_ALL },
2150 { floatCompareGroup, "equal", "equal", { BV, FV, FV, N }, attrNegPos, -1, false, false, PRECMASK_ALL },
2151 { floatCompareGroup, "notEqual", "notEqual", { BV, FV, FV, N }, attrNegPos, -1, false, false, PRECMASK_ALL },
2153 { intCompareGroup, "lessThan", "lessThan", { BV, IV, IV, N }, attrNegPos, -1, false, false, PRECMASK_ALL },
2154 { intCompareGroup, "lessThanEqual", "lessThanEqual", { BV, IV, IV, N }, attrNegPos, -1, false, false, PRECMASK_ALL },
2155 { intCompareGroup, "greaterThan", "greaterThan", { BV, I
[all...]
/external/harfbuzz_ng/src/
H A Dhb-ot-shape-complex-thai.cc64 BV, enumerator in enum:thai_mark_type_t
77 return BV;
183 { /*AV*/ /*BV*/ /*T*/
210 { /*AV*/ /*BV*/ /*T*/
/external/deqp/modules/gles2/functional/
H A Des2fShaderOperatorTests.cpp222 BV = VALUE_BOOL_VEC, enumerator in enum:deqp::gles2::Functional::ValueType
1153 << BuiltinFuncInfo("lessThan", "lessThan", BV, Value(FV, -1.0f, 1.0f), Value(FV, -1.0f, 1.0f), notUsed, 1.0f, 0.0f, PRECMASK_ALL, FLOAT_VEC_FUNCS(lessThan) )
1154 << BuiltinFuncInfo("lessThanEqual", "lessThanEqual", BV, Value(FV, -1.0f, 1.0f), Value(FV, -1.0f, 1.0f), notUsed, 1.0f, 0.0f, PRECMASK_ALL, FLOAT_VEC_FUNCS(lessThanEqual) )
1155 << BuiltinFuncInfo("greaterThan", "greaterThan", BV, Value(FV, -1.0f, 1.0f), Value(FV, -1.0f, 1.0f), notUsed, 1.0f, 0.0f, PRECMASK_ALL, FLOAT_VEC_FUNCS(greaterThan) )
1156 << BuiltinFuncInfo("greaterThanEqual", "greaterThanEqual", BV, Value(FV, -1.0f, 1.0f), Value(FV, -1.0f, 1.0f), notUsed, 1.0f, 0.0f, PRECMASK_ALL, FLOAT_VEC_FUNCS(greaterThanEqual) )
1157 << BuiltinFuncInfo("equal", "equal", BV, Value(FV, -1.0f, 1.0f), Value(FV, -1.0f, 1.0f), notUsed, 1.0f, 0.0f, PRECMASK_ALL, FLOAT_VEC_FUNCS(equal) )
1158 << BuiltinFuncInfo("notEqual", "notEqual", BV, Value(FV, -1.0f, 1.0f), Value(FV, -1.0f, 1.0f), notUsed, 1.0f, 0.0f, PRECMASK_ALL, FLOAT_VEC_FUNCS(notEqual) )
1163 << BuiltinFuncInfo("lessThan", "lessThan", BV, Value(IV, -5.2f, 4.9f), Value(IV, -5.0f, 5.0f), notUsed, 1.0f, 0.0f, PRECMASK_ALL, INT_VEC_FUNCS(lessThan) )
1164 << BuiltinFuncInfo("lessThanEqual", "lessThanEqual", BV, Value(IV, -5.2f, 4.9f), Value(IV, -5.0f, 5.0f), notUsed, 1.0f, 0.0f, PRECMASK_ALL, INT_VEC_FUNCS(lessThanEqual) )
1165 << BuiltinFuncInfo("greaterThan", "greaterThan", BV, Valu
[all...]
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DSymbolManager.h481 BasicValueFactory &BV; member in class:clang::ento::SymbolManager
488 BPAlloc(bpalloc), BV(bv), Ctx(ctx) {}
553 BasicValueFactory &getBasicVals() { return BV; }
/external/llvm/lib/IR/
H A DValue.cpp593 const Value *BV = stripAndAccumulateInBoundsConstantOffsets(DL, Offset); local
596 if (const Argument *A = dyn_cast<Argument>(BV))
598 else if (auto CS = ImmutableCallSite(BV))
/external/mesa3d/src/gallium/drivers/radeon/
H A DAMDILISelDAGToDAG.cpp249 const Value *BV = getBasePointerValue(V); local
253 || (BV && dyn_cast<GlobalValue>(
/external/deqp/modules/gles3/functional/
H A Des3fShaderOperatorTests.cpp286 BV = VALUE_BOOL_VEC, enumerator in enum:deqp::gles3::Functional::ValueType
1797 << BuiltinFuncInfo("lessThan", "lessThan", BV, Value(FV, -1.0f, 1.0f), Value(FV, -1.0f, 1.0f), notUsed, 1.0f, 0.0f, PRECMASK_ALL, FLOAT_VEC_FUNCS(lessThan) )
1798 << BuiltinFuncInfo("lessThanEqual", "lessThanEqual", BV, Value(FV, -1.0f, 1.0f), Value(FV, -1.0f, 1.0f), notUsed, 1.0f, 0.0f, PRECMASK_ALL, FLOAT_VEC_FUNCS(lessThanEqual) )
1799 << BuiltinFuncInfo("greaterThan", "greaterThan", BV, Value(FV, -1.0f, 1.0f), Value(FV, -1.0f, 1.0f), notUsed, 1.0f, 0.0f, PRECMASK_ALL, FLOAT_VEC_FUNCS(greaterThan) )
1800 << BuiltinFuncInfo("greaterThanEqual", "greaterThanEqual", BV, Value(FV, -1.0f, 1.0f), Value(FV, -1.0f, 1.0f), notUsed, 1.0f, 0.0f, PRECMASK_ALL, FLOAT_VEC_FUNCS(greaterThanEqual) )
1801 << BuiltinFuncInfo("equal", "equal", BV, Value(FV, -1.0f, 1.0f), Value(FV, -1.0f, 1.0f), notUsed, 1.0f, 0.0f, PRECMASK_ALL, FLOAT_VEC_FUNCS(equal) )
1802 << BuiltinFuncInfo("notEqual", "notEqual", BV, Value(FV, -1.0f, 1.0f), Value(FV, -1.0f, 1.0f), notUsed, 1.0f, 0.0f, PRECMASK_ALL, FLOAT_VEC_FUNCS(notEqual) )
1807 << BuiltinFuncInfo("lessThan", "lessThan", BV, Value(IV, -5.2f, 4.9f), Value(IV, -5.0f, 5.0f), notUsed, 1.0f, 0.0f, PRECMASK_ALL, INT_VEC_FUNCS(lessThan) )
1808 << BuiltinFuncInfo("lessThanEqual", "lessThanEqual", BV, Value(IV, -5.2f, 4.9f), Value(IV, -5.0f, 5.0f), notUsed, 1.0f, 0.0f, PRECMASK_ALL, INT_VEC_FUNCS(lessThanEqual) )
1809 << BuiltinFuncInfo("greaterThan", "greaterThan", BV, Valu
[all...]
/external/llvm/lib/Analysis/
H A DLazyValueInfo.cpp342 /// Push BV onto BlockValueStack unless it's already in there.
344 bool pushBlockValue(const std::pair<BasicBlock *, Value *> &BV) { argument
345 if (!BlockValueSet.insert(BV).second)
348 BlockValueStack.push(BV);

Completed in 1957 milliseconds

12