diff options
| author | Craig Topper <craig.topper@intel.com> | 2017-06-19 16:23:49 +0000 |
|---|---|---|
| committer | Craig Topper <craig.topper@intel.com> | 2017-06-19 16:23:49 +0000 |
| commit | a7529b68cc1a74d5d7e66db833f174f77f0bb2a7 (patch) | |
| tree | da766140ce3c30c359b6912979051e137b47ed6c /llvm/test/tools/llvm-readobj/codeview-merging-unsorted.test | |
| parent | ef85498e05e62325760b3e6e439984893d9d7c3e (diff) | |
| download | bcm5719-llvm-a7529b68cc1a74d5d7e66db833f174f77f0bb2a7.tar.gz bcm5719-llvm-a7529b68cc1a74d5d7e66db833f174f77f0bb2a7.zip | |
[InstCombine] Cleanup some duplicated one use checks
Summary:
These 4 patterns have the same one use check repeated twice for each. Once without a cast and one with. But the cast has no effect on what method is called.
For the OR case I believe it is always profitable regardless of the number of uses since we'll never increase the instruction count.
For the AND case I believe it is profitable if the pair of xors has one use such that we'll get rid of it completely. Or if the C value is something freely invertible, in which case the not doesn't cost anything.
Reviewers: spatel, majnemer
Reviewed By: spatel
Subscribers: llvm-commits
Differential Revision: https://reviews.llvm.org/D34308
llvm-svn: 305705
Diffstat (limited to 'llvm/test/tools/llvm-readobj/codeview-merging-unsorted.test')
0 files changed, 0 insertions, 0 deletions

