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

/external/llvm/include/llvm/Transforms/Utils/
H A DSSAUpdaterImpl.h379 PhiT *SomePHI = Traits::InstrIsPHI(BBI); local
380 if (!SomePHI)
382 if (CheckIfPHIMatches(SomePHI)) {
/external/llvm/lib/Transforms/Utils/
H A DSSAUpdater.cpp170 PHINode *SomePHI; local
172 (SomePHI = dyn_cast<PHINode>(It)); ++It) {
173 if (IsEquivalentPHI(SomePHI, ValueMapping))
174 return SomePHI;
H A DPromoteMemoryToRegister.cpp619 PHINode *SomePHI = I->second; local
620 BasicBlock *BB = SomePHI->getParent();
621 if (&BB->front() != SomePHI)
627 if (SomePHI->getNumIncomingValues() == getNumPreds(BB))
638 // Now we loop through all BB's which have entries in SomePHI and remove
640 for (unsigned i = 0, e = SomePHI->getNumIncomingValues(); i != e; ++i) {
644 SomePHI->getIncomingBlock(i));
645 assert(EntIt != Preds.end() && *EntIt == SomePHI->getIncomingBlock(i)&&
656 unsigned NumBadPreds = SomePHI->getNumIncomingValues();
658 while ((SomePHI
[all...]
H A DSimplifyCFG.cpp194 PHINode *SomePHI = cast<PHINode>(BB->begin()); local
195 assert(SomePHI->getNumIncomingValues() == 2 &&
197 BasicBlock *Pred1 = SomePHI->getIncomingBlock(0);
198 BasicBlock *Pred2 = SomePHI->getIncomingBlock(1);

Completed in 61 milliseconds