Searched refs:AvailablePreds (Results 1 – 1 of 1) sorted by relevance
1374 AvailablePredsTy AvailablePreds; in simplifyPartiallyRedundantLoad() local1428 AvailablePreds.emplace_back(PredBB, PredAvailable); in simplifyPartiallyRedundantLoad()1433 if (AvailablePreds.empty()) return false; in simplifyPartiallyRedundantLoad()1450 if (PredsScanned.size() != AvailablePreds.size() && in simplifyPartiallyRedundantLoad()1459 if (PredsScanned.size() == AvailablePreds.size()+1 && in simplifyPartiallyRedundantLoad()1462 } else if (PredsScanned.size() != AvailablePreds.size()) { in simplifyPartiallyRedundantLoad()1468 for (const auto &AvailablePred : AvailablePreds) in simplifyPartiallyRedundantLoad()1502 AvailablePreds.emplace_back(UnavailablePred, NewVal); in simplifyPartiallyRedundantLoad()1507 array_pod_sort(AvailablePreds.begin(), AvailablePreds.end()); in simplifyPartiallyRedundantLoad()1521 llvm::lower_bound(AvailablePreds, std::make_pair(P, (Value *)nullptr)); in simplifyPartiallyRedundantLoad()[all …]