LLVM 19.0.0git
Classes | Macros | Functions | Variables
AggressiveInstCombine.cpp File Reference
#include "llvm/Transforms/AggressiveInstCombine/AggressiveInstCombine.h"
#include "AggressiveInstCombineInternal.h"
#include "llvm/ADT/Statistic.h"
#include "llvm/Analysis/AliasAnalysis.h"
#include "llvm/Analysis/AssumptionCache.h"
#include "llvm/Analysis/BasicAliasAnalysis.h"
#include "llvm/Analysis/ConstantFolding.h"
#include "llvm/Analysis/GlobalsModRef.h"
#include "llvm/Analysis/TargetLibraryInfo.h"
#include "llvm/Analysis/TargetTransformInfo.h"
#include "llvm/Analysis/ValueTracking.h"
#include "llvm/IR/DataLayout.h"
#include "llvm/IR/Dominators.h"
#include "llvm/IR/Function.h"
#include "llvm/IR/IRBuilder.h"
#include "llvm/IR/PatternMatch.h"
#include "llvm/Transforms/Utils/BuildLibCalls.h"
#include "llvm/Transforms/Utils/Local.h"

Go to the source code of this file.

Classes

struct  MaskOps
 This is used by foldAnyOrAllBitsSet() to capture a source value (Root) and the bit indexes (Mask) needed by a masked compare. More...
 
struct  LoadOps
 This is used by foldLoadsRecursive() to capture a Root Load node which is of type or(load, load) and recursively build the wide load. More...
 

Macros

#define DEBUG_TYPE   "aggressive-instcombine"
 

Functions

 STATISTIC (NumAnyOrAllBitsSet, "Number of any/all-bits-set patterns folded")
 
 STATISTIC (NumGuardedRotates, "Number of guarded rotates transformed into funnel shifts")
 
 STATISTIC (NumGuardedFunnelShifts, "Number of guarded funnel shifts transformed into funnel shifts")
 
 STATISTIC (NumPopCountRecognized, "Number of popcount idioms recognized")
 
static bool foldGuardedFunnelShift (Instruction &I, const DominatorTree &DT)
 Match a pattern for a bitwise funnel/rotate operation that partially guards against undefined behavior by branching around the funnel-shift/rotation when the shift amount is 0.
 
static bool matchAndOrChain (Value *V, MaskOps &MOps)
 This is a recursive helper for foldAnyOrAllBitsSet() that walks through a chain of 'and' or 'or' instructions looking for shift ops of a common source value.
 
static bool foldAnyOrAllBitsSet (Instruction &I)
 Match patterns that correspond to "any-bits-set" and "all-bits-set".
 
static bool tryToRecognizePopCount (Instruction &I)
 
static bool tryToFPToSat (Instruction &I, TargetTransformInfo &TTI)
 Fold smin(smax(fptosi(x), C1), C2) to llvm.fptosi.sat(x), providing C1 and C2 saturate the value of the fp conversion.
 
static bool foldSqrt (Instruction &I, TargetTransformInfo &TTI, TargetLibraryInfo &TLI, AssumptionCache &AC, DominatorTree &DT)
 Try to replace a mathlib call to sqrt with the LLVM intrinsic.
 
static bool isCTTZTable (const ConstantDataArray &Table, uint64_t Mul, uint64_t Shift, uint64_t InputBits)
 
static bool tryToRecognizeTableBasedCttz (Instruction &I)
 
static bool foldLoadsRecursive (Value *V, LoadOps &LOps, const DataLayout &DL, AliasAnalysis &AA)
 
static bool foldConsecutiveLoads (Instruction &I, const DataLayout &DL, TargetTransformInfo &TTI, AliasAnalysis &AA, const DominatorTree &DT)
 
static std::pair< APInt, APIntgetStrideAndModOffsetOfGEP (Value *PtrOp, const DataLayout &DL)
 
static bool foldPatternedLoads (Instruction &I, const DataLayout &DL)
 If C is a constant patterned array and all valid loaded results for given alignment are same to a constant, return that constant.
 
static bool foldUnusualPatterns (Function &F, DominatorTree &DT, TargetTransformInfo &TTI, TargetLibraryInfo &TLI, AliasAnalysis &AA, AssumptionCache &AC)
 This is the entry point for folds that could be implemented in regular InstCombine, but they are separated because they are not expected to occur frequently and/or have more than a constant-length pattern match.
 
static bool runImpl (Function &F, AssumptionCache &AC, TargetTransformInfo &TTI, TargetLibraryInfo &TLI, DominatorTree &DT, AliasAnalysis &AA)
 This is the entry point for all transforms.
 

Variables

