Lines Matching defs:TIBB
150 BasicBlock *TIBB = TI->getParent();
159 TIBB->getName() + "." + DestBB->getName() + "_crit_edge");
168 Function &F = *TIBB->getParent();
169 Function::iterator FBBI = TIBB;
173 // merge incoming values from NewBB instead of from TIBB.
177 // We no longer enter through TIBB, now we come in through NewBB.
179 // TIBB to come from NewBB.
184 // win because we don't have to scan the PHI looking for TIBB. This
187 if (PN->getIncomingBlock(BBIdx) != TIBB)
188 BBIdx = PN->getBasicBlockIndex(TIBB);
193 // If there are any other edges from TIBB to DestBB, update those to go
200 // Remove an entry for TIBB from DestBB phi nodes.
201 DestBB->removePredecessor(TIBB, DontDeleteUselessPhis);
223 // the TIBB, TIBB clearly dominates NewBB. TIBB usually doesn't dominate
248 DomTreeNode *TINode = DT->getNode(TIBB);
254 DomTreeNode *NewBBNode = DT->addNewBlock(NewBB, TIBB);
279 if (Loop *TIL = LI->getLoopFor(TIBB)) {
303 // If TIBB is in a loop and DestBB is outside of that loop, we may need
312 createPHIsForSplitLoopExit(TIBB, NewBB, DestBB);