Home
last modified time | relevance | path

Searched refs:findEdge (Results 1 – 6 of 6) sorted by relevance

/external/compiler-rt/lib/sanitizer_common/tests/
Dsanitizer_deadlock_detector_test.cc469 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/
DReductionRules.h127 EdgeId YZEId = G.findEdge(YNId, ZNId); in applyR2()
DGraph.h210 assert(findEdge(E.getN1Id(), E.getN2Id()) == invalidEdgeId() && in addConstructedEdge()
484 EdgeId findEdge(NodeId N1Id, NodeId N2Id) { in findEdge() function
/external/compiler-rt/lib/sanitizer_common/
Dsanitizer_deadlock_detector1.cc136 dd.findEdge(from, to, &stk_from, &stk_to, &unique_tid); in ReportDeadlock()
Dsanitizer_deadlock_detector.h260 bool findEdge(uptr from_node, uptr to_node, u32 *stk_from, u32 *stk_to, in findEdge() function
/external/llvm/lib/CodeGen/
DRegAllocPBQP.cpp367 PBQPRAGraph::EdgeId edge = g.findEdge(node1, node2); in build()