Home
last modified time | relevance | path

Searched refs:BV (Results 1 – 25 of 77) sorted by relevance

1234

/llvm-project-15.0.7/llvm/unittests/ADT/
H A DCoalescingBitVectorTest.cpp56 BV.set(0); in TEST()
66 BV.set(1); in TEST()
68 BV.clear(); in TEST()
100 EXPECT_TRUE(BV.end() == BV.end()); in TEST()
114 BV.set(3); in TEST()
117 BV.set(10); in TEST()
138 BV.set(0); in TEST()
143 BV.clear(); in TEST()
148 BV.clear(); in TEST()
153 BV.clear(); in TEST()
[all …]
/llvm-project-15.0.7/llvm/unittests/IR/
H A DValueHandleTest.cpp81 Value *BV = BitcastV.get(); in TEST_F() local
83 EXPECT_EQ(BV < CV, BitcastWVH < ConstantWVH); in TEST_F()
85 EXPECT_EQ(BV > CV, BitcastWVH > ConstantWVH); in TEST_F()
93 EXPECT_EQ(BV < CV, BitcastWVH < ConstantV); in TEST_F()
94 EXPECT_EQ(BV <= CV, BitcastWVH <= ConstantV); in TEST_F()
95 EXPECT_EQ(BV > CV, BitcastWVH > ConstantV); in TEST_F()
159 Value *BV = BitcastV.get(); in TEST_F() local
171 EXPECT_EQ(BV < CV, BitcastAVH < ConstantV); in TEST_F()
173 EXPECT_EQ(BV > CV, BitcastAVH > ConstantV); in TEST_F()
236 Value *BV = BitcastV.get(); in TEST_F() local
[all …]
/llvm-project-15.0.7/llvm/lib/Support/
H A DGlobPattern.cpp28 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()
89 if (!BV) in scan()
91 return BV->flip(); in scan()
101 BitVector BV(256, false); in scan()
104 return BV; in scan()
136 if (!BV) in create()
[all …]
/llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/tests/
H A Dsanitizer_deadlock_detector_test.cpp32 template<class BV>
44 template <class BV>
47 ScopedDD<BV> sdd; in RunBasicTest()
136 template <class BV>
138 ScopedDD<BV> sdd; in RunRemoveNodeTest()
242 template <class BV>
244 ScopedDD<BV> sdd; in RunMultipleEpochsTest()
287 template <class BV>
289 ScopedDD<BV> sdd; in RunCorrectEpochFlush()
319 template <class BV>
[all …]
H A Dsanitizer_bvgraph_test.cpp70 BVGraph<BV> g; in BasicTest()
72 BV target; in BasicTest()
119 BVGraph<BV> g; in RemoveEdges()
121 BV bv; in RemoveEdges()
166 BVGraph<BV> g; in Test_isReachable()
168 BV target; in Test_isReachable()
222 BVGraph<BV> g; in LongCycle()
247 BV target; in LongCycle()
267 BVGraph<BV> g; in ShortestPath()
269 BV t7; in ShortestPath()
[all …]
H A Dsanitizer_bitvector_test.cpp30 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()
/llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_bitvector.h117 enum SizeEnum : uptr { kSize = BV::kSize * BV::kSize * kLevel1Size };
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()
309 uptr res = i0_ * BV::kSize * BV::kSize + i1_ * BV::kSize + i2; in next()
327 uptr res = idx / (BV::kSize * BV::kSize); in idx0()
333 uptr res = (idx / BV::kSize) % BV::kSize; in idx1()
344 BV l1_[kLevel1Size];
[all …]
H A Dsanitizer_deadlock_detector.h35 template <class BV>
106 const BV &getLocks(uptr current_epoch) const { in getLocks()
115 BV bv_;
134 template <class BV>
137 typedef BV BitVector;
399 BV available_nodes_;
400 BV recycled_nodes_;
401 BV tmp_bv_;
402 BVGraph<BV> g_;
403 uptr data_[BV::kSize];
[all …]
H A Dsanitizer_bvgraph.h24 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()
135 for (typename BV::Iterator it(v[from]); it.hasNext(); ) { in findPath()
144 uptr findShortestPath(uptr from, const BV &targets, uptr *path, in findShortestPath()
157 BV v[kSize];
[all …]
/llvm-project-15.0.7/bolt/lib/Passes/
H A DRegAnalysis.cpp116 BC.MIB->getCalleeSavedRegs(BV); in beConservative()
117 BV.flip(); in beConservative()
118 Result |= BV; in beConservative()
133 BC.MIB->getCalleeSavedRegs(BV); in isConservative()
134 BV |= Vec; in isConservative()
135 return BV.all(); in isConservative()
176 if (BV != RegsKilledMap.end()) { in getInstUsedRegsList()
177 RegSet |= BV->second; in getInstUsedRegsList()
184 auto BV = RegsGenMap.find(Function); in getInstUsedRegsList() local
185 if (BV != RegsGenMap.end()) { in getInstUsedRegsList()
[all …]
H A DDataflowAnalysis.cpp26 BitVector BV = State; in operator <<()
27 BV.flip(); in operator <<()
28 for (int I : BV.set_bits()) { in operator <<()
84 BitVector BV = State; in print() local
85 BV.flip(); in print()
86 for (int I : BV.set_bits()) in print()
/llvm-project-15.0.7/bolt/include/bolt/Passes/
H A DLivenessAnalysis.h40 BitVector BV = (*this->getStateAt(PP)); in isAlive() local
42 BV &= RegAliases; in isAlive()
43 return BV.any(); in isAlive()
51 BitVector BV = *this->getStateAt(P); in scavengeRegAfter() local
52 BV.flip(); in scavengeRegAfter()
59 BV &= GPRegs; in scavengeRegAfter()
60 BV &= FP; in scavengeRegAfter()
61 int Reg = BV.find_first(); in scavengeRegAfter()
H A DDataflowAnalysis.h444 const BitVector *BV; variable
451 Idx = BV->find_next(Idx);
466 ExprIterator(const BitVector *BV, const std::vector<MCInst *> &Exprs) in ExprIterator() argument
467 : BV(BV), Expressions(Exprs) { in ExprIterator()
468 Idx = BV->find_first(); in ExprIterator()
470 ExprIterator(const BitVector *BV, const std::vector<MCInst *> &Exprs, int Idx) in ExprIterator() argument
471 : BV(BV), Expressions(Exprs), Idx(Idx) {} in ExprIterator()
490 ExprIterator expr_begin(const BitVector &BV) const { in expr_begin() argument
491 return ExprIterator(&BV, Expressions); in expr_begin()
H A DReachingDefOrUse.h45 BitVector BV = BitVector(this->BC.MRI->getNumRegs(), false); in isReachedBy() local
47 RA.getInstClobberList(**I, BV); in isReachedBy()
49 this->BC.MIB->getTouchedRegs(**I, BV); in isReachedBy()
50 if (BV[Reg]) in isReachedBy()
/llvm-project-15.0.7/llvm/unittests/tools/llvm-mca/X86/
H A DTestIncrementalMCA.cpp76 auto BV = BaselineObj->getInteger(F); in TEST_F() local
77 ASSERT_TRUE(V && BV); in TEST_F()
78 ASSERT_EQ(*BV, *V) << "Value of '" << F << "' does not match"; in TEST_F()
177 auto BV = BaselineObj->getInteger(F); in TEST_F() local
178 ASSERT_TRUE(V && BV); in TEST_F()
179 ASSERT_EQ(*BV, *V) << "Value of '" << F << "' does not match"; in TEST_F()
/llvm-project-15.0.7/clang/test/Sema/
H A Dms_class_layout.cpp132 struct BV : AV { struct
134 struct CV : virtual BV {
138 struct DV : BV {
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DMachineFrameInfo.cpp117 BitVector BV(TRI->getNumRegs()); in getPristineRegs() local
122 return BV; in getPristineRegs()
127 BV.set(*CSR); in getPristineRegs()
132 BV.reset(*S); in getPristineRegs()
134 return BV; in getPristineRegs()
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DSmallBitVector.h106 void switchToLarge(BitVector *BV) { in switchToLarge() argument
107 X = reinterpret_cast<uintptr_t>(BV); in switchToLarge()
340 BitVector *BV = new BitVector(N, t);
343 (*BV)[I] = (OldBits >> I) & 1;
344 switchToLarge(BV);
353 BitVector *BV = new BitVector(SmallSize); in reserve() local
356 BV->set(I); in reserve()
357 BV->reserve(N); in reserve()
358 switchToLarge(BV); in reserve()
/llvm-project-15.0.7/llvm/tools/llvm-xray/
H A Dxray-fdr-dump.cpp103 BlockVerifier BV; in __anon94bca1c50102() local
108 if (auto E = R->apply(BV)) in __anon94bca1c50102()
113 BV.reset(); in __anon94bca1c50102()
/llvm-project-15.0.7/mlir/test/Conversion/VectorToLLVM/
H A Dvector-mask-to-llvm.mlir57 // CMP32: %[[BV:.*]] = llvm.shufflevector %[[B0]], {{.*}} : vector<16xi32>, vector<16xi32>
58 // CMP32: %[[M:.*]] = arith.cmpi slt, %[[C]], %[[BV]] : vector<16xi32>
69 // CMP64: %[[BV:.*]] = llvm.shufflevector %[[B0]], {{.*}} : vector<16xi64>, vector<16xi64>
70 // CMP64: %[[M:.*]] = arith.cmpi slt, %[[C]], %[[BV]] : vector<16xi64>
/llvm-project-15.0.7/bolt/lib/Core/
H A DMCPlusBuilder.cpp464 BitVector BV(RegInfo->getNumRegs(), false); in initAliases() local
465 BV.set(I); in initAliases()
466 AliasMap.emplace_back(BV); in initAliases()
467 SmallerAliasMap.emplace_back(BV); in initAliases()
493 const BitVector &BV = AliasMap[I]; in initAliases()
494 int Idx = BV.find_first(); in initAliases()
497 Idx = BV.find_next(Idx); in initAliases()
/llvm-project-15.0.7/bolt/unittests/Core/
H A DMCPlusBuilder.cpp65 const BitVector &BV = BC->MIB->getAliases(Register, OnlySmaller); in testRegAliases() local
66 ASSERT_EQ(BV.count(), Count); in testRegAliases()
68 ASSERT_TRUE(BV[Aliases[I]]); in testRegAliases()
/llvm-project-15.0.7/clang/lib/Analysis/FlowSensitive/
H A DDebugSupport.cpp107 auto &BV = cast<BiconditionalValue>(B); in debugString() local
108 auto L = debugString(BV.getLeftSubValue(), Depth + 1); in debugString()
109 auto R = debugString(BV.getRightSubValue(), Depth + 1); in debugString()
/llvm-project-15.0.7/llvm/utils/TableGen/
H A DRegisterBankEmitter.cpp198 BitVector BV(RegisterClassHierarchy.getRegClasses().size()); in visitRegisterBankClasses() local
199 PossibleSubclass.getSuperRegClasses(&SubIdx, BV); in visitRegisterBankClasses()
200 if (BV.test(RC->EnumValue)) { in visitRegisterBankClasses()
/llvm-project-15.0.7/clang/lib/StaticAnalyzer/Core/
H A DSimpleSValBuilder.cpp239 BasicValueFactory &BV = SVB.getBasicValueFactory(); in isWithinConstantOverflowBounds() local
244 APSIntType AT = BV.getAPSIntType(T); in isWithinConstantOverflowBounds()
262 decomposeSymbol(SymbolRef Sym, BasicValueFactory &BV) { in decomposeSymbol() argument
271 return std::make_pair(Sym, BV.getValue(0, Sym->getType())); in decomposeSymbol()
282 BasicValueFactory &BV = SVB.getBasicValueFactory(); in doRearrangeUnchecked() local
288 assert(APSIntType(LInt) == BV.getAPSIntType(SymTy) && in doRearrangeUnchecked()
290 assert(APSIntType(RInt) == BV.getAPSIntType(SymTy) && in doRearrangeUnchecked()
335 const llvm::APSInt &PersistentResultInt = BV.getValue(ResultInt); in doRearrangeUnchecked()
394 BasicValueFactory &BV = State->getBasicVals(); in tryRearrange() local
396 std::tie(LSym, LInt) = decomposeSymbol(LSym, BV); in tryRearrange()
[all …]

1234