Home
last modified time | relevance | path

Searched refs:getEdge (Results 1 – 8 of 8) sorted by relevance

/llvm-project-15.0.7/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h218 EdgeEntry &NE = getEdge(EId); in addConstructedEdge()
524 return getEdge(EId).Costs; in getEdgeCostsPtr()
531 return *getEdge(EId).Costs; in getEdgeCosts()
535 return getEdge(EId).Metadata; in getEdgeMetadata()
539 return getEdge(EId).Metadata; in getEdgeMetadata()
546 return getEdge(EId).getN1Id(); in getEdgeNode1Id()
553 return getEdge(EId).getN2Id(); in getEdgeNode2Id()
561 EdgeEntry &E = getEdge(EId); in getEdgeOtherNodeId()
629 EdgeEntry &E = getEdge(EId); in disconnectEdge()
645 EdgeEntry &E = getEdge(EId); in reconnectEdge()
[all …]
/llvm-project-15.0.7/bolt/lib/Passes/
H A DHFSortPlus.cpp91 Edge *getEdge(Chain *Other) const { in getEdge() function in llvm::bolt::__anonbf028ece0111::Chain
211 Edge *CurEdge = getEdge(TargetChain); in mergeEdges()
296 Edge *CurEdge = NodeChain[F]->getEdge(NodeChain[Succ]); in initialize()
299 assert(NodeChain[Succ]->getEdge(NodeChain[F]) != nullptr); in initialize()
350 Edge *Edge = Chain->getEdge(Chain); in shortCalls()
H A DExtTSPReorderAlgorithm.cpp242 Edge *getEdge(Chain *Other) const { in getEdge() function in llvm::bolt::Chain
374 Edge *curEdge = getEdge(TargetChain); in mergeEdges()
525 Edge *CurEdge = Block.CurChain->getEdge(SuccBlock->CurChain); in initialize()
528 assert(SuccBlock->CurChain->getEdge(Block.CurChain) != nullptr); in initialize()
703 class Edge *EdgePP = ChainPred->getEdge(ChainPred); in mergeGain()
802 Edge *SelfEdge = Into->getEdge(Into); in mergeChains()
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DCodeLayout.cpp246 ChainEdge *getEdge(Chain *Other) const { in getEdge() function in __anon97d149770111::Chain
377 auto CurEdge = getEdge(TargetChain); in mergeEdges()
519 auto CurEdge = Block.CurChain->getEdge(SuccBlock->CurChain); in initialize()
522 assert(SuccBlock->CurChain->getEdge(Block.CurChain) != nullptr); in initialize()
692 auto EdgePP = ChainPred->getEdge(ChainPred); in getBestMergeGain()
823 auto SelfEdge = Into->getEdge(Into); in mergeChains()
/llvm-project-15.0.7/llvm/lib/IR/
H A DSafepointIRVerifier.cpp76 static const Use& getEdge(const_pred_iterator &PredIt) { in getEdge() function in __anon2f71f24a0111::CFGDeadness
89 if (!isDeadEdge(&getEdge(PredIt))) in hasLiveIncomingEdge()
633 if (PBBS && !CD.isDeadEdge(&CFGDeadness::getEdge(PredIt))) in recalculateBBsStates()
/llvm-project-15.0.7/llvm/utils/TableGen/GlobalISel/
H A DGIMatchTree.h325 const GIMatchDagEdge *getEdge(unsigned Idx) const { in getEdge() function
328 GIMatchDagEdge *getEdge(unsigned Idx) { in getEdge() function
H A DGIMatchTree.cpp292 PrintNote("Edge " + llvm::to_string(*Leaf.getEdge(EdgeIdx))); in runStep()
669 const auto &E = Leaf.value().getEdge(EIdx); in repartition()
739 const GIMatchDagEdge *E = Leaf.getEdge(EIdx); in applyForPartition()
/llvm-project-15.0.7/llvm/lib/Passes/
H A DStandardInstrumentations.cpp1283 const DisplayEdge &getEdge(const DisplayNode &To) const { in getEdge() function in __anone1b304962011::DisplayNode
1291 return getEdge(Sink).getValue(); in getEdgeSourceLabel()
1375 return attribute(From.getEdge(To).getColour()); in getEdgeColorAttr()