Lines Matching refs:AvailablePreds

1362   AvailablePredsTy AvailablePreds;  in simplifyPartiallyRedundantLoad()  local
1416     AvailablePreds.emplace_back(PredBB, PredAvailable);  in simplifyPartiallyRedundantLoad()
1421   if (AvailablePreds.empty()) return false;  in simplifyPartiallyRedundantLoad()
1438   if (PredsScanned.size() != AvailablePreds.size() &&  in simplifyPartiallyRedundantLoad()
1447   if (PredsScanned.size() == AvailablePreds.size()+1 &&  in simplifyPartiallyRedundantLoad()
1450   } else if (PredsScanned.size() != AvailablePreds.size()) {  in simplifyPartiallyRedundantLoad()
1456     for (const auto &AvailablePred : AvailablePreds)  in simplifyPartiallyRedundantLoad()
1488     AvailablePreds.emplace_back(UnavailablePred, NewVal);  in simplifyPartiallyRedundantLoad()
1493   array_pod_sort(AvailablePreds.begin(), AvailablePreds.end());  in simplifyPartiallyRedundantLoad()
1507         llvm::lower_bound(AvailablePreds, std::make_pair(P, (Value *)nullptr));  in simplifyPartiallyRedundantLoad()
1509     assert(I != AvailablePreds.end() && I->first == P &&  in simplifyPartiallyRedundantLoad()