Lines Matching defs:BlockToChain

273   BlockToChainMapType &BlockToChain;
280   /// in with the BlockToChain mapping.
281   BlockChain(BlockToChainMapType &BlockToChain, MachineBasicBlock *BB)
282       : Blocks(1, BB), BlockToChain(BlockToChain) {
284     BlockToChain[BB] = this;
321       assert(!BlockToChain[BB] &&
322              "Passed chain is null, but BB has entry in BlockToChain.");
324       BlockToChain[BB] = this;
335       assert(BlockToChain[ChainBB] == Chain && "Incoming blocks not in chain.");
336       BlockToChain[ChainBB] = this;
445   DenseMap<const MachineBasicBlock *, BlockChain *> BlockToChain;
699     BlockChain &SuccChain = *BlockToChain[Succ];
748       BlockChain *SuccChain = BlockToChain[Succ];
889         BlockToChain[SuccPred] == &Chain ||
963       !hasBetterLayoutPredecessor(Succ, PDom, *BlockToChain[PDom], UProb, UProb,
1008       const BlockChain *PredChain = BlockToChain[SuccPred];
1010           PredChain == &Chain || PredChain == BlockToChain[Succ])
1102             BlockToChain[SuccPred] == &Chain ||
1103             BlockToChain[SuccPred] == BlockToChain[Succ])
1182         (BlockToChain[Pred] == &Chain && !Succ->succ_empty()))
1559     BlockChain *PredChain = BlockToChain[Pred];
1630     BlockChain *SuccChain = BlockToChain[Succ];
1652     BlockChain &SuccChain = *BlockToChain[Succ];
1728     return BlockToChain.lookup(BB) == &Chain;
1742     BlockChain &SuccChain = *BlockToChain[MBB];
1795     if (BlockToChain[&*I] != &PlacedChain) {
1800       return *BlockToChain[&*I]->begin();
1823     BlockChain *C = BlockToChain[*PrevUnplacedBlockInFilterIt];
1834   BlockChain &Chain = *BlockToChain[MBB];
1842     assert(BlockToChain[ChainBB] == &Chain &&
1843            "Block in chain doesn't match BlockToChain map.");
1847       if (BlockToChain[Pred] == &Chain)
1867   assert(BlockToChain[HeadBB] == &Chain && "BlockToChainMap mis-match.\n");
1878     assert(BlockToChain[BB] == &Chain && "BlockToChainMap mis-match in loop.");
1924     BlockChain &SuccChain = *BlockToChain[BestSucc];
1976     BlockChain *PredChain = BlockToChain[Pred];
1985         BlockChain *SuccChain = BlockToChain[Succ];
2043     BlockChain *PredChain = BlockToChain[Pred];
2063       BlockChain *SuccChain = BlockToChain[Succ];
2065           (SuccChain == BlockToChain[BestPred]))
2120   BlockChain &HeaderChain = *BlockToChain[OldTop];
2223   BlockChain &HeaderChain = *BlockToChain[L.getHeader()];
2238     BlockChain &Chain = *BlockToChain[MBB];
2256       BlockChain &SuccChain = *BlockToChain[Succ];
2336     BlockChain *PredChain = BlockToChain[Pred];
2345         BlockChain *SuccChain = BlockToChain[Succ];
2391       BlockChain *SuccChain = BlockToChain[Succ];
2482     BlockChain *PredChain = BlockToChain[Pred];
2504       BlockChain *SuccChain = BlockToChain[Succ];
2629       BlockChain *Chain = BlockToChain[LoopBB];
2685   BlockChain &LoopChain = *BlockToChain[LoopTop];
2750         new (ChainAllocator.Allocate()) BlockChain(BlockToChain, BB);
2790   BlockChain &FunctionChain = *BlockToChain[&F->front()];
2908   BlockChain &FunctionChain = *BlockToChain[&F->front()];
2958   BlockChain &FunctionChain = *BlockToChain[&F->front()];
3181     if (auto It = BlockToChain.find(RemBB); It != BlockToChain.end()) {
3185       BlockToChain.erase(It);
3254     BlockChain *PredChain = BlockToChain[Pred];
3263       BlockChain *NewChain = BlockToChain[NewSucc];
3296   BlockChain *PredChain = BlockToChain[Pred];
3306       BlockChain *SuccChain = BlockToChain[Succ];
3509   assert(BlockToChain.empty() &&
3510          "BlockToChain map should be empty before starting placement.");
3566         BlockToChain.clear();
3588   BlockToChain.clear();
3756   BlockToChain.clear();
3762       new (ChainAllocator.Allocate()) BlockChain(BlockToChain, HeadBB);