Searched refs:hasEdge (Results 1 – 3 of 3) sorted by relevance
| /external/compiler-rt/lib/sanitizer_common/tests/ |
| D | sanitizer_bvgraph_test.cc | 36 fprintf(stderr, "%d", g.hasEdge(i, j)); in PrintGraph()
88 EXPECT_TRUE(g.hasEdge(from, to)); in BasicTest()
323 EXPECT_TRUE(g.hasEdge(1, 4)); in RunAddEdgesTest()
324 EXPECT_FALSE(g.hasEdge(1, 5)); in RunAddEdgesTest()
329 EXPECT_TRUE(g.hasEdge(2, 4)); in RunAddEdgesTest()
330 EXPECT_FALSE(g.hasEdge(2, 5)); in RunAddEdgesTest()
331 EXPECT_TRUE(g.hasEdge(3, 4)); in RunAddEdgesTest()
332 EXPECT_FALSE(g.hasEdge(3, 5)); in RunAddEdgesTest()
|
| /external/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_deadlock_detector.h | 232 if (!g_.hasEdge(dtls->getLock(i), cur_idx)) in hasAllEdges()
354 return g_.hasEdge(nodeToIndex(l1), nodeToIndex(l2)); in testOnlyHasEdge()
358 return g_.hasEdge(idx1, idx2); in testOnlyHasEdgeRaw()
364 if (g_.hasEdge(from, to)) in Print()
|
| D | sanitizer_bvgraph.h | 69 bool hasEdge(uptr from, uptr to) { return v[from].getBit(to); } in hasEdge() function
104 bool hasEdge(uptr from, uptr to) const { in hasEdge() function
|