LLVM 19.0.0git
Classes | Public Types | Public Member Functions | Friends | List of all members
llvm::slpvectorizer::BoUpSLP Class Reference

Bottom Up SLP Vectorizer. More...

Classes

struct  EdgeInfo
 This structure holds any data we need about the edges being traversed during buildTree_rec(). More...
 
class  LookAheadHeuristics
 A helper class used for scoring candidates for two consecutive lanes. More...
 
class  ShuffleCostEstimator
 Merges shuffle masks and emits final shuffle instruction, if required. More...
 
class  ShuffleInstructionBuilder
 Merges shuffle masks and emits final shuffle instruction, if required. More...
 
class  VLOperands
 A helper data structure to hold the operands of a vector of instructions. More...
 

Public Types

using ValueList = SmallVector< Value *, 8 >
 
using InstrList = SmallVector< Instruction *, 16 >
 
using ValueSet = SmallPtrSet< Value *, 16 >
 
using StoreList = SmallVector< StoreInst *, 8 >
 
using ExtraValueToDebugLocsMap = MapVector< Value *, SmallVector< Instruction *, 2 > >
 
using OrdersType = SmallVector< unsigned, 4 >
 

Public Member Functions

 BoUpSLP (Function *Func, ScalarEvolution *Se, TargetTransformInfo *Tti, TargetLibraryInfo *TLi, AAResults *Aa, LoopInfo *Li, DominatorTree *Dt, AssumptionCache *AC, DemandedBits *DB, const DataLayout *DL, OptimizationRemarkEmitter *ORE)
 
ValuevectorizeTree ()
 Vectorize the tree that starts with the elements in VL.
 
ValuevectorizeTree (const ExtraValueToDebugLocsMap &ExternallyUsedValues, SmallVectorImpl< std::pair< Value *, Value * > > &ReplacedExternals, Instruction *ReductionRoot=nullptr)
 Vectorize the tree but with the list of externally used values ExternallyUsedValues.
 
InstructionCost getSpillCost () const
 
InstructionCost getTreeCost (ArrayRef< Value * > VectorizedVals=std::nullopt)
 
void buildTree (ArrayRef< Value * > Roots, const SmallDenseSet< Value * > &UserIgnoreLst)
 Construct a vectorizable tree that starts at Roots, ignoring users for the purpose of scheduling and extraction in the UserIgnoreLst.
 
void buildTree (ArrayRef< Value * > Roots)
 Construct a vectorizable tree that starts at Roots.
 
bool doesRootHaveInTreeUses () const
 Returns whether the root node has in-tree uses.
 
ArrayRef< Value * > getRootNodeScalars () const
 Return the scalars of the root node.
 
void buildExternalUses (const ExtraValueToDebugLocsMap &ExternallyUsedValues={})
 Builds external uses of the vectorized scalars, i.e.
 
void deleteTree ()
 Clear the internal data structures that are created by 'buildTree'.
 
unsigned getTreeSize () const
 
void optimizeGatherSequence ()
 Perform LICM and CSE on the newly generated gather sequences.
 
std::optional< OrdersTypefindReusedOrderedScalars (const TreeEntry &TE)
 Checks if the specified gather tree entry TE can be represented as a shuffled vector entry + (possibly) permutation with other gathers.
 
std::optional< OrdersTypefindPartiallyOrderedLoads (const TreeEntry &TE)
 Sort loads into increasing pointers offsets to allow greater clustering.
 
std::optional< OrdersTypegetReorderingData (const TreeEntry &TE, bool TopToBottom)
 Gets reordering data for the given tree entry.
 
void reorderTopToBottom ()
 Reorders the current graph to the most profitable order starting from the root node to the leaf nodes.
 
void reorderBottomToTop (bool IgnoreReorder=false)
 Reorders the current graph to the most profitable order starting from leaves to the root.
 
unsigned getVectorElementSize (Value *V)
 
void computeMinimumValueSizes ()
 Compute the minimum type sizes required to represent the entries in a vectorizable tree.
 
unsigned getMaxVecRegSize () const
 
unsigned getMinVecRegSize () const
 
