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

#include "llvm/Analysis/LoopInfo.h"

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

[legend]

Public Types
typedef std::vector< LoopT * >::const_iterator	iterator
	iterator/begin/end - The interface to the top-level loops in the current function. More...

typedef std::vector< LoopT * >::const_reverse_iterator	reverse_iterator

Public Member Functions
	LoopInfoBase ()

	~LoopInfoBase ()

	LoopInfoBase (LoopInfoBase &&Arg)

LoopInfoBase &	operator= (LoopInfoBase &&RHS)

void	releaseMemory ()

template<typename... ArgsTy>
LoopT *	AllocateLoop (ArgsTy &&... Args)

iterator	begin () const

iterator	end () const

reverse_iterator	rbegin () const

reverse_iterator	rend () const

bool	empty () const

SmallVector< LoopT *, 4 >	getLoopsInPreorder ()
	Return all of the loops in the function in preorder across the loop nests, with siblings in forward program order. More...

SmallVector< LoopT *, 4 >	getLoopsInReverseSiblingPreorder ()
	Return all of the loops in the function in preorder across the loop nests, with siblings in reverse program order. More...

LoopT *	getLoopFor (const BlockT *BB) const
	Return the inner most loop that BB lives in. More...

const LoopT *	operator[] (const BlockT *BB) const
	Same as getLoopFor. More...

unsigned	getLoopDepth (const BlockT *BB) const
	Return the loop nesting level of the specified block. More...

bool	isLoopHeader (const BlockT *BB) const

LoopT *	removeLoop (iterator I)
	This removes the specified top-level loop from this loop info object. More...

void	changeLoopFor (BlockT BB, LoopT L)
	Change the top-level loop that contains BB to the specified loop. More...

void	changeTopLevelLoop (LoopT OldLoop, LoopT NewLoop)
	Replace the specified loop in the top-level loops list with the indicated loop. More...

void	addTopLevelLoop (LoopT *New)
	This adds the specified loop to the collection of top-level loops. More...

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. More...

void	analyze (const DominatorTreeBase< BlockT, false > &DomTree)
	Create the loop forest using a stable algorithm. More...

void	print (raw_ostream &OS) const

void	verify (const DominatorTreeBase< BlockT, false > &DomTree) const

void	destroy (LoopT *L)
	Destroy a loop that has been removed from the `LoopInfo` nest. More...

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 62 of file LoopInfo.h.

Member Typedef Documentation

◆ iterator

template<class BlockT, class LoopT>

typedef std::vector<LoopT *>::const_iterator llvm::LoopInfoBase< BlockT, LoopT >::iterator

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

Definition at line 662 of file LoopInfo.h.

◆ reverse_iterator

template<class BlockT, class LoopT>

typedef std::vector<LoopT *>::const_reverse_iterator llvm::LoopInfoBase< BlockT, LoopT >::reverse_iterator

Definition at line 664 of file LoopInfo.h.

Constructor & Destructor Documentation

◆ LoopInfoBase() [1/2]

template<class BlockT, class LoopT>

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

inline

Definition at line 623 of file LoopInfo.h.

◆ ~LoopInfoBase()

template<class BlockT, class LoopT>

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

inline

Definition at line 624 of file LoopInfo.h.

◆ LoopInfoBase() [2/2]

template<class BlockT, class LoopT>

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

inline

Definition at line 626 of file LoopInfo.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 741 of file LoopInfo.h.

Referenced by llvm::addClonedBlockToLoopInfo(), llvm::MachineLoopInfo::addTopLevelLoop(), buildClonedLoops(), CloneLoop(), cloneLoopNest(), llvm::cloneLoopWithPreheader(), llvm::InnerLoopVectorizer::createVectorizedLoopSkeleton(), getOnlyLiveSuccessor(), hoistLoopToNewParent(), and rebuildLoopAfterUnswitch().

◆ AllocateLoop()

template<class BlockT, class LoopT>

template<typename... ArgsTy>

LoopT* llvm::LoopInfoBase< BlockT, LoopT >::AllocateLoop ( ArgsTy &&... Args )

inline

Definition at line 654 of file LoopInfo.h.

Referenced by llvm::addClonedBlockToLoopInfo(), buildClonedLoops(), CloneLoop(), cloneLoopNest(), llvm::cloneLoopWithPreheader(), llvm::InnerLoopVectorizer::createVectorizedLoopSkeleton(), and separateNestedLoop().

◆ analyze()

template<class BlockT, class LoopT>

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

Create the loop forest using a stable algorithm.

