LLVM  16.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  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. More...
 
ValuevectorizeTree (ExtraValueToDebugLocsMap &ExternallyUsedValues, Instruction *ReductionRoot=nullptr)
 Vectorize the tree but with the list of externally used values ExternallyUsedValues. More...
 
InstructionCost getSpillCost () const
 
InstructionCost getTreeCost (ArrayRef< Value * > VectorizedVals=None)
 
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. More...
 
void buildTree (ArrayRef< Value * > Roots)
 Construct a vectorizable tree that starts at Roots. More...
 
bool isVectorizedFirstNode () const
 Checks if the very first tree node is going to be vectorized. More...
 
InstructiongetFirstNodeMainOp () const
 Returns the main instruction for the very first node. More...
 
void buildExternalUses (const ExtraValueToDebugLocsMap &ExternallyUsedValues={})
 Builds external uses of the vectorized scalars, i.e. More...
 
void deleteTree ()
 Clear the internal data structures that are created by 'buildTree'. More...
 
unsigned getTreeSize () const
 
void optimizeGatherSequence ()
 Perform LICM and CSE on the newly generated gather sequences. More...
 
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. More...
 
Optional< OrdersTypefindPartiallyOrderedLoads (const TreeEntry &TE)
 Sort loads into increasing pointers offsets to allow greater clustering. More...
 
Optional< OrdersTypegetReorderingData (const TreeEntry &TE, bool TopToBottom)
 Gets reordering data for the given tree entry. More...
 
void reorderTopToBottom ()
 Reorders the current graph to the most profitable order starting from the root node to the leaf nodes. More...
 
void reorderBottomToTop (bool IgnoreReorder=false)
 Reorders the current graph to the most profitable order starting from leaves to the root. More...
 
unsigned getVectorElementSize (Value *V)
 
void computeMinimumValueSizes ()
 Compute the minimum type sizes required to represent the entries in a vectorizable tree. More...
 
unsigned getMaxVecRegSize () const
 
unsigned getMinVecRegSize () const
 
unsigned getMinVF (unsigned Sz) const
 
unsigned getMaximumVF (unsigned ElemWidth, unsigned Opcode) const
 
unsigned canMapToVector (Type *T, const DataLayout &DL) const
 Check if homogeneous aggregate is isomorphic to some VectorType. More...
 
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. More...
 
bool isLoadCombineCandidate () const
 Assume that a vector of stores of bitwise-or/shifted/zexted loaded values can be load combined in the backend. More...
 
OptimizationRemarkEmittergetORE ()
 
