#include "InstCombineInternal.h"
#include "llvm/Analysis/CmpInstAnalysis.h"
#include "llvm/Analysis/InstructionSimplify.h"
#include "llvm/IR/ConstantRange.h"
#include "llvm/IR/Intrinsics.h"
#include "llvm/IR/PatternMatch.h"
#include "llvm/Transforms/InstCombine/InstCombiner.h"
#include "llvm/Transforms/Utils/Local.h"

Classes
struct	IntPart

Macros
#define	DEBUG_TYPE "instcombine"

Enumerations
enum	MaskedICmpType { AMask_AllOnes = 1 , AMask_NotAllOnes = 2 , BMask_AllOnes = 4 , BMask_NotAllOnes = 8 , Mask_AllZeros = 16 , Mask_NotAllZeros = 32 , AMask_Mixed = 64 , AMask_NotMixed = 128 , BMask_Mixed = 256 , BMask_NotMixed = 512 }
	Classify (icmp eq (A & B), C) and (icmp ne (A & B), C) as matching patterns that can be simplified. More...

Functions
static Value *	getNewICmpValue (unsigned Code, bool Sign, Value LHS, Value RHS, InstCombiner::BuilderTy &Builder)
	This is the complement of getICmpCode, which turns an opcode and two operands into either a constant true or false, or a brand new ICmp instruction.

static Value *	getFCmpValue (unsigned Code, Value LHS, Value RHS, InstCombiner::BuilderTy &Builder)
	This is the complement of getFCmpCode, which turns an opcode and two operands into either a FCmp instruction, or a true/false constant.

static Value *	SimplifyBSwap (BinaryOperator &I, InstCombiner::BuilderTy &Builder)
	Transform BITWISE_OP(BSWAP(A),BSWAP(B)) or BITWISE_OP(BSWAP(A), Constant) to BSWAP(BITWISE_OP(A, B))

static unsigned	getMaskedICmpType (Value A, Value B, Value *C, ICmpInst::Predicate Pred)
	Return the set of patterns (from MaskedICmpType) that (icmp SCC (A & B), C) satisfies.

static unsigned	conjugateICmpMask (unsigned Mask)
	Convert an analysis of a masked ICmp into its equivalent if all boolean operations had the opposite sense.

static bool	decomposeBitTestICmp (Value LHS, Value RHS, CmpInst::Predicate &Pred, Value &X, Value &Y, Value *&Z)

static std::optional< std::pair< unsigned, unsigned > >	getMaskedTypeForICmpPair (Value &A, Value &B, Value &C, Value &D, Value &E, ICmpInst LHS, ICmpInst *RHS, ICmpInst::Predicate &PredL, ICmpInst::Predicate &PredR)
	Handle (icmp(A & B) ==/!= C) &/\| (icmp(A & D) ==/!= E).

static Value *	foldLogOpOfMaskedICmps_NotAllZeros_BMask_Mixed (ICmpInst LHS, ICmpInst RHS, bool IsAnd, Value A, Value B, Value C, Value D, Value *E, ICmpInst::Predicate PredL, ICmpInst::Predicate PredR, InstCombiner::BuilderTy &Builder)
	Try to fold (icmp(A & B) ==/!= C) &/\| (icmp(A & D) ==/!= E) into a single (icmp(A & X) ==/!= Y), where the left-hand side is of type Mask_NotAllZeros and the right hand side is of type BMask_Mixed.

static Value *	foldLogOpOfMaskedICmpsAsymmetric (ICmpInst LHS, ICmpInst RHS, bool IsAnd, Value A, Value B, Value C, Value D, Value *E, ICmpInst::Predicate PredL, ICmpInst::Predicate PredR, unsigned LHSMask, unsigned RHSMask, InstCombiner::BuilderTy &Builder)
	Try to fold (icmp(A & B) ==/!= 0) &/\| (icmp(A & D) ==/!= E) into a single (icmp(A & X) ==/!= Y), where the left-hand side and the right hand side aren't of the common mask pattern type.

static Value *	foldLogOpOfMaskedICmps (ICmpInst LHS, ICmpInst RHS, bool IsAnd, bool IsLogical, InstCombiner::BuilderTy &Builder)
	Try to fold (icmp(A & B) ==/!= C) &/\| (icmp(A & D) ==/!= E) into a single (icmp(A & X) ==/!= Y).

static Value *	foldSignedTruncationCheck (ICmpInst ICmp0, ICmpInst ICmp1, Instruction &CxtI, InstCombiner::BuilderTy &Builder)
	General pattern: X & Y.

static Value *	foldIsPowerOf2OrZero (ICmpInst Cmp0, ICmpInst Cmp1, bool IsAnd, InstCombiner::BuilderTy &Builder)
	Fold (icmp eq ctpop(X) 1) \| (icmp eq X 0) into (icmp ult ctpop(X) 2) and fold (icmp ne ctpop(X) 1) & (icmp ne X 0) into (icmp ugt ctpop(X) 1).

static Value *	foldIsPowerOf2 (ICmpInst Cmp0, ICmpInst Cmp1, bool JoinedByAnd, InstCombiner::BuilderTy &Builder)
	Reduce a pair of compares that check if a value has exactly 1 bit set.

static Value *	foldNegativePower2AndShiftedMask (Value A, Value B, Value D, Value E, ICmpInst::Predicate PredL, ICmpInst::Predicate PredR, InstCombiner::BuilderTy &Builder)
	Try to fold (icmp(A & B) == 0) & (icmp(A & D) != E) into (icmp A u< D) iff B is a contiguous set of ones starting from the most significant bit (negative power of 2), D and E are equal, and D is a contiguous set of ones starting at the most significant zero bit in B.

static Value *	foldPowerOf2AndShiftedMask (ICmpInst Cmp0, ICmpInst Cmp1, bool JoinedByAnd, InstCombiner::BuilderTy &Builder)
	Try to fold ((icmp X u< P) & (icmp(X & M) != M)) or ((icmp X s> -1) & (icmp(X & M) != M)) into (icmp X u< M).

static Value *	foldUnsignedUnderflowCheck (ICmpInst ZeroICmp, ICmpInst UnsignedICmp, bool IsAnd, const SimplifyQuery &Q, InstCombiner::BuilderTy &Builder)
	Commuted variants are assumed to be handled by calling this function again with the parameters swapped.

static std::optional< IntPart >	matchIntPart (Value *V)
	Match an extraction of bits from an integer.

