HomeSort by: relevance | last modified time | path
    Searched refs:BV (Results 1 - 12 of 12) sorted by relevancy

  /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/scripts/
merge_data_flow.py 27 [F,BV] = line.strip().split(' ')
29 D[F] = Merge(D[F], BV)
31 D[F] = BV;
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/
sanitizer_bvgraph.h 25 template<class BV>
28 enum SizeEnum : uptr { 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_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 : uptr { kSize = BV::kSize * BV::kSize * kLevel1Size };
131 for (uptr i1 = 0; i1 < BV::kSize; i1++
    [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...]
  /src/sys/external/bsd/compiler_rt/dist/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 29 // Check the 'bv' == 's' and that the indexes go in increasing order.
30 // Also check the BV::Iterator
31 template <class BV>
32 static void CheckBV(const BV &bv, const set<uptr> &s) {
33 BV t;
34 t.copyFrom(bv);
36 uptr last_idx = bv.size();
38 for (typename BV::Iterator it(bv); it.hasNext();)
80 BV bv, bv1, t_bv; local
    [all...]
  /src/sys/lib/libkern/arch/hppa/
prefix.h 78 #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)
milli.S 322 ; Additional code subspaces should have ALIGN=8 for an interspace BV
415 bv r0(r31)
455 bv r0(r31)
547 bv 0(r31)
558 bv 0(r31) ; divisor == 1
560 bv 0(r31) ; divisor == 2
564 bv 0(r31) ; divisor == 4
572 bv 0(r31) ; divisor == 8
595 bv 0(r31)
619 bv 0(r31
    [all...]
  /src/sys/dev/pcmcia/
if_xireg.h 121 #define BV 0xa /* R - Bonding version register */
if_xi.c 1089 sc->sc_rev = bus_space_read_1(bst, bsh, BV) &
  /src/sys/arch/hppa/hppa/
db_disasm.c 551 #define BV 0x3a, 0x06, 16, 3 /* BRANCH VECTORED */
1030 { BV, 0, "bv", bvDasm },

Completed in 28 milliseconds