Lines Matching defs:BlockToChain

263   BlockToChainMapType &BlockToChain;
270   /// in with the BlockToChain mapping.
271   BlockChain(BlockToChainMapType &BlockToChain, MachineBasicBlock *BB)
272       : Blocks(1, BB), BlockToChain(BlockToChain) {
274     BlockToChain[BB] = this;
311       assert(!BlockToChain[BB] &&
312              "Passed chain is null, but BB has entry in BlockToChain.");
314       BlockToChain[BB] = this;
325       assert(BlockToChain[ChainBB] == Chain && "Incoming blocks not in chain.");
326       BlockToChain[ChainBB] = this;
431   DenseMap<const MachineBasicBlock *, BlockChain *> BlockToChain;
684     BlockChain &SuccChain = *BlockToChain[Succ];
733       BlockChain *SuccChain = BlockToChain[Succ];
874         || BlockToChain[SuccPred] == &Chain
948       !hasBetterLayoutPredecessor(Succ, PDom, *BlockToChain[PDom], UProb, UProb,
993       const BlockChain *PredChain = BlockToChain[SuccPred];
995           PredChain == &Chain || PredChain == BlockToChain[Succ])
1087             BlockToChain[SuccPred] == &Chain ||
1088             BlockToChain[SuccPred] == BlockToChain[Succ])
1167         || (BlockToChain[Pred] == &Chain && !Succ->succ_empty()))
1546     BlockChain *PredChain = BlockToChain[Pred];
1617     BlockChain *SuccChain = BlockToChain[Succ];
1639     BlockChain &SuccChain = *BlockToChain[Succ];
1715     return BlockToChain.lookup(BB) == &Chain;
1729     BlockChain &SuccChain = *BlockToChain[MBB];
1782     if (BlockToChain[&*I] != &PlacedChain) {
1787       return *BlockToChain[&*I]->begin();
1810     BlockChain *C = BlockToChain[*PrevUnplacedBlockInFilterIt];
1822   BlockChain &Chain = *BlockToChain[MBB];
1830     assert(BlockToChain[ChainBB] == &Chain &&
1831            "Block in chain doesn't match BlockToChain map.");
1835       if (BlockToChain[Pred] == &Chain)
1855   assert(BlockToChain[HeadBB] == &Chain && "BlockToChainMap mis-match.\n");
1866     assert(BlockToChain[BB] == &Chain && "BlockToChainMap mis-match in loop.");
1914     BlockChain &SuccChain = *BlockToChain[BestSucc];
1969     BlockChain *PredChain = BlockToChain[Pred];
1978         BlockChain *SuccChain = BlockToChain[Succ];
2039     BlockChain *PredChain = BlockToChain[Pred];
2059       BlockChain *SuccChain = BlockToChain[Succ];
2061           (SuccChain == BlockToChain[BestPred]))
2118   BlockChain &HeaderChain = *BlockToChain[OldTop];
2223   BlockChain &HeaderChain = *BlockToChain[L.getHeader()];
2238     BlockChain &Chain = *BlockToChain[MBB];
2256       BlockChain &SuccChain = *BlockToChain[Succ];
2338     BlockChain *PredChain = BlockToChain[Pred];
2347         BlockChain *SuccChain = BlockToChain[Succ];
2393       BlockChain *SuccChain = BlockToChain[Succ];
2484     BlockChain *PredChain = BlockToChain[Pred];
2506       BlockChain *SuccChain = BlockToChain[Succ];
2623       BlockChain *Chain = BlockToChain[LoopBB];
2675   BlockChain &LoopChain = *BlockToChain[LoopTop];
2740         new (ChainAllocator.Allocate()) BlockChain(BlockToChain, BB);
2780   BlockChain &FunctionChain = *BlockToChain[&F->front()];
2898   BlockChain &FunctionChain = *BlockToChain[&F->front()];
2939   BlockChain &FunctionChain = *BlockToChain[&F->front()];
3135         if (BlockToChain.count(RemBB)) {
3136           BlockChain *Chain = BlockToChain[RemBB];
3139           BlockToChain.erase(RemBB);
3208     BlockChain* PredChain = BlockToChain[Pred];
3217       BlockChain *NewChain = BlockToChain[NewSucc];
3250   BlockChain *PredChain = BlockToChain[Pred];
3260       BlockChain *SuccChain = BlockToChain[Succ];
3443   assert(BlockToChain.empty() &&
3444          "BlockToChain map should be empty before starting placement.");
3502       BlockToChain.clear();
3525   BlockToChain.clear();
3689   BlockToChain.clear();
3695       new (ChainAllocator.Allocate()) BlockChain(BlockToChain, HeadBB);