25#ifndef LLVM_TRANSFORMS_VECTORIZE_VPLAN_H
26#define LLVM_TRANSFORMS_VECTORIZE_VPLAN_H
53class InnerLoopVectorizer;
57class RecurrenceDescriptor;
63class VPReplicateRecipe;
82 Loop *CurLoop =
nullptr);
101 "Both Start and End should have the same scalable flag");
103 "Expected Start to be a power of 2");
105 "Expected End to be a power of 2");
165 VPLane(
unsigned Lane,
Kind LaneKind) : Lane(Lane), LaneKind(LaneKind) {}
178 return VPLane(LaneOffset, LaneKind);
280 unsigned CacheIdx =
Instance.Lane.mapToCacheIndex(
VF);
281 return Instance.Part <
I->second.size() &&
282 CacheIdx <
I->second[
Instance.Part].size() &&
294 "scalar values must be stored as (Part, 0)");
306 "need to overwrite existing value");
307 Iter->second[Part] = V;
313 auto &PerPartVec = Iter.first->second;
314 if (PerPartVec.size() <=
Instance.Part)
315 PerPartVec.resize(
Instance.Part + 1);
316 auto &Scalars = PerPartVec[
Instance.Part];
317 unsigned CacheIdx =
Instance.Lane.mapToCacheIndex(
VF);
318 if (Scalars.size() <= CacheIdx)
319 Scalars.resize(CacheIdx + 1);
320 assert(!Scalars[CacheIdx] &&
"should overwrite existing value");
321 Scalars[CacheIdx] = V;
328 "need to overwrite existing value");
330 "need to overwrite existing value");
331 unsigned CacheIdx =
Instance.Lane.mapToCacheIndex(
VF);
333 "need to overwrite existing value");
334 Iter->second[
Instance.Part][CacheIdx] = V;
424 const unsigned char SubclassID;
441 VPlan *Plan =
nullptr;
451 assert(Predecessor &&
"Cannot add nullptr predecessor!");
456 void removePredecessor(VPBlockBase *Predecessor) {
457 auto Pos =
find(Predecessors, Predecessor);
458 assert(Pos &&
"Predecessor does not exist");
459 Predecessors.
erase(Pos);
463 void removeSuccessor(VPBlockBase *
Successor) {
465 assert(Pos &&
"Successor does not exist");
466 Successors.
erase(Pos);
471 : SubclassID(SC),
Name(
N) {}
478 using VPBlockTy =
enum { VPBasicBlockSC, VPRegionBlockSC };
529 return (Successors.
size() == 1 ? *Successors.
begin() :
nullptr);
535 return (Predecessors.
size() == 1 ? *Predecessors.
begin() :
nullptr);
588 assert(Successors.
empty() &&
"Setting one successor when others exist.");
590 "connected blocks must have the same parent");
599 assert(Successors.
empty() &&
"Setting two successors when others exist.");
600 appendSuccessor(IfTrue);
601 appendSuccessor(IfFalse);
608 assert(Predecessors.
empty() &&
"Block predecessors already set.");
609 for (
auto *Pred : NewPreds)
610 appendPredecessor(Pred);
637#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
694 "Op must be an operand of the recipe");
700#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
728 template <
typename IterT>
808#define VP_CLASSOF_IMPL(VPDefID) \
809 static inline bool classof(const VPDef *D) { \
810 return D->getVPDefID() == VPDefID; \
812 static inline bool classof(const VPValue *V) { \
813 auto *R = V->getDefiningRecipe(); \
814 return R && R->getVPDefID() == VPDefID; \
816 static inline bool classof(const VPUser *U) { \
817 auto *R = dyn_cast<VPRecipeBase>(U); \
818 return R && R->getVPDefID() == VPDefID; \
820 static inline bool classof(const VPRecipeBase *R) { \
821 return R->getVPDefID() == VPDefID; \
823 static inline bool classof(const VPSingleDefRecipe *R) { \
824 return R->getVPDefID() == VPDefID; \
832 template <
typename IterT>
840 template <
typename IterT>
846 switch (R->getVPDefID()) {
847 case VPRecipeBase::VPDerivedIVSC:
848 case VPRecipeBase::VPExpandSCEVSC:
849 case VPRecipeBase::VPInstructionSC:
850 case VPRecipeBase::VPReductionSC:
851 case VPRecipeBase::VPReplicateSC:
852 case VPRecipeBase::VPScalarIVStepsSC:
853 case VPRecipeBase::VPVectorPointerSC:
854 case VPRecipeBase::VPWidenCallSC:
855 case VPRecipeBase::VPWidenCanonicalIVSC:
856 case VPRecipeBase::VPWidenCastSC:
857 case VPRecipeBase::VPWidenGEPSC:
858 case VPRecipeBase::VPWidenSC:
859 case VPRecipeBase::VPWidenSelectSC:
860 case VPRecipeBase::VPBlendSC:
861 case VPRecipeBase::VPPredInstPHISC:
862 case VPRecipeBase::VPCanonicalIVPHISC:
863 case VPRecipeBase::VPActiveLaneMaskPHISC:
864 case VPRecipeBase::VPFirstOrderRecurrencePHISC:
865 case VPRecipeBase::VPWidenPHISC:
866 case VPRecipeBase::VPWidenIntOrFpInductionSC:
867 case VPRecipeBase::VPWidenPointerInductionSC:
868 case VPRecipeBase::VPReductionPHISC:
869 case VPRecipeBase::VPScalarCastSC:
871 case VPRecipeBase::VPInterleaveSC:
872 case VPRecipeBase::VPBranchOnMaskSC:
873 case VPRecipeBase::VPWidenMemoryInstructionSC:
882 auto *R = dyn_cast<VPRecipeBase>(U);
897 enum class OperationType :
unsigned char {
923 struct DisjointFlagsTy {
926 struct ExactFlagsTy {
929 struct NonNegFlagsTy {
932 struct FastMathFlagsTy {
941 FastMathFlagsTy(
const FastMathFlags &FMF);
944 OperationType OpType;
959 OpType =
Other.OpType;
964 template <
typename IterT>
967 OpType = OperationType::Other;
971 template <
typename IterT>
974 if (
auto *
Op = dyn_cast<CmpInst>(&
I)) {
975 OpType = OperationType::Cmp;
977 }
else if (
auto *
Op = dyn_cast<PossiblyDisjointInst>(&
I)) {
978 OpType = OperationType::DisjointOp;
980 }
else if (
auto *
Op = dyn_cast<OverflowingBinaryOperator>(&
I)) {
981 OpType = OperationType::OverflowingBinOp;
982 WrapFlags = {
Op->hasNoUnsignedWrap(),
Op->hasNoSignedWrap()};
983 }
else if (
auto *
Op = dyn_cast<PossiblyExactOperator>(&
I)) {
984 OpType = OperationType::PossiblyExactOp;
986 }
else if (
auto *
GEP = dyn_cast<GetElementPtrInst>(&
I)) {
987 OpType = OperationType::GEPOp;
989 }
else if (
auto *PNNI = dyn_cast<PossiblyNonNegInst>(&
I)) {
990 OpType = OperationType::NonNegOp;
992 }
else if (
auto *
Op = dyn_cast<FPMathOperator>(&
I)) {
993 OpType = OperationType::FPMathOp;
994 FMFs =
Op->getFastMathFlags();
996 OpType = OperationType::Other;
1001 template <
typename IterT>
1007 template <
typename IterT>
1013 template <
typename IterT>
1020 template <
typename IterT>
1028 return R->getVPDefID() == VPRecipeBase::VPInstructionSC ||
1029 R->getVPDefID() == VPRecipeBase::VPWidenSC ||
1030 R->getVPDefID() == VPRecipeBase::VPWidenGEPSC ||
1031 R->getVPDefID() == VPRecipeBase::VPWidenCastSC ||
1032 R->getVPDefID() == VPRecipeBase::VPReplicateSC ||
1033 R->getVPDefID() == VPRecipeBase::VPVectorPointerSC;
1041 case OperationType::OverflowingBinOp:
1045 case OperationType::DisjointOp:
1048 case OperationType::PossiblyExactOp:
1051 case OperationType::GEPOp:
1054 case OperationType::FPMathOp:
1055 FMFs.NoNaNs =
false;
1056 FMFs.NoInfs =
false;
1058 case OperationType::NonNegOp:
1061 case OperationType::Cmp:
1062 case OperationType::Other:
1070 case OperationType::OverflowingBinOp:
1074 case OperationType::DisjointOp:
1075 cast<PossiblyDisjointInst>(
I)->setIsDisjoint(
DisjointFlags.IsDisjoint);
1077 case OperationType::PossiblyExactOp:
1080 case OperationType::GEPOp:
1083 case OperationType::FPMathOp:
1084 I->setHasAllowReassoc(
FMFs.AllowReassoc);
1085 I->setHasNoNaNs(
FMFs.NoNaNs);
1086 I->setHasNoInfs(
FMFs.NoInfs);
1087 I->setHasNoSignedZeros(
FMFs.NoSignedZeros);
1088 I->setHasAllowReciprocal(
FMFs.AllowReciprocal);
1089 I->setHasAllowContract(
FMFs.AllowContract);
1090 I->setHasApproxFunc(
FMFs.ApproxFunc);
1092 case OperationType::NonNegOp:
1095 case OperationType::Cmp:
1096 case OperationType::Other:
1102 assert(OpType == OperationType::Cmp &&
1103 "recipe doesn't have a compare predicate");
1108 assert(OpType == OperationType::GEPOp &&
1109 "recipe doesn't have inbounds flag");
1119 assert(OpType == OperationType::OverflowingBinOp &&
1120 "recipe doesn't have a NUW flag");
1125 assert(OpType == OperationType::OverflowingBinOp &&
1126 "recipe doesn't have a NSW flag");
1130#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1146 Instruction::OtherOpsEnd + 1,
1161 typedef unsigned char OpcodeTy;
1165 const std::string
Name;
1176 bool isFPMathOp()
const;
1183 Opcode(Opcode),
Name(
Name.str()) {}
1190 VPValue *
B, DebugLoc
DL = {},
const Twine &
Name =
"");
1195 Opcode(Opcode),
Name(
Name.str()) {}
1197 VPInstruction(
unsigned Opcode, std::initializer_list<VPValue *>
Operands,
1198 FastMathFlags
FMFs, DebugLoc
DL = {},
const Twine &
Name =
"");
1205 New->transferFlags(*
this);
1216#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1229 return Opcode == Instruction::Store || Opcode == Instruction::Call ||
1230 Opcode == Instruction::Invoke || Opcode ==
SLPStore;
1237 case Instruction::Ret:
1238 case Instruction::Br:
1239 case Instruction::Store:
1240 case Instruction::Switch:
1241 case Instruction::IndirectBr:
1242 case Instruction::Resume:
1243 case Instruction::CatchRet:
1244 case Instruction::Unreachable:
1245 case Instruction::Fence:
1246 case Instruction::AtomicRMW:
1261 "Op must be an operand of the recipe");
1281 template <
typename IterT>
1290 R->transferFlags(*
this);
1301#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1320 ResultTy(ResultTy) {
1322 "opcode of underlying cast doesn't match");
1324 "result type of underlying cast doesn't match");
1329 ResultTy(ResultTy) {}
1336 *cast<CastInst>(UV));
1346#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1369 ResultTy(ResultTy) {}
1381#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1392 "Op must be an operand of the recipe");
1409 template <
typename IterT>
1414 VectorIntrinsicID(VectorIntrinsicID), Variant(Variant) {}
1429#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1438 template <
typename IterT>
1455#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1472 bool isPointerLoopInvariant()
const {
1476 bool isIndexLoopInvariant(
unsigned I)
const {
1480 bool areAllOperandsInvariant()
const {
1482 return Op->isDefinedOutsideVectorRegions();
1487 template <
typename IterT>
1503#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1522 IndexedTy(IndexedTy), IsReverse(IsReverse) {}
1530 "Op must be an operand of the recipe");
1539#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1583 return B->getVPDefID() >= VPDef::VPFirstHeaderPHISC &&
1584 B->getVPDefID() <= VPDef::VPLastHeaderPHISC;
1587 auto *
B = V->getDefiningRecipe();
1588 return B &&
B->getVPDefID() >= VPRecipeBase::VPFirstHeaderPHISC &&
1589 B->getVPDefID() <= VPRecipeBase::VPLastHeaderPHISC;
1595#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1635 Trunc(nullptr), IndDesc(IndDesc) {
1643 IV(IV), Trunc(Trunc), IndDesc(IndDesc) {
1660#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1670 "VPWidenIntOrFpInductionRecipe generates its own backedge value");
1677 "VPWidenIntOrFpInductionRecipe generates its own backedge value");
1707 bool IsScalarAfterVectorization;
1714 bool IsScalarAfterVectorization)
1717 IsScalarAfterVectorization(IsScalarAfterVectorization) {
1727 IndDesc, IsScalarAfterVectorization);
1741#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1774#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1783 IncomingBlocks.
push_back(IncomingBlock);
1803 return R->getVPDefID() == VPDef::VPFirstOrderRecurrencePHISC;
1813#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1837 VPValue &Start,
bool IsInLoop =
false,
1838 bool IsOrdered =
false)
1840 RdxDesc(RdxDesc), IsInLoop(IsInLoop), IsOrdered(IsOrdered) {
1841 assert((!IsOrdered || IsInLoop) &&
"IsOrdered requires IsInLoop");
1857 return R->getVPDefID() == VPDef::VPReductionPHISC;
1863#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1891 "Expected either a single incoming value or a positive even number "
1915#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
1924 "Op must be an operand of the recipe");
1928 [
this](
VPUser *U) {
return U->onlyFirstLaneUsed(
this); });
1941 bool HasMask =
false;
1945 bool NeedsMaskForGaps =
false;
1950 bool NeedsMaskForGaps)
1952 NeedsMaskForGaps(NeedsMaskForGaps) {
1953 for (
unsigned i = 0; i < IG->
getFactor(); ++i)
1955 if (
I->getType()->isVoidTy())
1960 for (
auto *SV : StoredValues)
2000#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
2017 "Op must be an operand of the recipe");
2051#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
2079 template <
typename IterT>
2081 bool IsUniform,
VPValue *Mask =
nullptr)
2083 IsUniform(IsUniform), IsPredicated(Mask) {
2094 Copy->transferFlags(*
this);
2105#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
2118 "Op must be an operand of the recipe");
2125 "Op must be an operand of the recipe");
2160#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
2164 O << Indent <<
"BRANCH-ON-MASK ";
2183 "Op must be an operand of the recipe");
2210#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
2219 "Op must be an operand of the recipe");
2245 bool isMasked()
const {
2251 bool Consecutive,
bool Reverse)
2253 Ingredient(Load), Consecutive(Consecutive),
Reverse(Reverse) {
2254 assert((Consecutive || !Reverse) &&
"Reverse implies consecutive");
2261 bool Consecutive,
bool Reverse)
2263 Ingredient(Store), Consecutive(Consecutive),
Reverse(Reverse) {
2264 assert((Consecutive || !Reverse) &&
"Reverse implies consecutive");
2293 bool isStore()
const {
return isa<StoreInst>(Ingredient); }
2297 assert(
isStore() &&
"Stored value only available for store instructions");
2311#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
2320 "Op must be an operand of the recipe");
2350#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
2379 return D->getVPDefID() == VPDef::VPCanonicalIVPHISC;
2385#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
2399 "Op must be an operand of the recipe");
2406 "Op must be an operand of the recipe");
2435 return D->getVPDefID() == VPDef::VPActiveLaneMaskPHISC;
2441#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
2458 cast<VPCanonicalIVPHIRecipe>(
getOperand(0)));
2468#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
2495 Kind(Kind), FPBinOp(FPBinOp) {}
2503 Start, CanonicalIV, Step) {}
2518#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
2530 return cast<VPCanonicalIVPHIRecipe>(
getOperand(1));
2537 "Op must be an operand of the recipe");
2552 InductionOpcode(Opcode) {}
2557 IV, Step, IndDesc.getInductionOpcode(),
2575#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
2586 "Op must be an operand of the recipe");
2610 while (!Recipes.empty())
2633 inline size_t size()
const {
return Recipes.size(); }
2634 inline bool empty()
const {
return Recipes.empty(); }
2645 return &VPBasicBlock::Recipes;
2650 return V->getVPBlockID() == VPBlockBase::VPBasicBlockSC;
2654 assert(Recipe &&
"No recipe to append.");
2655 assert(!Recipe->Parent &&
"Recipe already in VPlan");
2656 Recipe->Parent =
this;
2657 Recipes.
insert(InsertPt, Recipe);
2685#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
2709 NewBlock->appendRecipe(R.clone());
2741 const std::string &Name =
"",
bool IsReplicator =
false)
2742 :
VPBlockBase(VPRegionBlockSC, Name), Entry(Entry), Exiting(Exiting),
2743 IsReplicator(IsReplicator) {
2744 assert(Entry->getPredecessors().empty() &&
"Entry block has predecessors.");
2746 Entry->setParent(
this);
2750 :
VPBlockBase(VPRegionBlockSC, Name), Entry(nullptr), Exiting(nullptr),
2751 IsReplicator(IsReplicator) {}
2756 Entry->dropAllReferences(&DummyValue);
2763 return V->getVPBlockID() == VPBlockBase::VPRegionBlockSC;
2773 "Entry block cannot have predecessors.");
2785 "Exit block cannot have successors.");
2786 Exiting = ExitingBlock;
2806#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
2857 VPValue *BackedgeTakenCount =
nullptr;
2875 bool Value2VPValueEnabled =
true;
2891 :
VPlan(Preheader, Entry) {
2900 : Entry(Entry), Preheader(Preheader) {
2901 Entry->setPlan(
this);
2905 "preheader must be disconnected");
2930 assert(TripCount &&
"trip count needs to be set before accessing it");
2938 "TripCount always must be set");
2939 TripCount = NewTripCount;
2944 if (!BackedgeTakenCount)
2945 BackedgeTakenCount =
new VPValue();
2946 return BackedgeTakenCount;
2962 assert(
hasVF(VF) &&
"Cannot set VF not already in plan");
2977 assert(
hasUF(UF) &&
"Cannot set the UF not already in plan");
2989 "Value2VPValue mapping may be out of date!");
2990 assert(V &&
"Trying to add a null Value to VPlan");
2991 assert(!Value2VPValue.
count(V) &&
"Value already exists in VPlan");
2992 Value2VPValue[V] = VPV;
2997 assert(V &&
"Trying to get the VPValue of a null Value");
2998 assert(Value2VPValue.
count(V) &&
"Value does not exist in VPlan");
2999 assert((Value2VPValueEnabled || Value2VPValue[V]->isLiveIn()) &&
3000 "Value2VPValue mapping may be out of date!");
3001 return Value2VPValue[V];
3007 assert(V &&
"Trying to get or add the VPValue of a null Value");
3008 if (!Value2VPValue.
count(V)) {
3017#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
3043 return cast<VPRegionBlock>(
getEntry()->getSingleSuccessor());
3046 return cast<VPRegionBlock>(
getEntry()->getSingleSuccessor());
3052 if (EntryVPBB->
empty()) {
3056 return cast<VPCanonicalIVPHIRecipe>(&*EntryVPBB->
begin());
3062 delete LiveOuts[PN];
3071 return SCEVToExpansion.
lookup(S);
3076 SCEVToExpansion[S] = V;
3095#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
3102 unsigned TabWidth = 2;
3110 void bumpIndent(
int b) { Indent = std::string((
Depth += b) * TabWidth,
' '); }
3136 const Twine &Label);
3181 "Can't insert new block with predecessors or successors.");
3200 "Can't insert IfTrue with successors.");
3202 "Can't insert IfFalse with successors.");
3216 "Can't connect two block with different parents");
3218 "Blocks can't have more than two successors.");
3219 From->appendSuccessor(To);
3220 To->appendPredecessor(
From);
3226 assert(To &&
"Successor to disconnect is null.");
3227 From->removeSuccessor(To);
3228 To->removePredecessor(
From);
3233 template <
typename BlockTy,
typename T>
3236 using BaseTy = std::conditional_t<std::is_const<BlockTy>::value,
3246 return cast<BlockTy>(&
Block);
3275 for (
auto &
I : InterleaveGroupMap)
3277 for (
auto *
Ptr : DelSet)
3286 return InterleaveGroupMap.
lookup(Instr);
3293 enum class OpMode {
Failed, Load, Opcode };
3297 struct BundleDenseMapInfo {
3299 return {
reinterpret_cast<VPValue *
>(-1)};
3303 return {
reinterpret_cast<VPValue *
>(-2)};
3327 bool CompletelySLP =
true;
3330 unsigned WidestBundleBits = 0;
3332 using MultiNodeOpTy =
3333 typename std::pair<VPInstruction *, SmallVector<VPValue *, 4>>;
3342 bool MultiNodeActive =
false;
3364#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
3408 assert(Def &&
"Must have definition for value defined inside vector region");
3409 if (
auto Rep = dyn_cast<VPReplicateRecipe>(Def))
3410 return Rep->isUniform();
3411 if (
auto *
GEP = dyn_cast<VPWidenGEPRecipe>(Def))
3413 if (
auto *VPI = dyn_cast<VPInstruction>(Def))
MachineBasicBlock MachineBasicBlock::iterator DebugLoc DL
static MCDisassembler::DecodeStatus addOperand(MCInst &Inst, const MCOperand &Opnd)
BlockVerifier::State From
static GCRegistry::Add< OcamlGC > B("ocaml", "ocaml 3.10-compatible GC")
static GCRegistry::Add< ErlangGC > A("erlang", "erlang-compatible garbage collector")
static GCRegistry::Add< StatepointGC > D("statepoint-example", "an example strategy for statepoint")
#define LLVM_DUMP_METHOD
Mark debug helper function definitions like dump() that should not be stripped from debug builds.
Returns the sub type a function will return at a given Idx Should correspond to the result type of an ExtractValue instruction executed with just that one unsigned Idx
This file defines the DenseMap class.
std::optional< std::vector< StOtherPiece > > Other
std::pair< BasicBlock *, unsigned > BlockTy
A pair of (basic block, score).
mir Rename Register Operands
This file implements a map that provides insertion order iteration.
static cl::opt< RegAllocEvictionAdvisorAnalysis::AdvisorMode > Mode("regalloc-enable-advisor", cl::Hidden, cl::init(RegAllocEvictionAdvisorAnalysis::AdvisorMode::Default), cl::desc("Enable regalloc advisor mode"), cl::values(clEnumValN(RegAllocEvictionAdvisorAnalysis::AdvisorMode::Default, "default", "Default"), clEnumValN(RegAllocEvictionAdvisorAnalysis::AdvisorMode::Release, "release", "precompiled"), clEnumValN(RegAllocEvictionAdvisorAnalysis::AdvisorMode::Development, "development", "for training")))
assert(ImpDefSCC.getReg()==AMDGPU::SCC &&ImpDefSCC.isDef())
This file implements the SmallBitVector class.
This file defines the SmallPtrSet class.
This file defines the SmallVector class.
This file contains the declarations of the entities induced by Vectorization Plans,...
#define VP_CLASSOF_IMPL(VPDefID)
static const uint32_t IV[8]
ArrayRef - Represent a constant reference to an array (0 or more elements consecutively in memory),...
ArrayRef< T > slice(size_t N, size_t M) const
slice(n, m) - Chop off the first N elements of the array, and keep M elements in the array.
LLVM Basic Block Representation.
This class represents a function call, abstracting a target machine's calling convention.
This is the base class for all instructions that perform data casts.
Instruction::CastOps getOpcode() const
Return the opcode of this CastInst.
Predicate
This enumeration lists the possible predicates for CmpInst subclasses.
This class represents an Operation in the Expression.
ValueT lookup(const_arg_type_t< KeyT > Val) const
lookup - Return the entry for the specified key, or a default constructed value if no such entry exis...
size_type count(const_arg_type_t< KeyT > Val) const
Return 1 if the specified key is in the map, 0 otherwise.
bool contains(const_arg_type_t< KeyT > Val) const
Return true if the specified key is in the map, false otherwise.
Concrete subclass of DominatorTreeBase that is used to compute a normal dominator tree.
constexpr bool isScalar() const
Exactly one element.
Utility class for floating point operations which can have information about relaxed accuracy require...
Convenience struct for specifying and reasoning about fast-math flags.
an instruction for type-safe pointer arithmetic to access elements of arrays and structs
Common base class shared among various IRBuilders.
A struct for saving information about induction variables.
InductionKind
This enum represents the kinds of inductions that we support.
InnerLoopVectorizer vectorizes loops which contain only one basic block to a specified vectorization ...
The group of interleaved loads/stores sharing the same stride and close to each other.
uint32_t getFactor() const
InstTy * getMember(uint32_t Index) const
Get the member with the given index Index.
Drive the analysis of interleaved memory accesses in the loop.
This is an important class for using LLVM in a threaded context.
An instruction for reading from memory.
This class emits a version of the loop where run-time checks ensure that may-alias pointers can't ove...
Represents a single loop in the control flow graph.
This class implements a map that also provides access to all stored values in a deterministic order.
VectorType::iterator erase(typename VectorType::iterator Iterator)
Remove the element given by Iterator.
The RecurrenceDescriptor is used to identify recurrences variables in a loop.
This class represents an analyzed expression in the program.
The main scalar evolution driver.
This class represents the LLVM 'select' instruction.
size_type size() const
Determine the number of elements in the SetVector.
void clear()
Completely clear the SetVector.
size_type count(const key_type &key) const
Count the number of elements of a given key in the SetVector.
bool empty() const
Determine if the SetVector is empty or not.
bool insert(const value_type &X)
Insert a new element into the SetVector.
bool contains(const key_type &key) const
Check if the SetVector contains the given key.
This class provides computation of slot numbers for LLVM Assembly writing.
A templated base class for SmallPtrSet which provides the typesafe interface that is common across al...
std::pair< iterator, bool > insert(PtrType Ptr)
Inserts Ptr if and only if there is no element in the container equal to Ptr.
SmallPtrSet - This class implements a set which is optimized for holding SmallSize or less elements.
A SetVector that performs no allocations if smaller than a certain size.
iterator erase(const_iterator CI)
void push_back(const T &Elt)
This is a 'vector' (really, a variable-sized array), optimized for the case when the array is small.
An instruction for storing to memory.
This class represents a truncation of integer types.
Twine - A lightweight data structure for efficiently representing the concatenation of temporary valu...
std::string str() const
Return the twine contents as a std::string.
The instances of the Type class are immutable: once they are created, they are never changed.
Type * getScalarType() const
If this is a vector type, return the element type, otherwise return 'this'.
A Use represents the edge between a Value definition and its users.
Iterator to iterate over vectorization factors in a VFRange.
ElementCount operator*() const
iterator(ElementCount VF)
bool operator==(const iterator &Other) const
A recipe for generating the active lane mask for the vector loop that is used to predicate the vector...
void execute(VPTransformState &State) override
Generate the active lane mask phi of the vector loop.
VPRecipeBase * clone() override
Clone the current recipe.
static bool classof(const VPHeaderPHIRecipe *D)
VPActiveLaneMaskPHIRecipe(VPValue *StartMask, DebugLoc DL)
~VPActiveLaneMaskPHIRecipe() override=default
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
VPBasicBlock serves as the leaf of the Hierarchical Control-Flow Graph.
RecipeListTy::const_iterator const_iterator
void appendRecipe(VPRecipeBase *Recipe)
Augment the existing recipes of a VPBasicBlock with an additional Recipe as the last recipe.
VPBasicBlock * clone() override
Clone the current block and it's recipes, without updating the operands of the cloned recipes.
RecipeListTy::const_reverse_iterator const_reverse_iterator
RecipeListTy::iterator iterator
Instruction iterators...
void execute(VPTransformState *State) override
The method which generates the output IR instructions that correspond to this VPBasicBlock,...
RecipeListTy & getRecipeList()
Returns a reference to the list of recipes.
VPBasicBlock(const Twine &Name="", VPRecipeBase *Recipe=nullptr)
iterator begin()
Recipe iterator methods.
RecipeListTy::reverse_iterator reverse_iterator
iterator_range< iterator > phis()
Returns an iterator range over the PHI-like recipes in the block.
iterator getFirstNonPhi()
Return the position of the first non-phi node recipe in the block.
VPRegionBlock * getEnclosingLoopRegion()
void dropAllReferences(VPValue *NewValue) override
Replace all operands of VPUsers in the block with NewValue and also replaces all uses of VPValues def...
const_reverse_iterator rbegin() const
VPBasicBlock * splitAt(iterator SplitAt)
Split current block at SplitAt by inserting a new block between the current block and its successors ...
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print this VPBsicBlock to O, prefixing all lines with Indent.
const VPRecipeBase & front() const
const_iterator begin() const
bool isExiting() const
Returns true if the block is exiting it's parent region.
VPRecipeBase * getTerminator()
If the block has multiple successors, return the branch recipe terminating the block.
const VPRecipeBase & back() const
void insert(VPRecipeBase *Recipe, iterator InsertPt)
const_iterator end() const
static bool classof(const VPBlockBase *V)
Method to support type inquiry through isa, cast, and dyn_cast.
static RecipeListTy VPBasicBlock::* getSublistAccess(VPRecipeBase *)
Returns a pointer to a member of the recipe list.
reverse_iterator rbegin()
const_reverse_iterator rend() const
A recipe for vectorizing a phi-node as a sequence of mask-based select instructions.
VPBlendRecipe(PHINode *Phi, ArrayRef< VPValue * > Operands)
The blend operation is a User of the incoming values and of their respective masks,...
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
bool onlyFirstLaneUsed(const VPValue *Op) const override
Returns true if the recipe only uses the first lane of operand Op.
VPValue * getIncomingValue(unsigned Idx) const
Return incoming value number Idx.
VPRecipeBase * clone() override
Clone the current recipe.
VPValue * getMask(unsigned Idx) const
Return mask number Idx.
unsigned getNumIncomingValues() const
Return the number of incoming values, taking into account that a single incoming value has no mask.
void execute(VPTransformState &State) override
Generate the phi/select nodes.
VPBlockBase is the building block of the Hierarchical Control-Flow Graph.
VPRegionBlock * getParent()
VPBlocksTy & getPredecessors()
const VPBasicBlock * getExitingBasicBlock() const
LLVM_DUMP_METHOD void dump() const
Dump this VPBlockBase to dbgs().
void setName(const Twine &newName)
size_t getNumSuccessors() const
iterator_range< VPBlockBase ** > successors()
virtual void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const =0
Print plain-text dump of this VPBlockBase to O, prefixing all lines with Indent.
void printSuccessors(raw_ostream &O, const Twine &Indent) const
Print the successors of this block to O, prefixing all lines with Indent.
bool isLegalToHoistInto()
Return true if it is legal to hoist instructions into this block.
virtual ~VPBlockBase()=default
void print(raw_ostream &O) const
Print plain-text dump of this VPlan to O.
const VPBlocksTy & getHierarchicalPredecessors()
size_t getNumPredecessors() const
void setPredecessors(ArrayRef< VPBlockBase * > NewPreds)
Set each VPBasicBlock in NewPreds as predecessor of this VPBlockBase.
VPBlockBase * getEnclosingBlockWithPredecessors()
const VPBlocksTy & getPredecessors() const
virtual VPBlockBase * clone()=0
Clone the current block and it's recipes without updating the operands of the cloned recipes,...
static void deleteCFG(VPBlockBase *Entry)
Delete all blocks reachable from a given VPBlockBase, inclusive.
void setPlan(VPlan *ParentPlan)
Sets the pointer of the plan containing the block.
const VPRegionBlock * getParent() const
void printAsOperand(raw_ostream &OS, bool PrintType) const
const std::string & getName() const
void clearSuccessors()
Remove all the successors of this block.
VPBlockBase * getSingleHierarchicalSuccessor()
void setTwoSuccessors(VPBlockBase *IfTrue, VPBlockBase *IfFalse)
Set two given VPBlockBases IfTrue and IfFalse to be the two successors of this VPBlockBase.
VPBlockBase * getSinglePredecessor() const
virtual void execute(VPTransformState *State)=0
The method which generates the output IR that correspond to this VPBlockBase, thereby "executing" the...
const VPBlocksTy & getHierarchicalSuccessors()
void clearPredecessors()
Remove all the predecessor of this block.
enum { VPBasicBlockSC, VPRegionBlockSC } VPBlockTy
An enumeration for keeping track of the concrete subclass of VPBlockBase that are actually instantiat...
unsigned getVPBlockID() const
VPBlockBase(const unsigned char SC, const std::string &N)
VPBlocksTy & getSuccessors()
VPBlockBase * getEnclosingBlockWithSuccessors()
An Enclosing Block of a block B is any block containing B, including B itself.
const VPBasicBlock * getEntryBasicBlock() const
void setOneSuccessor(VPBlockBase *Successor)
Set a given VPBlockBase Successor as the single successor of this VPBlockBase.
void setParent(VPRegionBlock *P)
virtual void dropAllReferences(VPValue *NewValue)=0
Replace all operands of VPUsers in the block with NewValue and also replaces all uses of VPValues def...
VPBlockBase * getSingleHierarchicalPredecessor()
VPBlockBase * getSingleSuccessor() const
const VPBlocksTy & getSuccessors() const
Class that provides utilities for VPBlockBases in VPlan.
static auto blocksOnly(const T &Range)
Return an iterator range over Range which only includes BlockTy blocks.
static void insertBlockAfter(VPBlockBase *NewBlock, VPBlockBase *BlockPtr)
Insert disconnected VPBlockBase NewBlock after BlockPtr.
static void insertTwoBlocksAfter(VPBlockBase *IfTrue, VPBlockBase *IfFalse, VPBlockBase *BlockPtr)
Insert disconnected VPBlockBases IfTrue and IfFalse after BlockPtr.
static void disconnectBlocks(VPBlockBase *From, VPBlockBase *To)
Disconnect VPBlockBases From and To bi-directionally.
static void connectBlocks(VPBlockBase *From, VPBlockBase *To)
Connect VPBlockBases From and To bi-directionally.
A recipe for generating conditional branches on the bits of a mask.
VPValue * getMask() const
Return the mask used by this recipe.
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
VPBranchOnMaskRecipe(VPValue *BlockInMask)
bool usesScalars(const VPValue *Op) const override
Returns true if the recipe uses scalars of operand Op.
void execute(VPTransformState &State) override
Generate the extraction of the appropriate bit from the block mask and the conditional branch.
VPRecipeBase * clone() override
Clone the current recipe.
Canonical scalar induction phi of the vector loop.
VPRecipeBase * clone() override
Clone the current recipe.
bool onlyFirstPartUsed(const VPValue *Op) const override
Returns true if the recipe only uses the first part of operand Op.
~VPCanonicalIVPHIRecipe() override=default
static bool classof(const VPHeaderPHIRecipe *D)
VPCanonicalIVPHIRecipe(VPValue *StartV, DebugLoc DL)
bool onlyFirstLaneUsed(const VPValue *Op) const override
Returns true if the recipe only uses the first lane of operand Op.
void execute(VPTransformState &State) override
Generate the canonical scalar induction phi of the vector loop.
Type * getScalarType() const
Returns the scalar type of the induction.
bool isCanonical(InductionDescriptor::InductionKind Kind, VPValue *Start, VPValue *Step) const
Check if the induction described by Kind, /p Start and Step is canonical, i.e.
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
This class augments a recipe with a set of VPValues defined by the recipe.
unsigned getVPDefID() const
A recipe for converting the canonical IV value to the corresponding value of an IV with different sta...
void execute(VPTransformState &State) override
Generate the transformed value of the induction at offset StartValue (1.
VPCanonicalIVPHIRecipe * getCanonicalIV() const
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
VPValue * getStepValue() const
VPDerivedIVRecipe(const InductionDescriptor &IndDesc, VPValue *Start, VPCanonicalIVPHIRecipe *CanonicalIV, VPValue *Step)
VPRecipeBase * clone() override
Clone the current recipe.
Type * getScalarType() const
~VPDerivedIVRecipe() override=default
bool onlyFirstLaneUsed(const VPValue *Op) const override
Returns true if the recipe only uses the first lane of operand Op.
VPValue * getStartValue() const
Recipe to expand a SCEV expression.
VPExpandSCEVRecipe(const SCEV *Expr, ScalarEvolution &SE)
VPRecipeBase * clone() override
Clone the current recipe.
const SCEV * getSCEV() const
void execute(VPTransformState &State) override
Generate a canonical vector induction variable of the vector loop, with.
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
~VPExpandSCEVRecipe() override=default
This is a concrete Recipe that models a single VPlan-level instruction.
bool onlyFirstPartUsed(const VPValue *Op) const override
Returns true if the recipe only uses the first part of operand Op.
@ FirstOrderRecurrenceSplice
@ CanonicalIVIncrementForPart
@ CalculateTripCountMinusVF
VPRecipeBase * clone() override
Clone the current recipe.
VPInstruction(unsigned Opcode, ArrayRef< VPValue * > Operands, DebugLoc DL, const Twine &Name="")
LLVM_DUMP_METHOD void dump() const
Print the VPInstruction to dbgs() (for debugging).
unsigned getOpcode() const
VPInstruction(unsigned Opcode, std::initializer_list< VPValue * > Operands, WrapFlagsTy WrapFlags, DebugLoc DL={}, const Twine &Name="")
VPInstruction(unsigned Opcode, std::initializer_list< VPValue * > Operands, DebugLoc DL={}, const Twine &Name="")
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the VPInstruction to O.
bool onlyFirstLaneUsed(const VPValue *Op) const override
Returns true if the recipe only uses the first lane of operand Op.
bool mayWriteToMemory() const
Return true if this instruction may modify memory.
void execute(VPTransformState &State) override
Generate the instruction.
VPInterleaveRecipe is a recipe for transforming an interleave group of load or stores into one wide l...
bool onlyFirstLaneUsed(const VPValue *Op) const override
The recipe only uses the first lane of the address.
~VPInterleaveRecipe() override=default
VPValue * getAddr() const
Return the address accessed by this recipe.
VPInterleaveRecipe(const InterleaveGroup< Instruction > *IG, VPValue *Addr, ArrayRef< VPValue * > StoredValues, VPValue *Mask, bool NeedsMaskForGaps)
VPValue * getMask() const
Return the mask used by this recipe.
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
void execute(VPTransformState &State) override
Generate the wide load or store, and shuffles.
ArrayRef< VPValue * > getStoredValues() const
Return the VPValues stored by this interleave group.
const InterleaveGroup< Instruction > * getInterleaveGroup()
unsigned getNumStoreOperands() const
Returns the number of stored operands of this interleave group.
VPRecipeBase * clone() override
Clone the current recipe.
~VPInterleavedAccessInfo()
InterleaveGroup< VPInstruction > * getInterleaveGroup(VPInstruction *Instr) const
Get the interleave group that Instr belongs to.
In what follows, the term "input IR" refers to code that is fed into the vectorizer whereas the term ...
static VPLane getLastLaneForVF(const ElementCount &VF)
static unsigned getNumCachedLanes(const ElementCount &VF)
Returns the maxmimum number of lanes that we are able to consider caching for VF.
Value * getAsRuntimeExpr(IRBuilderBase &Builder, const ElementCount &VF) const
Returns an expression describing the lane index that can be used at runtime.
VPLane(unsigned Lane, Kind LaneKind)
Kind getKind() const
Returns the Kind of lane offset.
bool isFirstLane() const
Returns true if this is the first lane of the whole vector.
unsigned getKnownLane() const
Returns a compile-time known value for the lane index and asserts if the lane can only be calculated ...
static VPLane getFirstLane()
Kind
Kind describes how to interpret Lane.
@ ScalableLast
For ScalableLast, Lane is the offset from the start of the last N-element subvector in a scalable vec...
@ First
For First, Lane is the index into the first N elements of a fixed-vector <N x <ElTy>> or a scalable v...
unsigned mapToCacheIndex(const ElementCount &VF) const
Maps the lane to a cache index based on VF.
A value that is used outside the VPlan.
VPLiveOut(PHINode *Phi, VPValue *Op)
static bool classof(const VPUser *U)
bool usesScalars(const VPValue *Op) const override
Returns true if the VPLiveOut uses scalars of operand Op.
void print(raw_ostream &O, VPSlotTracker &SlotTracker) const
Print the VPLiveOut to O.
void fixPhi(VPlan &Plan, VPTransformState &State)
Fixup the wrapped LCSSA phi node in the unique exit block.
VPPredInstPHIRecipe is a recipe for generating the phi nodes needed when control converges back from ...
~VPPredInstPHIRecipe() override=default
bool usesScalars(const VPValue *Op) const override
Returns true if the recipe uses scalars of operand Op.
VPPredInstPHIRecipe(VPValue *PredV)
Construct a VPPredInstPHIRecipe given PredInst whose value needs a phi nodes after merging back from ...
void execute(VPTransformState &State) override
Generates phi nodes for live-outs as needed to retain SSA form.
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
VPRecipeBase * clone() override
Clone the current recipe.
VPRecipeBase is a base class modeling a sequence of one or more output IR instructions.
bool mayReadFromMemory() const
Returns true if the recipe may read from memory.
bool mayReadOrWriteMemory() const
Returns true if the recipe may read from or write to memory.
bool mayHaveSideEffects() const
Returns true if the recipe may have side-effects.
bool mayWriteToMemory() const
Returns true if the recipe may write to memory.
virtual ~VPRecipeBase()=default
VPBasicBlock * getParent()
DebugLoc getDebugLoc() const
Returns the debug location of the recipe.
virtual void execute(VPTransformState &State)=0
The method which generates the output IR instructions that correspond to this VPRecipe,...
void moveBefore(VPBasicBlock &BB, iplist< VPRecipeBase >::iterator I)
Unlink this recipe and insert into BB before I.
void insertBefore(VPRecipeBase *InsertPos)
Insert an unlinked recipe into a basic block immediately before the specified recipe.
void insertAfter(VPRecipeBase *InsertPos)
Insert an unlinked Recipe into a basic block immediately after the specified Recipe.
static bool classof(const VPDef *D)
Method to support type inquiry through isa, cast, and dyn_cast.
iplist< VPRecipeBase >::iterator eraseFromParent()
This method unlinks 'this' from the containing basic block and deletes it.
VPRecipeBase(const unsigned char SC, ArrayRef< VPValue * > Operands, DebugLoc DL={})
virtual VPRecipeBase * clone()=0
Clone the current recipe.
const VPBasicBlock * getParent() const
static bool classof(const VPUser *U)
VPRecipeBase(const unsigned char SC, iterator_range< IterT > Operands, DebugLoc DL={})
void removeFromParent()
This method unlinks 'this' from the containing basic block, but does not delete it.
bool isPhi() const
Returns true for PHI-like recipes.
void moveAfter(VPRecipeBase *MovePos)
Unlink this recipe from its current VPBasicBlock and insert it into the VPBasicBlock that MovePos liv...
Class to record LLVM IR flag for a recipe along with it.
VPRecipeWithIRFlags(const unsigned char SC, IterT Operands, GEPFlagsTy GEPFlags, DebugLoc DL={})
NonNegFlagsTy NonNegFlags
CmpInst::Predicate CmpPredicate
VPRecipeWithIRFlags(const unsigned char SC, IterT Operands, CmpInst::Predicate Pred, DebugLoc DL={})
void setFlags(Instruction *I) const
Set the IR flags for I.
static bool classof(const VPRecipeBase *R)
VPRecipeWithIRFlags(const unsigned char SC, IterT Operands, FastMathFlags FMFs, DebugLoc DL={})
void dropPoisonGeneratingFlags()
Drop all poison-generating flags.
bool hasFastMathFlags() const
Returns true if the recipe has fast-math flags.
VPRecipeWithIRFlags(const unsigned char SC, IterT Operands, Instruction &I)
DisjointFlagsTy DisjointFlags
VPRecipeWithIRFlags(const unsigned char SC, IterT Operands, WrapFlagsTy WrapFlags, DebugLoc DL={})
void transferFlags(VPRecipeWithIRFlags &Other)
bool hasNoUnsignedWrap() const
void printFlags(raw_ostream &O) const
CmpInst::Predicate getPredicate() const
bool hasNoSignedWrap() const
FastMathFlags getFastMathFlags() const
VPRecipeWithIRFlags(const unsigned char SC, IterT Operands, DebugLoc DL={})
A recipe for handling reduction phis.
VPReductionPHIRecipe(PHINode *Phi, const RecurrenceDescriptor &RdxDesc, VPValue &Start, bool IsInLoop=false, bool IsOrdered=false)
Create a new VPReductionPHIRecipe for the reduction Phi described by RdxDesc.
bool isOrdered() const
Returns true, if the phi is part of an ordered reduction.
~VPReductionPHIRecipe() override=default
VPRecipeBase * clone() override
Clone the current recipe.
bool isInLoop() const
Returns true, if the phi is part of an in-loop reduction.
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
void execute(VPTransformState &State) override
Generate the phi/select nodes.
static bool classof(const VPHeaderPHIRecipe *R)
const RecurrenceDescriptor & getRecurrenceDescriptor() const
A recipe to represent inloop reduction operations, performing a reduction on a vector operand into a ...
VPRecipeBase * clone() override
Clone the current recipe.
VPValue * getVecOp() const
The VPValue of the vector value to be reduced.
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
VPValue * getCondOp() const
The VPValue of the condition for the block.
VPReductionRecipe(const RecurrenceDescriptor &R, Instruction *I, VPValue *ChainOp, VPValue *VecOp, VPValue *CondOp)
~VPReductionRecipe() override=default
VPValue * getChainOp() const
The VPValue of the scalar Chain being accumulated.
void execute(VPTransformState &State) override
Generate the reduction in the loop.
VPRegionBlock represents a collection of VPBasicBlocks and VPRegionBlocks which form a Single-Entry-S...
VPRegionBlock * clone() override
Clone all blocks in the single-entry single-exit region of the block and their recipes without updati...
const VPBlockBase * getEntry() const
bool isReplicator() const
An indicator whether this region is to generate multiple replicated instances of output IR correspond...
void dropAllReferences(VPValue *NewValue) override
Replace all operands of VPUsers in the block with NewValue and also replaces all uses of VPValues def...
void setExiting(VPBlockBase *ExitingBlock)
Set ExitingBlock as the exiting VPBlockBase of this VPRegionBlock.
VPBlockBase * getExiting()
void setEntry(VPBlockBase *EntryBlock)
Set EntryBlock as the entry VPBlockBase of this VPRegionBlock.
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print this VPRegionBlock to O (recursively), prefixing all lines with Indent.
VPRegionBlock(const std::string &Name="", bool IsReplicator=false)
VPRegionBlock(VPBlockBase *Entry, VPBlockBase *Exiting, const std::string &Name="", bool IsReplicator=false)
void execute(VPTransformState *State) override
The method which generates the output IR instructions that correspond to this VPRegionBlock,...
const VPBlockBase * getExiting() const
VPBasicBlock * getPreheaderVPBB()
Returns the pre-header VPBasicBlock of the loop region.
~VPRegionBlock() override
static bool classof(const VPBlockBase *V)
Method to support type inquiry through isa, cast, and dyn_cast.
VPReplicateRecipe replicates a given instruction producing multiple scalar copies of the original sca...
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
void execute(VPTransformState &State) override
Generate replicas of the desired Ingredient.
~VPReplicateRecipe() override=default
VPRecipeBase * clone() override
Clone the current recipe.
bool onlyFirstLaneUsed(const VPValue *Op) const override
Returns true if the recipe only uses the first lane of operand Op.
bool usesScalars(const VPValue *Op) const override
Returns true if the recipe uses scalars of operand Op.
bool isPredicated() const
VPReplicateRecipe(Instruction *I, iterator_range< IterT > Operands, bool IsUniform, VPValue *Mask=nullptr)
VPValue * getMask()
Return the mask of a predicated VPReplicateRecipe.
bool shouldPack() const
Returns true if the recipe is used by a widened recipe via an intervening VPPredInstPHIRecipe.
VPScalarCastRecipe is a recipe to create scalar cast instructions.
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Each concrete VPDef prints itself.
~VPScalarCastRecipe() override=default
bool onlyFirstLaneUsed(const VPValue *Op) const override
Returns true if the VPUser only uses the first lane of operand Op.
VPRecipeBase * clone() override
Clone the current recipe.
void execute(VPTransformState &State) override
The method which generates the output IR instructions that correspond to this VPRecipe,...
Type * getResultType() const
Returns the result type of the cast.
VPScalarCastRecipe(Instruction::CastOps Opcode, VPValue *Op, Type *ResultTy)
A recipe for handling phi nodes of integer and floating-point inductions, producing their scalar valu...
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
bool onlyFirstLaneUsed(const VPValue *Op) const override
Returns true if the recipe only uses the first lane of operand Op.
VPValue * getStepValue() const
VPScalarIVStepsRecipe(const InductionDescriptor &IndDesc, VPValue *IV, VPValue *Step)
VPScalarIVStepsRecipe(VPValue *IV, VPValue *Step, Instruction::BinaryOps Opcode, FastMathFlags FMFs)
~VPScalarIVStepsRecipe() override=default
void execute(VPTransformState &State) override
Generate the scalarized versions of the phi node as needed by their users.
VPRecipeBase * clone() override
Clone the current recipe.
VPSingleDef is a base class for recipes for modeling a sequence of one or more output IR that define ...
VPSingleDefRecipe(const unsigned char SC, ArrayRef< VPValue * > Operands, DebugLoc DL={})
Instruction * getUnderlyingInstr()
Returns the underlying instruction.
static bool classof(const VPRecipeBase *R)
const Instruction * getUnderlyingInstr() const
VPSingleDefRecipe(const unsigned char SC, IterT Operands, DebugLoc DL={})
static bool classof(const VPUser *U)
VPSingleDefRecipe(const unsigned char SC, IterT Operands, Value *UV, DebugLoc DL={})
This class can be used to assign consecutive numbers to all VPValues in a VPlan and allows querying t...
An analysis for type-inference for VPValues.
This class augments VPValue with operands which provide the inverse def-use edges from VPValue's user...
void setOperand(unsigned I, VPValue *New)
unsigned getNumOperands() const
operand_iterator op_begin()
VPValue * getOperand(unsigned N) const
void addOperand(VPValue *Operand)
Value * getUnderlyingValue()
Return the underlying Value attached to this VPValue.
VPRecipeBase * getDefiningRecipe()
Returns the recipe defining this VPValue or nullptr if it is not defined by a recipe,...
unsigned getNumUsers() const
Value * getLiveInIRValue()
Returns the underlying IR value, if this VPValue is defined outside the scope of VPlan.
bool isLiveIn() const
Returns true if this VPValue is a live-in, i.e. defined outside the VPlan.
friend class VPRecipeBase
bool isDefinedOutsideVectorRegions() const
Returns true if the VPValue is defined outside any vector regions, i.e.
A recipe to compute the pointers for widened memory accesses of IndexTy for all parts.
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
void execute(VPTransformState &State) override
The method which generates the output IR instructions that correspond to this VPRecipe,...
VPRecipeBase * clone() override
Clone the current recipe.
VPVectorPointerRecipe(VPValue *Ptr, Type *IndexedTy, bool IsReverse, bool IsInBounds, DebugLoc DL)
bool onlyFirstLaneUsed(const VPValue *Op) const override
Returns true if the VPUser only uses the first lane of operand Op.
A recipe for widening Call instructions.
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
VPWidenCallRecipe(CallInst &I, iterator_range< IterT > CallArguments, Intrinsic::ID VectorIntrinsicID, DebugLoc DL={}, Function *Variant=nullptr)
VPRecipeBase * clone() override
Clone the current recipe.
void execute(VPTransformState &State) override
Produce a widened version of the call instruction.
~VPWidenCallRecipe() override=default
A Recipe for widening the canonical induction variable of the vector loop.
void execute(VPTransformState &State) override
Generate a canonical vector induction variable of the vector loop, with start = {<Part*VF,...
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
~VPWidenCanonicalIVRecipe() override=default
VPWidenCanonicalIVRecipe(VPCanonicalIVPHIRecipe *CanonicalIV)
const Type * getScalarType() const
Returns the scalar type of the induction.
VPRecipeBase * clone() override
Clone the current recipe.
VPWidenCastRecipe is a recipe to create vector cast instructions.
VPWidenCastRecipe(Instruction::CastOps Opcode, VPValue *Op, Type *ResultTy, CastInst &UI)
Instruction::CastOps getOpcode() const
VPRecipeBase * clone() override
Clone the current recipe.
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
Type * getResultType() const
Returns the result type of the cast.
VPWidenCastRecipe(Instruction::CastOps Opcode, VPValue *Op, Type *ResultTy)
void execute(VPTransformState &State) override
Produce widened copies of the cast.
~VPWidenCastRecipe() override=default
A recipe for handling GEP instructions.
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
void execute(VPTransformState &State) override
Generate the gep nodes.
~VPWidenGEPRecipe() override=default
VPRecipeBase * clone() override
Clone the current recipe.
VPWidenGEPRecipe(GetElementPtrInst *GEP, iterator_range< IterT > Operands)
A recipe for handling phi nodes of integer and floating-point inductions, producing their vector valu...
VPWidenIntOrFpInductionRecipe(PHINode *IV, VPValue *Start, VPValue *Step, const InductionDescriptor &IndDesc, TruncInst *Trunc)
const TruncInst * getTruncInst() const
VPRecipeBase & getBackedgeRecipe() override
Returns the backedge value as a recipe.
~VPWidenIntOrFpInductionRecipe() override=default
TruncInst * getTruncInst()
Returns the first defined value as TruncInst, if it is one or nullptr otherwise.
void execute(VPTransformState &State) override
Generate the vectorized and scalarized versions of the phi node as needed by their users.
VPValue * getStepValue()
Returns the step value of the induction.
VPWidenIntOrFpInductionRecipe(PHINode *IV, VPValue *Start, VPValue *Step, const InductionDescriptor &IndDesc)
const VPValue * getStepValue() const
Type * getScalarType() const
Returns the scalar type of the induction.
VPValue * getBackedgeValue() override
Returns the incoming value from the loop backedge.
VPRecipeBase * clone() override
Clone the current recipe.
bool isCanonical() const
Returns true if the induction is canonical, i.e.
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
const InductionDescriptor & getInductionDescriptor() const
Returns the induction descriptor for the recipe.
A Recipe for widening load/store operations.
VPValue * getMask() const
Return the mask used by this recipe.
VPValue * getAddr() const
Return the address accessed by this recipe.
Instruction & getIngredient() const
VPWidenMemoryInstructionRecipe(StoreInst &Store, VPValue *Addr, VPValue *StoredValue, VPValue *Mask, bool Consecutive, bool Reverse)
void execute(VPTransformState &State) override
Generate the wide load/store.
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
VPWidenMemoryInstructionRecipe(LoadInst &Load, VPValue *Addr, VPValue *Mask, bool Consecutive, bool Reverse)
VPValue * getStoredValue() const
Return the address accessed by this recipe.
bool onlyFirstLaneUsed(const VPValue *Op) const override
Returns true if the recipe only uses the first lane of operand Op.
bool isStore() const
Returns true if this recipe is a store.
bool isConsecutive() const
VPRecipeBase * clone() override
Clone the current recipe.
A recipe for handling phis that are widened in the vector loop.
void addIncoming(VPValue *IncomingV, VPBasicBlock *IncomingBlock)
Adds a pair (IncomingV, IncomingBlock) to the phi.
VPValue * getIncomingValue(unsigned I)
Returns the I th incoming VPValue.
VPWidenPHIRecipe(PHINode *Phi, VPValue *Start=nullptr)
Create a new VPWidenPHIRecipe for Phi with start value Start.
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
~VPWidenPHIRecipe() override=default
VPRecipeBase * clone() override
Clone the current recipe.
VPBasicBlock * getIncomingBlock(unsigned I)
Returns the I th incoming VPBasicBlock.
void execute(VPTransformState &State) override
Generate the phi/select nodes.
VPRecipeBase * clone() override
Clone the current recipe.
const InductionDescriptor & getInductionDescriptor() const
Returns the induction descriptor for the recipe.
~VPWidenPointerInductionRecipe() override=default
bool onlyScalarsGenerated(bool IsScalable)
Returns true if only scalar values will be generated.
void execute(VPTransformState &State) override
Generate vector values for the pointer induction.
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
VPWidenPointerInductionRecipe(PHINode *Phi, VPValue *Start, VPValue *Step, const InductionDescriptor &IndDesc, bool IsScalarAfterVectorization)
Create a new VPWidenPointerInductionRecipe for Phi with start value Start.
VPWidenRecipe is a recipe for producing a copy of vector type its ingredient.
void execute(VPTransformState &State) override
Produce widened copies of all Ingredients.
VPRecipeBase * clone() override
Clone the current recipe.
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
~VPWidenRecipe() override=default
VPWidenRecipe(Instruction &I, iterator_range< IterT > Operands)
unsigned getOpcode() const
VPlanPrinter prints a given VPlan to a given output stream.
VPlanPrinter(raw_ostream &O, const VPlan &P)
LLVM_DUMP_METHOD void dump()
Class that maps (parts of) an existing VPlan to trees of combined VPInstructions.
VPInstruction * buildGraph(ArrayRef< VPValue * > Operands)
Tries to build an SLP tree rooted at Operands and returns a VPInstruction combining Operands,...
bool isCompletelySLP() const
Return true if all visited instruction can be combined.
VPlanSlp(VPInterleavedAccessInfo &IAI, VPBasicBlock &BB)
unsigned getWidestBundleBits() const
Return the width of the widest combined bundle in bits.
VPlan models a candidate for vectorization, encoding various decisions take to produce efficient outp...
void printDOT(raw_ostream &O) const
Print this VPlan in DOT format to O.
VPValue * getVPValue(Value *V)
Returns the VPValue for V.
std::string getName() const
Return a string with the name of the plan and the applicable VFs and UFs.
void prepareToExecute(Value *TripCount, Value *VectorTripCount, Value *CanonicalIVStartValue, VPTransformState &State)
Prepare the plan for execution, setting up the required live-in values.
VPBasicBlock * getEntry()
void addVPValue(Value *V, VPValue *VPV)
VPValue & getVectorTripCount()
The vector trip count.
void setName(const Twine &newName)
VPValue & getVFxUF()
Returns VF * UF of the vector loop region.
VPValue * getTripCount() const
The trip count of the original loop.
VPValue * getOrCreateBackedgeTakenCount()
The backedge taken count of the original loop.
void removeLiveOut(PHINode *PN)
void addLiveOut(PHINode *PN, VPValue *V)
const VPBasicBlock * getEntry() const
VPlan(VPBasicBlock *Preheader, VPValue *TC, VPBasicBlock *Entry)
Construct a VPlan with original preheader Preheader, trip count TC and Entry to the plan.
VPBasicBlock * getPreheader()
VPValue * getVPValueOrAddLiveIn(Value *V)
Gets the VPValue for V or adds a new live-in (if none exists yet) for V.
VPRegionBlock * getVectorLoopRegion()
Returns the VPRegionBlock of the vector loop.
const VPRegionBlock * getVectorLoopRegion() const
static VPlanPtr createInitialVPlan(const SCEV *TripCount, ScalarEvolution &PSE)
Create initial VPlan skeleton, having an "entry" VPBasicBlock (wrapping original scalar pre-header) w...
bool hasVF(ElementCount VF)
void addSCEVExpansion(const SCEV *S, VPValue *V)
bool hasUF(unsigned UF) const
void setVF(ElementCount VF)
void resetTripCount(VPValue *NewTripCount)
Resets the trip count for the VPlan.
VPlan(VPBasicBlock *Preheader, VPBasicBlock *Entry)
Construct a VPlan with original preheader Preheader and Entry to the plan.
void disableValue2VPValue()
Mark the plan to indicate that using Value2VPValue is not safe any longer, because it may be stale.
const VPBasicBlock * getPreheader() const
LLVM_DUMP_METHOD void dump() const
Dump the plan to stderr (for debugging).
bool hasScalarVFOnly() const
iterator_range< mapped_iterator< Use *, std::function< VPValue *(Value *)> > > mapToVPValues(User::op_range Operands)
Returns a range mapping the values the range Operands to their corresponding VPValues.
void execute(VPTransformState *State)
Generate the IR code for this VPlan.
VPCanonicalIVPHIRecipe * getCanonicalIV()
Returns the canonical induction recipe of the vector loop.
const MapVector< PHINode *, VPLiveOut * > & getLiveOuts() const
void print(raw_ostream &O) const
Print this VPlan to O.
void addVF(ElementCount VF)
VPValue * getSCEVExpansion(const SCEV *S) const
void printLiveIns(raw_ostream &O) const
Print the live-ins of this VPlan to O.
VPlan * duplicate()
Clone the current VPlan, update all VPValues of the new VPlan and cloned recipes to refer to the clon...
LLVM Value Representation.
Type * getType() const
All values are typed, get the type of this value.
constexpr bool isScalable() const
Returns whether the quantity is scaled by a runtime quantity (vscale).
constexpr ScalarTy getKnownMinValue() const
Returns the minimum value this quantity can represent.
An ilist node that can access its parent list.
base_list_type::const_reverse_iterator const_reverse_iterator
base_list_type::reverse_iterator reverse_iterator
base_list_type::const_iterator const_iterator
base_list_type::iterator iterator
iterator insert(iterator where, pointer New)
CRTP base class which implements the entire standard iterator facade in terms of a minimal subset of ...
A range adaptor for a pair of iterators.
This class implements an extremely fast bulk output stream that can only output to a stream.
This file defines classes to implement an intrusive doubly linked list class (i.e.
This file defines the ilist_node class template, which is a convenient base class for creating classe...
#define llvm_unreachable(msg)
Marks that the current location is not supposed to be reachable.
@ BasicBlock
Various leaf nodes.
VPValue * getOrCreateVPValueForSCEVExpr(VPlan &Plan, const SCEV *Expr, ScalarEvolution &SE)
Get or create a VPValue that corresponds to the expansion of Expr.
bool isUniformAfterVectorization(VPValue *VPV)
Returns true if VPV is uniform after vectorization.
bool onlyFirstPartUsed(const VPValue *Def)
Returns true if only the first part of Def is used.
bool onlyFirstLaneUsed(const VPValue *Def)
Returns true if only the first lane of Def is used.
This is an optimization pass for GlobalISel generic memory operations.
auto find(R &&Range, const T &Val)
Provide wrappers to std::find which take ranges instead of having to pass begin/end explicitly.
bool all_of(R &&range, UnaryPredicate P)
Provide wrappers to std::all_of which take ranges instead of having to pass begin/end explicitly.
bool isEqual(const GCNRPTracker::LiveRegSet &S1, const GCNRPTracker::LiveRegSet &S2)
const SCEV * createTripCountSCEV(Type *IdxTy, PredicatedScalarEvolution &PSE, Loop *OrigLoop)
testing::Matcher< const detail::ErrorHolder & > Failed()
Value * getRuntimeVF(IRBuilderBase &B, Type *Ty, ElementCount VF)
Return the runtime value for VF.
iterator_range< T > make_range(T x, T y)
Convenience function for iterating over sub-ranges.
auto map_range(ContainerTy &&C, FuncTy F)
auto dyn_cast_or_null(const Y &Val)
bool any_of(R &&range, UnaryPredicate P)
Provide wrappers to std::any_of which take ranges instead of having to pass begin/end explicitly.
constexpr bool isPowerOf2_32(uint32_t Value)
Return true if the argument is a power of two > 0.
std::unique_ptr< VPlan > VPlanPtr
raw_ostream & dbgs()
dbgs() - This returns a reference to a raw_ostream for debugging messages.
iterator_range< filter_iterator< detail::IterOfRange< RangeT >, PredicateT > > make_filter_range(RangeT &&Range, PredicateT Pred)
Convenience function that takes a range of elements and a predicate, and return a new filter_iterator...
raw_ostream & operator<<(raw_ostream &OS, const APFixedPoint &FX)
Value * createStepForVF(IRBuilderBase &B, Type *Ty, ElementCount VF, int64_t Step)
Return a value for Step multiplied by VF.
bool is_contained(R &&Range, const E &Element)
Returns true if Element is found in Range.
hash_code hash_combine_range(InputIteratorT first, InputIteratorT last)
Compute a hash_code for a sequence of values.
A range of powers-of-2 vectorization factors with fixed start and adjustable end.
VFRange(const ElementCount &Start, const ElementCount &End)
A recipe for handling first-order recurrence phis.
void execute(VPTransformState &State) override
Generate the phi nodes.
VPFirstOrderRecurrencePHIRecipe(PHINode *Phi, VPValue &Start)
VPRecipeBase * clone() override
Clone the current recipe.
static bool classof(const VPHeaderPHIRecipe *R)
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
VPIteration represents a single point in the iteration space of the output (vectorized and/or unrolle...
VPIteration(unsigned Part, const VPLane &Lane)
VPIteration(unsigned Part, unsigned Lane, VPLane::Kind Kind=VPLane::Kind::First)
bool isFirstIteration() const
GEPFlagsTy(bool IsInBounds)
WrapFlagsTy(bool HasNUW, bool HasNSW)
A recipe for widening select instructions.
bool isInvariantCond() const
VPWidenSelectRecipe(SelectInst &I, iterator_range< IterT > Operands)
VPValue * getCond() const
void print(raw_ostream &O, const Twine &Indent, VPSlotTracker &SlotTracker) const override
Print the recipe.
void execute(VPTransformState &State) override
Produce a widened version of the select instruction.
VPRecipeBase * clone() override
Clone the current recipe.
~VPWidenSelectRecipe() override=default
VPlanIngredient(const Value *V)
void print(raw_ostream &O) const