static Value *	extractIntPart (const IntPart &P, IRBuilderBase &Builder)
	Materialize an extraction of bits from an integer in IR.

static Value *	foldAndOrOfICmpsWithConstEq (ICmpInst Cmp0, ICmpInst Cmp1, bool IsAnd, bool IsLogical, InstCombiner::BuilderTy &Builder, const SimplifyQuery &Q)
	Reduce logic-of-compares with equality to a constant by substituting a common operand with the constant.

static Value *	stripSignOnlyFPOps (Value *Val)
	Ignore all operations which only change the sign of a value, returning the underlying magnitude value.

static bool	matchIsNotNaN (FCmpInst::Predicate P, Value LHS, Value RHS)
	Matches canonical form of isnan, fcmp ord x, 0.

static bool	matchUnorderedInfCompare (FCmpInst::Predicate P, Value LHS, Value RHS)
	Matches fcmp u__ x, +/-inf.

static Value *	matchIsFiniteTest (InstCombiner::BuilderTy &Builder, FCmpInst LHS, FCmpInst RHS)
	and (fcmp ord x, 0), (fcmp u* x, inf) -> fcmp o* x, inf

static bool	matchIsFPClassLikeFCmp (Value Op, Value &ClassVal, uint64_t &ClassMask)
	Match an fcmp against a special value that performs a test possible by llvm.is.fpclass.

static Instruction *	reassociateFCmps (BinaryOperator &BO, InstCombiner::BuilderTy &Builder)
	This a limited reassociation for a special case (see above) where we are checking if two values are either both NAN (unordered) or not-NAN (ordered).

static Instruction *	matchDeMorgansLaws (BinaryOperator &I, InstCombiner::BuilderTy &Builder)
	Match variations of De Morgan's Laws: (~A & ~B) == (~(A \| B)) (~A \| ~B) == (~(A & B))

static Instruction *	foldLogicCastConstant (BinaryOperator &Logic, CastInst *Cast, InstCombinerImpl &IC)
	Fold {and,or,xor} (cast X), C.

static Instruction *	foldAndToXor (BinaryOperator &I, InstCombiner::BuilderTy &Builder)

static Instruction *	foldOrToXor (BinaryOperator &I, InstCombiner::BuilderTy &Builder)

static bool	canNarrowShiftAmt (Constant *C, unsigned BitWidth)
	Return true if a constant shift amount is always less than the specified bit-width.

static Instruction *	foldComplexAndOrPatterns (BinaryOperator &I, InstCombiner::BuilderTy &Builder)
	Try folding relatively complex patterns for both And and Or operations with all And and Or swapped.

static Instruction *	reassociateForUses (BinaryOperator &BO, InstCombinerImpl::BuilderTy &Builder)
	Try to reassociate a pair of binops so that values with one use only are part of the same instruction.

static Instruction *	canonicalizeLogicFirst (BinaryOperator &I, InstCombiner::BuilderTy &Builder)

static Instruction *	matchFunnelShift (Instruction &Or, InstCombinerImpl &IC)
	Match UB-safe variants of the funnel shift intrinsic.