unsigned getMinVF (unsigned Sz) const
 
unsigned getMaximumVF (unsigned ElemWidth, unsigned Opcode) const
 
unsigned canMapToVector (Type *T) const
 Check if homogeneous aggregate is isomorphic to some VectorType.
 
bool isTreeTinyAndNotFullyVectorizable (bool ForReduction=false) const
 
bool isLoadCombineReductionCandidate (RecurKind RdxKind) const
 Assume that a legal-sized 'or'-reduction of shifted/zexted loaded values can be load combined in the backend.
 
bool isLoadCombineCandidate () const
 Assume that a vector of stores of bitwise-or/shifted/zexted loaded values can be load combined in the backend.
 
OptimizationRemarkEmittergetORE ()
 
std::optional< int > findBestRootPair (ArrayRef< std::pair< Value *, Value * > > Candidates, int Limit=LookAheadHeuristics::ScoreFail)
 Evaluate each pair in Candidates and return index into Candidates for a pair which have highest score deemed to have best chance to form root of profitable tree to vectorize.
 
bool isDeleted (Instruction *I) const
 Checks if the instruction is marked for deletion.
 
void eraseInstruction (Instruction *I)
 Removes an instruction from its block and eventually deletes it.
 
bool isAnalyzedReductionRoot (Instruction *I) const
 Checks if the instruction was already analyzed for being possible reduction root.
 
void analyzedReductionRoot (Instruction *I)
 Register given instruction as already analyzed for being possible reduction root.
 
bool areAnalyzedReductionVals (ArrayRef< Value * > VL) const
 Checks if the provided list of reduced values was checked already for vectorization.
 
void analyzedReductionVals (ArrayRef< Value * > VL)
 Adds the list of reduced values to list of already checked values for the vectorization.
 
void clearReductionData ()
 Clear the list of the analyzed reduction root instructions.
 
bool isAnyGathered (const SmallDenseSet< Value * > &Vals) const
 Checks if the given value is gathered in one of the nodes.
 
bool isVectorized (Value *V) const
 Check if the value is vectorized in the tree.
 
 ~BoUpSLP ()
 

Friends

struct GraphTraits< BoUpSLP * >
 
struct DOTGraphTraits< BoUpSLP * >
 
raw_ostreamoperator<< (raw_ostream &os, const BoUpSLP::ScheduleData &SD)
 

Detailed Description

Bottom Up SLP Vectorizer.

Definition at line 972 of file SLPVectorizer.cpp.

Member Typedef Documentation

◆ ExtraValueToDebugLocsMap

Definition at line 983 of file SLPVectorizer.cpp.

◆ InstrList

Definition at line 980 of file SLPVectorizer.cpp.

◆ OrdersType

Definition at line 985 of file SLPVectorizer.cpp.

◆ StoreList

Definition at line 982 of file SLPVectorizer.cpp.

◆ ValueList

Definition at line 979 of file SLPVectorizer.cpp.

◆ ValueSet

Definition at line 981 of file SLPVectorizer.cpp.

Constructor & Destructor Documentation

◆ BoUpSLP()

llvm::slpvectorizer::BoUpSLP::BoUpSLP ( Function Func,
ScalarEvolution Se,
TargetTransformInfo Tti,
TargetLibraryInfo TLi,
AAResults Aa,
LoopInfo Li,
DominatorTree Dt,
AssumptionCache AC,
DemandedBits DB,
const DataLayout DL,
OptimizationRemarkEmitter ORE 
)
inline

◆ ~BoUpSLP()

BoUpSLP::~BoUpSLP ( )

Member Function Documentation

◆ analyzedReductionRoot()

void llvm::slpvectorizer::BoUpSLP::analyzedReductionRoot ( Instruction I)
inline

Register given instruction as already analyzed for being possible reduction root.

Definition at line 2248 of file SLPVectorizer.cpp.

References I.

◆ analyzedReductionVals()

void llvm::slpvectorizer::BoUpSLP::analyzedReductionVals ( ArrayRef< Value * >  VL)
inline

Adds the list of reduced values to list of already checked values for the vectorization.

Definition at line 2258 of file SLPVectorizer.cpp.