Analyze LoopInfo discovers loops during a postorder DominatorTree traversal interleaved with backward CFG traversals within each subloop (discoverAndMapSubloop).

The backward traversal skips inner subloops, so this part of the algorithm is linear in the number of CFG edges. Subloop and Block vectors are then populated during a single forward CFG traversal (PopulateLoopDFS).

During the two CFG traversals each block is seen three times: 1) Discovered and mapped by a reverse CFG traversal. 2) Visited during a forward DFS CFG traversal. 3) Reverse-inserted in the loop in postorder following forward DFS.

The Block vectors are inclusive, so step 3 requires loop-depth number of insertions per block.

Definition at line 554 of file LoopInfoImpl.h.

Referenced by llvm::VPlanHCFGBuilder::buildHierarchicalCFG(), llvm::OptimizationRemarkEmitter::OptimizationRemarkEmitter(), llvm::LoopAnalysis::run(), and llvm::LoopInfoBase< BasicBlock, Loop >::verify().

◆ begin()

template<class BlockT, class LoopT>

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

inline

Definition at line 665 of file LoopInfo.h.

Referenced by llvm::MachineLoopInfo::begin(), calculateUnswitchCostMultiplier(), llvm::createLoopSimplifyPass(), llvm::LoopFullUnrollPass::run(), and llvm::LoopSimplifyPass::run().

◆ changeLoopFor()

template<class BlockT, class LoopT>