static cl::opt< unsignedMaxInstrsToScan ("aggressive-instcombine-max-scan-instrs", cl::init(64), cl::Hidden, cl::desc("Max number of instructions to scan for aggressive instcombine."))
 

Macro Definition Documentation

◆ DEBUG_TYPE

#define DEBUG_TYPE   "aggressive-instcombine"

Definition at line 37 of file AggressiveInstCombine.cpp.

Function Documentation

◆ foldAnyOrAllBitsSet()

static bool foldAnyOrAllBitsSet ( Instruction I)
static

Match patterns that correspond to "any-bits-set" and "all-bits-set".

These will include a chain of 'or' or 'and'-shifted bits from a common source value: and (or (lshr X, C), ...), 1 --> (X & CMask) != 0 and (and (lshr X, C), ...), 1 --> (X & CMask) == CMask Note: "any-bits-clear" and "all-bits-clear" are variations of these patterns that differ only with a final 'not' of the result. We expect that final 'not' to be folded with the compare that we create here (invert predicate).

Definition at line 238 of file AggressiveInstCombine.cpp.

References llvm::And, llvm::IRBuilderBase::CreateAnd(), llvm::IRBuilderBase::CreateICmpEQ(), llvm::IRBuilderBase::CreateIsNotNull(), llvm::IRBuilderBase::CreateZExt(), MaskOps::FoundAnd1, I, llvm::PatternMatch::m_And(), llvm::PatternMatch::m_c_And(), llvm::PatternMatch::m_One(), llvm::PatternMatch::m_OneUse(), llvm::PatternMatch::m_Or(), llvm::PatternMatch::m_Value(), MaskOps::Mask, llvm::PatternMatch::match(), matchAndOrChain(), and MaskOps::Root.

Referenced by foldUnusualPatterns().

◆ foldConsecutiveLoads()

static bool foldConsecutiveLoads ( Instruction I,
const DataLayout DL,
TargetTransformInfo TTI,
AliasAnalysis AA,
const DominatorTree DT 
)
static

◆ foldGuardedFunnelShift()

static bool foldGuardedFunnelShift ( Instruction I,
const DominatorTree DT 
)
static

◆ foldLoadsRecursive()

static bool foldLoadsRecursive ( Value V,
LoadOps LOps,
const DataLayout DL,
AliasAnalysis AA 
)
static

◆ foldPatternedLoads()

static bool foldPatternedLoads ( Instruction I,
const DataLayout DL 
)
static

If C is a constant patterned array and all valid loaded results for given alignment are same to a constant, return that constant.

Definition at line 880 of file AggressiveInstCombine.cpp.

References llvm::CallingConv::C, llvm::ConstantFoldLoadFromConst(), DL, E, getAlign(), getStrideAndModOffsetOfGEP(), llvm::getUnderlyingObject(), and I.

Referenced by foldUnusualPatterns().

◆ foldSqrt()

static bool foldSqrt ( Instruction I,
TargetTransformInfo TTI,
TargetLibraryInfo TLI,
AssumptionCache AC,
DominatorTree DT 
)
static

Try to replace a mathlib call to sqrt with the LLVM intrinsic.

This avoids pessimistic codegen that has to account for setting errno and can enable vectorization.

Definition at line 402 of file AggressiveInstCombine.cpp.

References llvm::cannotBeOrderedLessThanZero(), llvm::IRBuilderBase::CreateCall(), llvm::Intrinsic::getDeclaration(), llvm::TargetLibraryInfo::getLibFunc(), llvm::TargetTransformInfo::haveFastSqrt(), I, llvm::isLibFuncEmittable(), and llvm::IRBuilderBase::setFastMathFlags().

Referenced by foldUnusualPatterns().

◆ foldUnusualPatterns()

static bool foldUnusualPatterns ( Function F,
DominatorTree DT,
TargetTransformInfo TTI,
TargetLibraryInfo TLI,
AliasAnalysis AA,
AssumptionCache AC 
)
static

This is the entry point for folds that could be implemented in regular InstCombine, but they are separated because they are not expected to occur frequently and/or have more than a constant-length pattern match.

Definition at line 928 of file AggressiveInstCombine.cpp.

References DL, F, foldAnyOrAllBitsSet(), foldConsecutiveLoads(), foldGuardedFunnelShift(), foldPatternedLoads(), foldSqrt(), I, llvm::DominatorTree::isReachableFromEntry(), llvm::make_early_inc_range(), llvm::reverse(), llvm::SimplifyInstructionsInBlock(), tryToFPToSat(), tryToRecognizePopCount(), and tryToRecognizeTableBasedCttz().

Referenced by runImpl().

◆ getStrideAndModOffsetOfGEP()

