[LV-L] Add const and move method body out of line [nfc]

This commit is contained in:
Philip Reames 2022-08-18 11:10:11 -07:00 committed by Philip Reames
parent 1db43b7ba9
commit 1436adae2c
2 changed files with 14 additions and 12 deletions
llvm
include/llvm/Transforms/Vectorize
lib/Transforms/Vectorize

View File

@ -352,20 +352,11 @@ public:
int isConsecutivePtr(Type *AccessTy, Value *Ptr) const;
/// Returns true if the value V is uniform within the loop.
bool isUniform(Value *V);
bool isUniform(Value *V) const;
/// 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());
}
bool isUniformMemOp(Instruction &I) const;
/// Returns the information that we collected about runtime memory check.
const RuntimePointerChecking *getRuntimePointerChecking() const {

View File

@ -462,10 +462,21 @@ int LoopVectorizationLegality::isConsecutivePtr(Type *AccessTy,
return 0;
}
bool LoopVectorizationLegality::isUniform(Value *V) {
bool LoopVectorizationLegality::isUniform(Value *V) const {
return LAI->isUniform(V);
}
bool LoopVectorizationLegality::isUniformMemOp(Instruction &I) const {
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());
}
bool LoopVectorizationLegality::canVectorizeOuterLoop() {
assert(!TheLoop->isInnermost() && "We are not vectorizing an outer loop.");
// Store the result and return it at the end instead of exiting early, in case