Lines Matching refs:NewBB
236 // NewBB is split and now it has one successor. Update dominator tree to
240 typename GraphT::NodeType* NewBB) {
241 assert(std::distance(GraphT::child_begin(NewBB),
242 GraphT::child_end(NewBB)) == 1 &&
243 "NewBB should have a single successor!");
244 typename GraphT::NodeType* NewBBSucc = *GraphT::child_begin(NewBB);
249 InvTraits::child_begin(NewBB),
250 PE = InvTraits::child_end(NewBB); PI != PE; ++PI)
260 if (ND != NewBB && !DT.dominates(NewBBSucc, ND) &&
267 // Find NewBB's immediate dominator and create new dominator tree node for
268 // NewBB.
277 // It's possible that none of the predecessors of NewBB are reachable;
278 // in that case, NewBB itself is unreachable, so nothing needs to be
288 // Create the new dominator tree node... and set the idom of NewBB.
289 DomTreeNodeBase<NodeT> *NewBBNode = DT.addNewBlock(NewBB, NewBBIDom);
291 // If NewBB strictly dominates other blocks, then it is now the immediate
500 void changeImmediateDominator(NodeT *BB, NodeT *NewBB) {
501 changeImmediateDominator(getNode(BB), getNode(NewBB));
537 void splitBlock(NodeT* NewBB) {
539 this->Split<Inverse<NodeT*>, GraphTraits<Inverse<NodeT*> > >(*this, NewBB);
541 this->Split<NodeT*, GraphTraits<NodeT*> >(*this, NewBB);
856 inline void splitBlock(BasicBlock* NewBB) {
857 DT->splitBlock(NewBB);