Lines Matching refs:BlockToChain

228   BlockToChainMapType &BlockToChain;  member in __anon127788320111::BlockChain
236 BlockChain(BlockToChainMapType &BlockToChain, MachineBasicBlock *BB) in BlockChain() argument
237 : Blocks(1, BB), BlockToChain(BlockToChain) { in BlockChain()
239 BlockToChain[BB] = this; in BlockChain()
276 assert(!BlockToChain[BB] && in merge()
279 BlockToChain[BB] = this; in merge()
290 assert(BlockToChain[ChainBB] == Chain && "Incoming blocks not in chain."); in merge()
291 BlockToChain[ChainBB] = this; in merge()
387 DenseMap<const MachineBasicBlock *, BlockChain *> BlockToChain; member in __anon127788320111::MachineBlockPlacement
593 BlockChain &SuccChain = *BlockToChain[Succ]; in markBlockSuccessors()
642 BlockChain *SuccChain = BlockToChain[Succ]; in collectViableSuccessors()
783 || BlockToChain[SuccPred] == &Chain in isProfitableToTailDup()
857 !hasBetterLayoutPredecessor(Succ, PDom, *BlockToChain[PDom], UProb, UProb, in isProfitableToTailDup()
902 const BlockChain *PredChain = BlockToChain[SuccPred]; in isTrellis()
904 PredChain == &Chain || PredChain == BlockToChain[Succ]) in isTrellis()
996 BlockToChain[SuccPred] == &Chain || in getBestTrellisSuccessor()
997 BlockToChain[SuccPred] == BlockToChain[Succ]) in getBestTrellisSuccessor()
1071 || BlockToChain[Pred] == &Chain) in canTailDuplicateUnplacedPreds()
1407 if (Pred == Succ || BlockToChain[Pred] == &SuccChain || in hasBetterLayoutPredecessor()
1409 BlockToChain[Pred] == &Chain || in hasBetterLayoutPredecessor()
1477 BlockChain *SuccChain = BlockToChain[Succ]; in selectBestSuccessor()
1499 BlockChain &SuccChain = *BlockToChain[Succ]; in selectBestSuccessor()
1579 return BlockToChain.lookup(BB) == &Chain; in selectBestCandidateBlock()
1594 BlockChain &SuccChain = *BlockToChain[MBB]; in selectBestCandidateBlock()
1648 if (BlockToChain[&*I] != &PlacedChain) { in getFirstUnplacedBlock()
1653 return *BlockToChain[&*I]->begin(); in getFirstUnplacedBlock()
1663 BlockChain &Chain = *BlockToChain[MBB]; in fillWorkLists()
1671 assert(BlockToChain[ChainBB] == &Chain && in fillWorkLists()
1676 if (BlockToChain[Pred] == &Chain) in fillWorkLists()
1696 assert(BlockToChain[HeadBB] == &Chain && "BlockToChainMap mis-match.\n"); in buildChain()
1704 assert(BlockToChain[BB] == &Chain && "BlockToChainMap mis-match in loop."); in buildChain()
1745 BlockChain &SuccChain = *BlockToChain[BestSucc]; in buildChain()
1786 BlockChain &HeaderChain = *BlockToChain[L.getHeader()]; in findBestLoopTop()
1845 BlockChain &HeaderChain = *BlockToChain[L.getHeader()]; in findBestLoopExit()
1860 BlockChain &Chain = *BlockToChain[MBB]; in findBestLoopExit()
1878 BlockChain &SuccChain = *BlockToChain[Succ]; in findBestLoopExit()
1971 BlockChain *PredChain = BlockToChain[Pred]; in rotateLoop()
1984 BlockChain *SuccChain = BlockToChain[Succ]; in rotateLoop()
2066 BlockChain *PredChain = BlockToChain[Pred]; in rotateLoopWithProfile()
2088 BlockChain *SuccChain = BlockToChain[Succ]; in rotateLoopWithProfile()
2255 BlockChain &LoopChain = *BlockToChain[LoopTop]; in buildLoopChains()
2320 new (ChainAllocator.Allocate()) BlockChain(BlockToChain, BB); in buildCFGChains()
2360 BlockChain &FunctionChain = *BlockToChain[&F->front()]; in buildCFGChains()
2461 BlockChain &FunctionChain = *BlockToChain[&F->front()]; in optimizeBranches()
2503 BlockChain &FunctionChain = *BlockToChain[&F->front()]; in alignBlocks()
2663 if (BlockToChain.count(RemBB)) { in maybeTailDuplicateBlock()
2664 BlockChain *Chain = BlockToChain[RemBB]; in maybeTailDuplicateBlock()
2667 BlockToChain.erase(RemBB); in maybeTailDuplicateBlock()
2713 BlockChain* PredChain = BlockToChain[Pred]; in maybeTailDuplicateBlock()
2722 BlockChain *NewChain = BlockToChain[NewSucc]; in maybeTailDuplicateBlock()
2751 assert(BlockToChain.empty() && in runOnMachineFunction()
2801 BlockToChain.clear(); in runOnMachineFunction()
2814 BlockToChain.clear(); in runOnMachineFunction()