[llvm] 2240d3d - [LoopVec] Introduce an api for detecting uniform memory ops
Philip Reames via llvm-commits
llvm-commits at lists.llvm.org
Mon Nov 16 13:30:55 PST 2020
Author: Philip Reames
Date: 2020-11-16T13:30:48-08:00
New Revision: 2240d3d05451e4712050308cc4b922dea03fbc78
URL: https://github.com/llvm/llvm-project/commit/2240d3d05451e4712050308cc4b922dea03fbc78
DIFF: https://github.com/llvm/llvm-project/commit/2240d3d05451e4712050308cc4b922dea03fbc78.diff
LOG: [LoopVec] Introduce an api for detecting uniform memory ops
Split off D91398 at request of reviewer.
Added:
Modified:
llvm/include/llvm/Transforms/Vectorize/LoopVectorizationLegality.h
llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
Removed:
################################################################################
diff --git a/llvm/include/llvm/Transforms/Vectorize/LoopVectorizationLegality.h b/llvm/include/llvm/Transforms/Vectorize/LoopVectorizationLegality.h
index 46d107128ce1..ae8d545d6112 100644
--- a/llvm/include/llvm/Transforms/Vectorize/LoopVectorizationLegality.h
+++ b/llvm/include/llvm/Transforms/Vectorize/LoopVectorizationLegality.h
@@ -289,6 +289,19 @@ class LoopVectorizationLegality {
/// Returns true if the value V is uniform within the loop.
bool isUniform(Value *V);
+ /// A uniform memory op is a load or store which accesses the same memory
+ /// location on all lanes.
+ bool isUniformMemOp(Instruction &I) {
+ Value *Ptr = getLoadStorePointerOperand(&I);
+ if (!Ptr)
+ return false;
+ // Note: There's nothing inherent which prevents predicated loads and
+ // stores from being uniform. The current lowering simply doesn't handle
+ // it; in particular, the cost model distinguishes scatter/gather from
+ // scalar w/predication, and we currently rely on the scalar path.
+ return isUniform(Ptr) && !blockNeedsPredication(I.getParent());
+ }
+
/// Returns the information that we collected about runtime memory check.
const RuntimePointerChecking *getRuntimePointerChecking() const {
return LAI->getRuntimePointerChecking();
diff --git a/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp b/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
index 4a0e40a1267f..caa5533cc344 100644
--- a/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
+++ b/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp
@@ -6415,11 +6415,7 @@ void LoopVectorizationCostModel::setCostBasedWideningDecision(ElementCount VF) {
if (isa<StoreInst>(&I) && isScalarWithPredication(&I))
NumPredStores++;
- if (Legal->isUniform(Ptr) &&
- // Conditional loads and stores should be scalarized and predicated.
- // isScalarWithPredication cannot be used here since masked
- // gather/scatters are not considered scalar with predication.
- !Legal->blockNeedsPredication(I.getParent())) {
+ if (Legal->isUniformMemOp(I)) {
// TODO: Avoid replicating loads and stores instead of
// relying on instcombine to remove them.
// Load: Scalar load + broadcast
More information about the llvm-commits
mailing list