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

12

/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/
H A DGlobPattern.cpp28 BitVector BV(256, false);
41 BV[Start] = true;
53 BV[(uint8_t)C] = true;
58 BV[(uint8_t)C] = true;
59 return BV;
88 Expected<BitVector> BV = expand(Chars.substr(1), Original); local
89 if (!BV)
90 return BV.takeError();
91 return BV->flip();
101 BitVector BV(25
135 Expected<BitVector> BV = scan(S, Original); local
[all...]
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
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[],
76 bool removeEdgesTo(const BV &to) {
86 bool removeEdgesFrom(const BV &from) {
110 bool isReachable(uptr from, const BV &targets) {
111 BV &to_visit = t1,
127 uptr findPath(uptr from, const BV &targets, uptr *path, uptr path_size) {
133 // The function is recursive, so we don't want to create BV on stack.
135 for (typename BV
[all...]
H A Dsanitizer_bitvector.h106 // Fixed size bit vector of (kLevel1Size*BV::kSize**2) bits.
109 template <uptr kLevel1Size = 1, class BV = BasicBitVector<> >
112 // Set bit in the first level BV indicates that there are set bits
113 // in the corresponding BV of the second level.
117 enum SizeEnum : uptr { kSize = BV::kSize * BV::kSize * kLevel1Size };
130 for (uptr i1 = 0; i1 < BV::kSize; i1++)
188 uptr res = i0 * BV::kSize * BV::kSize + i1 * BV
[all...]
H A Dsanitizer_deadlock_detector.h35 template <class BV>
68 // lock_id < BV::kSize, can cast to a smaller int.
106 const BV &getLocks(uptr current_epoch) const {
115 BV bv_;
134 template <class BV>
137 typedef BV BitVector;
195 void ensureCurrentEpoch(DeadlockDetectorTLS<BV> *dtls) {
202 bool onLockBefore(DeadlockDetectorTLS<BV> *dtls, uptr cur_node) {
208 u32 findLockContext(DeadlockDetectorTLS<BV> *dtls, uptr node) {
213 void onLockAfter(DeadlockDetectorTLS<BV> *dtl
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DRangeConstraintManager.cpp26 void RangeSet::IntersectInRange(BasicValueFactory &BV, Factory &F, argument
49 F.add(newRanges, Range(BV.getValue(Lower), BV.getValue(Upper)));
52 newRanges = F.add(newRanges, Range(BV.getValue(Lower), i->To()));
55 newRanges = F.add(newRanges, Range(i->From(), BV.getValue(Upper)));
156 RangeSet RangeSet::Intersect(BasicValueFactory &BV, Factory &F, argument
165 IntersectInRange(BV, F, Lower, Upper, newRanges, i, e);
170 IntersectInRange(BV, F, BV.getMinValue(Upper), Upper, newRanges, i, e);
171 IntersectInRange(BV,
179 Intersect(BasicValueFactory &BV, Factory &F, const RangeSet &Other) const argument
196 Negate(BasicValueFactory &BV, Factory &F) const argument
433 assumeNonZero( BasicValueFactory &BV, RangeSet::Factory &F, SymbolRef Sym, RangeSet Domain) argument
451 applyBitwiseConstraints( BasicValueFactory &BV, RangeSet::Factory &F, RangeSet Input, const SymIntExpr* SIE) argument
485 BasicValueFactory &BV = getBasicVals(); local
[all...]
H A DSimpleSValBuilder.cpp333 BasicValueFactory &BV = SVB.getBasicValueFactory(); local
338 APSIntType AT = BV.getAPSIntType(T);
356 decomposeSymbol(SymbolRef Sym, BasicValueFactory &BV) { argument
365 return std::make_pair(Sym, BV.getValue(0, Sym->getType()));
376 BasicValueFactory &BV = SVB.getBasicValueFactory(); local
382 assert(APSIntType(LInt) == BV.getAPSIntType(SymTy) &&
384 assert(APSIntType(RInt) == BV.getAPSIntType(SymTy) &&
430 const llvm::APSInt &PersistentResultInt = BV.getValue(ResultInt);
492 BasicValueFactory &BV = State->getBasicVals();
494 std::tie(LSym, LInt) = decomposeSymbol(LSym, BV);
[all...]
H A DMemRegion.cpp1520 auto *BV = A.Allocate<VarVec>();
1521 new (BV) VarVec(BC, NumBlockVars);
1531 BV->push_back(VR, BC);
1535 ReferencedVars = BV;
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-xray/
H A Dxray-fdr-dump.cpp103 BlockVerifier BV;
108 if (auto E = R->apply(BV))
113 BV.reset();
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineFrameInfo.cpp116 BitVector BV(TRI->getNumRegs());
121 return BV;
126 BV.set(*CSR);
131 BV.reset(*S);
133 return BV;
H A DAggressiveAntiDepBreaker.cpp526 BitVector BV(TRI->getNumRegs(), false);
538 BV |= RCBV;
541 BV &= RCBV;
547 return BV;
584 BitVector &BV = RenameRegisterMap[Reg];
585 assert(BV.empty());
586 BV = GetRenameRegisters(Reg);
590 for (unsigned r : BV.set_bits())
H A DStackColoring.cpp458 void dumpBV(const char *tag, const BitVector &BV) const;
533 const BitVector &BV) const {
535 for (unsigned I = 0, E = BV.size(); I != E; ++I)
536 dbgs() << BV.test(I) << " ";
H A DRegisterScavenging.cpp100 void RegScavenger::addRegUnits(BitVector &BV, Register Reg) { argument
102 BV.set(*RUI);
105 void RegScavenger::removeRegUnits(BitVector &BV, Register Reg) { argument
107 BV.reset(*RUI);
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DRangedConstraintManager.h104 void IntersectInRange(BasicValueFactory &BV, Factory &F,
114 RangeSet Intersect(BasicValueFactory &BV, Factory &F, llvm::APSInt Lower,
116 RangeSet Intersect(BasicValueFactory &BV, Factory &F,
118 RangeSet Negate(BasicValueFactory &BV, Factory &F) const;
H A DSymbolManager.h472 BasicValueFactory &BV; member in class:clang::ento::SymbolManager
478 : SymbolDependencies(16), BPAlloc(bpalloc), BV(bv), Ctx(ctx) {}
544 BasicValueFactory &getBasicVals() { return BV; }
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSmallBitVector.h105 void switchToLarge(BitVector *BV) { argument
106 X = reinterpret_cast<uintptr_t>(BV);
337 BitVector *BV = new BitVector(N, t); local
340 (*BV)[i] = (OldBits >> i) & 1;
341 switchToLarge(BV);
350 BitVector *BV = new BitVector(SmallSize); local
353 BV->set(i);
354 BV->reserve(N);
355 switchToLarge(BV);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DRegisterScavenging.h205 /// Add all Reg Units that Reg contains to BV.
206 void addRegUnits(BitVector &BV, Register Reg);
208 /// Remove all Reg Units that \p Reg contains from \p BV.
209 void removeRegUnits(BitVector &BV, Register Reg);
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DRegisterBankEmitter.cpp200 BitVector BV(RegisterClassHierarchy.getRegClasses().size());
201 PossibleSubclass.getSuperRegClasses(&SubIdx, BV);
202 if (BV.test(RC->EnumValue)) {
/freebsd-11-stable/contrib/llvm-project/clang/lib/Analysis/
H A DAnalysisDeclContext.cpp636 DeclVec *BV = (DeclVec*) A.Allocate<DeclVec>(); local
637 new (BV) DeclVec(BC, 10);
641 BV->push_back(CI.getVariable(), BC);
645 FindBlockDeclRefExprsVals F(*BV, BC);
648 Vec = BV;
649 return BV;
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonGenInsert.cpp653 const BitTracker::BitValue &BV = RC[i];
654 if (BV.is(0) || BV.is(1))
668 const BitTracker::BitValue &BV = RC[i];
669 if (BV.is(1))
671 else if (!BV.is(0))
H A DBitTracker.cpp97 raw_ostream &operator<<(raw_ostream &OS, const BT::BitValue &BV) { argument
98 switch (BV.Type) {
109 OS << printv(BV.RefI.Reg) << '[' << BV.RefI.Pos << ']';
H A DBitTracker.h265 friend raw_ostream &operator<<(raw_ostream &OS, const BitValue &BV);
H A DHexagonISelDAGToDAGHVX.cpp1432 SDValue BV = DAG.getBuildVector(ResTy, dl, Ops);
1433 LV = Lower.LowerOperation(BV, DAG);
1996 SDValue BV = DAG.getBuildVector(VecTy, dl, Elems);
1997 SDValue LV = Lower.LowerOperation(BV, DAG);
1998 DAG.RemoveDeadNode(BV.getNode());
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Coroutines/
H A DCoroFrame.cpp100 void dump(StringRef Label, BitVector const &BV) const;
159 BitVector const &BV) const {
161 for (size_t I = 0, N = BV.size(); I < N; ++I)
162 if (BV[I])
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUCallLowering.cpp560 auto BV = B.buildBuildVector(BVType, Regs); local
561 B.buildTrunc(OrigRegs[0], BV);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCFrameLowering.cpp663 BitVector BV = RS.getRegsAvailable(Subtarget.isPPC64() ? &PPC::G8RCRegClass : local
671 BV.reset(CSRegs[i]);
675 int FirstScratchReg = BV.find_first();
683 int SecondScratchReg = BV.find_next(*SR1);
692 if (BV.count() < (TwoUniqueRegsRequired ? 2U : 1U))

Completed in 296 milliseconds

12