/external/llvm/lib/Analysis/ |
InstructionSimplify.cpp | 54 static Value *SimplifyBinOp(unsigned, Value *, Value *, const Query &, 142 if (Value *L = SimplifyBinOp(Opcode, A, C, Q, MaxRecurse)) 143 if (Value *R = SimplifyBinOp(Opcode, B, C, Q, MaxRecurse)) { 152 if (Value *V = SimplifyBinOp(OpcodeToExpand, L, R, Q, MaxRecurse)) { 165 if (Value *L = SimplifyBinOp(Opcode, A, B, Q, MaxRecurse)) 166 if (Value *R = SimplifyBinOp(Opcode, A, C, Q, MaxRecurse)) { 175 if (Value *V = SimplifyBinOp(OpcodeToExpand, L, R, Q, MaxRecurse)) { 215 if (Value *V = SimplifyBinOp(Opcode, B, DD, Q, MaxRecurse)) { 224 if (Value *W = SimplifyBinOp(OpcodeToExtract, A, V, Q, MaxRecurse)) { 238 if (Value *V = SimplifyBinOp(Opcode, A, CC, Q, MaxRecurse)) [all...] |
InlineCost.cpp | 583 Value *SimpleV = SimplifyBinOp(I.getOpcode(), LHS, RHS, TD); [all...] |
/external/llvm/lib/Transforms/InstCombine/ |
InstructionCombining.cpp | 199 if (Value *V = SimplifyBinOp(Opcode, B, C, TD)) { 207 // Note: this is only valid because SimplifyBinOp doesn't look at 228 if (Value *V = SimplifyBinOp(Opcode, A, B, TD)) { 250 if (Value *V = SimplifyBinOp(Opcode, C, A, TD)) { 270 if (Value *V = SimplifyBinOp(Opcode, C, A, TD)) { 397 Value *V = SimplifyBinOp(TopLevelOpcode, B, D, TD); 419 Value *V = SimplifyBinOp(TopLevelOpcode, A, C, TD); 441 if (Value *L = SimplifyBinOp(TopLevelOpcode, A, C, TD)) 442 if (Value *R = SimplifyBinOp(TopLevelOpcode, B, C, TD)) { 450 if (Value *V = SimplifyBinOp(InnerOpcode, L, R, TD) [all...] |
InstCombineSelect.cpp | 297 return SimplifyBinOp(B->getOpcode(), RepOp, B->getOperand(1), TD, TLI); 299 return SimplifyBinOp(B->getOpcode(), B->getOperand(0), RepOp, TD, TLI); [all...] |
/external/llvm/include/llvm/Analysis/ |
InstructionSimplify.h | 178 /// SimplifyBinOp - Given operands for a BinaryOperator, see if we can 180 Value *SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS,
|