1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-23 19:23:23 +01:00
llvm-mirror/test/Transforms/Inline/AArch64
Haicheng Wu 00cf1cbef6 [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

llvm-svn: 321366
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
gep-cost.ll
inline-target-attr.ll
lit.local.cfg
logical-and-or.ll
phi.ll [InlineCost] Tracking Values through PHI Nodes 2017-12-14 14:36:18 +00:00
select.ll
switch.ll