diff options
| author | Roman Lebedev <lebedev.ri@gmail.com> | 2019-05-30 16:07:19 +0000 |
|---|---|---|
| committer | Roman Lebedev <lebedev.ri@gmail.com> | 2019-05-30 16:07:19 +0000 |
| commit | 700fdb10706186a464cc86b8c1fae0cd778a449d (patch) | |
| tree | 0ef0f1c08fe3ffa0a4f2a6ab0c6b8cf995787157 /llvm/lib/Bitcode/Reader/BitcodeReader.cpp | |
| parent | 019d270e43967558de00ee4b6d624a2225a2fb77 (diff) | |
[NFC][Codegen] Add better test coverage for potential add/sub constant folding
This adds hopefully-full test coverage for all the possible permutations:
First op is one of:
* x + c1
* x - c1
* c1 - x
Second op is one of:
* + c2
* - c2
* c2 -
And thus 3*3=9 patterns.
Some of them show missed constant-folds.
Without previous patch (the revert), these tests were causing endless
dagcombine loop. I really should have thought about this first :S
llvm-svn: 362110
Diffstat (limited to 'llvm/lib/Bitcode/Reader/BitcodeReader.cpp')
0 files changed, 0 insertions, 0 deletions