summaryrefslogtreecommitdiffstats
path: root/clang/lib/CodeGen/CGVTT.cpp
diff options
context:
space:
mode:
authorNick Lewycky <nicholas@mxc.ca>2011-03-27 07:30:57 +0000
committerNick Lewycky <nicholas@mxc.ca>2011-03-27 07:30:57 +0000
commit83167df78743fa9a15ca27d78b70f3fb97c94d1e (patch)
tree1947e478e96ca74ae1be47535d1f9336459cf555 /clang/lib/CodeGen/CGVTT.cpp
parent823f3eb14292e73646bc27ed5af5c33078cf05e4 (diff)
downloadbcm5719-llvm-83167df78743fa9a15ca27d78b70f3fb97c94d1e.tar.gz
bcm5719-llvm-83167df78743fa9a15ca27d78b70f3fb97c94d1e.zip
Add a small missed optimization: turn X == C ? X : Y into X == C ? C : Y. This
removes one use of X which helps it pass the many hasOneUse() checks. In my analysis, this turns up very often where X = A >>exact B and that can't be simplified unless X has one use (except by increasing the lifetime of A which is generally a performance loss). llvm-svn: 128373
Diffstat (limited to 'clang/lib/CodeGen/CGVTT.cpp')
0 files changed, 0 insertions, 0 deletions
OpenPOWER on IntegriCloud