Lines Matching refs:Chain
283 void merge(MachineBasicBlock *BB, BlockChain *Chain) { in merge() argument
288 if (!Chain) { in merge()
296 assert(BB == *Chain->begin() && "Passed BB is not head of Chain."); in merge()
297 assert(Chain->begin() != Chain->end()); in merge()
301 for (MachineBasicBlock *ChainBB : *Chain) { in merge()
303 assert(BlockToChain[ChainBB] == Chain && "Incoming blocks not in chain."); in merge()
439 const BlockChain &Chain, const MachineBasicBlock *LoopHeaderBB,
445 const BlockChain &Chain, const MachineBasicBlock *BB,
451 const MachineBasicBlock *BB, const BlockChain &Chain,
462 BlockChain &Chain, BlockFilterSet *BlockFilter,
466 BlockChain &Chain, BlockFilterSet *BlockFilter,
472 BranchProbability RealSuccProb, const BlockChain &Chain,
475 const MachineBasicBlock *BB, const BlockChain &Chain,
478 const BlockChain &Chain, SmallVectorImpl<MachineBasicBlock *> &WorkList);
493 void buildChain(const MachineBasicBlock *BB, BlockChain &Chain,
531 const BlockChain &Chain, const BlockFilterSet *BlockFilter);
536 const BlockChain &Chain, const BlockFilterSet *BlockFilter);
542 BranchProbability AdjustedSumProb, const BlockChain &Chain,
554 const BlockChain &Chain, const BlockFilterSet *BlockFilter);
623 const BlockChain &Chain, const MachineBasicBlock *LoopHeaderBB, in markChainSuccessors() argument
627 for (MachineBasicBlock *MBB : Chain) { in markChainSuccessors()
628 markBlockSuccessors(Chain, MBB, LoopHeaderBB, BlockFilter); in markChainSuccessors()
639 const BlockChain &Chain, const MachineBasicBlock *MBB, in markBlockSuccessors() argument
650 if (&Chain == &SuccChain || Succ == LoopHeaderBB) in markBlockSuccessors()
672 const MachineBasicBlock *BB, const BlockChain &Chain, in collectViableSuccessors() argument
698 if (SuccChain == &Chain) { in collectViableSuccessors()
781 const BlockChain &Chain, const BlockFilterSet *BlockFilter) { in isProfitableToTailDup() argument
809 collectViableSuccessors(Succ, Chain, BlockFilter, SuccSuccs); in isProfitableToTailDup()
838 || BlockToChain[SuccPred] == &Chain in isProfitableToTailDup()
913 Chain, BlockFilter)) in isProfitableToTailDup()
935 const BlockChain &Chain, const BlockFilterSet *BlockFilter) { in isTrellis() argument
959 PredChain == &Chain || PredChain == BlockToChain[Succ]) in isTrellis()
1030 BranchProbability AdjustedSumProb, const BlockChain &Chain, in getBestTrellisSuccessor() argument
1051 BlockToChain[SuccPred] == &Chain || in getBestTrellisSuccessor()
1083 canTailDuplicateUnplacedPreds(BB, Succ2, Chain, BlockFilter) && in getBestTrellisSuccessor()
1085 Chain, BlockFilter)) { in getBestTrellisSuccessor()
1114 const BlockChain &Chain, const BlockFilterSet *BlockFilter) { in canTailDuplicateUnplacedPreds() argument
1131 || BlockToChain[Pred] == &Chain) in canTailDuplicateUnplacedPreds()
1308 TriangleChain Chain = std::move(Found->second); in precomputeTriangleChains() local
1310 Chain.append(PDom); in precomputeTriangleChains()
1311 TriangleChainMap.insert(std::make_pair(Chain.getKey(), std::move(Chain))); in precomputeTriangleChains()
1323 TriangleChain &Chain = ChainPair.second; in precomputeTriangleChains() local
1327 if (Chain.count() < TriangleChainCount) in precomputeTriangleChains()
1329 MachineBasicBlock *dst = Chain.Edges.back(); in precomputeTriangleChains()
1330 Chain.Edges.pop_back(); in precomputeTriangleChains()
1331 for (MachineBasicBlock *src : reverse(Chain.Edges)) { in precomputeTriangleChains()
1382 BranchProbability RealSuccProb, const BlockChain &Chain, in hasBetterLayoutPredecessor() argument
1513 PredChain == &Chain || Pred != *std::prev(PredChain->end()) || in hasBetterLayoutPredecessor()
1561 const MachineBasicBlock *BB, const BlockChain &Chain, in selectBestSuccessor() argument
1570 collectViableSuccessors(BB, Chain, BlockFilter, Successors); in selectBestSuccessor()
1583 SuccChain != &Chain && Succ == *SuccChain->begin()) in selectBestSuccessor()
1589 if (isTrellis(BB, Successors, Chain, BlockFilter)) in selectBestSuccessor()
1590 return getBestTrellisSuccessor(BB, Successors, AdjustedSumProb, Chain, in selectBestSuccessor()
1607 Chain, BlockFilter)) { in selectBestSuccessor()
1645 if (canTailDuplicateUnplacedPreds(BB, Succ, Chain, BlockFilter) in selectBestSuccessor()
1646 && (isProfitableToTailDup(BB, Succ, BestProb, Chain, BlockFilter))) { in selectBestSuccessor()
1673 const BlockChain &Chain, SmallVectorImpl<MachineBasicBlock *> &WorkList) { in selectBestCandidateBlock() argument
1679 return BlockToChain.lookup(BB) == &Chain; in selectBestCandidateBlock()
1694 if (&SuccChain == &Chain) in selectBestCandidateBlock()
1762 BlockChain &Chain = *BlockToChain[MBB]; in fillWorkLists() local
1763 if (!UpdatedPreds.insert(&Chain).second) in fillWorkLists()
1767 Chain.UnscheduledPredecessors == 0 && in fillWorkLists()
1769 for (MachineBasicBlock *ChainBB : Chain) { in fillWorkLists()
1770 assert(BlockToChain[ChainBB] == &Chain && in fillWorkLists()
1775 if (BlockToChain[Pred] == &Chain) in fillWorkLists()
1777 ++Chain.UnscheduledPredecessors; in fillWorkLists()
1781 if (Chain.UnscheduledPredecessors != 0) in fillWorkLists()
1784 MachineBasicBlock *BB = *Chain.begin(); in fillWorkLists()
1792 const MachineBasicBlock *HeadBB, BlockChain &Chain, in buildChain() argument
1795 assert(BlockToChain[HeadBB] == &Chain && "BlockToChainMap mis-match.\n"); in buildChain()
1799 markChainSuccessors(Chain, LoopHeaderBB, BlockFilter); in buildChain()
1800 MachineBasicBlock *BB = *std::prev(Chain.end()); in buildChain()
1803 assert(BlockToChain[BB] == &Chain && "BlockToChainMap mis-match in loop."); in buildChain()
1804 assert(*std::prev(Chain.end()) == BB && "BB Not found at end of chain."); in buildChain()
1809 auto Result = selectBestSuccessor(BB, Chain, BlockFilter); in buildChain()
1814 Chain, in buildChain()
1821 BestSucc = selectBestCandidateBlock(Chain, BlockWorkList); in buildChain()
1823 BestSucc = selectBestCandidateBlock(Chain, EHPadWorkList); in buildChain()
1826 BestSucc = getFirstUnplacedBlock(Chain, PrevUnplacedBlockIt, BlockFilter); in buildChain()
1837 repeatedlyTailDuplicateBlock(BestSucc, BB, LoopHeaderBB, Chain, in buildChain()
1853 Chain.merge(BestSucc, &SuccChain); in buildChain()
1854 BB = *std::prev(Chain.end()); in buildChain()
1858 << getBlockName(*Chain.begin()) << "\n"); in buildChain()
2167 BlockChain &Chain = *BlockToChain[MBB]; in findBestLoopExit() local
2170 if (MBB != *std::prev(Chain.end())) in findBestLoopExit()
2187 if (&Chain == &SuccChain) { in findBestLoopExit()
2553 BlockChain *Chain = BlockToChain[LoopBB]; in collectLoopBlockSet() local
2554 for (MachineBasicBlock *ChainBB : *Chain) in collectLoopBlockSet()
2669 BlockChain *Chain = in buildCFGChains() local
2687 Chain->merge(NextBB, nullptr); in buildCFGChains()
2952 BlockChain &Chain, BlockFilterSet *BlockFilter, in repeatedlyTailDuplicateBlock() argument
2956 Removed = maybeTailDuplicateBlock(BB, LPred, Chain, BlockFilter, in repeatedlyTailDuplicateBlock()
2973 BlockChain::iterator ChainEnd = Chain.end(); in repeatedlyTailDuplicateBlock()
2976 if (ChainEnd == Chain.begin()) in repeatedlyTailDuplicateBlock()
2979 Removed = maybeTailDuplicateBlock(DupBB, DupPred, Chain, BlockFilter, in repeatedlyTailDuplicateBlock()
2988 LPred = *std::prev(Chain.end()); in repeatedlyTailDuplicateBlock()
2990 markBlockSuccessors(Chain, LPred, LoopHeaderBB, BlockFilter); in repeatedlyTailDuplicateBlock()
3009 BlockChain &Chain, BlockFilterSet *BlockFilter, in maybeTailDuplicateBlock() argument
3031 BlockChain *Chain = BlockToChain[RemBB]; in maybeTailDuplicateBlock() local
3032 InWorkList = Chain->UnscheduledPredecessors == 0; in maybeTailDuplicateBlock()
3033 Chain->remove(RemBB); in maybeTailDuplicateBlock()
3089 || PredChain == &Chain) in maybeTailDuplicateBlock()
3095 if (NewChain != &Chain && NewChain != PredChain) in maybeTailDuplicateBlock()