This class builds and contains all of the top-level loop structures in the specified function. More...

#include "llvm/Support/GenericLoopInfo.h"

Inheritance diagram for llvm::LoopInfoBase< BlockT, LoopT >:

Public Types
using	iterator = typename std::vector<LoopT *>::const_iterator
	iterator/begin/end - The interface to the top-level loops in the current function.
using	reverse_iterator
using	Edge = std::pair<BlockT , BlockT >
	Edge type.

Public Member Functions
	LoopInfoBase ()=default
	~LoopInfoBase ()
	LoopInfoBase (LoopInfoBase &&Arg)
LoopInfoBase &	operator= (LoopInfoBase &&RHS)
void	releaseMemory ()
LoopT *	AllocateLoop ()
iterator	begin () const
iterator	end () const
reverse_iterator	rbegin () const
reverse_iterator	rend () const
bool	empty () const
SmallVector< LoopT *, 4 >	getLoopsInPreorder () const
	Return all of the loops in the function in preorder across the loop nests, with siblings in forward program order.
SmallVector< LoopT *, 4 >	getLoopsInReverseSiblingPreorder () const
	Return all of the loops in the function in preorder across the loop nests, with siblings in reverse program order.
LoopT *	getLoopFor (const BlockT *BB) const
	Return the inner most loop that BB lives in.
const LoopT *	operator[] (const BlockT *BB) const
	Same as getLoopFor.
unsigned	getLoopDepth (const BlockT *BB) const
	Return the loop nesting level of the specified block.
bool	hasNoExitBlocks (const LoopT &L) const
	Return true if `L` does not have any exit blocks.
void	getExitEdges (const LoopT &L, SmallVectorImpl< Edge > &ExitEdges) const
	Return all pairs of (inside_block,outside_block).
BlockT *	getUniqueLatchExitBlock (const LoopT &L) const
	Return the unique exit block for the latch of `L`, or null if there are multiple different exit blocks or the latch is not exiting.
template<typename PredicateT>
void	removeBlocksIf (LoopT &L, PredicateT Pred)
	Remove every block satisfying `Pred` from `L's` block list, preserving the order of the remaining blocks.
template<typename PredicateT>
void	removeBlocksFromLoopAndAncestors (LoopT Start, LoopT Stop, PredicateT Pred)
	Remove every block satisfying `Pred` from `Start` and each of its ancestors up to but not including `Stop`, which must be null or an ancestor of `Start`; a null `Stop` walks to the top level.
template<typename PredicateT>
SmallVector< LoopT *, 4 >	takeChildrenIf (LoopT *Parent, PredicateT Pred)
	Detach and return the children of `Parent` (the top-level loops if `Parent` is null) that satisfy `Pred`, clearing their parent pointers.
LoopT *	getSmallestCommonLoop (LoopT A, LoopT B) const
	Find the innermost loop containing both given loops.
LoopT *	getSmallestCommonLoop (BlockT A, BlockT B) const
	Find the innermost loop containing both given blocks.
bool	isLoopHeader (const BlockT *BB) const
const std::vector< LoopT * > &	getTopLevelLoops () const
	Return the top-level loops.
LoopT *	removeLoop (iterator I)
	This removes the specified top-level loop from this loop info object.
void	changeLoopFor (const BlockT BB, LoopT L)
	Change the top-level loop that contains BB to the specified loop.
void	changeTopLevelLoop (LoopT OldLoop, LoopT NewLoop)
	Replace the specified loop in the top-level loops list with the indicated loop.
void	addTopLevelLoop (LoopT *New)
	This adds the specified loop to the collection of top-level loops.
void	removeBlock (BlockT *BB)
	This method completely removes BB from all data structures, including all of the Loop objects it is nested in and our mapping from BasicBlocks to loops.
void	print (raw_ostream &OS) const
void	verify () const
void	destroy (LoopT *L)
	Destroy a loop that has been removed from the LoopInfo nest.

void	analyze (ParentT F)
	Create the loop forest for a function.