References llvm::hash_value(), and llvm::detail::DenseSetImpl< ValueT, MapTy, ValueInfoT >::insert().

◆ areAnalyzedReductionVals()

bool llvm::slpvectorizer::BoUpSLP::areAnalyzedReductionVals ( ArrayRef< Value * >  VL) const
inline

Checks if the provided list of reduced values was checked already for vectorization.

Definition at line 2253 of file SLPVectorizer.cpp.

References llvm::detail::DenseSetImpl< ValueT, MapTy, ValueInfoT >::contains(), and llvm::hash_value().

◆ buildExternalUses()

void BoUpSLP::buildExternalUses ( const ExtraValueToDebugLocsMap ExternallyUsedValues = {})

Builds external uses of the vectorized scalars, i.e.

the list of vectorized scalars to be extracted, their lanes and their scalar users. ExternallyUsedValues contains additional list of external uses to handle vectorization of reductions.

Definition at line 5171 of file SLPVectorizer.cpp.

References assert(), llvm::dbgs(), doesInTreeUserNeedToExtract(), llvm::MapVector< KeyT, ValueT, MapType, VectorType >::end(), llvm::MapVector< KeyT, ValueT, MapType, VectorType >::find(), isDeleted(), and LLVM_DEBUG.

◆ buildTree() [1/2]

void BoUpSLP::buildTree ( ArrayRef< Value * >  Roots)

Construct a vectorizable tree that starts at Roots.

Definition at line 5385 of file SLPVectorizer.cpp.

References allSameType(), and deleteTree().

◆ buildTree() [2/2]

void BoUpSLP::buildTree ( ArrayRef< Value * >  Roots,
const SmallDenseSet< Value * > &  UserIgnoreLst 
)

Construct a vectorizable tree that starts at Roots, ignoring users for the purpose of scheduling and extraction in the UserIgnoreLst.

Definition at line 5376 of file SLPVectorizer.cpp.

References allSameType(), and deleteTree().

◆ canMapToVector()

unsigned BoUpSLP::canMapToVector ( Type T) const

Check if homogeneous aggregate is isomorphic to some VectorType.

Accepts homogeneous multidimensional aggregate of scalars/vectors like {[4 x i16], [4 x i16]}, { <2 x float>, <2 x float> }, {{{i16, i16}, {i16, i16}}, {{i16, i16}, {i16, i16}}} and so on.

Returns
number of elements in vector if isomorphism exists, 0 otherwise.

Definition at line 6586 of file SLPVectorizer.cpp.

References llvm::FixedVectorType::get(), llvm::DataLayout::getTypeStoreSizeInBits(), isValidElementType(), and N.

◆ clearReductionData()

void llvm::slpvectorizer::BoUpSLP::clearReductionData ( )
inline

Clear the list of the analyzed reduction root instructions.

Definition at line 2262 of file SLPVectorizer.cpp.

References llvm::detail::DenseSetImpl< ValueT, MapTy, ValueInfoT >::clear().

◆ computeMinimumValueSizes()

void BoUpSLP::computeMinimumValueSizes ( )

◆ deleteTree()

void llvm::slpvectorizer::BoUpSLP::deleteTree ( )
inline

◆ doesRootHaveInTreeUses()

bool llvm::slpvectorizer::BoUpSLP::doesRootHaveInTreeUses ( ) const
inline

Returns whether the root node has in-tree uses.

Definition at line 1044 of file SLPVectorizer.cpp.

References llvm::SmallVectorBase< Size_T >::empty(), and llvm::SmallVectorTemplateCommon< T, typename >::front().

◆ eraseInstruction()

void llvm::slpvectorizer::BoUpSLP::eraseInstruction ( Instruction I)
inline

Removes an instruction from its block and eventually deletes it.

It's like Instruction::eraseFromParent() except that the actual deletion is delayed until BoUpSLP is destructed.

Definition at line 2237 of file SLPVectorizer.cpp.

References I.

Referenced by optimizeGatherSequence(), and vectorizeTree().

◆ findBestRootPair()

