Home
last modified time | relevance | path

Searched refs:CurChain (Results 1 – 2 of 2) sorted by relevance

/src/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DCodeLayout.cpp246 ChainT *CurChain{nullptr}; member
337 Nodes[Idx]->CurChain = this; in merge()
376 : SrcChain(Jump->Source->CurChain), DstChain(Jump->Target->CurChain), in ChainEdge()
664 Node.CurChain = &AllChains.back(); in initialize()
675 ChainEdge *CurEdge = PredNode.CurChain->getEdge(SuccNode->CurChain); in initialize()
678 assert(SuccNode->CurChain->getEdge(PredNode.CurChain) != nullptr); in initialize()
684 PredNode.CurChain->addEdge(SuccNode->CurChain, &AllEdges.back()); in initialize()
685 SuccNode->CurChain->addEdge(PredNode.CurChain, &AllEdges.back()); in initialize()
733 mergeChains(Node.CurChain, NextBlock->CurChain, 0, MergeTypeT::X_Y); in mergeForcedPairs()
813 ChainT *SrcChain = AllNodes[SrcBB].CurChain; in mergeColdChains()
[all …]
/src/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DLoadStoreVectorizer.cpp617 auto &CurChain = Ret.back(); in splitChainByContiguity() local
618 const ChainElem &Prev = CurChain.back(); in splitChainByContiguity()
632 CurChain.push_back(*It); in splitChainByContiguity()