Home
last modified time | relevance | path

Searched refs:SimplifyBinOp (Results 1 – 10 of 10) sorted by relevance

/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DLoopUnrollAnalyzer.cpp87 SimplifyBinOp(I.getOpcode(), LHS, RHS, FI->getFastMathFlags(), DL); in visitBinaryOperator()
89 SimpleV = SimplifyBinOp(I.getOpcode(), LHS, RHS, DL); in visitBinaryOperator()
H A DInstructionSimplify.cpp267 Value *S = SimplifyBinOp(OpcodeToExpand, L, R, Q, MaxRecurse); in expandBinOp()
315 if (Value *V = SimplifyBinOp(Opcode, B, C, Q, MaxRecurse)) { in SimplifyAssociativeBinOp()
320 if (Value *W = SimplifyBinOp(Opcode, A, V, Q, MaxRecurse)) { in SimplifyAssociativeBinOp()
334 if (Value *V = SimplifyBinOp(Opcode, A, B, Q, MaxRecurse)) { in SimplifyAssociativeBinOp()
339 if (Value *W = SimplifyBinOp(Opcode, V, C, Q, MaxRecurse)) { in SimplifyAssociativeBinOp()
357 if (Value *V = SimplifyBinOp(Opcode, C, A, Q, MaxRecurse)) { in SimplifyAssociativeBinOp()
376 if (Value *V = SimplifyBinOp(Opcode, C, A, Q, MaxRecurse)) { in SimplifyAssociativeBinOp()
546 SimplifyBinOp(Opcode, Incoming, RHS, Q, MaxRecurse) : in ThreadBinOpOverPHI()
547 SimplifyBinOp(Opcode, LHS, Incoming, Q, MaxRecurse); in ThreadBinOpOverPHI()
5294 return SimplifyBinOp(Opcode, LHS, RHS, Q, MaxRecurse); in SimplifyBinOp()
[all …]
H A DInlineCost.cpp1892 SimpleV = SimplifyBinOp(I.getOpcode(), CLHS ? CLHS : LHS, CRHS ? CRHS : RHS, in visitBinaryOperator()
1896 SimplifyBinOp(I.getOpcode(), CLHS ? CLHS : LHS, CRHS ? CRHS : RHS, DL); in visitBinaryOperator()
H A DLazyValueInfo.cpp1275 SimplifyBinOp(BO->getOpcode(), LHS, RHS, DL))) { in constantFoldUser()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DInstructionSimplify.h294 Value *SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS,
299 Value *SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS, FastMathFlags FMF,
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstructionCombining.cpp639 V = SimplifyBinOp(TopLevelOpcode, B, D, SQ.getWithInstruction(&I)); in tryFactorization()
767 Value *L = SimplifyBinOp(TopLevelOpcode, A, C, SQDistributive); in SimplifyUsingDistributiveLaws()
768 Value *R = SimplifyBinOp(TopLevelOpcode, B, C, SQDistributive); in SimplifyUsingDistributiveLaws()
806 Value *L = SimplifyBinOp(TopLevelOpcode, A, B, SQDistributive); in SimplifyUsingDistributiveLaws()
807 Value *R = SimplifyBinOp(TopLevelOpcode, A, C, SQDistributive); in SimplifyUsingDistributiveLaws()
863 True = SimplifyBinOp(Opcode, B, E, FMF, Q); in SimplifySelectsFeedingBinaryOp()
864 False = SimplifyBinOp(Opcode, C, F, FMF, Q); in SimplifySelectsFeedingBinaryOp()
875 True = SimplifyBinOp(Opcode, B, RHS, FMF, Q); in SimplifySelectsFeedingBinaryOp()
876 False = SimplifyBinOp(Opcode, C, RHS, FMF, Q); in SimplifySelectsFeedingBinaryOp()
880 True = SimplifyBinOp(Opcode, LHS, E, FMF, Q); in SimplifySelectsFeedingBinaryOp()
[all …]
H A DInstCombineAndOrXor.cpp3087 if (Value *OrICmp = SimplifyBinOp(Instruction::Or, LHS, RHS, SQ)) { in foldXorOfICmps()
3090 if (Value *AndICmp = SimplifyBinOp(Instruction::And, LHS, RHS, SQ)) { in foldXorOfICmps()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopDeletion.cpp193 FirstIterV = SimplifyBinOp(BO->getOpcode(), LHS, RHS, SQ); in getValueOnFirstIteration()
H A DNewGVN.cpp1090 Value *V = SimplifyBinOp(Opcode, E->getOperand(0), E->getOperand(1), SQ); in createBinaryExpression()
1189 SimplifyBinOp(E->getOpcode(), E->getOperand(0), E->getOperand(1), SQ); in createExpression()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSCCPSolver.cpp977 Value *R = SimplifyBinOp(I.getOpcode(), V1, V2, SimplifyQuery(DL)); in visitBinaryOperator()