std::optional< int > llvm::slpvectorizer::BoUpSLP::findBestRootPair ( ArrayRef< std::pair< Value *, Value * > >  Candidates,
int  Limit = LookAheadHeuristics::ScoreFail 
)
inline

Evaluate each pair in Candidates and return index into Candidates for a pair which have highest score deemed to have best chance to form root of profitable tree to vectorize.

Return std::nullopt if no candidate scored above the LookAheadHeuristics::ScoreFail.

Parameters
LimitLower limit of the cost, considered to be good enough score.

Definition at line 2212 of file SLPVectorizer.cpp.

References llvm::slpvectorizer::BoUpSLP::LookAheadHeuristics::getScoreAtLevelRec(), I, and RootLookAheadMaxDepth.

◆ findPartiallyOrderedLoads()

std::optional< BoUpSLP::OrdersType > BoUpSLP::findPartiallyOrderedLoads ( const TreeEntry &  TE)

Sort loads into increasing pointers offsets to allow greater clustering.

Definition at line 4190 of file SLPVectorizer.cpp.

References assert(), clusterSortPtrAccesses(), llvm::SmallVectorTemplateBase< T, bool >::push_back(), and llvm::SmallVectorImpl< T >::reserve().

Referenced by getReorderingData().

◆ findReusedOrderedScalars()

std::optional< BoUpSLP::OrdersType > BoUpSLP::findReusedOrderedScalars ( const TreeEntry &  TE)

◆ getMaximumVF()

unsigned llvm::slpvectorizer::BoUpSLP::getMaximumVF ( unsigned  ElemWidth,
unsigned  Opcode 
) const
inline

Definition at line 1147 of file SLPVectorizer.cpp.

References llvm::TargetTransformInfo::getMaximumVF(), and MaxVFOption.

◆ getMaxVecRegSize()

unsigned llvm::slpvectorizer::BoUpSLP::getMaxVecRegSize ( ) const
inline

Definition at line 1134 of file SLPVectorizer.cpp.

◆ getMinVecRegSize()

unsigned llvm::slpvectorizer::BoUpSLP::getMinVecRegSize ( ) const
inline

Definition at line 1139 of file SLPVectorizer.cpp.

Referenced by getMinVF().

◆ getMinVF()

unsigned llvm::slpvectorizer::BoUpSLP::getMinVF ( unsigned  Sz) const
inline

Definition at line 1143 of file SLPVectorizer.cpp.

References getMinVecRegSize().

◆ getORE()

OptimizationRemarkEmitter * llvm::slpvectorizer::BoUpSLP::getORE ( )
inline

Definition at line 1183 of file SLPVectorizer.cpp.

◆ getReorderingData()

std::optional< BoUpSLP::OrdersType > BoUpSLP::getReorderingData ( const TreeEntry &  TE,
bool  TopToBottom 
)

Gets reordering data for the given tree entry.

If the entry is vectorized

  • just return ReorderIndices, otherwise check if the scalars can be reordered and return the most optimal order.
    Returns
    std::nullopt if ordering is not important, empty order, if identity order is important, or the actual order.
    Parameters
    TopToBottomIf true, include the order of vectorized stores and insertelement nodes, otherwise skip them.

Definition at line 4262 of file SLPVectorizer.cpp.

References addMask(), llvm::all_of(), allConstant(), allSameType(), llvm::any_of(), areTwoInsertFromSameBuildVector(), llvm::SmallVectorTemplateCommon< T, typename >::begin(), llvm::UndefValue::classof(), llvm::count_if(), llvm::Data, E, llvm::SmallVectorBase< Size_T >::empty(), llvm::SmallVectorTemplateCommon< T, typename >::end(), llvm::enumerate(), llvm::find(), llvm::find_if(), findPartiallyOrderedLoads(), findReusedOrderedScalars(), fixupOrderingIndices(), llvm::FixedVectorType::get(), llvm::PoisonValue::get(), getExtractIndex(), getInsertIndex(), llvm::TargetTransformInfo::getNumberOfParts(), llvm::Value::getNumUses(), llvm::User::getOperand(), llvm::TargetTransformInfo::getShuffleCost(), llvm::TargetTransformInfo::getVectorInstrCost(), I, Idx, llvm::inversePermutation(), llvm::ShuffleVectorInst::isOneUseSingleSourceMask(), isSplat(), llvm::PoisonMaskElem, reorderOrder(), llvm::SmallBitVector::set(), llvm::SmallVectorBase< Size_T >::size(), llvm::TargetTransformInfo::SK_PermuteSingleSrc, llvm::ArrayRef< T >::slice(), llvm::stable_sort(), llvm::TargetTransformInfo::TCK_RecipThroughput, llvm::SmallBitVector::test(), llvm::transform(), and llvm::Value::user_begin().

