diff options
| author | Kazu Hirata <kazu@google.com> | 2022-08-28 17:35:03 -0700 |
|---|---|---|
| committer | Kazu Hirata <kazu@google.com> | 2022-08-28 17:35:03 -0700 |
| commit | ebf574f59a80ca00e234eee0b047e5f0df99587d (patch) | |
| tree | b32d36817bf50833aea148ebd44c3affa19f5e65 /llvm/lib/Analysis/LoopCacheAnalysis.cpp | |
| parent | b69086e6c76c87b13dbd120ea04a4f5f6a7d6d67 (diff) | |
[llvm] Use llvm::is_contained (NFC)
Diffstat (limited to 'llvm/lib/Analysis/LoopCacheAnalysis.cpp')
| -rw-r--r-- | llvm/lib/Analysis/LoopCacheAnalysis.cpp | 4 |
1 files changed, 1 insertions, 3 deletions
diff --git a/llvm/lib/Analysis/LoopCacheAnalysis.cpp b/llvm/lib/Analysis/LoopCacheAnalysis.cpp index 85f2dad86711..2e7e7d33512e 100644 --- a/llvm/lib/Analysis/LoopCacheAnalysis.cpp +++ b/llvm/lib/Analysis/LoopCacheAnalysis.cpp @@ -600,9 +600,7 @@ void CacheCost::calculateCacheFootprint() { LLVM_DEBUG(dbgs() << "COMPUTING LOOP CACHE COSTS\n"); for (const Loop *L : Loops) { - assert(llvm::none_of( - LoopCosts, - [L](const LoopCacheCostTy &LCC) { return LCC.first == L; }) && + assert(!llvm::is_contained(llvm::make_first_range(LoopCosts), L) && "Should not add duplicate element"); CacheCostTy LoopCost = computeLoopCacheCost(*L, RefGroups); LoopCosts.push_back(std::make_pair(L, LoopCost)); |