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

  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/
sanitizer_bitvector_test.cc 86 EXPECT_FALSE(bv.getBit(4));
87 EXPECT_FALSE(bv.getBit(6));
88 EXPECT_TRUE(bv.getBit(5));
90 EXPECT_FALSE(bv.getBit(5));
97 EXPECT_EQ(bv.getBit(bit), s.count(bit) == 1);
108 EXPECT_EQ(bv.getBit(bit), s.count(bit) == 1);
sanitizer_bvgraph_test.cc 100 EXPECT_TRUE(target.getBit(path[len - 1]));
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/
sanitizer_bvgraph.h 69 bool hasEdge(uptr from, uptr to) { return v[from].getBit(to); }
106 return v[from].getBit(to);
132 if (targets.getBit(from))
sanitizer_bitvector.h 47 bool getBit(uptr idx) const { return (bits_ & mask(idx)) != 0; }
149 if (!l1_[i0].getBit(i1)) {
165 if (l1_[i0].getBit(i1)) {
173 bool getBit(uptr idx) const {
179 return l1_[i0].getBit(i1) && l2_[i0][i1].getBit(i2);
262 if (!v.l1_[i0].getBit(i1)) continue;
sanitizer_deadlock_detector.h 163 if (recycled_nodes_.getBit(edges_[i].from) ||
164 recycled_nodes_.getBit(edges_[i].to)) {
194 CHECK(!available_nodes_.getBit(idx));
320 CHECK(!tmp_bv_.getBit(idx));
349 return dtls->getLocks(current_epoch_).getBit(nodeToIndex(node));

Completed in 41 milliseconds