void	analyze (ParentT F, function_ref< const DominatorTreeBase< BlockT, false > &()> GetDomTree)
	Call `GetDomTree` if a dominator tree is needed.
void	analyze (const DominatorTreeBase< BlockT, false > &DomTree)
	Analyze the function `DomTree` describes.

Static Public Member Functions
static bool	isNotAlreadyContainedIn (const LoopT SubLoop, const LoopT ParentLoop)

Friends
class	LoopBase< BlockT, LoopT >
class	LoopInfo

Detailed Description

template<class BlockT, class LoopT>
class llvm::LoopInfoBase< BlockT, LoopT >

This class builds and contains all of the top-level loop structures in the specified function.

Definition at line 518 of file GenericLoopInfo.h.

Member Typedef Documentation

◆ Edge

template<class BlockT, class LoopT>

using llvm::LoopInfoBase< BlockT, LoopT >::Edge = std::pair<BlockT *, BlockT *>

Edge type.

Definition at line 706 of file GenericLoopInfo.h.

◆ iterator

template<class BlockT, class LoopT>

using llvm::LoopInfoBase< BlockT, LoopT >::iterator = typename std::vector<LoopT *>::const_iterator

iterator/begin/end - The interface to the top-level loops in the current function.

Definition at line 596 of file GenericLoopInfo.h.

◆ reverse_iterator

template<class BlockT, class LoopT>

using llvm::LoopInfoBase< BlockT, LoopT >::reverse_iterator

Initial value:

typename std::vector<LoopT *>::const_reverse_iterator

Definition at line 597 of file GenericLoopInfo.h.

Constructor & Destructor Documentation

◆ LoopInfoBase() [1/2]

template<class BlockT, class LoopT>

llvm::LoopInfoBase< BlockT, LoopT >::LoopInfoBase ( )

default

◆ ~LoopInfoBase()

template<class BlockT, class LoopT>

llvm::LoopInfoBase< BlockT, LoopT >::~LoopInfoBase ( )

inline

Definition at line 547 of file GenericLoopInfo.h.

◆ LoopInfoBase() [2/2]

template<class BlockT, class LoopT>

llvm::LoopInfoBase< BlockT, LoopT >::LoopInfoBase ( LoopInfoBase< BlockT, LoopT > && Arg )

inline

Definition at line 549 of file GenericLoopInfo.h.

Member Function Documentation

◆ addTopLevelLoop()

template<class BlockT, class LoopT>

void llvm::LoopInfoBase< BlockT, LoopT >::addTopLevelLoop ( LoopT * New )

inline

This adds the specified loop to the collection of top-level loops.

Definition at line 813 of file GenericLoopInfo.h.

Referenced by llvm::addClonedBlockToLoopInfo(), buildClonedLoops(), llvm::cloneLoop(), cloneLoopNest(), llvm::cloneLoopWithPreheader(), llvm::TileInfo::CreateTiledLoops(), llvm::expandReductionViaLoop(), hoistLoopToNewParent(), rebuildLoopAfterUnswitch(), and updateLoopInfo().

◆ AllocateLoop()

template<class BlockT, class LoopT>

LoopT * llvm::LoopInfoBase< BlockT, LoopT >::AllocateLoop ( )

inline

Definition at line 586 of file GenericLoopInfo.h.

Referenced by llvm::addClonedBlockToLoopInfo(), buildClonedLoops(), llvm::cloneLoop(), cloneLoopNest(), llvm::cloneLoopWithPreheader(), llvm::TileInfo::CreateTiledLoops(), llvm::expandReductionViaLoop(), separateNestedLoop(), and updateLoopInfo().

◆ analyze() [1/3]

template<class BlockT, class LoopT>

void llvm::LoopInfoBase< BlockT, LoopT >::analyze ( const DominatorTreeBase< BlockT, false > & DomTree )

Analyze the function DomTree describes.

◆ analyze() [2/3]

template<class BlockT, class LoopT>

void llvm::LoopInfoBase< BlockT, LoopT >::analyze ( ParentT F )

