Searched refs:findEdge (Results 1 – 7 of 7) sorted by relevance
| /external/llvm/lib/Target/AArch64/ |
| D | AArch64PBQPRegAlloc.cpp | 182 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addIntraChainConstraint()
278 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addInterChainConstraint()
|
| /external/compiler-rt/lib/sanitizer_common/tests/ |
| D | sanitizer_deadlock_detector_test.cc | 469 d.findEdge(node[i], node[j], &stk_from, &stk_to, &unique_tid)); in RunRemoveEdgesTest()
486 d.findEdge(node[i], node[j], &stk_from, &stk_to, &unique_tid)); in RunRemoveEdgesTest()
489 d.findEdge(node[i], node[j], &stk_from, &stk_to, &unique_tid)); in RunRemoveEdgesTest()
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 220 assert(findEdge(E.getN1Id(), E.getN2Id()) == invalidEdgeId() && in addConstructedEdge()
580 EdgeId findEdge(NodeId N1Id, NodeId N2Id) { in findEdge() function
|
| D | ReductionRules.h | 128 EdgeId YZEId = G.findEdge(YNId, ZNId); in applyR2()
|
| /external/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_deadlock_detector1.cc | 137 dd.findEdge(from, to, &stk_from, &stk_to, &unique_tid); in ReportDeadlock()
|
| D | sanitizer_deadlock_detector.h | 264 bool findEdge(uptr from_node, uptr to_node, u32 *stk_from, u32 *stk_to, in findEdge() function
|
| /external/llvm/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 451 PBQPRAGraph::EdgeId EId = G.findEdge(N1Id, N2Id); in apply()
|