Searched refs:hasEdge (Results 1 – 4 of 4) sorted by relevance
| /llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/tests/ |
| H A D | sanitizer_bvgraph_test.cpp | 35 fprintf(stderr, "%d", g.hasEdge(i, j)); in PrintGraph() 87 EXPECT_TRUE(g.hasEdge(from, to)); in BasicTest() 322 EXPECT_TRUE(g.hasEdge(1, 4)); in RunAddEdgesTest() 323 EXPECT_FALSE(g.hasEdge(1, 5)); in RunAddEdgesTest() 328 EXPECT_TRUE(g.hasEdge(2, 4)); in RunAddEdgesTest() 329 EXPECT_FALSE(g.hasEdge(2, 5)); in RunAddEdgesTest() 330 EXPECT_TRUE(g.hasEdge(3, 4)); in RunAddEdgesTest() 331 EXPECT_FALSE(g.hasEdge(3, 5)); in RunAddEdgesTest()
|
| /llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_deadlock_detector.h | 228 if (!g_.hasEdge(dtls->getLock(i), cur_idx)) in hasAllEdges() 348 return g_.hasEdge(nodeToIndex(l1), nodeToIndex(l2)); in testOnlyHasEdge() 352 return g_.hasEdge(idx1, idx2); in testOnlyHasEdgeRaw() 358 if (g_.hasEdge(from, to)) in Print()
|
| H A D | sanitizer_bvgraph.h | 68 bool hasEdge(uptr from, uptr to) { return v[from].getBit(to); } in hasEdge() function 103 bool hasEdge(uptr from, uptr to) const { in hasEdge() function
|
| /llvm-project-15.0.7/mlir/lib/Dialect/Affine/Transforms/ |
| H A D | LoopFusion.cpp | 273 bool hasEdge(unsigned srcId, unsigned dstId, Value value = nullptr) { in hasEdge() function 288 if (!hasEdge(srcId, dstId, value)) { in addEdge()
|