263   BlockToChainMapType &BlockToChain;  member in __anon1d8a29ed0111::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 __anon1d8a29ed0111::MachineBlockPlacement
684     BlockChain &SuccChain = *BlockToChain[Succ];  in markBlockSuccessors()
733       BlockChain *SuccChain = BlockToChain[Succ];  in collectViableSuccessors()
874         || BlockToChain[SuccPred] == &Chain  in isProfitableToTailDup()
948       !hasBetterLayoutPredecessor(Succ, PDom, *BlockToChain[PDom], UProb, UProb,  in isProfitableToTailDup()
993       const BlockChain *PredChain = BlockToChain[SuccPred];  in isTrellis()
995           PredChain == &Chain || PredChain == BlockToChain[Succ])  in isTrellis()
1087             BlockToChain[SuccPred] == &Chain ||  in getBestTrellisSuccessor()
1088             BlockToChain[SuccPred] == BlockToChain[Succ])  in getBestTrellisSuccessor()
1167         || (BlockToChain[Pred] == &Chain && !Succ->succ_empty()))  in canTailDuplicateUnplacedPreds()
1546     BlockChain *PredChain = BlockToChain[Pred];  in hasBetterLayoutPredecessor()
1617     BlockChain *SuccChain = BlockToChain[Succ];  in selectBestSuccessor()
1639     BlockChain &SuccChain = *BlockToChain[Succ];  in selectBestSuccessor()
1715     return BlockToChain.lookup(BB) == &Chain;  in selectBestCandidateBlock()
1729     BlockChain &SuccChain = *BlockToChain[MBB];  in selectBestCandidateBlock()
1782     if (BlockToChain[&*I] != &PlacedChain) {  in getFirstUnplacedBlock()
1787       return *BlockToChain[&*I]->begin();  in getFirstUnplacedBlock()
1810     BlockChain *C = BlockToChain[*PrevUnplacedBlockInFilterIt];  in getFirstUnplacedBlock()
1822   BlockChain &Chain = *BlockToChain[MBB];  in fillWorkLists()
1830     assert(BlockToChain[ChainBB] == &Chain &&  in fillWorkLists()
1835       if (BlockToChain[Pred] == &Chain)  in fillWorkLists()
1855   assert(BlockToChain[HeadBB] == &Chain && "BlockToChainMap mis-match.\n");  in buildChain()
1866     assert(BlockToChain[BB] == &Chain && "BlockToChainMap mis-match in loop.");  in buildChain()
1914     BlockChain &SuccChain = *BlockToChain[BestSucc];  in buildChain()
1969     BlockChain *PredChain = BlockToChain[Pred];  in TopFallThroughFreq()
1978         BlockChain *SuccChain = BlockToChain[Succ];  in TopFallThroughFreq()
2039     BlockChain *PredChain = BlockToChain[Pred];  in FallThroughGains()
2059       BlockChain *SuccChain = BlockToChain[Succ];  in FallThroughGains()
2061           (SuccChain == BlockToChain[BestPred]))  in FallThroughGains()
2118   BlockChain &HeaderChain = *BlockToChain[OldTop];  in findBestLoopTopHelper()
2223   BlockChain &HeaderChain = *BlockToChain[L.getHeader()];  in findBestLoopExit()
2238     BlockChain &Chain = *BlockToChain[MBB];  in findBestLoopExit()
2256       BlockChain &SuccChain = *BlockToChain[Succ];  in findBestLoopExit()
2338     BlockChain *PredChain = BlockToChain[Pred];  in hasViableTopFallthrough()
2347         BlockChain *SuccChain = BlockToChain[Succ];  in hasViableTopFallthrough()
2393       BlockChain *SuccChain = BlockToChain[Succ];  in rotateLoop()
2484     BlockChain *PredChain = BlockToChain[Pred];  in rotateLoopWithProfile()
2506       BlockChain *SuccChain = BlockToChain[Succ];  in rotateLoopWithProfile()
2623       BlockChain *Chain = BlockToChain[LoopBB];  in collectLoopBlockSet()
2675   BlockChain &LoopChain = *BlockToChain[LoopTop];  in buildLoopChains()
2740         new (ChainAllocator.Allocate()) BlockChain(BlockToChain, BB);  in buildCFGChains()
2780   BlockChain &FunctionChain = *BlockToChain[&F->front()];  in buildCFGChains()
2898   BlockChain &FunctionChain = *BlockToChain[&F->front()];  in optimizeBranches()
2939   BlockChain &FunctionChain = *BlockToChain[&F->front()];  in alignBlocks()
3135         if (BlockToChain.count(RemBB)) {  in maybeTailDuplicateBlock()
3136           BlockChain *Chain = BlockToChain[RemBB];  in maybeTailDuplicateBlock()
3139           BlockToChain.erase(RemBB);  in maybeTailDuplicateBlock()
3208     BlockChain* PredChain = BlockToChain[Pred];  in maybeTailDuplicateBlock()
3217       BlockChain *NewChain = BlockToChain[NewSucc];  in maybeTailDuplicateBlock()
3250   BlockChain *PredChain = BlockToChain[Pred];  in isBestSuccessor()
3260       BlockChain *SuccChain = BlockToChain[Succ];  in isBestSuccessor()
3443   assert(BlockToChain.empty() &&  in runOnMachineFunction()
3502       BlockToChain.clear();  in runOnMachineFunction()
3525   BlockToChain.clear();  in runOnMachineFunction()
3689   BlockToChain.clear();  in createCFGChainExtTsp()
3695       new (ChainAllocator.Allocate()) BlockChain(BlockToChain, HeadBB);  in createCFGChainExtTsp()