Lines Matching defs:PHIs
1485 // Skip PHIs which are trivial.
1512 // If there are no PHIs to process, bail early. This helps ensure idempotence
1545 // Skip PHIs which are trivial.
1753 // we ran out of PHIs then we simplified them all.
1757 // Don't fold i1 branches on PHIs which contain binary operators. These can
2061 SmallVector<PHINode*, 4> PHIs;
2066 !isProfitableToFoldUnconditional(BI, PBI, Cond, PHIs)))
2231 for (unsigned i = 0, e = PHIs.size(); i != e; ++i) {
2233 PHIs[i]->getIncomingValueForBlock(PBI->getParent()));
2271 PHIs[i]->setIncomingValue(PHIs[i]->getBasicBlockIndex(PBI->getParent()),
2486 // it. If it has PHIs though, the PHIs may have different
2655 // If the block has any PHIs in it or the icmp has multiple uses, it is too
3735 SmallVector<PHINode*, 4> PHIs;
3754 PHIs.push_back(I->first);
3760 for (size_t I = 0, E = PHIs.size(); I != E; ++I) {
3761 PHINode *PHI = PHIs[I];
3765 uint64_t NumResults = ResultLists[PHIs[0]].size();
3847 const ResultListTy &ResultList = ResultLists[PHIs[0]];
3873 for (size_t I = 0, E = PHIs.size(); I != E; ++I) {
3874 PHINode *PHI = PHIs[I];