Transforms/Scalar/JumpThreading.cpp

888   AvailablePredsTy AvailablePreds;
916     AvailablePreds.push_back(std::make_pair(PredBB, PredAvailable));
921   if (AvailablePreds.empty()) return false;
933   if (PredsScanned.size() == AvailablePreds.size()+1 &&
936   } else if (PredsScanned.size() != AvailablePreds.size()) {
942     for (unsigned i = 0, e = AvailablePreds.size(); i != e; ++i)
943       AvailablePredSet.insert(AvailablePreds[i].first);
964   // it to the AvailablePreds list.
975     AvailablePreds.push_back(std::make_pair(UnavailablePred, NewVal));
979   // AvailablePreds, sort them for efficient access as we're walking the preds.
980   array_pod_sort(AvailablePreds.begin(), AvailablePreds.end());
994       std::lower_bound(AvailablePreds.begin(), AvailablePreds.end(),
997     assert(I != AvailablePreds.end() && I->first == P &&