@@ -513,7 +513,7 @@ void RuntimePointerChecking::groupChecks(
513
513
for (unsigned I = 0 ; I < Pointers.size (); ++I) {
514
514
// We've seen this pointer before, and therefore already processed
515
515
// its equivalence class.
516
- if (Seen.count (I))
516
+ if (Seen.contains (I))
517
517
continue ;
518
518
519
519
MemoryDepChecker::MemAccessInfo Access (Pointers[I].PointerValue ,
@@ -1212,7 +1212,7 @@ bool AccessAnalysis::canCheckPtrAtRT(
1212
1212
SmallVector<MemAccessInfo, 4 > AccessInfos;
1213
1213
for (const Value *ConstPtr : ASPointers) {
1214
1214
Value *Ptr = const_cast <Value *>(ConstPtr);
1215
- bool IsWrite = Accesses.count (MemAccessInfo (Ptr , true ));
1215
+ bool IsWrite = Accesses.contains (MemAccessInfo (Ptr , true ));
1216
1216
if (IsWrite)
1217
1217
++NumWritePtrChecks;
1218
1218
else
@@ -1341,9 +1341,10 @@ void AccessAnalysis::processMemAccesses() {
1341
1341
LLVM_DEBUG ({
1342
1342
for (const auto &[A, _] : Accesses)
1343
1343
dbgs () << " \t " << *A.getPointer () << " ("
1344
- << (A.getInt () ? " write"
1345
- : (ReadOnlyPtr.count (A.getPointer ()) ? " read-only"
1346
- : " read" ))
1344
+ << (A.getInt ()
1345
+ ? " write"
1346
+ : (ReadOnlyPtr.contains (A.getPointer ()) ? " read-only"
1347
+ : " read" ))
1347
1348
<< " )\n " ;
1348
1349
});
1349
1350
@@ -1387,13 +1388,13 @@ void AccessAnalysis::processMemAccesses() {
1387
1388
1388
1389
// If we're using the deferred access set, then it contains only
1389
1390
// reads.
1390
- bool IsReadOnlyPtr = ReadOnlyPtr.count (Ptr ) && !IsWrite;
1391
+ bool IsReadOnlyPtr = ReadOnlyPtr.contains (Ptr ) && !IsWrite;
1391
1392
if (UseDeferred && !IsReadOnlyPtr)
1392
1393
continue ;
1393
1394
// Otherwise, the pointer must be in the PtrAccessSet, either as a
1394
1395
// read or a write.
1395
1396
assert (((IsReadOnlyPtr && UseDeferred) || IsWrite ||
1396
- S.count (MemAccessInfo (Ptr , false ))) &&
1397
+ S.contains (MemAccessInfo (Ptr , false ))) &&
1397
1398
" Alias-set pointer not in the access set?" );
1398
1399
1399
1400
MemAccessInfo Access (Ptr , IsWrite);
@@ -2260,7 +2261,7 @@ bool MemoryDepChecker::areDepsSafe(const DepCandidates &AccessSets,
2260
2261
MinDepDistBytes = -1 ;
2261
2262
SmallPtrSet<MemAccessInfo, 8 > Visited;
2262
2263
for (MemAccessInfo CurAccess : CheckDeps) {
2263
- if (Visited.count (CurAccess))
2264
+ if (Visited.contains (CurAccess))
2264
2265
continue ;
2265
2266
2266
2267
// Check accesses within this set.
@@ -2605,7 +2606,7 @@ bool LoopAccessInfo::analyzeLoop(AAResults *AA, const LoopInfo *LI,
2605
2606
2606
2607
// See if there is an unsafe dependency between a load to a uniform address and
2607
2608
// store to the same uniform address.
2608
- if (UniformStores.count (Ptr )) {
2609
+ if (UniformStores.contains (Ptr )) {
2609
2610
LLVM_DEBUG (dbgs () << " LAA: Found an unsafe dependency between a uniform "
2610
2611
" load and uniform store to the same address!\n " );
2611
2612
HasLoadStoreDependenceInvolvingLoopInvariantAddress = true ;
0 commit comments