Transforms/Utils/LoopSimplify.cpp

274   PHINode *PN;
276        (PN = dyn_cast<PHINode>(I++)); )
277     if (Value *V = SimplifyInstruction(PN, 0, 0, DT)) {
278       if (AA) AA->deleteValue(PN);
279       if (SE) SE->forgetValue(PN);
280       PN->replaceAllUsesWith(V);
281       PN->eraseFromParent();
472     PHINode *PN = cast<PHINode>(I);
474     if (Value *V = SimplifyInstruction(PN, 0, 0, DT)) {
476       PN->replaceAllUsesWith(V);
477       if (AA) AA->deleteValue(PN);
478       PN->eraseFromParent();
483     for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
484       if (PN->getIncomingValue(i) == PN &&
485           L->contains(PN->getIncomingBlock(i)))
487         return PN;
557   PHINode *PN = FindPHIToPartitionLoops(L, DT, AA, LI);
558   if (PN == 0) return 0;  // No known way to partition.
564   for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
565     if (PN->getIncomingValue(i) != PN ||
566         !L->contains(PN->getIncomingBlock(i))) {
568       if (isa<IndirectBrInst>(PN->getIncomingBlock(i)->getTerminator()))
570       OuterLoopPreds.push_back(PN->getIncomingBlock(i));
695     PHINode *PN = cast<PHINode>(I);
696     PHINode *NewPN = PHINode::Create(PN->getType(), BackedgeBlocks.size(),
697                                      PN->getName()+".be", BETerminator);
698     if (AA) AA->copyValue(PN, NewPN);
705     for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) {
706       BasicBlock *IBB = PN->getIncomingBlock(i);
707       Value *IV = PN->getIncomingValue(i);
721     // Delete all of the incoming values from the old PN except the preheader's
724       PN->setIncomingValue(0, PN->getIncomingValue(PreheaderIdx));
725       PN->setIncomingBlock(0, PN->getIncomingBlock(PreheaderIdx));
728     for (unsigned i = 0, e = PN->getNumIncomingValues()-1; i != e; ++i)
729       PN->removeIncomingValue(e-i, false);
732     PN->addIncoming(NewPN, BEBlock);