Searched refs:isFast (Results 1 – 11 of 11) sorted by relevance
73 bool isFast() const { return all(); } in isFast() function
241 bool isFast() const { in isFast() function
562 bool isFast() const LLVM_READONLY;
1883 if (!CI->isFast()) in optimizeCAbs()1991 if (BaseFn && BaseFn->hasOneUse() && BaseFn->isFast() && Pow->isFast()) { in replacePowWithExp()2398 if (!Log->isFast() || !Arg || !Arg->isFast() || !Arg->hasOneUse()) in optimizeLog()2553 if (!CI->isFast()) in optimizeSqrt()2557 if (!I || I->getOpcode() != Instruction::FMul || !I->isFast()) in optimizeSqrt()2579 if (OtherMul0 == OtherMul1 && cast<Instruction>(Op0)->isFast()) { in optimizeSqrt()2625 if (!CI->isFast() || !OpC->isFast()) in optimizeTan()3709 else if (isa<FPMathOperator>(CI) && CI->isFast()) in optimizeCall()
494 bool Instruction::isFast() const { in isFast() function in Instruction496 return cast<FPMathOperator>(this)->isFast(); in isFast()
751 I1->isFast()) || in isConditionalRdxPattern()752 (m_FMul(m_Value(Op1), m_Value(Op2)).match(I1) && (I1->isFast())) || in isConditionalRdxPattern()
2197 void IncrementPasteCounter(bool isFast) { in IncrementPasteCounter() argument2198 if (isFast) in IncrementPasteCounter()
1008 !I.isFast()) { in canVectorizeInstrs()
422 return UnsafeFPMath || FPOp->isFast(); in isUnsafeMath()
800 if (I.isFast()) { in visitFMul()
2356 if (II->isFast()) { in visitCallInst()