Optional< intfindBestRootPair (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. More...
 
bool isDeleted (Instruction *I) const
 Checks if the instruction is marked for deletion. More...
 
void eraseInstruction (Instruction *I)
 Removes an instruction from its block and eventually deletes it. More...
 
bool isAnalyzedReductionRoot (Instruction *I) const
 Checks if the instruction was already analyzed for being possible reduction root. More...
 
void analyzedReductionRoot (Instruction *I)
 Register given instruction as already analyzed for being possible reduction root. More...
 
bool areAnalyzedReductionVals (ArrayRef< Value * > VL) const
 Checks if the provided list of reduced values was checked already for vectorization. More...
 
void analyzedReductionVals (ArrayRef< Value * > VL)
 Adds the list of reduced values to list of already checked values for the vectorization. More...
 
void clearReductionData ()
 Clear the list of the analyzed reduction root instructions. More...
 
bool isAnyGathered (const SmallDenseSet< Value * > &Vals) const
 Checks if the given value is gathered in one of the nodes. More...
 
bool isVectorized (Value *V) const
 Check if the value is vectorized in the tree. More...
 
 ~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 928 of file SLPVectorizer.cpp.

Member Typedef Documentation

◆ ExtraValueToDebugLocsMap

Definition at line 938 of file SLPVectorizer.cpp.

◆ InstrList

Definition at line 934 of file SLPVectorizer.cpp.

◆ OrdersType

Definition at line 939 of file SLPVectorizer.cpp.

◆ StoreList

Definition at line 936 of file SLPVectorizer.cpp.

◆ ValueList

Definition at line 933 of file SLPVectorizer.cpp.

◆ ValueSet

Definition at line 935 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 2182 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 2192 of file SLPVectorizer.cpp.

References llvm::hash_value().

◆ 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 2187 of file SLPVectorizer.cpp.

References 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 4595 of file SLPVectorizer.cpp.

◆ buildTree() [1/2]

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

Construct a vectorizable tree that starts at Roots.

Definition at line 4809 of file SLPVectorizer.cpp.

References allSameType().

◆ 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 4800 of file SLPVectorizer.cpp.

References allSameType().

◆ canMapToVector()

unsigned BoUpSLP::canMapToVector ( Type T,
const DataLayout DL 
) 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 5908 of file SLPVectorizer.cpp.

References DL, llvm::FixedVectorType::get(), isValidElementType(), N, llvm::ARM_MB::ST, and T.

◆ clearReductionData()

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

Clear the list of the analyzed reduction root instructions.

Definition at line 2196 of file SLPVectorizer.cpp.

◆ computeMinimumValueSizes()

void BoUpSLP::computeMinimumValueSizes ( )

◆ deleteTree()

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

Clear the internal data structures that are created by 'buildTree'.

Definition at line 1013 of file SLPVectorizer.cpp.

◆ 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 2171 of file SLPVectorizer.cpp.

References I.

◆ findBestRootPair()

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 None if no candidate scored above the LookAheadHeuristics::ScoreFail.

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

Definition at line 2146 of file SLPVectorizer.cpp.

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

◆ findPartiallyOrderedLoads()

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

Sort loads into increasing pointers offsets to allow greater clustering.

Definition at line 3802 of file SLPVectorizer.cpp.

References assert(), clusterSortPtrAccesses(), DL, llvm::None, and llvm::SmallVectorImpl< T >::reserve().

◆ findReusedOrderedScalars()

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

Checks if the specified gather tree entry TE can be represented as a shuffled vector entry + (possibly) permutation with other gathers.

It implements the checks only for possibly ordered scalars (Loads, ExtractElement, ExtractValue), which can be part of the graph.

Definition at line 3564 of file SLPVectorizer.cpp.

References assert(), llvm::SmallVectorImpl< T >::clear(), llvm::SmallBitVector::count(), llvm::find(), I, None, llvm::SmallBitVector::reset(), llvm::SmallBitVector::set(), and llvm::SmallBitVector::test().

◆ getFirstNodeMainOp()

Instruction* llvm::slpvectorizer::BoUpSLP::getFirstNodeMainOp ( ) const
inline

Returns the main instruction for the very first node.

Definition at line 1000 of file SLPVectorizer.cpp.

References assert().

◆ getMaximumVF()

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

Definition at line 1091 of file SLPVectorizer.cpp.

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

◆ getMaxVecRegSize()

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

Definition at line 1078 of file SLPVectorizer.cpp.

◆ getMinVecRegSize()

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

Definition at line 1083 of file SLPVectorizer.cpp.

◆ getMinVF()

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

Definition at line 1087 of file SLPVectorizer.cpp.

References llvm::max().

◆ getORE()

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

Definition at line 1127 of file SLPVectorizer.cpp.

◆ getReorderingData()

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.
    Parameters
    TopToBottomIf true, include the order of vectorized stores and insertelement nodes, otherwise skip them.

Definition at line 3866 of file SLPVectorizer.cpp.

References llvm::all_of(), allSameType(), llvm::any_of(), areTwoInsertFromSameBuildVector(), llvm::Data, llvm::enumerate(), llvm::find(), fixupOrderingIndices(), getExtractIndex(), getInsertIndex(), llvm::User::getOperand(), llvm::Value::hasOneUse(), I, llvm::inversePermutation(), llvm::ShuffleVectorInst::isOneUseSingleSourceMask(), llvm::makeArrayRef(), llvm::None, PHI, reorderOrder(), llvm::stable_sort(), llvm::transform(), llvm::UndefMaskElem, llvm::Value::user_begin(), and llvm::NVPTX::PTXLdStInstCode::V2.

◆ getSpillCost()

InstructionCost BoUpSLP::getSpillCost ( ) const

◆ getTreeCost()

InstructionCost BoUpSLP::getTreeCost ( ArrayRef< Value * >  VectorizedVals = None)

◆ getTreeSize()

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

Definition at line 1028 of file SLPVectorizer.cpp.

◆ getVectorElementSize()

unsigned BoUpSLP::getVectorElementSize ( Value V)

◆ 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 2177 of file SLPVectorizer.cpp.

References I.

◆ isAnyGathered()

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

◆ isDeleted()

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

Checks if the instruction is marked for deletion.

Definition at line 2166 of file SLPVectorizer.cpp.

References I.

◆ 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 7146 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 7136 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 7159 of file SLPVectorizer.cpp.

References allConstant(), assert(), isSplat(), and MinTreeSize.

◆ isVectorized()

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

Check if the value is vectorized in the tree.

Definition at line 2206 of file SLPVectorizer.cpp.

◆ isVectorizedFirstNode()

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

Checks if the very first tree node is going to be vectorized.

Definition at line 994 of file SLPVectorizer.cpp.

◆ optimizeGatherSequence()

void BoUpSLP::optimizeGatherSequence ( )

◆ reorderBottomToTop()

void BoUpSLP::reorderBottomToTop ( bool  IgnoreReorder = false)

Reorders the current graph to the most profitable order starting from leaves to the root.

It allows to rotate small subgraphs and reduce the number of reshuffles if the leaf nodes use the same order. In this case we can merge the orders and just shuffle user node instead of shuffling its operands. Plus, even the leaf nodes have different orders, it allows to sink reordering in the graph closer to the root node and merge it later during analysis.

Definition at line 4344 of file SLPVectorizer.cpp.

References llvm::all_of(), assert(), llvm::SmallPtrSetImplBase::clear(), llvm::DenseMapBase< DenseMap< KeyT, ValueT, DenseMapInfo< KeyT >, llvm::detail::DenseMapPair< KeyT, ValueT > >, KeyT, ValueT, DenseMapInfo< KeyT >, llvm::detail::DenseMapPair< KeyT, ValueT > >::count(), llvm::count_if(), llvm::Data, llvm::drop_begin(), E, llvm::slpvectorizer::BoUpSLP::EdgeInfo::EdgeIdx, llvm::SetVector< T, Vector, Set >::empty(), llvm::ArrayRef< T >::empty(), llvm::DenseMapBase< DenseMap< KeyT, ValueT, DenseMapInfo< KeyT >, llvm::detail::DenseMapPair< KeyT, ValueT > >, KeyT, ValueT, DenseMapInfo< KeyT >, llvm::detail::DenseMapPair< KeyT, ValueT > >::end(), llvm::DenseMapBase< DenseMap< KeyT, ValueT, DenseMapInfo< KeyT >, llvm::detail::DenseMapPair< KeyT, ValueT > >, KeyT, ValueT, DenseMapInfo< KeyT >, llvm::detail::DenseMapPair< KeyT, ValueT > >::find(), fixupOrderingIndices(), llvm::for_each(), llvm::ArrayRef< T >::front(), I, if(), llvm::SetVector< T, Vector, Set >::insert(), llvm::SmallPtrSetImpl< PtrType >::insert(), llvm::inversePermutation(), llvm::BitmaskEnumDetail::Mask(), P, reorderOrder(), reorderReuses(), llvm::reorderScalars(), llvm::ArrayRef< T >::size(), llvm::sort(), llvm::SPII::Store, llvm::transform(), llvm::DenseMapBase< DenseMap< KeyT, ValueT, DenseMapInfo< KeyT >, llvm::detail::DenseMapPair< KeyT, ValueT > >, KeyT, ValueT, DenseMapInfo< KeyT >, llvm::detail::DenseMapPair< KeyT, ValueT > >::try_emplace(), llvm::UndefMaskElem, Users, and llvm::slpvectorizer::BoUpSLP::EdgeInfo::UserTE.

◆ reorderTopToBottom()

void BoUpSLP::reorderTopToBottom ( )

Reorders the current graph to the most profitable order starting from the root node to the leaf nodes.

The best order is chosen only from the nodes of the same size (vectorization factor). Smaller nodes are considered parts of subgraph with smaller VF and they are reordered independently. We can make it because we still need to extend smaller nodes to the wider VF and we can merge reordering shuffles with the widening shuffles.

Definition at line 4056 of file SLPVectorizer.cpp.

References addMask(), llvm::all_of(), assert(), llvm::DenseMapBase< DenseMap< KeyT, ValueT, DenseMapInfo< KeyT >, llvm::detail::DenseMapPair< KeyT, ValueT > >, KeyT, ValueT, DenseMapInfo< KeyT >, llvm::detail::DenseMapPair< KeyT, ValueT > >::count(), llvm::drop_begin(), E, llvm::ArrayRef< T >::empty(), llvm::DenseMapBase< DenseMap< KeyT, ValueT, DenseMapInfo< KeyT >, llvm::detail::DenseMapPair< KeyT, ValueT > >, KeyT, ValueT, DenseMapInfo< KeyT >, llvm::detail::DenseMapPair< KeyT, ValueT > >::end(), llvm::DenseMapBase< DenseMap< KeyT, ValueT, DenseMapInfo< KeyT >, llvm::detail::DenseMapPair< KeyT, ValueT > >, KeyT, ValueT, DenseMapInfo< KeyT >, llvm::detail::DenseMapPair< KeyT, ValueT > >::find(), fixupOrderingIndices(), llvm::for_each(), llvm::ArrayRef< T >::front(), llvm::FixedVectorType::get(), I, llvm::DenseMapBase< DenseMap< KeyT, ValueT, DenseMapInfo< KeyT >, llvm::detail::DenseMapPair< KeyT, ValueT > >, KeyT, ValueT, DenseMapInfo< KeyT >, llvm::detail::DenseMapPair< KeyT, ValueT > >::insert(), llvm::inversePermutation(), llvm::isa(), llvm::TargetTransformInfo::isLegalAltInstr(), llvm::BitmaskEnumDetail::Mask(), move, PHI, RecursionMaxDepth, reorderOrder(), llvm::reorderScalars(), llvm::SmallBitVector::set(), llvm::ArrayRef< T >::size(), llvm::SPII::Store, llvm::transform(), llvm::DenseMapBase< DenseMap< KeyT, ValueT, DenseMapInfo< KeyT >, llvm::detail::DenseMapPair< KeyT, ValueT > >, KeyT, ValueT, DenseMapInfo< KeyT >, llvm::detail::DenseMapPair< KeyT, ValueT > >::try_emplace(), and llvm::UndefMaskElem.

◆ vectorizeTree() [1/2]

Value * BoUpSLP::vectorizeTree ( )

Vectorize the tree that starts with the elements in VL.

Returns the vectorized root.

Definition at line 8997 of file SLPVectorizer.cpp.

◆ vectorizeTree() [2/2]

Value* llvm::slpvectorizer::BoUpSLP::vectorizeTree ( ExtraValueToDebugLocsMap ExternallyUsedValues,
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.

Friends And Related Function Documentation

◆ DOTGraphTraits< BoUpSLP * >

friend struct DOTGraphTraits< BoUpSLP * >
friend

Definition at line 3027 of file SLPVectorizer.cpp.

◆ GraphTraits< BoUpSLP * >

friend struct GraphTraits< BoUpSLP * >
friend

Definition at line 3026 of file SLPVectorizer.cpp.

◆ operator<<

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

Definition at line 3019 of file SLPVectorizer.cpp.


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