Home
last modified time | relevance | path

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

1234

/netbsd-src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/
H A Dsanitizer_deadlock_detector_test.cc33 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 …]
H A Dsanitizer_bvgraph_test.cc69 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 …]
H A Dsanitizer_bitvector_test.cc31 template <class BV>
32 static void CheckBV(const BV &bv, const set<uptr> &s) { in CheckBV()
33 BV t; in CheckBV()
38 for (typename BV::Iterator it(bv); it.hasNext();) { in CheckBV()
59 template <class BV>
60 void Print(const BV &bv) { in Print()
61 BV t; in Print()
77 template <class BV>
80 BV bv, bv1, t_bv; in TestBitVector()
81 EXPECT_EQ(expected_size, BV::kSize); in TestBitVector()
/netbsd-src/external/apache2/llvm/dist/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()
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 …]
/netbsd-src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/
H A Dsanitizer_bitvector.h109 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 …]
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;
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 …]
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()
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 …]
/netbsd-src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/
H A Dsanitizer_bitvector.h108 template <uptr kLevel1Size = 1, class BV = BasicBitVector<> >
116 enum SizeEnum : uptr { kSize = BV::kSize * BV::kSize * kLevel1Size };
129 for (uptr i1 = 0; i1 < BV::kSize; i1++) in setAll()
187 uptr res = i0 * BV::kSize * BV::kSize + i1 * BV::kSize + i2; in getAndClearFirstOne()
199 BV t = v.l1_[i0]; in setUnion()
218 BV t = l1_[i0]; in setIntersection()
235 BV t = l1_[i0]; in setDifference()
256 BV t = l1_[i0]; in intersectsWith()
293 it1_ = typename BV::Iterator(bv_.l1_[i0_]); in next()
302 it2_ = typename BV::Iterator(bv_.l2_[i0_][i1_]); in next()
[all …]
H A Dsanitizer_deadlock_detector.h34 template <class BV>
107 const BV &getLocks(uptr current_epoch) const { in getLocks()
116 BV bv_;
135 template <class BV>
138 typedef BV BitVector;
197 void ensureCurrentEpoch(DeadlockDetectorTLS<BV> *dtls) { in ensureCurrentEpoch()
204 bool onLockBefore(DeadlockDetectorTLS<BV> *dtls, uptr cur_node) { in onLockBefore()
210 u32 findLockContext(DeadlockDetectorTLS<BV> *dtls, uptr node) { in findLockContext()
215 void onLockAfter(DeadlockDetectorTLS<BV> *dtls, uptr cur_node, u32 stk = 0) {
223 bool hasAllEdges(DeadlockDetectorTLS<BV> *dtls, uptr cur_node) { in hasAllEdges()
[all …]
H A Dsanitizer_bvgraph.h23 template<class BV>
26 enum SizeEnum : uptr { kSize = BV::kSize };
48 uptr addEdges(const BV &from, uptr to, uptr added_edges[], in addEdges()
75 bool removeEdgesTo(const BV &to) { in removeEdgesTo()
85 bool removeEdgesFrom(const BV &from) { in removeEdgesFrom()
109 bool isReachable(uptr from, const BV &targets) { in isReachable()
110 BV &to_visit = t1, in isReachable()
126 uptr findPath(uptr from, const BV &targets, uptr *path, uptr path_size) { in findPath()
134 for (typename BV::Iterator it(v[from]); it.hasNext(); ) { in findPath()
143 uptr findShortestPath(uptr from, const BV &targets, uptr *path, in findShortestPath()
[all …]
/netbsd-src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/
H A Dsanitizer_bitvector.h110 template <uptr kLevel1Size = 1, class BV = BasicBitVector<> >
118 enum SizeEnum : uptr { 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 …]
H A Dsanitizer_deadlock_detector.h36 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 …]
H A Dsanitizer_bvgraph.h25 template<class BV>
28 enum SizeEnum : uptr { 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 …]
/netbsd-src/sys/lib/libkern/arch/hppa/
H A Dprefix.h78 #define MILLIRETN BV,n 0(r31)
79 #define MILLIRET BV 0(r31)
80 #define MILLI_RETN BV,n 0(r31)
81 #define MILLI_RET BV 0(r31)
/netbsd-src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/scripts/
H A Dmerge_data_flow.py27 [F,BV] = line.strip().split(' ')
29 D[F] = Merge(D[F], BV)
31 D[F] = BV;
/netbsd-src/external/apache2/llvm/dist/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()
H A DAggressiveAntiDepBreaker.cpp518 BitVector BV(TRI->getNumRegs(), false); in GetRenameRegisters() local
530 BV |= RCBV; in GetRenameRegisters()
533 BV &= RCBV; in GetRenameRegisters()
539 return BV; in GetRenameRegisters()
576 BitVector &BV = RenameRegisterMap[Reg]; in FindSuitableFreeRegisters() local
577 assert(BV.empty()); in FindSuitableFreeRegisters()
578 BV = GetRenameRegisters(Reg); in FindSuitableFreeRegisters()
582 for (unsigned r : BV.set_bits()) in FindSuitableFreeRegisters()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
H A DSmallBitVector.h105 void switchToLarge(BitVector *BV) { in switchToLarge() argument
106 X = reinterpret_cast<uintptr_t>(BV); in switchToLarge()
337 BitVector *BV = new BitVector(N, t);
340 (*BV)[i] = (OldBits >> i) & 1;
341 switchToLarge(BV);
350 BitVector *BV = new BitVector(SmallSize); in reserve() local
353 BV->set(i); in reserve()
354 BV->reserve(N); in reserve()
355 switchToLarge(BV); in reserve()
/netbsd-src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/
H A DRangeConstraintManager.cpp551 merge(BasicValueFactory &BV, RangeSet::Factory &F, ProgramStateRef State,
554 LLVM_NODISCARD inline ProgramStateRef merge(BasicValueFactory &BV,
568 markDisequal(BasicValueFactory &BV, RangeSet::Factory &F,
571 markDisequal(BasicValueFactory &BV, RangeSet::Factory &F,
575 markDisequal(BasicValueFactory &BV, RangeSet::Factory &F,
629 inline ProgramStateRef mergeImpl(BasicValueFactory &BV, RangeSet::Factory &F,
635 BasicValueFactory &BV, RangeSet::Factory &F,
728 LLVM_NODISCARD inline RangeSet intersect(BasicValueFactory &BV,
752 LLVM_NODISCARD inline EndTy intersect(BasicValueFactory &BV, in intersect() argument
760 intersect(BasicValueFactory &BV, RangeSet::Factory &F, const RangeSet *End) { in intersect() argument
[all …]
H A DSimpleSValBuilder.cpp201 BasicValueFactory &BV = SVB.getBasicValueFactory(); in isWithinConstantOverflowBounds() local
206 APSIntType AT = BV.getAPSIntType(T); in isWithinConstantOverflowBounds()
224 decomposeSymbol(SymbolRef Sym, BasicValueFactory &BV) { in decomposeSymbol() argument
233 return std::make_pair(Sym, BV.getValue(0, Sym->getType())); in decomposeSymbol()
244 BasicValueFactory &BV = SVB.getBasicValueFactory(); in doRearrangeUnchecked() local
250 assert(APSIntType(LInt) == BV.getAPSIntType(SymTy) && in doRearrangeUnchecked()
252 assert(APSIntType(RInt) == BV.getAPSIntType(SymTy) && in doRearrangeUnchecked()
298 const llvm::APSInt &PersistentResultInt = BV.getValue(ResultInt); in doRearrangeUnchecked()
360 BasicValueFactory &BV = State->getBasicVals(); in tryRearrange() local
362 std::tie(LSym, LInt) = decomposeSymbol(LSym, BV); in tryRearrange()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-xray/
H A Dxray-fdr-dump.cpp103 BlockVerifier BV; in __anon06fcd1400102() local
108 if (auto E = R->apply(BV)) in __anon06fcd1400102()
113 BV.reset(); in __anon06fcd1400102()
/netbsd-src/external/apache2/llvm/dist/clang/lib/Analysis/
H A DAnalysisDeclContext.cpp594 DeclVec *BV = (DeclVec*) A.Allocate<DeclVec>(); in LazyInitializeReferencedDecls() local
595 new (BV) DeclVec(BC, 10); in LazyInitializeReferencedDecls()
599 BV->push_back(CI.getVariable(), BC); in LazyInitializeReferencedDecls()
603 FindBlockDeclRefExprsVals F(*BV, BC); in LazyInitializeReferencedDecls()
606 Vec = BV; in LazyInitializeReferencedDecls()
607 return BV; in LazyInitializeReferencedDecls()
/netbsd-src/external/apache2/llvm/dist/llvm/utils/TableGen/
H A DRegisterBankEmitter.cpp200 BitVector BV(RegisterClassHierarchy.getRegClasses().size()); in visitRegisterBankClasses() local
201 PossibleSubclass.getSuperRegClasses(&SubIdx, BV); in visitRegisterBankClasses()
202 if (BV.test(RC->EnumValue)) { in visitRegisterBankClasses()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
H A DRegisterScavenging.h197 void addRegUnits(BitVector &BV, MCRegister Reg);
200 void removeRegUnits(BitVector &BV, MCRegister Reg);
/netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-exegesis/lib/
H A DMCInstrDescView.cpp83 const BitVector *BitVectorCache::getUnique(BitVector &&BV) const { in getUnique()
85 if (*Entry == BV) in getUnique()
89 Entry->swap(BV); in getUnique()

1234