Searched refs:isFast (Results 1 – 10 of 10) sorted by relevance
73 bool isFast() const { return all(); } in isFast() function
273 bool isFast() const {
597 bool isFast() const LLVM_READONLY;
1966 if (!CI->isFast()) in optimizeCAbs()2001 if (!CI->isFast()) in optimizeCAbs()2060 if (BaseFn && BaseFn->hasOneUse() && BaseFn->isFast() && Pow->isFast()) { in replacePowWithExp()2492 if (!Log->isFast() || !Arg || !Arg->isFast() || !Arg->hasOneUse()) in optimizeLog()2712 if (!CI->isFast()) in optimizeSqrt()2716 if (!I || I->getOpcode() != Instruction::FMul || !I->isFast()) in optimizeSqrt()2738 if (OtherMul0 == OtherMul1 && cast<Instruction>(Op0)->isFast()) { in optimizeSqrt()2786 if (!CI->isFast() || !OpC->isFast()) in optimizeTrigInversionPairs()3959 else if (isa<FPMathOperator>(CI) && CI->isFast()) in optimizeCall()
570 bool Instruction::isFast() const { in isFast() function in Instruction572 return cast<FPMathOperator>(this)->isFast(); in isFast()
750 I1->isFast()) || in isConditionalRdxPattern()751 (m_FMul(m_Value(Op1), m_Value(Op2)).match(I1) && (I1->isFast())) || in isConditionalRdxPattern()
2223 void IncrementPasteCounter(bool isFast) { in IncrementPasteCounter() argument2224 if (isFast) in IncrementPasteCounter()
1008 !I.isFast()) { in canVectorizeInstrs()
423 return UnsafeFPMath || FPOp->isFast(); in isUnsafeMath()
937 if (I.isFast()) { in visitFMul()