static Instruction *	matchOrConcat (Instruction &Or, InstCombiner::BuilderTy &Builder)
	Attempt to combine or(zext(x),shl(zext(y),bw/2) concat packing patterns.

static bool	areInverseVectorBitmasks (Constant C1, Constant C2)
	If all elements of two constant vectors are 0/-1 and inverses, return true.

static Value *	foldAndOrOfICmpEqConstantAndICmp (ICmpInst LHS, ICmpInst RHS, bool IsAnd, bool IsLogical, IRBuilderBase &Builder)

static Instruction *	foldXorToXor (BinaryOperator &I, InstCombiner::BuilderTy &Builder)
	A ^ B can be specified using other logic ops in a variety of patterns.

static Instruction *	visitMaskedMerge (BinaryOperator &I, InstCombiner::BuilderTy &Builder)
	If we have a masked merge, in the canonical form of: (assuming that A only has one use.) \| A \| \|B\| ((x ^ y) & M) ^ y \| D \|.

static Instruction *	sinkNotIntoXor (BinaryOperator &I, Value X, Value Y, InstCombiner::BuilderTy &Builder)

static Instruction *	foldNotXor (BinaryOperator &I, InstCombiner::BuilderTy &Builder)

static Instruction *	canonicalizeAbs (BinaryOperator &Xor, InstCombiner::BuilderTy &Builder)
	Canonicalize a shifty way to code absolute value to the more common pattern that uses negation and select.

static bool	canFreelyInvert (InstCombiner &IC, Value Op, Instruction IgnoredUser)

static Value *	freelyInvert (InstCombinerImpl &IC, Value Op, Instruction IgnoredUser)

Macro Definition Documentation

◆ DEBUG_TYPE

#define DEBUG_TYPE "instcombine"

Definition at line 25 of file InstCombineAndOrXor.cpp.

Enumeration Type Documentation

◆ MaskedICmpType

enum MaskedICmpType

Classify (icmp eq (A & B), C) and (icmp ne (A & B), C) as matching patterns that can be simplified.

One of A and B is considered the mask. The other is the value. This is described as the "AMask" or "BMask" part of the enum. If the enum contains only "Mask", then both A and B can be considered masks. If A is the mask, then it was proven that (A & C) == C. This is trivial if C == A or C == 0. If both A and C are constants, this proof is also easy. For the following explanations, we assume that A is the mask.

"AllOnes" declares that the comparison is true only if (A & B) == A or all bits of A are set in B. Example: (icmp eq (A & 3), 3) -> AMask_AllOnes

"AllZeros" declares that the comparison is true only if (A & B) == 0 or all bits of A are cleared in B. Example: (icmp eq (A & 3), 0) -> Mask_AllZeroes

"Mixed" declares that (A & B) == C and C might or might not contain any number of one bits and zero bits. Example: (icmp eq (A & 3), 1) -> AMask_Mixed

"Not" means that in above descriptions "==" should be replaced by "!=". Example: (icmp ne (A & 3), 3) -> AMask_NotAllOnes

If the mask A contains a single bit, then the following is equivalent: (icmp eq (A & B), A) equals (icmp ne (A & B), 0) (icmp ne (A & B), A) equals (icmp eq (A & B), 0)

Enumerator
AMask_AllOnes
AMask_NotAllOnes
BMask_AllOnes
BMask_NotAllOnes
Mask_AllZeros
Mask_NotAllZeros
AMask_Mixed
AMask_NotMixed
BMask_Mixed
BMask_NotMixed

Definition at line 141 of file InstCombineAndOrXor.cpp.

Function Documentation

◆ areInverseVectorBitmasks()

static bool areInverseVectorBitmasks	(	Constant *	C1,
		Constant *	C2
	)

static

If all elements of two constant vectors are 0/-1 and inverses, return true.

Definition at line 2885 of file InstCombineAndOrXor.cpp.

References llvm::Constant::getAggregateElement(), llvm::Value::getType(), llvm::PatternMatch::m_AllOnes(), llvm::PatternMatch::m_Zero(), and llvm::PatternMatch::match().

◆ canFreelyInvert()

static bool canFreelyInvert	(	InstCombiner &	IC,
		Value *	Op,
		Instruction *	IgnoredUser
	)

static

Definition at line 4093 of file InstCombineAndOrXor.cpp.

References llvm::InstCombiner::canFreelyInvertAllUsersOf(), I, and llvm::InstCombiner::isFreeToInvert().

Referenced by llvm::InstCombinerImpl::sinkNotIntoLogicalOp(), and llvm::InstCombinerImpl::sinkNotIntoOtherHandOfLogicalOp().

◆ canNarrowShiftAmt()

static bool canNarrowShiftAmt	(	Constant *	C,
		unsigned	BitWidth
	)

static

Return true if a constant shift amount is always less than the specified bit-width.

If not, the shift could create poison in the narrower type.

Definition at line 1889 of file InstCombineAndOrXor.cpp.

References llvm::BitWidth, llvm::CallingConv::C, llvm::CmpInst::ICMP_ULT, llvm::PatternMatch::m_SpecificInt_ICMP(), and llvm::PatternMatch::match().

◆ canonicalizeAbs()

static Instruction * canonicalizeAbs	(	BinaryOperator &	Xor,
		InstCombiner::BuilderTy &	Builder
	)

static

Canonicalize a shifty way to code absolute value to the more common pattern that uses negation and select.

Definition at line 4062 of file InstCombineAndOrXor.cpp.

References A, llvm::Add, assert(), Builder, llvm::SelectInst::Create(), llvm::Type::getScalarSizeInBits(), llvm::Value::hasNUses(), llvm::PatternMatch::m_APInt(), llvm::PatternMatch::m_AShr(), llvm::PatternMatch::m_c_Add(), llvm::PatternMatch::m_OneUse(), llvm::PatternMatch::m_Specific(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::match(), std::swap(), and llvm::Xor.

Referenced by llvm::InstCombinerImpl::visitXor().

◆ canonicalizeLogicFirst()

static Instruction * canonicalizeLogicFirst	(	BinaryOperator &	I,
		InstCombiner::BuilderTy &	Builder
	)

static

Definition at line 2113 of file InstCombineAndOrXor.cpp.

References Builder, llvm::CallingConv::C, llvm::APInt::countr_zero(), llvm::BinaryOperator::CreateWithCopiedFlags(), llvm::ConstantInt::get(), llvm::Type::getScalarSizeInBits(), I, llvm_unreachable, llvm::PatternMatch::m_Add(), llvm::PatternMatch::m_APInt(), llvm::PatternMatch::m_OneUse(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::match(), and X.

Referenced by llvm::InstCombinerImpl::visitAnd(), llvm::InstCombinerImpl::visitOr(), and llvm::InstCombinerImpl::visitXor().

◆ conjugateICmpMask()

static unsigned conjugateICmpMask ( unsigned Mask )

static

Convert an analysis of a masked ICmp into its equivalent if all boolean operations had the opposite sense.

Since each "NotXXX" flag (recording !=) is adjacent to the corresponding normal flag (recording ==), this just involves swapping those bits over.

Definition at line 206 of file InstCombineAndOrXor.cpp.

References AMask_AllOnes, AMask_Mixed, AMask_NotAllOnes, AMask_NotMixed, BMask_AllOnes, BMask_Mixed, BMask_NotAllOnes, BMask_NotMixed, Mask_AllZeros, and Mask_NotAllZeros.

Referenced by foldLogOpOfMaskedICmps(), and foldLogOpOfMaskedICmpsAsymmetric().

◆ decomposeBitTestICmp()

static bool decomposeBitTestICmp	(	Value *	LHS,
		Value *	RHS,
		CmpInst::Predicate &	Pred,
		Value *&	X,
		Value *&	Y,
		Value *&	Z
	)

static

Definition at line 220 of file InstCombineAndOrXor.cpp.

References llvm::decomposeBitTestICmp(), llvm::ConstantInt::get(), LHS, RHS, X, and Y.

◆ extractIntPart()

static Value * extractIntPart	(	const IntPart &	P,
		IRBuilderBase &	Builder
	)

static

Materialize an extraction of bits from an integer in IR.

Definition at line 1163 of file InstCombineAndOrXor.cpp.

References Builder, and P.

◆ foldAndOrOfICmpEqConstantAndICmp()

static Value * foldAndOrOfICmpEqConstantAndICmp	(	ICmpInst *	LHS,
		ICmpInst *	RHS,
		bool	IsAnd,
		bool	IsLogical,
		IRBuilderBase &	Builder
	)

static

◆ foldAndOrOfICmpsWithConstEq()

static Value * foldAndOrOfICmpsWithConstEq	(	ICmpInst *	Cmp0,
		ICmpInst *	Cmp1,
		bool	IsAnd,
		bool	IsLogical,
		InstCombiner::BuilderTy &	Builder,
		const SimplifyQuery &	Q
	)

static

Reduce logic-of-compares with equality to a constant by substituting a common operand with the constant.

Callers are expected to call this with Cmp0/Cmp1 switched to handle logic op commutativity.

Definition at line 1222 of file InstCombineAndOrXor.cpp.

References Builder, llvm::CallingConv::C, llvm::Value::hasOneUse(), llvm::CmpInst::ICMP_EQ, llvm::CmpInst::ICMP_NE, llvm::isGuaranteedNotToBeUndefOrPoison(), llvm::PatternMatch::m_c_ICmp(), llvm::PatternMatch::m_Constant(), llvm::PatternMatch::m_Deferred(), llvm::PatternMatch::m_ICmp(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::match(), llvm::simplifyICmpInst(), X, and Y.

◆ foldAndToXor()

static Instruction * foldAndToXor	(	BinaryOperator &	I,
		InstCombiner::BuilderTy &	Builder
	)

static

Definition at line 1827 of file InstCombineAndOrXor.cpp.

References A, assert(), B, Builder, llvm::BinaryOperator::CreateNot(), llvm::Value::hasOneUse(), I, llvm::PatternMatch::m_BinOp(), llvm::PatternMatch::m_c_And(), llvm::PatternMatch::m_c_Or(), llvm::PatternMatch::m_Deferred(), llvm::PatternMatch::m_Not(), llvm::PatternMatch::m_Or(), llvm::PatternMatch::m_Value(), and llvm::PatternMatch::match().

Referenced by llvm::InstCombinerImpl::visitAnd().

◆ foldComplexAndOrPatterns()

static Instruction * foldComplexAndOrPatterns	(	BinaryOperator &	I,
		InstCombiner::BuilderTy &	Builder
	)

static

Try folding relatively complex patterns for both And and Or operations with all And and Or swapped.

Definition at line 1937 of file InstCombineAndOrXor.cpp.

References A, assert(), B, Builder, llvm::CallingConv::C, llvm::BinaryOperator::Create(), llvm::BinaryOperator::CreateNot(), llvm::Value::hasOneUse(), I, llvm::PatternMatch::m_BinOp(), llvm::PatternMatch::m_c_BinOp(), llvm::PatternMatch::m_c_Xor(), llvm::PatternMatch::m_CombineAnd(), llvm::PatternMatch::m_Not(), llvm::PatternMatch::m_OneUse(), llvm::PatternMatch::m_Specific(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::match(), llvm::Or, X, llvm::Xor, and Y.

Referenced by llvm::InstCombinerImpl::visitAnd(), and llvm::InstCombinerImpl::visitOr().

◆ foldIsPowerOf2()

static Value * foldIsPowerOf2	(	ICmpInst *	Cmp0,
		ICmpInst *	Cmp1,
		bool	JoinedByAnd,
		InstCombiner::BuilderTy &	Builder
	)

static

Reduce a pair of compares that check if a value has exactly 1 bit set.

Also used for logical and/or, must be poison safe.

Definition at line 929 of file InstCombineAndOrXor.cpp.

References Builder, llvm::ConstantInt::get(), llvm::User::getOperand(), llvm::CmpInst::getPredicate(), llvm::Value::getType(), llvm::CmpInst::ICMP_EQ, llvm::CmpInst::ICMP_NE, llvm::CmpInst::ICMP_UGT, llvm::CmpInst::ICMP_ULT, llvm::PatternMatch::m_ICmp(), llvm::PatternMatch::m_Specific(), llvm::PatternMatch::m_SpecificInt(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::m_ZeroInt(), llvm::PatternMatch::match(), std::swap(), and X.

◆ foldIsPowerOf2OrZero()

static Value * foldIsPowerOf2OrZero	(	ICmpInst *	Cmp0,
		ICmpInst *	Cmp1,
		bool	IsAnd,
		InstCombiner::BuilderTy &	Builder
	)

static

Fold (icmp eq ctpop(X) 1) | (icmp eq X 0) into (icmp ult ctpop(X) 2) and fold (icmp ne ctpop(X) 1) & (icmp ne X 0) into (icmp ugt ctpop(X) 1).

Also used for logical and/or, must be poison safe.

Definition at line 909 of file InstCombineAndOrXor.cpp.

References Builder, llvm::ConstantInt::get(), llvm::User::getOperand(), llvm::Value::getType(), llvm::CmpInst::ICMP_EQ, llvm::CmpInst::ICMP_NE, llvm::PatternMatch::m_ICmp(), llvm::PatternMatch::m_Specific(), llvm::PatternMatch::m_SpecificInt(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::m_ZeroInt(), llvm::PatternMatch::match(), and X.

◆ foldLogicCastConstant()

static Instruction * foldLogicCastConstant	(	BinaryOperator &	Logic,
		CastInst *	Cast,
		InstCombinerImpl &	IC
	)

static

Fold {and,or,xor} (cast X), C.

Definition at line 1671 of file InstCombineAndOrXor.cpp.

References llvm::InstCombiner::Builder, llvm::CallingConv::C, llvm::IRBuilderBase::CreateBinOp(), llvm::InstCombinerImpl::getLosslessSignedTrunc(), llvm::InstCombinerImpl::getLosslessUnsignedTrunc(), llvm::BinaryOperator::getOpcode(), llvm::User::getOperand(), llvm::CastInst::getSrcTy(), llvm::Value::getType(), llvm::PatternMatch::m_OneUse(), llvm::PatternMatch::m_SExt(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::m_ZExt(), llvm::PatternMatch::match(), and X.

◆ foldLogOpOfMaskedICmps()

static Value * foldLogOpOfMaskedICmps	(	ICmpInst *	LHS,
		ICmpInst *	RHS,
		bool	IsAnd,
		bool	IsLogical,
		InstCombiner::BuilderTy &	Builder
	)

static

Try to fold (icmp(A & B) ==/!= C) &/| (icmp(A & D) ==/!= E) into a single (icmp(A & X) ==/!= Y).

Definition at line 521 of file InstCombineAndOrXor.cpp.

References A, AMask_AllOnes, AMask_NotAllOnes, assert(), B, BMask_AllOnes, BMask_Mixed, BMask_NotAllOnes, BMask_NotMixed, Builder, llvm::CallingConv::C, CC, conjugateICmpMask(), D, E, foldLogOpOfMaskedICmpsAsymmetric(), llvm::ConstantInt::get(), llvm::CmpInst::getInversePredicate(), getMaskedTypeForICmpPair(), llvm::Constant::getNullValue(), llvm::Value::getType(), llvm::CmpInst::ICMP_EQ, llvm::CmpInst::ICMP_NE, llvm::ICmpInst::isEquality(), llvm::isGuaranteedNotToBeUndefOrPoison(), llvm::APInt::isSubsetOf(), LHS, llvm::PatternMatch::m_APInt(), Mask_AllZeros, Mask_NotAllZeros, llvm::PatternMatch::match(), and RHS.

◆ foldLogOpOfMaskedICmps_NotAllZeros_BMask_Mixed()

static Value * foldLogOpOfMaskedICmps_NotAllZeros_BMask_Mixed	(	ICmpInst *	LHS,
		ICmpInst *	RHS,
		bool	IsAnd,
		Value *	A,
		Value *	B,
		Value *	C,
		Value *	D,
		Value *	E,
		ICmpInst::Predicate	PredL,
		ICmpInst::Predicate	PredR,
		InstCombiner::BuilderTy &	Builder
	)

static

Try to fold (icmp(A & B) ==/!= C) &/| (icmp(A & D) ==/!= E) into a single (icmp(A & X) ==/!= Y), where the left-hand side is of type Mask_NotAllZeros and the right hand side is of type BMask_Mixed.

For example, (icmp (A & 12) != 0) & (icmp (A & 15) == 8) -> (icmp (A & 15) == 8). Also used for logical and/or, must be poison safe.

Definition at line 366 of file InstCombineAndOrXor.cpp.

References A, assert(), B, Builder, llvm::CallingConv::C, D, E, llvm::ConstantInt::get(), llvm::Value::getType(), llvm::CmpInst::ICMP_EQ, llvm::CmpInst::ICMP_NE, llvm::APInt::isZero(), LHS, llvm::PatternMatch::m_APInt(), llvm::PatternMatch::match(), and RHS.

Referenced by foldLogOpOfMaskedICmpsAsymmetric().

◆ foldLogOpOfMaskedICmpsAsymmetric()

static Value * foldLogOpOfMaskedICmpsAsymmetric	(	ICmpInst *	LHS,
		ICmpInst *	RHS,
		bool	IsAnd,
		Value *	A,
		Value *	B,
		Value *	C,
		Value *	D,
		Value *	E,
		ICmpInst::Predicate	PredL,
		ICmpInst::Predicate	PredR,
		unsigned	LHSMask,
		unsigned	RHSMask,
		InstCombiner::BuilderTy &	Builder
	)

static

Try to fold (icmp(A & B) ==/!= 0) &/| (icmp(A & D) ==/!= E) into a single (icmp(A & X) ==/!= Y), where the left-hand side and the right hand side aren't of the common mask pattern type.

Also used for logical and/or, must be poison safe.

Definition at line 488 of file InstCombineAndOrXor.cpp.

References A, assert(), B, BMask_Mixed, Builder, llvm::CallingConv::C, conjugateICmpMask(), D, E, foldLogOpOfMaskedICmps_NotAllZeros_BMask_Mixed(), llvm::ICmpInst::isEquality(), LHS, Mask_NotAllZeros, and RHS.

Referenced by foldLogOpOfMaskedICmps().

◆ foldNegativePower2AndShiftedMask()

static Value * foldNegativePower2AndShiftedMask	(	Value *	A,
		Value *	B,
		Value *	D,
		Value *	E,
		ICmpInst::Predicate	PredL,
		ICmpInst::Predicate	PredR,
		InstCombiner::BuilderTy &	Builder
	)

static

Try to fold (icmp(A & B) == 0) & (icmp(A & D) != E) into (icmp A u< D) iff B is a contiguous set of ones starting from the most significant bit (negative power of 2), D and E are equal, and D is a contiguous set of ones starting at the most significant zero bit in B.

Parameter B supports masking using undef/poison in either scalar or vector values.

Definition at line 963 of file InstCombineAndOrXor.cpp.

References A, assert(), B, Builder, llvm::APInt::countLeadingOnes(), llvm::APInt::countLeadingZeros(), D, E, I, llvm::CmpInst::ICMP_EQ, llvm::CmpInst::ICMP_NE, llvm::CmpInst::ICMP_ULT, llvm::ICmpInst::isEquality(), llvm::PatternMatch::m_APInt(), llvm::PatternMatch::m_APIntAllowUndef(), llvm::PatternMatch::m_NegatedPower2(), llvm::PatternMatch::m_ShiftedMask(), and llvm::PatternMatch::match().

Referenced by foldPowerOf2AndShiftedMask().

◆ foldNotXor()

static Instruction * foldNotXor	(	BinaryOperator &	I,
		InstCombiner::BuilderTy &	Builder
	)

static

Definition at line 4025 of file InstCombineAndOrXor.cpp.

References A, B, Builder, llvm::CallingConv::C, D, I, llvm::PatternMatch::m_And(), llvm::PatternMatch::m_Not(), llvm::PatternMatch::m_OneUse(), llvm::PatternMatch::m_Or(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::m_Xor(), llvm::PatternMatch::match(), sinkNotIntoXor(), X, and Y.

◆ foldOrToXor()

static Instruction * foldOrToXor	(	BinaryOperator &	I,
		InstCombiner::BuilderTy &	Builder
	)

static

Definition at line 1853 of file InstCombineAndOrXor.cpp.

References A, assert(), B, Builder, llvm::BinaryOperator::CreateNot(), llvm::Value::hasOneUse(), I, llvm::PatternMatch::m_And(), llvm::PatternMatch::m_c_And(), llvm::PatternMatch::m_c_Or(), llvm::PatternMatch::m_Not(), llvm::PatternMatch::m_Specific(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::m_Xor(), and llvm::PatternMatch::match().

Referenced by llvm::InstCombinerImpl::visitOr().

◆ foldPowerOf2AndShiftedMask()

static Value * foldPowerOf2AndShiftedMask	(	ICmpInst *	Cmp0,
		ICmpInst *	Cmp1,
		bool	JoinedByAnd,
		InstCombiner::BuilderTy &	Builder
	)

static

Try to fold ((icmp X u< P) & (icmp(X & M) != M)) or ((icmp X s> -1) & (icmp(X & M) != M)) into (icmp X u< M).

Where P is a power of 2, M < P, and M is a contiguous shifted mask starting at the right most significant zero bit in P. SGT is supported as when P is the largest representable power of 2, an earlier optimization converts the expression into (icmp X s> -1). Parameter P supports masking using undef/poison in either scalar or vector values.

Definition at line 1029 of file InstCombineAndOrXor.cpp.

References A, B, BMask_NotAllOnes, BMask_NotMixed, Builder, llvm::CallingConv::C, D, E, foldNegativePower2AndShiftedMask(), getMaskedTypeForICmpPair(), llvm::CmpInst::getPredicate(), and Mask_AllZeros.

◆ foldSignedTruncationCheck()

static Value * foldSignedTruncationCheck	(	ICmpInst *	ICmp0,
		ICmpInst *	ICmp1,
		Instruction &	CxtI,
		InstCombiner::BuilderTy &	Builder
	)

static

General pattern: X & Y.

Where Y is checking that all the high bits (covered by a mask 4294967168) are uniform, i.e. arg & 4294967168 can be either 4294967168 or 0 Pattern can be one of: t = add i32 arg, 128 r = icmp ult i32 t, 256 Or t0 = shl i32 arg, 24 t1 = ashr i32 t0, 24 r = icmp eq i32 t1, arg Or t0 = trunc i32 arg to i8 t1 = sext i8 t0 to i32 r = icmp eq i32 t1, arg This pattern is a signed truncation check.

And X is checking that some bit in that same mask is zero. I.e. can be one of: r = icmp sgt i32 arg, -1 Or t = and i32 arg, 2147483648 r = icmp eq i32 t, 0

Since we are checking that all the bits in that mask are the same, and a particular bit is zero, what we are really checking is that all the masked bits are zero. So this should be transformed to: r = icmp ult i32 arg, 128

Definition at line 812 of file InstCombineAndOrXor.cpp.

◆ foldUnsignedUnderflowCheck()

static Value * foldUnsignedUnderflowCheck	(	ICmpInst *	ZeroICmp,
		ICmpInst *	UnsignedICmp,
		bool	IsAnd,
		const SimplifyQuery &	Q,
		InstCombiner::BuilderTy &	Builder
	)

static

Commuted variants are assumed to be handled by calling this function again with the parameters swapped.

Definition at line 1062 of file InstCombineAndOrXor.cpp.

References A, llvm::SimplifyQuery::AC, B, llvm::sampleprof::Base, Builder, llvm::SimplifyQuery::CxtI, llvm::SimplifyQuery::DL, llvm::SimplifyQuery::DT, llvm::Value::hasOneUse(), llvm::CmpInst::ICMP_EQ, llvm::CmpInst::ICMP_NE, llvm::CmpInst::ICMP_UGE, llvm::CmpInst::ICMP_UGT, llvm::CmpInst::ICMP_ULE, llvm::CmpInst::ICMP_ULT, llvm::ICmpInst::isEquality(), llvm::isKnownNonZero(), llvm::CmpInst::isUnsigned(), llvm::PatternMatch::m_c_Add(), llvm::PatternMatch::m_c_ICmp(), llvm::PatternMatch::m_ICmp(), llvm::PatternMatch::m_Specific(), llvm::PatternMatch::m_Sub(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::m_Zero(), llvm::PatternMatch::match(), llvm::Offset, llvm::Other, and std::swap().

◆ foldXorToXor()

static Instruction * foldXorToXor	(	BinaryOperator &	I,
		InstCombiner::BuilderTy &	Builder
	)

static

A ^ B can be specified using other logic ops in a variety of patterns.

We can fold these early and efficiently by morphing an existing instruction.

Definition at line 3799 of file InstCombineAndOrXor.cpp.

References A, assert(), B, Builder, llvm::BinaryOperator::CreateNot(), llvm::Value::hasOneUse(), I, llvm::PatternMatch::m_And(), llvm::PatternMatch::m_c_And(), llvm::PatternMatch::m_c_Or(), llvm::PatternMatch::m_c_Xor(), llvm::PatternMatch::m_Deferred(), llvm::PatternMatch::m_Not(), llvm::PatternMatch::m_Or(), llvm::PatternMatch::m_Specific(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::m_Xor(), and llvm::PatternMatch::match().

Referenced by llvm::InstCombinerImpl::visitXor().

◆ freelyInvert()

static Value * freelyInvert	(	InstCombinerImpl &	IC,
		Value *	Op,
		Instruction *	IgnoredUser
	)

static

Definition at line 4100 of file InstCombineAndOrXor.cpp.

References llvm::InstCombiner::Builder, llvm::IRBuilderBase::CreateNot(), llvm::InstCombinerImpl::freelyInvertAllUsersOf(), I, and llvm::IRBuilderBase::SetInsertPoint().

Referenced by llvm::InstCombinerImpl::sinkNotIntoLogicalOp(), and llvm::InstCombinerImpl::sinkNotIntoOtherHandOfLogicalOp().

◆ getFCmpValue()

static Value * getFCmpValue	(	unsigned	Code,
		Value *	LHS,
		Value *	RHS,
		InstCombiner::BuilderTy &	Builder
	)

static

This is the complement of getFCmpCode, which turns an opcode and two operands into either a FCmp instruction, or a true/false constant.

Definition at line 41 of file InstCombineAndOrXor.cpp.

References Builder, llvm::getPredForFCmpCode(), llvm::Value::getType(), LHS, and RHS.

◆ getMaskedICmpType()

static unsigned getMaskedICmpType	(	Value *	A,
		Value *	B,
		Value *	C,
		ICmpInst::Predicate	Pred
	)

static

Return the set of patterns (from MaskedICmpType) that (icmp SCC (A & B), C) satisfies.

Definition at line 156 of file InstCombineAndOrXor.cpp.

References A, AMask_AllOnes, AMask_Mixed, AMask_NotAllOnes, AMask_NotMixed, B, BMask_AllOnes, BMask_Mixed, BMask_NotAllOnes, BMask_NotMixed, llvm::CallingConv::C, llvm::CmpInst::ICMP_EQ, llvm::APInt::isPowerOf2(), llvm::APInt::isSubsetOf(), llvm::PatternMatch::m_APInt(), Mask_AllZeros, Mask_NotAllZeros, and llvm::PatternMatch::match().

Referenced by getMaskedTypeForICmpPair().

◆ getMaskedTypeForICmpPair()

static std::optional< std::pair< unsigned, unsigned > > getMaskedTypeForICmpPair	(	Value *&	A,
		Value *&	B,
		Value *&	C,
		Value *&	D,
		Value *&	E,
		ICmpInst *	LHS,
		ICmpInst *	RHS,
		ICmpInst::Predicate &	PredL,
		ICmpInst::Predicate &	PredR
	)

static

Handle (icmp(A & B) ==/!= C) &/| (icmp(A & D) ==/!= E).

Return the pattern classes (from MaskedICmpType) for the left hand side and the right hand side as a pair. LHS and RHS are the left hand side and the right hand side ICmps and PredL and PredR are their predicates, respectively.

Definition at line 236 of file InstCombineAndOrXor.cpp.

References A, assert(), B, llvm::CallingConv::C, D, llvm::decomposeBitTestICmp(), E, llvm::Constant::getAllOnesValue(), getMaskedICmpType(), llvm::Value::getType(), llvm::ICmpInst::isEquality(), llvm::Type::isIntOrIntVectorTy(), LHS, llvm::PatternMatch::m_And(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::match(), R2, and RHS.

Referenced by foldLogOpOfMaskedICmps(), and foldPowerOf2AndShiftedMask().

◆ getNewICmpValue()

static Value * getNewICmpValue	(	unsigned	Code,
		bool	Sign,
		Value *	LHS,
		Value *	RHS,
		InstCombiner::BuilderTy &	Builder
	)

static

This is the complement of getICmpCode, which turns an opcode and two operands into either a constant true or false, or a brand new ICmp instruction.

The sign is passed in to determine which kind of predicate to use in the new icmp instruction.

Definition at line 31 of file InstCombineAndOrXor.cpp.

References Builder, llvm::getPredForICmpCode(), llvm::Value::getType(), LHS, and RHS.

◆ matchDeMorgansLaws()

static Instruction * matchDeMorgansLaws	(	BinaryOperator &	I,
		InstCombiner::BuilderTy &	Builder
	)

static

Match variations of De Morgan's Laws: (~A & ~B) == (~(A | B)) (~A | ~B) == (~(A & B))

Definition at line 1618 of file InstCombineAndOrXor.cpp.

References A, assert(), B, Builder, llvm::CallingConv::C, llvm::BinaryOperator::Create(), llvm::BinaryOperator::CreateNot(), I, llvm::InstCombiner::isFreeToInvert(), llvm::PatternMatch::m_c_BinOp(), llvm::PatternMatch::m_Not(), llvm::PatternMatch::m_OneUse(), llvm::PatternMatch::m_Value(), and llvm::PatternMatch::match().

Referenced by llvm::InstCombinerImpl::visitAnd(), and llvm::InstCombinerImpl::visitOr().

◆ matchFunnelShift()

static Instruction * matchFunnelShift	(	Instruction &	Or,
		InstCombinerImpl &	IC
	)

static

Match UB-safe variants of the funnel shift intrinsic.

Definition at line 2730 of file InstCombineAndOrXor.cpp.

Referenced by foldGuardedFunnelShift(), and llvm::InstCombinerImpl::visitOr().

◆ matchIntPart()

static std::optional< IntPart > matchIntPart ( Value * V )

static

Match an extraction of bits from an integer.

Definition at line 1145 of file InstCombineAndOrXor.cpp.

References llvm::APInt::getZExtValue(), llvm::PatternMatch::m_APInt(), llvm::PatternMatch::m_LShr(), llvm::PatternMatch::m_OneUse(), llvm::PatternMatch::m_Trunc(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::match(), llvm::APInt::ule(), X, and Y.

◆ matchIsFiniteTest()

static Value * matchIsFiniteTest	(	InstCombiner::BuilderTy &	Builder,
		FCmpInst *	LHS,
		FCmpInst *	RHS
	)

static

and (fcmp ord x, 0), (fcmp u* x, inf) -> fcmp o* x, inf

Clang emits this pattern for doing an isfinite check in __builtin_isnormal.

Definition at line 1360 of file InstCombineAndOrXor.cpp.

References Builder, llvm::CmpInst::getOrderedPredicate(), LHS, matchIsNotNaN(), matchUnorderedInfCompare(), and RHS.

◆ matchIsFPClassLikeFCmp()

static bool matchIsFPClassLikeFCmp	(	Value *	Op,
		Value *&	ClassVal,
		uint64_t &	ClassMask
	)

static

Match an fcmp against a special value that performs a test possible by llvm.is.fpclass.

Definition at line 1471 of file InstCombineAndOrXor.cpp.

References llvm::fcmpToClassTest().

◆ matchIsNotNaN()

static bool matchIsNotNaN	(	FCmpInst::Predicate	P,
		Value *	LHS,
		Value *	RHS
	)

static

Matches canonical form of isnan, fcmp ord x, 0.

Definition at line 1347 of file InstCombineAndOrXor.cpp.

References llvm::CmpInst::FCMP_ORD, llvm::PatternMatch::m_AnyZeroFP(), llvm::PatternMatch::match(), P, and RHS.

Referenced by matchIsFiniteTest().

◆ matchOrConcat()

static Instruction * matchOrConcat	(	Instruction &	Or,
		InstCombiner::BuilderTy &	Builder
	)

static

Attempt to combine or(zext(x),shl(zext(y),bw/2) concat packing patterns.

Definition at line 2832 of file InstCombineAndOrXor.cpp.

References assert(), Builder, llvm::CallingConv::C, F, llvm::Intrinsic::getDeclaration(), llvm::Type::getScalarSizeInBits(), llvm::Value::getType(), llvm::Hi, llvm::Lo, llvm::PatternMatch::m_APInt(), llvm::PatternMatch::m_BitReverse(), llvm::PatternMatch::m_BSwap(), llvm::PatternMatch::m_OneUse(), llvm::PatternMatch::m_Shl(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::m_ZExt(), llvm::PatternMatch::match(), llvm::Or, and std::swap().

Referenced by llvm::InstCombinerImpl::visitOr().

◆ matchUnorderedInfCompare()

static bool matchUnorderedInfCompare	(	FCmpInst::Predicate	P,
		Value *	LHS,
		Value *	RHS
	)

static

Matches fcmp u__ x, +/-inf.

Definition at line 1352 of file InstCombineAndOrXor.cpp.

References llvm::CmpInst::isUnordered(), llvm::PatternMatch::m_Inf(), llvm::PatternMatch::match(), P, and RHS.

Referenced by matchIsFiniteTest().

◆ reassociateFCmps()

static Instruction * reassociateFCmps	(	BinaryOperator &	BO,
		InstCombiner::BuilderTy &	Builder
	)

static

This a limited reassociation for a special case (see above) where we are checking if two values are either both NAN (unordered) or not-NAN (ordered).

This could be handled more generally in '-reassociation', but it seems like an unlikely pattern for a large number of logic ops and fcmps.

Definition at line 1573 of file InstCombineAndOrXor.cpp.

References assert(), Builder, llvm::BinaryOperator::Create(), llvm::CmpInst::FCMP_ORD, llvm::CmpInst::FCMP_UNO, llvm::BinaryOperator::getOpcode(), llvm::User::getOperand(), llvm::PatternMatch::m_AnyZeroFP(), llvm::PatternMatch::m_BinOp(), llvm::PatternMatch::m_FCmp(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::match(), std::swap(), X, and Y.

Referenced by llvm::InstCombinerImpl::visitAnd(), and llvm::InstCombinerImpl::visitOr().

◆ reassociateForUses()

static Instruction * reassociateForUses	(	BinaryOperator &	BO,
		InstCombinerImpl::BuilderTy &	Builder
	)

static

Try to reassociate a pair of binops so that values with one use only are part of the same instruction.

This may enable folds that are limited with multi-use restrictions and makes it more likely to match other patterns that are looking for a common operand.

Definition at line 2080 of file InstCombineAndOrXor.cpp.

References Builder, llvm::BinaryOperator::Create(), llvm::BinaryOperator::getOpcode(), llvm::PatternMatch::m_BinOp(), llvm::PatternMatch::m_c_BinOp(), llvm::PatternMatch::m_OneUse(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::match(), X, and Y.

Referenced by llvm::InstCombinerImpl::visitAnd(), llvm::InstCombinerImpl::visitOr(), and llvm::InstCombinerImpl::visitXor().

◆ SimplifyBSwap()

static Value * SimplifyBSwap	(	BinaryOperator &	I,
		InstCombiner::BuilderTy &	Builder
	)

static

Transform BITWISE_OP(BSWAP(A),BSWAP(B)) or BITWISE_OP(BSWAP(A), Constant) to BSWAP(BITWISE_OP(A, B))

Parameters

I	Binary operator to transform.

Returns: Pointer to node that must replace the original binary operator, or null pointer if no transformation was made.

Definition at line 54 of file InstCombineAndOrXor.cpp.

References assert(), Builder, llvm::CallingConv::C, F, llvm::ConstantInt::get(), llvm::Intrinsic::getDeclaration(), llvm::Value::hasOneUse(), I, llvm::PatternMatch::m_APInt(), llvm::PatternMatch::m_BSwap(), llvm::PatternMatch::m_Value(), and llvm::PatternMatch::match().

Referenced by llvm::InstCombinerImpl::visitAnd(), llvm::InstCombinerImpl::visitOr(), and llvm::InstCombinerImpl::visitXor().

◆ sinkNotIntoXor()

static Instruction * sinkNotIntoXor	(	BinaryOperator &	I,
		Value *	X,
		Value *	Y,
		InstCombiner::BuilderTy &	Builder
	)

static

Definition at line 4011 of file InstCombineAndOrXor.cpp.

References Builder, I, llvm::InstCombiner::isFreeToInvert(), std::swap(), X, and Y.

Referenced by foldNotXor().

◆ stripSignOnlyFPOps()

static Value * stripSignOnlyFPOps ( Value * Val )

static

Ignore all operations which only change the sign of a value, returning the underlying magnitude value.

Definition at line 1339 of file InstCombineAndOrXor.cpp.

References llvm::PatternMatch::m_CopySign(), llvm::PatternMatch::m_FAbs(), llvm::PatternMatch::m_FNeg(), llvm::PatternMatch::m_Value(), and llvm::PatternMatch::match().

◆ visitMaskedMerge()

static Instruction * visitMaskedMerge	(	BinaryOperator &	I,
		InstCombiner::BuilderTy &	Builder
	)

static

If we have a masked merge, in the canonical form of: (assuming that A only has one use.) | A | |B| ((x ^ y) & M) ^ y | D |.

If M is inverted: | D | ((x ^ y) & ~M) ^ y We can canonicalize by swapping the final xor operand to eliminate the 'not' of the mask. ((x ^ y) & M) ^ x
If M is a constant, and D has one use, we transform to 'and' / 'or' ops because that shortens the dependency chain and improves analysis: (x & M) | (y & ~M)

Definition at line 3972 of file InstCombineAndOrXor.cpp.

References B, Builder, llvm::CallingConv::C, D, llvm::Constant::getAllOnesValue(), I, LHS, llvm::PatternMatch::m_c_And(), llvm::PatternMatch::m_c_Xor(), llvm::PatternMatch::m_CombineAnd(), llvm::PatternMatch::m_Constant(), llvm::PatternMatch::m_Deferred(), llvm::PatternMatch::m_Not(), llvm::PatternMatch::m_OneUse(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::match(), llvm::Constant::replaceUndefsWith(), RHS, and X.

Referenced by llvm::InstCombinerImpl::visitXor().

Classes

Macros

Enumerations

Functions

Macro Definition Documentation

◆ DEBUG_TYPE

Enumeration Type Documentation

◆ MaskedICmpType

Function Documentation

◆ areInverseVectorBitmasks()

◆ canFreelyInvert()

◆ canNarrowShiftAmt()

◆ canonicalizeAbs()

◆ canonicalizeLogicFirst()

◆ conjugateICmpMask()

◆ decomposeBitTestICmp()

◆ extractIntPart()

◆ foldAndOrOfICmpEqConstantAndICmp()

◆ foldAndOrOfICmpsWithConstEq()

◆ foldAndToXor()

◆ foldComplexAndOrPatterns()

◆ foldIsPowerOf2()

◆ foldIsPowerOf2OrZero()

◆ foldLogicCastConstant()

◆ foldLogOpOfMaskedICmps()

◆ foldLogOpOfMaskedICmps_NotAllZeros_BMask_Mixed()

◆ foldLogOpOfMaskedICmpsAsymmetric()

◆ foldNegativePower2AndShiftedMask()

◆ foldNotXor()

◆ foldOrToXor()

◆ foldPowerOf2AndShiftedMask()

◆ foldSignedTruncationCheck()

◆ foldUnsignedUnderflowCheck()

◆ foldXorToXor()

◆ freelyInvert()

◆ getFCmpValue()

◆ getMaskedICmpType()

◆ getMaskedTypeForICmpPair()

◆ getNewICmpValue()

◆ matchDeMorgansLaws()

◆ matchFunnelShift()

◆ matchIntPart()

◆ matchIsFiniteTest()

◆ matchIsFPClassLikeFCmp()

◆ matchIsNotNaN()

◆ matchOrConcat()

◆ matchUnorderedInfCompare()

◆ reassociateFCmps()

◆ reassociateForUses()

◆ SimplifyBSwap()

◆ sinkNotIntoXor()

◆ stripSignOnlyFPOps()

◆ visitMaskedMerge()