Lines Matching refs:Chain
281 void merge(MachineBasicBlock *BB, BlockChain *Chain) { in merge() argument
286 if (!Chain) { in merge()
294 assert(BB == *Chain->begin() && "Passed BB is not head of Chain."); in merge()
295 assert(Chain->begin() != Chain->end()); in merge()
299 for (MachineBasicBlock *ChainBB : *Chain) { in merge()
301 assert(BlockToChain[ChainBB] == Chain && "Incoming blocks not in chain."); in merge()
437 const BlockChain &Chain, const MachineBasicBlock *LoopHeaderBB,
443 const BlockChain &Chain, const MachineBasicBlock *BB,
449 const MachineBasicBlock *BB, const BlockChain &Chain,
460 BlockChain &Chain, BlockFilterSet *BlockFilter,
464 BlockChain &Chain, BlockFilterSet *BlockFilter,
470 BranchProbability RealSuccProb, const BlockChain &Chain,
473 const MachineBasicBlock *BB, const BlockChain &Chain,
476 const BlockChain &Chain, SmallVectorImpl<MachineBasicBlock *> &WorkList);
491 void buildChain(const MachineBasicBlock *BB, BlockChain &Chain,
529 const BlockChain &Chain, const BlockFilterSet *BlockFilter);
534 const BlockChain &Chain, const BlockFilterSet *BlockFilter);
540 BranchProbability AdjustedSumProb, const BlockChain &Chain,
552 const BlockChain &Chain, const BlockFilterSet *BlockFilter);
621 const BlockChain &Chain, const MachineBasicBlock *LoopHeaderBB, in markChainSuccessors() argument
625 for (MachineBasicBlock *MBB : Chain) { in markChainSuccessors()
626 markBlockSuccessors(Chain, MBB, LoopHeaderBB, BlockFilter); in markChainSuccessors()
637 const BlockChain &Chain, const MachineBasicBlock *MBB, in markBlockSuccessors() argument
648 if (&Chain == &SuccChain || Succ == LoopHeaderBB) in markBlockSuccessors()
670 const MachineBasicBlock *BB, const BlockChain &Chain, in collectViableSuccessors() argument
696 if (SuccChain == &Chain) { in collectViableSuccessors()
779 const BlockChain &Chain, const BlockFilterSet *BlockFilter) { in isProfitableToTailDup() argument
807 collectViableSuccessors(Succ, Chain, BlockFilter, SuccSuccs); in isProfitableToTailDup()
836 || BlockToChain[SuccPred] == &Chain in isProfitableToTailDup()
911 Chain, BlockFilter)) in isProfitableToTailDup()
933 const BlockChain &Chain, const BlockFilterSet *BlockFilter) { in isTrellis() argument
957 PredChain == &Chain || PredChain == BlockToChain[Succ]) in isTrellis()
1028 BranchProbability AdjustedSumProb, const BlockChain &Chain, in getBestTrellisSuccessor() argument
1049 BlockToChain[SuccPred] == &Chain || in getBestTrellisSuccessor()
1081 canTailDuplicateUnplacedPreds(BB, Succ2, Chain, BlockFilter) && in getBestTrellisSuccessor()
1083 Chain, BlockFilter)) { in getBestTrellisSuccessor()
1112 const BlockChain &Chain, const BlockFilterSet *BlockFilter) { in canTailDuplicateUnplacedPreds() argument
1129 || BlockToChain[Pred] == &Chain) in canTailDuplicateUnplacedPreds()
1306 TriangleChain Chain = std::move(Found->second); in precomputeTriangleChains() local
1308 Chain.append(PDom); in precomputeTriangleChains()
1309 TriangleChainMap.insert(std::make_pair(Chain.getKey(), std::move(Chain))); in precomputeTriangleChains()
1321 TriangleChain &Chain = ChainPair.second; in precomputeTriangleChains() local
1325 if (Chain.count() < TriangleChainCount) in precomputeTriangleChains()
1327 MachineBasicBlock *dst = Chain.Edges.back(); in precomputeTriangleChains()
1328 Chain.Edges.pop_back(); in precomputeTriangleChains()
1329 for (MachineBasicBlock *src : reverse(Chain.Edges)) { in precomputeTriangleChains()
1380 BranchProbability RealSuccProb, const BlockChain &Chain, in hasBetterLayoutPredecessor() argument
1511 PredChain == &Chain || Pred != *std::prev(PredChain->end()) || in hasBetterLayoutPredecessor()
1559 const MachineBasicBlock *BB, const BlockChain &Chain, in selectBestSuccessor() argument
1568 collectViableSuccessors(BB, Chain, BlockFilter, Successors); in selectBestSuccessor()
1581 SuccChain != &Chain && Succ == *SuccChain->begin()) in selectBestSuccessor()
1587 if (isTrellis(BB, Successors, Chain, BlockFilter)) in selectBestSuccessor()
1588 return getBestTrellisSuccessor(BB, Successors, AdjustedSumProb, Chain, in selectBestSuccessor()
1605 Chain, BlockFilter)) { in selectBestSuccessor()
1643 if (canTailDuplicateUnplacedPreds(BB, Succ, Chain, BlockFilter) in selectBestSuccessor()
1644 && (isProfitableToTailDup(BB, Succ, BestProb, Chain, BlockFilter))) { in selectBestSuccessor()
1671 const BlockChain &Chain, SmallVectorImpl<MachineBasicBlock *> &WorkList) { in selectBestCandidateBlock() argument
1677 return BlockToChain.lookup(BB) == &Chain; in selectBestCandidateBlock()
1692 if (&SuccChain == &Chain) in selectBestCandidateBlock()
1760 BlockChain &Chain = *BlockToChain[MBB]; in fillWorkLists() local
1761 if (!UpdatedPreds.insert(&Chain).second) in fillWorkLists()
1765 Chain.UnscheduledPredecessors == 0 && in fillWorkLists()
1767 for (MachineBasicBlock *ChainBB : Chain) { in fillWorkLists()
1768 assert(BlockToChain[ChainBB] == &Chain && in fillWorkLists()
1773 if (BlockToChain[Pred] == &Chain) in fillWorkLists()
1775 ++Chain.UnscheduledPredecessors; in fillWorkLists()
1779 if (Chain.UnscheduledPredecessors != 0) in fillWorkLists()
1782 MachineBasicBlock *BB = *Chain.begin(); in fillWorkLists()
1790 const MachineBasicBlock *HeadBB, BlockChain &Chain, in buildChain() argument
1793 assert(BlockToChain[HeadBB] == &Chain && "BlockToChainMap mis-match.\n"); in buildChain()
1797 markChainSuccessors(Chain, LoopHeaderBB, BlockFilter); in buildChain()
1798 MachineBasicBlock *BB = *std::prev(Chain.end()); in buildChain()
1801 assert(BlockToChain[BB] == &Chain && "BlockToChainMap mis-match in loop."); in buildChain()
1802 assert(*std::prev(Chain.end()) == BB && "BB Not found at end of chain."); in buildChain()
1807 auto Result = selectBestSuccessor(BB, Chain, BlockFilter); in buildChain()
1812 Chain, in buildChain()
1819 BestSucc = selectBestCandidateBlock(Chain, BlockWorkList); in buildChain()
1821 BestSucc = selectBestCandidateBlock(Chain, EHPadWorkList); in buildChain()
1824 BestSucc = getFirstUnplacedBlock(Chain, PrevUnplacedBlockIt, BlockFilter); in buildChain()
1835 repeatedlyTailDuplicateBlock(BestSucc, BB, LoopHeaderBB, Chain, in buildChain()
1851 Chain.merge(BestSucc, &SuccChain); in buildChain()
1852 BB = *std::prev(Chain.end()); in buildChain()
1856 << getBlockName(*Chain.begin()) << "\n"); in buildChain()
2165 BlockChain &Chain = *BlockToChain[MBB]; in findBestLoopExit() local
2168 if (MBB != *std::prev(Chain.end())) in findBestLoopExit()
2185 if (&Chain == &SuccChain) { in findBestLoopExit()
2655 BlockChain *Chain = in buildCFGChains() local
2673 Chain->merge(NextBB, nullptr); in buildCFGChains()
2938 BlockChain &Chain, BlockFilterSet *BlockFilter, in repeatedlyTailDuplicateBlock() argument
2942 Removed = maybeTailDuplicateBlock(BB, LPred, Chain, BlockFilter, in repeatedlyTailDuplicateBlock()
2959 BlockChain::iterator ChainEnd = Chain.end(); in repeatedlyTailDuplicateBlock()
2962 if (ChainEnd == Chain.begin()) in repeatedlyTailDuplicateBlock()
2965 Removed = maybeTailDuplicateBlock(DupBB, DupPred, Chain, BlockFilter, in repeatedlyTailDuplicateBlock()
2974 LPred = *std::prev(Chain.end()); in repeatedlyTailDuplicateBlock()
2976 markBlockSuccessors(Chain, LPred, LoopHeaderBB, BlockFilter); in repeatedlyTailDuplicateBlock()
2995 BlockChain &Chain, BlockFilterSet *BlockFilter, in maybeTailDuplicateBlock() argument
3017 BlockChain *Chain = BlockToChain[RemBB]; in maybeTailDuplicateBlock() local
3018 InWorkList = Chain->UnscheduledPredecessors == 0; in maybeTailDuplicateBlock()
3019 Chain->remove(RemBB); in maybeTailDuplicateBlock()
3080 || PredChain == &Chain) in maybeTailDuplicateBlock()
3086 if (NewChain != &Chain && NewChain != PredChain) in maybeTailDuplicateBlock()