forked from OSchip/llvm-project
6d14dfe8f3
Currently, inline cost model considers a binary operator as free only if both its operands are constants. Some simple cases are missing such as a + 0, a - a, etc. This patch modifies visitBinaryOperator() to call SimplifyBinOp() without going through simplifyInstruction() to get rid of the constant restriction. Thus, visitAnd() and visitOr() are not needed. Differential Revision: https://reviews.llvm.org/D41494 llvm-svn: 321366 |
||
|---|---|---|
| .. | ||
| binop.ll | ||
| ext.ll | ||
| gep-cost.ll | ||
| inline-target-attr.ll | ||
| lit.local.cfg | ||
| logical-and-or.ll | ||
| phi.ll | ||
| select.ll | ||
| switch.ll | ||