Searched refs:isFast (Results 1 – 11 of 11) sorted by relevance
74 bool isFast() const { return all(); } in isFast() function
241 bool isFast() const { in isFast() function
464 bool isFast() const LLVM_READONLY;
1773 if (!CI->isFast()) in optimizeCAbs()1881 if (BaseFn && BaseFn->hasOneUse() && BaseFn->isFast() && Pow->isFast()) { in replacePowWithExp()2279 if (!Log->isFast() || !Arg || !Arg->isFast() || !Arg->hasOneUse()) in optimizeLog()2430 if (!CI->isFast()) in optimizeSqrt()2434 if (!I || I->getOpcode() != Instruction::FMul || !I->isFast()) in optimizeSqrt()2456 if (OtherMul0 == OtherMul1 && cast<Instruction>(Op0)->isFast()) { in optimizeSqrt()2502 if (!CI->isFast() || !OpC->isFast()) in optimizeTan()3580 else if (isa<FPMathOperator>(CI) && CI->isFast()) in optimizeCall()
299 bool Instruction::isFast() const { in isFast() function in Instruction301 return cast<FPMathOperator>(this)->isFast(); in isFast()
751 I1->isFast()) in isConditionalRdxPattern()754 if (m_FMul(m_Value(Op1), m_Value(Op2)).match(I1) && (I1->isFast())) in isConditionalRdxPattern()
2199 void IncrementPasteCounter(bool isFast) { in IncrementPasteCounter() argument2200 if (isFast) in IncrementPasteCounter()
857 !I.isFast()) { in canVectorizeInstrs()
449 if (Op->isFast()) in isUnsafeMath()
740 if (I.isFast()) { in visitFMul()
1924 if (II->isFast()) { in visitCallInst()