LLVM  15.0.0git
Public Member Functions | Static Public Member Functions | Protected Member Functions | List of all members
llvm::LoopVectorizationPlanner Class Reference

Planner drives the vectorization process after having passed Legality checks. More...

#include "Transforms/Vectorize/LoopVectorizationPlanner.h"

Public Member Functions

 LoopVectorizationPlanner (Loop *L, LoopInfo *LI, const TargetLibraryInfo *TLI, const TargetTransformInfo *TTI, LoopVectorizationLegality *Legal, LoopVectorizationCostModel &CM, InterleavedAccessInfo &IAI, PredicatedScalarEvolution &PSE, const LoopVectorizeHints &Hints, OptimizationRemarkEmitter *ORE)
 
Optional< VectorizationFactorplan (ElementCount UserVF, unsigned UserIC)
 Plan how to best vectorize, return the best VF and its cost, or None if vectorization and interleaving should be avoided up front. More...
 
VectorizationFactor planInVPlanNativePath (ElementCount UserVF)
 Use the VPlan-native path to plan how to best vectorize, return the best VF and its cost. More...
 
VPlangetBestPlanFor (ElementCount VF) const
 Return the best VPlan for VF. More...
 
void executePlan (ElementCount VF, unsigned UF, VPlan &BestPlan, InnerLoopVectorizer &LB, DominatorTree *DT, bool IsEpilogueVectorization)
 Generate the IR code for the body of the vectorized loop according to the best selected VF, UF and VPlan BestPlan. More...
 
void printPlans (raw_ostream &O)
 
bool hasPlanWithVF (ElementCount VF) const
 Look through the existing plans and return true if we have one with all the vectorization factors in question. More...
 
bool requiresTooManyRuntimeChecks () const
 Check if the number of runtime checks exceeds the threshold. More...
 

Static Public Member Functions

static bool getDecisionAndClampRange (const std::function< bool(ElementCount)> &Predicate, VFRange &Range)
 Test a Predicate on a Range of VF's. More...
 

Protected Member Functions

void buildVPlans (ElementCount MinVF, ElementCount MaxVF)
 Build VPlans for power-of-2 VF's between MinVF and MaxVF inclusive, according to the information gathered by Legal when it checked if it is legal to vectorize the loop. More...
 

Detailed Description

Planner drives the vectorization process after having passed Legality checks.

Definition at line 252 of file LoopVectorizationPlanner.h.

Constructor & Destructor Documentation

◆ LoopVectorizationPlanner()

llvm::LoopVectorizationPlanner::LoopVectorizationPlanner ( Loop L,
LoopInfo LI,
const TargetLibraryInfo TLI,
const TargetTransformInfo TTI,
LoopVectorizationLegality Legal,
LoopVectorizationCostModel CM,
InterleavedAccessInfo IAI,
PredicatedScalarEvolution PSE,
const LoopVectorizeHints Hints,
OptimizationRemarkEmitter ORE 
)
inline

Definition at line 286 of file LoopVectorizationPlanner.h.

References llvm::IRSimilarity::Legal.

Member Function Documentation

◆ buildVPlans()

void LoopVectorizationPlanner::buildVPlans ( ElementCount  MinVF,
ElementCount  MaxVF 
)
protected

Build VPlans for power-of-2 VF's between MinVF and MaxVF inclusive, according to the information gathered by Legal when it checked if it is legal to vectorize the loop.

Build VPlans for the full range of feasible VF's = {MinVF, 2 * MinVF, 4 * MinVF, ..., MaxVF} by repeatedly building a VPlan for a sub-range of VF's starting at a given VF and extending it as much as possible.

Each vectorization decision can potentially shorten this sub-range during buildVPlan().

Definition at line 7952 of file LoopVectorize.cpp.

References llvm::VFRange::End, llvm::UnivariateLinearPolyBase< LeafTy >::getWithIncrement(), llvm::LinearPolySize< ElementCount >::isKnownLT(), and llvm::InnerLoopVectorizer::VF.

◆ executePlan()

void LoopVectorizationPlanner::executePlan ( ElementCount  VF,
unsigned  UF,
VPlan BestPlan,
InnerLoopVectorizer LB,
DominatorTree DT,
bool  IsEpilogueVectorization 
)

Generate the IR code for the body of the vectorized loop according to the best selected VF, UF and VPlan BestPlan.