void llvm::LoopInfoBase< BlockT, LoopT >::changeLoopFor	(	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 722 of file LoopInfo.h.

Referenced by llvm::MachineLoopInfo::changeLoopFor(), cloneLoopNest(), deleteDeadBlocksFromLoop(), llvm::discoverAndMapSubloop(), getOnlyLiveSuccessor(), hoistLoopToNewParent(), rebuildLoopAfterUnswitch(), and separateNestedLoop().

◆ 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 732 of file LoopInfo.h.

Referenced by llvm::MachineLoopInfo::changeTopLevelLoop(), and 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 788 of file LoopInfo.h.

Referenced by deleteDeadBlocksFromLoop(), and rebuildLoopAfterUnswitch().

◆ empty()

template<class BlockT, class LoopT>

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

inline

Definition at line 669 of file LoopInfo.h.

Referenced by llvm::MachineLoopInfo::empty(), and llvm::LoopSinkPass::run().

◆ end()

template<class BlockT, class LoopT>

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

inline

Definition at line 666 of file LoopInfo.h.

Referenced by calculateUnswitchCostMultiplier(), llvm::createLoopSimplifyPass(), llvm::MachineLoopInfo::end(), llvm::LoopFullUnrollPass::run(), and llvm::LoopSimplifyPass::run().

◆ 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 697 of file LoopInfo.h.

Referenced by CompareValueComplexity(), llvm::MachineLoopInfo::getLoopDepth(), 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 LoopInfo.h.

Referenced by llvm::addClonedBlockToLoopInfo(), llvm::DivergenceAnalysis::addUniformOverride(), buildClonedLoops(), castToIncrementInst(), CloneInstructionInExitBlock(), CloneLoop(), CloneLoopBlocks(), cloneLoopNest(), llvm::DivergencePropagator::computeJoinPoints(), computeUnlikelySuccessors(), ConnectProlog(), llvm::createSIFixWWMLivenessPass(), deleteDeadInstruction(), llvm::discoverAndMapSubloop(), llvm::VPBasicBlock::execute(), llvm::VPlan::execute(), llvm::InnerLoopVectorizer::fixFirstOrderRecurrence(), llvm::InnerLoopVectorizer::fixReduction(), llvm::InnerLoopVectorizer::fixVectorizedLoop(), llvm::formLCSSAForInstructions(), getInsertPointForUses(), llvm::MachineLoopInfo::getLoopFor(), getOnlyLiveSuccessor(), getOutermostLoop(), getReductionValue(), hoistLoopToNewParent(), llvm::DivergenceAnalysis::inRegion(), inSubLoop(), IsAcceptableTarget(), isIntegerLoopHeaderPHI(), isInteresting(), isMustExecuteIn(), llvm::isPotentiallyReachable(), llvm::Loop::isRecursivelyLCSSAForm(), isSafeToExecuteUnconditionally(), isSameUnderlyingObjectInLoop(), isSimplifiedLoopNest(), mayUsePostIncMode(), mergeBlocksIntoPredecessors(), needToInsertPhisForLCSSA(), llvm::MachineLoopInfo::operator[](), llvm::promoteLoopAccessesToScalars(), rebuildLoopAfterUnswitch(), recomputeLoopBlockSet(), llvm::simplifyUsersOfIV(), sinkInstruction(), llvm::InnerLoopVectorizer::sinkScalarOperands(), llvm::SplitBlock(), llvm::SplitBlockAndInsertIfThen(), llvm::UnrollLoop(), llvm::UnrollRuntimeLoopRemainder(), unswitchBestCondition(), unswitchNontrivialInvariants(), unswitchTrivialBranch(), unswitchTrivialSwitch(), llvm::InnerLoopVectorizer::updateAnalysis(), UpdateAnalysisInformation(), visitIVCast(), and llvm::LoopBlocksTraversal::visitPreorder().

◆ getLoopsInPreorder()

template<class BlockT , class LoopT >

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

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 583 of file LoopInfoImpl.h.

Referenced by castToIncrementInst(), llvm::LoopSinkPass::run(), and warnAboutLeftoverTransformations().

◆ getLoopsInReverseSiblingPreorder()

template<class BlockT , class LoopT >

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

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 608 of file LoopInfoImpl.h.

◆ isLoopHeader()

template<class BlockT, class LoopT>

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

inline

Definition at line 703 of file LoopInfo.h.

Referenced by getOnlyLiveSuccessor(), llvm::GetUnderlyingObjects(), and llvm::MachineLoopInfo::isLoopHeader().

◆ isNotAlreadyContainedIn()

template<class BlockT, class LoopT>

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

inlinestatic

Definition at line 761 of file LoopInfo.h.

◆ operator=()

template<class BlockT, class LoopT>

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

inline

Definition at line 633 of file LoopInfo.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 693 of file LoopInfo.h.

◆ print()

template<class BlockT , class LoopT >

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

Definition at line 633 of file LoopInfoImpl.h.

◆ rbegin()

template<class BlockT, class LoopT>

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

inline

Definition at line 667 of file LoopInfo.h.

◆ releaseMemory()

template<class BlockT, class LoopT>

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

inline

Definition at line 645 of file LoopInfo.h.

Referenced by llvm::MachineLoopInfo::releaseMemory(), and llvm::LoopInfoWrapperPass::releaseMemory().

◆ 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 749 of file LoopInfo.h.

Referenced by llvm::foldBlockIntoPredecessor(), getOnlyLiveSuccessor(), llvm::MergeBlockIntoPredecessor(), llvm::MachineLoopInfo::removeBlock(), ReplaceUsesOfWith(), and simplifyOneLoop().

◆ 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 711 of file LoopInfo.h.

Referenced by rebuildLoopAfterUnswitch(), and llvm::MachineLoopInfo::removeLoop().

◆ rend()

template<class BlockT, class LoopT>

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

inline

Definition at line 668 of file LoopInfo.h.

◆ verify()

template<class BlockT, class LoopT>

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

Definition at line 704 of file LoopInfoImpl.h.

Referenced by getOnlyLiveSuccessor(), llvm::hoistRegion(), and llvm::LoopVerifierPass::run().

Friends And Related Function Documentation

◆ LoopBase< BlockT, LoopT >

template<class BlockT, class LoopT>

friend class LoopBase< BlockT, LoopT >

friend

Definition at line 616 of file LoopInfo.h.

◆ LoopInfo

template<class BlockT, class LoopT>

friend class LoopInfo

friend

Definition at line 617 of file LoopInfo.h.

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

include/llvm/Analysis/LoopInfo.h
include/llvm/Analysis/LoopInfoImpl.h

Public Types

Public Member Functions

Static Public Member Functions

Friends

Detailed Description

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

Member Typedef Documentation

◆ iterator

◆ reverse_iterator

Constructor & Destructor Documentation

◆ LoopInfoBase() [1/2]

◆ ~LoopInfoBase()

◆ LoopInfoBase() [2/2]

Member Function Documentation

◆ addTopLevelLoop()

◆ AllocateLoop()

◆ analyze()

◆ begin()

◆ changeLoopFor()

◆ changeTopLevelLoop()

◆ destroy()

◆ empty()

◆ end()

◆ getLoopDepth()

◆ getLoopFor()

◆ getLoopsInPreorder()

◆ getLoopsInReverseSiblingPreorder()

◆ isLoopHeader()

◆ isNotAlreadyContainedIn()

◆ operator=()

◆ operator[]()

◆ print()

◆ rbegin()

◆ releaseMemory()

◆ removeBlock()

◆ removeLoop()

◆ rend()

◆ verify()

Friends And Related Function Documentation

◆ LoopBase< BlockT, LoopT >

◆ LoopInfo

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