Create the loop forest for a function.

A dominator tree is needed only for an irreducible CFG, where dominance reduces a loop that an edge re-enters to the natural loop of its header's backedges. Build a dominator tree if one is needed.

Definition at line 469 of file GenericLoopInfoImpl.h.

References analyze(), F, and llvm::DominatorTreeBase< NodeT, IsPostDom >::recalculate().

Referenced by analyze(), annotateAllFunctions(), llvm::OptimizationRemarkEmitter::OptimizationRemarkEmitter(), llvm::LoopAnalysis::run(), and verify().

◆ analyze() [3/3]

template<class BlockT, class LoopT>

void llvm::LoopInfoBase< BlockT, LoopT >::analyze	(	ParentT	F,
		function_ref< const DominatorTreeBase< BlockT, false > &()>	GetDomTree )

Call GetDomTree if a dominator tree is needed.

◆ begin()

template<class BlockT, class LoopT>

iterator llvm::LoopInfoBase< BlockT, LoopT >::begin ( ) const

inline

Definition at line 599 of file GenericLoopInfo.h.

Referenced by llvm::LoopFullUnrollPass::run(), and verify().

◆ changeLoopFor()

template<class BlockT, class LoopT>

void llvm::LoopInfoBase< BlockT, LoopT >::changeLoopFor	(	const BlockT *	BB,
		LoopT *	L )

inline

Change the top-level loop that contains BB to the specified loop.

This should be used by transformations that restructure the loop hierarchy tree.

Definition at line 790 of file GenericLoopInfo.h.

Referenced by cloneLoopNest(), deleteDeadBlocksFromLoop(), hoistLoopToNewParent(), rebuildLoopAfterUnswitch(), separateNestedLoop(), and updateLoopInfo().

◆ changeTopLevelLoop()

template<class BlockT, class LoopT>

void llvm::LoopInfoBase< BlockT, LoopT >::changeTopLevelLoop	(	LoopT *	OldLoop,
		LoopT *	NewLoop )

inline

Replace the specified loop in the top-level loops list with the indicated loop.

Definition at line 804 of file GenericLoopInfo.h.

Referenced by separateNestedLoop().

◆ destroy()

template<class BlockT, class LoopT>

void llvm::LoopInfoBase< BlockT, LoopT >::destroy ( LoopT * L )

inline

Destroy a loop that has been removed from the LoopInfo nest.

This runs the destructor of the loop object making it invalid to reference afterward. The memory is retained so that the pointer to the loop remains valid.

The caller is responsible for removing this loop from the loop nest and otherwise disconnecting it from the broader LoopInfo data structures. Callers that don't naturally handle this themselves should probably call ‘erase’ instead.

Definition at line 872 of file GenericLoopInfo.h.

Referenced by deleteDeadBlocksFromLoop(), llvm::deleteDeadLoop(), and rebuildLoopAfterUnswitch().

◆ empty()

template<class BlockT, class LoopT>

bool llvm::LoopInfoBase< BlockT, LoopT >::empty ( ) const

inline

Definition at line 603 of file GenericLoopInfo.h.

Referenced by llvm::FunctionToLoopPassAdaptor::run(), llvm::LoopSinkPass::run(), and llvm::LoopUnrollPass::run().

◆ end()

template<class BlockT, class LoopT>

iterator llvm::LoopInfoBase< BlockT, LoopT >::end ( ) const

inline

Definition at line 600 of file GenericLoopInfo.h.

Referenced by llvm::deleteDeadLoop(), llvm::LoopInfoBase< BasicBlock, Loop >::removeLoop(), llvm::LoopFullUnrollPass::run(), and verify().

◆ getExitEdges()

template<class BlockT, class LoopT>

void llvm::LoopInfoBase< BlockT, LoopT >::getExitEdges	(	const LoopT &	L,
		SmallVectorImpl< Edge > &	ExitEdges ) const

Return all pairs of (inside_block,outside_block).

getExitEdges - Return all pairs of (inside_block,outside_block).

