Home
last modified time | relevance | path

Searched refs:SimplifyQuery (Results 1 – 25 of 47) sorted by relevance

12

/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DInstructionSimplify.h62 const SimplifyQuery &Q);
66 const SimplifyQuery &Q);
70 const SimplifyQuery &Q);
74 const SimplifyQuery &Q);
78 const SimplifyQuery &Q);
81 Value *simplifySRemInst(Value *LHS, Value *RHS, const SimplifyQuery &Q);
84 Value *simplifyURemInst(Value *LHS, Value *RHS, const SimplifyQuery &Q);
87 Value *simplifyFNegInst(Value *Op, FastMathFlags FMF, const SimplifyQuery &Q);
93 const SimplifyQuery &Q,
100 const SimplifyQuery &Q,
[all …]
H A DSimplifyQuery.h70 struct SimplifyQuery { struct
89 SimplifyQuery(const DataLayout &DL, const Instruction *CXTI = nullptr) argument
92 SimplifyQuery(const DataLayout &DL, const TargetLibraryInfo *TLI, argument
100 SimplifyQuery(const DataLayout &DL, const DominatorTree *DT, argument
107 SimplifyQuery getWithInstruction(const Instruction *I) const { in getWithInstruction() argument
108 SimplifyQuery Copy(*this); in getWithInstruction()
112 SimplifyQuery getWithoutUndef() const { in getWithoutUndef() argument
113 SimplifyQuery Copy(*this); in getWithoutUndef()
122 SimplifyQuery getWithoutDomCondCache() const { in getWithoutDomCondCache() argument
123 SimplifyQuery Copy(*this); in getWithoutDomCondCache()
[all …]
H A DValueTracking.h80 unsigned Depth, const SimplifyQuery &Q);
83 const SimplifyQuery &Q);
86 const SimplifyQuery &Q);
95 unsigned Depth, const SimplifyQuery &Q);
101 unsigned Depth, const SimplifyQuery &SQ);
107 const SimplifyQuery &Q);
112 const SimplifyQuery &SQ);
136 bool isKnownNonZero(const Value *V, const SimplifyQuery &Q, unsigned Depth = 0);
153 bool isKnownNonNegative(const Value *V, const SimplifyQuery &SQ,
158 bool isKnownPositive(const Value *V, const SimplifyQuery &SQ,
[all …]
H A DInstSimplifyFolder.h36 SimplifyQuery SQ;
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DInstructionSimplify.cpp56 static Value *simplifyAndInst(Value *, Value *, const SimplifyQuery &,
58 static Value *simplifyUnOp(unsigned, Value *, const SimplifyQuery &, unsigned);
60 const SimplifyQuery &, unsigned);
61 static Value *simplifyBinOp(unsigned, Value *, Value *, const SimplifyQuery &,
64 const SimplifyQuery &, unsigned);
65 static Value *simplifyCmpInst(unsigned, Value *, Value *, const SimplifyQuery &,
68 const SimplifyQuery &Q, unsigned MaxRecurse);
69 static Value *simplifyOrInst(Value *, Value *, const SimplifyQuery &, unsigned);
70 static Value *simplifyXorInst(Value *, Value *, const SimplifyQuery &,
72 static Value *simplifyCastInst(unsigned, Value *, Type *, const SimplifyQuery &,
[all …]
H A DValueTracking.cpp152 const SimplifyQuery &Q);
155 const SimplifyQuery &Q) { in computeKnownBits()
171 SimplifyQuery(DL, DT, AC, safeCxtI(V, CxtI), UseInstrInfo)); in computeKnownBits()
179 V, Depth, SimplifyQuery(DL, DT, AC, safeCxtI(V, CxtI), UseInstrInfo)); in computeKnownBits()
188 SimplifyQuery(DL, DT, AC, safeCxtI(V, CxtI), UseInstrInfo)); in computeKnownBits()
192 const SimplifyQuery &SQ) { in haveNoCommonBitsSetSpecialCases()
238 const SimplifyQuery &SQ) { in haveNoCommonBitsSet()
270 const SimplifyQuery &Q);
278 SimplifyQuery(DL, DT, AC, safeCxtI(V, CxtI), UseInstrInfo)); in isKnownToBeAPowerOfTwo()
282 const SimplifyQuery &Q, unsigned Depth);
[all …]
H A DLoads.cpp103 isKnownNonZero(V, SimplifyQuery(DL, DT, AC, CtxI))) { in isDereferenceableAndAlignedPointer()
137 isKnownNonZero(V, SimplifyQuery(DL, DT, AC, CtxI)) && in isDereferenceableAndAlignedPointer()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DLoopRotationUtils.h24 struct SimplifyQuery;
35 MemorySSAUpdater *MSSAU, const SimplifyQuery &SQ,
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DInstSimplifyPass.cpp28 static bool runImpl(Function &F, const SimplifyQuery &SQ) { in runImpl()
103 const SimplifyQuery SQ(DL, TLI, DT, AC); in runOnFunction()
129 const SimplifyQuery SQ(DL, &TLI, &DT, &AC); in run()
H A DLoopRotation.cpp73 const SimplifyQuery SQ = getBestSimplifyQuery(AR, DL); in run()
H A DLoopInstSimplify.cpp49 SimplifyQuery SQ(DL, &TLI, &DT, &AC); in simplifyLoopInst()
H A DLoopDeletion.cpp178 const SimplifyQuery &SQ) { in getValueOnFirstIteration()
303 const SimplifyQuery SQ(DL); in canProveExitOnFirstIteration()
H A DNaryReassociate.cpp362 SimplifyQuery SQ(*DL, DT, AC, GEP); in tryReassociateGEPAtIndex()
405 if (isKnownNonNegative(LHS, SimplifyQuery(*DL, DT, AC, GEP)) && in tryReassociateGEPAtIndex()
H A DReassociate.cpp541 Flags.AllKnownNonNegative &= isKnownNonNegative(V, SimplifyQuery(DL)); in LinearizeExprTree()
547 Flags.AllKnownNonZero &= isKnownNonZero(V, SimplifyQuery(DL)); in LinearizeExprTree()
549 Flags.AllKnownNonNegative &= isKnownNonNegative(V, SimplifyQuery(DL)); in LinearizeExprTree()
2190 SimplifyQuery(I->getDataLayout(), in OptimizeInst()
H A DCorrelatedValuePropagation.cpp257 const SimplifyQuery &SQ) { in processPHI()
1208 const SimplifyQuery &SQ) { in runImpl()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineInternal.h121 BinaryOperator *Sh0, const SimplifyQuery &SQ,
552 const SimplifyQuery &Q);
556 unsigned Depth, const SimplifyQuery &Q) override;
564 const SimplifyQuery &Q);
669 Instruction *foldICmpBinOp(ICmpInst &Cmp, const SimplifyQuery &SQ);
686 const SimplifyQuery &Q);
H A DInstCombineShifts.cpp59 BinaryOperator *Sh0, const SimplifyQuery &SQ, in reassociateShiftAmtsOfTwoSameDirectionShifts()
190 const SimplifyQuery &Q, in dropRedundantMaskingOfLeftShiftInput()
966 static bool setShiftFlags(BinaryOperator &I, const SimplifyQuery &Q) { in setShiftFlags()
1020 const SimplifyQuery Q = SQ.getWithInstruction(&I); in visitShl()
1575 const SimplifyQuery Q = SQ.getWithInstruction(&I); in visitLShr()
1760 const SimplifyQuery Q = SQ.getWithInstruction(&I); in visitAShr()
H A DInstCombineCompares.cpp1253 const SimplifyQuery Q = SQ.getWithInstruction(&Cmp); in foldICmpWithZero()
1498 const SimplifyQuery &Q) { in foldICmpTruncWithTruncOrExt()
3118 const SimplifyQuery Q = SQ.getWithInstruction(&Cmp); in foldICmpAddConstant()
3572 const SimplifyQuery &Q) { in foldCtpopPow2Test()
3999 const SimplifyQuery Q = SQ.getWithInstruction(&Cmp); in foldICmpIntrinsicWithConstant()
4182 static bool isMaskOrZero(const Value *V, bool Not, const SimplifyQuery &Q, in isMaskOrZero()
4290 Value *Op1, const SimplifyQuery &Q, in foldICmpWithLowBitMaskedVal()
4493 foldShiftIntoShiftInAnotherHandOfAndInICmp(ICmpInst &I, const SimplifyQuery SQ, in foldShiftIntoShiftInAnotherHandOfAndInICmp()
4769 static Instruction *foldICmpAndXX(ICmpInst &I, const SimplifyQuery &Q, in foldICmpAndXX()
4831 static Instruction *foldICmpOrXX(ICmpInst &I, const SimplifyQuery &Q, in foldICmpOrXX()
[all …]
H A DInstCombineSimplifyDemanded.cpp92 const SimplifyQuery &Q) { in SimplifyDemandedBits()
161 const SimplifyQuery &Q) { in SimplifyDemandedUseBits()
1142 const SimplifyQuery &Q) { in SimplifyMultipleUseDemandedBits()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/InstCombine/
H A DInstCombiner.h76 SimplifyQuery SQ;
342 const SimplifyQuery &getSimplifyQuery() const { return SQ; } in getSimplifyQuery()
507 unsigned Depth, const SimplifyQuery &Q) = 0;
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopRotationUtils.cpp68 const SimplifyQuery &SQ;
77 const SimplifyQuery &SQ, bool RotationOnly, bool IsUtilMode, in LoopRotate()
1083 const SimplifyQuery &SQ, bool RotationOnly = true, in LoopRotation()
H A DPromoteMemoryToRegister.cpp355 const SimplifyQuery SQ;
475 !isKnownNonZero(Val, SimplifyQuery(DL, DT, AC, LI))) in convertMetadataToAssumes()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DFunctionSpecialization.cpp472 simplifyBinOp(I.getOpcode(), Other, Const, SimplifyQuery(DL)) in visitBinaryOperator()
473 : simplifyBinOp(I.getOpcode(), Const, Other, SimplifyQuery(DL))); in visitBinaryOperator()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPULibCalls.cpp621 return isKnownNeverInfinity(I, /*Depth=*/0, SimplifyQuery(DL)); in isKnownIntegral()
633 isKnownNeverInfOrNaN(I, /*Depth=*/0, SimplifyQuery(DL)); in isKnownIntegral()
772 SimplifyQuery(M->getDataLayout(), TLInfo, DT, AC, Call))) { in fold()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DSLPVectorizer.cpp8719 bool IsSigned = !isKnownNonNegative(V, SimplifyQuery(*R.DL)); in createShuffle()
11633 V, Ty, !isKnownNonNegative(Scalar, SimplifyQuery(*DL))); in gather()
11773 V2, V1->getType(), !isKnownNonNegative(V2, SimplifyQuery(DL))); in createShuffleVector()
11776 V1, V2->getType(), !isKnownNonNegative(V1, SimplifyQuery(DL))); in createShuffleVector()
11861 IsSigned.value_or(!isKnownNonNegative(V, SimplifyQuery(*R.DL)))); in castToScalarTyElem()
12022 V, SimplifyQuery(*R.DL)); in add()
12028 V, SimplifyQuery(*R.DL)); in add()
12039 V, SimplifyQuery(*R.DL)); in add()
12819 return !isKnownNonNegative(R, SimplifyQuery(*DL)); in vectorizeTree()
13802 !isKnownNonNegative(EE->getVectorOperand(), SimplifyQuery(*D in vectorizeTree()
[all...]

12