Referenced by reorderBottomToTop(), and reorderTopToBottom().

◆ getRootNodeScalars()

ArrayRef< Value * > llvm::slpvectorizer::BoUpSLP::getRootNodeScalars ( ) const
inline

Return the scalars of the root node.

Definition at line 1050 of file SLPVectorizer.cpp.

References assert(), llvm::SmallVectorBase< Size_T >::empty(), and llvm::SmallVectorTemplateCommon< T, typename >::front().

◆ getSpillCost()

InstructionCost BoUpSLP::getSpillCost ( ) const

◆ getTreeCost()

InstructionCost BoUpSLP::getTreeCost ( ArrayRef< Value * >  VectorizedVals = std::nullopt)
Returns
the vectorization cost of the subtree that starts at VL. A negative number means that this is profitable.

Definition at line 9257 of file SLPVectorizer.cpp.

References llvm::all_of(), llvm::any_of(), areTwoInsertFromSameBuildVector(), assert(), llvm::SmallVectorTemplateCommon< T, typename >::back(), llvm::sampleprof::Base, llvm::SmallVectorTemplateCommon< T, typename >::begin(), llvm::CallingConv::C, CostKind, llvm::SmallPtrSetImpl< PtrType >::count(), llvm::Data, llvm::dbgs(), DL, llvm::dump(), E, llvm::SmallVectorImpl< T >::emplace_back(), llvm::ArrayRef< T >::empty(), llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT, BucketT >::end(), llvm::SmallVectorTemplateCommon< T, typename >::end(), llvm::enumerate(), F, llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT, BucketT >::find(), llvm::find_if(), llvm::IntegerType::get(), llvm::FixedVectorType::get(), llvm::TargetTransformInfo::getCastInstrCost(), llvm::Type::getContext(), llvm::TargetTransformInfo::getExtractWithExtendCost(), getInsertIndex(), llvm::TargetTransformInfo::getScalarizationOverhead(), getShuffleCost(), llvm::TargetTransformInfo::getShuffleCost(), getSpillCost(), llvm::InsertElementInst::getType(), llvm::TargetTransformInfo::getVectorInstrCost(), llvm::APInt::getZero(), I, Idx, llvm::detail::DenseSetImpl< ValueT, MapTy, ValueInfoT >::insert(), llvm::SmallPtrSetImpl< PtrType >::insert(), isFirstInsertElement(), llvm::ShuffleVectorInst::isIdentityMask(), LLVM_DEBUG, llvm::TargetTransformInfo::None, OS, llvm::PoisonMaskElem, llvm::SmallVectorTemplateBase< T, bool >::push_back(), shortBundleName(), llvm::SmallVectorBase< Size_T >::size(), llvm::TargetTransformInfo::SK_PermuteSingleSrc, llvm::TargetTransformInfo::SK_PermuteTwoSrc, llvm::TargetTransformInfo::TCK_RecipThroughput, llvm::Vector, llvm::ViewGraph(), and ViewSLPTree.

◆ getTreeSize()

unsigned llvm::slpvectorizer::BoUpSLP::getTreeSize ( ) const
inline

Definition at line 1081 of file SLPVectorizer.cpp.

References llvm::SmallVectorBase< Size_T >::size().

◆ getVectorElementSize()

unsigned BoUpSLP::getVectorElementSize ( Value V)
Returns
The vector element size in bits to use when vectorizing the expression tree ending at V. If V is a store, the size is the width of the stored value. Otherwise, the size is the width of the largest loaded value reaching V. This method is used by the vectorizer to calculate vectorization factors.