Definition at line 176 of file GenericLoopInfoImpl.h.

References llvm::children(), and llvm::SmallVectorImpl< T >::emplace_back().

Referenced by llvm::peelLoop().

◆ getLoopDepth()

template<class BlockT, class LoopT>

unsigned llvm::LoopInfoBase< BlockT, LoopT >::getLoopDepth ( const BlockT * BB ) const

inline

Return the loop nesting level of the specified block.

A depth of 0 means the block is not inside any loop.

Definition at line 700 of file GenericLoopInfo.h.

Referenced by CompareValueComplexity(), and rebuildLoopAfterUnswitch().

◆ getLoopFor()

template<class BlockT, class LoopT>

LoopT * llvm::LoopInfoBase< BlockT, LoopT >::getLoopFor ( const BlockT * BB ) const

inline

Return the inner most loop that BB lives in.

If a basic block is in no loop (for example the entry node), null is returned.

Definition at line 690 of file GenericLoopInfo.h.

Referenced by llvm::addClonedBlockToLoopInfo(), llvm::OpenMPIRBuilder::applySimd(), buildClonedLoops(), canProveExitOnFirstIteration(), llvm::MachineBasicBlock::canSplitCriticalEdge(), checkDependencies(), llvm::cloneLoop(), cloneLoopBlocks(), cloneLoopNest(), llvm::cloneLoopWithPreheader(), collectUnswitchCandidates(), collectUnswitchCandidatesWithInjections(), computeHeuristicUnrollFactor(), ConnectProlog(), llvm::TileInfo::CreateTiledLoops(), llvm::dumpMaxRegPressure(), emitBasicBlockLoopComments(), llvm::expandReductionViaLoop(), llvm::MustBeExecutedContextExplorer::findBackwardJoinPoint(), llvm::MustBeExecutedContextExplorer::findForwardJoinPoint(), foldURemOfLoopIncrement(), formLCSSAForInstructionsImpl(), formLCSSAImpl(), getInnermostLoopFor(), getInsertPointForUses(), getIVIncrement(), llvm::LoopInfoBase< BasicBlock, Loop >::getLoopDepth(), getOutermostLoop(), getReductionInstr(), getSmallestCommonLoop(), getTopMostExitingLoop(), hoistLoopToNewParent(), injectPendingInvariantConditions(), inSubLoop(), IsAcceptableTarget(), llvm::HardwareLoopInfo::isHardwareLoopCandidate(), isIntegerLoopHeaderPHI(), isInteresting(), llvm::LoopInfoBase< BasicBlock, Loop >::isLoopHeader(), llvm::isPotentiallyReachable(), isRemOfLoopIncrementWithLoopInvariant(), isSameUnderlyingObjectInLoop(), mergeBlocksIntoPredecessors(), moveLCSSAPhis(), needToInsertPhisForLCSSA(), llvm::LoopInfoBase< BasicBlock, Loop >::operator[](), rebuildLoopAfterUnswitch(), recomputeLoopBlockSet(), llvm::rewriteLoopExitValues(), llvm::simplifyUsersOfIV(), sinkInstruction(), sinkMinMax(), sortBlocks(), splitBlock(), llvm::SplitBlockAndInsertIfThenElse(), SplitBlockImpl(), SplitBlockPredecessorsImpl(), llvm::UnrollLoop(), llvm::UnrollRuntimeLoopRemainder(), unswitchNontrivialInvariants(), UpdateAnalysisInformation(), and updateLoopInfo().

◆ getLoopsInPreorder()

template<class BlockT, class LoopT>

SmallVector< LoopT *, 4 > llvm::LoopInfoBase< BlockT, LoopT >::getLoopsInPreorder ( ) const

Return all of the loops in the function in preorder across the loop nests, with siblings in forward program order.

Note that because loops form a forest of trees, preorder is equivalent to reverse postorder.

Definition at line 763 of file GenericLoopInfoImpl.h.

References llvm::SmallVectorTemplateBase< T, bool >::push_back(), and llvm::reverse().

