Lines Matching refs:Chain
270 void merge(MachineBasicBlock *BB, BlockChain *Chain) { in merge() argument
275 if (!Chain) { in merge()
283 assert(BB == *Chain->begin() && "Passed BB is not head of Chain."); in merge()
284 assert(Chain->begin() != Chain->end()); in merge()
288 for (MachineBasicBlock *ChainBB : *Chain) { in merge()
290 assert(BlockToChain[ChainBB] == Chain && "Incoming blocks not in chain."); in merge()
400 const BlockChain &Chain, const MachineBasicBlock *LoopHeaderBB,
406 const BlockChain &Chain, const MachineBasicBlock *BB,
412 const MachineBasicBlock *BB, const BlockChain &Chain,
417 const BlockChain &Chain, const BlockFilterSet *BlockFilter,
422 BlockChain &Chain, BlockFilterSet *BlockFilter,
426 BlockChain &Chain, BlockFilterSet *BlockFilter,
432 BranchProbability RealSuccProb, const BlockChain &Chain,
435 const MachineBasicBlock *BB, const BlockChain &Chain,
438 const BlockChain &Chain, SmallVectorImpl<MachineBasicBlock *> &WorkList);
453 void buildChain(const MachineBasicBlock *BB, BlockChain &Chain,
478 const BlockChain &Chain, const BlockFilterSet *BlockFilter);
483 const BlockChain &Chain, const BlockFilterSet *BlockFilter);
489 BranchProbability AdjustedSumProb, const BlockChain &Chain,
501 const BlockChain &Chain, const BlockFilterSet *BlockFilter);
568 const BlockChain &Chain, const MachineBasicBlock *LoopHeaderBB, in markChainSuccessors() argument
572 for (MachineBasicBlock *MBB : Chain) { in markChainSuccessors()
573 markBlockSuccessors(Chain, MBB, LoopHeaderBB, BlockFilter); in markChainSuccessors()
584 const BlockChain &Chain, const MachineBasicBlock *MBB, in markBlockSuccessors() argument
595 if (&Chain == &SuccChain || Succ == LoopHeaderBB) in markBlockSuccessors()
617 const MachineBasicBlock *BB, const BlockChain &Chain, in collectViableSuccessors() argument
643 if (SuccChain == &Chain) { in collectViableSuccessors()
726 const BlockChain &Chain, const BlockFilterSet *BlockFilter) { in isProfitableToTailDup() argument
754 collectViableSuccessors(Succ, Chain, BlockFilter, SuccSuccs); in isProfitableToTailDup()
783 || BlockToChain[SuccPred] == &Chain in isProfitableToTailDup()
858 Chain, BlockFilter)) in isProfitableToTailDup()
880 const BlockChain &Chain, const BlockFilterSet *BlockFilter) { in isTrellis() argument
904 PredChain == &Chain || PredChain == BlockToChain[Succ]) in isTrellis()
975 BranchProbability AdjustedSumProb, const BlockChain &Chain, in getBestTrellisSuccessor() argument
996 BlockToChain[SuccPred] == &Chain || in getBestTrellisSuccessor()
1028 canTailDuplicateUnplacedPreds(BB, Succ2, Chain, BlockFilter) && in getBestTrellisSuccessor()
1030 Chain, BlockFilter)) { in getBestTrellisSuccessor()
1059 const BlockChain &Chain, const BlockFilterSet *BlockFilter) { in canTailDuplicateUnplacedPreds() argument
1071 || BlockToChain[Pred] == &Chain) in canTailDuplicateUnplacedPreds()
1205 TriangleChain Chain = std::move(Found->second); in precomputeTriangleChains() local
1207 Chain.append(PDom); in precomputeTriangleChains()
1208 TriangleChainMap.insert(std::make_pair(Chain.getKey(), std::move(Chain))); in precomputeTriangleChains()
1220 TriangleChain &Chain = ChainPair.second; in precomputeTriangleChains() local
1224 if (Chain.count() < TriangleChainCount) in precomputeTriangleChains()
1226 MachineBasicBlock *dst = Chain.Edges.back(); in precomputeTriangleChains()
1227 Chain.Edges.pop_back(); in precomputeTriangleChains()
1228 for (MachineBasicBlock *src : reverse(Chain.Edges)) { in precomputeTriangleChains()
1279 BranchProbability RealSuccProb, const BlockChain &Chain, in hasBetterLayoutPredecessor() argument
1409 BlockToChain[Pred] == &Chain || in hasBetterLayoutPredecessor()
1457 const MachineBasicBlock *BB, const BlockChain &Chain, in selectBestSuccessor() argument
1466 collectViableSuccessors(BB, Chain, BlockFilter, Successors); in selectBestSuccessor()
1479 SuccChain != &Chain && Succ == *SuccChain->begin()) in selectBestSuccessor()
1485 if (isTrellis(BB, Successors, Chain, BlockFilter)) in selectBestSuccessor()
1486 return getBestTrellisSuccessor(BB, Successors, AdjustedSumProb, Chain, in selectBestSuccessor()
1503 Chain, BlockFilter)) { in selectBestSuccessor()
1544 if (canTailDuplicateUnplacedPreds(BB, Succ, Chain, BlockFilter) in selectBestSuccessor()
1545 && (isProfitableToTailDup(BB, Succ, BestProb, Chain, BlockFilter))) { in selectBestSuccessor()
1572 const BlockChain &Chain, SmallVectorImpl<MachineBasicBlock *> &WorkList) { in selectBestCandidateBlock() argument
1579 return BlockToChain.lookup(BB) == &Chain; in selectBestCandidateBlock()
1595 if (&SuccChain == &Chain) in selectBestCandidateBlock()
1663 BlockChain &Chain = *BlockToChain[MBB]; in fillWorkLists() local
1664 if (!UpdatedPreds.insert(&Chain).second) in fillWorkLists()
1668 Chain.UnscheduledPredecessors == 0 && in fillWorkLists()
1670 for (MachineBasicBlock *ChainBB : Chain) { in fillWorkLists()
1671 assert(BlockToChain[ChainBB] == &Chain && in fillWorkLists()
1676 if (BlockToChain[Pred] == &Chain) in fillWorkLists()
1678 ++Chain.UnscheduledPredecessors; in fillWorkLists()
1682 if (Chain.UnscheduledPredecessors != 0) in fillWorkLists()
1685 MachineBasicBlock *BB = *Chain.begin(); in fillWorkLists()
1693 const MachineBasicBlock *HeadBB, BlockChain &Chain, in buildChain() argument
1696 assert(BlockToChain[HeadBB] == &Chain && "BlockToChainMap mis-match.\n"); in buildChain()
1700 markChainSuccessors(Chain, LoopHeaderBB, BlockFilter); in buildChain()
1701 MachineBasicBlock *BB = *std::prev(Chain.end()); in buildChain()
1704 assert(BlockToChain[BB] == &Chain && "BlockToChainMap mis-match in loop."); in buildChain()
1705 assert(*std::prev(Chain.end()) == BB && "BB Not found at end of chain."); in buildChain()
1710 auto Result = selectBestSuccessor(BB, Chain, BlockFilter); in buildChain()
1720 BestSucc = selectBestCandidateBlock(Chain, BlockWorkList); in buildChain()
1722 BestSucc = selectBestCandidateBlock(Chain, EHPadWorkList); in buildChain()
1725 BestSucc = getFirstUnplacedBlock(Chain, PrevUnplacedBlockIt, BlockFilter); in buildChain()
1739 if (repeatedlyTailDuplicateBlock(BestSucc, BB, LoopHeaderBB, Chain, in buildChain()
1752 Chain.merge(BestSucc, &SuccChain); in buildChain()
1753 BB = *std::prev(Chain.end()); in buildChain()
1757 << getBlockName(*Chain.begin()) << "\n"); in buildChain()
1860 BlockChain &Chain = *BlockToChain[MBB]; in findBestLoopExit() local
1863 if (MBB != *std::prev(Chain.end())) in findBestLoopExit()
1880 if (&Chain == &SuccChain) { in findBestLoopExit()
2319 BlockChain *Chain = in buildCFGChains() local
2337 Chain->merge(NextBB, nullptr); in buildCFGChains()
2581 BlockChain &Chain, BlockFilterSet *BlockFilter, in repeatedlyTailDuplicateBlock() argument
2585 Removed = maybeTailDuplicateBlock(BB, LPred, Chain, BlockFilter, in repeatedlyTailDuplicateBlock()
2605 BlockChain::iterator ChainEnd = Chain.end(); in repeatedlyTailDuplicateBlock()
2608 if (ChainEnd == Chain.begin()) in repeatedlyTailDuplicateBlock()
2611 Removed = maybeTailDuplicateBlock(DupBB, DupPred, Chain, BlockFilter, in repeatedlyTailDuplicateBlock()
2620 LPred = *std::prev(Chain.end()); in repeatedlyTailDuplicateBlock()
2622 markBlockSuccessors(Chain, LPred, LoopHeaderBB, BlockFilter); in repeatedlyTailDuplicateBlock()
2642 BlockChain &Chain, BlockFilterSet *BlockFilter, in maybeTailDuplicateBlock() argument
2664 BlockChain *Chain = BlockToChain[RemBB]; in maybeTailDuplicateBlock() local
2665 InWorkList = Chain->UnscheduledPredecessors == 0; in maybeTailDuplicateBlock()
2666 Chain->remove(RemBB); in maybeTailDuplicateBlock()
2717 || PredChain == &Chain) in maybeTailDuplicateBlock()
2723 if (NewChain != &Chain && NewChain != PredChain) in maybeTailDuplicateBlock()