[llvm] 93d41d8 - [LV] Use ElementCount::isKnownLT to factor code (NFC) (#130596)
via llvm-commits
llvm-commits at lists.llvm.org
Tue Mar 11 08:43:03 PDT 2025
Author: Ramkumar Ramachandra
Date: 2025-03-11T15:42:59Z
New Revision: 93d41d814816d2933735e3d238e6eebb91dfdc30
URL: https://github.com/llvm/llvm-project/commit/93d41d814816d2933735e3d238e6eebb91dfdc30
DIFF: https://github.com/llvm/llvm-project/commit/93d41d814816d2933735e3d238e6eebb91dfdc30.diff
LOG: [LV] Use ElementCount::isKnownLT to factor code (NFC) (#130596)
Added:
Modified:
llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
Removed:
################################################################################
diff --git a/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp b/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
index 383ec1d9ad3d8..bab2c6efd4035 100644
--- a/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
+++ b/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
@@ -4393,10 +4393,7 @@ void LoopVectorizationPlanner::emitInvalidCostRemarks(
sort(InvalidCosts, [&Numbering](RecipeVFPair &A, RecipeVFPair &B) {
if (Numbering[A.first] != Numbering[B.first])
return Numbering[A.first] < Numbering[B.first];
- const auto &LHS = A.second;
- const auto &RHS = B.second;
- return std::make_tuple(LHS.isScalable(), LHS.getKnownMinValue()) <
- std::make_tuple(RHS.isScalable(), RHS.getKnownMinValue());
+ return ElementCount::isKnownLT(A.second, B.second);
});
// For a list of ordered recipe-VF pairs:
More information about the llvm-commits
mailing list