projects / platform / upstream / llvm.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: b5ddcb9) | patch
[ConstantRange] Cleanup addWithNoWrap() by just piggybacking on sadd_sat()/uadd_sat()
authorRoman Lebedev <lebedev.ri@gmail.com>
Wed, 6 Nov 2019 22:19:54 +0000 (01:19 +0300)
committerRoman Lebedev <lebedev.ri@gmail.com>
Wed, 6 Nov 2019 22:30:53 +0000 (01:30 +0300)
commit365d729e1075a9391b7520306d8d9beee84d52b5
tree5389bc4621435ba2e5d7ebcf54bb59af70cce8a5tree | snapshot
parentb5ddcb9f1e41b142f89110fc9be78b3c6997f090commit | diff
[ConstantRange] Cleanup addWithNoWrap() by just piggybacking on sadd_sat()/uadd_sat()

As discussed in https://reviews.llvm.org/D69918
that happens to work as intended, and returns empty set if
there is always an overflow because we get lucky with intersection.
Since there's now an explicit test for that, let's prefer cleaner code.
llvm/lib/IR/ConstantRange.cpp diff | blob | history
Domain: System / Toolchain;