241   BlockToChainMapType &BlockToChain;  member in __anon4b39d8210111::BlockChain
249   BlockChain(BlockToChainMapType &BlockToChain, MachineBasicBlock *BB)  in BlockChain()  argument
250       : Blocks(1, BB), BlockToChain(BlockToChain) {  in BlockChain()
252     BlockToChain[BB] = this;  in BlockChain()
289       assert(!BlockToChain[BB] &&  in merge()
292       BlockToChain[BB] = this;  in merge()
303       assert(BlockToChain[ChainBB] == Chain && "Incoming blocks not in chain.");  in merge()
304       BlockToChain[ChainBB] = this;  in merge()
409   DenseMap<const MachineBasicBlock *, BlockChain *> BlockToChain;  member in __anon4b39d8210111::MachineBlockPlacement
648     BlockChain &SuccChain = *BlockToChain[Succ];  in markBlockSuccessors()
697       BlockChain *SuccChain = BlockToChain[Succ];  in collectViableSuccessors()
838         || BlockToChain[SuccPred] == &Chain  in isProfitableToTailDup()
912       !hasBetterLayoutPredecessor(Succ, PDom, *BlockToChain[PDom], UProb, UProb,  in isProfitableToTailDup()
957       const BlockChain *PredChain = BlockToChain[SuccPred];  in isTrellis()
959           PredChain == &Chain || PredChain == BlockToChain[Succ])  in isTrellis()
1051             BlockToChain[SuccPred] == &Chain ||  in getBestTrellisSuccessor()
1052             BlockToChain[SuccPred] == BlockToChain[Succ])  in getBestTrellisSuccessor()
1131         || BlockToChain[Pred] == &Chain)  in canTailDuplicateUnplacedPreds()
1510     BlockChain *PredChain = BlockToChain[Pred];  in hasBetterLayoutPredecessor()
1581     BlockChain *SuccChain = BlockToChain[Succ];  in selectBestSuccessor()
1603     BlockChain &SuccChain = *BlockToChain[Succ];  in selectBestSuccessor()
1679     return BlockToChain.lookup(BB) == &Chain;  in selectBestCandidateBlock()
1693     BlockChain &SuccChain = *BlockToChain[MBB];  in selectBestCandidateBlock()
1747     if (BlockToChain[&*I] != &PlacedChain) {  in getFirstUnplacedBlock()
1752       return *BlockToChain[&*I]->begin();  in getFirstUnplacedBlock()
1762   BlockChain &Chain = *BlockToChain[MBB];  in fillWorkLists()
1770     assert(BlockToChain[ChainBB] == &Chain &&  in fillWorkLists()
1775       if (BlockToChain[Pred] == &Chain)  in fillWorkLists()
1795   assert(BlockToChain[HeadBB] == &Chain && "BlockToChainMap mis-match.\n");  in buildChain()
1803     assert(BlockToChain[BB] == &Chain && "BlockToChainMap mis-match in loop.");  in buildChain()
1846     BlockChain &SuccChain = *BlockToChain[BestSucc];  in buildChain()
1901     BlockChain *PredChain = BlockToChain[Pred];  in TopFallThroughFreq()
1910         BlockChain *SuccChain = BlockToChain[Succ];  in TopFallThroughFreq()
1971      BlockChain *PredChain = BlockToChain[Pred];  in FallThroughGains()
1991        BlockChain *SuccChain = BlockToChain[Succ];  in FallThroughGains()
1993            (SuccChain == BlockToChain[BestPred]))  in FallThroughGains()
2050   BlockChain &HeaderChain = *BlockToChain[OldTop];  in findBestLoopTopHelper()
2152   BlockChain &HeaderChain = *BlockToChain[L.getHeader()];  in findBestLoopExit()
2167     BlockChain &Chain = *BlockToChain[MBB];  in findBestLoopExit()
2185       BlockChain &SuccChain = *BlockToChain[Succ];  in findBestLoopExit()
2267     BlockChain *PredChain = BlockToChain[Pred];  in hasViableTopFallthrough()
2276         BlockChain *SuccChain = BlockToChain[Succ];  in hasViableTopFallthrough()
2322       BlockChain *SuccChain = BlockToChain[Succ];  in rotateLoop()
2413     BlockChain *PredChain = BlockToChain[Pred];  in rotateLoopWithProfile()
2435       BlockChain *SuccChain = BlockToChain[Succ];  in rotateLoopWithProfile()
2553       BlockChain *Chain = BlockToChain[LoopBB];  in collectLoopBlockSet()
2605   BlockChain &LoopChain = *BlockToChain[LoopTop];  in buildLoopChains()
2670         new (ChainAllocator.Allocate()) BlockChain(BlockToChain, BB);  in buildCFGChains()
2710   BlockChain &FunctionChain = *BlockToChain[&F->front()];  in buildCFGChains()
2828   BlockChain &FunctionChain = *BlockToChain[&F->front()];  in optimizeBranches()
2869   BlockChain &FunctionChain = *BlockToChain[&F->front()];  in alignBlocks()
3030         if (BlockToChain.count(RemBB)) {  in maybeTailDuplicateBlock()
3031           BlockChain *Chain = BlockToChain[RemBB];  in maybeTailDuplicateBlock()
3034           BlockToChain.erase(RemBB);  in maybeTailDuplicateBlock()
3085     BlockChain* PredChain = BlockToChain[Pred];  in maybeTailDuplicateBlock()
3094       BlockChain *NewChain = BlockToChain[NewSucc];  in maybeTailDuplicateBlock()
3127   BlockChain *PredChain = BlockToChain[Pred];  in isBestSuccessor()
3137       BlockChain *SuccChain = BlockToChain[Succ];  in isBestSuccessor()
3319   assert(BlockToChain.empty() &&  in runOnMachineFunction()
3378       BlockToChain.clear();  in runOnMachineFunction()
3391   BlockToChain.clear();  in runOnMachineFunction()