#include "llvm/Transforms/Scalar/IndVarSimplify.h"
#include "llvm/ADT/APFloat.h"
#include "llvm/ADT/APInt.h"
#include "llvm/ADT/ArrayRef.h"
#include "llvm/ADT/DenseMap.h"
#include "llvm/ADT/None.h"
#include "llvm/ADT/Optional.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/ADT/SmallPtrSet.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/ADT/Statistic.h"
#include "llvm/ADT/iterator_range.h"
#include "llvm/Analysis/LoopInfo.h"
#include "llvm/Analysis/LoopPass.h"
#include "llvm/Analysis/ScalarEvolution.h"
#include "llvm/Analysis/ScalarEvolutionExpander.h"
#include "llvm/Analysis/ScalarEvolutionExpressions.h"
#include "llvm/Analysis/TargetLibraryInfo.h"
#include "llvm/Analysis/TargetTransformInfo.h"
#include "llvm/Transforms/Utils/Local.h"
#include "llvm/IR/BasicBlock.h"
#include "llvm/IR/Constant.h"
#include "llvm/IR/ConstantRange.h"
#include "llvm/IR/Constants.h"
#include "llvm/IR/DataLayout.h"
#include "llvm/IR/DerivedTypes.h"
#include "llvm/IR/Dominators.h"
#include "llvm/IR/Function.h"
#include "llvm/IR/IRBuilder.h"
#include "llvm/IR/InstrTypes.h"
#include "llvm/IR/Instruction.h"
#include "llvm/IR/Instructions.h"
#include "llvm/IR/IntrinsicInst.h"
#include "llvm/IR/Intrinsics.h"
#include "llvm/IR/Module.h"
#include "llvm/IR/Operator.h"
#include "llvm/IR/PassManager.h"
#include "llvm/IR/PatternMatch.h"
#include "llvm/IR/Type.h"
#include "llvm/IR/Use.h"
#include "llvm/IR/User.h"
#include "llvm/IR/Value.h"
#include "llvm/IR/ValueHandle.h"
#include "llvm/Pass.h"
#include "llvm/Support/Casting.h"
#include "llvm/Support/CommandLine.h"
#include "llvm/Support/Compiler.h"
#include "llvm/Support/Debug.h"
#include "llvm/Support/ErrorHandling.h"
#include "llvm/Support/MathExtras.h"
#include "llvm/Support/raw_ostream.h"
#include "llvm/Transforms/Scalar.h"
#include "llvm/Transforms/Scalar/LoopPassManager.h"
#include "llvm/Transforms/Utils/BasicBlockUtils.h"
#include "llvm/Transforms/Utils/LoopUtils.h"
#include "llvm/Transforms/Utils/SimplifyIndVar.h"
#include <cassert>
#include <cstdint>
#include <utility>

Macros
#define	DEBUG_TYPE "indvars"

Enumerations
enum	ReplaceExitVal { NeverRepl, OnlyCheapRepl, AlwaysRepl }

Functions
	STATISTIC (NumWidened, "Number of indvars widened")

	STATISTIC (NumReplaced, "Number of exit values replaced")

	STATISTIC (NumLFTR, "Number of loop exit tests replaced")

	STATISTIC (NumElimExt, "Number of IV sign/zero extends eliminated")

	STATISTIC (NumElimIV, "Number of congruent IVs eliminated")

static Instruction *	getInsertPointForUses (Instruction User, Value Def, DominatorTree DT, LoopInfo LI)
	Determine the insertion point for this user. More...

static bool	ConvertToSInt (const APFloat &APF, int64_t &IntVal)
	Convert APF to an integer, if possible. More...

static void	visitIVCast (CastInst Cast, WideIVInfo &WI, ScalarEvolution SE, const TargetTransformInfo *TTI)
	Update information about the induction variable that is extended by this sign or zero extend operation. More...

static bool	isLoopInvariant (Value V, const Loop L, const DominatorTree *DT)
	Perform a quick domtree based check for loop invariance assuming that V is used within the loop. More...

static void	truncateIVUse (NarrowIVDefUse DU, DominatorTree DT, LoopInfo LI)
	This IV user cannot be widen. More...

static bool	canExpandBackedgeTakenCount (Loop L, ScalarEvolution SE, SCEVExpander &Rewriter)
	Return true if this loop's backedge taken count expression can be safely and cheaply expanded into an instruction sequence that can be used by linearFunctionTestReplace. More...

