| /freebsd-12.1/contrib/llvm/include/llvm/Analysis/ |
| H A D | IVDescriptors.h | 312 return InductionBinOp && !cast<FPMathOperator>(InductionBinOp)->isFast(); in hasUnsafeAlgebra()
318 if (!InductionBinOp || cast<FPMathOperator>(InductionBinOp)->isFast()) in getUnsafeAlgebraInst()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Utils/ |
| H A D | SimplifyLibCalls.cpp | 1104 if (!CI->isFast()) in optimizeCAbs()
1216 if (BaseFn && BaseFn->hasOneUse() && BaseFn->isFast() && Pow->isFast()) { in replacePowWithExp()
1421 if (Pow->isFast() && match(Expo, m_APFloat(ExpoF))) { in optimizePow()
1531 if (CI->isFast()) { in optimizeFMinFMax()
1564 if (!CI->isFast()) in optimizeLog()
1570 if (!OpC || !OpC->isFast()) in optimizeLog()
1612 if (!CI->isFast()) in optimizeSqrt()
1616 if (!I || I->getOpcode() != Instruction::FMul || !I->isFast()) in optimizeSqrt()
1638 if (OtherMul0 == OtherMul1 && cast<Instruction>(Op0)->isFast()) { in optimizeSqrt()
1684 if (!CI->isFast() || !OpC->isFast()) in optimizeTan()
[all …]
|
| /freebsd-12.1/contrib/llvm/include/llvm/IR/ |
| H A D | Operator.h | 207 bool isFast() const { return all(); } in isFast() function
311 bool isFast() const { in isFast() function
|
| H A D | Instruction.h | 384 bool isFast() const;
|
| /freebsd-12.1/contrib/llvm/lib/CodeGen/ |
| H A D | ExpandReductions.cpp | 98 if (!II->getFastMathFlags().isFast()) in expandReductions()
|
| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | IVDescriptors.cpp | 541 I1->isFast()) in isConditionalRdxPattern()
544 if (m_FMul(m_Value(Op1), m_Value(Op2)).match(I1) && (I1->isFast())) in isConditionalRdxPattern()
555 if (!UAI && FP && !I->isFast()) in isRecurrenceInstr()
|
| /freebsd-12.1/contrib/llvm/lib/IR/ |
| H A D | Instruction.cpp | 193 bool Instruction::isFast() const { in isFast() function in Instruction
195 return cast<FPMathOperator>(this)->isFast(); in isFast()
|
| H A D | AsmWriter.cpp | 1246 if (FPO->isFast()) in WriteOptimizationInfo()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/ |
| H A D | Reassociate.cpp | 151 if (!isa<FPMathOperator>(I) || I->isFast()) in isReassociableOp()
161 if (!isa<FPMathOperator>(I) || I->isFast()) in isReassociableOp()
570 !cast<Instruction>(Op)->isFast())) && in LinearizeExprTree()
2031 if (I->getType()->isFPOrFPVectorTy() && !I->isFast()) in OptimizeInst()
|
| /freebsd-12.1/contrib/llvm/include/llvm/CodeGen/ |
| H A D | SelectionDAGNodes.h | 456 bool isFast() const {
957 bool isFast() { return Flags.isFast(); }
|
| /freebsd-12.1/contrib/llvm/tools/clang/include/clang/Lex/ |
| H A D | Preprocessor.h | 1715 void IncrementPasteCounter(bool isFast) { in IncrementPasteCounter() argument
1716 if (isFast) in IncrementPasteCounter()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopVectorizationLegality.cpp | 784 !I.isFast()) { in canVectorizeInstrs()
|
| H A D | SLPVectorizer.cpp | 5321 cast<Instruction>(I->getOperand(0))->isFast(); in isAssociative()
|
| /freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUCodeGenPrepare.cpp | 429 bool UnsafeDiv = HasUnsafeFPMath || FMF.isFast() || in visitFDiv()
|
| H A D | AMDGPULibCalls.cpp | 490 if (Op->isFast()) in isUnsafeMath()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/InstCombine/ |
| H A D | InstCombineMulDivRem.cpp | 465 if (I.isFast()) { in visitFMul()
|
| H A D | InstCombineCalls.cpp | 2205 if (II->isFast()) { in visitCallInst()
|
| /freebsd-12.1/contrib/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | SelectionDAGBuilder.cpp | 2707 if (FPOp->getFastMathFlags().isFast()) in isVectorReductionOp()
2757 if (!isa<PHINode>(FPOp) && !FPOp->getFastMathFlags().isFast()) in isVectorReductionOp()
8357 if (FMF.isFast()) in visitVectorReduce()
8363 if (FMF.isFast()) in visitVectorReduce()
|