Haicheng Wu 2c8e36132e [InlineCost] Find more free binary operations ...

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

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@321366 91177308-0d34-0410-b5e6-96231b3b80d8

2017-12-22 17:09:09 +00:00

..

binop.ll

[InlineCost] Find more free binary operations

2017-12-22 17:09:09 +00:00

ext.ll

[TTI] Refine the cost of EXT in getUserCost()

2017-07-15 02:12:16 +00:00

gep-cost.ll

[InlineCost] Add a test case for GEP cost

2017-06-01 19:06:07 +00:00

inline-target-attr.ll

[AArch64] Inline callee if its target-features are a subset of the caller

2017-06-27 22:27:32 +00:00

lit.local.cfg

Recommit "[InlineCost] Use TTI to check if GEP is free." #3

2017-01-20 18:51:22 +00:00

logical-and-or.ll

[InlineCost] Simplify more 'and' and 'or' operations.

2017-08-02 14:40:42 +00:00

phi.ll

[InlineCost] Tracking Values through PHI Nodes

2017-12-14 14:36:18 +00:00

select.ll

[InlineCost] add visitSelectInst()

2017-09-27 14:44:56 +00:00

switch.ll

[InlineCost] Do not take INT_MAX when Cost is negative

2017-06-23 16:12:37 +00:00