Lines Matching defs:Pair
59 typedef std::vector<std::pair<KeyT, ValueT> > VectorTy;
88 std::pair<typename MapTy::iterator, bool> Pair =
90 if (Pair.second) {
92 Pair.first->second = Num;
96 return Vector[Pair.first->second].second;
99 std::pair<iterator, bool>
100 insert(const std::pair<KeyT, ValueT> &InsertPair) {
101 std::pair<typename MapTy::iterator, bool> Pair =
103 if (Pair.second) {
105 Pair.first->second = Num;
109 return std::make_pair(Vector.begin() + Pair.first->second, false);
437 /// Also, a retain+release pair nested within another retain+release
438 /// pair all on the known same pointer value can be eliminated, regardless
800 std::pair<ptr_iterator, bool> Pair = PerPtrTopDown.insert(*MI);
801 Pair.first->second.Merge(Pair.second ? PtrState() : MI->second,
832 std::pair<ptr_iterator, bool> Pair = PerPtrBottomUp.insert(*MI);
833 Pair.first->second.Merge(Pair.second ? PtrState() : MI->second,
1274 /// objc_autoreleaseReturnValue, delete the pair and return true.
1299 // pointer. In this case, we can delete the pair.
1308 DEBUG(dbgs() << "Erasing autoreleaseRV,retainRV pair: " << *I << "\n"
1576 SmallVector<std::pair<Instruction *, const Value *>, 4> Worklist;
1579 std::pair<Instruction *, const Value *> Pair = Worklist.pop_back_val();
1580 Inst = Pair.first;
1581 Arg = Pair.second;
1859 DEBUG(dbgs() << "Found nested releases (i.e. a release pair)\n");
2302 SmallVector<std::pair<BasicBlock *, succ_iterator>, 16> SuccStack;
2346 SmallVector<std::pair<BasicBlock *, BBState::edge_iterator>, 16> PredStack;
2488 // If a pair happens in a region where it is known that the reference count
3194 // no retain+release pair nesting is detected.
