252   BlockToChainMapType &BlockToChain;  member in __anon7097cf1d0111::BlockChain
260   BlockChain(BlockToChainMapType &BlockToChain, MachineBasicBlock *BB)  in BlockChain()  argument
261       : Blocks(1, BB), BlockToChain(BlockToChain) {  in BlockChain()
263     BlockToChain[BB] = this;  in BlockChain()
300       assert(!BlockToChain[BB] &&  in merge()
303       BlockToChain[BB] = this;  in merge()
314       assert(BlockToChain[ChainBB] == Chain && "Incoming blocks not in chain.");  in merge()
315       BlockToChain[ChainBB] = this;  in merge()
420   DenseMap<const MachineBasicBlock *, BlockChain *> BlockToChain;  member in __anon7097cf1d0111::MachineBlockPlacement
668     BlockChain &SuccChain = *BlockToChain[Succ];  in markBlockSuccessors()
717       BlockChain *SuccChain = BlockToChain[Succ];  in collectViableSuccessors()
858         || BlockToChain[SuccPred] == &Chain  in isProfitableToTailDup()
932       !hasBetterLayoutPredecessor(Succ, PDom, *BlockToChain[PDom], UProb, UProb,  in isProfitableToTailDup()
977       const BlockChain *PredChain = BlockToChain[SuccPred];  in isTrellis()
979           PredChain == &Chain || PredChain == BlockToChain[Succ])  in isTrellis()
1071             BlockToChain[SuccPred] == &Chain ||  in getBestTrellisSuccessor()
1072             BlockToChain[SuccPred] == BlockToChain[Succ])  in getBestTrellisSuccessor()
1151         || BlockToChain[Pred] == &Chain)  in canTailDuplicateUnplacedPreds()
1530     BlockChain *PredChain = BlockToChain[Pred];  in hasBetterLayoutPredecessor()
1601     BlockChain *SuccChain = BlockToChain[Succ];  in selectBestSuccessor()
1623     BlockChain &SuccChain = *BlockToChain[Succ];  in selectBestSuccessor()
1699     return BlockToChain.lookup(BB) == &Chain;  in selectBestCandidateBlock()
1713     BlockChain &SuccChain = *BlockToChain[MBB];  in selectBestCandidateBlock()
1767     if (BlockToChain[&*I] != &PlacedChain) {  in getFirstUnplacedBlock()
1772       return *BlockToChain[&*I]->begin();  in getFirstUnplacedBlock()
1782   BlockChain &Chain = *BlockToChain[MBB];  in fillWorkLists()
1790     assert(BlockToChain[ChainBB] == &Chain &&  in fillWorkLists()
1795       if (BlockToChain[Pred] == &Chain)  in fillWorkLists()
1815   assert(BlockToChain[HeadBB] == &Chain && "BlockToChainMap mis-match.\n");  in buildChain()
1823     assert(BlockToChain[BB] == &Chain && "BlockToChainMap mis-match in loop.");  in buildChain()
1866     BlockChain &SuccChain = *BlockToChain[BestSucc];  in buildChain()
1921     BlockChain *PredChain = BlockToChain[Pred];  in TopFallThroughFreq()
1930         BlockChain *SuccChain = BlockToChain[Succ];  in TopFallThroughFreq()
1991      BlockChain *PredChain = BlockToChain[Pred];  in FallThroughGains()
2011        BlockChain *SuccChain = BlockToChain[Succ];  in FallThroughGains()
2013            (SuccChain == BlockToChain[BestPred]))  in FallThroughGains()
2070   BlockChain &HeaderChain = *BlockToChain[OldTop];  in findBestLoopTopHelper()
2174   BlockChain &HeaderChain = *BlockToChain[L.getHeader()];  in findBestLoopExit()
2189     BlockChain &Chain = *BlockToChain[MBB];  in findBestLoopExit()
2207       BlockChain &SuccChain = *BlockToChain[Succ];  in findBestLoopExit()
2289     BlockChain *PredChain = BlockToChain[Pred];  in hasViableTopFallthrough()
2298         BlockChain *SuccChain = BlockToChain[Succ];  in hasViableTopFallthrough()
2344       BlockChain *SuccChain = BlockToChain[Succ];  in rotateLoop()
2435     BlockChain *PredChain = BlockToChain[Pred];  in rotateLoopWithProfile()
2457       BlockChain *SuccChain = BlockToChain[Succ];  in rotateLoopWithProfile()
2575       BlockChain *Chain = BlockToChain[LoopBB];  in collectLoopBlockSet()
2627   BlockChain &LoopChain = *BlockToChain[LoopTop];  in buildLoopChains()
2692         new (ChainAllocator.Allocate()) BlockChain(BlockToChain, BB);  in buildCFGChains()
2732   BlockChain &FunctionChain = *BlockToChain[&F->front()];  in buildCFGChains()
2850   BlockChain &FunctionChain = *BlockToChain[&F->front()];  in optimizeBranches()
2891   BlockChain &FunctionChain = *BlockToChain[&F->front()];  in alignBlocks()
3065         if (BlockToChain.count(RemBB)) {  in maybeTailDuplicateBlock()
3066           BlockChain *Chain = BlockToChain[RemBB];  in maybeTailDuplicateBlock()
3069           BlockToChain.erase(RemBB);  in maybeTailDuplicateBlock()
3120     BlockChain* PredChain = BlockToChain[Pred];  in maybeTailDuplicateBlock()
3129       BlockChain *NewChain = BlockToChain[NewSucc];  in maybeTailDuplicateBlock()
3162   BlockChain *PredChain = BlockToChain[Pred];  in isBestSuccessor()
3172       BlockChain *SuccChain = BlockToChain[Succ];  in isBestSuccessor()
3354   assert(BlockToChain.empty() &&  in runOnMachineFunction()
3413       BlockToChain.clear();  in runOnMachineFunction()
3436   BlockToChain.clear();  in runOnMachineFunction()
3598   BlockToChain.clear();  in createCFGChainExtTsp()
3604       new (ChainAllocator.Allocate()) BlockChain(BlockToChain, HeadBB);  in createCFGChainExtTsp()