Referenced by llvm::LoopSinkPass::run(), runImpl(), llvm::AMDGPUDAGToDAGISelLegacy::runOnMachineFunction(), and warnAboutLeftoverTransformations().

◆ getLoopsInReverseSiblingPreorder()

template<class BlockT, class LoopT>

SmallVector< LoopT *, 4 > llvm::LoopInfoBase< BlockT, LoopT >::getLoopsInReverseSiblingPreorder ( ) const

Return all of the loops in the function in preorder across the loop nests, with siblings in reverse program order.

Note that because loops form a forest of trees, preorder is equivalent to reverse postorder.

Also note that this is not a reverse preorder. Only the siblings are in reverse program order.

Definition at line 780 of file GenericLoopInfoImpl.h.

References llvm::SmallVectorImpl< T >::append(), assert(), llvm::SmallVectorTemplateCommon< T, typename >::empty(), llvm::SmallVectorImpl< T >::pop_back_val(), and llvm::SmallVectorTemplateBase< T, bool >::push_back().

◆ getSmallestCommonLoop() [1/2]

template<class BlockT, class LoopT>

LoopT * llvm::LoopInfoBase< BlockT, LoopT >::getSmallestCommonLoop	(	BlockT *	A,
		BlockT *	B ) const

Find the innermost loop containing both given blocks.

Returns: the innermost loop containing both A and B or nullptr if there is no such loop.

Definition at line 829 of file GenericLoopInfoImpl.h.

References A(), B(), getLoopFor(), and getSmallestCommonLoop().

◆ getSmallestCommonLoop() [2/2]

template<class BlockT, class LoopT>

LoopT * llvm::LoopInfoBase< BlockT, LoopT >::getSmallestCommonLoop	(	LoopT *	A,
		LoopT *	B ) const

Find the innermost loop containing both given loops.

Returns: the innermost loop containing both A and B or nullptr if there is no such loop.

Definition at line 804 of file GenericLoopInfoImpl.h.

References A(), and B().

Referenced by getSmallestCommonLoop().

◆ getTopLevelLoops()

template<class BlockT, class LoopT>

const std::vector< LoopT * > & llvm::LoopInfoBase< BlockT, LoopT >::getTopLevelLoops ( ) const

inline

Return the top-level loops.

Definition at line 774 of file GenericLoopInfo.h.

Referenced by llvm::LoopCachePrinterPass::run().

◆ getUniqueLatchExitBlock()

template<class BlockT, class LoopT>

BlockT * llvm::LoopInfoBase< BlockT, LoopT >::getUniqueLatchExitBlock ( const LoopT & L ) const

Return the unique exit block for the latch of L, or null if there are multiple different exit blocks or the latch is not exiting.

Definition at line 164 of file GenericLoopInfoImpl.h.

References assert(), llvm::children(), and llvm::find_singleton().

Referenced by unswitchTrivialBranch().

◆ hasNoExitBlocks()

template<class BlockT, class LoopT>

bool llvm::LoopInfoBase< BlockT, LoopT >::hasNoExitBlocks ( const LoopT & L ) const

Return true if L does not have any exit blocks.

Definition at line 95 of file GenericLoopInfoImpl.h.

References llvm::getExitBlockHelper().

Referenced by llvm::deleteDeadLoop(), and deleteLoopIfDead().

◆ isLoopHeader()

template<class BlockT, class LoopT>

bool llvm::LoopInfoBase< BlockT, LoopT >::isLoopHeader ( const BlockT * BB ) const

inline

Definition at line 768 of file GenericLoopInfo.h.

Referenced by canProveExitOnFirstIteration(), llvm::getUnderlyingObjects(), and SplitBlockPredecessorsImpl().

◆ isNotAlreadyContainedIn()

template<class BlockT, class LoopT>

bool llvm::LoopInfoBase< BlockT, LoopT >::isNotAlreadyContainedIn	(	const LoopT *	SubLoop,
		const LoopT *	ParentLoop )

inlinestatic

