/external/llvm/unittests/IR/ |
D | IRBuilderTest.cpp | 135 Instruction *FDiv, *FAdd; in TEST_F() local 142 FAdd = cast<Instruction>(F); in TEST_F() 143 EXPECT_FALSE(FAdd->hasNoNaNs()); in TEST_F() 157 FAdd = cast<Instruction>(F); in TEST_F() 158 EXPECT_TRUE(FAdd->hasNoNaNs()); in TEST_F() 161 F = Builder.CreateBinOp(Instruction::FAdd, F, F); in TEST_F() 164 FAdd = cast<Instruction>(F); in TEST_F() 165 EXPECT_TRUE(FAdd->hasNoNaNs()); in TEST_F() 200 FAdd->setHasAllowReciprocal(false); in TEST_F() 201 FDiv->copyFastMathFlags(FAdd); in TEST_F()
|
/external/llvm/lib/Transforms/Scalar/ |
D | Float2Int.cpp | 119 case Instruction::FAdd: return Instruction::Add; in mapBinOpcode() 216 case Instruction::FAdd: in walkBackwards() 256 case Instruction::FAdd: in walkForwards() 489 case Instruction::FAdd: in convert()
|
D | Reassociate.cpp | 449 if (Opcode == Instruction::Add || Opcode == Instruction::FAdd) { in IncorporateWeight() 936 isReassociableOp(V, Instruction::Add, Instruction::FAdd)) { in NegateValue() 1002 if (isReassociableOp(V0, Instruction::Add, Instruction::FAdd) || in ShouldBreakUpSubtract() 1006 if (isReassociableOp(V1, Instruction::Add, Instruction::FAdd) || in ShouldBreakUpSubtract() 1011 (isReassociableOp(VB, Instruction::Add, Instruction::FAdd) || in ShouldBreakUpSubtract() 1929 case Instruction::FAdd: in OptimizeExpression() 2006 if (UserOpcode != Instruction::Add && UserOpcode != Instruction::FAdd && in canonicalizeNegConstExpr() 2042 case Instruction::FAdd: in canonicalizeNegConstExpr() 2164 if (BO->hasOneUse() && BO->getOpcode() == Instruction::FAdd && in OptimizeInst() 2224 Instruction::FAdd && in ReassociateExpression()
|
D | SCCP.cpp | 1315 case Instruction::FAdd: in ResolvedUndefsIn()
|
/external/llvm/lib/IR/ |
D | Instruction.cpp | 197 case FAdd: return "fadd"; in getOpcodeName() 480 case FAdd: in isAssociative() 497 case FAdd: in isCommutative()
|
/external/llvm/lib/Target/Mips/ |
D | MipsOs16.cpp | 84 case Instruction::FAdd: in needsFP()
|
/external/llvm/lib/Transforms/InstCombine/ |
D | InstCombineAddSub.cpp | 160 Value *simplify(Instruction *FAdd); 359 if (Opcode == Instruction::FAdd || Opcode == Instruction::FSub) { in drillValueDownOneStep() 441 assert((I->getOpcode() == Instruction::FAdd || in performFactorization() 494 Value *NewAddSub = (I->getOpcode() == Instruction::FAdd) ? in performFactorization() 524 assert((I->getOpcode() == Instruction::FAdd || in simplify()
|
D | InstCombineVectorOps.cpp | 611 case Instruction::FAdd: in CanEvaluateShuffled() 674 case Instruction::FAdd: in BuildNew() 774 case Instruction::FAdd: in EvaluateInDifferentElementOrder()
|
D | InstCombineSelect.cpp | 1089 FI->getOpcode() == Instruction::FAdd)) { in visitSelectInst() 1094 TI->getOpcode() == Instruction::FAdd)) { in visitSelectInst()
|
D | InstCombineMulDivRem.cpp | 571 (FAddSub->getOpcode() == Instruction::FAdd || in visitFMul() 593 Instruction *RI = (FAddSub->getOpcode() == Instruction::FAdd) in visitFMul()
|
/external/llvm/lib/ExecutionEngine/ |
D | ExecutionEngine.cpp | 759 case Instruction::FAdd: in getConstantValue() 794 case Instruction::FAdd: in getConstantValue() 809 case Instruction::FAdd: in getConstantValue() 828 case Instruction::FAdd: in getConstantValue()
|
/external/llvm/include/llvm/IR/ |
D | Instruction.def | 109 HANDLE_BINARY_INST( 9, FAdd , BinaryOperator)
|
D | PatternMatch.h | 440 inline BinaryOp_match<LHS, RHS, Instruction::FAdd> m_FAdd(const LHS &L, in m_FAdd() 442 return BinaryOp_match<LHS, RHS, Instruction::FAdd>(L, R); in m_FAdd()
|
/external/llvm/lib/Transforms/Vectorize/ |
D | SLPVectorizer.cpp | 137 case Instruction::FAdd: in getAltOpcode() 140 return Instruction::FAdd; in getAltOpcode() 154 if (Op == Instruction::FAdd || Op == Instruction::FSub || in canCombineAsAltInst() 1214 case Instruction::FAdd: in buildTree_rec() 1478 case Instruction::FAdd: in getEntryCost() 2239 case Instruction::FAdd: in vectorizeTree() 3581 ReductionOpcode != Instruction::FAdd) in matchAssociativeReduction() 3722 if (Opcode == Instruction::FAdd) in createBinOp()
|
D | LoopVectorize.cpp | 2516 return Instruction::FAdd; in getReductionBinOp() 3173 case Instruction::FAdd: in vectorizeBlockInLoop() 4308 case Instruction::FAdd: in isReductionInstr() 5023 case Instruction::FAdd: in getInstructionCost()
|
/external/llvm/lib/Analysis/ |
D | CostModel.cpp | 397 case Instruction::FAdd: in getInstructionCost()
|
D | InstructionSimplify.cpp | 794 return ConstantFoldInstOperands(Instruction::FAdd, CLHS->getType(), in SimplifyFAddInst() 3433 case Instruction::FAdd: in SimplifyBinOp() 3500 case Instruction::FAdd: in SimplifyFPBinOp() 3640 case Instruction::FAdd: in SimplifyInstruction()
|
D | ValueTracking.cpp | 2242 if (I->getOpcode() == Instruction::FAdd) in CannotBeNegativeZero() 2294 case Instruction::FAdd: in CannotBeOrderedLessThanZero()
|
/external/llvm/lib/Transforms/ObjCARC/ |
D | ARCInstKind.cpp | 266 case Instruction::FAdd: in GetARCInstKind()
|
/external/llvm/test/Transforms/Reassociate/ |
D | fast-basictest.ll | 277 ; opportunites for FAdd reassociation.
|
/external/llvm/lib/Target/CppBackend/ |
D | CPPBackend.cpp | 870 case Instruction::FAdd: Out << "getFAdd("; break; in printConstant() 1218 case Instruction::FAdd: in printInstruction() 1238 case Instruction::FAdd: Out << "Instruction::FAdd"; break; in printInstruction()
|
/external/llvm/include/llvm/CodeGen/ |
D | BasicTTIImpl.h | 659 ->getArithmeticInstrCost(BinaryOperator::FAdd, RetTy); in getIntrinsicInstrCost()
|
/external/llvm/lib/AsmParser/ |
D | LLLexer.cpp | 701 INSTKEYWORD(add, Add); INSTKEYWORD(fadd, FAdd); in LexIdentifier()
|
/external/llvm/lib/ExecutionEngine/Interpreter/ |
D | Execution.cpp | 743 case Instruction::FAdd: FLOAT_VECTOR_OP(+) break; in visitBinaryOperator() 773 case Instruction::FAdd: executeFAddInst(R, Src1, Src2, Ty); break; in visitBinaryOperator() 2029 case Instruction::FAdd: executeFAddInst(Dest, Op0, Op1, Ty); break; in getConstantExprValue()
|
/external/llvm/tools/llvm-stress/ |
D | llvm-stress.cpp | 342 case 0:{Op = (isFloat?Instruction::FAdd : Instruction::Add); break; } in Act()
|