Searched refs:AvailablePreds (Results 1 – 1 of 1) sorted by relevance
1385 AvailablePredsTy AvailablePreds; in simplifyPartiallyRedundantLoad() local1439 AvailablePreds.emplace_back(PredBB, PredAvailable); in simplifyPartiallyRedundantLoad()1444 if (AvailablePreds.empty()) return false; in simplifyPartiallyRedundantLoad()1461 if (PredsScanned.size() != AvailablePreds.size() && in simplifyPartiallyRedundantLoad()1470 if (PredsScanned.size() == AvailablePreds.size()+1 && in simplifyPartiallyRedundantLoad()1473 } else if (PredsScanned.size() != AvailablePreds.size()) { in simplifyPartiallyRedundantLoad()1479 for (const auto &AvailablePred : AvailablePreds) in simplifyPartiallyRedundantLoad()1511 AvailablePreds.emplace_back(UnavailablePred, NewVal); in simplifyPartiallyRedundantLoad()1516 array_pod_sort(AvailablePreds.begin(), AvailablePreds.end()); in simplifyPartiallyRedundantLoad()1530 llvm::lower_bound(AvailablePreds, std::make_pair(P, (Value *)nullptr)); in simplifyPartiallyRedundantLoad()[all …]