Searched refs:AvailablePreds (Results 1 – 1 of 1) sorted by relevance
1316 AvailablePredsTy AvailablePreds; in SimplifyPartiallyRedundantLoad() local1366 AvailablePreds.push_back(std::make_pair(PredBB, PredAvailable)); in SimplifyPartiallyRedundantLoad()1371 if (AvailablePreds.empty()) return false; in SimplifyPartiallyRedundantLoad()1388 if (PredsScanned.size() != AvailablePreds.size() && in SimplifyPartiallyRedundantLoad()1397 if (PredsScanned.size() == AvailablePreds.size()+1 && in SimplifyPartiallyRedundantLoad()1400 } else if (PredsScanned.size() != AvailablePreds.size()) { in SimplifyPartiallyRedundantLoad()1406 for (const auto &AvailablePred : AvailablePreds) in SimplifyPartiallyRedundantLoad()1440 AvailablePreds.push_back(std::make_pair(UnavailablePred, NewVal)); in SimplifyPartiallyRedundantLoad()1445 array_pod_sort(AvailablePreds.begin(), AvailablePreds.end()); in SimplifyPartiallyRedundantLoad()1459 llvm::lower_bound(AvailablePreds, std::make_pair(P, (Value *)nullptr)); in SimplifyPartiallyRedundantLoad()[all …]