reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
400 iterator getHead(const KeyT &Key) { return find(Key); } 402 iterator I = find(Key); 412 iterator B = find(K); 483 for (iterator I = find(K); I != end(); /* empty */)lib/CodeGen/MachineScheduler.cpp
956 VReg2SUnitMultiMap::iterator UI = VRegUses.find(Reg); 1111 : make_range(VRegUses.find(Reg), VRegUses.end())) { 1143 : make_range(VRegUses.find(Reg), VRegUses.end())) { 1340 : make_range(VRegUses.find(Reg), VRegUses.end())) {lib/CodeGen/ScheduleDAGInstrs.cpp
245 for (Reg2SUnitsMap::iterator I = Uses.find(*Alias); I != Uses.end(); ++I) { 302 for (Reg2SUnitsMap::iterator I = Defs.find(*Alias); I != Defs.end(); ++I) { 376 auto RegUse = CurrentVRegUses.find(MO.getReg()); 427 for (VReg2SUnitOperIdxMultiMap::iterator I = CurrentVRegUses.find(Reg), 468 for (VReg2SUnit &V2SU : make_range(CurrentVRegDefs.find(Reg), 519 for (VReg2SUnit &V2SU : make_range(CurrentVRegDefs.find(Reg),unittests/ADT/SparseMultiSetTest.cpp
27 EXPECT_TRUE(Set.find(0) == Set.end()); 28 EXPECT_TRUE(Set.find(9) == Set.end()); 50 EXPECT_TRUE(Set.find(0) == Set.end()); 51 EXPECT_TRUE(Set.find(9) == Set.end()); 59 EXPECT_TRUE(I == ++Set.find(5)); 61 EXPECT_TRUE(I == Set.find(5)); 64 I = Set.find(1); 67 EXPECT_EQ(5u, *Set.find(5)); 70 I = Set.find(5); 94 EXPECT_TRUE(Set.erase(Set.find(4)) == Set.end()); 97 EXPECT_TRUE(Set.find(4) == Set.end()); 101 EXPECT_TRUE(Set.find(5) != Set.end()); 102 EXPECT_TRUE(Set.erase(Set.find(5)) != Set.end()); 112 USet::iterator I = Set.erase(Set.find(6)); 203 B = Set2.find(3); 204 EXPECT_EQ(Set2.find(3), --(++B)); 219 ASet::iterator I = Set.find(5); 225 I = Set.erase(Set.find(6)); 228 I = Set.erase(Set.find(6));