Lines Matching refs:Chain
294 void merge(MachineBasicBlock *BB, BlockChain *Chain) { in merge() argument
299 if (!Chain) { in merge()
307 assert(BB == *Chain->begin() && "Passed BB is not head of Chain."); in merge()
308 assert(Chain->begin() != Chain->end()); in merge()
312 for (MachineBasicBlock *ChainBB : *Chain) { in merge()
314 assert(BlockToChain[ChainBB] == Chain && "Incoming blocks not in chain."); in merge()
450 const BlockChain &Chain, const MachineBasicBlock *LoopHeaderBB,
456 const BlockChain &Chain, const MachineBasicBlock *BB,
462 const MachineBasicBlock *BB, const BlockChain &Chain,
473 BlockChain &Chain, BlockFilterSet *BlockFilter,
477 BlockChain &Chain, BlockFilterSet *BlockFilter,
483 BranchProbability RealSuccProb, const BlockChain &Chain,
486 const MachineBasicBlock *BB, const BlockChain &Chain,
489 const BlockChain &Chain, SmallVectorImpl<MachineBasicBlock *> &WorkList);
504 void buildChain(const MachineBasicBlock *BB, BlockChain &Chain,
542 const BlockChain &Chain, const BlockFilterSet *BlockFilter);
547 const BlockChain &Chain, const BlockFilterSet *BlockFilter);
553 BranchProbability AdjustedSumProb, const BlockChain &Chain,
565 const BlockChain &Chain, const BlockFilterSet *BlockFilter);
643 const BlockChain &Chain, const MachineBasicBlock *LoopHeaderBB, in markChainSuccessors() argument
647 for (MachineBasicBlock *MBB : Chain) { in markChainSuccessors()
648 markBlockSuccessors(Chain, MBB, LoopHeaderBB, BlockFilter); in markChainSuccessors()
659 const BlockChain &Chain, const MachineBasicBlock *MBB, in markBlockSuccessors() argument
670 if (&Chain == &SuccChain || Succ == LoopHeaderBB) in markBlockSuccessors()
692 const MachineBasicBlock *BB, const BlockChain &Chain, in collectViableSuccessors() argument
718 if (SuccChain == &Chain) { in collectViableSuccessors()
801 const BlockChain &Chain, const BlockFilterSet *BlockFilter) { in isProfitableToTailDup() argument
829 collectViableSuccessors(Succ, Chain, BlockFilter, SuccSuccs); in isProfitableToTailDup()
858 || BlockToChain[SuccPred] == &Chain in isProfitableToTailDup()
933 Chain, BlockFilter)) in isProfitableToTailDup()
955 const BlockChain &Chain, const BlockFilterSet *BlockFilter) { in isTrellis() argument
979 PredChain == &Chain || PredChain == BlockToChain[Succ]) in isTrellis()
1050 BranchProbability AdjustedSumProb, const BlockChain &Chain, in getBestTrellisSuccessor() argument
1071 BlockToChain[SuccPred] == &Chain || in getBestTrellisSuccessor()
1103 canTailDuplicateUnplacedPreds(BB, Succ2, Chain, BlockFilter) && in getBestTrellisSuccessor()
1105 Chain, BlockFilter)) { in getBestTrellisSuccessor()
1134 const BlockChain &Chain, const BlockFilterSet *BlockFilter) { in canTailDuplicateUnplacedPreds() argument
1151 || BlockToChain[Pred] == &Chain) in canTailDuplicateUnplacedPreds()
1328 TriangleChain Chain = std::move(Found->second); in precomputeTriangleChains() local
1330 Chain.append(PDom); in precomputeTriangleChains()
1331 TriangleChainMap.insert(std::make_pair(Chain.getKey(), std::move(Chain))); in precomputeTriangleChains()
1343 TriangleChain &Chain = ChainPair.second; in precomputeTriangleChains() local
1347 if (Chain.count() < TriangleChainCount) in precomputeTriangleChains()
1349 MachineBasicBlock *dst = Chain.Edges.back(); in precomputeTriangleChains()
1350 Chain.Edges.pop_back(); in precomputeTriangleChains()
1351 for (MachineBasicBlock *src : reverse(Chain.Edges)) { in precomputeTriangleChains()
1402 BranchProbability RealSuccProb, const BlockChain &Chain, in hasBetterLayoutPredecessor() argument
1533 PredChain == &Chain || Pred != *std::prev(PredChain->end()) || in hasBetterLayoutPredecessor()
1581 const MachineBasicBlock *BB, const BlockChain &Chain, in selectBestSuccessor() argument
1590 collectViableSuccessors(BB, Chain, BlockFilter, Successors); in selectBestSuccessor()
1603 SuccChain != &Chain && Succ == *SuccChain->begin()) in selectBestSuccessor()
1609 if (isTrellis(BB, Successors, Chain, BlockFilter)) in selectBestSuccessor()
1610 return getBestTrellisSuccessor(BB, Successors, AdjustedSumProb, Chain, in selectBestSuccessor()
1627 Chain, BlockFilter)) { in selectBestSuccessor()
1665 if (canTailDuplicateUnplacedPreds(BB, Succ, Chain, BlockFilter) in selectBestSuccessor()
1666 && (isProfitableToTailDup(BB, Succ, BestProb, Chain, BlockFilter))) { in selectBestSuccessor()
1693 const BlockChain &Chain, SmallVectorImpl<MachineBasicBlock *> &WorkList) { in selectBestCandidateBlock() argument
1699 return BlockToChain.lookup(BB) == &Chain; in selectBestCandidateBlock()
1714 if (&SuccChain == &Chain) in selectBestCandidateBlock()
1782 BlockChain &Chain = *BlockToChain[MBB]; in fillWorkLists() local
1783 if (!UpdatedPreds.insert(&Chain).second) in fillWorkLists()
1787 Chain.UnscheduledPredecessors == 0 && in fillWorkLists()
1789 for (MachineBasicBlock *ChainBB : Chain) { in fillWorkLists()
1790 assert(BlockToChain[ChainBB] == &Chain && in fillWorkLists()
1795 if (BlockToChain[Pred] == &Chain) in fillWorkLists()
1797 ++Chain.UnscheduledPredecessors; in fillWorkLists()
1801 if (Chain.UnscheduledPredecessors != 0) in fillWorkLists()
1804 MachineBasicBlock *BB = *Chain.begin(); in fillWorkLists()
1812 const MachineBasicBlock *HeadBB, BlockChain &Chain, in buildChain() argument
1815 assert(BlockToChain[HeadBB] == &Chain && "BlockToChainMap mis-match.\n"); in buildChain()
1819 markChainSuccessors(Chain, LoopHeaderBB, BlockFilter); in buildChain()
1820 MachineBasicBlock *BB = *std::prev(Chain.end()); in buildChain()
1823 assert(BlockToChain[BB] == &Chain && "BlockToChainMap mis-match in loop."); in buildChain()
1824 assert(*std::prev(Chain.end()) == BB && "BB Not found at end of chain."); in buildChain()
1829 auto Result = selectBestSuccessor(BB, Chain, BlockFilter); in buildChain()
1834 Chain, in buildChain()
1841 BestSucc = selectBestCandidateBlock(Chain, BlockWorkList); in buildChain()
1843 BestSucc = selectBestCandidateBlock(Chain, EHPadWorkList); in buildChain()
1846 BestSucc = getFirstUnplacedBlock(Chain, PrevUnplacedBlockIt, BlockFilter); in buildChain()
1857 repeatedlyTailDuplicateBlock(BestSucc, BB, LoopHeaderBB, Chain, in buildChain()
1873 Chain.merge(BestSucc, &SuccChain); in buildChain()
1874 BB = *std::prev(Chain.end()); in buildChain()
1878 << getBlockName(*Chain.begin()) << "\n"); in buildChain()
2189 BlockChain &Chain = *BlockToChain[MBB]; in findBestLoopExit() local
2192 if (MBB != *std::prev(Chain.end())) in findBestLoopExit()
2209 if (&Chain == &SuccChain) { in findBestLoopExit()
2575 BlockChain *Chain = BlockToChain[LoopBB]; in collectLoopBlockSet() local
2576 for (MachineBasicBlock *ChainBB : *Chain) in collectLoopBlockSet()
2691 BlockChain *Chain = in buildCFGChains() local
2709 Chain->merge(NextBB, nullptr); in buildCFGChains()
2987 BlockChain &Chain, BlockFilterSet *BlockFilter, in repeatedlyTailDuplicateBlock() argument
2991 Removed = maybeTailDuplicateBlock(BB, LPred, Chain, BlockFilter, in repeatedlyTailDuplicateBlock()
3008 BlockChain::iterator ChainEnd = Chain.end(); in repeatedlyTailDuplicateBlock()
3011 if (ChainEnd == Chain.begin()) in repeatedlyTailDuplicateBlock()
3014 Removed = maybeTailDuplicateBlock(DupBB, DupPred, Chain, BlockFilter, in repeatedlyTailDuplicateBlock()
3023 LPred = *std::prev(Chain.end()); in repeatedlyTailDuplicateBlock()
3025 markBlockSuccessors(Chain, LPred, LoopHeaderBB, BlockFilter); in repeatedlyTailDuplicateBlock()
3044 BlockChain &Chain, BlockFilterSet *BlockFilter, in maybeTailDuplicateBlock() argument
3066 BlockChain *Chain = BlockToChain[RemBB]; in maybeTailDuplicateBlock() local
3067 InWorkList = Chain->UnscheduledPredecessors == 0; in maybeTailDuplicateBlock()
3068 Chain->remove(RemBB); in maybeTailDuplicateBlock()
3124 || PredChain == &Chain) in maybeTailDuplicateBlock()
3130 if (NewChain != &Chain && NewChain != PredChain) in maybeTailDuplicateBlock()