Lines Matching refs:Chain
305 void merge(MachineBasicBlock *BB, BlockChain *Chain) { in merge() argument
310 if (!Chain) { in merge()
318 assert(BB == *Chain->begin() && "Passed BB is not head of Chain."); in merge()
319 assert(Chain->begin() != Chain->end()); in merge()
323 for (MachineBasicBlock *ChainBB : *Chain) { in merge()
325 assert(BlockToChain[ChainBB] == Chain && "Incoming blocks not in chain."); in merge()
461 const BlockChain &Chain, const MachineBasicBlock *LoopHeaderBB,
467 const BlockChain &Chain, const MachineBasicBlock *BB,
473 const MachineBasicBlock *BB, const BlockChain &Chain,
484 BlockChain &Chain, BlockFilterSet *BlockFilter,
488 BlockChain &Chain, BlockFilterSet *BlockFilter,
494 BranchProbability RealSuccProb, const BlockChain &Chain,
497 const MachineBasicBlock *BB, const BlockChain &Chain,
500 const BlockChain &Chain, SmallVectorImpl<MachineBasicBlock *> &WorkList);
515 void buildChain(const MachineBasicBlock *BB, BlockChain &Chain,
553 const BlockChain &Chain, const BlockFilterSet *BlockFilter);
558 const BlockChain &Chain, const BlockFilterSet *BlockFilter);
564 BranchProbability AdjustedSumProb, const BlockChain &Chain,
576 const BlockChain &Chain, const BlockFilterSet *BlockFilter);
654 const BlockChain &Chain, const MachineBasicBlock *LoopHeaderBB, in markChainSuccessors() argument
658 for (MachineBasicBlock *MBB : Chain) { in markChainSuccessors()
659 markBlockSuccessors(Chain, MBB, LoopHeaderBB, BlockFilter); in markChainSuccessors()
670 const BlockChain &Chain, const MachineBasicBlock *MBB, in markBlockSuccessors() argument
681 if (&Chain == &SuccChain || Succ == LoopHeaderBB) in markBlockSuccessors()
703 const MachineBasicBlock *BB, const BlockChain &Chain, in collectViableSuccessors() argument
729 if (SuccChain == &Chain) { in collectViableSuccessors()
812 const BlockChain &Chain, const BlockFilterSet *BlockFilter) { in isProfitableToTailDup() argument
840 collectViableSuccessors(Succ, Chain, BlockFilter, SuccSuccs); in isProfitableToTailDup()
869 || BlockToChain[SuccPred] == &Chain in isProfitableToTailDup()
944 Chain, BlockFilter)) in isProfitableToTailDup()
966 const BlockChain &Chain, const BlockFilterSet *BlockFilter) { in isTrellis() argument
990 PredChain == &Chain || PredChain == BlockToChain[Succ]) in isTrellis()
1061 BranchProbability AdjustedSumProb, const BlockChain &Chain, in getBestTrellisSuccessor() argument
1082 BlockToChain[SuccPred] == &Chain || in getBestTrellisSuccessor()
1114 canTailDuplicateUnplacedPreds(BB, Succ2, Chain, BlockFilter) && in getBestTrellisSuccessor()
1116 Chain, BlockFilter)) { in getBestTrellisSuccessor()
1145 const BlockChain &Chain, const BlockFilterSet *BlockFilter) { in canTailDuplicateUnplacedPreds() argument
1162 || (BlockToChain[Pred] == &Chain && !Succ->succ_empty())) in canTailDuplicateUnplacedPreds()
1339 TriangleChain Chain = std::move(Found->second); in precomputeTriangleChains() local
1341 Chain.append(PDom); in precomputeTriangleChains()
1342 TriangleChainMap.insert(std::make_pair(Chain.getKey(), std::move(Chain))); in precomputeTriangleChains()
1354 TriangleChain &Chain = ChainPair.second; in precomputeTriangleChains() local
1358 if (Chain.count() < TriangleChainCount) in precomputeTriangleChains()
1360 MachineBasicBlock *dst = Chain.Edges.back(); in precomputeTriangleChains()
1361 Chain.Edges.pop_back(); in precomputeTriangleChains()
1362 for (MachineBasicBlock *src : reverse(Chain.Edges)) { in precomputeTriangleChains()
1413 BranchProbability RealSuccProb, const BlockChain &Chain, in hasBetterLayoutPredecessor() argument
1544 PredChain == &Chain || Pred != *std::prev(PredChain->end()) || in hasBetterLayoutPredecessor()
1592 const MachineBasicBlock *BB, const BlockChain &Chain, in selectBestSuccessor() argument
1601 collectViableSuccessors(BB, Chain, BlockFilter, Successors); in selectBestSuccessor()
1614 SuccChain != &Chain && Succ == *SuccChain->begin()) in selectBestSuccessor()
1620 if (isTrellis(BB, Successors, Chain, BlockFilter)) in selectBestSuccessor()
1621 return getBestTrellisSuccessor(BB, Successors, AdjustedSumProb, Chain, in selectBestSuccessor()
1638 Chain, BlockFilter)) { in selectBestSuccessor()
1676 if (canTailDuplicateUnplacedPreds(BB, Succ, Chain, BlockFilter) in selectBestSuccessor()
1677 && (isProfitableToTailDup(BB, Succ, BestProb, Chain, BlockFilter))) { in selectBestSuccessor()
1704 const BlockChain &Chain, SmallVectorImpl<MachineBasicBlock *> &WorkList) { in selectBestCandidateBlock() argument
1710 return BlockToChain.lookup(BB) == &Chain; in selectBestCandidateBlock()
1725 if (&SuccChain == &Chain) in selectBestCandidateBlock()
1794 BlockChain &Chain = *BlockToChain[MBB]; in fillWorkLists() local
1795 if (!UpdatedPreds.insert(&Chain).second) in fillWorkLists()
1799 Chain.UnscheduledPredecessors == 0 && in fillWorkLists()
1801 for (MachineBasicBlock *ChainBB : Chain) { in fillWorkLists()
1802 assert(BlockToChain[ChainBB] == &Chain && in fillWorkLists()
1807 if (BlockToChain[Pred] == &Chain) in fillWorkLists()
1809 ++Chain.UnscheduledPredecessors; in fillWorkLists()
1813 if (Chain.UnscheduledPredecessors != 0) in fillWorkLists()
1816 MachineBasicBlock *BB = *Chain.begin(); in fillWorkLists()
1824 const MachineBasicBlock *HeadBB, BlockChain &Chain, in buildChain() argument
1827 assert(BlockToChain[HeadBB] == &Chain && "BlockToChainMap mis-match.\n"); in buildChain()
1831 markChainSuccessors(Chain, LoopHeaderBB, BlockFilter); in buildChain()
1832 MachineBasicBlock *BB = *std::prev(Chain.end()); in buildChain()
1835 assert(BlockToChain[BB] == &Chain && "BlockToChainMap mis-match in loop."); in buildChain()
1836 assert(*std::prev(Chain.end()) == BB && "BB Not found at end of chain."); in buildChain()
1841 auto Result = selectBestSuccessor(BB, Chain, BlockFilter); in buildChain()
1846 Chain, in buildChain()
1853 BestSucc = selectBestCandidateBlock(Chain, BlockWorkList); in buildChain()
1855 BestSucc = selectBestCandidateBlock(Chain, EHPadWorkList); in buildChain()
1858 BestSucc = getFirstUnplacedBlock(Chain, PrevUnplacedBlockIt, BlockFilter); in buildChain()
1869 repeatedlyTailDuplicateBlock(BestSucc, BB, LoopHeaderBB, Chain, in buildChain()
1885 Chain.merge(BestSucc, &SuccChain); in buildChain()
1886 BB = *std::prev(Chain.end()); in buildChain()
1890 << getBlockName(*Chain.begin()) << "\n"); in buildChain()
2202 BlockChain &Chain = *BlockToChain[MBB]; in findBestLoopExit() local
2205 if (MBB != *std::prev(Chain.end())) in findBestLoopExit()
2222 if (&Chain == &SuccChain) { in findBestLoopExit()
2587 BlockChain *Chain = BlockToChain[LoopBB]; in collectLoopBlockSet() local
2588 for (MachineBasicBlock *ChainBB : *Chain) in collectLoopBlockSet()
2703 BlockChain *Chain = in buildCFGChains() local
2721 Chain->merge(NextBB, nullptr); in buildCFGChains()
3021 BlockChain &Chain, BlockFilterSet *BlockFilter, in repeatedlyTailDuplicateBlock() argument
3025 Removed = maybeTailDuplicateBlock(BB, LPred, Chain, BlockFilter, in repeatedlyTailDuplicateBlock()
3042 BlockChain::iterator ChainEnd = Chain.end(); in repeatedlyTailDuplicateBlock()
3045 if (ChainEnd == Chain.begin()) in repeatedlyTailDuplicateBlock()
3048 Removed = maybeTailDuplicateBlock(DupBB, DupPred, Chain, BlockFilter, in repeatedlyTailDuplicateBlock()
3057 LPred = *std::prev(Chain.end()); in repeatedlyTailDuplicateBlock()
3059 markBlockSuccessors(Chain, LPred, LoopHeaderBB, BlockFilter); in repeatedlyTailDuplicateBlock()
3078 BlockChain &Chain, BlockFilterSet *BlockFilter, in maybeTailDuplicateBlock() argument
3100 BlockChain *Chain = BlockToChain[RemBB]; in maybeTailDuplicateBlock() local
3101 InWorkList = Chain->UnscheduledPredecessors == 0; in maybeTailDuplicateBlock()
3102 Chain->remove(RemBB); in maybeTailDuplicateBlock()
3158 || PredChain == &Chain) in maybeTailDuplicateBlock()
3164 if (NewChain != &Chain && NewChain != PredChain) in maybeTailDuplicateBlock()