| /external/llvm/lib/Analysis/ |
| InstructionSimplify.cpp | 63 static Value *SimplifyBinOp(unsigned, Value *, Value *, const Query &,
153 if (Value *L = SimplifyBinOp(Opcode, A, C, Q, MaxRecurse))
154 if (Value *R = SimplifyBinOp(Opcode, B, C, Q, MaxRecurse)) {
163 if (Value *V = SimplifyBinOp(OpcodeToExpand, L, R, Q, MaxRecurse)) {
176 if (Value *L = SimplifyBinOp(Opcode, A, B, Q, MaxRecurse))
177 if (Value *R = SimplifyBinOp(Opcode, A, C, Q, MaxRecurse)) {
186 if (Value *V = SimplifyBinOp(OpcodeToExpand, L, R, Q, MaxRecurse)) {
217 if (Value *V = SimplifyBinOp(Opcode, B, C, Q, MaxRecurse)) {
222 if (Value *W = SimplifyBinOp(Opcode, A, V, Q, MaxRecurse)) {
236 if (Value *V = SimplifyBinOp(Opcode, A, B, Q, MaxRecurse))
[all...] |
| InlineCost.cpp | 649 SimpleV = SimplifyBinOp(I.getOpcode(), LHS, RHS, DL);
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstructionCombining.cpp | 212 if (Value *V = SimplifyBinOp(Opcode, B, C, DL)) {
220 // Note: this is only valid because SimplifyBinOp doesn't look at
241 if (Value *V = SimplifyBinOp(Opcode, A, B, DL)) {
263 if (Value *V = SimplifyBinOp(Opcode, C, A, DL)) {
283 if (Value *V = SimplifyBinOp(Opcode, C, A, DL)) {
481 V = SimplifyBinOp(TopLevelOpcode, B, D, DL);
500 V = SimplifyBinOp(TopLevelOpcode, A, C, DL);
592 if (Value *L = SimplifyBinOp(TopLevelOpcode, A, C, DL))
593 if (Value *R = SimplifyBinOp(TopLevelOpcode, B, C, DL)) {
601 if (Value *V = SimplifyBinOp(InnerOpcode, L, R, DL)
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| InstructionSimplify.h | 285 /// SimplifyBinOp - Given operands for a BinaryOperator, see if we can
287 Value *SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS,
295 /// In contrast to SimplifyBinOp, try to use FastMathFlag when folding the
296 /// result. In case we don't need FastMathFlags, simply fall to SimplifyBinOp.
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopUnrollPass.cpp | 388 SimpleV = SimplifyBinOp(I.getOpcode(), LHS, RHS, DL);
[all...] |