Definition at line 834 of file GenericLoopInfo.h.

Referenced by llvm::LoopInfoBase< BasicBlock, Loop >::isNotAlreadyContainedIn().

◆ operator=()

template<class BlockT, class LoopT>

LoopInfoBase & llvm::LoopInfoBase< BlockT, LoopT >::operator= ( LoopInfoBase< BlockT, LoopT > && RHS )

inline

Definition at line 560 of file GenericLoopInfo.h.

◆ operator[]()

template<class BlockT, class LoopT>

const LoopT * llvm::LoopInfoBase< BlockT, LoopT >::operator[] ( const BlockT * BB ) const

inline

Same as getLoopFor.

Definition at line 696 of file GenericLoopInfo.h.

◆ print()

template<class BlockT, class LoopT>

void llvm::LoopInfoBase< BlockT, LoopT >::print ( raw_ostream & OS ) const

Definition at line 836 of file GenericLoopInfoImpl.h.

References llvm::print().

◆ rbegin()

template<class BlockT, class LoopT>

reverse_iterator llvm::LoopInfoBase< BlockT, LoopT >::rbegin ( ) const

inline

Definition at line 601 of file GenericLoopInfo.h.

◆ releaseMemory()

template<class BlockT, class LoopT>

void llvm::LoopInfoBase< BlockT, LoopT >::releaseMemory ( )

inline

Definition at line 576 of file GenericLoopInfo.h.

Referenced by llvm::LoopInfoBase< BasicBlock, Loop >::~LoopInfoBase().

◆ removeBlock()

template<class BlockT, class LoopT>

void llvm::LoopInfoBase< BlockT, LoopT >::removeBlock ( BlockT * BB )

inline

This method completely removes BB from all data structures, including all of the Loop objects it is nested in and our mapping from BasicBlocks to loops.

Definition at line 821 of file GenericLoopInfo.h.

Referenced by llvm::deleteDeadLoop(), llvm::MergeBlockIntoPredecessor(), and simplifyOneLoop().

◆ removeBlocksFromLoopAndAncestors()

template<class BlockT, class LoopT>

template<typename PredicateT>

void llvm::LoopInfoBase< BlockT, LoopT >::removeBlocksFromLoopAndAncestors	(	LoopT *	Start,
		LoopT *	Stop,
		PredicateT	Pred )

inline

Remove every block satisfying Pred from Start and each of its ancestors up to but not including Stop, which must be null or an ancestor of Start; a null Stop walks to the top level.

Definition at line 733 of file GenericLoopInfo.h.

Referenced by deleteDeadBlocksFromLoop(), and rebuildLoopAfterUnswitch().

◆ removeBlocksIf()

template<class BlockT, class LoopT>

template<typename PredicateT>

void llvm::LoopInfoBase< BlockT, LoopT >::removeBlocksIf	(	LoopT &	L,
		PredicateT	Pred )

inline

Remove every block satisfying Pred from L's block list, preserving the order of the remaining blocks.

Only L itself is updated, not its ancestors or descendants, and not the block-to-loop mapping.

Definition at line 722 of file GenericLoopInfo.h.

Referenced by hoistLoopToNewParent(), rebuildLoopAfterUnswitch(), and llvm::LoopInfoBase< BasicBlock, Loop >::removeBlocksFromLoopAndAncestors().

◆ removeLoop()

template<class BlockT, class LoopT>

LoopT * llvm::LoopInfoBase< BlockT, LoopT >::removeLoop ( iterator I )

inline

This removes the specified top-level loop from this loop info object.

The loop is not deleted, as it will presumably be inserted into another loop.

Definition at line 779 of file GenericLoopInfo.h.

Referenced by llvm::deleteDeadLoop(), and rebuildLoopAfterUnswitch().

◆ rend()

template<class BlockT, class LoopT>

reverse_iterator llvm::LoopInfoBase< BlockT, LoopT >::rend ( ) const

inline

Definition at line 602 of file GenericLoopInfo.h.

◆ takeChildrenIf()

