Searched refs:AvailablePreds (Results 1 – 1 of 1) sorted by relevance
1336 AvailablePredsTy AvailablePreds; in SimplifyPartiallyRedundantLoad() local1386 AvailablePreds.push_back(std::make_pair(PredBB, PredAvailable)); in SimplifyPartiallyRedundantLoad()1391 if (AvailablePreds.empty()) return false; in SimplifyPartiallyRedundantLoad()1408 if (PredsScanned.size() != AvailablePreds.size() && in SimplifyPartiallyRedundantLoad()1417 if (PredsScanned.size() == AvailablePreds.size()+1 && in SimplifyPartiallyRedundantLoad()1420 } else if (PredsScanned.size() != AvailablePreds.size()) { in SimplifyPartiallyRedundantLoad()1426 for (const auto &AvailablePred : AvailablePreds) in SimplifyPartiallyRedundantLoad()1458 AvailablePreds.push_back(std::make_pair(UnavailablePred, NewVal)); in SimplifyPartiallyRedundantLoad()1463 array_pod_sort(AvailablePreds.begin(), AvailablePreds.end()); in SimplifyPartiallyRedundantLoad()1477 std::lower_bound(AvailablePreds.begin(), AvailablePreds.end(), in SimplifyPartiallyRedundantLoad()[all …]