aboutsummaryrefslogtreecommitdiff
path: root/lib/Bitcode/Reader/BitcodeReader.cpp
diff options
context:
space:
mode:
authorChandler Carruth <chandlerc@gmail.com>2012-12-28 14:23:32 +0000
committerChandler Carruth <chandlerc@gmail.com>2012-12-28 14:23:32 +0000
commitba94204e94ba88f7c897a5a59d1c770b7dc3d04e (patch)
treee05bcd9791e64cfefb8f38b0f5bd936ff7da6c3a /lib/Bitcode/Reader/BitcodeReader.cpp
parente949aa1c91132094a9073c82a8aef729fa8c9eca (diff)
Teach the inline cost analysis about calls that can be simplified and
how to propagate constants through insert and extract value instructions. With the recent improvements to instsimplify, this allows inline cost analysis to constant fold through intrinsic functions, including notably the with.overflow intrinsic math routines which often show up inside of STL abstractions. This is yet another piece in the puzzle of breaking down the code for: void f() { std::vector<int> v; v.push_back(1); } But it still isn't enough. There are a pile of bugs in inline cost still blocking this. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@171195 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Bitcode/Reader/BitcodeReader.cpp')
0 files changed, 0 insertions, 0 deletions