TODO: IsEpilogueVectorization is needed to avoid issues due to epilogue vectorization re-using plans for both the main and epilogue vector loops. It should be removed once the re-use issue has been fixed.

Definition at line 7556 of file LoopVectorize.cpp.

References AddRuntimeUnrollDisableMetaData(), llvm::InnerLoopVectorizer::Builder, llvm::InnerLoopVectorizer::collectPoisonGeneratingRecipes(), llvm::InnerLoopVectorizer::createVectorizedLoopSkeleton(), llvm::dbgs(), llvm::InnerLoopVectorizer::DT, llvm::VPlan::execute(), llvm::InnerLoopVectorizer::fixVectorizedLoop(), llvm::RuntimePointerChecking::getChecks(), llvm::RuntimePointerChecking::getDiffChecks(), llvm::VPBlockBase::getEntryBasicBlock(), llvm::LoopVectorizationLegality::getLAI(), llvm::LoopInfoBase< BlockT, LoopT >::getLoopFor(), llvm::Loop::getLoopID(), llvm::InnerLoopVectorizer::getOrCreateTripCount(), llvm::InnerLoopVectorizer::getOrCreateVectorTripCount(), llvm::LoopAccessInfo::getRuntimePointerChecking(), llvm::PredicatedScalarEvolution::getSE(), llvm::VPlan::getVectorLoopRegion(), llvm::InnerLoopVectorizer::Legal, llvm::InnerLoopVectorizer::LI, LLVM_DEBUG, LLVMLoopVectorizeFollowupAll, LLVMLoopVectorizeFollowupVectorized, llvm::makeFollowupLoopID(), llvm::InnerLoopVectorizer::ORE, llvm::InnerLoopVectorizer::OrigLoop, llvm::VPlan::prepareToExecute(), llvm::InnerLoopVectorizer::printDebugTracesAtEnd(), llvm::InnerLoopVectorizer::printDebugTracesAtStart(), llvm::InnerLoopVectorizer::PSE, llvm::LoopVectorizeHints::setAlreadyVectorized(), llvm::Loop::setLoopID(), and llvm::Optional< T >::value().

Referenced by llvm::LoopVectorizePass::processLoop(), and processLoopInVPlanNativePath().

◆ getBestPlanFor()

VPlan & LoopVectorizationPlanner::getBestPlanFor ( ElementCount  VF) const

◆ getDecisionAndClampRange()

bool LoopVectorizationPlanner::getDecisionAndClampRange ( const std::function< bool(ElementCount)> &  Predicate,
VFRange Range 
)
static

Test a Predicate on a Range of VF's.

Return the value of applying Predicate on Range.Start, possibly decreasing Range.End such that the returned value holds for the entire Range.

Definition at line 7932 of file LoopVectorize.cpp.

References assert(), llvm::VFRange::End, llvm::VFRange::isEmpty(), llvm::LinearPolySize< ElementCount >::isKnownLT(), and llvm::VFRange::Start.

Referenced by createWidenInductionRecipes(), llvm::VPRecipeBuilder::handleReplication(), and llvm::VPRecipeBuilder::tryToCreateWidenRecipe().

◆ hasPlanWithVF()

bool llvm::LoopVectorizationPlanner::hasPlanWithVF ( ElementCount  VF) const
inline

Look through the existing plans and return true if we have one with all the vectorization factors in question.

Definition at line 323 of file LoopVectorizationPlanner.h.

References llvm::any_of().

Referenced by llvm::LoopVectorizationCostModel::selectEpilogueVectorizationFactor().

◆ plan()

Optional< VectorizationFactor > LoopVectorizationPlanner::plan ( ElementCount  UserVF,
unsigned  UserIC 
)

◆ planInVPlanNativePath()

VectorizationFactor LoopVectorizationPlanner::planInVPlanNativePath ( ElementCount  UserVF)

◆ printPlans()

void LoopVectorizationPlanner::printPlans ( raw_ostream O)

Definition at line 7643 of file LoopVectorize.cpp.

References llvm::RISCVFenceField::O, and PrintVPlansInDotFormat.

◆ requiresTooManyRuntimeChecks()

bool llvm::LoopVectorizationPlanner::requiresTooManyRuntimeChecks ( ) const

Check if the number of runtime checks exceeds the threshold.


The documentation for this class was generated from the following files: