92   BlockToChainMapType &BlockToChain;  member in __anon7c7745190211::BlockChain
100   BlockChain(BlockToChainMapType &BlockToChain, MachineBasicBlock *BB)  in BlockChain()  argument
101     : Blocks(1, BB), BlockToChain(BlockToChain), LoopPredecessors(0) {  in BlockChain()
103     BlockToChain[BB] = this;  in BlockChain()
127       assert(!BlockToChain[BB]);  in merge()
129       BlockToChain[BB] = this;  in merge()
141       assert(BlockToChain[*BI] == Chain && "Incoming blocks not in chain");  in merge()
142       BlockToChain[*BI] = this;  in merge()
197   DenseMap<MachineBasicBlock *, BlockChain *> BlockToChain;  member in __anon7c7745190311::MachineBlockPlacement
303       BlockChain &SuccChain = *BlockToChain[*SI];  in markChainSuccessors()
346     BlockChain &SuccChain = *BlockToChain[*SI];  in selectBestSuccessor()
376             BlockToChain[*PI] == &Chain)  in selectBestSuccessor()
408   const BlockToChainMapType &BlockToChain;  member in __anon7c7745190411::IsBlockPlaced
412                 const BlockToChainMapType &BlockToChain)  in IsBlockPlaced()  argument
413       : PlacedChain(PlacedChain), BlockToChain(BlockToChain) {}  in IsBlockPlaced()
416     return BlockToChain.lookup(BB) == &PlacedChain;  in operator ()()
439                                 IsBlockPlaced(Chain, BlockToChain)),  in selectBestCandidateBlock()
447     BlockChain &SuccChain = *BlockToChain[*WBI];  in selectBestCandidateBlock()
481     if (BlockToChain[I] != &PlacedChain) {  in getFirstUnplacedBlock()
486       return *BlockToChain[I]->begin();  in getFirstUnplacedBlock()
498   assert(BlockToChain[BB] == &Chain);  in buildChain()
507     assert(BlockToChain[BB] == &Chain);  in buildChain()
531     BlockChain &SuccChain = *BlockToChain[BestSucc];  in buildChain()
562   BlockChain &HeaderChain = *BlockToChain[L.getHeader()];  in findBestLoopTop()
624   BlockChain &HeaderChain = *BlockToChain[L.getHeader()];  in findBestLoopExit()
641     BlockChain &Chain = *BlockToChain[*I];  in findBestLoopExit()
666       BlockChain &SuccChain = *BlockToChain[*SI];  in findBestLoopExit()
746     BlockChain *PredChain = BlockToChain[*PI];  in rotateLoop()
762       BlockChain *SuccChain = BlockToChain[*SI];  in rotateLoop()
806   BlockChain &LoopChain = *BlockToChain[LoopTop];  in buildLoopChains()
817     BlockChain &Chain = *BlockToChain[*BI];  in buildLoopChains()
824       assert(BlockToChain[*BCI] == &Chain);  in buildLoopChains()
828         if (BlockToChain[*PI] == &Chain || !LoopBlockSet.count(*PI))  in buildLoopChains()
885       = new (ChainAllocator.Allocate()) BlockChain(BlockToChain, BB);  in buildCFGChains()
918     BlockChain &Chain = *BlockToChain[BB];  in buildCFGChains()
925       assert(BlockToChain[*BCI] == &Chain);  in buildCFGChains()
929         if (BlockToChain[*PI] == &Chain)  in buildCFGChains()
939   BlockChain &FunctionChain = *BlockToChain[&F.front()];  in buildCFGChains()
1114   assert(BlockToChain.empty());  in runOnMachineFunction()
1118   BlockToChain.clear();  in runOnMachineFunction()