263   BlockToChainMapType &BlockToChain;  member in __anon4a3aec630111::BlockChain
271   BlockChain(BlockToChainMapType &BlockToChain, MachineBasicBlock *BB)  in BlockChain()  argument
272       : Blocks(1, BB), BlockToChain(BlockToChain) {  in BlockChain()
274     BlockToChain[BB] = this;  in BlockChain()
311       assert(!BlockToChain[BB] &&  in merge()
314       BlockToChain[BB] = this;  in merge()
325       assert(BlockToChain[ChainBB] == Chain && "Incoming blocks not in chain.");  in merge()
326       BlockToChain[ChainBB] = this;  in merge()
431   DenseMap<const MachineBasicBlock *, BlockChain *> BlockToChain;  member in __anon4a3aec630111::MachineBlockPlacement
679     BlockChain &SuccChain = *BlockToChain[Succ];  in markBlockSuccessors()
728       BlockChain *SuccChain = BlockToChain[Succ];  in collectViableSuccessors()
869         || BlockToChain[SuccPred] == &Chain  in isProfitableToTailDup()
943       !hasBetterLayoutPredecessor(Succ, PDom, *BlockToChain[PDom], UProb, UProb,  in isProfitableToTailDup()
988       const BlockChain *PredChain = BlockToChain[SuccPred];  in isTrellis()
990           PredChain == &Chain || PredChain == BlockToChain[Succ])  in isTrellis()
1082             BlockToChain[SuccPred] == &Chain ||  in getBestTrellisSuccessor()
1083             BlockToChain[SuccPred] == BlockToChain[Succ])  in getBestTrellisSuccessor()
1162         || (BlockToChain[Pred] == &Chain && !Succ->succ_empty()))  in canTailDuplicateUnplacedPreds()
1541     BlockChain *PredChain = BlockToChain[Pred];  in hasBetterLayoutPredecessor()
1612     BlockChain *SuccChain = BlockToChain[Succ];  in selectBestSuccessor()
1634     BlockChain &SuccChain = *BlockToChain[Succ];  in selectBestSuccessor()
1710     return BlockToChain.lookup(BB) == &Chain;  in selectBestCandidateBlock()
1724     BlockChain &SuccChain = *BlockToChain[MBB];  in selectBestCandidateBlock()
1779     if (BlockToChain[&*I] != &PlacedChain) {  in getFirstUnplacedBlock()
1784       return *BlockToChain[&*I]->begin();  in getFirstUnplacedBlock()
1794   BlockChain &Chain = *BlockToChain[MBB];  in fillWorkLists()
1802     assert(BlockToChain[ChainBB] == &Chain &&  in fillWorkLists()
1807       if (BlockToChain[Pred] == &Chain)  in fillWorkLists()
1827   assert(BlockToChain[HeadBB] == &Chain && "BlockToChainMap mis-match.\n");  in buildChain()
1835     assert(BlockToChain[BB] == &Chain && "BlockToChainMap mis-match in loop.");  in buildChain()
1878     BlockChain &SuccChain = *BlockToChain[BestSucc];  in buildChain()
1933     BlockChain *PredChain = BlockToChain[Pred];  in TopFallThroughFreq()
1942         BlockChain *SuccChain = BlockToChain[Succ];  in TopFallThroughFreq()
2003     BlockChain *PredChain = BlockToChain[Pred];  in FallThroughGains()
2023       BlockChain *SuccChain = BlockToChain[Succ];  in FallThroughGains()
2025           (SuccChain == BlockToChain[BestPred]))  in FallThroughGains()
2082   BlockChain &HeaderChain = *BlockToChain[OldTop];  in findBestLoopTopHelper()
2187   BlockChain &HeaderChain = *BlockToChain[L.getHeader()];  in findBestLoopExit()
2202     BlockChain &Chain = *BlockToChain[MBB];  in findBestLoopExit()
2220       BlockChain &SuccChain = *BlockToChain[Succ];  in findBestLoopExit()
2302     BlockChain *PredChain = BlockToChain[Pred];  in hasViableTopFallthrough()
2311         BlockChain *SuccChain = BlockToChain[Succ];  in hasViableTopFallthrough()
2357       BlockChain *SuccChain = BlockToChain[Succ];  in rotateLoop()
2448     BlockChain *PredChain = BlockToChain[Pred];  in rotateLoopWithProfile()
2470       BlockChain *SuccChain = BlockToChain[Succ];  in rotateLoopWithProfile()
2587       BlockChain *Chain = BlockToChain[LoopBB];  in collectLoopBlockSet()
2639   BlockChain &LoopChain = *BlockToChain[LoopTop];  in buildLoopChains()
2704         new (ChainAllocator.Allocate()) BlockChain(BlockToChain, BB);  in buildCFGChains()
2744   BlockChain &FunctionChain = *BlockToChain[&F->front()];  in buildCFGChains()
2862   BlockChain &FunctionChain = *BlockToChain[&F->front()];  in optimizeBranches()
2903   BlockChain &FunctionChain = *BlockToChain[&F->front()];  in alignBlocks()
3099         if (BlockToChain.count(RemBB)) {  in maybeTailDuplicateBlock()
3100           BlockChain *Chain = BlockToChain[RemBB];  in maybeTailDuplicateBlock()
3103           BlockToChain.erase(RemBB);  in maybeTailDuplicateBlock()
3154     BlockChain* PredChain = BlockToChain[Pred];  in maybeTailDuplicateBlock()
3163       BlockChain *NewChain = BlockToChain[NewSucc];  in maybeTailDuplicateBlock()
3196   BlockChain *PredChain = BlockToChain[Pred];  in isBestSuccessor()
3206       BlockChain *SuccChain = BlockToChain[Succ];  in isBestSuccessor()
3389   assert(BlockToChain.empty() &&  in runOnMachineFunction()
3448       BlockToChain.clear();  in runOnMachineFunction()
3471   BlockToChain.clear();  in runOnMachineFunction()
3635   BlockToChain.clear();  in createCFGChainExtTsp()
3641       new (ChainAllocator.Allocate()) BlockChain(BlockToChain, HeadBB);  in createCFGChainExtTsp()