diff options
| author | Nikita Popov <npopov@redhat.com> | 2022-11-11 17:02:40 +0100 |
|---|---|---|
| committer | Nikita Popov <npopov@redhat.com> | 2022-11-14 10:42:04 +0100 |
| commit | 30982a595da66c4224ca0c2601fbad16ce75a78a (patch) | |
| tree | 27f5fb92e2acab181b313a60c1f8dc9ec6332b68 /llvm/lib/Bitcode/Reader/BitcodeReader.cpp | |
| parent | 7a1bd01493ad873e2c0f6d01d619adddba906968 (diff) | |
| download | llvm-30982a595da66c4224ca0c2601fbad16ce75a78a.zip llvm-30982a595da66c4224ca0c2601fbad16ce75a78a.tar.gz llvm-30982a595da66c4224ca0c2601fbad16ce75a78a.tar.bz2 | |
[ConstraintElimination] Make decompose() infallible
decompose() currently returns a mix of {} and 0 + 1*V on failure.
This changes it to always return the 0 + 1*V form, thus making
decompose() infallible.
This makes the code marginally more powerful, e.g. we now fold
sub_decomp_i80 by treating the constant as a symbolic value.
Differential Revision: https://reviews.llvm.org/D137847
Diffstat (limited to 'llvm/lib/Bitcode/Reader/BitcodeReader.cpp')
0 files changed, 0 insertions, 0 deletions