Lines Matching refs:AvailablePreds

980   AvailablePredsTy AvailablePreds;  in SimplifyPartiallyRedundantLoad()  local
1009     AvailablePreds.push_back(std::make_pair(PredBB, PredAvailable));  in SimplifyPartiallyRedundantLoad()
1014   if (AvailablePreds.empty()) return false;  in SimplifyPartiallyRedundantLoad()
1026   if (PredsScanned.size() == AvailablePreds.size()+1 &&  in SimplifyPartiallyRedundantLoad()
1029   } else if (PredsScanned.size() != AvailablePreds.size()) {  in SimplifyPartiallyRedundantLoad()
1035     for (unsigned i = 0, e = AvailablePreds.size(); i != e; ++i)  in SimplifyPartiallyRedundantLoad()
1036       AvailablePredSet.insert(AvailablePreds[i].first);  in SimplifyPartiallyRedundantLoad()
1067     AvailablePreds.push_back(std::make_pair(UnavailablePred, NewVal));  in SimplifyPartiallyRedundantLoad()
1072   array_pod_sort(AvailablePreds.begin(), AvailablePreds.end());  in SimplifyPartiallyRedundantLoad()
1086       std::lower_bound(AvailablePreds.begin(), AvailablePreds.end(),  in SimplifyPartiallyRedundantLoad()
1089     assert(I != AvailablePreds.end() && I->first == P &&  in SimplifyPartiallyRedundantLoad()