template<class BlockT, class LoopT>

template<typename PredicateT>

SmallVector< LoopT *, 4 > llvm::LoopInfoBase< BlockT, LoopT >::takeChildrenIf	(	LoopT *	Parent,
		PredicateT	Pred )

inline

Detach and return the children of Parent (the top-level loops if Parent is null) that satisfy Pred, clearing their parent pointers.

Both the remaining and the returned children keep their relative order.

Definition at line 743 of file GenericLoopInfo.h.

Referenced by deleteDeadBlocksFromLoop(), and rebuildLoopAfterUnswitch().

◆ verify()

template<class BlockT, class LoopT>

void llvm::LoopInfoBase< BlockT, LoopT >::verify ( ) const

Definition at line 892 of file GenericLoopInfoImpl.h.

References llvm::addInnerLoopsToHeadersMap(), analyze(), llvm::SmallVectorImpl< T >::append(), assert(), begin(), llvm::compareLoops(), llvm::dbgs(), E(), llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT, BucketT >::empty(), llvm::SmallVectorTemplateCommon< T, typename >::empty(), end(), llvm::enumerate(), llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT, BucketT >::erase(), I, llvm_unreachable, llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT, BucketT >::lookup(), Loops, llvm::Number, llvm::SmallVectorImpl< T >::pop_back_val(), and llvm::SmallVectorTemplateCommon< T, typename >::size().

Referenced by FixIrreducibleImpl(), llvm::hoistRegion(), injectPendingInvariantConditions(), llvm::FunctionToLoopPassAdaptor::run(), llvm::LoopBoundSplitPass::run(), llvm::LoopVerifierPass::run(), splitLoopBound(), turnGuardIntoBranch(), unifyLoopExits(), llvm::UnrollAndJamLoop(), llvm::UnrollLoop(), llvm::UnrollRuntimeLoopRemainder(), and unswitchNontrivialInvariants().

◆ LoopBase< BlockT, LoopT >

template<class BlockT, class LoopT>

friend class LoopBase< BlockT, LoopT >

friend

Definition at line 537 of file GenericLoopInfo.h.

◆ LoopInfo

template<class BlockT, class LoopT>

friend class LoopInfo

friend

Definition at line 540 of file GenericLoopInfo.h.

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

include/llvm/Support/GenericDomTree.h
include/llvm/Support/GenericLoopInfo.h
include/llvm/Support/GenericLoopInfoImpl.h

Public Types

Public Member Functions

Static Public Member Functions

Friends

Detailed Description

Member Typedef Documentation

◆ Edge

◆ iterator

◆ reverse_iterator

Constructor & Destructor Documentation

◆ LoopInfoBase() [1/2]

◆ ~LoopInfoBase()

◆ LoopInfoBase() [2/2]

Member Function Documentation

◆ addTopLevelLoop()

◆ AllocateLoop()

◆ analyze() [1/3]

◆ analyze() [2/3]

◆ analyze() [3/3]

◆ begin()

◆ changeLoopFor()

◆ changeTopLevelLoop()

◆ destroy()

◆ empty()

◆ end()

◆ getExitEdges()

◆ getLoopDepth()

◆ getLoopFor()

◆ getLoopsInPreorder()

◆ getLoopsInReverseSiblingPreorder()

◆ getSmallestCommonLoop() [1/2]

◆ getSmallestCommonLoop() [2/2]

◆ getTopLevelLoops()

◆ getUniqueLatchExitBlock()

◆ hasNoExitBlocks()

◆ isLoopHeader()

◆ isNotAlreadyContainedIn()

◆ operator=()

◆ operator[]()

◆ print()

◆ rbegin()

◆ releaseMemory()

◆ removeBlock()

◆ removeBlocksFromLoopAndAncestors()

◆ removeBlocksIf()

◆ removeLoop()

◆ rend()

◆ takeChildrenIf()

◆ verify()

Friends And Related Symbol Documentation

◆ LoopBase< BlockT, LoopT >

◆ LoopInfo