Searched refs:findEdge (Results 1 – 7 of 7) sorted by relevance
| /llvm-project-15.0.7/llvm/lib/Target/AArch64/ |
| H A D | AArch64PBQPRegAlloc.cpp | 181 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addIntraChainConstraint()
277 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addInterChainConstraint()
|
| /llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/tests/ |
| H A D | sanitizer_deadlock_detector_test.cpp | 468 d.findEdge(node[i], node[j], &stk_from, &stk_to, &unique_tid)); in RunRemoveEdgesTest()
485 d.findEdge(node[i], node[j], &stk_from, &stk_to, &unique_tid)); in RunRemoveEdgesTest()
488 d.findEdge(node[i], node[j], &stk_from, &stk_to, &unique_tid)); in RunRemoveEdgesTest()
|
| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | Graph.h | 206 assert(findEdge(E.getN1Id(), E.getN2Id()) == invalidEdgeId() && in addConstructedEdge()
573 EdgeId findEdge(NodeId N1Id, NodeId N2Id) { in findEdge() function
|
| H A D | ReductionRules.h | 129 EdgeId YZEId = G.findEdge(YNId, ZNId); in applyR2()
|
| /llvm-project-15.0.7/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_deadlock_detector1.cpp | 141 dd.findEdge(from, to, &stk_from, &stk_to, &unique_tid); in ReportDeadlock()
|
| H A D | sanitizer_deadlock_detector.h | 258 bool findEdge(uptr from_node, uptr to_node, u32 *stk_from, u32 *stk_to, in findEdge() function
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | RegAllocPBQP.cpp | 481 PBQPRAGraph::EdgeId EId = G.findEdge(N1Id, N2Id); in apply()
|