reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
126 P->getFirst() = EmptyKey; 130 if (!KeyInfoT::isEqual(P->getFirst(), EmptyKey)) { 131 if (!KeyInfoT::isEqual(P->getFirst(), TombstoneKey)) { 135 P->getFirst() = EmptyKey; 278 TheBucket->getFirst() = getTombstoneKey(); 286 TheBucket->getFirst() = getTombstoneKey(); 336 if (!KeyInfoT::isEqual(P->getFirst(), EmptyKey) && 337 !KeyInfoT::isEqual(P->getFirst(), TombstoneKey)) 339 P->getFirst().~KeyT(); 351 ::new (&B->getFirst()) KeyT(EmptyKey); 372 if (!KeyInfoT::isEqual(B->getFirst(), EmptyKey) && 373 !KeyInfoT::isEqual(B->getFirst(), TombstoneKey)) { 376 bool FoundVal = LookupBucketFor(B->getFirst(), DestBucket); 379 DestBucket->getFirst() = std::move(B->getFirst()); 379 DestBucket->getFirst() = std::move(B->getFirst()); 386 B->getFirst().~KeyT(); 405 ::new (&getBuckets()[i].getFirst()) 407 if (!KeyInfoT::isEqual(getBuckets()[i].getFirst(), getEmptyKey()) && 408 !KeyInfoT::isEqual(getBuckets()[i].getFirst(), getTombstoneKey())) 519 TheBucket->getFirst() = std::forward<KeyArg>(Key); 567 if (!KeyInfoT::isEqual(TheBucket->getFirst(), EmptyKey)) 918 bool hasLHSValue = (!KeyInfoT::isEqual(LHSB->getFirst(), EmptyKey) && 919 !KeyInfoT::isEqual(LHSB->getFirst(), TombstoneKey)); 920 bool hasRHSValue = (!KeyInfoT::isEqual(RHSB->getFirst(), EmptyKey) && 921 !KeyInfoT::isEqual(RHSB->getFirst(), TombstoneKey)); 928 std::swap(LHSB->getFirst(), RHSB->getFirst()); 928 std::swap(LHSB->getFirst(), RHSB->getFirst()); 959 ::new (&NewB->getFirst()) KeyT(std::move(OldB->getFirst())); 959 ::new (&NewB->getFirst()) KeyT(std::move(OldB->getFirst())); 960 OldB->getFirst().~KeyT(); 961 if (!KeyInfoT::isEqual(NewB->getFirst(), EmptyKey) && 962 !KeyInfoT::isEqual(NewB->getFirst(), TombstoneKey)) { 1026 if (!KeyInfoT::isEqual(P->getFirst(), EmptyKey) && 1027 !KeyInfoT::isEqual(P->getFirst(), TombstoneKey)) { 1030 ::new (&TmpEnd->getFirst()) KeyT(std::move(P->getFirst())); 1030 ::new (&TmpEnd->getFirst()) KeyT(std::move(P->getFirst())); 1035 P->getFirst().~KeyT(); 1252 while (Ptr != End && (KeyInfoT::isEqual(Ptr->getFirst(), Empty) || 1253 KeyInfoT::isEqual(Ptr->getFirst(), Tombstone))) 1262 while (Ptr != End && (KeyInfoT::isEqual(Ptr[-1].getFirst(), Empty) || 1263 KeyInfoT::isEqual(Ptr[-1].getFirst(), Tombstone)))lib/CodeGen/SafeStackColoring.cpp
143 ProcessMarker(BlockMarkerSet.begin()->getFirst(), 207 BasicBlock *BB = IT.getFirst(); 264 BasicBlock *BB = IT.getFirst();lib/CodeGen/SafeStackLayout.cpp
37 OS << " at " << IT.getSecond() << ": " << *IT.getFirst() << "\n";
lib/Transforms/Vectorize/SLPVectorizer.cpp2384 StoredCurrentOrderAndNum->getFirst()); 2465 ReuseShuffleIndicies, I->getFirst());tools/polly/lib/Analysis/ScopDetection.cpp
1704 emitRejectionRemarks(DIt.getFirst(), DC.Log, ORE);