Home
last modified time | relevance | path

Searched refs:handleRemoveEdge (Results 1 – 5 of 5) sorted by relevance

/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/
DHeuristicSolver.h260 h.handleRemoveEdge(eItr, ynItr); in applyR1()
273 h.handleRemoveEdge(eItr, ynItr); in applyR1()
364 h.handleRemoveEdge(yzeItr, ynItr); in applyR2()
365 h.handleRemoveEdge(yzeItr, znItr); in applyR2()
378 h.handleRemoveEdge(yxeItr, ynItr); in applyR2()
380 h.handleRemoveEdge(zxeItr, znItr); in applyR2()
DHeuristicBase.h225 void handleRemoveEdge(Graph::EdgeItr eItr, Graph::NodeItr nItr) { in handleRemoveEdge() function
/external/llvm/include/llvm/CodeGen/
DRegAllocPBQP.h296 void handleRemoveEdge(const MatrixMetadata& MD, bool Transpose) { in handleRemoveEdge() function
372 void handleRemoveEdge(EdgeId EId) { in handleRemoveEdge() function
380 NMd.handleRemoveEdge(MMd, NId == G.getEdgeNode2Id(EId)); in handleDisconnectEdge()
400 N1Md.handleRemoveEdge(OldMMd, Transpose); in handleUpdateCosts()
401 N2Md.handleRemoveEdge(OldMMd, !Transpose); in handleUpdateCosts()
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/Heuristics/
DBriggs.h260 void handleRemoveEdge(Graph::EdgeItr eItr, Graph::NodeItr nItr) { in handleRemoveEdge() function
446 handleRemoveEdge(*aeItr, ynItr); in handleRemoveNode()
/external/llvm/include/llvm/CodeGen/PBQP/
DGraph.h662 Solver->handleRemoveEdge(EId); in removeEdge()