static std::pair< APInt, APInt > getStrideAndModOffsetOfGEP ( Value PtrOp,
const DataLayout DL 
)
static

◆ isCTTZTable()

static bool isCTTZTable ( const ConstantDataArray Table,
uint64_t  Mul,
uint64_t  Shift,
uint64_t  InputBits 
)
static

◆ matchAndOrChain()

static bool matchAndOrChain ( Value V,
MaskOps MOps 
)
static

This is a recursive helper for foldAnyOrAllBitsSet() that walks through a chain of 'and' or 'or' instructions looking for shift ops of a common source value.

Examples: or (or (or X, (X >> 3)), (X >> 5)), (X >> 8) returns { X, 0x129 } and (and (X >> 1), 1), (X >> 4) returns { X, 0x12 }

Definition at line 192 of file AggressiveInstCombine.cpp.

References MaskOps::FoundAnd1, llvm::APInt::getBitWidth(), llvm::APInt::getZExtValue(), llvm::PatternMatch::m_And(), llvm::PatternMatch::m_APInt(), llvm::PatternMatch::m_LShr(), llvm::PatternMatch::m_One(), llvm::PatternMatch::m_Or(), llvm::PatternMatch::m_Value(), MaskOps::Mask, llvm::PatternMatch::match(), MaskOps::MatchAndChain, matchAndOrChain(), MaskOps::Root, llvm::APInt::setBit(), and llvm::APInt::uge().

Referenced by foldAnyOrAllBitsSet(), and matchAndOrChain().

◆ runImpl()

static bool runImpl ( Function F,
AssumptionCache AC,
TargetTransformInfo TTI,
TargetLibraryInfo TLI,
DominatorTree DT,
AliasAnalysis AA 
)
static

This is the entry point for all transforms.

Pass manager differences are handled in the callers of this function.

Definition at line 970 of file AggressiveInstCombine.cpp.

References DL, F, foldUnusualPatterns(), and llvm::TruncInstCombine::run().

◆ STATISTIC() [1/4]

STATISTIC ( NumAnyOrAllBitsSet  ,
"Number of any/all-bits-set patterns folded"   
)

◆ STATISTIC() [2/4]

STATISTIC ( NumGuardedFunnelShifts  ,
"Number of guarded funnel shifts transformed into funnel shifts"   
)

◆ STATISTIC() [3/4]

STATISTIC ( NumGuardedRotates  ,
"Number of guarded rotates transformed into funnel shifts"   
)

◆ STATISTIC() [4/4]

STATISTIC ( NumPopCountRecognized  ,
"Number of popcount idioms recognized"   
)

◆ tryToFPToSat()

static bool tryToFPToSat ( Instruction I,
TargetTransformInfo TTI 
)
static

Fold smin(smax(fptosi(x), C1), C2) to llvm.fptosi.sat(x), providing C1 and C2 saturate the value of the fp conversion.

The transform is not reversable as the fptosi.sat is more defined than the input - all values produce a valid value for the fptosi.sat, where as some produce poison for original that were out of range of the integer conversion. The reversed pattern may use fmax and fmin instead. As we cannot directly reverse the transform, and it is not always profitable, we make it conditional on the cost being reported as lower by TTI.

Definition at line 346 of file AggressiveInstCombine.cpp.

References llvm::IRBuilderBase::CreateCall(), llvm::IRBuilderBase::CreateSExt(), llvm::IntegerType::get(), llvm::TargetTransformInfo::getCastInstrCost(), llvm::Type::getContext(), llvm::Intrinsic::getDeclaration(), llvm::TargetTransformInfo::getIntrinsicInstrCost(), I, llvm::PatternMatch::m_APInt(), llvm::PatternMatch::m_FPToSI(), llvm::PatternMatch::m_OneUse(), llvm::PatternMatch::m_SMax(), llvm::PatternMatch::m_SMin(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::match(), llvm::TargetTransformInfo::None, and llvm::TargetTransformInfo::TCK_RecipThroughput.

Referenced by foldUnusualPatterns().

◆ tryToRecognizePopCount()

static bool tryToRecognizePopCount ( Instruction I)
static

◆ tryToRecognizeTableBasedCttz()

static bool tryToRecognizeTableBasedCttz ( Instruction I)
static

Variable Documentation

◆ MaxInstrsToScan

cl::opt< unsigned > MaxInstrsToScan("aggressive-instcombine-max-scan-instrs", cl::init(64), cl::Hidden, cl::desc("Max number of instructions to scan for aggressive instcombine.")) ( "aggressive-instcombine-max-scan-instrs"  ,
cl::init(64)  ,
cl::Hidden  ,
cl::desc("Max number of instructions to scan for aggressive instcombine.")   
)
static

Referenced by foldLoadsRecursive().