Lines Matching defs:Pair
164 std::pair<RegUsesTy::iterator, bool> Pair =
166 RegSortData &RSD = Pair.first->second;
167 if (Pair.second)
1499 static std::pair<const SCEV *, LSRUse::KindType> getEmptyKey() {
1503 static std::pair<const SCEV *, LSRUse::KindType> getTombstoneKey() {
1508 getHashValue(const std::pair<const SCEV *, LSRUse::KindType> &V) {
1514 static bool isEqual(const std::pair<const SCEV *, LSRUse::KindType> &LHS,
1515 const std::pair<const SCEV *, LSRUse::KindType> &RHS) {
1648 typedef DenseMap<std::pair<const SCEV *, LSRUse::KindType>,
1656 std::pair<size_t, int64_t> getUse(const SCEV *&Expr,
2207 std::pair<size_t, int64_t>
2220 std::pair<UseMapTy::iterator, bool> P =
2964 std::pair<size_t, int64_t> P = getUse(S, Kind, AccessTy);
3097 std::pair<size_t, int64_t> P = getUse(S, LSRUse::Basic, 0);
3557 std::pair<RegMapTy::iterator, bool> Pair =
3559 if (Pair.second)
3561 Pair.first->second.insert(std::make_pair(Imm, *I));
3569 SmallSet<std::pair<size_t, int64_t>, 32> UniqueItems;
3805 std::pair<BestFormulaeTy::const_iterator, bool> P =
4573 std::pair<DenseMap<BasicBlock *, Value *>::iterator, bool> Pair =
4575 if (!Pair.second)
4576 PN->setIncomingValue(i, Pair.first->second);
4590 Pair.first->second = FullV;