static PHINode *	getLoopPhiForCounter (Value IncV, Loop L, DominatorTree *DT)
	Return the loop header phi IFF IncV adds a loop invariant value to the phi. More...

static ICmpInst *	getLoopTest (Loop *L)
	Return the compare guarding the loop latch, or NULL for unrecognized tests. More...

static bool	needsLFTR (Loop L, DominatorTree DT)
	linearFunctionTestReplace policy. More...

static bool	hasConcreteDefImpl (Value V, SmallPtrSetImpl< Value > &Visited, unsigned Depth)
	Recursive helper for hasConcreteDef(). More...

static bool	hasConcreteDef (Value *V)
	Return true if the given value is concrete. More...

static bool	AlmostDeadIV (PHINode Phi, BasicBlock LatchBlock, Value *Cond)
	Return true if this IV has any uses other than the (soon to be rewritten) loop exit test. More...

static PHINode *	FindLoopCounter (Loop L, const SCEV BECount, ScalarEvolution SE, DominatorTree DT)
	Find an affine IV in canonical form. More...

static Value *	genLoopLimit (PHINode IndVar, const SCEV IVCount, Loop L, SCEVExpander &Rewriter, ScalarEvolution SE)
	Help linearFunctionTestReplace by generating a value that holds the RHS of the new loop test. More...

	INITIALIZE_PASS_BEGIN (IndVarSimplifyLegacyPass, "indvars", "Induction Variable Simplification", false, false) INITIALIZE_PASS_END(IndVarSimplifyLegacyPass

Variables
static cl::opt< bool >	VerifyIndvars ("verify-indvars", cl::Hidden, cl::desc("Verify the ScalarEvolution result after running indvars"))

static cl::opt< ReplaceExitVal >	ReplaceExitValue ("replexitval", cl::Hidden, cl::init(OnlyCheapRepl), cl::desc("Choose the strategy to replace exit value in IndVarSimplify"), cl::values(clEnumValN(NeverRepl, "never", "never replace exit value"), clEnumValN(OnlyCheapRepl, "cheap", "only replace exit value when the cost is cheap"), clEnumValN(AlwaysRepl, "always", "always replace exit value whenever possible")))

static cl::opt< bool >	UsePostIncrementRanges ("indvars-post-increment-ranges", cl::Hidden, cl::desc("Use post increment control-dependent ranges in IndVarSimplify"), cl::init(true))

static cl::opt< bool >	DisableLFTR ("disable-lftr", cl::Hidden, cl::init(false), cl::desc("Disable Linear Function Test Replace optimization"))

	indvars

Induction Variable	Simplification

Induction Variable	false

Macro Definition Documentation

◆ DEBUG_TYPE

#define DEBUG_TYPE "indvars"

Definition at line 89 of file IndVarSimplify.cpp.

Enumeration Type Documentation

◆ ReplaceExitVal

enum ReplaceExitVal

Enumerator
NeverRepl
OnlyCheapRepl
AlwaysRepl

Definition at line 104 of file IndVarSimplify.cpp.

Function Documentation

◆ AlmostDeadIV()

static bool AlmostDeadIV	(	PHINode *	Phi,
		BasicBlock *	LatchBlock,
		Value *	Cond
	)

static

Return true if this IV has any uses other than the (soon to be rewritten) loop exit test.

Definition at line 2148 of file IndVarSimplify.cpp.

References llvm::PHINode::getBasicBlockIndex(), llvm::PHINode::getIncomingValue(), and llvm::Value::users().

Referenced by FindLoopCounter().

◆ canExpandBackedgeTakenCount()

static bool canExpandBackedgeTakenCount	(	Loop *	L,
		ScalarEvolution *	SE,
		SCEVExpander &	Rewriter
	)

static

Return true if this loop's backedge taken count expression can be safely and cheaply expanded into an instruction sequence that can be used by linearFunctionTestReplace.

TODO: This fails for pointer-type loop counters with greater than one byte strides, consequently preventing LFTR from running. For the purpose of LFTR we could skip this check in the case that the LFTR loop counter (chosen by FindLoopCounter) is also pointer type. Instead, we could directly convert the loop test to an inequality test by checking the target data's alignment of element types (given that the initial pointer value originates from or is used by ABI constrained operation, as opposed to inttoptr/ptrtoint). However, we don't yet have a strong motivation for converting loop tests into inequality tests.

Definition at line 1993 of file IndVarSimplify.cpp.

References llvm::ScalarEvolution::getBackedgeTakenCount(), llvm::LoopBase< BlockT, LoopT >::getExitingBlock(), llvm::BasicBlock::getTerminator(), llvm::SCEVExpander::isHighCostExpansion(), and llvm::SCEV::isZero().

Referenced by genLoopLimit().

◆ ConvertToSInt()

static bool ConvertToSInt	(	const APFloat &	APF,
		int64_t &	IntVal
	)

static

Convert APF to an integer, if possible.

Definition at line 264 of file IndVarSimplify.cpp.

◆ FindLoopCounter()

static PHINode* FindLoopCounter	(	Loop *	L,
		const SCEV *	BECount,
		ScalarEvolution *	SE,
		DominatorTree *	DT
	)

static

Find an affine IV in canonical form.

BECount may be an i8* pointer type. The pointer difference is already valid count without scaling the address stride, so it remains a pointer expression as far as SCEV is concerned.

Currently only valid for LFTR. See the comments on hasConcreteDef below.

FIXME: Accept -1 stride and set IVLimit = IVInit - BECount

FIXME: Accept non-unit stride as long as SCEV can reduce BECount * Stride. This is difficult in general for SCEV because of potential overflow. But we could at least handle constant BECounts.

Definition at line 2173 of file IndVarSimplify.cpp.

References AlmostDeadIV(), assert(), llvm::BasicBlock::begin(), llvm::dyn_cast(), llvm::PHINode::getBasicBlockIndex(), llvm::Module::getDataLayout(), llvm::LoopBase< BlockT, LoopT >::getExitingBlock(), llvm::LoopBase< BlockT, LoopT >::getHeader(), llvm::PHINode::getIncomingValue(), llvm::SCEVAddRecExpr::getLoop(), llvm::LoopBase< BlockT, LoopT >::getLoopLatch(), getLoopPhiForCounter(), getLoopTest(), llvm::BasicBlock::getModule(), llvm::ScalarEvolution::getSCEV(), llvm::SCEVAddRecExpr::getStart(), llvm::SCEVAddRecExpr::getStepRecurrence(), llvm::BasicBlock::getTerminator(), llvm::SCEV::getType(), llvm::SCEVNAryExpr::getType(), llvm::Value::getType(), llvm::ScalarEvolution::getTypeSizeInBits(), hasConcreteDef(), I, llvm::SCEVAddRecExpr::isAffine(), llvm::DataLayout::isLegalInteger(), llvm::SCEV::isOne(), llvm::Type::isPointerTy(), llvm::ScalarEvolution::isSCEVable(), and llvm::SCEV::isZero().

◆ genLoopLimit()

static Value* genLoopLimit	(	PHINode *	IndVar,
		const SCEV *	IVCount,
		Loop *	L,
		SCEVExpander &	Rewriter,
		ScalarEvolution *	SE
	)

static

Help linearFunctionTestReplace by generating a value that holds the RHS of the new loop test.

Definition at line 2256 of file IndVarSimplify.cpp.

◆ getInsertPointForUses()

static Instruction* getInsertPointForUses	(	Instruction *	User,
		Value *	Def,
		DominatorTree *	DT,
		LoopInfo *	LI
	)

static

Determine the insertion point for this user.

By default, insert immediately before the user. SCEVExpander or LICM will hoist loop invariants out of the loop. For PHI nodes, there may be multiple uses, so compute the nearest common dominator for the incoming blocks.

Definition at line 222 of file IndVarSimplify.cpp.

References assert(), llvm::tgtok::Def, llvm::DominatorTree::dominates(), llvm::dyn_cast(), llvm::DominatorTreeBase< NodeT, IsPostDom >::findNearestCommonDominator(), llvm::PHINode::getIncomingBlock(), llvm::PHINode::getIncomingValue(), llvm::LoopInfoBase< BlockT, LoopT >::getLoopFor(), llvm::PHINode::getNumIncomingValues(), llvm::Instruction::getParent(), llvm::BasicBlock::getTerminator(), and llvm_unreachable.

Referenced by truncateIVUse().

◆ getLoopPhiForCounter()

static PHINode* getLoopPhiForCounter	(	Value *	IncV,
		Loop *	L,
		DominatorTree *	DT
	)

static

Return the loop header phi IFF IncV adds a loop invariant value to the phi.

Definition at line 2014 of file IndVarSimplify.cpp.

References llvm::MCID::Add, llvm::dyn_cast(), llvm::LoopBase< BlockT, LoopT >::getHeader(), llvm::User::getNumOperands(), llvm::Instruction::getOpcode(), llvm::User::getOperand(), llvm::Instruction::getParent(), isLoopInvariant(), and LLVM_FALLTHROUGH.

Referenced by FindLoopCounter(), and needsLFTR().

◆ getLoopTest()

static ICmpInst* getLoopTest ( Loop * L )

static

Return the compare guarding the loop latch, or NULL for unrecognized tests.

Definition at line 2051 of file IndVarSimplify.cpp.

References assert(), llvm::dyn_cast(), llvm::BranchInst::getCondition(), llvm::LoopBase< BlockT, LoopT >::getExitingBlock(), llvm::LoopBase< BlockT, LoopT >::getLoopLatch(), and llvm::BasicBlock::getTerminator().

Referenced by FindLoopCounter(), and needsLFTR().

◆ hasConcreteDef()

static bool hasConcreteDef ( Value * V )

static

Return true if the given value is concrete.

We must prove that undef can never reach it.

TODO: If we decide that this is a good approach to checking for undef, we may factor it into a common location.

Definition at line 2140 of file IndVarSimplify.cpp.

References hasConcreteDefImpl(), and llvm::SmallPtrSetImpl< PtrType >::insert().

Referenced by FindLoopCounter().

◆ hasConcreteDefImpl()

static bool hasConcreteDefImpl	(	Value *	V,
		SmallPtrSetImpl< Value *> &	Visited,
		unsigned	Depth
	)

static

Recursive helper for hasConcreteDef().

Unfortunately, this currently boils down to checking that all operands are constant and listing instructions that may hide undef.

Definition at line 2107 of file IndVarSimplify.cpp.

References llvm::dyn_cast(), I, llvm::SmallPtrSetImpl< PtrType >::insert(), llvm::Instruction::mayReadFromMemory(), and llvm::User::operands().

Referenced by hasConcreteDef().

◆ INITIALIZE_PASS_BEGIN()

INITIALIZE_PASS_BEGIN	(	IndVarSimplifyLegacyPass	,
		"indvars"	,
		"Induction Variable Simplification"	,
		false	,
		false
	)

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

◆ isLoopInvariant()

static bool isLoopInvariant	(	Value *	V,
		const Loop *	L,
		const DominatorTree *	DT
	)

static

Perform a quick domtree based check for loop invariance assuming that V is used within the loop.

LoopInfo::isLoopInvariant() seems gratuitous for this purpose.

Definition at line 1028 of file IndVarSimplify.cpp.

References llvm::MCID::Add, assert(), llvm::BinaryOperator::Create(), llvm::IRBuilder< T, Inserter >::CreateSExt(), llvm::IRBuilder< T, Inserter >::CreateZExt(), llvm::dbgs(), llvm::dyn_cast(), llvm::LoopBase< BlockT, LoopT >::getHeader(), llvm::SCEVAddRecExpr::getLoop(), llvm::LoopBase< BlockT, LoopT >::getLoopPreheader(), llvm::Value::getName(), llvm::Instruction::getOpcode(), llvm::User::getOperand(), llvm::Instruction::getParent(), llvm::LoopBase< BlockT, LoopT >::getParentLoop(), llvm::BasicBlock::getTerminator(), llvm::SCEV::getType(), llvm::OverflowingBinaryOperator::hasNoSignedWrap(), llvm::OverflowingBinaryOperator::hasNoUnsignedWrap(), LLVM_DEBUG, llvm_unreachable, llvm::DominatorTreeBase< NodeT, IsPostDom >::properlyDominates(), llvm::IRBuilderBase::SetInsertPoint(), std::swap(), and llvm::Unknown.

Referenced by llvm::PredicatedScalarEvolution::areAddRecsEqualWithPreds(), EvaluateConstantChrecAtConstant(), llvm::ScalarEvolution::forgetValue(), llvm::ScalarEvolution::getAddRecExpr(), llvm::DependenceInfo::getFunction(), getLoopPhiForCounter(), getRangeForAffineARHelper(), llvm::ScalarEvolution::getSignedRangeMax(), llvm::ScalarEvolution::isAvailableAtLoopEntry(), isIntegerLoopHeaderPHI(), isLoadOrStore(), llvm::ScalarEvolution::isLoopInvariantPredicate(), needsLFTR(), PushLoopPHIs(), and llvm::ScalarEvolution::SimplifyICmpOperands().

◆ needsLFTR()

static bool needsLFTR	(	Loop *	L,
		DominatorTree *	DT
	)

static

linearFunctionTestReplace policy.

Return true unless we can show that the current exit test is already sufficiently canonical.

Definition at line 2067 of file IndVarSimplify.cpp.

References llvm::dyn_cast(), llvm::PHINode::getBasicBlockIndex(), llvm::PHINode::getIncomingValue(), llvm::LoopBase< BlockT, LoopT >::getLoopLatch(), getLoopPhiForCounter(), getLoopTest(), llvm::User::getOperand(), llvm::CmpInst::getPredicate(), llvm::CmpInst::ICMP_EQ, llvm::CmpInst::ICMP_NE, isLoopInvariant(), and std::swap().

◆ STATISTIC() [1/5]

STATISTIC	(	NumWidened	,
		"Number of indvars widened"
	)

◆ STATISTIC() [2/5]

STATISTIC	(	NumReplaced	,
		"Number of exit values replaced"
	)

◆ STATISTIC() [3/5]

STATISTIC	(	NumLFTR	,
		"Number of loop exit tests replaced"
	)

◆ STATISTIC() [4/5]

STATISTIC	(	NumElimExt	,
		"Number of IV sign/	zero
	)

◆ STATISTIC() [5/5]

STATISTIC	(	NumElimIV	,
		"Number of congruent IVs eliminated"
	)

◆ truncateIVUse()

static void truncateIVUse	(	NarrowIVDefUse	DU,
		DominatorTree *	DT,
		LoopInfo *	LI
	)

static

This IV user cannot be widen.

Replace this use of the original narrow IV with a truncation of the new wide IV to isolate and eliminate the narrow IV.

Definition at line 1310 of file IndVarSimplify.cpp.

References llvm::MCID::Add, llvm::PHINode::addIncoming(), assert(), llvm::SmallVectorTemplateCommon< T >::back(), llvm::BasicBlock::begin(), C, llvm::LoopBase< BlockT, LoopT >::contains(), llvm::BinaryOperator::Create(), llvm::PHINode::Create(), llvm::IRBuilder< T, Inserter >::CreateTrunc(), llvm::dbgs(), llvm::dyn_cast(), llvm::SmallVectorBase::empty(), llvm::SCEVExpander::expandCodeFor(), llvm::Intrinsic::experimental_guard, llvm::findDbgValues(), llvm::BasicBlock::front(), llvm::MetadataAsValue::get(), llvm::ValueAsMetadata::get(), llvm::LoopBase< BlockT, LoopT >::getBlocks(), llvm::BasicBlock::getFirstInsertionPt(), llvm::LoopBase< BlockT, LoopT >::getHeader(), getInsertPointForUses(), llvm::CmpInst::getInversePredicate(), llvm::SCEVAddRecExpr::getLoop(), llvm::LoopBase< BlockT, LoopT >::getLoopLatch(), llvm::Intrinsic::getName(), llvm::Value::getName(), llvm::Instruction::getOpcode(), llvm::User::getOperand(), llvm::Instruction::getParent(), llvm::SCEVAddRecExpr::getStart(), llvm::SCEVAddRecExpr::getStepRecurrence(), llvm::BranchInst::getSuccessor(), llvm::BasicBlock::getTerminator(), llvm::SCEV::getType(), llvm::Value::getType(), llvm::OverflowingBinaryOperator::hasNoSignedWrap(), llvm::OverflowingBinaryOperator::hasNoUnsignedWrap(), llvm::SCEVExpander::hoistIVInc(), I, llvm::CmpInst::ICMP_SGE, llvm::SmallPtrSetImpl< PtrType >::insert(), llvm::APInt::isNonNegative(), llvm::CmpInst::isSigned(), LLVM_DEBUG, llvm::SPII::Load, llvm::PatternMatch::m_APInt(), llvm::PatternMatch::m_ICmp(), llvm::PatternMatch::m_NSWAdd(), llvm::PatternMatch::m_Specific(), llvm::PatternMatch::m_Value(), llvm::make_range(), llvm::ConstantRange::makeAllowedICmpRegion(), llvm::PatternMatch::match(), P, llvm::SmallVectorTemplateBase< T >::pop_back(), llvm::SmallVectorImpl< T >::pop_back_val(), llvm::SmallVectorTemplateBase< T >::push_back(), llvm::Value::replaceAllUsesWith(), llvm::Instruction::setDebugLoc(), llvm::simplifyUsersOfIV(), llvm::Unknown, llvm::Value::users(), llvm::Value::uses(), and visitIVCast().

◆ visitIVCast()

static void visitIVCast	(	CastInst *	Cast,
		WideIVInfo &	WI,
		ScalarEvolution *	SE,
		const TargetTransformInfo *	TTI
	)

static

Update information about the induction variable that is extended by this sign or zero extend operation.

This is used to determine the final width of the IV before actually widening it.

Definition at line 849 of file IndVarSimplify.cpp.

References llvm::MCID::Add, assert(), llvm::tgtok::Def, llvm::DenseMapBase< DenseMap< KeyT, ValueT, KeyInfoT, BucketT >, KeyT, ValueT, KeyInfoT, BucketT >::end(), llvm::DenseMapBase< DenseMap< KeyT, ValueT, KeyInfoT, BucketT >, KeyT, ValueT, KeyInfoT, BucketT >::find(), llvm::TargetTransformInfo::getArithmeticInstrCost(), llvm::Module::getDataLayout(), llvm::ScalarEvolution::getEffectiveSCEVType(), llvm::LoopBase< BlockT, LoopT >::getHeader(), llvm::LoopInfoBase< BlockT, LoopT >::getLoopFor(), llvm::Instruction::getModule(), llvm::CastInst::getOpcode(), llvm::User::getOperand(), llvm::Instruction::getParent(), llvm::Value::getType(), llvm::ScalarEvolution::getTypeSizeInBits(), llvm::DenseMapBase< DenseMap< KeyT, ValueT, KeyInfoT, BucketT >, KeyT, ValueT, KeyInfoT, BucketT >::insert(), llvm::ConstantRange::intersectWith(), llvm::DataLayout::isLegalInteger(), llvm::None, and llvm::Unknown.

Referenced by truncateIVUse().

Variable Documentation

◆ DisableLFTR

cl::opt<bool> DisableLFTR("disable-lftr", cl::Hidden, cl::init(false), cl::desc("Disable Linear Function Test Replace optimization"))

static

◆ false

Induction Variable false

Definition at line 2741 of file IndVarSimplify.cpp.

◆ indvars

indvars

Definition at line 2741 of file IndVarSimplify.cpp.

◆ ReplaceExitValue

cl::opt<ReplaceExitVal> ReplaceExitValue("replexitval", cl::Hidden, cl::init(OnlyCheapRepl), cl::desc("Choose the strategy to replace exit value in IndVarSimplify"), cl::values(clEnumValN(NeverRepl, "never", "never replace exit value"), clEnumValN(OnlyCheapRepl, "cheap", "only replace exit value when the cost is cheap"), clEnumValN(AlwaysRepl, "always", "always replace exit value whenever possible")))

static

◆ Simplification

Induction Variable Simplification

Definition at line 2741 of file IndVarSimplify.cpp.

◆ UsePostIncrementRanges

cl::opt<bool> UsePostIncrementRanges("indvars-post-increment-ranges", cl::Hidden, cl::desc("Use post increment control-dependent ranges in IndVarSimplify"), cl::init(true))

static

◆ VerifyIndvars

cl::opt<bool> VerifyIndvars("verify-indvars", cl::Hidden, cl::desc("Verify the ScalarEvolution result after running indvars"))

static

Macros

Enumerations

Functions

Variables

Macro Definition Documentation

◆ DEBUG_TYPE

Enumeration Type Documentation

◆ ReplaceExitVal

Function Documentation

◆ AlmostDeadIV()

◆ canExpandBackedgeTakenCount()

◆ ConvertToSInt()

◆ FindLoopCounter()

◆ genLoopLimit()

◆ getInsertPointForUses()

◆ getLoopPhiForCounter()

◆ getLoopTest()

◆ hasConcreteDef()

◆ hasConcreteDefImpl()

◆ INITIALIZE_PASS_BEGIN()

◆ isLoopInvariant()

◆ needsLFTR()

◆ STATISTIC() [1/5]

◆ STATISTIC() [2/5]

◆ STATISTIC() [3/5]

◆ STATISTIC() [4/5]

◆ STATISTIC() [5/5]

◆ truncateIVUse()

◆ visitIVCast()

Variable Documentation

◆ DisableLFTR

◆ false

◆ indvars

◆ ReplaceExitValue

◆ Simplification

◆ UsePostIncrementRanges

◆ VerifyIndvars