reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
315 using RangePair = std::pair<iterator, iterator>; 315 using RangePair = std::pair<iterator, iterator>; 319 iterator end() { return iterator(this, SMSNode::INVALID, SMSNode::INVALID); } 319 iterator end() { return iterator(this, SMSNode::INVALID, SMSNode::INVALID); } 354 iterator findIndex(unsigned Idx) { 362 return iterator(this, i, Idx); 375 iterator find(const KeyT &Key) { 380 iterator I = const_cast<SparseMultiSet*>(this)->findIndex(KeyIndexOf(Key)); 400 iterator getHead(const KeyT &Key) { return find(Key); } 401 iterator getTail(const KeyT &Key) { 402 iterator I = find(Key); 404 I = iterator(this, I.Prev(), KeyIndexOf(Key)); 412 iterator B = find(K); 413 iterator E = iterator(this, SMSNode::INVALID, B.SparseIdx); 413 iterator E = iterator(this, SMSNode::INVALID, B.SparseIdx); 419 iterator insert(const ValueT &Val) { 421 iterator I = findIndex(Idx); 429 return iterator(this, NodeIdx, Idx); 439 return iterator(this, NodeIdx, Idx); 466 iterator erase(iterator I) { 466 iterator erase(iterator I) { 472 iterator NextI = unlink(Dense[I.Idx]); 483 for (iterator I = find(K); I != end(); /* empty */) 489 iterator unlink(const SMSNode &N) { 493 return iterator(this, SMSNode::INVALID, ValIndexOf(N.Data)); 500 return iterator(this, N.Next, ValIndexOf(N.Data)); 509 iterator I(this, N.Prev, ValIndexOf(N.Data)); 516 return iterator(this, N.Next, ValIndexOf(N.Data));lib/CodeGen/MachineScheduler.cpp
956 VReg2SUnitMultiMap::iterator UI = VRegUses.find(Reg);
lib/CodeGen/ScheduleDAGInstrs.cpp245 for (Reg2SUnitsMap::iterator I = Uses.find(*Alias); I != Uses.end(); ++I) { 302 for (Reg2SUnitsMap::iterator I = Defs.find(*Alias); I != Defs.end(); ++I) { 346 Reg2SUnitsMap::iterator B = P.first; 347 Reg2SUnitsMap::iterator I = P.second; 427 for (VReg2SUnitOperIdxMultiMap::iterator I = CurrentVRegUses.find(Reg),unittests/ADT/SparseMultiSetTest.cpp
43 USet::iterator I = Set.insert(5); 112 USet::iterator I = Set.erase(Set.find(6)); 173 USet::iterator B = RangePair.first; 174 USet::iterator E = RangePair.second; 191 USet::iterator Erased = Set.erase(Set.getTail(0)); 219 ASet::iterator I = Set.find(5);