Searched refs:AvailablePreds (Results 1 – 1 of 1) sorted by relevance
924 AvailablePredsTy AvailablePreds; in SimplifyPartiallyRedundantLoad() local952 AvailablePreds.push_back(std::make_pair(PredBB, PredAvailable)); in SimplifyPartiallyRedundantLoad()957 if (AvailablePreds.empty()) return false; in SimplifyPartiallyRedundantLoad()969 if (PredsScanned.size() == AvailablePreds.size()+1 && in SimplifyPartiallyRedundantLoad()972 } else if (PredsScanned.size() != AvailablePreds.size()) { in SimplifyPartiallyRedundantLoad()978 for (unsigned i = 0, e = AvailablePreds.size(); i != e; ++i) in SimplifyPartiallyRedundantLoad()979 AvailablePredSet.insert(AvailablePreds[i].first); in SimplifyPartiallyRedundantLoad()1011 AvailablePreds.push_back(std::make_pair(UnavailablePred, NewVal)); in SimplifyPartiallyRedundantLoad()1016 array_pod_sort(AvailablePreds.begin(), AvailablePreds.end()); in SimplifyPartiallyRedundantLoad()1030 std::lower_bound(AvailablePreds.begin(), AvailablePreds.end(), in SimplifyPartiallyRedundantLoad()[all …]