Searched defs:SomePHI (Results 1 - 4 of 4) sorted by relevance

/external/llvm/include/llvm/Transforms/Utils/
H A DSSAUpdaterImpl.h381 PhiT *SomePHI = Traits::InstrIsPHI(BBI); local
382 if (!SomePHI)
384 if (CheckIfPHIMatches(SomePHI)) {
/external/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp743 PHINode *SomePHI = dyn_cast<PHINode>(BB->begin()); local
747 if (SomePHI) {
748 if (SomePHI->getNumIncomingValues() != 2)
750 Pred1 = SomePHI->getIncomingBlock(0);
751 Pred2 = SomePHI->getIncomingBlock(1);
H A DPromoteMemoryToRegister.cpp713 PHINode *SomePHI = I->second; local
714 BasicBlock *BB = SomePHI->getParent();
715 if (&BB->front() != SomePHI)
721 if (SomePHI->getNumIncomingValues() == getNumPreds(BB))
732 // Now we loop through all BB's which have entries in SomePHI and remove
734 for (unsigned i = 0, e = SomePHI->getNumIncomingValues(); i != e; ++i) {
737 Preds.begin(), Preds.end(), SomePHI->getIncomingBlock(i));
738 assert(EntIt != Preds.end() && *EntIt == SomePHI->getIncomingBlock(i) &&
749 unsigned NumBadPreds = SomePHI->getNumIncomingValues();
751 while ((SomePHI
[all...]
H A DSSAUpdater.cpp140 PHINode *SomePHI; local
142 (SomePHI = dyn_cast<PHINode>(It)); ++It) {
143 if (IsEquivalentPHI(SomePHI, ValueMapping))
144 return SomePHI;

Completed in 1064 milliseconds