Definition at line 13404 of file SLPVectorizer.cpp.

References DL, E, llvm::SmallVectorImpl< T >::emplace_back(), llvm::SmallVectorBase< Size_T >::empty(), llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT, BucketT >::end(), llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT, BucketT >::find(), llvm::User::getOperand(), getVectorElementSize(), I, llvm::SmallPtrSetImpl< PtrType >::insert(), llvm::isa(), and llvm::SmallVectorImpl< T >::pop_back_val().

Referenced by getVectorElementSize().

◆ isAnalyzedReductionRoot()

bool llvm::slpvectorizer::BoUpSLP::isAnalyzedReductionRoot ( Instruction I) const
inline

Checks if the instruction was already analyzed for being possible reduction root.

Definition at line 2243 of file SLPVectorizer.cpp.

References I.

◆ isAnyGathered()

bool llvm::slpvectorizer::BoUpSLP::isAnyGathered ( const SmallDenseSet< Value * > &  Vals) const
inline

Checks if the given value is gathered in one of the nodes.

Definition at line 2267 of file SLPVectorizer.cpp.

References llvm::any_of(), and llvm::detail::DenseSetImpl< ValueT, MapTy, ValueInfoT >::contains().

◆ isDeleted()

bool llvm::slpvectorizer::BoUpSLP::isDeleted ( Instruction I) const
inline

Checks if the instruction is marked for deletion.

Definition at line 2232 of file SLPVectorizer.cpp.

References I.

Referenced by buildExternalUses(), and optimizeGatherSequence().

◆ isLoadCombineCandidate()

bool BoUpSLP::isLoadCombineCandidate ( ) const

Assume that a vector of stores of bitwise-or/shifted/zexted loaded values can be load combined in the backend.

Load combining may not be allowed in the IR optimizer, so we do not want to alter the pattern. For example, partially transforming a scalar bswap() pattern into vector code is effectively impossible for the backend to undo. TODO: If load combining is allowed in the IR optimizer, this analysis may not be necessary.

Definition at line 8927 of file SLPVectorizer.cpp.

