aboutsummaryrefslogtreecommitdiff
path: root/lib/Bitcode/Writer/BitcodeWriter.cpp
diff options
context:
space:
mode:
authorChris Lattner <sabre@nondot.org>2010-01-10 02:39:31 +0000
committerChris Lattner <sabre@nondot.org>2010-01-10 02:39:31 +0000
commit5324d802835a677888ff020174c9eab5e86d6b15 (patch)
tree8f50f562cd230060f1d19488299366e5de39bc16 /lib/Bitcode/Writer/BitcodeWriter.cpp
parentd26c9e183e56d09f48d7074be4cacce099338316 (diff)
two changes:
1) don't try to optimize a sext or zext that is only used by a trunc, let the trunc get optimized first. This avoids some pointless effort in some common cases since instcombine scans down a block in the first pass. 2) Change the cost model for zext elimination to consider an 'and' cheaper than a zext. This allows us to do it more aggressively, and for the next patch to simplify the code quite a bit. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@93097 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Bitcode/Writer/BitcodeWriter.cpp')
0 files changed, 0 insertions, 0 deletions