forked from OSchip/llvm-project
6ed47bee27
During type promotion, sometimes we convert negative an add with a negative constant into a sub with a positive constant. The loop that performs this transformation has two issues: - it iterates over a set, causing non-determinism. - it breaks, instead of continuing, when it finds the first non-negative operand. Differential Revision: https://reviews.llvm.org/D58452 llvm-svn: 354557 |
||
---|---|---|
.. | ||
arm-cgp-calls.ll | ||
arm-cgp-casts.ll | ||
arm-cgp-icmps.ll | ||
arm-cgp-overflow.ll | ||
arm-cgp-phis-ret.ll | ||
arm-cgp-pointers.ll | ||
arm-cgp-signed-icmps.ll | ||
arm-cgp-signed.ll | ||
arm-cgp-switch.ll |