Lines Matching defs:PHIs
1559 // Skip PHIs which are trivial.
1593 // If there are no PHIs to process, bail early. This helps ensure idempotence
1626 // Skip PHIs which are trivial.
1837 // we ran out of PHIs then we simplified them all.
1841 // Don't fold i1 branches on PHIs which contain binary operators. These can
2145 SmallVector<PHINode*, 4> PHIs;
2150 !isProfitableToFoldUnconditional(BI, PBI, Cond, PHIs)))
2283 for (unsigned i = 0, e = PHIs.size(); i != e; ++i) {
2285 PHIs[i]->getIncomingValueForBlock(PBI->getParent()));
2323 PHIs[i]->setIncomingValue(PHIs[i]->getBasicBlockIndex(PBI->getParent()),
2536 // it. If it has PHIs though, the PHIs may have different
2706 // If the block has any PHIs in it or the icmp has multiple uses, it is too
4072 SmallVector<PHINode*, 4> PHIs;
4093 PHIs.push_back(PHI);
4099 for (PHINode *PHI : PHIs) {
4103 uint64_t NumResults = ResultLists[PHIs[0]].size();
4162 // We cached PHINodes in PHIs, to avoid accessing deleted PHINodes later,
4192 const ResultListTy &ResultList = ResultLists[PHIs[0]];
4218 for (size_t I = 0, E = PHIs.size(); I != E; ++I) {
4219 PHINode *PHI = PHIs[I];