References isLoadCombineCandidateImpl(), llvm::PatternMatch::m_Store(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::match(), and X.

◆ isLoadCombineReductionCandidate()

bool BoUpSLP::isLoadCombineReductionCandidate ( RecurKind  RdxKind) const

Assume that a legal-sized 'or'-reduction of shifted/zexted loaded values can be load combined in the backend.

Load combining may not be allowed in the IR optimizer, so we do not want to alter the pattern. For example, partially transforming a scalar bswap() pattern into vector code is effectively impossible for the backend to undo. TODO: If load combining is allowed in the IR optimizer, this analysis may not be necessary.

Definition at line 8917 of file SLPVectorizer.cpp.

References isLoadCombineCandidateImpl(), and llvm::Or.

◆ isTreeTinyAndNotFullyVectorizable()

bool BoUpSLP::isTreeTinyAndNotFullyVectorizable ( bool  ForReduction = false) const
Returns
True if the VectorizableTree is both tiny and not fully vectorizable. We do not vectorize such trees.

Definition at line 8940 of file SLPVectorizer.cpp.

References llvm::all_of(), allConstant(), assert(), llvm::count_if(), isSplat(), MinTreeSize, and SLPCostThreshold.

◆ isVectorized()

bool llvm::slpvectorizer::BoUpSLP::isVectorized ( Value V) const
inline

Check if the value is vectorized in the tree.

Definition at line 2272 of file SLPVectorizer.cpp.

◆ optimizeGatherSequence()

void BoUpSLP::optimizeGatherSequence ( )

◆ reorderBottomToTop()

void BoUpSLP::reorderBottomToTop ( bool  IgnoreReorder = false)

◆ reorderTopToBottom()

void BoUpSLP::reorderTopToBottom ( )

◆ vectorizeTree() [1/2]

Value * BoUpSLP::vectorizeTree ( )

Vectorize the tree that starts with the elements in VL.

Returns the vectorized root.

Definition at line 12170 of file SLPVectorizer.cpp.

References vectorizeTree().

Referenced by vectorizeTree().

◆ vectorizeTree() [2/2]

Value * BoUpSLP::vectorizeTree ( const ExtraValueToDebugLocsMap ExternallyUsedValues,
SmallVectorImpl< std::pair< Value *, Value * > > &  ReplacedExternals,
Instruction ReductionRoot = nullptr 
)

Vectorize the tree but with the list of externally used values ExternallyUsedValues.

Values in this MapVector can be replaced but the generated extractvalue instructions.

Parameters
ReplacedExternalscontaind list of replaced external values {scalar, replace} after emitting extractelement for external uses.

Definition at line 12187 of file SLPVectorizer.cpp.

References llvm::slpvectorizer::BoUpSLP::ShuffleInstructionBuilder::add(), llvm::any_of(), areTwoInsertFromSameBuildVector(), assert(), llvm::SmallVectorTemplateCommon< T, typename >::back(), llvm::ArrayRef< T >::back(), llvm::sampleprof::Base, llvm::SmallVectorTemplateCommon< T, typename >::begin(), llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT, BucketT >::clear(), llvm::Instruction::comesBefore(), llvm::MapVector< KeyT, ValueT, MapType, VectorType >::count(), llvm::IRBuilderBase::CreateExtractElement(), llvm::IRBuilderBase::CreateIntCast(), llvm::Data, llvm::dbgs(), E, llvm::SmallVectorImpl< T >::emplace_back(), llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT, BucketT >::end(), llvm::SmallVectorTemplateCommon< T, typename >::end(), llvm::BasicBlock::end(), eraseInstruction(), F, llvm::slpvectorizer::BoUpSLP::ShuffleInstructionBuilder::finalize(), llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT, BucketT >::find(), llvm::find_if(), llvm::SmallVectorTemplateCommon< T, typename >::front(), llvm::ArrayRef< T >::front(), llvm::get(), llvm::FixedVectorType::get(), llvm::PoisonValue::get(), llvm::SetVector< T, Vector, Set, N >::getArrayRef(), llvm::IRBuilderBase::GetInsertBlock(), getInsertIndex(), llvm::IRBuilderBase::GetInsertPoint(), llvm::IRBuilderBase::getInt32(), llvm::ilist_node_impl< OptionsT >::getIterator(), llvm::User::getOperand(), llvm::BasicBlock::getParent(), llvm::Instruction::getParent(), llvm::BasicBlock::getTerminator(), llvm::InsertElementInst::getType(), llvm::Value::getType(), I, Idx, llvm::SetVector< T, Vector, Set, N >::insert(), llvm::detail::DenseSetImpl< ValueT, MapTy, ValueInfoT >::insert(), llvm::is_contained(), isFirstInsertElement(), LLVM_DEBUG, llvm::Instruction::moveAfter(), PHI, llvm::PoisonMaskElem, llvm::SmallVectorTemplateBase< T, bool >::push_back(), llvm::SmallVectorTemplateCommon< T, typename >::rbegin(), llvm::SmallVectorTemplateCommon< T, typename >::rend(), llvm::Value::replaceAllUsesWith(), llvm::User::replaceUsesOfWith(), llvm::reverse(), llvm::IRBuilderBase::SetCurrentDebugLocation(), llvm::IRBuilderBase::SetInsertPoint(), llvm::SmallVectorBase< Size_T >::size(), llvm::sort(), llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT, BucketT >::try_emplace(), llvm::User::User(), llvm::Vector, and vectorizeTree().

Friends And Related Function Documentation

◆ DOTGraphTraits< BoUpSLP * >

friend struct DOTGraphTraits< BoUpSLP * >
friend

Definition at line 3225 of file SLPVectorizer.cpp.

◆ GraphTraits< BoUpSLP * >

friend struct GraphTraits< BoUpSLP * >
friend

Definition at line 3225 of file SLPVectorizer.cpp.

◆ operator<<

raw_ostream & operator<< ( raw_ostream os,
const BoUpSLP::ScheduleData &  SD 
)
friend

Definition at line 3225 of file SLPVectorizer.cpp.


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