Lines Matching defs:PHIs
1685 // Skip PHIs which are trivial.
1719 // If there are no PHIs to process, bail early. This helps ensure idempotence
1757 // Skip PHIs which are trivial.
1969 // we ran out of PHIs then we simplified them all.
1974 // Don't fold i1 branches on PHIs which contain binary operators. These can
2281 SmallVector<PHINode *, 4> PHIs;
2285 !isProfitableToFoldUnconditional(BI, PBI, Cond, PHIs)))
2422 for (unsigned i = 0, e = PHIs.size(); i != e; ++i) {
2424 PHIs[i]->getIncomingValueForBlock(PBI->getParent()));
2452 PHIs[i]->setIncomingValue(PHIs[i]->getBasicBlockIndex(PBI->getParent()),
2957 // it. If it has PHIs though, the PHIs may have different
3147 // If the block has any PHIs in it or the icmp has multiple uses, it is too
4844 SmallVector<PHINode *, 4> PHIs;
4865 PHIs.push_back(PHI);
4871 for (PHINode *PHI : PHIs) {
4875 uint64_t NumResults = ResultLists[PHIs[0]].size();
4959 const ResultListTy &ResultList = ResultLists[PHIs[0]];
4983 // We cached PHINodes in PHIs, to avoid accessing deleted PHINodes later,
4990 for (size_t I = 0, E = PHIs.size(); I != E; ++I) {
4991 PHINode *PHI = PHIs[I];
